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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
| package jtreetable;
import java.awt.BorderLayout;
import java.awt.EventQueue;
import java.awt.event.ActionEvent;
import java.util.Random;
import java.util.Set;
import java.util.TreeSet;
import javax.swing.AbstractAction;
import javax.swing.JFrame;
import javax.swing.JOptionPane;
import javax.swing.JScrollPane;
import javax.swing.JToolBar;
import javax.swing.SwingUtilities;
import javax.swing.UIManager;
import javax.swing.tree.DefaultMutableTreeNode;
import javax.swing.tree.DefaultTreeCellRenderer;
import javax.swing.tree.TreeNode;
import javax.swing.tree.TreePath;
import org.jdesktop.swingx.JXTable;
import org.jdesktop.swingx.JXTreeTable;
import org.jdesktop.swingx.treetable.DefaultTreeTableModel;
import org.jdesktop.swingx.treetable.TreeTableNode;
/** package importées **/
/**
* Test class of the basics of JXTreeTable with the DefaultTreeTableModel and DefaultMutableTreeNodes.
* Everything in one class to get a simple runnable example.
* see https://swingx.dev.java.net/
* @author jorgen.rapp
*
*/
public class TestTreeTable extends JXTable{
private JXTreeTable treeTable;
public TestTreeTable() {
}
public static void main(String[] args) {
try {
UIManager.setLookAndFeel(UIManager.getSystemLookAndFeelClassName());
} catch (Exception e) {
e.printStackTrace();
}
/**** CREATION DE TREE ****/
TestTreeTable test = new TestTreeTable();
test.create();
}
/**
* creates the demo on the event dispatch thread.
*
*/
public void create() {
Runnable r = new Runnable()
{
public void run() {
JFrame f = new JFrame("Exemple de JXTreeTable");
f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
JToolBar tb = new JToolBar();
f.add(tb, BorderLayout.NORTH);
tb.add(new InsertNodeAction());
tb.add(new DeleteNodeAction());
PersonTreeTableModel personTreeTableModel = generateTestModel();
treeTable = new JXTreeTable(personTreeTableModel);
treeTable.setEditable(true);
treeTable.setTreeCellRenderer(new DefaultTreeCellRenderer() {
public java.awt.Component getTreeCellRendererComponent(
javax.swing.JTree tree, Object value, boolean sel,
boolean expanded, boolean leaf, int row,
boolean hasFocus) {
super.getTreeCellRendererComponent(tree, value, sel,
expanded, leaf, row, hasFocus);
if (value instanceof DefaultMutableTreeNode) {
DefaultMutableTreeNode node = (DefaultMutableTreeNode) value;
Person person = (Person) node
.getUserObject();
setText(person.getLastName());
if (node.isLeaf()
&& node.getParent() == tree.getModel()
.getRoot()) {
setIcon(getDefaultClosedIcon());
}
}
return this;
};
});
f.add(new JScrollPane(treeTable));
f.setSize(300, 300);
f.setVisible(true);
}
};
EventQueue.invokeLater(r);
}
/**
* Inserts a new node, the kind and name depends on the selected node.
*
*/
class InsertNodeAction extends AbstractAction {
InsertNodeAction() {
super("Insert");
}
public void actionPerformed(ActionEvent e) {
TreePath selp = treeTable.getTreeSelectionModel().getSelectionPath();
DefaultMutableTreeNode insertAtNode;
String famName = null;
boolean isFamilyNode = false;
if (selp == null) {
//nothing selected, create a new family
insertAtNode = (DefaultMutableTreeNode) treeTable
.getTreeTableModel().getRoot();
famName = JOptionPane.showInputDialog(SwingUtilities.windowForComponent(treeTable),"What's the new Family name?");
isFamilyNode = true;
} else {
insertAtNode = (DefaultMutableTreeNode) selp
.getLastPathComponent();
// pick the closest family node, in this case adding a child
// to a PersonNode doesn't make sense.
if (insertAtNode.isLeaf()
&& !(insertAtNode.getParent() == treeTable
.getTreeTableModel().getRoot())) {
insertAtNode = (DefaultMutableTreeNode) insertAtNode
.getParent();
isFamilyNode = false;
}
famName = ((Person) insertAtNode.getUserObject()).getLastName();
}
Person nuObj = generateTestPerson(famName, isFamilyNode);
DefaultMutableTreeNode nuNode = new DefaultMutableTreeNode(nuObj);
insertAtNode.add(nuNode);
int idx = insertAtNode.getIndex(nuNode);
int[] childIndices = new int[1];
childIndices[0] = idx;
//((TreeTableModel) treeTable.getTreeTableModel()).nodesWereInserted(insertAtNode, childIndices);
treeTable.expandPath(new TreePath(insertAtNode.getPath()));
treeTable.getTreeSelectionModel().setSelectionPath(new TreePath(nuNode.getPath()));
}
}
/**
* Deletes a node after one is selected.
*
*/
class DeleteNodeAction extends AbstractAction {
DeleteNodeAction() {
super("Delete");
}
public void actionPerformed(ActionEvent e) {
TreePath selp = treeTable.getTreeSelectionModel().getSelectionPath();
if (selp == null) {
JOptionPane.showMessageDialog(treeTable,
"Must select a node in the tree before you can delete", "Error",
JOptionPane.ERROR_MESSAGE);
} else {
DefaultMutableTreeNode toBeDeletedNode = (DefaultMutableTreeNode) selp
.getLastPathComponent();
// find out which node to select next
DefaultMutableTreeNode nextToBeSelected = toBeDeletedNode
.getNextSibling();
if (nextToBeSelected == null) {
nextToBeSelected = toBeDeletedNode.getPreviousSibling();
if (nextToBeSelected == null) {
nextToBeSelected = (DefaultMutableTreeNode) toBeDeletedNode
.getParent();
}
}
DefaultMutableTreeNode parentNode = (DefaultMutableTreeNode) toBeDeletedNode
.getParent();
int idx = parentNode.getIndex(toBeDeletedNode);
parentNode.remove(toBeDeletedNode);
int[] childIndices = new int[1];
childIndices[0] = idx;
Object[] delNodes = new Object[1];
delNodes[0] = toBeDeletedNode;
// ((DefaultTreeTableModel) treeTable.getTreeTableModel()).nodesWereRemoved(parentNode, childIndices, delNodes);
treeTable.getTreeSelectionModel().setSelectionPath(
new TreePath(nextToBeSelected.getPath()));
}
}
}
/**
* The TreeTableModelshould be top level class really.
*
* @author jorgen.rapp
*
*/
class PersonTreeTableModel extends DefaultTreeTableModel {
private static final int LAST = 0;
private static final int FIRST = 1;
private static final int MIDDLE = 2;
private static final int PHONE = 3;
public PersonTreeTableModel(TreeNode node) {
super((TreeTableNode)node);
}
public int getColumnCount() {
return 4;
}
/**
* Returns which object is displayed in this column.
*/
public Object getValueAt(Object node, int column) {
Object res = "n/a";
if (node instanceof DefaultMutableTreeNode) {
DefaultMutableTreeNode defNode = (DefaultMutableTreeNode) node;
if (defNode.getUserObject() instanceof Person) {
Person person = (Person) defNode.getUserObject();
switch (column) {
case FIRST:
res = person.getFirstName();
break;
case MIDDLE:
res = person.getMiddleName();
break;
case LAST:
res = person.getLastName();
break;
case PHONE:
res = person.getPhoneNbr();
break;
}
}
}
return res;
}
/**
* What the TableHeader displays when the Table is in a JScrollPane.
*/
public String getColumnName(int column) {
String res = "";
switch (column) {
case FIRST:
res = "First";
break;
case MIDDLE:
res = "Middle";
break;
case LAST:
res = "Last";
break;
case PHONE:
res = "Phone";
break;
}
return res;
}
/**
* Tells if a column can be edited.
*/
public boolean isCellEditable(Object node, int column) {
return true;
}
/**
* Called when done editing a cell.
*/
public void setValueAt(Object value, Object node, int column) {
if (node instanceof DefaultMutableTreeNode) {
DefaultMutableTreeNode defNode = (DefaultMutableTreeNode) node;
if (defNode.getUserObject() instanceof Person) {
Person person = (Person) defNode.getUserObject();
switch (column) {
case FIRST:
person.setFirstName(value.toString());
break;
case MIDDLE:
person.setMiddleName(value.toString());
break;
case LAST:
person.setLastName(value.toString());
break;
case PHONE:
person.setPhoneNbr(value.toString());
break;
}
}
}
}
}
/**
* Generates a PersonTreeTableModel of fake persons.
* @return
*/
public PersonTreeTableModel generateTestModel() {
Set<Person> list = new TreeSet<Person>();
// gen test persons
for (int i = 0; i < 20; i++) {
list.add(generateTestPerson(null, false));
}
String prevLast = "";
String currentLast = "";
DefaultMutableTreeNode currentNameNode = null;
// shouldn't be visible
DefaultMutableTreeNode aRoot = new DefaultMutableTreeNode(
new Person());
for (Person testPerson : list) {
currentLast = testPerson.getLastName();
if (currentLast.equals(prevLast)) {
currentNameNode.add(new DefaultMutableTreeNode(testPerson));
} else {
if (currentNameNode != null) {
aRoot.add(currentNameNode);
}
currentNameNode = new DefaultMutableTreeNode(new Person("",
"", testPerson.getLastName(), ""));
currentNameNode.add(new DefaultMutableTreeNode(testPerson));
prevLast = currentLast;
}
}
return new PersonTreeTableModel(aRoot);
}
private static String[] FIRST_NAMES = { "Amy", "Bob", "Cedric", "Dan",
"Erica", "Fred" };
private static String[] LAST_NAMES = { "Anders", "Blagg", "Caesar",
"Dickens", "Evans", "Foo" };
/**
* @return a String of U.S. phone format (nnn)nnn-nnnn
*/
private static String genPhone() {
Random rnd = new Random();
StringBuilder sb = new StringBuilder();
for (int i = 0; i < 10; i++) {
sb.append(rnd.nextInt(10));
}
sb.insert(6, '-');
sb.insert(3, ')');
sb.insert(0, '(');
return sb.toString();
}
private static Random rnd = new Random();
/**
*
* @param familyName if null it will be generated
* @param isFamilyNode if true don't generate first, middle, phone.
* @return a Person object
*/
public/* static */Person generateTestPerson(String familyName,
boolean isFamilyNode) {
int firstN = rnd.nextInt(FIRST_NAMES.length);
int middleN = rnd.nextInt(FIRST_NAMES.length);
int lastN = rnd.nextInt(LAST_NAMES.length);
if (isFamilyNode) {
return new Person("","",
(familyName != null ? familyName: LAST_NAMES[lastN]), "");
} else {
return new Person(FIRST_NAMES[firstN], FIRST_NAMES[middleN]
.substring(0, 1), (familyName != null ? familyName
: LAST_NAMES[lastN]), genPhone());
}
}
/**
* The userObject of the node.
* Top level class.
*/
class Person implements Comparable<Person> {
private String firstName = "";
private String middleName = "";
private String lastName = "";
private String phoneNbr = "";
public Person() {
}
public Person(String firstName, String middleName, String lastName,
String phoneNbr) {
super();
this.firstName = firstName;
this.middleName = middleName;
this.lastName = lastName;
this.phoneNbr = phoneNbr;
}
public String getFirstName() {
return firstName;
}
public void setFirstName(String firstName) {
this.firstName = firstName;
}
public String getLastName() {
return lastName;
}
public void setLastName(String lastName) {
this.lastName = lastName;
}
public String getMiddleName() {
return middleName;
}
public void setMiddleName(String middleName) {
this.middleName = middleName;
}
public String getPhoneNbr() {
return phoneNbr;
}
public void setPhoneNbr(String phoneNbr) {
this.phoneNbr = phoneNbr;
}
@Override
public String toString() {
return firstName + " " + middleName + ". " + lastName + "\t"
+ phoneNbr;
}
@Override
public int hashCode() {
final int PRIME = 31;
int result = 1;
result = PRIME * result
+ ((firstName == null) ? 0 : firstName.hashCode());
result = PRIME * result
+ ((middleName == null) ? 0 : middleName.hashCode());
result = PRIME * result
+ ((lastName == null) ? 0 : lastName.hashCode());
result = PRIME * result
+ ((phoneNbr == null) ? 0 : phoneNbr.hashCode());
return result;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
final Person other = (Person) obj;
if (firstName == null) {
if (other.firstName != null)
return false;
} else if (!firstName.equals(other.firstName))
return false;
if (middleName == null) {
if (other.middleName != null)
return false;
} else if (!middleName.equals(other.middleName))
return false;
if (lastName == null) {
if (other.lastName != null)
return false;
} else if (!lastName.equals(other.lastName))
return false;
if (phoneNbr == null) {
if (other.phoneNbr != null)
return false;
} else if (!phoneNbr.equals(other.phoneNbr))
return false;
return true;
}
public int compareTo(Person otherObject) {
int res = 0;
res = otherObject.getLastName().compareTo(getLastName());
if (0 == res) {
res = otherObject.getFirstName().compareTo(getFirstName());
}
if (0 == res) {
res = otherObject.getMiddleName().compareTo(getMiddleName());
}
return res;
}
}
} |
JXTREE TABLE son manipulation
Répondre avec citation
Partager