X-Git-Url: http://git.argeo.org/?a=blobdiff_plain;f=org.argeo.cms.ui%2Fsrc%2Forg%2Fargeo%2Fcms%2Fui%2Fjcr%2FJcrTreeContentProvider.java;h=b688e625938386bb7a7e0ad92e2042f733fd60e8;hb=5ec9d72c96b13bf18d702bf01dc2c03b0aee43a4;hp=f45e876f0d4aba7faa6358b867a05e54fdb5b276;hpb=0d7fc7eb22801c253675c7c11da181ad0f4e5704;p=lgpl%2Fargeo-commons.git

diff --git a/org.argeo.cms.ui/src/org/argeo/cms/ui/jcr/JcrTreeContentProvider.java b/org.argeo.cms.ui/src/org/argeo/cms/ui/jcr/JcrTreeContentProvider.java
index f45e876f0..b688e6259 100644
--- a/org.argeo.cms.ui/src/org/argeo/cms/ui/jcr/JcrTreeContentProvider.java
+++ b/org.argeo.cms.ui/src/org/argeo/cms/ui/jcr/JcrTreeContentProvider.java
@@ -38,20 +38,12 @@ public class JcrTreeContentProvider implements ITreeContentProvider {
 	private JcrItemsComparator itemComparator = new JcrItemsComparator();
 
 	/**
-	 * Sends back the first level of the Tree. input element must be a single
-	 * node object
+	 * Sends back the first level of the Tree. input element must be a single node
+	 * object
 	 */
 	public Object[] getElements(Object inputElement) {
-		try {
-			Node rootNode = (Node) inputElement;
-			List<Node> result = new ArrayList<Node>();
-			NodeIterator ni = rootNode.getNodes();
-			while (ni.hasNext())
-				result.add(ni.nextNode());
-			return result.toArray();
-		} catch (RepositoryException re) {
-			throw new EclipseUiException("Unable to retrieve elements for " + inputElement, re);
-		}
+		Node rootNode = (Node) inputElement;
+		return childrenNodes(rootNode);
 	}
 
 	public Object[] getChildren(Object parentElement) {
@@ -82,8 +74,13 @@ public class JcrTreeContentProvider implements ITreeContentProvider {
 		try {
 			List<Node> children = new ArrayList<Node>();
 			NodeIterator nit = parentNode.getNodes();
-			while (nit.hasNext())
-				children.add(nit.nextNode());
+			while (nit.hasNext()) {
+				Node node = nit.nextNode();
+//				if (node.getName().startsWith("rep:") || node.getName().startsWith("jcr:")
+//						|| node.getName().startsWith("nt:"))
+//					continue nodes;
+				children.add(node);
+			}
 			Node[] arr = children.toArray(new Node[0]);
 			Arrays.sort(arr, itemComparator);
 			return arr;