Home
last modified time | relevance | path

Searched refs:traverse (Results 101 – 125 of 15764) sorted by relevance

12345678910>>...631

/dports/lang/spidermonkey78/firefox-78.9.0/gfx/angle/checkout/src/compiler/translator/tree_util/
H A DIntermTraverse.cpp22 void TIntermTraverser::traverse(T *node) in traverse() function in sh::TIntermTraverser
58 void TIntermNode::traverse(TIntermTraverser *it) in traverse() function in sh::TIntermNode
60 it->traverse(this); in traverse()
312 traverse(node); in traverseBinary()
336 node->getLeft()->traverse(this); in traverseBinary()
376 traverse(node); in traverseUnary()
405 node->getOperand()->traverse(this); in traverseUnary()
465 child->traverse(this); in traverseBlock()
485 traverse(node); in traverseAggregate()
625 child->traverse(this); in traverseAggregate()
[all …]
/dports/www/firefox/firefox-99.0/gfx/angle/checkout/src/compiler/translator/tree_util/
H A DIntermTraverse.cpp22 void TIntermTraverser::traverse(T *node) in traverse() function in sh::TIntermTraverser
58 void TIntermNode::traverse(TIntermTraverser *it) in traverse() function in sh::TIntermNode
60 it->traverse(this); in traverse()
312 traverse(node); in traverseBinary()
336 node->getLeft()->traverse(this); in traverseBinary()
376 traverse(node); in traverseUnary()
405 node->getOperand()->traverse(this); in traverseUnary()
465 child->traverse(this); in traverseBlock()
485 traverse(node); in traverseAggregate()
625 child->traverse(this); in traverseAggregate()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/angle/checkout/src/compiler/translator/tree_util/
H A DIntermTraverse.cpp22 void TIntermTraverser::traverse(T *node) in traverse() function in sh::TIntermTraverser
58 void TIntermNode::traverse(TIntermTraverser *it) in traverse() function in sh::TIntermNode
60 it->traverse(this); in traverse()
312 traverse(node); in traverseBinary()
336 node->getLeft()->traverse(this); in traverseBinary()
376 traverse(node); in traverseUnary()
405 node->getOperand()->traverse(this); in traverseUnary()
465 child->traverse(this); in traverseBlock()
485 traverse(node); in traverseAggregate()
625 child->traverse(this); in traverseAggregate()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/clang/unittests/ASTMatchers/
H A DASTMatchersTraversalTest.cpp1999 traverse( in TEST()
2011 traverse( in TEST()
2049 traverse( in TEST()
2085 traverse(TK_AsIs, in TEST()
2352 Code, traverse(TK_AsIs, in TEST()
2535 traverse( in TEST()
2552 traverse( in TEST()
2605 traverse( in TEST()
2621 traverse( in TEST()
2637 traverse( in TEST()
[all …]
/dports/devel/hs-hoogle/hoogle-5.0.18.2/_cabal_deps/foundation-0.0.25/Foundation/Collection/
H A DMappable.hs35 traverse :: Applicative f => (a -> f b)
38 traverse f = sequenceA . fmap f function
45 sequenceA = traverse id
51 mapM = traverse
63 traverse_ f col = traverse f col *> pure ()
100 traverse = Data.Traversable.traverse function
104 traverse f arr = fromList <$> traverse f (toList arr) function
/dports/lang/maude/maude-2.7.1/src/Interface/
H A DassociativeSymbol.cc109 int step = traverse(0, i); in checkUniformity()
112 int resultIndex = traverse(step, j); in checkUniformity()
176 int step = traverse(0, i); in associativeSortCheck()
195 int step_j = traverse(0, j); in associativeSortCheck()
196 int step_ij = traverse(0, traverse(step_i, j)); in associativeSortCheck()
199 if (traverse(step_ij, k) != traverse(step_i, traverse(step_j, k))) in associativeSortCheck()
267 int step = traverse(0, j); in associativeSortBoundsAnalysis()
274 int resultIndex = traverse(step, k); in associativeSortBoundsAnalysis()
315 int step = traverse(0, j); in associativeSortStructureAnalysis()
348 int step = traverse(0, j); in associativeSortStructureAnalysis()
[all …]
/dports/games/netradiant/netradiant-20150621-src/contrib/ufoaiplug/
H A Dufoai_filters.cpp193 GlobalSceneGraph().traverse( BrushGetLevel( brushes, ( level_active << 8 ), true, true, false ) ); in filter_level()
194 GlobalSceneGraph().traverse( EntityFindByName( "func_door", entities, level_active, false ) ); in filter_level()
195 …GlobalSceneGraph().traverse( EntityFindByName( "func_breakable", entities, level_active, false ) ); in filter_level()
196 GlobalSceneGraph().traverse( EntityFindByName( "misc_model", entities, level_active, false ) ); in filter_level()
197 GlobalSceneGraph().traverse( EntityFindByName( "misc_particle", entities, level_active, false ) ); in filter_level()
210 GlobalSceneGraph().traverse( BrushGetLevel( brushes, flag, true, true, true ) ); in filter_level()
213 GlobalSceneGraph().traverse( EntityFindByName( "func_door", entities, level, true ) ); in filter_level()
214 GlobalSceneGraph().traverse( EntityFindByName( "func_breakable", entities, level, true ) ); in filter_level()
215 GlobalSceneGraph().traverse( EntityFindByName( "misc_model", entities, level, true ) ); in filter_level()
216 GlobalSceneGraph().traverse( EntityFindByName( "misc_particle", entities, level, true ) ); in filter_level()
[all …]
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/rctree-0.3.3/tests/
H A Dtests.rs280 let mut traverse = node1.traverse(); in traverse_1() localVariable
282 let t = traverse.next(); in traverse_1()
287 let t = traverse.next(); in traverse_1()
292 let t = traverse.next(); in traverse_1()
297 let t = traverse.next(); in traverse_1()
302 let t = traverse.next(); in traverse_1()
307 let t = traverse.next(); in traverse_1()
324 let mut traverse = node1.traverse(); in traverse_2() localVariable
326 let t = traverse.next_back(); in traverse_2()
331 let t = traverse.next_back(); in traverse_2()
[all …]
/dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/rctree-0.3.3/tests/
H A Dtests.rs280 let mut traverse = node1.traverse(); in traverse_1() localVariable
282 let t = traverse.next(); in traverse_1()
287 let t = traverse.next(); in traverse_1()
292 let t = traverse.next(); in traverse_1()
297 let t = traverse.next(); in traverse_1()
302 let t = traverse.next(); in traverse_1()
307 let t = traverse.next(); in traverse_1()
324 let mut traverse = node1.traverse(); in traverse_2() localVariable
326 let t = traverse.next_back(); in traverse_2()
331 let t = traverse.next_back(); in traverse_2()
[all …]
/dports/devel/py-zope.traversing/zope.traversing-3.14.0/src/zope/traversing/
H A Dnamespace.py112 return traverser.traverse(name, ())
267 def traverse(self, name, ignored): member in attr
282 def traverse(self, name, ignored): member in item
296 def traverse(self, name, ignored): member in etc
325 def traverse(self, name, ignored): member in view
335 def traverse(self, name, ignored): member in resource
342 def traverse(self, name, ignored): member in lang
350 def traverse(self, name, ignored): member in skin
361 def traverse(self, name, ignored): member in vh
396 def traverse(self, name, ignored): member in adapter
[all …]
/dports/databases/p5-Tangram/Tangram-2.12/lib/Tangram/Schema/
H A DNode.pm24 my $traverse;
26 $traverse = sub {
33 $traverse->($derived);
37 $traverse->($class);
52 my $traverse;
54 $traverse = sub {
60 $traverse->($base);
66 $traverse->($class);
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bstm/tests/
H A Dtest_time_tree.cxx144 good = good && (tree2_copy.traverse(0 / bstm_time_tree::tree_range()) == 15); in test_time_tree()
145 good = good && (tree2_copy.traverse(1 / bstm_time_tree::tree_range()) == 15); in test_time_tree()
146 good = good && (tree2_copy.traverse(2 / bstm_time_tree::tree_range()) == 33); in test_time_tree()
147 good = good && (tree2_copy.traverse(3 / bstm_time_tree::tree_range()) == 34); in test_time_tree()
148 good = good && (tree2_copy.traverse(4 / bstm_time_tree::tree_range()) == 17); in test_time_tree()
149 good = good && (tree2_copy.traverse(5 / bstm_time_tree::tree_range()) == 17); in test_time_tree()
150 good = good && (tree2_copy.traverse(6 / bstm_time_tree::tree_range()) == 37); in test_time_tree()
152 good = good && (tree2_copy.traverse(8 / bstm_time_tree::tree_range()) == 4); in test_time_tree()
153 good = good && (tree2_copy.traverse(10 / bstm_time_tree::tree_range()) == 4); in test_time_tree()
154 good = good && (tree2_copy.traverse(16 / bstm_time_tree::tree_range()) == 5); in test_time_tree()
[all …]
/dports/databases/p5-DBIx-Tree/DBIx-Tree-1.98/t/
H A Dtest.t103 # Test traverse().
118 $tree->traverse;
139 $tree->traverse;
141 ok($compare eq 'Dairy', 'Another traverse()');
143 # Test traverse().
153 $tree->traverse;
155 ok($compare eq 'Dairy', 'Test default values in traverse()');
173 $tree->traverse;
193 $tree->traverse;
197 # Test recursive option to traverse().
[all …]
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/python/tvm/topi/hls/
H A Dnn.py30 def traverse(OP): function
38 traverse(tensor.op)
48 traverse(outs[0].op)
208 def traverse(OP): function
228 traverse(outs[0].op)
302 def traverse(OP): function
320 traverse(outs[0].op)
345 def traverse(OP): function
363 traverse(outs[0].op)
388 def traverse(OP): function
[all …]
/dports/java/phpeclipse/plugins/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/compiler/ast/
H A DMemberTypeDeclaration.java29 public void traverse(ASTVisitor visitor, ClassScope classScope) { in traverse() method in MemberTypeDeclaration
35 superclass.traverse(visitor, scope); in traverse()
39 superInterfaces[i].traverse(visitor, scope); in traverse()
44 memberTypes[i].traverse(visitor, scope); in traverse()
51 field.traverse(visitor, staticInitializerScope); in traverse()
53 field.traverse(visitor, initializerScope); in traverse()
60 methods[i].traverse(visitor, scope); in traverse()
/dports/security/ccrypt/ccrypt-1.11/po/
H A Dccrypt.pot232 #: src/traverse.c:238
237 #: src/traverse.c:248
244 #: src/traverse.c:279
249 #: src/traverse.c:282
254 #: src/traverse.c:285
259 #: src/traverse.c:290
274 #: src/traverse.c:340 src/traverse.c:530
279 #: src/traverse.c:347 src/traverse.c:536 src/traverse.c:641
284 #: src/traverse.c:354 src/traverse.c:542
289 #: src/traverse.c:388 src/traverse.c:575
[all …]
/dports/devel/texlab/texlab-3.3.0/cargo-crates/indextree-4.3.1/tests/
H A Dremove.rs25 n1.traverse(&arena).collect::<Vec<_>>(), in toplevel_with_single_child()
47 n1.traverse(&arena).collect::<Vec<_>>(), in toplevel_with_multiple_children()
79 n1.traverse(&arena).collect::<Vec<_>>(), in single_child_with_no_children()
87 n1.traverse(&arena).collect::<Vec<_>>(), in single_child_with_no_children()
105 n1.traverse(&arena).collect::<Vec<_>>(), in single_child_with_single_child()
123 n1.traverse(&arena).collect::<Vec<_>>(), in single_child_with_single_child()
144 n1.traverse(&arena).collect::<Vec<_>>(), in first_child_with_no_children()
162 n1.traverse(&arena).collect::<Vec<_>>(), in first_child_with_no_children()
190 n1.traverse(&arena).collect::<Vec<_>>(), in middle_child_with_no_children()
208 n1.traverse(&arena).collect::<Vec<_>>(), in middle_child_with_no_children()
[all …]
/dports/textproc/kibana6/kibana-6.8.16-darwin-x86_64/node_modules/traverse/
H A Dreadme.markdown1 # traverse chapter
5 …er support](http://ci.testling.com/substack/js-traverse.png)](http://ci.testling.com/substack/js-t…
7 …tatus](https://secure.travis-ci.org/substack/js-traverse.png)](http://travis-ci.org/substack/js-tr…
16 var traverse = require('traverse');
19 traverse(obj).forEach(function (x) {
35 var traverse = require('traverse');
44 var leaves = traverse(obj).reduce(function (acc, x) {
61 var traverse = require('traverse');
66 var scrubbed = traverse(obj).map(function (x) {
186 You can assign into `this.keys` here to traverse in a custom order.
[all …]
/dports/textproc/kibana7/kibana-7.16.2-darwin-x86_64/node_modules/traverse/
H A Dreadme.markdown1 # traverse chapter
5 …er support](http://ci.testling.com/substack/js-traverse.png)](http://ci.testling.com/substack/js-t…
7 …tatus](https://secure.travis-ci.org/substack/js-traverse.png)](http://travis-ci.org/substack/js-tr…
16 var traverse = require('traverse');
19 traverse(obj).forEach(function (x) {
35 var traverse = require('traverse');
44 var leaves = traverse(obj).reduce(function (acc, x) {
61 var traverse = require('traverse');
66 var scrubbed = traverse(obj).map(function (x) {
186 You can assign into `this.keys` here to traverse in a custom order.
[all …]
/dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/node_modules/traverse/
H A Dreadme.markdown1 # traverse
5 …er support](http://ci.testling.com/substack/js-traverse.png)](http://ci.testling.com/substack/js-t…
7 …tatus](https://secure.travis-ci.org/substack/js-traverse.png)](http://travis-ci.org/substack/js-tr…
16 var traverse = require('traverse');
19 traverse(obj).forEach(function (x) {
35 var traverse = require('traverse');
44 var leaves = traverse(obj).reduce(function (acc, x) {
61 var traverse = require('traverse');
66 var scrubbed = traverse(obj).map(function (x) {
186 You can assign into `this.keys` here to traverse in a custom order.
[all …]
/dports/biology/bamutil/bamUtil-1.0.15/libStatGen/general/
H A DPedigreeTrim.cpp56 hasData |= haveData[persons[i]->traverse] = persons[i]->haveData(); in Trim()
58 hasData |= haveData[persons[i]->traverse] = informative[i]; in Trim()
101 if (discardable[p.father->traverse]) in Trim()
104 if (offspring[i] == 0 && !haveData[p.traverse]) in Trim()
111 int father = p.father->traverse; in Trim()
112 int mother = p.mother->traverse; in Trim()
144 if (p.isFounder() || discardable[p.father->traverse]) in Trim()
149 !discardable[persons[fam->path[mates[i]]]->father->traverse]) || in Trim()
150 haveData[p.traverse] || in Trim()
/dports/devel/xsd/xsd-4.1.0.a11+dep/xsd/xsd/cxx/tree/
H A Dname-processor.cxx587 traverse (Type& e) in traverse() function
614 traverse (Type& e) in traverse() function
654 traverse (Type& m) in traverse() function
681 traverse (Type& m) in traverse() function
901 traverse (SemanticGraph::Any& a) in traverse() function
1116 traverse (Type& c) in traverse() function
1517 traverse (Type& e) in traverse() function
1716 traverse (Type& ns) in traverse() function
1737 traverse (Type& ns) in traverse() function
2219 traverse (Type& u) in traverse() function
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/devtools-frontend/src/node_modules/@babel/traverse/
H A DREADME.md1 # @babel/traverse
5 …traverse](https://babeljs.io/docs/en/next/babel-traverse.html) for more information or the [issues…
12 npm install --save-dev @babel/traverse
18 yarn add @babel/traverse --dev
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/devtools-frontend/src/node_modules/@babel/helpers/node_modules/@babel/traverse/
H A DREADME.md1 # @babel/traverse
5 …traverse](https://babeljs.io/docs/en/next/babel-traverse.html) for more information or the [issues…
12 npm install --save-dev @babel/traverse
18 yarn add @babel/traverse --dev
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/devtools-frontend/src/node_modules/@babel/core/node_modules/@babel/traverse/
H A DREADME.md1 # @babel/traverse
5 …traverse](https://babeljs.io/docs/en/next/babel-traverse.html) for more information or the [issues…
12 npm install --save-dev @babel/traverse
18 yarn add @babel/traverse --dev

12345678910>>...631