| /ndk/tests/device/test-stlport/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>());
|
| /dalvik/vm/mterp/x86/ |
| OP_FILLED_NEW_ARRAY.S | 20 # less frequent path, so we'll redo some work
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| prune.h | 89 NaturalLess<Weight> less; local
93 if (less(ceiling, Times((*idistance)[state], (*fdistance)[state]))) {
104 if(less(ceiling, weight)) {
109 if (less(ceiling, Times((*idistance)[state], fst->Final(state))))
172 NaturalLess<Weight> less; local
188 if (less(ceiling, Times((*idistance)[state], (*fdistance)[state])))
193 if (!less(ceiling, Times((*idistance)[state], ifst.Final(state))))
213 if (!less(ceiling, weight)) {
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/ |
| initializer_list_compare.pass.cpp | 26 typedef test_compare<std::less<int> > C;
48 typedef test_compare<std::less<int> > C;
|
| initializer_list_compare_alloc.pass.cpp | 27 typedef test_compare<std::less<int> > C;
51 typedef test_compare<std::less<int> > C;
|
| iter_iter_comp.pass.cpp | 39 typedef test_compare<std::less<int> > C;
63 typedef test_compare<std::less<int> > C;
|
| assign_initializer_list.pass.cpp | 51 std::map<int, double, std::less<int>, min_allocator<V>> m =
|
| initializer_list.pass.cpp | 47 std::map<int, double, std::less<int>, min_allocator<V>> m =
|
| move.pass.cpp | 28 typedef test_compare<std::less<int> > C;
55 typedef test_compare<std::less<int> > C;
74 typedef test_compare<std::less<int> > C;
101 typedef test_compare<std::less<int> > C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.cons/ |
| copy_alloc.pass.cpp | 39 typedef test_compare<std::less<int> > C;
65 typedef test_compare<std::less<int> > C;
|
| initializer_list_compare.pass.cpp | 25 typedef test_compare<std::less<int> > Cmp;
58 typedef test_compare<std::less<int> > Cmp;
|
| copy.pass.cpp | 39 typedef test_compare<std::less<int> > C;
65 typedef test_compare<std::less<int> > C;
92 typedef test_compare<std::less<int> > C;
|
| copy_assign.pass.cpp | 39 typedef test_compare<std::less<int> > C;
65 typedef test_compare<std::less<int> > C;
92 typedef test_compare<std::less<int> > C;
|
| /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;
|
| insert_iter_iter.pass.cpp | 50 typedef std::set<int, std::less<int>, min_allocator<int>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
| move.pass.cpp | 28 typedef test_compare<std::less<int> > C;
56 typedef test_compare<std::less<int> > C;
88 typedef test_compare<std::less<int> > C;
|
| /external/stlport/test/unit/ |
| queue_test.cpp | 35 priority_queue<int, deque<int>, less<int> > q;
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| RealPath.h | 55 struct less<mcld::sys::fs::RealPath> : public binary_function< struct in namespace:std
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.access/ |
| index_rv_key.pass.cpp | 44 std::map<MoveOnly, double, std::less<MoveOnly>, min_allocator<V>> m;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| clear.pass.cpp | 44 typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
|
| insert_initializer_list.pass.cpp | 49 std::map<int, double, std::less<int>, min_allocator<V>> m =
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| clear.pass.cpp | 44 typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| initializer_list_compare_alloc.pass.cpp | 24 typedef test_compare<std::less<int> > Cmp;
|
| iter_iter_comp.pass.cpp | 38 typedef test_compare<std::less<V> > C;
|
