| /fuchsia/zircon/system/utest/fbl/ |
| H A D | algorithm_tests.cpp | 218 EXPECT_EQ(fbl::lower_bound(null, null, 0), null);
221 EXPECT_EQ(fbl::lower_bound(&value, &value, 4), &value);
222 EXPECT_EQ(fbl::lower_bound(&value, &value, 5), &value);
223 EXPECT_EQ(fbl::lower_bound(&value, &value, 6), &value);
225 EXPECT_EQ(fbl::lower_bound(&value, &value + 1, 4), &value);
226 EXPECT_EQ(fbl::lower_bound(&value, &value + 1, 5), &value);
227 EXPECT_EQ(fbl::lower_bound(&value, &value + 1, 6), &value + 1);
234 EXPECT_EQ(*fbl::lower_bound(first, last, 0), 1);
235 EXPECT_EQ(*fbl::lower_bound(first, last, 1), 1);
236 EXPECT_EQ(*fbl::lower_bound(firs
[all...] |
| /fuchsia/zircon/system/ulib/audio-proto-utils/ |
| H A D | format-utils.cpp | 21 const uint32_t* found = fbl::lower_bound(RATES_48000_FAMILY, RATES_48000_FAMILY_LAST, rate);
26 const uint32_t* found = fbl::lower_bound(RATES_44100_FAMILY, RATES_44100_FAMILY_LAST, rate);
|
| /fuchsia/zircon/system/ulib/fs/ |
| H A D | lazy-dir.cpp | 70 for (auto it = fbl::lower_bound(entries.begin(), entries.end(), cookie->n,
|
| H A D | pseudo-dir.cpp | 67 for (auto it = entries_by_id_.lower_bound(cookie->n); it != entries_by_id_.end(); ++it) {
|
| /fuchsia/zircon/kernel/vm/include/vm/ |
| H A D | vm_page_list.h | 153 const auto end = list_.lower_bound(end_offset);
177 const auto end = list_.lower_bound(end_offset);
|
| /fuchsia/zircon/system/ulib/cobalt-client/ |
| H A D | histogram.cpp | 62 double lower_bound = GetExponentialBucketValue(unshifted_bucket + 1, options); local
63 if (lower_bound > value) {
|
| /fuchsia/zircon/system/ulib/fbl/include/fbl/ |
| H A D | algorithm.h | 154 // Similar to <http://en.cppreference.com/w/cpp/algorithm/lower_bound>
156 const T* lower_bound(const T* first, const T* last, const U& value) {
173 // Similar to <http://en.cppreference.com/w/cpp/algorithm/lower_bound>
175 const T* lower_bound(const T* first, const T* last, const U& value, Compare comp) {
|
| H A D | intrusive_wavl_tree.h | 39 // lower_bound(key) : Finds the element (E) in the tree such that E.key >= key
324 // lower_bound
328 const_iterator lower_bound(const KeyType& key) const { function in class:fbl::WAVLTree
332 iterator lower_bound(const KeyType& key) { function in class:fbl::WAVLTree
333 const_iterator citer = const_cast<const ContainerType*>(this)->lower_bound(key);
540 // lower_bound.
1006 // the case of lower_bound, key >= node_key in the case of
|
| /fuchsia/zircon/kernel/platform/pc/ |
| H A D | platform.cpp | 623 // `lower_bound`
624 static void alloc_pages_greater_than(paddr_t lower_bound, size_t count, paddr_t* paddrs) { argument
629 zx_status_t status = pmm_alloc_range(lower_bound, count, &list);
635 paddrs[count - (i + 1)] = lower_bound + PAGE_SIZE * i;
639 lower_bound += PAGE_SIZE * (actual + 1);
643 if (lower_bound >= (4 * GB)) {
|
| /fuchsia/zircon/kernel/vm/ |
| H A D | vm_address_region.cpp | 683 auto end = subregions_.lower_bound(end_addr);
741 end = vmar->subregions_.lower_bound(end_addr);
767 end = up->subregions_.lower_bound(end_addr);
797 const auto end = subregions_.lower_bound(end_addr);
|
| /fuchsia/zircon/system/utest/fbl/include/fbl/tests/intrusive_containers/ |
| H A D | ordered_associative_container_test_environment.h | 59 return container.lower_bound(key);
188 // Now perform the same searchs using upper_bound/lower_bound.
|
| /fuchsia/zircon/system/ulib/region-alloc/ |
| H A D | region-alloc.cpp | 305 auto iter = avail_regions_by_size_.lower_bound({ .base = 0, .size = size });
582 auto iter = tree.lower_bound(region.base);
|
| /fuchsia/zircon/system/ulib/edid/ |
| H A D | eisa_vid_lut.cpp | 2464 const LutEntry* found = fbl::lower_bound(first, last, eisa_vid,
|