| /external/valgrind/main/massif/tests/ |
| insig.vgtest | 1 # At one point, thresholds less than 1.0% were misprinted as 00.00%, so test that here.
|
| /external/valgrind/main/none/tests/ppc32/ |
| bug139050-ppc32.c | 30 /* implausible that machine has been up less than 4G cycles */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/usr/include/asm-generic/ |
| poll.h | 12 /* The rest seem to be more-or-less nonstandard. Check them! */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/asm-generic/ |
| poll.h | 12 /* The rest seem to be more-or-less nonstandard. Check them! */
|
| /external/oprofile/libregex/tests/ |
| mangled-name.in | 20 map<int, image_name, less<int>, allocator<image_name> >
23 map<basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >, image_name, less<basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > >, allocator<image_name> >
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<string>, allocator<int const>>
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<int const, long> > >
129 # strictly speaking 3rd parameters is less<ContainerType::value_type
[all...] |
| /external/chromium_org/content/renderer/media/ |
| cache_util.h | 26 kShortMaxAge = 1 << 3, // Max age less than 1h (arbitrary value).
27 kExpiresTooSoon = 1 << 4, // Expires in less than 1h (arbitrary value).
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| decoll.cpp | 88 { Collator::LESS, Collator::LESS },
89 { Collator::EQUAL, Collator::LESS },
93 { Collator::EQUAL, Collator::LESS },
95 { Collator::LESS, Collator::LESS },
98 { Collator::LESS, Collator::LESS },
|
| frcoll.cpp | 78 Collator::LESS,
79 Collator::LESS,
80 Collator::LESS, /*Collator::GREATER,*/
81 Collator::LESS,
84 Collator::LESS,
86 Collator::LESS, /*Collator::GREATER,*/
88 Collator::LESS,
89 Collator::LESS
175 expected = Collator::LESS;
194 doTest(myCollation, testBugs[i], testBugs[j], Collator::LESS);
[all...] |
| encoll.cpp | 134 Collator::LESS,
135 Collator::LESS, /*Collator::GREATER,*/
136 Collator::LESS,
140 Collator::LESS,
141 Collator::LESS,
142 Collator::LESS,
143 Collator::LESS, /*Collator::GREATER,*/ /* 10 */
145 Collator::LESS,
147 Collator::LESS,
151 Collator::LESS,
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/dwarf2/tests/pass32/ |
| dwarf32-err.errwarn | 4 -:4: error: file number less than one
19 -:30: error: isa value less than zero
|
| /external/clang/test/CXX/except/except.spec/ |
| canonical.cpp | 36 struct less struct in namespace:std
42 typedef __map_value_compare<int, short, less> __vc;
|
| /external/hamcrest/library/src/org/hamcrest/number/ |
| OrderingComparisons.java | 27 return describedAs("a value less than %0",
34 return describedAs("a value less than or equal to %0",
|
| /external/icu/icu4c/source/test/intltest/ |
| decoll.cpp | 88 { Collator::LESS, Collator::LESS },
89 { Collator::EQUAL, Collator::LESS },
93 { Collator::EQUAL, Collator::LESS },
95 { Collator::LESS, Collator::LESS },
98 { Collator::LESS, Collator::LESS },
|
| frcoll.cpp | 78 Collator::LESS,
79 Collator::LESS,
80 Collator::LESS, /*Collator::GREATER,*/
81 Collator::LESS,
84 Collator::LESS,
86 Collator::LESS, /*Collator::GREATER,*/
88 Collator::LESS,
89 Collator::LESS
175 expected = Collator::LESS;
194 doTest(myCollation, testBugs[i], testBugs[j], Collator::LESS);
[all...] |
| encoll.cpp | 134 Collator::LESS,
135 Collator::LESS, /*Collator::GREATER,*/
136 Collator::LESS,
140 Collator::LESS,
141 Collator::LESS,
142 Collator::LESS,
143 Collator::LESS, /*Collator::GREATER,*/ /* 10 */
145 Collator::LESS,
147 Collator::LESS,
151 Collator::LESS,
[all...] |
| /external/llvm/cmake/modules/ |
| LLVM-Config.cmake | 92 if( NOT idx LESS 0 )
124 else( NOT idx LESS 0 )
128 if( lib_idx LESS 0 )
134 else( lib_idx LESS 0 )
137 endif( lib_idx LESS 0 )
138 endif( NOT idx LESS 0 )
150 while( cursor LESS lst_size )
165 endwhile( cursor LESS lst_size )
|
| /external/llvm/test/CodeGen/Mips/ |
| tnaked.ll | 28 attributes #0 = { naked noinline nounwind "less-precise-fpmad"="false" "no-frame-pointer-elim"="true" "no-frame-pointer-elim-non-leaf" "no-infs-fp-math"="false" "no-nans-fp-math"="false" "unsafe-fp-math"="false" "use-soft-float"="false" }
29 attributes #1 = { nounwind "less-precise-fpmad"="false" "no-frame-pointer-elim"="true" "no-frame-pointer-elim-non-leaf" "no-infs-fp-math"="false" "no-nans-fp-math"="false" "unsafe-fp-math"="false" "use-soft-float"="false" }
|
| /external/llvm/test/CodeGen/R600/ |
| bfe_uint.ll | 17 ; implmented with a LSHR instruction, which is better, because LSHR has less
18 ; operands and requires less constants.
|
| /external/lzma/CPP/7zip/ |
| IStream.h | 22 This function is allowed to read less than number of remaining bytes in stream.
32 This function is allowed to write less than "size".
|
| /external/tcpdump/tests/ |
| ripv1v2.out | 11 RIPv2, Request, length: 24, routes: 1 or less
15 RIPv2, Response, length: 24, routes: 1 or less
|
| /external/oprofile/libregex/ |
| 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 "\<_Rb_tree<${typename}, pair<\1 const, (${typename}( const)?)>, _Select1st<pair<\1 const, \7>>, less<\1>, allocator<\7>>" = "_Rb_tree<\1, pair<\1 const, \7>, _Select1st<pair<\1 const, \7>>, less<\1>>"
77 "\<_Rb_tree<${typename}, pair<\1 const, ${typename}>, _Select1st<pair<\1 const, \7>>, less<\1>, allocator<pair<\1 const, \7>>>" = "_Rb_tree<\1, pair<\1 const, \7>, _Select1st<pair<\1 const, (…)
[all...] |
| /external/chromium_org/chrome/browser/safe_browsing/ |
| safe_browsing_store.cc | 15 template <typename CTI, typename LESS>
16 bool sorted(CTI beg, CTI end, LESS less) {
19 if (less(*beg, *n))
104 // Scan prefixes forward until an item is not less than the current hash.
114 // If the current hash is also not less than the prefix, that implies they
144 // to qualify things. It becomes very arbitrary, though, and less
|
| /external/libvorbis/doc/ |
| 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/stlport/test/unit/ |
| perm_test.cpp | 191 next_permutation(v1.begin(), v1.end(), less<char>());
195 next_permutation(v1.begin(), v1.end(), less<char>());
199 next_permutation(v1.begin(), v1.end(), less<char>());
203 next_permutation(v1.begin(), v1.end(), less<char>());
207 next_permutation(v1.begin(), v1.end(), less<char>());
211 next_permutation(v1.begin(), v1.end(), less<char>());
215 next_permutation(v1.begin(), v1.end(), less<char>());
219 next_permutation(v1.begin(), v1.end(), less<char>());
223 next_permutation(v1.begin(), v1.end(), less<char>());
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| perm_test.cpp | 191 next_permutation(v1.begin(), v1.end(), less<char>());
195 next_permutation(v1.begin(), v1.end(), less<char>());
199 next_permutation(v1.begin(), v1.end(), less<char>());
203 next_permutation(v1.begin(), v1.end(), less<char>());
207 next_permutation(v1.begin(), v1.end(), less<char>());
211 next_permutation(v1.begin(), v1.end(), less<char>());
215 next_permutation(v1.begin(), v1.end(), less<char>());
219 next_permutation(v1.begin(), v1.end(), less<char>());
223 next_permutation(v1.begin(), v1.end(), less<char>());
|
