Datasets:
Mlxa
/
java_methods

Dataset card Data Studio Files
xet
Community
1
Unnamed: 0
int64
0
305k
body
stringlengths
7
52.9k
name
stringlengths
1
185
278,900
void (@NotNull TreeFacade tree, @NotNull TreePath rootPath, @NotNull ProgressIndicator indicator) { indicator.checkCanceled(); for (PathElement[] path : myExpandedPaths) { if (path.length == 0) continue; int index = rootPath.getPathCount() - 1; if (!path[index].isMatchTo(rootPath.getPathComponent(index))) continue; expandImpl(0, path, rootPath, tree, indicator); } }
applyExpandedTo
278,901
void (@NotNull JTree tree) { List<TreePath> selection = new ArrayList<>(); for (PathElement[] path : mySelectedPaths) { TreeModel model = tree.getModel(); TreePath treePath = new TreePath(model.getRoot()); for (int i = 1; treePath != null && i < path.length; i++) { treePath = findMatchedChild(model, treePath, path[i]); } ContainerUtil.addIfNotNull(selection, treePath); } if (selection.isEmpty()) return; tree.setSelectionPaths(selection.toArray(TreeUtil.EMPTY_TREE_PATH)); if (myScrollToSelection) { TreeUtil.showRowCentered(tree, tree.getRowForPath(selection.get(0)), true, true); } }
applySelectedTo
278,902
void (int positionInPath, PathElement[] path, TreePath treePath, TreeFacade tree, ProgressIndicator indicator) { tree.expand(treePath).doWhenDone(new TreeRunnable("TreeState.applyTo") { @Override public void perform() { indicator.checkCanceled(); PathElement next = positionInPath == path.length - 1 ? null : path[positionInPath + 1]; if (next == null) return; Object parent = treePath.getLastPathComponent(); TreeModel model = tree.tree.getModel(); int childCount = model.getChildCount(parent); for (int j = 0; j < childCount; j++) { Object child = tree.tree.getModel().getChild(parent, j); if (next.isMatchTo(child)) { expandImpl(positionInPath + 1, path, treePath.pathByAddingChild(child), tree, indicator); break; } } } }); }
expandImpl
278,903
void () { indicator.checkCanceled(); PathElement next = positionInPath == path.length - 1 ? null : path[positionInPath + 1]; if (next == null) return; Object parent = treePath.getLastPathComponent(); TreeModel model = tree.tree.getModel(); int childCount = model.getChildCount(parent); for (int j = 0; j < childCount; j++) { Object child = tree.tree.getModel().getChild(parent, j); if (next.isMatchTo(child)) { expandImpl(positionInPath + 1, path, treePath.pathByAddingChild(child), tree, indicator); break; } } }
perform
278,904
TreeFacade (JTree tree) { AbstractTreeBuilder builder = AbstractTreeBuilder.getBuilderFor(tree); return builder != null ? new BuilderFacade(builder) : new JTreeFacade(tree); }
getFacade
278,905
ActionCallback (@NotNull TreePath treePath) { tree.expandPath(treePath); return ActionCallback.DONE; }
expand
278,906
ActionCallback () { WeakReference<ActionCallback> ref = ComponentUtil.getClientProperty(tree, CALLBACK); ActionCallback callback = SoftReference.dereference(ref); if (callback != null) return callback; return ActionCallback.DONE; }
getInitialized
278,907
void (Progressive progressive) { progressive.run(new EmptyProgressIndicator()); }
batch
278,908
ActionCallback () { return myBuilder.getReady(this); }
getInitialized
278,909
void (Progressive progressive) { myBuilder.batch(progressive); }
batch
278,910
ActionCallback (TreePath treePath) { NodeDescriptor<?> desc = TreeUtil.getLastUserObject(NodeDescriptor.class, treePath); if (desc == null) { return ActionCallback.REJECTED; } Object element = myBuilder.getTreeStructureElement(desc); ActionCallback result = new ActionCallback(); myBuilder.expand(element, result.createSetDoneRunnable()); return result; }
expand
278,911
void (boolean scrollToSelection) { myScrollToSelection = scrollToSelection; }
setScrollToSelection
278,912
String () { Element st = new Element("TreeState"); String content; try { writeExternal(st); content = JDOMUtil.writeChildren(st, "\n"); } catch (IOException e) { content = ExceptionUtil.getThrowableText(e); } return "TreeState(" + myScrollToSelection + ")\n" + content; }
toString
278,913
void (@NotNull JTree tree, @NotNull Consumer<? super AsyncPromise<Void>> consumer) { Promise<Void> expanding = ComponentUtil.getClientProperty(tree, EXPANDING); LOG.debug("EXPANDING: ", expanding); if (expanding == null) expanding = Promises.resolvedPromise(); expanding.onProcessed(value -> { AsyncPromise<Void> promise = new AsyncPromise<>(); ComponentUtil.putClientProperty(tree, EXPANDING, promise); consumer.accept(promise); }); }
expand
278,914
boolean (List<TreePath> list, @NotNull JTree tree, AsyncPromise<Void> promise) { if (list != null && tree.isSelectionEmpty()) return true; if (promise != null) promise.setResult(null); return false; }
isSelectionNeeded
278,915
Promise<List<TreePath>> (@NotNull JTree tree) { return TreeUtil.promiseExpand(tree, myExpandedPaths.stream().map(elements -> new Visitor(elements))); }
expand
278,916
Promise<List<TreePath>> (@NotNull JTree tree) { return TreeUtil.promiseSelect(tree, mySelectedPaths.stream().map(elements -> new Visitor(elements))); }
select
278,917
boolean (@NotNull JTree tree) { TreeModel model = tree.getModel(); if (!(model instanceof TreeVisitor.Acceptor)) return false; expand(tree, promise -> expand(tree).onProcessed(expanded -> { if (isSelectionNeeded(expanded, tree, promise)) { select(tree).onProcessed(selected -> promise.setResult(null)); } })); return true; }
visit
278,918
Action (@NotNull TreePath path) { int count = path.getPathCount(); if (count > elements.length) return Action.SKIP_CHILDREN; boolean matches = elements[count - 1].isMatchTo(path.getLastPathComponent()); return !matches ? Action.SKIP_CHILDREN : (count < elements.length ? Action.CONTINUE : Action.INTERRUPT); }
visit
278,919
void (final Set<Object> source, final Map<Object, Object> target) { for (Object o : source) { target.put(o, o); } }
putAll
278,920
Set<Object> (Object[] elements) { Set<Object> set = new HashSet<>(); if (elements != null) { ContainerUtil.addAll(set, elements); } return addPaths(set); }
addPaths
278,921
Set<Object> (Enumeration elements) { ArrayList<Object> elementArray = new ArrayList<>(); if (elements != null) { while (elements.hasMoreElements()) { Object each = elements.nextElement(); elementArray.add(each); } } return addPaths(elementArray); }
addPaths
278,922
Set<Object> (Collection elements) { Set<Object> target = new HashSet<>(); if (elements != null) { for (Object each : elements) { final Object node = ((TreePath)each).getLastPathComponent(); if (node instanceof DefaultMutableTreeNode) { final Object descriptor = ((DefaultMutableTreeNode)node).getUserObject(); if (descriptor instanceof NodeDescriptor) { final Object element = myUi.getElementFromDescriptor((NodeDescriptor)descriptor); if (element != null) { target.add(element); } } } } } return target; }
addPaths
278,923
boolean (@NotNull Runnable runnable) { try { setProcessingNow(true); runnable.run(); } finally { setProcessingNow(false); } return isEmpty(); }
process
278,924
boolean () { return myToExpand.isEmpty() && myToSelect.isEmpty() && myAdjustedSelection.isEmpty(); }
isEmpty
278,925
void (@NotNull UpdaterTreeState state) { myToExpand.putAll(state.myToExpand); Object[] toSelect = state.getToSelect(); for (Object each : toSelect) { if (!myAdjustedSelection.containsKey(each)) { myToSelect.put(each, each); } } myCanRunRestore = state.myCanRunRestore; }
addAll
278,926
boolean (@Nullable DefaultMutableTreeNode actionNode) { if (isProcessingNow() || !myCanRunRestore || myUi.hasNodesToUpdate()) { return false; } invalidateToSelectWithRefsToParent(actionNode); setProcessingNow(true); final Object[] toSelect = getToSelect(); final Object[] toExpand = getToExpand(); final Map<Object, Condition> adjusted = new WeakHashMap<>(myAdjustedSelection); clearSelection(); clearExpansion(); final Set<Object> originallySelected = myUi.getSelectedElements(); myUi._select(toSelect, new TreeRunnable("UpdaterTreeState.restore") { @Override public void perform() { processUnsuccessfulSelections(toSelect, o -> { if (myUi.getTree().isRootVisible() || !myUi.getTreeStructure().getRootElement().equals(o)) { addSelection(o); } return o; }, originallySelected); processAdjusted(adjusted, originallySelected).doWhenDone(new TreeRunnable("UpdaterTreeState.restore: on done") { @Override public void perform() { myUi.expand(toExpand, new TreeRunnable("UpdaterTreeState.restore: after on done") { @Override public void perform() { myUi.clearUpdaterState(); setProcessingNow(false); } }, true); } }); } }); return true; }
restore
278,927
void () { processUnsuccessfulSelections(toSelect, o -> { if (myUi.getTree().isRootVisible() || !myUi.getTreeStructure().getRootElement().equals(o)) { addSelection(o); } return o; }, originallySelected); processAdjusted(adjusted, originallySelected).doWhenDone(new TreeRunnable("UpdaterTreeState.restore: on done") { @Override public void perform() { myUi.expand(toExpand, new TreeRunnable("UpdaterTreeState.restore: after on done") { @Override public void perform() { myUi.clearUpdaterState(); setProcessingNow(false); } }, true); } }); }
perform
278,928
void () { myUi.expand(toExpand, new TreeRunnable("UpdaterTreeState.restore: after on done") { @Override public void perform() { myUi.clearUpdaterState(); setProcessingNow(false); } }, true); }
perform
278,929
void () { myUi.clearUpdaterState(); setProcessingNow(false); }
perform
278,930
void (DefaultMutableTreeNode actionNode) { if (actionNode != null) { Object readyElement = myUi.getElementFor(actionNode); if (readyElement != null) { Iterator<Object> toSelect = myToSelect.keySet().iterator(); while (toSelect.hasNext()) { Object eachToSelect = toSelect.next(); if (readyElement.equals(myUi.getTreeStructure().getParentElement(eachToSelect))) { List<Object> children = myUi.getLoadedChildrenFor(readyElement); if (!children.contains(eachToSelect)) { toSelect.remove(); if (!myToSelect.containsKey(readyElement) && !myUi.getSelectedElements().contains(eachToSelect)) { addAdjustedSelection(eachToSelect, Conditions.alwaysFalse(), null); } } } } } } }
invalidateToSelectWithRefsToParent
278,931
void (final Object[] toSelect, Function<Object, Object> restore, Set<Object> originallySelected) { final Set<Object> selected = myUi.getSelectedElements(); boolean wasFullyRejected = false; if (toSelect.length > 0 && !selected.isEmpty() && !originallySelected.containsAll(selected)) { final Set<Object> successfulSelections = new HashSet<>(); ContainerUtil.addAll(successfulSelections, toSelect); successfulSelections.retainAll(selected); wasFullyRejected = successfulSelections.isEmpty(); } else if (selected.isEmpty() && originallySelected.isEmpty()) { wasFullyRejected = true; } if (wasFullyRejected && !selected.isEmpty()) return; for (Object eachToSelect : toSelect) { if (!selected.contains(eachToSelect)) { restore.fun(eachToSelect); } } }
processUnsuccessfulSelections
278,932
ActionCallback (final Map<Object, Condition> adjusted, final Set<Object> originallySelected) { final ActionCallback result = new ActionCallback(); final Set<Object> allSelected = myUi.getSelectedElements(); Set<Object> toSelect = new HashSet<>(); for (Map.Entry<Object, Condition> entry : adjusted.entrySet()) { Condition condition = entry.getValue(); Object key = entry.getKey(); if (condition.value(key)) continue; for (final Object eachSelected : allSelected) { if (isParentOrSame(key, eachSelected)) continue; toSelect.add(key); } if (allSelected.isEmpty()) { toSelect.add(key); } } final Object[] newSelection = ArrayUtil.toObjectArray(toSelect); if (newSelection.length > 0) { myUi._select(newSelection, new TreeRunnable("UpdaterTreeState.processAjusted") { @Override public void perform() { final Set<Object> hangByParent = new HashSet<>(); processUnsuccessfulSelections(newSelection, o -> { if (myUi.isInStructure(o) && !adjusted.get(o).value(o)) { hangByParent.add(o); } else { addAdjustedSelection(o, adjusted.get(o), null); } return null; }, originallySelected); processHangByParent(hangByParent).notify(result); } }, false, true); } else { result.setDone(); } return result; }
processAdjusted
278,933
void () { final Set<Object> hangByParent = new HashSet<>(); processUnsuccessfulSelections(newSelection, o -> { if (myUi.isInStructure(o) && !adjusted.get(o).value(o)) { hangByParent.add(o); } else { addAdjustedSelection(o, adjusted.get(o), null); } return null; }, originallySelected); processHangByParent(hangByParent).notify(result); }
perform
278,934
ActionCallback (Set<Object> elements) { if (elements.isEmpty()) return ActionCallback.DONE; ActionCallback result = new ActionCallback(elements.size()); for (Object hangElement : elements) { if (!myAdjustmentCause2Adjustment.containsKey(hangElement)) { processHangByParent(hangElement).notify(result); } else { result.setDone(); } } return result; }
processHangByParent
278,935
ActionCallback (Object each) { ActionCallback result = new ActionCallback(); processNextHang(each, result); return result; }
processHangByParent
278,936
void (Object element, final ActionCallback callback) { if (element == null || myUi.getSelectedElements().contains(element)) { callback.setDone(); } else { final Object nextElement = myUi.getTreeStructure().getParentElement(element); if (nextElement == null) { callback.setDone(); } else { myUi.select(nextElement, new TreeRunnable("UpdaterTreeState.processNextHang") { @Override public void perform() { processNextHang(nextElement, callback); } }, true); } } }
processNextHang
278,937
void () { processNextHang(nextElement, callback); }
perform
278,938
boolean (Object parent, Object child) { Object eachParent = child; while (eachParent != null) { if (parent.equals(eachParent)) return true; eachParent = myUi.getTreeStructure().getParentElement(eachParent); } return false; }
isParentOrSame
278,939
void () { myToSelect.clear(); myAdjustedSelection = new WeakHashMap<>(); }
clearSelection
278,940
void (final Object element) { myToSelect.put(element, element); }
addSelection
278,941
void (boolean processingNow) { if (processingNow) { myProcessingCount++; } else { myProcessingCount--; } if (!isProcessingNow()) { myUi.maybeReady(); } }
setProcessingNow
278,942
void (Object element) { myToSelect.remove(element); myAdjustedSelection.remove(element); }
removeFromSelection
278,943
void (@NotNull JTree tree, @NotNull DefaultTreeModel treeModel, AbstractTreeStructure treeStructure, final @Nullable Comparator<? super NodeDescriptor<?>> comparator, final boolean updateIfInactive) { tree.putClientProperty(TREE_BUILDER, new WeakReference<>(this)); myUi = createUi(); myUi.init(this, tree, treeModel, treeStructure, comparator, updateIfInactive); setPassthroughMode(isUnitTestingMode()); }
init
278,944
AbstractTreeUi () { return new AbstractTreeUi(); }
createUi
278,945
void (Object element) { scrollTo(element, null); }
scrollTo
278,946
void (Object element, Runnable onDone) { AbstractTreeUi ui = getUi(); if (ui != null) ui.userScrollTo(element, onDone == null ? null : new UserRunnable(onDone)); }
scrollTo
278,947
void (final Object element) { AbstractTreeUi ui = getUi(); if (ui != null) ui.userSelect(new Object[]{element}, null, false, true); }
select
278,948
void (final Object element, final @Nullable Runnable onDone) { AbstractTreeUi ui = getUi(); if (ui != null) ui.userSelect(new Object[]{element}, new UserRunnable(onDone), false, true); }
select
278,949
void (final Object element, final @Nullable Runnable onDone, boolean addToSelection) { AbstractTreeUi ui = getUi(); if (ui != null) ui.userSelect(new Object[]{element}, new UserRunnable(onDone), addToSelection, true); }
select
278,950
void (final Object[] elements, final @Nullable Runnable onDone) { AbstractTreeUi ui = getUi(); if (ui != null) ui.userSelect(elements, new UserRunnable(onDone), false, true); }
select
278,951
void (final Object[] elements, final @Nullable Runnable onDone, boolean addToSelection) { AbstractTreeUi ui = getUi(); if (ui != null) ui.userSelect(elements, new UserRunnable(onDone), addToSelection, true); }
select
278,952
void (Object element, @Nullable Runnable onDone) { AbstractTreeUi ui = getUi(); if (ui != null) ui.expand(element, new UserRunnable(onDone)); }
expand
278,953
void (Object[] element, @Nullable Runnable onDone) { AbstractTreeUi ui = getUi(); if (ui != null) ui.expand(element, new UserRunnable(onDone)); }
expand
278,954
void (Object element, @Nullable Runnable onDone) { AbstractTreeUi ui = getUi(); if (ui != null) ui.collapseChildren(element, new UserRunnable(onDone)); }
collapseChildren
278,955
AbstractTreeNode<Object> () { return new AbstractTreeNodeWrapper(); }
createSearchingTreeNodeWrapper
278,956
boolean (@NotNull Object element) { AbstractTreeUpdater updater = getUpdater(); return updater != null && updater.addSubtreeToUpdateByElement(element); }
addSubtreeToUpdateByElement
278,957
void (DefaultMutableTreeNode node) { AbstractTreeUi ui = getUi(); if (ui != null) ui.addSubtreeToUpdate(node); }
addSubtreeToUpdate
278,958
void (DefaultMutableTreeNode node, Runnable afterUpdate) { AbstractTreeUi ui = getUi(); if (ui != null) ui.addSubtreeToUpdate(node, afterUpdate); }
addSubtreeToUpdate
278,959
void (Comparator<? super NodeDescriptor<?>> nodeDescriptorComparator) { AbstractTreeUi ui = getUi(); if (ui != null) { ui.setNodeDescriptorComparator(nodeDescriptorComparator); } }
setNodeDescriptorComparator
278,960
Object (NodeDescriptor nodeDescriptor) { return nodeDescriptor == null ? null : nodeDescriptor.getElement(); }
getTreeStructureElement
278,961
void (final DefaultMutableTreeNode node) { AbstractTreeUi ui = getUi(); if (ui != null) ui.doUpdateNode(node); }
updateNode
278,962
boolean (@NotNull Object child) { AbstractTreeStructure structure = getTreeStructure(); return structure != null && structure.isValid(child); }
validateNode
278,963
boolean (NodeDescriptor nodeDescriptor) { return true; }
isDisposeOnCollapsing
278,964
JTree () { AbstractTreeUi ui = getUi(); return ui == null ? null : ui.getTree(); }
getTree
278,965
AbstractTreeStructure () { AbstractTreeUi ui = getUi(); return ui == null ? null : ui.getTreeStructure(); }
getTreeStructure
278,966
void (@NotNull AbstractTreeStructure structure) { AbstractTreeUi ui = getUi(); if (ui != null) ui.setTreeStructure(structure); }
setTreeStructure
278,967
void () { queueUpdate(); }
updateFromRoot
278,968
void () { AbstractTreeUi ui = getUi(); if (ui != null) ui.initRootNode(); }
initRootNode
278,969
ActionCallback () { return queueUpdate(true); }
queueUpdate
278,970
ActionCallback (boolean withStructure) { return queueUpdateFrom(getRootElement(), true, withStructure); }
queueUpdate
278,971
ActionCallback (final Object element, final boolean forceResort) { return queueUpdateFrom(element, forceResort, true); }
queueUpdateFrom
278,972
ActionCallback (final Object element, final boolean forceResort, final boolean updateStructure) { AbstractTreeUi ui = getUi(); if (ui == null) { return ActionCallback.REJECTED; } final ActionCallback result = new ActionCallback(); ui.invokeLaterIfNeeded(false, new TreeRunnable("AbstractTreeBuilder.queueUpdateFrom") { @Override public void perform() { AbstractTreeUi ui = getUi(); if (ui == null) { result.reject("ui is null"); return; } if (updateStructure && forceResort) { ui.incComparatorStamp(); } ui.queueUpdate(element, updateStructure).notify(result); } }); return result; }
queueUpdateFrom
278,973
void () { AbstractTreeUi ui = getUi(); if (ui == null) { result.reject("ui is null"); return; } if (updateStructure && forceResort) { ui.incComparatorStamp(); } ui.queueUpdate(element, updateStructure).notify(result); }
perform
278,974
void (@NotNull Object element) { AbstractTreeUi ui = getUi(); if (ui != null) ui.buildNodeForElement(element); }
buildNodeForElement
278,975
void () { AbstractTreeUi ui = getUi(); if (ui != null) ui.doCleanUp(); }
cleanUp
278,976
void (@NotNull DefaultMutableTreeNode node) { AbstractTreeUi ui = getUi(); if (ui != null) ui.doExpandNodeChildren(node); }
expandNodeChildren
278,977
boolean (final NodeDescriptor nodeDescriptor) { return !isDisposed() && getRootElement() == getTreeStructureElement(nodeDescriptor); }
isAutoExpandNode
278,978
boolean (final NodeDescriptor descriptor) { return false; }
isAlwaysShowPlus
278,979
boolean () { return true; }
isSmartExpand
278,980
boolean () { return getUi() == null; }
isDisposed
278,981
boolean () { AbstractTreeUi ui = getUi(); return ui != null && ui.wasRootNodeInitialized(); }
wasRootNodeInitialized
278,982
boolean (final TreePath path) { AbstractTreeUi ui = getUi(); return ui != null && ui.isNodeBeingBuilt(path); }
isNodeBeingBuilt
278,983
boolean (final DefaultMutableTreeNode node) { return AbstractTreeUi.isLoadingNode(node); }
isLoadingNode
278,984
void (@NotNull Runnable runnable) { AbstractTreeUi ui = getUi(); if (ui == null) return; if (ui.isPassthroughMode()) { runnable.run(); } else { EdtExecutorService.getInstance().execute(()->{ if (!isDisposed()) runnable.run(); }); } }
yieldToEDT
278,985
boolean () { return true; }
isToEnsureSelectionOnFocusGained
278,986
void (final @NotNull Runnable runnable) { if (isDisposed()) return; final Application app = ApplicationManager.getApplication(); if (app != null) { final class Task extends TreeRunnable { private Task() { super("AbstractTreeBuilder.runBackgroundLoading"); } @Override public void perform() { runnable.run(); } } ReadAction.nonBlocking(new Task()).executeSynchronously(); } else { runnable.run(); } }
runBackgroundLoading
278,987
void () { runnable.run(); }
perform
278,988
void (@NotNull Runnable runnable) { AbstractTreeUi ui = getUi(); if (ui == null) return; if (ui.isPassthroughMode()) { runnable.run(); } else { UIUtil.invokeLaterIfNeeded(runnable); } }
updateAfterLoadedInBackground
278,989
ActionCallback () { AbstractTreeUi ui = getUi(); return ui == null ? ActionCallback.REJECTED : ui.getInitialized(); }
getInitialized
278,990
ActionCallback (Object requestor) { AbstractTreeUi ui = getUi(); return ui == null ? ActionCallback.REJECTED : ui.getReady(requestor); }
getReady
278,991
void (Comparator<? super TreeNode> nodeComparator, DefaultMutableTreeNode node, List<? extends TreeNode> children) { children.sort(nodeComparator); }
sortChildren
278,992
void (boolean passthrough) { AbstractTreeUi ui = getUi(); if (ui != null) ui.setPassthroughMode(passthrough); }
setPassthroughMode
278,993
void (@Nullable Runnable onDone) { AbstractTreeUi ui = getUi(); if (ui != null) ui.expandAll(onDone); }
expandAll
278,994
ActionCallback () { AbstractTreeUi ui = getUi(); return ui == null ? ActionCallback.REJECTED : ui.cancelUpdate(); }
cancelUpdate
278,995
ActionCallback (@NotNull Progressive progressive) { AbstractTreeUi ui = getUi(); return ui == null ? ActionCallback.REJECTED : ui.batch(progressive); }
batch
278,996
Promise<Object> (@NotNull Object element) { AbstractTreeStructure structure = getTreeStructure(); return structure == null ? Promises.rejectedPromise() : Promises.resolvedPromise(structure.revalidateElement(element)); }
revalidateElement
278,997
void (@NotNull PresentationData presentation) { }
update
278,998
boolean (Object object) { if (object == this) return true; // this hack allows to find a node in a map without checking a class type return object instanceof AbstractTreeNode && Comparing.equal(getEqualityObject(), ((AbstractTreeNode<?>)object).getEqualityObject()); }
equals
278,999
AbstractTreeUi () { AbstractTreeUi ui = myUi; return ui == null || ui.isReleaseRequested() ? null : ui; }
getUi