2 * Copyright (C) 2007-2012 Argeo GmbH
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
16 package org
.argeo
.jcr
.ui
.explorer
.providers
;
18 import java
.util
.ArrayList
;
19 import java
.util
.Arrays
;
20 import java
.util
.List
;
22 import javax
.jcr
.Node
;
23 import javax
.jcr
.NodeIterator
;
24 import javax
.jcr
.RepositoryException
;
26 import org
.argeo
.ArgeoException
;
27 import org
.argeo
.eclipse
.ui
.jcr
.utils
.JcrItemsComparator
;
28 import org
.eclipse
.jface
.viewers
.ITreeContentProvider
;
29 import org
.eclipse
.jface
.viewers
.Viewer
;
32 * Implementation of the {@code ITreeContentProvider} in order to display a
33 * single JCR node and its children in a tree like structure
36 public class SingleNodeAsTreeContentProvider
implements ITreeContentProvider
{
37 // private Node rootNode;
38 private JcrItemsComparator itemComparator
= new JcrItemsComparator();
41 * Sends back the first level of the Tree. input element must be a single
44 public Object
[] getElements(Object inputElement
) {
46 Node rootNode
= (Node
) inputElement
;
47 List
<Node
> result
= new ArrayList
<Node
>();
48 NodeIterator ni
= rootNode
.getNodes();
49 while (ni
.hasNext()) {
50 result
.add(ni
.nextNode());
53 return result
.toArray();
54 } catch (RepositoryException re
) {
55 throw new ArgeoException(
56 "Unexpected error while getting child nodes for children editor page ",
61 public Object
[] getChildren(Object parentElement
) {
62 return childrenNodes((Node
) parentElement
);
65 public Object
getParent(Object element
) {
67 Node node
= (Node
) element
;
68 if (!node
.getPath().equals("/"))
69 return node
.getParent();
72 } catch (RepositoryException e
) {
77 public boolean hasChildren(Object element
) {
79 return ((Node
) element
).hasNodes();
80 } catch (RepositoryException e
) {
81 throw new ArgeoException("Cannot check children of " + element
, e
);
85 public void dispose() {
88 public void inputChanged(Viewer viewer
, Object oldInput
, Object newInput
) {
91 protected Object
[] childrenNodes(Node parentNode
) {
93 List
<Node
> children
= new ArrayList
<Node
>();
94 NodeIterator nit
= parentNode
.getNodes();
95 while (nit
.hasNext()) {
96 Node node
= nit
.nextNode();
99 Node
[] arr
= children
.toArray(new Node
[children
.size()]);
100 Arrays
.sort(arr
, itemComparator
);
102 } catch (RepositoryException e
) {
103 throw new ArgeoException("Cannot list children of " + parentNode
, e
);