tree.php 5.7 KB

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