eclipse/runtime/org.argeo.eclipse.ui.jcr/src/main/java/org/argeo/eclipse/ui/jcr/browser/NodeContentProvider.java

   1 package org.argeo.eclipse.ui.jcr.browser;
   2
   3 import java.util.ArrayList;
   4 import java.util.Arrays;
   5 import java.util.List;
   6 import java.util.Map;
   7
   8 import javax.jcr.Node;
   9 import javax.jcr.NodeIterator;
  10 import javax.jcr.Repository;
  11 import javax.jcr.RepositoryException;
  12 import javax.jcr.Session;
  13
  14 import org.argeo.ArgeoException;
  15 import org.argeo.jcr.JcrUtils;
  16 import org.argeo.jcr.RepositoryRegister;
  17 import org.eclipse.jface.viewers.ITreeContentProvider;
  18 import org.eclipse.jface.viewers.Viewer;
  19
  20 public class NodeContentProvider implements ITreeContentProvider {
  21         private ItemComparator itemComparator = new ItemComparator();
  22
  23         private RepositoryRegister repositoryRegister;
  24         private Session userSession;
  25
  26         public NodeContentProvider(Session userSession,
  27                         RepositoryRegister repositoryRegister) {
  28                 this.userSession = userSession;
  29                 this.repositoryRegister = repositoryRegister;
  30         }
  31
  32         /** Sends back the first level of the Tree. Independent from inputElement that can be null*/
  33         public Object[] getElements(Object inputElement) {
  34                 List<Object> objs = new ArrayList<Object>();
  35                 if (userSession != null)
  36                         objs.add(JcrUtils.getUserHome(userSession));
  37                 if (repositoryRegister != null)
  38                         objs.add(repositoryRegister);
  39                 return objs.toArray();
  40         }
  41
  42         public Object[] getChildren(Object parentElement) {
  43                 if (parentElement instanceof Node) {
  44                         return childrenNodes((Node) parentElement);
  45                 } else if (parentElement instanceof RepositoryNode) {
  46                         return ((RepositoryNode) parentElement).getChildren();
  47                 } else if (parentElement instanceof WorkspaceNode) {
  48                         Session session = ((WorkspaceNode) parentElement).getSession();
  49                         if (session == null)
  50                                 return new Object[0];
  51
  52                         try {
  53                                 return childrenNodes(session.getRootNode());
  54                         } catch (RepositoryException e) {
  55                                 throw new ArgeoException("Cannot retrieve root node of "
  56                                                 + session, e);
  57                         }
  58                 } else if (parentElement instanceof RepositoryRegister) {
  59                         RepositoryRegister repositoryRegister = (RepositoryRegister) parentElement;
  60                         List<RepositoryNode> nodes = new ArrayList<RepositoryNode>();
  61                         Map<String, Repository> repositories = repositoryRegister
  62                                         .getRepositories();
  63                         for (String name : repositories.keySet()) {
  64                                 nodes.add(new RepositoryNode(name, repositories.get(name)));
  65                         }
  66                         return nodes.toArray();
  67                 } else {
  68                         return new Object[0];
  69                 }
  70         }
  71
  72         public Object getParent(Object element) {
  73                 try {
  74                         if (element instanceof Node) {
  75                                 Node node = (Node) element;
  76                                 if(!node.getPath().equals("/"))
  77                                 return node.getParent();
  78                                 else
  79                                         return null;
  80                         }
  81                         return null;
  82                 } catch (RepositoryException e) {
  83                         return null;
  84                 }
  85         }
  86
  87         public boolean hasChildren(Object element) {
  88                 try {
  89                         if (element instanceof Node) {
  90                                 return ((Node) element).hasNodes();
  91                         } else if (element instanceof RepositoryNode) {
  92                                 return ((RepositoryNode) element).hasChildren();
  93                         } else if (element instanceof WorkspaceNode) {
  94                                 return ((WorkspaceNode) element).getSession() != null;
  95                         } else if (element instanceof RepositoryRegister) {
  96                                 return ((RepositoryRegister) element).getRepositories().size() > 0;
  97                         }
  98                         return false;
  99                 } catch (RepositoryException e) {
 100                         throw new ArgeoException("Cannot check children of " + element, e);
 101                 }
 102         }
 103
 104         public void dispose() {
 105         }
 106
 107         public void inputChanged(Viewer viewer, Object oldInput, Object newInput) {
 108         }
 109
 110         protected Object[] childrenNodes(Node parentNode) {
 111                 try {
 112                         List<Node> children = new ArrayList<Node>();
 113                         NodeIterator nit = parentNode.getNodes();
 114                         while (nit.hasNext()) {
 115                                 Node node = nit.nextNode();
 116                                 children.add(node);
 117                         }
 118                         Node[] arr = children.toArray(new Node[children.size()]);
 119                         Arrays.sort(arr, itemComparator);
 120                         return arr;
 121                 } catch (RepositoryException e) {
 122                         throw new ArgeoException("Cannot list children of " + parentNode, e);
 123                 }
 124         }
 125
 126 }