HomeSort by relevance Sort by last modified time
    Searched full:less (Results 351 - 375 of 9298) sorted by null

<<11121314151617181920>>

  /external/glide/library/src/main/java/com/bumptech/glide/load/resource/bitmap/
FitCenter.java 10 * will be equal to the given dimension and the other will be less than the given dimension
  /external/glide/library/src/main/java/com/bumptech/glide/request/target/
DrawableImageViewTarget.java 20 // This is a dirty hack that tries to make loading square thumbnails and then square full images less costly by
  /external/icu/icu4c/source/test/intltest/
lcukocol.cpp 61 Collator::LESS
mnkytst.h 11 * less than the string itself appended with any character.
  /external/libcxx/test/containers/associative/map/map.access/
max_size.pass.cpp 30 typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
  /external/libcxx/test/containers/associative/map/map.cons/
move.pass.cpp 28 typedef test_compare<std::less<int> > C;
55 typedef test_compare<std::less<int> > C;
74 typedef test_compare<std::less<int> > C;
101 typedef test_compare<std::less<int> > C;
move_alloc.pass.cpp 30 typedef test_compare<std::less<MoveOnly> > C;
69 typedef test_compare<std::less<MoveOnly> > C;
108 typedef test_compare<std::less<MoveOnly> > C;
148 typedef test_compare<std::less<MoveOnly> > C;
move_assign.pass.cpp 30 typedef test_compare<std::less<MoveOnly> > C;
70 typedef test_compare<std::less<MoveOnly> > C;
110 typedef test_compare<std::less<MoveOnly> > C;
151 typedef test_compare<std::less<MoveOnly> > C;
  /external/libcxx/test/containers/associative/multimap/
max_size.pass.cpp 30 typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
  /external/libcxx/test/containers/associative/multimap/multimap.cons/
move.pass.cpp 28 typedef test_compare<std::less<int> > C;
55 typedef test_compare<std::less<int> > C;
80 typedef test_compare<std::less<int> > C;
107 typedef test_compare<std::less<int> > C;
move_alloc.pass.cpp 30 typedef test_compare<std::less<MoveOnly> > C;
69 typedef test_compare<std::less<MoveOnly> > C;
108 typedef test_compare<std::less<MoveOnly> > C;
148 typedef test_compare<std::less<MoveOnly> > C;
move_assign.pass.cpp 30 typedef test_compare<std::less<MoveOnly> > C;
70 typedef test_compare<std::less<MoveOnly> > C;
110 typedef test_compare<std::less<MoveOnly> > C;
151 typedef test_compare<std::less<MoveOnly> > C;
  /external/libcxx/test/containers/associative/multiset/
max_size.pass.cpp 30 typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
  /external/libcxx/test/containers/associative/multiset/multiset.cons/
alloc.pass.cpp 23 typedef std::less<int> C;
compare.pass.cpp 23 typedef test_compare<std::less<int> > C;
move_assign.pass.cpp 29 typedef test_compare<std::less<MoveOnly> > C;
68 typedef test_compare<std::less<MoveOnly> > C;
107 typedef test_compare<std::less<MoveOnly> > C;
148 typedef test_compare<std::less<MoveOnly> > C;
  /external/libcxx/test/containers/associative/set/
max_size.pass.cpp 30 typedef std::set<int, std::less<int>, min_allocator<int>> M;
  /external/libcxx/test/containers/associative/set/set.cons/
alloc.pass.cpp 23 typedef std::less<int> C;
compare.pass.cpp 23 typedef test_compare<std::less<int> > C;
move_assign.pass.cpp 29 typedef test_compare<std::less<MoveOnly> > C;
68 typedef test_compare<std::less<MoveOnly> > C;
107 typedef test_compare<std::less<MoveOnly> > C;
147 typedef test_compare<std::less<MoveOnly> > C;
  /external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/
ctor_comp.pass.cpp 21 std::priority_queue<int, std::vector<int, stack_allocator<int, 10> > > q((std::less<int>()));
  /external/libcxx/test/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.obs/
not_less_than.fail.cpp 14 // not less than comparable
  /external/libogg/
CHANGES 3 * Alter default flushing behavior to span less often and use larger page
  /external/libvorbis/lib/
envelope.h 31 #define VE_MINSTRETCH 2 /* a bit less than short block */
  /external/libvpx/libvpx/vpx_mem/memory_manager/include/
cavl_if.h 117 ** 32 - 64 (inclusive) that is less than or equal to the number of
148 ** or less than the number of bits in a single long.
160 /* Maximum depth is definitely less than number of bits in a long. */
173 ** take the less branch. bit 0 gives branch from root, and

Completed in 1269 milliseconds

<<11121314151617181920>>