| /external/libcxx/test/std/numerics/rand/rand.adapt/rand.adapt.disc/ |
| ctor_engine_copy.pass.cpp | 24 typedef std::ranlux24 Adaptor;
26 Adaptor a(e);
|
| ctor_engine_move.pass.cpp | 24 typedef std::ranlux24 Adaptor;
27 Adaptor a(std::move(e0));
|
| /external/libcxx/test/std/numerics/rand/rand.adapt/rand.adapt.ibits/ |
| ctor_engine_copy.pass.cpp | 24 typedef std::independent_bits_engine<Engine, 24, unsigned> Adaptor;
26 Adaptor a(e);
|
| ctor_engine_move.pass.cpp | 24 typedef std::independent_bits_engine<Engine, 24, unsigned> Adaptor;
27 Adaptor a(std::move(e0));
|
| /external/libcxx/test/std/numerics/rand/rand.adapt/rand.adapt.shuf/ |
| ctor_engine_copy.pass.cpp | 24 typedef std::knuth_b Adaptor;
26 Adaptor a(e);
27 for (unsigned k = 0; k <= Adaptor::table_size; ++k) {
|
| ctor_engine_move.pass.cpp | 24 typedef std::knuth_b Adaptor;
27 Adaptor a(std::move(e0));
28 for (unsigned k = 0; k <= Adaptor::table_size; ++k) {
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
| ASTParser.stg | 46 RetVal.Tree := Adaptor.ErrorNode(Input, RetVal.Start as IToken,
60 Adaptor.AddChild(Root[0], <label>_tree);
77 Root[0] := Adaptor.BecomeRoot(<label>_tree, Root[0]) as I<ASTLabelType>;
115 <super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <createNodeFromToken(...)>);})>
131 <super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<createNodeFromToken(...)>, Root[0]) as I<ASTLabelType>;})>
139 <if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <label>.Tree);
148 <if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<label>.Tree, Root[0]) as I<ASTLabelType>;
177 <label>_tree := Adaptor.CreateNode(<label>) as I<ASTLabelType>;
178 Adaptor.AddChild(Root[0], <label>_tree);
192 <label>_tree := Adaptor.CreateNode(<label>) as I<ASTLabelType>
[all...] |
| AST.stg | 52 /** Add an adaptor property that knows how to build trees */
57 property Adaptor: ITreeAdaptor read FAdaptor;
111 <ruleDescriptor.allTokenRefsInAltsWithRewrites:{Locals['Stream_<it>'] := TRewriteRule<rewriteElementType>Stream.Create(Adaptor,'token <it>');}; separator="\n">
112 <ruleDescriptor.allRuleRefsInAltsWithRewrites:{Locals['Stream_<it>'] := TRewriteRuleSubtreeStream.Create(Adaptor,'rule <it>');}; separator="\n">
129 Root[0] := Adaptor.GetNilNode as I<ASTLabelType>;
217 Root[0] := Adaptor.GetNilNode as I<ASTLabelType>;
222 <prevRuleRootRef()>.Tree = (<ASTLabelType>)adaptor.rulePostProcessing(root[0]);
223 input.ReplaceChildren(adaptor.GetParent(retval.Start),
224 adaptor.GetChildIndex(retval.Start),
225 adaptor.GetChildIndex(_last)
[all...] |
| ASTTreeParser.stg | 66 if (Adaptor.GetParent(RetVal.Tree) \<\> nil) and (Adaptor.IsNil(Adaptor.GetParent(RetVal.Tree))) then
67 RetVal.Tree := Adaptor.GetParent(RetVal.Tree) as I<ASTLabelType>;
82 Root[<treeLevel>] := Adaptor.GetNilNode as I<ASTLabelType>;<\n>
107 Adaptor.AddChild(Root[<enclosingTreeLevel>], Root[<treeLevel>]);
135 <label>_tree := Adaptor.DupNode(<label>) as I<ASTLabelType>;
137 Adaptor.AddChild(Root[<treeLevel>], <label>_tree);
165 <label>_tree := Adaptor.DupNode(<label>) as I<ASTLabelType>;
167 Root[<treeLevel>] := Adaptor.BecomeRoot(<label>_tree, Root[<treeLevel>]) as I<ASTLabelType>
[all...] |
| /external/antlr/runtime/ObjC/Framework/ |
| TreePatternParser.h | 42 id<TreeAdaptor> adaptor; variable
48 Adaptor:(id<TreeAdaptor>)anAdaptor;
52 Adaptor:(id<TreeAdaptor>)anAdaptor;
62 @property (retain) id<TreeAdaptor> adaptor; variable
|
| TreeWizard.h | 88 /** This adaptor creates TreePattern objects for use during scan() */
98 id<TreeAdaptor> adaptor; variable
102 + (TreeWizard *)newTreeWizard:(id<TreeAdaptor>)adaptor Map:(Map *)aTokenNameToTypeMap;
103 + (TreeWizard *)newTreeWizard:(id<TreeAdaptor>)adaptor TokenNames:(NSArray *)theTokNams;
106 - (id) initWithAdaptor:(id<TreeAdaptor>)adaptor;
107 - (id) initWithAdaptor:(id<TreeAdaptor>)adaptor Map:(Map *)tokenNameToTypeMap;
129 - (BOOL)equals:(id)t1 O2:(id)t2 Adaptor:(id<TreeAdaptor>)anAdaptor;
131 - (BOOL) _equals:(id)t1 O2:(id)t2 Adaptor:(id<TreeAdaptor>)anAdaptor;
133 @property (retain) id<TreeAdaptor> adaptor; variable
|
| /external/antlr/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| Antlr.Runtime.Tree.Tests.pas | 254 Adaptor: ITreeAdaptor;
262 Adaptor := TCommonTreeAdaptor.Create;
263 Adaptor.BecomeRoot(NewRoot, OldRoot);
270 Adaptor: ITreeAdaptor;
277 Adaptor := TCommonTreeAdaptor.Create;
278 Adaptor.BecomeRoot(NewRoot, OldRoot);
285 Adaptor: ITreeAdaptor;
294 Adaptor := TCommonTreeAdaptor.Create;
295 Adaptor.BecomeRoot(NewRoot, OldRoot);
302 Adaptor: ITreeAdaptor
[all...] |
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| ASTDbg.stg | 33 DebugTreeAdaptor *adaptor = [DebugTreeAdaptor newTreeAdaptor:(id)dbg Adaptor:[CommonTreeAdaptor newTreeAdaptor]];
38 adaptor = [DebugTreeAdaptor newTreeAdaptor:dbg Adaptor:anAdaptor];
40 adaptor = [DebugTreeAdaptor newTreeAdaptor:adaptor withDBG:dbg];
42 adaptor = (DebugTreeAdaptor *)adaptor; // delegator sends dbg adaptor
44 <grammar.directDelegates:{g|[<g:delegateName()> setTreeAdaptor:adaptor];}>
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | [all...] |
| /external/antlr/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 52 /// and adaptor, I've merged them. Makes sense to encapsulate.
85 /// use "t=adaptor.nil(); t.AddChild(x); t.AddChild(y);"
412 /// What adaptor can tell me how to interpret/navigate nodes and trees.
638 /// tree (not just the ITree interface). It invokes the adaptor routines
677 /// objects, you need to override this and then set the parser tree adaptor to
[all...] |
| Antlr.Runtime.pas | [all...] |
