ludc
2024-09-14 36c2449aec5b51e5ed4e5c6841154b746060e09a
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
package com.vci.client.ui.tree;
 
import java.util.ArrayList;
import java.util.Stack;
 
import javax.swing.tree.DefaultTreeSelectionModel;
import javax.swing.tree.TreeModel;
import javax.swing.tree.TreePath;
import javax.swing.tree.TreeSelectionModel;
 
public class CheckBoxTreeSelectionModel extends DefaultTreeSelectionModel {
 
    /**
     * 
     */
    private static final long serialVersionUID = -3647943660639834124L;
 
    private TreeModel model;
    
    public CheckBoxTreeSelectionModel(TreeModel model) {
        this.model = model;
        setSelectionMode(TreeSelectionModel.DISCONTIGUOUS_TREE_SELECTION); 
    }
    
    /**
     * tests whether there is any unselected node in the subtree of given path
     * 
     * @param path
     * @return
     */
    public boolean isPartiallySelected(TreePath path){ 
        if(isPathSelected(path, true)) {
            return false; 
        }
        TreePath[] selectionPaths = getSelectionPaths(); 
        if(selectionPaths == null) {
            return false; 
        }
        for(int j = 0; j < selectionPaths.length; j++){ 
            if(isDescendant(selectionPaths[j], path)) {
                return true; 
            }
        } 
        return false; 
    }
    
    /**
     * tells whether given path is selected. 
     * if dig is true, then a path is assumed to be selected, if 
     * one of its ancestor is selected. 
     * @param path
     * @param dig
     * @return
     */
    public boolean isPathSelected(TreePath path, boolean dig){ 
        if (!dig) {
            return super.isPathSelected(path); 
        }
        while(path!=null && !super.isPathSelected(path)) {
            path = path.getParentPath(); 
        }
        return path != null; 
    }
    
    /**
     * is path1 descendant of path2
     * 
     * @param path1
     * @param path2
     * @return
     */
    private boolean isDescendant(TreePath path1, TreePath path2){ 
        Object obj1[] = path1.getPath(); 
        Object obj2[] = path2.getPath(); 
        for(int i = 0; i<obj2.length; i++){ 
            if(obj1[i] != obj2[i]) {
                return false; 
            }
        } 
        return true; 
    }
    
    public void addSelectionPaths(TreePath[] paths){ 
        // unselect all descendants of paths[] 
        for(int i = 0; i<paths.length; i++){ 
            TreePath path = paths[i]; 
            TreePath[] selectionPaths = getSelectionPaths(); 
            if(selectionPaths == null) {
                break; 
            }
            ArrayList toBeRemoved = new ArrayList(); 
            for(int j = 0; j < selectionPaths.length; j++){ 
                if(isDescendant(selectionPaths[j], path)) {
                    toBeRemoved.add(selectionPaths[j]); 
                }
            } 
            super.removeSelectionPaths((TreePath[])toBeRemoved.toArray(new TreePath[0])); 
        } 
 
        // if all siblings are selected then unselect them and select parent recursively 
        // otherwize just select that path. 
        for(int i = 0; i < paths.length; i++){ 
            TreePath path = paths[i]; 
            TreePath temp = null; 
            while(areSiblingsSelected(path)){ 
                temp = path; 
                if(path.getParentPath()==null) {
                    break; 
                }
                path = path.getParentPath(); 
            } 
            if(temp!=null){ 
                if(temp.getParentPath()!=null) {
                    addSelectionPath(temp.getParentPath()); 
                } else { 
                    if(!isSelectionEmpty()) {
                        removeSelectionPaths(getSelectionPaths()); 
                    }
                    super.addSelectionPaths(new TreePath[]{temp}); 
                } 
            } else {
                super.addSelectionPaths(new TreePath[]{ path}); 
            }
        } 
    }
    
    /**
     * tells whether all siblings of given path are selected. 
     * @param path
     * @return
     */
    private boolean areSiblingsSelected(TreePath path){ 
        TreePath parent = path.getParentPath(); 
        if(parent==null) {
            return true; 
        }
        Object node = path.getLastPathComponent(); 
        Object parentNode = parent.getLastPathComponent(); 
 
        int childCount = model.getChildCount(parentNode); 
        for(int i = 0; i<childCount; i++){ 
            Object childNode = model.getChild(parentNode, i); 
            if(childNode == node) {
                continue; 
            }
            if(!isPathSelected(parent.pathByAddingChild(childNode))) {
                return false; 
            }
        } 
        return true; 
    }
    
    public void removeSelectionPaths(TreePath[] paths){ 
        for(int i = 0; i<paths.length; i++){ 
            TreePath path = paths[i]; 
            if(path.getPathCount() == 1) {
                super.removeSelectionPaths(new TreePath[]{ path}); 
            } else {
                toggleRemoveSelection(path); 
            }
        }
    }
    
    /**
     * if any ancestor node of given path is selected then unselect it 
     * and selection all its descendants except given path and descendants. 
     * otherwise just unselect the given path
     * 
     * @param path
     */
    private void toggleRemoveSelection(TreePath path){ 
        Stack stack = new Stack(); 
        TreePath parent = path.getParentPath(); 
        while(parent!=null && !isPathSelected(parent)){ 
            stack.push(parent); 
            parent = parent.getParentPath(); 
        } 
        if(parent!=null) {
            stack.push(parent); 
        } else { 
            super.removeSelectionPaths(new TreePath[]{path}); 
            return; 
        } 
 
        while(!stack.isEmpty()){ 
            TreePath temp = (TreePath)stack.pop(); 
            TreePath peekPath = stack.isEmpty() ? path : (TreePath)stack.peek(); 
            Object node = temp.getLastPathComponent(); 
            Object peekNode = peekPath.getLastPathComponent(); 
            int childCount = model.getChildCount(node); 
            for(int i = 0; i < childCount; i++){ 
                Object childNode = model.getChild(node, i); 
                if(childNode != peekNode) {
                    super.addSelectionPaths(new TreePath[]{temp.pathByAddingChild(childNode)}); 
                }
            } 
        }
        super.removeSelectionPaths(new TreePath[]{parent}); 
    }
}