tree.php 5.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130
  1. <?php
  2. /* $Id$ */
  3. $tree_php = true;
  4. if (!isset($imap_php))
  5. include('../functions/imap.php');
  6. if (!isset($config_php))
  7. include('../config/config.php');
  8. // Recursive function to find the correct parent for a new node
  9. function findParentForChild($value, $treeIndexToStart, $tree) {
  10. // is $value in $tree[$treeIndexToStart]['value']
  11. if ((isset($tree[$treeIndexToStart])) && (strstr($value, $tree[$treeIndexToStart]['value']))) {
  12. // do I have children, if not then must be a childnode of the current node
  13. if ($tree[$treeIndexToStart]['doIHaveChildren']) {
  14. // loop through each subNode checking to see if we are a subNode of one of them
  15. for ($i=0;$i< count($tree[$treeIndexToStart]['subNodes']);$i++) {
  16. $result = findParentForChild($value, $tree[$treeIndexToStart]['subNodes'][$i], $tree);
  17. if ($result > -1)
  18. return $result;
  19. }
  20. // if we aren't a child of one of the subNodes, must be a child of current node
  21. return $treeIndexToStart;
  22. } else
  23. return $treeIndexToStart;
  24. } else {
  25. // we aren't a child of this node at all
  26. return -1;
  27. }
  28. }
  29. function addChildNodeToTree($comparisonValue, $value, &$tree) {
  30. $parentNode = findParentForChild($comparisonValue, 0, $tree);
  31. // create a new subNode
  32. $newNodeIndex = count($tree);
  33. $tree[$newNodeIndex]['value'] = $value;
  34. $tree[$newNodeIndex]['doIHaveChildren'] = false;
  35. if ($tree[$parentNode]['doIHaveChildren'] == false) {
  36. // make sure the parent knows it has children
  37. $tree[$parentNode]['subNodes'][0] = $newNodeIndex;
  38. $tree[$parentNode]['doIHaveChildren'] = true;
  39. } else {
  40. $nextSubNode = count($tree[$parentNode]['subNodes']);
  41. // make sure the parent knows it has children
  42. $tree[$parentNode]['subNodes'][$nextSubNode] = $newNodeIndex;
  43. }
  44. }
  45. function walkTreeInPreOrderEmptyTrash($index, $imap_stream, $tree) {
  46. global $trash_folder;
  47. if ($tree[$index]['doIHaveChildren']) {
  48. for ($j = 0; $j < count($tree[$index]['subNodes']); $j++) {
  49. walkTreeInPreOrderEmptyTrash($tree[$index]['subNodes'][$j], $imap_stream, $tree);
  50. }
  51. if ($tree[$index]['value'] != $trash_folder) {
  52. sqimap_mailbox_delete($imap_stream, $tree[$index]['value']);
  53. } else {
  54. $numMessages = sqimap_get_num_messages($imap_stream, $trash_folder);
  55. if ($numMessages > 0) {
  56. sqimap_mailbox_select($imap_stream, $trash_folder);
  57. sqimap_messages_flag ($imap_stream, 1, $numMessages, 'Deleted');
  58. sqimap_mailbox_expunge($imap_stream, $trash_folder, true);
  59. }
  60. }
  61. } else {
  62. if ($tree[$index]['value'] != $trash_folder) {
  63. sqimap_mailbox_delete($imap_stream, $tree[$index]['value']);
  64. } else {
  65. $numMessages = sqimap_get_num_messages($imap_stream, $trash_folder);
  66. if ($numMessages > 0) {
  67. sqimap_mailbox_select($imap_stream, $trash_folder);
  68. sqimap_messages_flag ($imap_stream, 1, $numMessages, 'Deleted');
  69. sqimap_mailbox_expunge($imap_stream, $trash_folder, true);
  70. }
  71. }
  72. }
  73. }
  74. function walkTreeInPreOrderDeleteFolders($index, $imap_stream, $tree) {
  75. if ($tree[$index]['doIHaveChildren']) {
  76. for ($j = 0; $j < count($tree[$index]['subNodes']); $j++) {
  77. walkTreeInPreOrderDeleteFolders($tree[$index]['subNodes'][$j], $imap_stream, $tree);
  78. }
  79. sqimap_mailbox_delete($imap_stream, $tree[$index]['value']);
  80. } else {
  81. sqimap_mailbox_delete($imap_stream, $tree[$index]['value']);
  82. }
  83. }
  84. function walkTreeInPostOrderCreatingFoldersUnderTrash($index, $imap_stream, $tree, $dm, $topFolderName) {
  85. global $trash_folder;
  86. $position = strrpos($topFolderName, $dm) + 1;
  87. $subFolderName = substr($tree[$index]['value'], $position);
  88. if ($tree[$index]['doIHaveChildren']) {
  89. sqimap_mailbox_create($imap_stream, $trash_folder . $dm . $subFolderName, "");
  90. sqimap_mailbox_select($imap_stream, $tree[$index]['value']);
  91. $messageCount = sqimap_get_num_messages($imap_stream, $tree[$index]['value']);
  92. if ($messageCount > 0)
  93. sqimap_messages_copy($imap_stream, 1, $messageCount, $trash_folder . $dm . $subFolderName);
  94. for ($j = 0;$j < count($tree[$index]['subNodes']); $j++)
  95. walkTreeInPostOrderCreatingFoldersUnderTrash($tree[$index]['subNodes'][$j], $imap_stream, $tree, $dm, $topFolderName);
  96. } else {
  97. sqimap_mailbox_create($imap_stream, $trash_folder . $dm . $subFolderName, '');
  98. sqimap_mailbox_select($imap_stream, $tree[$index]['value']);
  99. $messageCount = sqimap_get_num_messages($imap_stream, $tree[$index]['value']);
  100. if ($messageCount > 0)
  101. sqimap_messages_copy($imap_stream, 1, $messageCount, $trash_folder . $dm . $subFolderName);
  102. }
  103. }
  104. function simpleWalkTreePre($index, $tree) {
  105. if ($tree[$index]['doIHaveChildren']) {
  106. for ($j = 0; $j < count($tree[$index]['subNodes']); $j++) {
  107. simpleWalkTreePre($tree[$index]['subNodes'][$j], $tree);
  108. }
  109. echo $tree[$index]['value'] . '<br>';
  110. } else {
  111. echo $tree[$index]['value'] . '<br>';
  112. }
  113. }
  114. ?>