Searched refs:less (Results 1 - 25 of 218) sorted by relevance

123456789

/external/chromium_org/content/browser/
H A Dstorage_partition_impl_map_unittest.cc31 StoragePartitionImplMap::StoragePartitionConfigLess less; local
34 EXPECT_TRUE(less(c1, c3));
35 EXPECT_TRUE(less(c1, c4));
36 EXPECT_TRUE(less(c3, c4));
37 EXPECT_TRUE(less(c4, c5));
38 EXPECT_TRUE(less(c4, c8));
39 EXPECT_TRUE(less(c6, c4));
40 EXPECT_TRUE(less(c6, c7));
41 EXPECT_TRUE(less(c8, c9));
44 EXPECT_FALSE(less(c
[all...]
/external/valgrind/main/none/tests/s390x/
H A Dcgij.stdout.exp7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
H A Dcgrj.stdout.exp7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
H A Dcij.stdout.exp7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
H A Dclgij.stdout.exp7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
H A Dclgrj.stdout.exp7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
H A Dclij.stdout.exp7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
H A Dclrj.stdout.exp7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
H A Dcrj.stdout.exp7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/performance/ui/
H A Dmessages.properties14 standardError = Standard error on this test is {0} (should be less than {1} to become reliable!)
/external/clang/test/CXX/except/except.spec/
H A Dcanonical.cpp36 struct less struct in namespace:std
42 typedef __map_value_compare<int, short, less> __vc;
/external/bzip2/
H A Dbzmore10 *less) more=less ;;
/external/clang/test/SemaTemplate/
H A Dissue150.cpp76 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/chromium_org/third_party/skia/include/core/
H A DSkTSearch.h34 // The most general form of SkTSearch takes an array of T and a key of type K. A functor, less, is
39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) argument
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.
/external/eigen/unsupported/Eigen/src/Polynomials/
H A DPolynomialSolver.h110 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/
H A DSkTSearch.h34 // The most general form of SkTSearch takes an array of T and a key of type K. A functor, less, is
39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) argument
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.
/external/stlport/test/unit/
H A Dless_test.cpp34 sort(array, array + 4, less<int>());
H A Dperm_test.cpp191 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>());
H A Dqueue_test.cpp35 priority_queue<int, deque<int>, less<int> > q;
/external/chromium_org/tools/memory_watcher/
H A Dmemory_watcher.h33 typedef std::map<int32, AllocationStack*, std::less<int32>,
35 typedef std::map<int32, StackTrack, std::less<int32>,
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dprune.h89 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)) {
/external/stlport/stlport/stl/
H A D_function_base.h70 struct less : public binary_function<_Tp,_Tp,bool> struct in inherits:binary_function,__stlport_class
72 /* less is the default template parameter for many STL containers, to fully use
73 * the move constructor feature we need to know that the default less is just a
76 , public __stlport_class<less<_Tp> >
82 void _M_swap_workaround(less<_Tp>& __x) {}
88 struct __type_traits<less<_Tp> > {
90 typedef typename _IsSTLportClass<less<_Tp> >::_Ret _STLportLess;
92 enum { _Is = _IsSTLportClass<less<_Tp> >::_Is };
106 less<_Tp> __less(_Tp* ) { return less<_T
[all...]
/external/openfst/src/include/fst/
H A Dprune.h135 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(Time
[all...]
/external/libvorbis/doc/
H A D09-helper.tex18 \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/chromium_org/content/browser/indexed_db/leveldb/
H A Dleveldb_transaction.h48 AVLTreeNode* less; member in struct:content::LevelDBTransaction::AVLTreeNode
59 handle GetLess(handle h) { return h->less; }
60 void SetLess(handle h, handle less) { h->less = less; } argument

Completed in 512 milliseconds

123456789