boolean isExpandable(Object element) { return treeContentProvider.hasChildren(element); }
public boolean hasChildren(Object anElement) { return contentProvider.hasChildren(anElement); }
boolean isExpandable(Object element) { return treeContentProvider.hasChildren(element); }
ITreeContentProvider provider = (ITreeContentProvider)viewer.getContentProvider(); boolean hasChildren = provider.hasChildren(selected);
@Override protected boolean hasChildren(Object element) { ITreeContentProvider contentProvider= (ITreeContentProvider) fPage.getViewer().getContentProvider(); return contentProvider.hasChildren(element); }
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 ); }
/** * Refresh the arrows visibility. */ void refreshArrow() { fExpandBlock.setEnabled(fContentProvider.hasChildren(getData())); }
@Override protected boolean hasChildren(Object element) { ITreeContentProvider contentProvider= (ITreeContentProvider) fPage.getViewer().getContentProvider(); return contentProvider.hasChildren(element); }
/** * Refresh the arrows visibility. */ void refreshArrow() { fExpandBlock.setEnabled(fContentProvider.hasChildren(getData())); }
protected boolean hasChildren(Object element) { ITreeContentProvider contentProvider= (ITreeContentProvider) fPage.getViewer().getContentProvider(); return contentProvider.hasChildren(element); }
/** * If the element is a leaf node, it is added to the result collection. If the element has * children, this method will recursively look at the children and add any visible leaf nodes * to the collection. * * @param element element to check * @param contentProvider tree content provider to check for children * @param result collection to collect leaf nodes in */ private void addFilteredChildren(Object element, ITreeContentProvider contentProvider, Collection<Object> result) { if (!contentProvider.hasChildren(element)) { result.add(element); } else { Object[] visibleChildren = getFilteredChildren(element); for (int i = 0; i < visibleChildren.length; i++) { addFilteredChildren(visibleChildren[i], contentProvider, result); } } }
/** * If the element is a leaf node, it is added to the result collection. If the element has * children, this method will recursively look at the children and add any visible leaf nodes * to the collection. * * @param element element to check * @param contentProvider tree content provider to check for children * @param result collection to collect leaf nodes in */ private void addFilteredChildren(Object element, ITreeContentProvider contentProvider, Collection<Object> result) { if (!contentProvider.hasChildren(element)) { result.add(element); } else { Object[] visibleChildren = getFilteredChildren(element); for (Object visibleChild : visibleChildren) { addFilteredChildren(visibleChild, contentProvider, result); } } }
private void setCheckedState( CheckboxTreeViewer treeViewer, Object element ) { ITreeContentProvider contentProvider = ( ITreeContentProvider )treeViewer.getContentProvider(); if( contentProvider.hasChildren( element ) ) { Iterator childrenIterator = getAllChildren( element, contentProvider, treeViewer.getFilters() ).iterator(); while( childrenIterator.hasNext() ) { Object child = childrenIterator.next(); if( treeViewer.getChecked( child ) ) checkedItems.add( child ); else checkedItems.remove( child ); } } else if( treeViewer.getChecked( element ) ) checkedItems.add( element ); else checkedItems.remove( element ); }
public boolean hasChildren(TreePath path) { Object anElement = internalAsElement(path); Set resultInstances = contentService .findContentExtensionsByTriggerPoint(anElement); NavigatorContentExtension ext; for (Iterator itr = resultInstances.iterator(); itr.hasNext();) { ext = (NavigatorContentExtension) itr.next(); if (!ext.isLoaded() && !enforceHasChildren) return true; ITreeContentProvider cp = ext.internalGetContentProvider(); if (cp instanceof ITreePathContentProvider) { ITreePathContentProvider tpcp = (ITreePathContentProvider) cp; if (tpcp.hasChildren(path)) { return true; } } else if (cp.hasChildren(anElement)) return true; } return false; }
/** * 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; }
private class DoubleClickListener implements IDoubleClickListener { @Override public void doubleClick(final DoubleClickEvent event) { final IStructuredSelection selection = (IStructuredSelection)event.getSelection(); if (selection == null || selection.isEmpty()) return; final Object sel = selection.getFirstElement(); final ITreeContentProvider provider = (ITreeContentProvider)treeViewer.getContentProvider(); if (!provider.hasChildren(sel)) return; if (treeViewer.getExpandedState(sel)) treeViewer.collapseToLevel(sel, AbstractTreeViewer.ALL_LEVELS); else treeViewer.expandToLevel(sel, 1); } }
/** * 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(); } }
@Override public boolean isElementVisible(Viewer viewer, Object element) { boolean hasChildren= ((ITreeContentProvider) ((AbstractTreeViewer) viewer).getContentProvider()).hasChildren(element); if (fIsDeepFiltering) { if (!super.isElementVisible(viewer, element)) return false; // Also apply deep filtering to the other registered filters ViewerFilter[] filters= ((TreeViewer)viewer).getFilters(); for (int i= 0; i < filters.length; i++) { if (filters[i] == this) continue; if (!filters[i].select(viewer, element, element)) return false; } return true; } return hasChildren || isLeafMatch(viewer, element); } }
public void doubleClick( DoubleClickEvent event ) { if ( event.getSelection() instanceof IStructuredSelection ) { Object obj = ( ( IStructuredSelection ) event.getSelection() ).getFirstElement(); if ( treeViewer.getExpandedState( obj ) ) treeViewer.collapseToLevel( obj, 1 ); else if ( ( ( ITreeContentProvider ) treeViewer.getContentProvider() ).hasChildren( obj ) ) treeViewer.expandToLevel( obj, 1 ); } } } );
public void doubleClick( DoubleClickEvent event ) { if ( event.getSelection() instanceof IStructuredSelection ) { Object obj = ( ( IStructuredSelection ) event.getSelection() ).getFirstElement(); if ( viewer.getExpandedState( obj ) ) { viewer.collapseToLevel( obj, 1 ); } else if ( ( ( ITreeContentProvider ) viewer.getContentProvider() ).hasChildren( obj ) ) { viewer.expandToLevel( obj, 1 ); } } }