tree.php 5.6 KB

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