| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| move_assign.pass.cpp | 29 typedef test_compare<std::less<MoveOnly> > C;
68 typedef test_compare<std::less<MoveOnly> > C;
107 typedef test_compare<std::less<MoveOnly> > C;
148 typedef test_compare<std::less<MoveOnly> > C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| max_size.pass.cpp | 30 typedef std::set<int, std::less<int>, min_allocator<int>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
| alloc.pass.cpp | 23 typedef std::less<int> C;
|
| compare.pass.cpp | 23 typedef test_compare<std::less<int> > C;
|
| default.pass.cpp | 30 std::set<int, std::less<int>, min_allocator<int>> m;
|
| move_assign.pass.cpp | 29 typedef test_compare<std::less<MoveOnly> > C;
68 typedef test_compare<std::less<MoveOnly> > C;
107 typedef test_compare<std::less<MoveOnly> > C;
147 typedef test_compare<std::less<MoveOnly> > C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
| ctor_comp.pass.cpp | 21 std::priority_queue<int, std::vector<int, stack_allocator<int, 10> > > q((std::less<int>()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.obs/ |
| not_less_than.fail.cpp | 14 // not less than comparable
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
| begin_end.hpp | 26 // happy this way (less ETI-related errors), and it doesn't affect
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| queue_test.cpp | 35 priority_queue<int, deque<int>, less<int> > q;
|
| /ndk/tests/device/test-stlport/unit/ |
| queue_test.cpp | 35 priority_queue<int, deque<int>, less<int> > q;
|
| /packages/apps/Contacts/res/layout/ |
| edit_expansion_view.xml | 18 <!-- "More" or "less" expansion button in the contact editor. -->
|
| /packages/apps/ContactsCommon/res/values-sw600dp/ |
| integers.xml | 21 <!-- Yikes, there is less space on a tablet! This makes the search experience rather
|
| /packages/apps/ContactsCommon/src/com/android/contacts/common/database/ |
| EmptyCursor.java | 25 * If you want an empty cursor, this class is better than a MatrixCursor because it has less
|
| /packages/inputmethods/PinyinIME/jni/include/ |
| utf16reader.h | 32 // Always less than buffer_total_len_ - buffer_next_pos_
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/util/ |
| MemoryUtils.java | 30 * (in other words: this is probably less than the "RAM: 1 GB" that was printed on the
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/java/ |
| java-tree.def | 26 less, equal, or greater to the second argument. */
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/java/ |
| java-tree.def | 26 less, equal, or greater to the second argument. */
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/java/ |
| java-tree.def | 26 less, equal, or greater to the second argument. */
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/java/ |
| java-tree.def | 26 less, equal, or greater to the second argument. */
|
| /prebuilts/python/darwin-x86/2.7.5/include/python2.7/ |
| token.h | 32 #define LESS 20
|
| /prebuilts/python/linux-x86/2.7.5/include/python2.7/ |
| token.h | 32 #define LESS 20
|
| /frameworks/base/graphics/java/android/renderscript/ |
| ProgramStore.java | 53 * Drawn if the incoming depth value is less than that in the
56 LESS (1),
58 * Drawn if the incoming depth value is less or equal to that in
230 * - incoming pixels are drawn if their depth value is less than
241 builder.setDepthFunc(ProgramStore.DepthFunc.LESS);
273 * - incoming pixels are drawn if their depth value is less than
286 builder.setDepthFunc(ProgramStore.DepthFunc.LESS);
|
| /external/openfst/src/include/fst/ |
| prune.h | 135 NaturalLess<Weight> less; local
140 if (!less(limit, (*fdistance)[s])) {
151 if (less(limit, Times(idistance[s], fst->Final(s))))
162 if (less(limit, weight)) {
167 if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate]))
236 NaturalLess<Weight> less;
237 if (less(opts.weight_threshold, Weight::One()) ||
277 if (!less(limit, Times(idistance[s], ifst.Final(s))))
288 if (less(limit, weight)) continue;
294 if (less(Times(idistance[s], arc.weight)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.access/ |
| iterator.pass.cpp | 152 std::map<int, double, std::less<int>, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
155 std::map<int, double, std::less<int>, min_allocator<V>>::iterator i;
157 std::map<int, double, std::less<int>, min_allocator<V>>::const_iterator k = i;
196 const std::map<int, double, std::less<int>, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
201 std::map<int, double, std::less<int>, min_allocator<V>>::const_iterator i;
|
