tree.php 5.6 KB

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