1 package org
.argeo
.jcr
.ui
.explorer
.providers
;
3 import java
.util
.ArrayList
;
4 import java
.util
.Arrays
;
8 import javax
.jcr
.NodeIterator
;
9 import javax
.jcr
.RepositoryException
;
11 import org
.argeo
.ArgeoException
;
12 import org
.argeo
.jcr
.ui
.explorer
.browser
.ItemComparator
;
13 import org
.eclipse
.jface
.viewers
.ITreeContentProvider
;
14 import org
.eclipse
.jface
.viewers
.Viewer
;
17 * Implementation of the {@code ITreeContentProvider} in order to display a
18 * single JCR node and its children in a tree like structure
21 public class SingleNodeAsTreeContentProvider
implements ITreeContentProvider
{
22 // private Node rootNode;
23 private ItemComparator itemComparator
= new ItemComparator();
26 * Sends back the first level of the Tree. input element must be a single
29 public Object
[] getElements(Object inputElement
) {
31 Node rootNode
= (Node
) inputElement
;
32 List
<Node
> result
= new ArrayList
<Node
>();
33 NodeIterator ni
= rootNode
.getNodes();
34 while (ni
.hasNext()) {
35 result
.add(ni
.nextNode());
38 return result
.toArray();
39 } catch (RepositoryException re
) {
40 throw new ArgeoException(
41 "Unexpected error while getting child nodes for children editor page ",
46 public Object
[] getChildren(Object parentElement
) {
47 return childrenNodes((Node
) parentElement
);
50 public Object
getParent(Object element
) {
52 Node node
= (Node
) element
;
53 if (!node
.getPath().equals("/"))
54 return node
.getParent();
57 } catch (RepositoryException e
) {
62 public boolean hasChildren(Object element
) {
64 return ((Node
) element
).hasNodes();
65 } catch (RepositoryException e
) {
66 throw new ArgeoException("Cannot check children of " + element
, e
);
70 public void dispose() {
73 public void inputChanged(Viewer viewer
, Object oldInput
, Object newInput
) {
76 protected Object
[] childrenNodes(Node parentNode
) {
78 List
<Node
> children
= new ArrayList
<Node
>();
79 NodeIterator nit
= parentNode
.getNodes();
80 while (nit
.hasNext()) {
81 Node node
= nit
.nextNode();
84 Node
[] arr
= children
.toArray(new Node
[children
.size()]);
85 Arrays
.sort(arr
, itemComparator
);
87 } catch (RepositoryException e
) {
88 throw new ArgeoException("Cannot list children of " + parentNode
, e
);