/external/libcxx/test/std/numerics/rand/rand.adapt/rand.adapt.disc/ |
H A D | ctor_engine_copy.pass.cpp | 24 typedef std::ranlux24 Adaptor; typedef 26 Adaptor a(e);
|
H A D | ctor_engine_move.pass.cpp | 24 typedef std::ranlux24 Adaptor; typedef 27 Adaptor a(std::move(e0));
|
/external/libcxx/test/std/numerics/rand/rand.adapt/rand.adapt.ibits/ |
H A D | ctor_engine_copy.pass.cpp | 24 typedef std::independent_bits_engine<Engine, 24, unsigned> Adaptor; typedef 26 Adaptor a(e);
|
H A D | ctor_engine_move.pass.cpp | 24 typedef std::independent_bits_engine<Engine, 24, unsigned> Adaptor; typedef 27 Adaptor a(std::move(e0));
|
/external/libcxx/test/std/numerics/rand/rand.adapt/rand.adapt.shuf/ |
H A D | ctor_engine_copy.pass.cpp | 24 typedef std::knuth_b Adaptor; typedef 26 Adaptor a(e); 27 for (unsigned k = 0; k <= Adaptor::table_size; ++k)
|
H A D | ctor_engine_move.pass.cpp | 24 typedef std::knuth_b Adaptor; typedef 27 Adaptor a(std::move(e0)); 28 for (unsigned k = 0; k <= Adaptor::table_size; ++k)
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRTreePatternParser.h | 48 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor; 52 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor;
|
H A D | ANTLRTreeWizard.h | 129 - (BOOL)equals:(id)t1 O2:(id)t2 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor; 131 - (BOOL) _equals:(id)t1 O2:(id)t2 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRTreePatternParser.h | 48 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor; 52 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor;
|
H A D | ANTLRTreeWizard.h | 129 - (BOOL)equals:(id)t1 O2:(id)t2 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor; 131 - (BOOL) _equals:(id)t1 O2:(id)t2 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRTreePatternParser.h | 48 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor; 52 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor;
|
H A D | ANTLRTreeWizard.h | 129 - (BOOL)equals:(id)t1 O2:(id)t2 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor; 131 - (BOOL) _equals:(id)t1 O2:(id)t2 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor;
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
H A D | 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 [all...] |
H A D | AST.stg | 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>; 243 :{Locals['Stream_<it>'] := TRewriteRule<rewriteElementType>Stream.Create(Adaptor, 'token <it>', <it>);}; 247 :{Locals['Stream_<it>'] := TRewriteRule<rewriteElementType>Stream.Create(Adaptor,'token <it>', list_<it>);}; 252 Locals['Stream_<it>'] := TRewriteRuleSubtreeStream.Create(Adaptor, 'token <it>', <it>.Tree) 254 Locals['Stream_<it>'] := TRewriteRuleSubtreeStream.Create(Adaptor, 'token <it>', nil);}; separator="\n"> 256 :{Locals['Stream_<it>'] := TRewriteRuleSubtreeStream.Create(Adaptor, 'toke [all...] |
H A D | 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 [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRTreePatternParser.h | 48 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor; 52 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor;
|
H A D | ANTLRTreeWizard.h | 129 - (BOOL)equals:(id)t1 O2:(id)t2 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor; 131 - (BOOL) _equals:(id)t1 O2:(id)t2 Adaptor:(id<ANTLRTreeAdaptor>)anAdaptor;
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
H A D | 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 [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
H A D | ASTDbg.stg | 33 ANTLRDebugTreeAdaptor *adaptor = [ANTLRDebugTreeAdaptor newTreeAdaptor:(id)dbg Adaptor:[ANTLRCommonTreeAdaptor newTreeAdaptor]]; 38 adaptor = [ANTLRDebugTreeAdaptor newTreeAdaptor:dbg Adaptor:anAdaptor];
|
/external/skia/src/core/ |
H A D | SkColorMatrixFilterRowMajor255.cpp | 88 template <typename Adaptor, typename T> 97 T matrix_translate_pmcolor = Adaptor::From4f(premul(clamp_0_1(c4))); 100 Sk4f srcf = Adaptor::To4f(src[i]); 111 Sk4f r4 = srcf[Adaptor::R]; 112 Sk4f g4 = srcf[Adaptor::G]; 113 Sk4f b4 = srcf[Adaptor::B]; 114 Sk4f a4 = srcf[Adaptor::A]; 118 dst[i] = Adaptor::From4f(premul(clamp_0_1(dst4)));
|
/external/clang/include/clang/ASTMatchers/ |
H A D | ASTMatchersInternal.h | 1033 template <typename T> class Adaptor { class in struct:clang::ast_matchers::internal::ArgumentAdaptingMatcherFunc 1035 explicit Adaptor(const Matcher<T> &InnerMatcher) function in class:clang::ast_matchers::internal::ArgumentAdaptingMatcherFunc::Adaptor 1049 static Adaptor<T> create(const Matcher<T> &InnerMatcher) { 1050 return Adaptor<T>(InnerMatcher); 1054 Adaptor<T> operator()(const Matcher<T> &InnerMatcher) const {
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
H A D | Antlr.Runtime.Tree.pas | 1040 function Equals(const T1, T2: IANTLRInterface; const Adaptor: ITreeAdaptor): Boolean; overload; 1818 const Adaptor: ITreeAdaptor): Boolean; reintroduce; overload; 1832 const Adaptor: ITreeAdaptor): Boolean; static; 3751 Adaptor: ITreeAdaptor; 3755 Adaptor := (E.Input as ITreeNodeStream).TreeAdaptor; 3756 E.Token := Adaptor.GetToken(E.Node); 3759 E.Token := TCommonToken.Create(Adaptor.GetNodeType(E.Node), 3760 Adaptor.GetNodeText(E.Node)); 4021 const Adaptor: ITreeAdaptor): Boolean; 4023 Result := _Equals(T1, T2, Adaptor); [all...] |
H A D | Antlr.Runtime.pas | 2877 Adaptor: ITreeAdaptor; 2887 Adaptor := Nodes.TreeAdaptor; 2888 Payload := Adaptor.GetToken(FNode); 2900 PriorPayload := Adaptor.GetToken(PriorNode); 2929 NodeType := Adaptor.GetNodeType(FNode); 2930 Text := Adaptor.GetNodeText(FNode); 2938 Adaptor: ITreeAdaptor; 2945 Adaptor := Nodes.TreeAdaptor; 2946 Result := Adaptor.GetNodeType(FNode);
|