| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| move_noexcept.pass.cpp | 39 typedef std::multiset<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C;
43 typedef std::multiset<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.special/ |
| swap_noexcept.pass.cpp | 45 typedef std::multiset<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C;
50 typedef std::multiset<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
| default_noexcept.pass.cpp | 41 typedef std::set<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C;
45 typedef std::set<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C;
|
| dtor_noexcept.pass.cpp | 39 typedef std::set<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C;
43 typedef std::set<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C;
|
| move_noexcept.pass.cpp | 39 typedef std::set<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C;
43 typedef std::set<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.special/ |
| swap_noexcept.pass.cpp | 45 typedef std::set<MoveOnly, std::less<MoveOnly>, test_allocator<MoveOnly>> C;
50 typedef std::set<MoveOnly, std::less<MoveOnly>, other_allocator<MoveOnly>> C;
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
| advance.hpp | 18 #include <boost/mpl/less.hpp>
38 typedef typename less< N,long_<0> >::type backward_;
|
| /system/core/gatekeeperd/ |
| SoftGateKeeperDevice.h | 44 * Returns: 0 on success or an error code less than 0 on error.
63 * Returns: 0 on success or an error code less than 0 on error
|
| /system/core/include/system/ |
| thread_defs.h | 35 * a thread will do, the less favorable priority it should get so that
39 * acceptable, preferably use the {MORE|LESS}_FAVORABLE constants below.
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRIntArray.m | 141 @throw [ANTLRIllegalArgumentException newException:[NSString stringWithFormat:@"Index %d must be less than count %d", anIndex, count]];
144 @throw [ANTLRIllegalArgumentException newException:[NSString stringWithFormat:@"Index %d must be less than BuffSize %d", anIndex, BuffSize]];
158 @throw [ANTLRIllegalArgumentException newException:[NSString stringWithFormat:@"Index %d must be less than count %d", anIndex, count]];
161 @throw [ANTLRIllegalArgumentException newException:[NSString stringWithFormat:@"Index %d must be less than BuffSize %d", anIndex, BuffSize]];
170 @throw [ANTLRIllegalArgumentException newException:[NSString stringWithFormat:@"Index %d must be less than count %d", anIndex, count]];
173 @throw [ANTLRIllegalArgumentException newException:[NSString stringWithFormat:@"Index %d must be less than BuffSize %d", anIndex, BuffSize]];
|
| /external/lldb/source/Plugins/Process/Utility/ |
| ARMDefines.h | 33 #define COND_CC 0x3 // Carry clear Less than C == 0
35 #define COND_MI 0x4 // Minus, negative Less than N == 1
40 #define COND_LS 0x9 // Unsigned lower or same Less than or equal C == 0 or Z == 1
42 #define COND_LT 0xB // Less than Less than, or unordered N != V
44 #define COND_LE 0xD // Less than or equal <, ==, or unordered Z == 1 or N != V
|
| /external/skia/src/gpu/gl/ |
| GrGLGpuProgramCache.cpp | 35 return GrProgramDesc::Less(desc, entry->fProgram->getDesc());
40 return GrProgramDesc::Less(entry->fProgram->getDesc(), desc);
89 ProgDescLess less; local
90 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
180 SkASSERT(GrProgramDesc::Less(a, b));
181 SkASSERT(!GrProgramDesc::Less(b, a));
|
| /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/framework/jdwp/ |
| Packet.java | 99 + "is less than header size = " + HEADER_SIZE);
519 * value. If length is less than 8 bytes, the appropriate high bits in the
544 * value. If length is less than 8 bytes, the appropriate high bits in the
564 * value. If length is less than 8 bytes, the appropriate high bits in the
576 * value. If length is less than 8 bytes, the appropriate high bits in the
587 * VM-sensitive value. If length is less than 8 bytes, the appropriate high
599 * VM-sensitive value. If length is less than 8 bytes, the appropriate high
610 * value. If length is less than 8 bytes, the appropriate high bits in the
622 * value. If length is less than 8 bytes, the appropriate high bits in the
633 * VM-sensitive value. If length is less than 8 bytes, the appropriate hig
[all...] |
| /external/libvorbis/doc/ |
| helper.html | 86 <tt>[x]</tt>. Values of <tt>[x]</tt> less than zero are defined to return zero.</p>
139 [codebook_dimensions] is less than or equal to
145 the greatest value scalar element for which <i>n</i> is less than
146 <tt>[x]</tt> and <tt>vector [v] element <i>n</i> is less
152 the lowest value scalar element for which <i>n</i> is less than
169 6) if ( [dy] is less than zero ) {
199 8) if ( [dy] is less than 0 ) {
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| mvctor_declaration_test.cpp | 113 struct less<struct_with_specialized_less> { struct in namespace:std
142 struct __move_traits<less<struct_with_specialized_less> > {
293 //For associative containers it is important that less is correctly recognize as
294 //the STLport less or a user specialized less:
296 CPPUNIT_ASSERT( is_move_complete(less<char>()) );
298 CPPUNIT_ASSERT( !is_move_complete(less<struct_with_specialized_less>()) );
|
| /ndk/tests/device/test-stlport/unit/ |
| mvctor_declaration_test.cpp | 113 struct less<struct_with_specialized_less> { struct in namespace:std
142 struct __move_traits<less<struct_with_specialized_less> > {
293 //For associative containers it is important that less is correctly recognize as
294 //the STLport less or a user specialized less:
296 CPPUNIT_ASSERT( is_move_complete(less<char>()) );
298 CPPUNIT_ASSERT( !is_move_complete(less<struct_with_specialized_less>()) );
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 111 std::less<Scalar> less; local
112 return selectComplexRoot_withRespectToNorm( less );
239 std::less<Scalar> less; local
240 return selectRealRoot_withRespectToAbsRealPart( less, hasArealRoot, absImaginaryThreshold );
285 std::less<Scalar> less; local
286 return selectRealRoot_withRespectToRealPart( less, hasArealRoot, absImaginaryThreshold );
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| iterator.pass.cpp | 146 std::multiset<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
149 std::multiset<int, std::less<int>, min_allocator<int>>::iterator i;
151 std::multiset<int, std::less<int>, min_allocator<int>>::const_iterator k = i;
186 const std::multiset<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
191 std::multiset<int, std::less<int>, min_allocator<int>>::const_iterator i;
|
| /external/libcxx/test/std/containers/associative/set/ |
| iterator.pass.cpp | 144 std::set<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
147 std::set<int, std::less<int>, min_allocator<int>>::iterator i;
149 std::set<int, std::less<int>, min_allocator<int>>::const_iterator k = i;
183 const std::set<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
188 std::set<int, std::less<int>, min_allocator<int>>::const_iterator i;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| iterator.pass.cpp | 146 std::multiset<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
149 std::multiset<int, std::less<int>, min_allocator<int>>::iterator i;
151 std::multiset<int, std::less<int>, min_allocator<int>>::const_iterator k = i;
186 const std::multiset<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
191 std::multiset<int, std::less<int>, min_allocator<int>>::const_iterator i;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| iterator.pass.cpp | 144 std::set<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
147 std::set<int, std::less<int>, min_allocator<int>>::iterator i;
149 std::set<int, std::less<int>, min_allocator<int>>::const_iterator k = i;
183 const std::set<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
188 std::set<int, std::less<int>, min_allocator<int>>::const_iterator i;
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| ColorTest.java | 45 //abnormal case: hsv length less than 3
60 //abnormal case: hsv length less than 3
118 //abnormal case: hsv length less than 3
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/ |
| PeriodBuilderFactory.java | 106 * single largest period less than or equal to the duration.
114 * starting with the largest period less than or equal to the duration.
124 * starting with the largest unit less than or equal to the
|
| /external/libcxx/test/std/containers/associative/map/map.cons/ |
| initializer_list_compare_alloc.pass.cpp | 27 typedef test_compare<std::less<int> > C;
51 typedef test_compare<std::less<int> > C;
76 typedef test_compare<std::less<int> > C;
|
| iter_iter_comp_alloc.pass.cpp | 41 typedef test_compare<std::less<int> > C;
67 typedef test_compare<std::less<int> > C;
95 typedef test_compare<std::less<int> > C;
|
