| /external/bzip2/ |
| bzmore | 10 *less) more=less ;;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
| ctor_comp_rcontainer.pass.cpp | 36 std::priority_queue<MoveOnly> q(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
|
| ctor_iter_iter_comp_rcont.pass.cpp | 27 std::less<MoveOnly>(),
|
| assign_move.pass.cpp | 36 std::priority_queue<MoveOnly> qo(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
|
| ctor_move.pass.cpp | 36 std::priority_queue<MoveOnly> qo(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/ |
| less.hpp | 9 // Preprocessed version of "boost/mpl/less.hpp" header
67 struct less struct in namespace:boost::mpl
74 BOOST_MPL_AUX_LAMBDA_SUPPORT(2, less, (N1, N2))
78 BOOST_MPL_AUX_NA_SPEC2(2, 2, less)
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| checkers.h | 53 = std::less<typename std::iterator_traits<InputIterator>::
92 = std::less<typename std::iterator_traits<InputIterator>::
131 = std::less<typename std::iterator_traits
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkTSearch.h | 34 // The most general form of SkTSearch takes an array of T and a key of type K. A functor, less, is
38 template <typename T, typename K, typename LESS>
39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less)
55 if (less(*elem, key))
62 if (less(*elem, key)) {
65 } else if (less(key, *elem)) {
71 // Adapts a less-than function to a functor.
72 template <typename T, bool (LESS)(const T&, const T&)> struct SkTLessFunctionToFunctorAdaptor {
73 bool operator()(const T& a, const T& b) { return LESS(a, b);
[all...] |
| /external/clang/test/SemaTemplate/ |
| issue150.cpp | 76 template<typename > struct less ;
82 template <class X, template<class> class = less> struct interval_type_default {
87 template<class _T, template<class> class Compare = PR9016::less,
96 template<class _T, template<class> class Compare = PR9016::less,
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 110 std::less<Scalar> less; local
111 return selectComplexRoot_withRespectToNorm( less );
236 std::less<Scalar> less; local
237 return selectRealRoot_withRespectToAbsRealPart( less, hasArealRoot, absImaginaryThreshold );
282 std::less<Scalar> less; local
283 return selectRealRoot_withRespectToRealPart( less, hasArealRoot, absImaginaryThreshold );
|
| /external/skia/include/core/ |
| SkTSearch.h | 34 // The most general form of SkTSearch takes an array of T and a key of type K. A functor, less, is
38 template <typename T, typename K, typename LESS>
39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less)
55 if (less(*elem, key))
62 if (less(*elem, key)) {
65 } else if (less(key, *elem)) {
71 // Adapts a less-than function to a functor.
72 template <typename T, bool (LESS)(const T&, const T&)> struct SkTLessFunctionToFunctorAdaptor {
73 bool operator()(const T& a, const T& b) { return LESS(a, b);
[all...] |
| /external/stlport/test/unit/ |
| less_test.cpp | 34 sort(array, array + 4, less<int>());
|
| 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/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.access/ |
| empty.pass.cpp | 34 typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/ |
| empty.pass.cpp | 34 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/ |
| clear.pass.cpp | 44 typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
|
| empty.pass.cpp | 34 typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| initializer_list_compare.pass.cpp | 23 typedef test_compare<std::less<int> > Cmp;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| clear.pass.cpp | 44 typedef std::set<int, std::less<int>, min_allocator<int>> M;
|
| empty.pass.cpp | 34 typedef std::set<int, std::less<int>, min_allocator<int>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
| initializer_list_compare.pass.cpp | 23 typedef test_compare<std::less<int> > Cmp;
|
| iter_iter_comp.pass.cpp | 38 typedef test_compare<std::less<V> > C;
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| less_test.cpp | 34 sort(array, array + 4, less<int>());
|
| 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-stlport/unit/ |
| less_test.cpp | 34 sort(array, array + 4, less<int>());
|
