@Override public boolean select(Viewer viewer, Object parentElement, Object element) { if (element instanceof RepositoryCategory) { return ((ITreeContentProvider) ((StructuredViewer) viewer).getContentProvider()).getChildren(element).length > 0; } return true; } }
/** * Adds the receiver and all of it's ancestors to the checkedStateStore if they * are not already there. */ private void addToHierarchyToCheckedStore(Object treeElement) { // if this tree element is already gray then its ancestors all are as well if (!fCheckedStateStore.containsKey(treeElement)) fCheckedStateStore.put(treeElement, new ArrayList()); Object parent= fTreeContentProvider.getParent(treeElement); if (parent != null) addToHierarchyToCheckedStore(parent); } /**
boolean isExpandable(Object element) { return treeContentProvider.hasChildren(element); }
IStructuredSelection sel = treeViewer.getStructuredSelection(); Object selElement = sel.getFirstElement(); ITreeContentProvider provider = (ITreeContentProvider)treeViewer.getContentProvider(); Object [] children = provider.getChildren(selElement); Object parent = provider.getParent(selElement);
/** * Return whether or not there are less than two pages. * * @return <code>true</code> if there are less than two pages. */ private boolean hasAtMostOnePage() { ITreeContentProvider contentProvider= new PreferenceContentProvider(); try { Object[] children= contentProvider.getElements(getPreferenceManager()); return children.length == 0 || children.length == 1 && !contentProvider.hasChildren(children[0]); } finally { contentProvider.dispose(); } }
private List getAllChildren( Object element, ITreeContentProvider contentProvider, ViewerFilter[] filters ) { if( contentProvider.hasChildren( element ) ) { Object children[] = filterElements( contentProvider.getChildren( element ), element, filters ); List childrenList = new ArrayList( children.length ); for( int i=0; i<children.length; i++ ) childrenList.addAll( getAllChildren( children[i], contentProvider, filters ) ); return childrenList; } else return Collections.singletonList( element ); }
/** * Utility method to get all top level elements of the Log View * @return top level elements of the Log View */ private AbstractEntry[] getElements() { return (AbstractEntry[]) ((ITreeContentProvider) provider.getContentProvider()).getElements(null); } }
/** * Return whether or not there are less than two views in the list. * * @param tree * @return <code>true</code> if there are less than two views in the list. */ private boolean hasAtMostOneView(TreeViewer tree) { ITreeContentProvider contentProvider = (ITreeContentProvider) tree.getContentProvider(); Object[] children = contentProvider.getElements(tree.getInput()); if (children.length <= 1) { if (children.length == 0) { return true; } return !contentProvider.hasChildren(children[0]); } return false; }
public void run() throws Exception { contentProvider.dispose(); }
private boolean evaluateIfTreeEmpty(Object input) { Object[] elements = fContentProvider.getElements(input); if (elements.length > 0) { if (fFilters != null) { for (int i = 0; i < fFilters.size(); i++) { ViewerFilter curr = (ViewerFilter) fFilters.get(i); elements = curr.filter(fViewer, input, elements); } } } return elements.length == 0; }
public void dispose() { contentProvider.dispose(); super.dispose(); }
/** * Handle the expansionsion of an element in a tree viewer */ @Override public void treeExpanded(TreeExpansionEvent event) { Object item = event.getElement(); // First see if the children need to be given their checked state at all. If they've // already been realized then this won't be necessary if (!expandedTreeNodes.contains(item)) { expandedTreeNodes.add(item); checkNewTreeElements(treeContentProvider.getChildren(item)); } }
/** * Adds the receiver and all of it's ancestors to the checkedStateStore if they * are not already there. */ private void addToHierarchyToCheckedStore(Object treeElement) { // if this tree element is already gray then its ancestors all are as well if (!fCheckedStateStore.containsKey(treeElement)) fCheckedStateStore.put(treeElement, new ArrayList()); Object parent= fTreeContentProvider.getParent(treeElement); if (parent != null) addToHierarchyToCheckedStore(parent); } /**
public boolean hasChildren(Object anElement) { return contentProvider.hasChildren(anElement); }
public Object[] getElements(Object anInputElement) { Object[] elements = contentProvider.getElements(anInputElement); contentService.rememberContribution(descriptor, elements); return elements; }
public void dispose() { mDelegate.dispose(); ProfileManager.getInstance().removeProfileListener(mProfileListener); for (Iterator it = mProfileToExtensionNode.values().iterator(); it .hasNext();) { ((IContentExtension) it.next()).dispose(); } mProfileToExtensionNode.clear(); mStateModel = null; }
private void collectAllMatchesBelow(AbstractTextSearchResult result, Set set, ITreeContentProvider cp, Object[] elements) { for (int j = 0; j < elements.length; j++) { Match[] matches = getDisplayedMatches(elements[j]); for (int i = 0; i < matches.length; i++) { set.add(matches[i]); } Object[] children = cp.getChildren(elements[j]); collectAllMatchesBelow(result, set, cp, children); } }
/** * Adds the receiver and all of it's ancestors to the checkedStateStore if they * are not already there. * @param treeElement */ private void addToHierarchyToCheckedStore(Object treeElement) { // if this tree element is already gray then its ancestors all are as well if (!fCheckedStateStore.containsKey(treeElement)) fCheckedStateStore.put(treeElement, new ArrayList<>()); Object parent= fTreeContentProvider.getParent(treeElement); if (parent != null) addToHierarchyToCheckedStore(parent); } /**
boolean isExpandable(Object element) { return treeContentProvider.hasChildren(element); }
private boolean evaluateIfTreeEmpty(Object input) { Object[] elements = fContentProvider.getElements(input); if (elements.length > 0) { if (fFilters != null) { for (int i = 0; i < fFilters.size(); i++) { ViewerFilter curr = (ViewerFilter) fFilters.get(i); elements = curr.filter(fViewer, input, elements); } } } return elements.length == 0; } }