HomeSort by relevance Sort by last modified time
    Searched defs:smaller (Results 1 - 25 of 29) sorted by null

1 2

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
278 if (smaller)
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
278 if (smaller)
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
278 if (smaller)
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
278 if (smaller)
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
278 if (smaller)
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
278 if (smaller)
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
278 if (smaller)
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
278 if (smaller)
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
278 if (smaller)
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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)
  /external/chromium_org/third_party/skia/src/pathops/
SkOpAngle.cpp 89 if (y < 0 && ry < 0) { // if y's are negative, lh x is smaller if positive
92 if (y >= 0 && ry >= 0) { // if y's are zero or positive, lh x is smaller if negative
95 SkASSERT((y == 0) ^ (ry == 0)); // if one y is zero and one is negative, neg y is smaller
100 if (y + ry < 0) { // if the other y is less than zero, it must be smaller
103 if (y + ry > 0) { // if a y is greater than zero and an x is positive, non zero is smaller
277 int smaller = SkMin32(fStart, fEnd); local
278 int tinyCheck = smaller;
282 if ((fUnsortable = smaller > 0 && tinyCheck == 0)) {
SkReduceOrder.cpp 39 int smaller = reduction[1].fY > reduction[0].fY; local
40 int larger = smaller ^ 1;
43 if (reduction[smaller].fY > yExtrema) {
44 reduction[smaller].fY = yExtrema;
60 int smaller = reduction[1].fX > reduction[0].fX; local
61 int larger = smaller ^ 1;
64 if (reduction[smaller].fX > xExtrema) {
65 reduction[smaller].fX = xExtrema;
114 // sameSide > 0 means mid is smaller than either [0] or [2], so replace smaller
212 int smaller = reduction[1].fY > reduction[0].fY; local
236 int smaller = reduction[1].fX > reduction[0].fX; local
    [all...]
  /external/skia/src/pathops/
SkOpAngle.cpp 89 if (y < 0 && ry < 0) { // if y's are negative, lh x is smaller if positive
92 if (y >= 0 && ry >= 0) { // if y's are zero or positive, lh x is smaller if negative
95 SkASSERT((y == 0) ^ (ry == 0)); // if one y is zero and one is negative, neg y is smaller
100 if (y + ry < 0) { // if the other y is less than zero, it must be smaller
103 if (y + ry > 0) { // if a y is greater than zero and an x is positive, non zero is smaller
277 int smaller = SkMin32(fStart, fEnd); local
278 int tinyCheck = smaller;
282 if ((fUnsortable = smaller > 0 && tinyCheck == 0)) {
SkReduceOrder.cpp 39 int smaller = reduction[1].fY > reduction[0].fY; local
40 int larger = smaller ^ 1;
43 if (reduction[smaller].fY > yExtrema) {
44 reduction[smaller].fY = yExtrema;
60 int smaller = reduction[1].fX > reduction[0].fX; local
61 int larger = smaller ^ 1;
64 if (reduction[smaller].fX > xExtrema) {
65 reduction[smaller].fX = xExtrema;
114 // sameSide > 0 means mid is smaller than either [0] or [2], so replace smaller
212 int smaller = reduction[1].fY > reduction[0].fY; local
236 int smaller = reduction[1].fX > reduction[0].fX; local
    [all...]
  /external/chromium_org/third_party/skia/src/gpu/
GrResourceCache.cpp 100 bool smaller = (maxResources < fMaxCount) || (maxResourceBytes < fMaxBytes); local
105 if (smaller) {
  /external/guava/guava-tests/test/com/google/common/collect/
AbstractTableReadTest.java 127 Table<String, Integer, Character> smaller local
136 .addEqualityGroup(smaller)
ArrayTableTest.java 119 Table<String, Integer, Character> smaller local
129 .addEqualityGroup(smaller)
  /external/skia/src/gpu/
GrResourceCache.cpp 100 bool smaller = (maxResources < fMaxCount) || (maxResourceBytes < fMaxBytes); local
105 if (smaller) {
  /external/chromium_org/third_party/WebKit/Source/core/css/
CSSGradientValue.cpp 1054 float smaller = min(xDist, yDist); local
    [all...]
  /external/chromium_org/third_party/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/qemu/distrib/zlib-1.2.3/
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/zlib/src/
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/chromium_org/cc/trees/
occlusion_tracker_unittest.cc 4474 typename Types::LayerType* smaller = local
    [all...]

Completed in 1844 milliseconds

1 2