/external/curl/lib/ |
splay.h | 28 struct Curl_tree *smaller; /* smaller node */ member in struct:Curl_tree
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/duration/ |
TimeUnit.java | 65 /** Returns the next smaller time unit, or null if this is the smallest. */ 66 public TimeUnit smaller() { method in class:TimeUnit
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 238 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 240 if (smaller)
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 238 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 240 if (smaller)
|
/art/cmdline/ |
token_range.h | 202 auto& smaller = Size() < other.Size() ? *this : other; local 205 return std::equal(smaller.begin(), smaller.end(), greater.begin()); 384 static bool StartsWith(const std::string& larger, const std::string& smaller) { 385 if (larger.size() >= smaller.size()) { 386 return std::equal(smaller.begin(), smaller.end(), larger.begin()); 395 // we need to remove them and compress the token list into a smaller one.
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/ |
TimeUnit.java | 63 /** Returns the next smaller time unit, or null if this is the smallest. */ 64 public TimeUnit smaller() { method in class:TimeUnit
|
/external/tensorflow/tensorflow/compiler/xla/tests/ |
select_test.cc | 165 float smaller = i; local 169 v2vec.push_back(smaller); 171 v1vec.push_back(smaller);
|
vector_ops_simple_test.cc | 250 float smaller = i; local 254 v2vec.push_back(smaller); 256 v1vec.push_back(smaller);
|
tuple_test.cc | 300 auto smaller = b.GetTupleElement(sorted, 0); local 302 b.Add(greater, b.Mul(b.ConstantR0<float>(100.0f), smaller));
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
AbstractTableReadTest.java | 125 Table<String, Integer, Character> smaller local 134 .addEqualityGroup(smaller)
|
ArrayTableTest.java | 120 Table<String, Integer, Character> smaller local 130 .addEqualityGroup(smaller)
|
/external/guava/guava-tests/test/com/google/common/collect/ |
AbstractTableReadTest.java | 127 Table<String, Integer, Character> smaller local 136 .addEqualityGroup(smaller)
|
ArrayTableTest.java | 122 Table<String, Integer, Character> smaller local 132 .addEqualityGroup(smaller)
|
/external/skia/src/codec/ |
SkAndroidCodec.cpp | 262 auto smaller = this->getSampledDimensions(sampleSize + 1); local 263 if (smaller == *desiredSize) { 266 if (smaller == computedSize || smaller_than(smaller, *desiredSize)) { 267 // Cannot get any smaller without being smaller than desired. 273 computedSize = smaller;
|
/external/skqp/src/codec/ |
SkAndroidCodec.cpp | 262 auto smaller = this->getSampledDimensions(sampleSize + 1); local 263 if (smaller == *desiredSize) { 266 if (smaller == computedSize || smaller_than(smaller, *desiredSize)) { 267 // Cannot get any smaller without being smaller than desired. 273 computedSize = smaller;
|
/external/selinux/python/sepolgen/src/sepolgen/ |
yacc.py | 1832 smaller = 1 variable [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/sepolgen/ |
yacc.py | 1832 smaller = 1 variable [all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
trees.c | 443 #define smaller(tree, n, m, depth) \
macro 450 * when the heap property is re-established (each father smaller than its
463 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
466 /* Exit if v is smaller than both sons */
467 if (smaller(tree, v, s->heap[j], s->depth)) break;
[all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
trees.c | 445 #define smaller(tree, n, m, depth) \
macro 452 * when the heap property is re-established (each father smaller than its
465 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
468 /* Exit if v is smaller than both sons */
469 if (smaller(tree, v, s->heap[j], s->depth)) break;
[all...] |
/external/python/cpython2/Modules/zlib/ |
trees.c | 443 #define smaller(tree, n, m, depth) \ macro 450 * when the heap property is re-established (each father smaller than its 463 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 466 /* Exit if v is smaller than both sons */ 467 if (smaller(tree, v, s->heap[j], s->depth)) break; [all...] |
/external/python/cpython3/Modules/zlib/ |
trees.c | 441 #define smaller(tree, n, m, depth) \ macro 448 * when the heap property is re-established (each father smaller than its 461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 464 /* Exit if v is smaller than both sons */ 465 if (smaller(tree, v, s->heap[j], s->depth)) break; [all...] |
/external/syslinux/com32/lib/zlib/ |
trees.c | 449 #define smaller(tree, n, m, depth) \ macro 456 * when the heap property is re-established (each father smaller than its 469 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 472 /* Exit if v is smaller than both sons */ 473 if (smaller(tree, v, s->heap[j], s->depth)) break; [all...] |
/external/zlib/src/ |
trees.c | 441 #define smaller(tree, n, m, depth) \ macro 448 * when the heap property is re-established (each father smaller than its 461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 464 /* Exit if v is smaller than both sons */ 465 if (smaller(tree, v, s->heap[j], s->depth)) break; [all...] |
/toolchain/binutils/binutils-2.27/zlib/ |
trees.c | 443 #define smaller(tree, n, m, depth) \ macro 450 * when the heap property is re-established (each father smaller than its 463 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 466 /* Exit if v is smaller than both sons */ 467 if (smaller(tree, v, s->heap[j], s->depth)) break; [all...] |
/libcore/luni/src/main/java/java/math/ |
BigDecimal.java | 787 BigDecimal smaller; // operand with the smallest unscaled value local 799 smaller = this; 802 smaller = augend; 812 if (largerSignum == smaller.signum()) { [all...] |