| /external/llvm/test/Transforms/GlobalOpt/ |
| D | 2007-06-04-PackedStruct.ll | 7 …less<int>,std::allocator<std::pair<const int, int> > >" = type { %"struct.std::_Rb_tree<int,std::p…
8 …1st<std::pair<const int, int> >,std::less<int>,std::allocator<std::pair<const int, int> > >::_Rb_t…
10 …less<int>,std::allocator<std::pair<const int, int> > >" = type { %"struct.std::_Rb_tree<int,std::p…
11 …td::map<int,int,std::less<int>,std::allocator<std::pair<const int, int> > >" zeroinitializer ; <%…
31 …store i8 0, i8* getelementptr (%"struct.std::map<int,int,std::less<int>,std::allocator<std::pair<c…
|
| /external/stlport/doc/ |
| D | pointer_specialization.txt | 34 class _Compare = less<_Tp>,
63 class set<_Tp*, less<_Tp*>, _Alloc>
66 is the Standard less struct. The underlying container would be:
68 set<void*, less<void*>, _VoidAlloc>
71 specialized the less struct for any pointer type even the basic one.
74 the less<void*> functor. The less specialization issue also show that
77 set<void*, less<void*>, _VoidAlloc>
83 where __less would be equivalent to the standard less functor but
87 need to be able to detect the less specialization. The partial set
88 specialization would have to be used only if the less functor is
|
| /external/stlport/stlport/stl/ |
| D | _function_base.h | 70 struct less : public binary_function<_Tp,_Tp,bool> struct
76 , public __stlport_class<less<_Tp> >
82 void _M_swap_workaround(less<_Tp>& __x) {} in _M_swap_workaround() argument
88 struct __type_traits<less<_Tp> > {
90 typedef typename _IsSTLportClass<less<_Tp> >::_Ret _STLportLess;
92 enum { _Is = _IsSTLportClass<less<_Tp> >::_Is };
106 less<_Tp> __less(_Tp* ) { return less<_Tp>(); }
|
| /external/llvm/test/MC/Disassembler/X86/ |
| D | invalid-cmp-imm.txt | 3 # This instruction would decode as cmpordps if the immediate byte was less than 8.
5 # This instruction would decode as cmpordpd if the immediate byte was less than 8.
7 # This instruction would decode as cmpordss if the immediate byte was less than 8.
9 # This instruction would decode as cmpordsd if the immediate byte was less than 8.
|
| /external/stlport/test/unit/ |
| D | perm_test.cpp | 191 next_permutation(v1.begin(), v1.end(), less<char>()); in nextprm2()
195 next_permutation(v1.begin(), v1.end(), less<char>()); in nextprm2()
199 next_permutation(v1.begin(), v1.end(), less<char>()); in nextprm2()
203 next_permutation(v1.begin(), v1.end(), less<char>()); in nextprm2()
207 next_permutation(v1.begin(), v1.end(), less<char>()); in nextprm2()
211 next_permutation(v1.begin(), v1.end(), less<char>()); in nextprm2()
215 next_permutation(v1.begin(), v1.end(), less<char>()); in nextprm2()
219 next_permutation(v1.begin(), v1.end(), less<char>()); in nextprm2()
223 next_permutation(v1.begin(), v1.end(), less<char>()); in nextprm2()
|
| D | map_test.cpp | 49 typedef map<char, int, less<char> > maptype; in map1()
79 typedef multimap<char, int, less<char> > mmap; in mmap1()
121 typedef multimap<int, char, less<int> > mmap; in mmap2()
146 typedef map<int, char, less<int> > int_map; in iterators()
157 typedef multimap<int, char, less<int> > mmap; in iterators()
229 typedef map<char, int, less<char> > maptype; in equal_range()
276 typedef map<int, int, less<int>, StackAllocator<pair<const int, int> > > MapInt; in allocator_with_state()
277 less<int> intLess; in allocator_with_state()
|
| D | mvctor_declaration_test.cpp | 113 struct less<struct_with_specialized_less> { struct
142 struct __move_traits<less<struct_with_specialized_less> > {
296 CPPUNIT_ASSERT( is_move_complete(less<char>()) ); in movable_declaration_assoc()
298 CPPUNIT_ASSERT( !is_move_complete(less<struct_with_specialized_less>()) ); in movable_declaration_assoc()
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| D | PolynomialSolver.h | 110 std::less<Scalar> less; in smallestRoot() local
111 return selectComplexRoot_withRespectToNorm( less ); in smallestRoot()
236 std::less<Scalar> less; variable
237 return selectRealRoot_withRespectToAbsRealPart( less, hasArealRoot, absImaginaryThreshold );
282 std::less<Scalar> less; variable
283 return selectRealRoot_withRespectToRealPart( less, hasArealRoot, absImaginaryThreshold );
|
| /external/llvm/test/CodeGen/Generic/ |
| D | ConstantExprLowering.ll | 12 br i1 %t1, label %less, label %not_less
14 less: ; preds = %entry
17 not_less: ; preds = %less, %entry
18 …%t2 = phi i32 [ sub (i32 ptrtoint (i32* @XA to i32), i32 ptrtoint (i32* @XB to i32)), %less ], [ s…
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| D | prune.h | 89 NaturalLess<Weight> less; in Prune() local
93 if (less(ceiling, Times((*idistance)[state], (*fdistance)[state]))) { in Prune()
104 if(less(ceiling, weight)) { in Prune()
109 if (less(ceiling, Times((*idistance)[state], fst->Final(state)))) in Prune()
172 NaturalLess<Weight> less; in Prune() local
188 if (less(ceiling, Times((*idistance)[state], (*fdistance)[state]))) in Prune()
193 if (!less(ceiling, Times((*idistance)[state], ifst.Final(state)))) in Prune()
213 if (!less(ceiling, weight)) { in Prune()
|
| D | queue.h | 250 StateWeightCompare(const vector<Weight>* weights, const L &less) in StateWeightCompare() argument
251 : weights_(weights), less_(less) {} in StateWeightCompare()
529 NaturalLess<Weight> *less = 0; in AutoQueue() local
532 less = new NaturalLess<Weight>; in AutoQueue()
533 comp = new Compare(distance, *less); in AutoQueue()
538 SccQueueType(fst, scc_, &queue_types, filter, less, &all_trivial, in AutoQueue()
545 delete less; in AutoQueue() local
554 delete less; in AutoQueue() local
587 delete less; in AutoQueue() local
619 ArcFilter filter, Less *less,
[all …]
|
| /external/oprofile/libregex/tests/ |
| D | mangled-name.in | 20 map<int, image_name, less<int>, allocator<image_name> >
23 …tring_char_traits<char>, __default_alloc_template<true, 0> >, image_name, less<basic_string<char, …
26 multimap<int, long, less<int>, allocator<long> >
29 prefix_multimap<int, long, less<int>, allocator<long> >
30 prefix_multimap<int, long, less<int>, allocator<long>>
97 _Rb_tree<int, int, _Identity<int>, less<int>, allocator<int> >
100 _Rb_tree<string, pair<string const, int const>, _Select1st<pair<string const, int const>>, less<str…
120 _Rb_tree<int, pair<int const, long>, _Select1st<pair<int const, long> >, less<int>, allocator<long>…
123 _Rb_tree<int, pair<int const, long>, _Select1st<pair<int const, long> >, less<int>, allocator<pair<…
129 # strictly speaking 3rd parameters is less<ContainerType::value_type>
[all …]
|
| /external/clang/test/SemaTemplate/ |
| D | issue150.cpp | 75 template<typename > struct less ;
81 template <class X, template<class> class = less> struct interval_type_default {
86 template<class _T, template<class> class Compare = PR9016::less,
95 template<class _T, template<class> class Compare = PR9016::less,
|
| /external/oprofile/libregex/ |
| D | stl.pat.in | 43 # two pass, first shrink allocator<> then less<> allowing map with user defined
46 "\<(multi)?map<${typename}, ${typename}, less<\2>>" = "\1map<\2, \8>"
55 # strictly speaking 3rd parameters is less<ContainerType::value_type>
56 "\<priority_queue<${typename}, vector<\1>, less<\1>>" = "priority_queue<\1>"
57 # two pass, first shrink allocator<> then less<> allowing map with user defined
60 "\<(multi)?set<${typename}, less<\2>>" = "\1set<\2>"
73 "_Rb_tree<${typename}, \1, _Identity<\1>, less<\1>>" = "_Rb_tree<\1, \1, _Identity<\1>>"
75 …ct1st<pair<\1 const, \7>>, less<\1>, allocator<\7>>" = "_Rb_tree<\1, pair<\1 const, \7>, _Select1s…
77 …ir<\1 const, \7>>, less<\1>, allocator<pair<\1 const, \7>>>" = "_Rb_tree<\1, pair<\1 const, \7>, _…
79 …, pair<\1 const, (${typename}( const)?)>, _Select1st<pair<\1 const, \7>>, less<\1>>" = "_Rb_tree<\…
[all …]
|
| /external/openfst/src/include/fst/ |
| D | prune.h | 135 NaturalLess<Weight> less; in Prune() local
140 if (!less(limit, (*fdistance)[s])) { in Prune()
151 if (less(limit, Times(idistance[s], fst->Final(s)))) in Prune()
162 if (less(limit, weight)) { in Prune()
167 if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate])) in Prune()
236 NaturalLess<Weight> less; in Prune() local
237 if (less(opts.weight_threshold, Weight::One()) || in Prune()
277 if (!less(limit, Times(idistance[s], ifst.Final(s)))) in Prune()
288 if (less(limit, weight)) continue; in Prune()
294 if (less(Times(idistance[s], arc.weight), in Prune()
|
| D | queue.h | 281 StateWeightCompare(const vector<Weight>& weights, const L &less) in StateWeightCompare() argument
282 : weights_(weights), less_(less) {} in StateWeightCompare()
566 NaturalLess<Weight> *less = 0; in AutoQueue() local
569 less = new NaturalLess<Weight>; in AutoQueue()
570 comp = new Compare(*distance, *less); in AutoQueue()
575 SccQueueType(fst, scc_, &queue_types, filter, less, &all_trivial, in AutoQueue()
582 delete less; in AutoQueue() local
591 delete less; in AutoQueue() local
623 delete less; in AutoQueue() local
655 ArcFilter filter, Less *less,
[all …]
|
| /external/valgrind/main/docs/internals/ |
| D | howto_oprofile.txt | 16 | less
21 | less
26 | less
29 opannotate --merge=tgid --source --include-file=libhb_core.c | less
|
| /external/libvorbis/doc/ |
| D | 09-helper.tex | 18 \varname{[x]}. Values of \varname{[x]} less than zero are defined to return zero.
76 \varname{[codebook_dimensions]} is less than or equal to
84 the greatest value scalar element for which \varname{n} is less than
85 \varname{[x]} and vector \varname{[v]} element \varname{n} is less
91 the lowest value scalar element for which \varname{n} is less than
110 6) if ( [dy] is less than zero ) {
143 8) if ( [dy] is less than 0 ) {
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | stwu8.ll | 7 …ect1st<std::pair<const std::pair<const char *, const char *>, int>>, std::less<std::pair<const cha…
8 …less<std::pair<const char *, const char *>>, std::allocator<std::pair<const std::pair<const char *…
9 %"struct.std::less.16.98.508.533" = type { i8 }
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| D | 2009-04-27-Floating.ll | 14 %less = fcmp olt float %nexti, 2.0
15 br i1 %less, label %loop_body, label %done
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| D | ANTLRIntArray.m | 141 …umentException newException:[NSString stringWithFormat:@"Index %d must be less than count %d", anI…
144 …umentException newException:[NSString stringWithFormat:@"Index %d must be less than BuffSize %d", …
158 …umentException newException:[NSString stringWithFormat:@"Index %d must be less than count %d", anI…
161 …umentException newException:[NSString stringWithFormat:@"Index %d must be less than BuffSize %d", …
170 …umentException newException:[NSString stringWithFormat:@"Index %d must be less than count %d", anI…
173 …umentException newException:[NSString stringWithFormat:@"Index %d must be less than BuffSize %d", …
|
| /external/bzip2/ |
| D | bzmore | 10 *less) more=less ;;
|
| /external/clang/test/CXX/except/except.spec/ |
| D | canonical.cpp | 35 struct less struct
41 typedef __map_value_compare<int, short, less> __vc;
|
| /external/llvm/test/Transforms/GVN/ |
| D | 2009-03-10-PREOnVoid.ll | 13 …less<void*>,std::allocator<std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInf…
14 … > >,std::less<void*>,std::allocator<std::pair<void* const, std::vector<ShadowInfo, std::allocator…
37 …oid* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > > >,std::less<void*>,std::allocat…
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| D | CwiseOperators.h | 157 inline const EIGEN_CWISE_BINOP_RETURN_TYPE(std::less)
160 return EIGEN_CWISE_BINOP_RETURN_TYPE(std::less)(_expression(), other.derived());
212 inline const EIGEN_CWISE_COMP_TO_SCALAR_RETURN_TYPE(std::less)
215 return EIGEN_CWISE_COMP_TO_SCALAR_RETURN_TYPE(std::less)(_expression(),
|