Searched refs:visit (Results 576 - 587 of 587) sorted by relevance
1...<<21222324
| /third_party/typescript/lib/ |
| H A D | typingsInstaller.js | 6217 // Max visit would be all elements of the queue
[all...] |
| H A D | tsc.js | [all...] |
| /third_party/python/Modules/ |
| H A D | _testcapimodule.c | 7466 heapgcctype_traverse(HeapCTypeObject *self, visitproc visit, void *arg) in heapgcctype_traverse() argument
|
| H A D | posixmodule.c | 2341 _posix_traverse(PyObject *module, visitproc visit, void *arg) in _posix_traverse() argument
|
| /third_party/python/Lib/test/ |
| H A D | test_typing.py | 4090 def visit(self) -> T: member in GenericTests.test_nested.Visitor
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 190 // any visit to a node, but should also be called during a visit after any
221 SDValue visit(SDNode *N);
791 // dead. Make sure to re-visit them and recursively delete dead nodes. in deleteAndRecombine()
1402 // set the instance variables, so that the various visit routines may use it. in Run()
1468 "Node was deleted but visit returned new node!"); in Run()
1496 SDValue DAGCombiner::visit(SDNode *N) { in visit() function in DAGCombiner
1631 SDValue RV = visit(N); in combine()
1636 "Node was deleted but visit returned NULL!"); in combine()
1733 SmallVector<SDNode *, 8> TFs; // List of token factors to visit in visitTokenFactor()
[all...] |
| /third_party/python/Python/ |
| H A D | Python-ast.c | 780 ast_traverse(AST_object *self, visitproc visit, void *arg) in ast_traverse() argument
|
| /third_party/python/Objects/ |
| H A D | unicodeobject.c | 15691 unicodeiter_traverse(unicodeiterobject *it, visitproc visit, void *arg) in unicodeiter_traverse() argument
|
| /third_party/skia/third_party/externals/sfntly/java/lib/ |
| H A D | icu4j-4_8_1_1.jar | META-INF/
META-INF/MANIFEST.MF
com/
com/ibm/
com/ibm/icu/
com/ibm/icu/impl/
... |
| /third_party/libabigail/tests/lib/ |
| H A D | catch.hpp | 1975 return std::visit(
|
| /third_party/rust/crates/memchr/bench/data/code/ |
| H A D | rust-library.rs | 33790 /// Unless `BorrowType` is `Immut`, do not use the handles to visit the same
33882 /// Do not use the duplicate handles to visit the same KV twice. in full_range()
33896 // We duplicate the root NodeRef here -- we will never visit the same KV in full_range()
34193 pub fn visit_nodes_in_order<F>(self, mut visit: F) in visit_nodes_in_order()
34198 Leaf(leaf) => visit(Position::Leaf(leaf)), in visit_nodes_in_order()
34200 visit(Position::Internal(internal)); in visit_nodes_in_order()
34205 visit(Position::Leaf(leaf)); in visit_nodes_in_order()
34208 visit(Position::InternalKV(kv)); in visit_nodes_in_order()
34215 visit(Position::Internal(internal)); in visit_nodes_in_order()
[all...] |
| /third_party/rust/crates/bindgen/bindgen-tests/tests/ |
| H A D | stylo.hpp | [all...] |
Completed in 246 milliseconds
1...<<21222324