tree.php 5.4 KB

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