Home
last modified time | relevance | path

Searched full:smallest (Results 1 – 25 of 3152) sorted by relevance

12345678910>>...127

/external/llvm-libc/test/src/__support/
Dfreestore_test.cpp29 // On platforms with high alignment the smallest legal block may be large in TEST()
49 Block *smallest = *maybeBlock; in TEST() local
50 maybeBlock = smallest->split(sizeof(FreeList::Node) + Block::PREV_FIELD_SIZE); in TEST()
57 if (largest_small->inner_size() == smallest->inner_size()) in TEST()
58 largest_small = smallest; in TEST()
59 ASSERT_GE(largest_small->inner_size(), smallest->inner_size()); in TEST()
65 store.insert(smallest); in TEST()
66 if (largest_small != smallest) in TEST()
70 // Find exact match for smallest. in TEST()
71 ASSERT_EQ(store.remove_best_fit(smallest->inner_size()), smallest); in TEST()
[all …]
/external/cronet/tot/third_party/llvm-libc/src/test/src/__support/
Dfreestore_test.cpp45 Block *smallest = *maybeBlock; in TEST() local
46 maybeBlock = smallest->split(sizeof(FreeList::Node) + sizeof(size_t)); in TEST()
53 if (largest_small->inner_size() == smallest->inner_size()) in TEST()
54 largest_small = smallest; in TEST()
55 ASSERT_GE(largest_small->inner_size(), smallest->inner_size()); in TEST()
61 store.insert(smallest); in TEST()
62 if (largest_small != smallest) in TEST()
66 // Find exact match for smallest. in TEST()
67 ASSERT_EQ(store.remove_best_fit(smallest->inner_size()), smallest); in TEST()
68 store.insert(smallest); in TEST()
[all …]
/external/cronet/stable/third_party/llvm-libc/src/test/src/__support/
Dfreestore_test.cpp45 Block *smallest = *maybeBlock; in TEST() local
46 maybeBlock = smallest->split(sizeof(FreeList::Node) + sizeof(size_t)); in TEST()
53 if (largest_small->inner_size() == smallest->inner_size()) in TEST()
54 largest_small = smallest; in TEST()
55 ASSERT_GE(largest_small->inner_size(), smallest->inner_size()); in TEST()
61 store.insert(smallest); in TEST()
62 if (largest_small != smallest) in TEST()
66 // Find exact match for smallest. in TEST()
67 ASSERT_EQ(store.remove_best_fit(smallest->inner_size()), smallest); in TEST()
68 store.insert(smallest); in TEST()
[all …]
/external/fec/
Dpeakval_av.c15 vector signed short smallest,largest; in peakval_av() local
17 smallest = (vector signed short)(0); in peakval_av()
26 smallest = vec_min(smallest,x); in peakval_av()
34 smallest = vec_min(smallest,x); in peakval_av()
44 smallest = vec_min(smallest,x); in peakval_av()
48 largest = vec_max(largest,vec_abs(smallest)); in peakval_av()
/external/skia/tests/
DFloatingPointTest.cpp103 const double smallest = std::numeric_limits<double>::denorm_min(); in DEF_TEST() local
105 REPORTER_ASSERT(reporter, sk_doubles_nearly_equal_ulps(smallest, 0)); in DEF_TEST()
106 REPORTER_ASSERT(reporter, sk_doubles_nearly_equal_ulps(smallest, -smallest)); in DEF_TEST()
107 REPORTER_ASSERT(reporter, sk_doubles_nearly_equal_ulps(8*smallest, -8*smallest)); in DEF_TEST()
108 REPORTER_ASSERT(reporter, !sk_doubles_nearly_equal_ulps(8*smallest, -9*smallest)); in DEF_TEST()
153 const float smallest = std::numeric_limits<float>::denorm_min(); in DEF_TEST() local
154 REPORTER_ASSERT(reporter, sk_float_midpoint(smallest, smallest) == smallest); in DEF_TEST()
155 REPORTER_ASSERT(reporter, sk_float_midpoint(smallest, -smallest) == 0); in DEF_TEST()
/external/threetenbp/src/main/java/org/threeten/bp/temporal/
DValueRange.java64 * The smallest minimum value.
72 * The smallest maximum value.
105 * @param maxSmallest the smallest maximum value
107 * @return the ValueRange for min, smallest max, largest max, not null
109 * the minimum is greater than the smallest maximum,
110 * or the smallest maximum is greater than the largest maximum
121 * @param minSmallest the smallest minimum value
123 * @param maxSmallest the smallest maximum value
125 * @return the ValueRange for smallest min, largest min, smallest max, largest max, not null
127 * the smallest minimum is greater than the smallest maximum,
[all …]
/external/leveldb/db/
Dversion_edit.h25 InternalKey smallest; // Smallest internal key served by table member
62 // REQUIRES: "smallest" and "largest" are smallest and largest keys in file
64 const InternalKey& smallest, const InternalKey& largest) { in AddFile() argument
68 f.smallest = smallest; in AddFile()
Dversion_set.cc118 ucmp->Compare(*user_key, f->smallest.user_key()) < 0); in BeforeFile()
290 if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 && in ForEachOverlapping()
313 if (ucmp->Compare(user_key, f->smallest.user_key()) < 0) { in ForEachOverlapping()
514 const Slice file_start = f->smallest.user_key(); in GetOverlappingInputs()
557 r.append(files[i]->smallest.DebugString()); in DebugString()
571 // Helper to sort by v->files_[file_number].smallest
576 int r = internal_comparator->Compare(f1->smallest, f2->smallest); in operator ()()
704 const InternalKey& this_begin = v->files_[level][i]->smallest; in SaveTo()
725 f->smallest) < 0); in MaybeAddFile()
1091 edit.AddFile(level, f->number, f->file_size, f->smallest, f->largest); in WriteSnapshot()
[all …]
Dversion_set_test.cc23 void Add(const char* smallest, const char* largest, in Add() argument
28 f->smallest = InternalKey(smallest, smallest_seq, kTypeValue); in Add()
39 bool Overlaps(const char* smallest, const char* largest) { in Overlaps() argument
41 Slice s(smallest != nullptr ? smallest : ""); in Overlaps()
44 (smallest != nullptr ? &s : nullptr), in Overlaps()
197 FileMetaData* CreateFileMetaData(uint64_t number, InternalKey smallest, in CreateFileMetaData() argument
201 f->smallest = smallest; in CreateFileMetaData()
/external/tensorflow/tensorflow/lite/kernels/internal/reference/
Dsub.h89 // trailing dimension changing most rapidly (channels has the smallest stride, in BroadcastSubSlow()
93 // first dimension has smallest stride. in BroadcastSubSlow()
96 // nesting loops such that the innermost loop has the smallest stride for the in BroadcastSubSlow()
129 // trailing dimension changing most rapidly (channels has the smallest stride, in BroadcastSubSlow()
133 // first dimension has smallest stride. in BroadcastSubSlow()
136 // nesting loops such that the innermost loop has the smallest stride for the in BroadcastSubSlow()
168 // trailing dimension changing most rapidly (channels has the smallest stride, in BroadcastSubSlow()
172 // first dimension has smallest stride. in BroadcastSubSlow()
175 // nesting loops such that the innermost loop has the smallest stride for the in BroadcastSubSlow()
205 // trailing dimension changing most rapidly (channels has the smallest stride, in BroadcastSubSlow()
[all …]
/external/eigen/unsupported/Eigen/src/Polynomials/
DPolynomialSolver.h21 * - greatest, smallest complex roots,
22 * - real roots with greatest, smallest absolute real value,
23 * - greatest, smallest real roots.
107 * \returns the complex root with smallest norm.
201 * part smallest than absImaginaryThreshold.
205 * the root with smallest absolute imaginary part is returned instead.
222 * \returns a real root with smallest absolute magnitude.
224 * part smallest than absImaginaryThreshold.
228 * the root with smallest absolute imaginary part is returned instead.
247 * part smallest than absImaginaryThreshold.
[all …]
/external/skia/modules/bentleyottmann/tests/
DPointTest.cpp36 REPORTER_ASSERT(reporter, !Point::DifferenceTooBig(Point::Smallest(), Point{0, 0})); in DEF_TEST()
38 REPORTER_ASSERT(reporter, Point::DifferenceTooBig(Point{0, 0}, Point::Smallest())); in DEF_TEST()
40 REPORTER_ASSERT(reporter, Point::DifferenceTooBig(Point::Smallest(), Point::Largest())); in DEF_TEST()
41 REPORTER_ASSERT(reporter, Point::DifferenceTooBig(Point::Largest(), Point::Smallest())); in DEF_TEST()
43 !Point::DifferenceTooBig(Point::Smallest() + Point{1, 1}, Point{0, 0})); in DEF_TEST()
45 !Point::DifferenceTooBig(Point{0, 0}, Point::Smallest() + Point{1, 1})); in DEF_TEST()
/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/BinaryFormat/
DMsgPackWriter.h68 /// The output will be in the smallest possible \em int format.
75 /// The output will be in the smallest possible \em int format.
80 /// The output will be in the smallest possible \em float format.
85 /// The output will be in the smallest possible \em str format.
90 /// The output will be in the smallest possible \em bin format.
97 /// The output will be in the smallest possible \em array format.
108 /// The output will be in the smallest possible \em map format.
120 /// The output will be in the smallest possible \em ext format.
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/BinaryFormat/
DMsgPackWriter.h67 /// The output will be in the smallest possible \em int format.
74 /// The output will be in the smallest possible \em int format.
79 /// The output will be in the smallest possible \em float format.
84 /// The output will be in the smallest possible \em str format.
89 /// The output will be in the smallest possible \em bin format.
96 /// The output will be in the smallest possible \em array format.
107 /// The output will be in the smallest possible \em map format.
119 /// The output will be in the smallest possible \em ext format.
/external/mesa3d/src/gallium/drivers/svga/
Dsvga_draw_arrays.c113 unsigned smallest = 0; in retrieve_or_generate_indices() local
118 smallest = i; in retrieve_or_generate_indices()
121 else if (hwtnl->index_cache[prim][i].gen_nr < smallest) { in retrieve_or_generate_indices()
122 smallest = i; in retrieve_or_generate_indices()
127 assert(smallest != IDX_CACHE_MAX); in retrieve_or_generate_indices()
129 pipe_resource_reference(&hwtnl->index_cache[prim][smallest].buffer, in retrieve_or_generate_indices()
133 debug_printf("%s discard smallest %d/%d\n", __func__, in retrieve_or_generate_indices()
134 smallest, smallest_size); in retrieve_or_generate_indices()
136 i = smallest; in retrieve_or_generate_indices()
/external/rust/android-crates-io/crates/grpcio-sys/grpc/src/core/lib/gprpp/
Dsorted_pack.h36 // Find the smallest element of Args, and the rest of the elements
38 struct Smallest;
42 struct Smallest<Cmp, Typelist<Arg, Args...>> {
43 using SmallestRest = Smallest<Cmp, Typelist<Args...>>;
53 struct Smallest<Cmp, Typelist<Arg>> {
64 using SmallestResult = Smallest<Cmp, Typelist<Args...>>;
/external/grpc-grpc/src/core/lib/gprpp/
Dsorted_pack.h28 // Find the smallest element of Args, and the rest of the elements
30 struct Smallest;
34 struct Smallest<Cmp, Typelist<Arg, Args...>> {
35 using SmallestRest = Smallest<Cmp, Typelist<Args...>>;
45 struct Smallest<Cmp, Typelist<Arg>> {
56 using SmallestResult = Smallest<Cmp, Typelist<Args...>>;
/external/python/cpython3/Doc/library/
Dheapq.rst26 smallest element is always the root, ``heap[0]``.
31 since Python uses zero-based indexing. (b) Our pop method returns the smallest
36 surprises: ``heap[0]`` is the smallest item, and ``heap.sort()`` maintains the
52 Pop and return the smallest item from the *heap*, maintaining the heap
54 smallest item without popping it, use ``heap[0]``.
59 Push *item* on the heap, then pop and return the smallest item from the
71 Pop and return the smallest item from the *heap*, and also push the new *item*.
96 streams is already sorted (smallest to largest).
107 be sorted from largest to smallest.
124 Return a list with the *n* smallest elements from the dataset defined by
[all …]
/external/leveldb/table/
Dmerger.cc61 // the smallest child and key() == current_->key(). Otherwise, in Next()
149 IteratorWrapper* smallest = nullptr; in FindSmallest() local
153 if (smallest == nullptr) { in FindSmallest()
154 smallest = child; in FindSmallest()
155 } else if (comparator_->Compare(child->key(), smallest->key()) < 0) { in FindSmallest()
156 smallest = child; in FindSmallest()
160 current_ = smallest; in FindSmallest()
/external/ComputeLibrary/src/core/helpers/
DScaleHelpers.h40 …* the real coordinates and the smallest following integer coordinates. Input must be QASYMM8 and i…
44 …* @param[in] dx Pixel's distance between the X real coordinate and the smallest X following…
45 …* @param[in] dy Pixel's distance between the Y real coordinate and the smallest Y following…
75 …* the real coordinates and the smallest following integer coordinates. Input must be QASYMM8_SIGNE…
79 …* @param[in] dx Pixel's distance between the X real coordinate and the smallest X following…
80 …* @param[in] dy Pixel's distance between the Y real coordinate and the smallest Y following…
173 * the real coordinates and the smallest following integer coordinates.
179 …* @param[in] dx_val Pixel's distance between the X real coordinate and the smallest X following in…
180 …* @param[in] dy_val Pixel's distance between the Y real coordinate and the smallest Y following in…
/external/sdv/vsomeip/third_party/boost/numeric/conversion/doc/
Dbounds.qbk36 static N smallest() { return implementation_defined; }
51 [: `smallest()` ]
53 Returns the smallest positive normalized value for floating point types with
80 std::cout << "The smallest positive value for float:\n";
81 std::cout << boost::numeric::bounds<float>::smallest() << "\n";
/external/sdv/vsomeip/third_party/boost/numeric/conversion/test/
Dbounds_test.cpp33 T smallest = bounds<T>::smallest() ; in test_bounds() local
43 BOOST_CHECK_MESSAGE ( smallest == expected_smallest, in test_bounds()
44 …"bounds<" << typeid(T).name() << ">::smallest() = " << printable(smallest) << ". Expected " << pri… in test_bounds()
/external/pytorch/docs/source/
Dtype_info.rst26 eps float The smallest representable number such that ``1.0 + eps != 1.0``.
28 min float The smallest representable number (typically ``-max``).
29 tiny float The smallest positive normal number. Equivalent to ``smallest_normal…
30 smallest_normal float The smallest positive normal number. See notes.
38 `smallest_normal` returns the smallest *normal* number, but there are smaller
61 min int The smallest representable number.
/external/libpng/intel/
Dfilter_sse2_intrinsics.c257 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
275 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
278 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
279 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
294 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth3_sse2() local
311 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth3_sse2()
314 nearest = if_then_else(_mm_cmpeq_epi16(smallest, pa), a, in png_read_filter_row_paeth3_sse2()
315 if_then_else(_mm_cmpeq_epi16(smallest, pb), b, in png_read_filter_row_paeth3_sse2()
346 __m128i pa,pb,pc,smallest,nearest; in png_read_filter_row_paeth4_sse2() local
373 smallest = _mm_min_epi16(pc, _mm_min_epi16(pa, pb)); in png_read_filter_row_paeth4_sse2()
[all …]
/external/ltp/testcases/kernel/sched/eas/
Dutil.c156 * get_bigs = 0, search for smallest CPUs
157 * get_bigs = 1, search for CPUs other than the smallest CPUs
161 unsigned int cap, smallest = -1; in find_cpus_with_capacity() local
170 if (cap < smallest) { in find_cpus_with_capacity()
171 smallest = cap; in find_cpus_with_capacity()
174 } else if (cap == smallest) { in find_cpus_with_capacity()

12345678910>>...127