Home
last modified time | relevance | path

Searched refs:deleteNode (Results 201 – 225 of 797) sorted by relevance

12345678910>>...32

/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DIntervalMap.h1015 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1040 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1275 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1277 deleteNode(&Node.get<Branch>()); in deleteNode()
1279 deleteNode(&Node.get<Leaf>()); in deleteNode()
1286 visitNodes(&IntervalMap::deleteNode); in clear()
1896 IM.deleteNode(&Node); in treeErase()
1941 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/ADT/
H A DIntervalMap.h1014 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1039 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1274 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1276 deleteNode(&Node.get<Branch>()); in deleteNode()
1278 deleteNode(&Node.get<Leaf>()); in deleteNode()
1285 visitNodes(&IntervalMap::deleteNode); in clear()
1890 IM.deleteNode(&Node); in treeErase()
1935 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/ADT/
H A DIntervalMap.h1014 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1039 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1274 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1276 deleteNode(&Node.get<Branch>()); in deleteNode()
1278 deleteNode(&Node.get<Leaf>()); in deleteNode()
1285 visitNodes(&IntervalMap::deleteNode); in clear()
1890 IM.deleteNode(&Node); in treeErase()
1935 IM.deleteNode(&Parent); in eraseNode()
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/ADT/
H A DIntervalMap.h1015 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1040 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1275 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1277 deleteNode(&Node.get<Branch>()); in deleteNode()
1279 deleteNode(&Node.get<Leaf>()); in deleteNode()
1286 visitNodes(&IntervalMap::deleteNode); in clear()
1896 IM.deleteNode(&Node); in treeErase()
1941 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/
H A DIntervalMap.h1010 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1035 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1270 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1272 deleteNode(&Node.get<Branch>()); in deleteNode()
1274 deleteNode(&Node.get<Leaf>()); in deleteNode()
1281 visitNodes(&IntervalMap::deleteNode); in clear()
1886 IM.deleteNode(&Node); in treeErase()
1931 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/ADT/
H A DIntervalMap.h1014 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1039 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1274 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1276 deleteNode(&Node.get<Branch>()); in deleteNode()
1278 deleteNode(&Node.get<Leaf>()); in deleteNode()
1285 visitNodes(&IntervalMap::deleteNode); in clear()
1890 IM.deleteNode(&Node); in treeErase()
1935 IM.deleteNode(&Parent); in eraseNode()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DIntervalMap.h1014 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1039 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1274 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1276 deleteNode(&Node.get<Branch>()); in deleteNode()
1278 deleteNode(&Node.get<Leaf>()); in deleteNode()
1285 visitNodes(&IntervalMap::deleteNode); in clear()
1890 IM.deleteNode(&Node); in treeErase()
1935 IM.deleteNode(&Parent); in eraseNode()
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h1015 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1040 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1278 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1280 deleteNode(&Node.get<Branch>()); in deleteNode()
1282 deleteNode(&Node.get<Leaf>()); in deleteNode()
1289 visitNodes(&IntervalMap::deleteNode); in clear()
1899 IM.deleteNode(&Node); in treeErase()
1944 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/ADT/
H A DIntervalMap.h1015 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1040 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1275 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1277 deleteNode(&Node.get<Branch>()); in deleteNode()
1279 deleteNode(&Node.get<Leaf>()); in deleteNode()
1286 visitNodes(&IntervalMap::deleteNode); in clear()
1896 IM.deleteNode(&Node); in treeErase()
1941 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DIntervalMap.h1015 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1040 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1275 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1277 deleteNode(&Node.get<Branch>()); in deleteNode()
1279 deleteNode(&Node.get<Leaf>()); in deleteNode()
1286 visitNodes(&IntervalMap::deleteNode); in clear()
1896 IM.deleteNode(&Node); in treeErase()
1941 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/
H A DIntervalMap.h1010 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1035 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1270 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1272 deleteNode(&Node.get<Branch>()); in deleteNode()
1274 deleteNode(&Node.get<Leaf>()); in deleteNode()
1281 visitNodes(&IntervalMap::deleteNode); in clear()
1886 IM.deleteNode(&Node); in treeErase()
1931 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h1014 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1039 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1274 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1276 deleteNode(&Node.get<Branch>()); in deleteNode()
1278 deleteNode(&Node.get<Leaf>()); in deleteNode()
1285 visitNodes(&IntervalMap::deleteNode); in clear()
1890 IM.deleteNode(&Node); in treeErase()
1935 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DIntervalMap.h1015 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1040 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1275 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1277 deleteNode(&Node.get<Branch>()); in deleteNode()
1279 deleteNode(&Node.get<Leaf>()); in deleteNode()
1286 visitNodes(&IntervalMap::deleteNode); in clear()
1896 IM.deleteNode(&Node); in treeErase()
1941 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/ADT/
H A DIntervalMap.h1014 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1039 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1274 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1276 deleteNode(&Node.get<Branch>()); in deleteNode()
1278 deleteNode(&Node.get<Leaf>()); in deleteNode()
1285 visitNodes(&IntervalMap::deleteNode); in clear()
1890 IM.deleteNode(&Node); in treeErase()
1935 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/ADT/
H A DIntervalMap.h1015 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1040 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1275 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1277 deleteNode(&Node.get<Branch>()); in deleteNode()
1279 deleteNode(&Node.get<Leaf>()); in deleteNode()
1286 visitNodes(&IntervalMap::deleteNode); in clear()
1891 IM.deleteNode(&Node); in treeErase()
1936 IM.deleteNode(&Parent); in eraseNode()
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/ADT/
H A DIntervalMap.h1018 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode() function
1043 void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1265 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) { in deleteNode() function
1267 deleteNode(&Node.get<Branch>()); in deleteNode()
1269 deleteNode(&Node.get<Leaf>()); in deleteNode()
1276 visitNodes(&IntervalMap::deleteNode); in clear()
1881 IM.deleteNode(&Node); in treeErase()
1926 IM.deleteNode(&Parent); in eraseNode()
/dports/cad/openroad/OpenROAD-2.0/src/OpenDB/src/db/
H A DdbWireGraph.cpp67 itr = deleteNode(itr); in clear()
171 void dbWireGraph::deleteNode(Node* n) in deleteNode() function in odb::dbWireGraph
192 dbWireGraph::node_iterator dbWireGraph::deleteNode(node_iterator itr) in deleteNode() function in odb::dbWireGraph
196 deleteNode(n); in deleteNode()
/dports/editors/hte/ht-e9e63373148da5d7df397d8075740d8c096ecb1d/
H A Ddata.h689 virtual void deleteNode(SLinkedListNode *node) const;
779 virtual void deleteNode(DLinkedListNode *node) const;
837 virtual void deleteNode(BinTreeNode *node) const;
930 virtual void deleteNode(BinTreeNode *node) const;
/dports/misc/perkeep/perkeep-0.11/app/scanningcabinet/
H A Ddatastore.go277 func (h *handler) deleteNode(ctx context.Context, node blob.Ref) error { func
845 if err := h.deleteNode(ctx, docRef); err != nil {
863 if err := h.deleteNode(ctx, docRef); err != nil {
867 if err := h.deleteNode(ctx, page); err != nil {
/dports/textproc/py-pygments/Pygments-2.7.2/tests/examplefiles/
H A DOrderedMap.hx159 root = deleteNode(root,key,ret);
175 private function deleteNode( n :Node<K,V>, key :K, ret :Ref<V> )
184 n.left = deleteNode(n.left,key,ret);
219 n.right = deleteNode(n.right,key,ret);
/dports/textproc/py-pygments-25/Pygments-2.5.2/tests/examplefiles/
H A DOrderedMap.hx159 root = deleteNode(root,key,ret);
175 private function deleteNode( n :Node<K,V>, key :K, ret :Ref<V> )
184 n.left = deleteNode(n.left,key,ret);
219 n.right = deleteNode(n.right,key,ret);
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/IR/
H A DInstruction.h42 static inline void deleteNode(Instruction *V);
828 inline void ilist_alloc_traits<Instruction>::deleteNode(Instruction *V) {
/dports/net/glflow/glFlow-0.1/
H A DFlowTree.cpp163 CFlowTree::deleteNode(CFlowNode* pNode) in deleteNode() function in CFlowTree
418 deleteNode(pCursor); in cleanUp()
/dports/math/fcl05/fcl-0.5.0/include/fcl/broadphase/
H A Dhierarchy_tree.h275 void deleteNode(NodeType* node);
554 void deleteNode(size_t node);
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.virtual/src/org/graalvm/compiler/virtual/phases/ea/
H A DVirtualizerToolImpl.java261 effects.deleteNode(current); in replaceWithVirtual()
274 effects.deleteNode(current); in delete()

12345678910>>...32