| /dports/databases/hbase/hbase-1.2.1/hbase-server/src/main/java/org/apache/hadoop/hbase/security/access/ |
| H A D | ZKPermissionWatcher.java | 206 ZKUtil.deleteNode(watcher, zkNode); in deleteTableACLNode()
223 ZKUtil.deleteNode(watcher, zkNode); in deleteNamespaceACLNode()
|
| /dports/biology/iqtree/IQ-TREE-2.0.6/tree/ |
| H A D | node.cpp | 249 void Node::deleteNode() { in deleteNode() function in Node
257 deleteNode(); in ~Node()
|
| /dports/net-mgmt/p5-Zenoss/Zenoss-1.11/lib/Zenoss/Router/ |
| H A D | Tree.pm | 42 sub deleteNode { subroutine
|
| /dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/status-im/keycard-go/vendor/github.com/ethereum/go-ethereum/les/ |
| H A D | fetcher.go | 297 fp.deleteNode(fp.root)
326 fp.deleteNode(fp.root)
595 fp.deleteNode(n)
685 func (fp *fetcherPeerInfo) deleteNode(n *fetcherTreeNode) { func
706 fp.deleteNode(nn)
|
| /dports/cad/sumo/sumo-1.2.0/src/netimport/ |
| H A D | NIXMLNodesHandler.h | 116 void deleteNode(const SUMOSAXAttributes& attrs);
|
| /dports/devel/libzookeeper/apache-zookeeper-3.7.0/zookeeper-contrib/zookeeper-contrib-zooinspector/src/main/java/org/apache/zookeeper/inspector/gui/actions/ |
| H A D | DeleteNodeAction.java | 65 .deleteNode(nodePath); in actionPerformed()
|
| /dports/games/ufoai/ufoai-2.5-source/src/client/ui/node/ |
| H A D | ui_node_model.h | 39 void deleteNode(uiNode_t* node) override;
|
| /dports/sysutils/kubectl/kubernetes-1.22.2/pkg/controller/ttl/ |
| H A D | ttl_controller.go | 90 DeleteFunc: ttlc.deleteNode,
168 func (ttlc *Controller) deleteNode(obj interface{}) { func
|
| /dports/sysutils/kubectl/kubernetes-1.22.2/plugin/pkg/auth/authorizer/node/ |
| H A D | graph_populator.go | 55 DeleteFunc: g.deleteNode,
124 func (g *graphPopulator) deleteNode(obj interface{}) { func
|
| /dports/graphics/dilay/dilay-1.9.0/lib/src/sketch/ |
| H A D | mesh.hpp | 45 void deleteNode (SketchNode&, bool, const Dimension*);
|
| /dports/games/adonthell/adonthell-0.3.8/src/tools/dlgedit/ |
| H A D | gui_graph.h | 138 bool deleteNode ();
|
| /dports/math/fcl05/fcl-0.5.0/include/fcl/broadphase/ |
| H A D | hierarchy_tree.hxx | 94 deleteNode(leaf); in remove()
772 deleteNode(parent); in removeLeaf()
790 deleteNode(parent); in removeLeaf()
803 deleteNode(root); in fetchLeaves()
859 void HierarchyTree<BV>::deleteNode(NodeType* node) in deleteNode() function in fcl::HierarchyTree
878 deleteNode(node); in recurseDeleteNode()
1146 deleteNode(leaf); in remove()
1729 deleteNode(parent); in removeLeaf()
1747 deleteNode(parent); in removeLeaf()
1838 void HierarchyTree<BV>::deleteNode(size_t node) in deleteNode() function in fcl::implementation_array::HierarchyTree
[all …]
|
| /dports/emulators/sameboy/SameBoy-0.14.7/HexFiend/ |
| H A D | HFBTree.m | 627 BOOL deleteNode = NO;
629 deleteNode = YES;
633 deleteNode = NO;
639 return deleteNode;
818 …BOOL deleteNode = remove_value_from_node_with_possible_rebalance(leaf, childIndex, depth==0/*isRoo…
844 if (deleteNode) {
845 …deleteNode = remove_value_from_node_with_possible_rebalance(branch, branchChildIndex, depth==0/*is…
849 // no need to delete parent nodes, so leave deleteNode as NO
856 if (! deleteNode) {
858 …deleteNode = (tree->depth >= 1 && tree->root->children[1] == nil) || (tree->depth == 0 && tree->ro…
[all …]
|
| /dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/status-im/keycard-go/vendor/github.com/ethereum/go-ethereum/p2p/discover/ |
| H A D | table.go | 659 b.replacements = deleteNode(b.replacements, r)
689 b.replacements = deleteNode(b.replacements, n)
698 b.entries = deleteNode(b.entries, n)
714 func deleteNode(list []*Node, n *Node) []*Node { func
|
| /dports/devel/doxygen/doxygen-1.9.3/src/ |
| H A D | dotnode.cpp | 315 void DotNode::deleteNode(DotNodeRefVector &deletedList) in deleteNode() function in DotNode
322 pn->deleteNode(deletedList); in deleteNode()
327 cn->deleteNode(deletedList); in deleteNode()
350 node->deleteNode(deletedNodes); // collect nodes to be deleted. in deleteNodes()
|
| /dports/games/magiccube4d/magiccube4d-src-2_2/ |
| H A D | History.h | 63 void deleteNode( struct historynode *node);
|
| /dports/devel/codequery/codequery-0.24.0/showgraph/Graph/ |
| H A D | graph.h | 153 inline void deleteNode( void *n);
|
| /dports/databases/hbase/hbase-1.2.1/hbase-server/src/main/java/org/apache/hadoop/hbase/zookeeper/ |
| H A D | ClusterStatusTracker.java | 82 ZKUtil.deleteNode(watcher, watcher.clusterStateZNode); in setClusterDown()
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/unittests/ADT/ |
| H A D | SimpleIListTest.cpp | 20 struct deleteNode : std::default_delete<Node> {}; struct
140 L.removeAndDispose(*B, deleteNode()); in TEST()
209 L.eraseAndDispose(B->getIterator(), deleteNode()); in TEST()
275 L.eraseAndDispose(B->getIterator(), E.getIterator(), deleteNode())); in TEST()
322 L.clearAndDispose(deleteNode()); in TEST()
|
| /dports/devel/llvm11/llvm-11.0.1.src/unittests/ADT/ |
| H A D | SimpleIListTest.cpp | 20 struct deleteNode : std::default_delete<Node> {}; struct
140 L.removeAndDispose(*B, deleteNode()); in TEST()
209 L.eraseAndDispose(B->getIterator(), deleteNode()); in TEST()
275 L.eraseAndDispose(B->getIterator(), E.getIterator(), deleteNode())); in TEST()
322 L.clearAndDispose(deleteNode()); in TEST()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/unittests/ADT/ |
| H A D | SimpleIListTest.cpp | 20 struct deleteNode : std::default_delete<Node> {}; struct
140 L.removeAndDispose(*B, deleteNode()); in TEST()
209 L.eraseAndDispose(B->getIterator(), deleteNode()); in TEST()
275 L.eraseAndDispose(B->getIterator(), E.getIterator(), deleteNode())); in TEST()
322 L.clearAndDispose(deleteNode()); in TEST()
|
| /dports/www/firefox-esr/firefox-91.8.0/js/src/frontend/ |
| H A D | BytecodeEmitter.h | 867 [[nodiscard]] bool emitDeleteName(UnaryNode* deleteNode);
868 [[nodiscard]] bool emitDeleteProperty(UnaryNode* deleteNode);
869 [[nodiscard]] bool emitDeleteElement(UnaryNode* deleteNode);
870 [[nodiscard]] bool emitDeleteExpression(UnaryNode* deleteNode);
877 [[nodiscard]] bool emitDeleteOptionalChain(UnaryNode* deleteNode);
|
| /dports/lang/spidermonkey78/firefox-78.9.0/js/src/frontend/ |
| H A D | BytecodeEmitter.h | 700 MOZ_MUST_USE bool emitDeleteName(UnaryNode* deleteNode);
701 MOZ_MUST_USE bool emitDeleteProperty(UnaryNode* deleteNode);
702 MOZ_MUST_USE bool emitDeleteElement(UnaryNode* deleteNode);
703 MOZ_MUST_USE bool emitDeleteExpression(UnaryNode* deleteNode);
710 MOZ_MUST_USE bool emitDeleteOptionalChain(UnaryNode* deleteNode);
|
| /dports/devel/llvm90/llvm-9.0.1.src/unittests/ADT/ |
| H A D | SimpleIListTest.cpp | 20 struct deleteNode : std::default_delete<Node> {}; struct
140 L.removeAndDispose(*B, deleteNode()); in TEST()
209 L.eraseAndDispose(B->getIterator(), deleteNode()); in TEST()
275 L.eraseAndDispose(B->getIterator(), E.getIterator(), deleteNode())); in TEST()
322 L.clearAndDispose(deleteNode()); in TEST()
|
| /dports/devel/llvm10/llvm-10.0.1.src/unittests/ADT/ |
| H A D | SimpleIListTest.cpp | 20 struct deleteNode : std::default_delete<Node> {}; struct
140 L.removeAndDispose(*B, deleteNode()); in TEST()
209 L.eraseAndDispose(B->getIterator(), deleteNode()); in TEST()
275 L.eraseAndDispose(B->getIterator(), E.getIterator(), deleteNode())); in TEST()
322 L.clearAndDispose(deleteNode()); in TEST()
|