nodeCache.getTopNode().entities().forEach(directChildrenOfTopNode::remove); directParentsOfBottomNode.addAll(equivBottomOrParentsOfBottom); nodeCache.getBottomNode().entities().forEach(directParentsOfBottomNode::remove); Collection<T> children = rawParentChildProvider.getChildren(element); children.removeAll(node); nodeCache.getBottomNode().entities().forEach(children::remove); if (!children.isEmpty()) { parentOfBottom = false;
directParentsOfBottomNode.removeAll(nodeCache.getBottomNode().getEntities()); Collection<T> children = rawParentChildProvider.getChildren(element); children.removeAll(node); children.removeAll(nodeCache.getBottomNode().getEntities()); if (!children.isEmpty()) { parentOfBottom = false;
nodeCache.getTopNode().entities().forEach(directChildrenOfTopNode::remove); directParentsOfBottomNode.addAll(equivBottomOrParentsOfBottom); nodeCache.getBottomNode().entities().forEach(directParentsOfBottomNode::remove); Collection<T> children = rawParentChildProvider.getChildren(element); children.removeAll(node); nodeCache.getBottomNode().entities().forEach(children::remove); if (!children.isEmpty()) { parentOfBottom = false;
nodeCache.getTopNode().entities().forEach(directChildrenOfTopNode::remove); directParentsOfBottomNode.addAll(equivBottomOrParentsOfBottom); nodeCache.getBottomNode().entities().forEach(directParentsOfBottomNode::remove); Collection<T> children = rawParentChildProvider.getChildren(element); children.removeAll(node); nodeCache.getBottomNode().entities().forEach(children::remove); if (!children.isEmpty()) { parentOfBottom = false;
nodeCache.getTopNode().entities().forEach(directChildrenOfTopNode::remove); directParentsOfBottomNode.addAll(equivBottomOrParentsOfBottom); nodeCache.getBottomNode().entities().forEach(directParentsOfBottomNode::remove); Collection<T> children = rawParentChildProvider.getChildren(element); children.removeAll(node); nodeCache.getBottomNode().entities().forEach(children::remove); if (!children.isEmpty()) { parentOfBottom = false;
public NodeSet<T> getNodeHierarchyChildren(T parent, boolean direct, DefaultNodeSet<T> ns) { Node<T> node = nodeCache.getNode(parent); if (node.isBottomNode()) { return ns; } Set<T> directChildren = new HashSet<>(); for (T equiv : node) { directChildren.addAll(rawParentChildProvider.getChildren(equiv)); if (directParentsOfBottomNode.contains(equiv)) { ns.addNode(nodeCache.getBottomNode()); } } node.entities().forEach(directChildren::remove); if (node.isTopNode()) { // Special treatment directChildren.addAll(directChildrenOfTopNode); } for (Node<T> childNode : nodeCache.getNodes(directChildren)) { ns.addNode(childNode); } if (!direct) { for (T child : directChildren) { getNodeHierarchyChildren(child, direct, ns); } } return ns; }
public NodeSet<T> getNodeHierarchyChildren(T parent, boolean direct, DefaultNodeSet<T> ns) { Node<T> node = nodeCache.getNode(parent); if (node.isBottomNode()) { return ns; } Set<T> directChildren = new HashSet<>(); for (T equiv : node) { directChildren.addAll(rawParentChildProvider.getChildren(equiv)); if (directParentsOfBottomNode.contains(equiv)) { ns.addNode(nodeCache.getBottomNode()); } } node.entities().forEach(directChildren::remove); if (node.isTopNode()) { // Special treatment directChildren.addAll(directChildrenOfTopNode); } for (Node<T> childNode : nodeCache.getNodes(directChildren)) { ns.addNode(childNode); } if (!direct) { for (T child : directChildren) { getNodeHierarchyChildren(child, direct, ns); } } return ns; }
public NodeSet<T> getNodeHierarchyChildren(T parent, boolean direct, DefaultNodeSet<T> ns) { Node<T> node = nodeCache.getNode(parent); if (node.isBottomNode()) { return ns; } Set<T> directChildren = new HashSet<T>(); for (T equiv : node) { directChildren.addAll(rawParentChildProvider.getChildren(equiv)); if(directParentsOfBottomNode.contains(equiv)) { ns.addNode(nodeCache.getBottomNode()); } } directChildren.removeAll(node.getEntities()); if (node.isTopNode()) { // Special treatment directChildren.addAll(directChildrenOfTopNode); } for (Node<T> childNode : nodeCache.getNodes(directChildren)) { ns.addNode(childNode); } if (!direct) { for (T child : directChildren) { getNodeHierarchyChildren(child, direct, ns); } } return ns; }
public NodeSet<T> getNodeHierarchyChildren(T parent, boolean direct, DefaultNodeSet<T> ns) { Node<T> node = nodeCache.getNode(parent); if (node.isBottomNode()) { return ns; } Set<T> directChildren = new HashSet<>(); for (T equiv : node) { directChildren.addAll(rawParentChildProvider.getChildren(equiv)); if (directParentsOfBottomNode.contains(equiv)) { ns.addNode(nodeCache.getBottomNode()); } } node.entities().forEach(directChildren::remove); if (node.isTopNode()) { // Special treatment directChildren.addAll(directChildrenOfTopNode); } for (Node<T> childNode : nodeCache.getNodes(directChildren)) { ns.addNode(childNode); } if (!direct) { for (T child : directChildren) { getNodeHierarchyChildren(child, direct, ns); } } return ns; }
public NodeSet<T> getNodeHierarchyChildren(T parent, boolean direct, DefaultNodeSet<T> ns) { Node<T> node = nodeCache.getNode(parent); if (node.isBottomNode()) { return ns; } Set<T> directChildren = new HashSet<>(); for (T equiv : node) { directChildren.addAll(rawParentChildProvider.getChildren(equiv)); if (directParentsOfBottomNode.contains(equiv)) { ns.addNode(nodeCache.getBottomNode()); } } node.entities().forEach(directChildren::remove); if (node.isTopNode()) { // Special treatment directChildren.addAll(directChildrenOfTopNode); } for (Node<T> childNode : nodeCache.getNodes(directChildren)) { ns.addNode(childNode); } if (!direct) { for (T child : directChildren) { getNodeHierarchyChildren(child, direct, ns); } } return ns; }
public final void clearBottomNode() { removeNode(hierarchyInfo.bottomEntity); bottomNode = hierarchyInfo .createNode(CollectionFactory.createSet(hierarchyInfo.bottomEntity)); addNode(getBottomNode()); }
public final void clearBottomNode() { removeNode(hierarchyInfo.bottomEntity); bottomNode = hierarchyInfo .createNode(CollectionFactory.createSet(hierarchyInfo.bottomEntity)); addNode(getBottomNode()); }
public final void clearBottomNode() { removeNode(hierarchyInfo.bottomEntity); bottomNode = hierarchyInfo .createNode(CollectionFactory.createSet(hierarchyInfo.bottomEntity)); addNode(getBottomNode()); }
public final void clearBottomNode() { removeNode(hierarchyInfo.bottomEntity); bottomNode = hierarchyInfo .createNode(CollectionFactory.createSet(hierarchyInfo.bottomEntity)); addNode(getBottomNode()); }