| /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)) {
|
| queue.h | 240 // Given a vector that maps from states to weights and a Less
246 typedef L Less;
250 StateWeightCompare(const vector<Weight>* weights, const L &less)
251 : weights_(weights), less_(less) {}
529 NaturalLess<Weight> *less = 0; local
532 less = new NaturalLess<Weight>;
533 comp = new Compare(distance, *less);
538 SccQueueType(fst, scc_, &queue_types, filter, less, &all_trivial,
545 delete less;
554 delete less;
[all...] |
| /external/stlport/stlport/stl/ |
| _function_base.h | 70 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<_Tp>();
[all...] |
| /external/stlport/test/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>()) );
|
| set_test.cpp | 58 set<int, less<int> > s;
70 typedef set<int, less<int> > int_set;
96 set<int, less<int> > s;
214 struct less<SetTestClass> { struct in namespace:std
285 typedef set<int, less<int>, StackAllocator<int> > SetInt;
286 less<int> intLess;
|
| /dalvik/libcore/luni/src/main/java/java/util/ |
| DualPivotQuicksort.java | 45 * If the length of an array to be sorted is less than this
166 int less = left + 1; // The index of first element of center part local
181 * less k great
185 * all in (left, less) < pivot1
186 * pivot1 <= all in [less, k) <= pivot2
192 for (int k = less; k <= great; k++) {
195 if (k != less) {
196 a[k] = a[less];
197 a[less] = ak;
199 less++
444 int less = left + 1; \/\/ The index of first element of center part local
739 int less = left + 1; \/\/ The index of first element of center part local
1032 int less = left + 1; \/\/ The index of first element of center part local
1327 int less = left + 1; \/\/ The index of first element of center part local
1700 int less = left + 1; \/\/ The index of first element of center part local
2073 int less = left + 1; \/\/ The index of first element of center part local
[all...] |
| /external/webkit/JavaScriptCore/jit/ |
| ExecutableAllocatorFixedVMPool.cpp | 55 , less(0)
69 FreeListEntry* less; member in struct:JSC::FreeListEntry
82 handle get_less(handle h) { return h->less; }
83 void set_less(handle h, handle lh) { h->less = lh; }
|
| /external/stlport/stlport/stl/pointers/ |
| _set.h | 36 _STLP_EXPORT template struct _STLP_CLASS_DECLSPEC less<void*>; variable in typeref:struct:_STLP_CLASS_DECLSPEC
44 _STLP_EXPORT_TEMPLATE_CLASS _DbgCompare<void*, less<void*> >;
46 _STLP_EXPORT_TEMPLATE_CLASS _Rb_tree<void*, _DbgCompare<void*, less<void*> >, void*, _Identity<void*>,
50 _STLP_EXPORT_TEMPLATE_CLASS _Rb_tree<void*, less<void*>, void*, _Identity<void*>,
55 template <class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key>),
302 template <class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key>),
|
| /external/v8/src/ia32/ |
| assembler-ia32.h | 130 less = 12, enumerator in enum:v8::internal::Condition
162 case less:
165 return less;
800 // Check if there is less than kGap bytes available in the buffer.
|
| /external/v8/src/mips/ |
| constants-mips.h | 310 less = 12, enumerator in enum:assembler::mips::Condition
336 OLT, // Ordered or Less Than
337 ULT, // Unordered or Less Than
338 OLE, // Ordered or Less Than or Equal
339 ULE // Unordered or Less Than or Equal
|
| /external/v8/src/x64/ |
| assembler-x64.h | 194 less = 12, enumerator in enum:v8::internal::Condition
231 case less:
234 return less;
[all...] |
| /external/webkit/WebKit/android/nav/ |
| CachedRoot.cpp | 1432 SkIRect less; local
[all...] |
