tree.php 3.5 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889
  1. <?
  2. $tree_php = true;
  3. if (!isset($imap_php))
  4. include("../functions/imap.php");
  5. function findParentForChild($value, $treeIndexToStart, $tree) {
  6. if ((isset($tree[$treeIndexToStart])) && (strstr($value, $tree[$treeIndexToStart]["value"]))) {
  7. if ($tree[$treeIndexToStart]["doIHaveChildren"]) {
  8. for ($i=0;$i< count($tree[$treeIndexToStart]["subNodes"]);$i++) {
  9. $result = findParentForChild($value, $tree[$treeIndexToStart]["subNodes"][$i], $tree);
  10. if ($result > -1)
  11. return $result;
  12. }
  13. return $treeIndexToStart;
  14. } else
  15. return $treeIndexToStart;
  16. } else {
  17. return -1;
  18. }
  19. }
  20. function addChildNodeToTree($comparisonValue, $value, &$tree) {
  21. $parentNode = findParentForChild($comparisonValue, 0, $tree);
  22. // create a new subNode
  23. $newNodeIndex = count($tree);
  24. $tree[$newNodeIndex]["value"] = $value;
  25. $tree[$newNodeIndex]["doIHaveChildren"] = false;
  26. if ($tree[$parentNode]["doIHaveChildren"] == false) {
  27. // make sure the parent knows it has children
  28. $tree[$parentNode]["subNodes"][0] = $newNodeIndex;
  29. $tree[$parentNode]["doIHaveChildren"] = true;
  30. } else {
  31. $nextSubNode = count($tree[$parentNode]["subNodes"]);
  32. // make sure the parent knows it has children
  33. $tree[$parentNode]["subNodes"][$nextSubNode] = $newNodeIndex;
  34. }
  35. }
  36. function walkTreeInPreOrderDeleteFolders($index, $imap_stream, $tree) {
  37. if ($tree[$index]["doIHaveChildren"]) {
  38. for ($j = 0; $j < count($tree[$index]["subNodes"]); $j++) {
  39. walkTreeInPreOrderDeleteFolders($tree[$index]["subNodes"][$j], $imap_stream, $tree);
  40. }
  41. sqimap_mailbox_delete($imap_stream, $tree[$index]["value"]);
  42. } else {
  43. sqimap_mailbox_delete($imap_stream, $tree[$index]["value"]);
  44. }
  45. }
  46. function walkTreeInPostOrderCreatingFoldersUnderTrash($index, $imap_stream, $tree, $dm, $topFolderName) {
  47. global $trash_folder;
  48. $position = strrpos($topFolderName, $dm) + 1;
  49. $subFolderName = substr($tree[$index]["value"], $position);
  50. if ($tree[$index]["doIHaveChildren"]) {
  51. sqimap_mailbox_create($imap_stream, $trash_folder . $dm . $subFolderName, "");
  52. sqimap_mailbox_select($imap_stream, $tree[$index]["value"]);
  53. $messageCount = sqimap_get_num_messages($imap_stream, $tree[$index]["value"]);
  54. if ($messageCount > 0)
  55. sqimap_messages_copy($imap_stream, 1, $messageCount, $trash_folder . $dm . $subFolderName);
  56. for ($j = 0;$j < count($tree[$index]["subNodes"]); $j++)
  57. walkTreeInPostOrderCreatingFoldersUnderTrash($tree[$index]["subNodes"][$j], $imap_stream, $tree, $dm, $topFolderName);
  58. } else {
  59. sqimap_mailbox_create($imap_stream, $trash_folder . $dm . $subFolderName, "");
  60. sqimap_mailbox_select($imap_stream, $tree[$index]["value"]);
  61. $messageCount = sqimap_get_num_messages($imap_stream, $tree[$index]["value"]);
  62. if ($messageCount > 0)
  63. sqimap_messages_copy($imap_stream, 1, $messageCount, $trash_folder . $dm . $subFolderName);
  64. }
  65. }
  66. function simpleWalkTreePre($index, $tree) {
  67. if ($tree[$index]["doIHaveChildren"]) {
  68. for ($j = 0; $j < count($tree[$index]["subNodes"]); $j++) {
  69. simpleWalkTreePre($tree[$index]["subNodes"][$j], $tree);
  70. }
  71. echo $tree[$index]["value"] . "<br>";
  72. } else {
  73. echo $tree[$index]["value"] . "<br>";
  74. }
  75. }
  76. ?>