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