/third_party/boost/boost/python/suite/indexing/ |
D | vector_indexing_suite.hpp | 75 get_item(Container& container, index_type i) in get_item() argument 77 return container[i]; in get_item() 81 get_slice(Container& container, index_type from, index_type to) in get_slice() argument 85 return object(Container(container.begin()+from, container.begin()+to)); in get_slice() 89 set_item(Container& container, index_type i, data_type const& v) in set_item() argument 91 container[i] = v; in set_item() 95 set_slice(Container& container, index_type from, in set_slice() argument 102 container.erase(container.begin()+from, container.begin()+to); in set_slice() 103 container.insert(container.begin()+from, v); in set_slice() 109 set_slice(Container& container, index_type from, in set_slice() argument [all …]
|
D | indexing_suite.hpp | 203 base_get_item(back_reference<Container&> container, PyObject* i) in base_get_item() argument 207 container.get(), static_cast<PySliceObject*>(static_cast<void*>(i))); in base_get_item() 209 return proxy_handler::base_get_item_(container, i); in base_get_item() 213 base_set_item(Container& container, PyObject* i, PyObject* v) in base_set_item() argument 217 slice_handler::base_set_slice(container, in base_set_item() 227 set_item(container, in base_set_item() 229 convert_index(container, i), elem()); in base_set_item() 238 set_item(container, in base_set_item() 240 convert_index(container, i), elem()); in base_set_item() 252 base_delete_item(Container& container, PyObject* i) in base_delete_item() argument [all …]
|
/third_party/boost/libs/spirit/test/x3/ |
D | container_support.cpp | 69 Container container; in BOOST_SPIRIT_DEFINE() local 73 BOOST_TEST(test_attr("k1=v1,k2=v2,k2=v3", rule, container)); in BOOST_SPIRIT_DEFINE() 74 BOOST_TEST(container.size() == 2); in BOOST_SPIRIT_DEFINE() 75 BOOST_TEST(container == compare); in BOOST_SPIRIT_DEFINE() 79 container.clear(); in BOOST_SPIRIT_DEFINE() 80 BOOST_TEST(test_attr("k1=v1,k2=v2,k2=v3", seq_rule, container)); in BOOST_SPIRIT_DEFINE() 84 container.clear(); in BOOST_SPIRIT_DEFINE() 85 BOOST_TEST(test_attr("k1=v1,k2=v2,k2=v3", cic_rule, container)); in BOOST_SPIRIT_DEFINE() 93 Container container; in test_multimap_support() local 97 BOOST_TEST(test_attr("k1=v1,k2=v2,k2=v3", rule, container)); in test_multimap_support() [all …]
|
/third_party/gn/src/base/ |
D | stl_util.h | 32 void IterateAndEraseIf(Container& container, Predicate pred) { in IterateAndEraseIf() argument 33 for (auto it = container.begin(); it != container.end();) { in IterateAndEraseIf() 35 it = container.erase(it); in IterateAndEraseIf() 142 void Erase(std::basic_string<CharT, Traits, Allocator>& container, in Erase() argument 144 container.erase(std::remove(container.begin(), container.end(), value), in Erase() 145 container.end()); in Erase() 149 void EraseIf(std::basic_string<CharT, Traits, Allocator>& container, in EraseIf() argument 151 container.erase(std::remove_if(container.begin(), container.end(), pred), in EraseIf() 152 container.end()); in EraseIf() 156 void Erase(std::deque<T, Allocator>& container, const Value& value) { in Erase() argument [all …]
|
/third_party/boost/boost/heap/detail/ |
D | ordered_adaptor_iterator.hpp | 59 const ContainerType * container; member 61 compare_by_heap_value (const ContainerType * container, ValueCompare const & cmp): in compare_by_heap_value() 62 ValueCompare(cmp), container(container) in compare_by_heap_value() 67 BOOST_ASSERT(lhs <= Dispatcher::max_index(container)); in operator ()() 68 BOOST_ASSERT(rhs <= Dispatcher::max_index(container)); in operator ()() 69 return ValueCompare::operator()(Dispatcher::get_internal_value(container, lhs), in operator ()() 70 Dispatcher::get_internal_value(container, rhs)); in operator ()() 74 const ContainerType * container; member in boost::heap::detail::ordered_adaptor_iterator 79 container(NULL), current_index((std::numeric_limits<size_t>::max)()), in ordered_adaptor_iterator() 83 ordered_adaptor_iterator(const ContainerType * container, ValueCompare const & cmp): in ordered_adaptor_iterator() argument [all …]
|
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/ |
D | AnyTest.java | 45 TestAny container = TestAny.newBuilder().setValue(Any.pack(message)).build(); in testAnyGeneratedApi() local 47 assertTrue(container.getValue().is(TestAllTypes.class)); in testAnyGeneratedApi() 48 assertFalse(container.getValue().is(TestAny.class)); in testAnyGeneratedApi() 50 TestAllTypes result = container.getValue().unpack(TestAllTypes.class); in testAnyGeneratedApi() 56 container.getValue().unpack(TestAny.class); in testAnyGeneratedApi() 63 TestAny.Builder containerBuilder = container.toBuilder(); in testAnyGeneratedApi() 65 container = containerBuilder.build(); in testAnyGeneratedApi() 67 container.getValue().unpack(TestAllTypes.class); in testAnyGeneratedApi() 79 TestAny container = TestAny.newBuilder().setValue(Any.pack(message, "xxx.com")).build(); in testCustomTypeUrls() local 82 "xxx.com/" + TestAllTypes.getDescriptor().getFullName(), container.getValue().getTypeUrl()); in testCustomTypeUrls() [all …]
|
/third_party/boost/libs/hana/test/experimental/view/transformed/ |
D | ap.cpp | 19 auto container = ::seq; in main() local 23 auto storage = container(); in main() 24 auto functions = container(); in main() 29 container() in main() 32 auto storage = container(ct_eq<0>{}); in main() 33 auto functions = container(); in main() 38 container() in main() 41 auto storage = container(); in main() 42 auto functions = container(ct_eq<0>{}); in main() 47 container() in main() [all …]
|
D | drop_front.cpp | 18 auto container = ::seq; in main() local 22 auto storage = container(); in main() 26 container() in main() 31 auto storage = container(ct_eq<0>{}); in main() 35 container(f(ct_eq<0>{})) in main() 38 auto storage = container(ct_eq<0>{}); in main() 42 container() in main() 47 auto storage = container(ct_eq<0>{}, ct_eq<1>{}); in main() 51 container(f(ct_eq<0>{}), f(ct_eq<1>{})) in main() 54 auto storage = container(ct_eq<0>{}, ct_eq<1>{}); in main() [all …]
|
D | less.cpp | 17 auto container = ::seq; in main() local 21 auto storage = container(); in main() 25 container() in main() 28 auto storage = container(ct_ord<0>{}); in main() 31 container(), in main() 35 container(f(ct_ord<0>{})), in main() 40 container() in main() 43 auto storage = container(ct_ord<0>{}, ct_ord<1>{}); in main() 46 container(), in main() 50 container(f(ct_ord<0>{})), in main() [all …]
|
/third_party/alsa-utils/axfer/test/ |
D | Makefile.am | 2 container-test \ 6 container-test \ 10 ../container.h \ 11 ../container.c \ 12 ../container-riff-wave.c \ 13 ../container-au.c \ 14 ../container-voc.c \ 15 ../container-raw.c \ 18 container-test.c 21 ../container.h \ [all …]
|
/third_party/libuv/test/ |
D | benchmark-million-async.c | 33 static struct async_container* container; variable 47 i = fastrand() % ARRAY_SIZE(container->async_handles); in thread_cb() 48 uv_async_send(container->async_handles + i); in thread_cb() 54 container->async_events++; in async_cb() 65 for (i = 0; i < ARRAY_SIZE(container->async_handles); i++) { in timer_cb() 66 uv_async_t* handle = container->async_handles + i; in timer_cb() 69 container->handles_seen++; in timer_cb() 88 container = malloc(sizeof(*container)); in BENCHMARK_IMPL() 89 ASSERT_NOT_NULL(container); in BENCHMARK_IMPL() 90 container->async_events = 0; in BENCHMARK_IMPL() [all …]
|
/third_party/boost/boost/ptr_container/ |
D | ptr_inserter.hpp | 72 : container(&cont) in ptr_back_insert_iterator() 79 = container->null_policy_allocate_clone(r); in operator =() 80 container->push_back( obj ); in operator =() 89 container->push_back( r ); in operator =() 98 container->push_back( std::move( r ) ); in operator =() 106 container->push_back( container->null_policy_allocate_clone(&r) ); in operator =() 126 PtrContainer* container; member in boost::ptr_container::ptr_back_insert_iterator 144 : container(&cont) in ptr_front_insert_iterator() 151 = container->null_policy_allocate_clone(r); in operator =() 152 container->push_front( obj ); in operator =() [all …]
|
/third_party/boost/boost/python/suite/indexing/detail/ |
D | indexing_suite_detail.hpp | 270 add(PyObject* prox, Container& container) in add() argument 273 links[&container].add(prox); in add() 277 void erase(Container& container, index_type i, NoSlice no_slice) in erase() argument 280 typename links_t::iterator r = links.find(&container); in erase() 290 erase(Container& container, index_type from, index_type to) in erase() argument 293 typename links_t::iterator r = links.find(&container); in erase() 304 Container& container, in replace() argument 314 typename links_t::iterator r = links.find(&container); in replace() 324 find(Container& container, index_type i) in find() argument 329 typename links_t::iterator r = links.find(&container); in find() [all …]
|
/third_party/skia/third_party/externals/microhttpd/src/testspdy/ |
D | test_struct_namevalue.c | 107 struct SPDY_NameValue *container; in main() local 114 if(NULL == (container = SPDY_name_value_create ())) in main() 119 if(NULL != SPDY_name_value_lookup (container, "anything", &ret)) in main() 124 if(SPDY_name_value_iterate (container, NULL, NULL) != 0) in main() 131 if(SPDY_YES != SPDY_name_value_add(container,pairs[i],pairs[i+1])) in main() 136 if(SPDY_name_value_iterate (container, NULL, NULL) != ((i / 2) + 1)) in main() 142 if(NULL != SPDY_name_value_lookup (container, "anything", &ret)) in main() 149 value = SPDY_name_value_lookup(container,pairs[i], &ret); in main() 158 SPDY_name_value_iterate (container, &iterate_cb, &cls); in main() 161 if(SPDY_name_value_iterate (container, &iterate_brake_cb, &cls) != brake_at) in main() [all …]
|
/third_party/boost/libs/container/test/ |
D | allocator_traits_test.cpp | 29 typedef boost::container::dtl:: 107 typedef typename ::boost::container:: 109 typedef typename ::boost::container:: 115 typedef boost::container::dtl:: 117 typedef boost::container::dtl:: 119 typedef boost::container::dtl:: 121 typedef boost::container::dtl:: 173 void construct(U *p, boost::container::default_init_t) 242 boost::container::allocator_traits<std::allocator<void> > stdtraits; (void)stdtraits; in test_void_allocator() 243 boost::container::allocator_traits<SimpleAllocator<void> > simtraits; (void)simtraits; in test_void_allocator() [all …]
|
D | small_vector_test.cpp | 23 namespace boost { namespace container { namespace test { namespace 31 typedef boost::container::small_vector<T, 10, Allocator> type; 39 typedef boost::container::small_vector_base<int> smb_t; in test_small_vector_base_test() 41 typedef boost::container::small_vector<int, 5> sm5_t; in test_small_vector_base_test() 48 if (!boost::container::test::CheckEqualContainers(sm5, smb)) in test_small_vector_base_test() 52 typedef boost::container::small_vector<int, 7> sm7_t; in test_small_vector_base_test() 59 if (!boost::container::test::CheckEqualContainers(sm7, smb)) in test_small_vector_base_test() 63 typedef boost::container::small_vector<int, 5> sm5_t; in test_small_vector_base_test() 68 if (!boost::container::test::CheckEqualContainers(sm5, sm5_copy)) in test_small_vector_base_test() 75 if (!boost::container::test::CheckEqualContainers(sm5, sm5_copy)) in test_small_vector_base_test() [all …]
|
/third_party/boost/libs/container/bench/detail/ |
D | varray_util.hpp | 42 namespace boost { namespace container { namespace varray_detail { namespace 44 namespace bcd = ::boost::container::dtl; 47 struct are_elements_contiguous : boost::container::dtl::is_pointer<I> 108 typename ::boost::container::iterator_traits<I>::value_type 111 typename ::boost::container::iterator_traits<O>::value_type 123 bcd::remove_const<typename ::boost::container::iterator_traits<I>::value_type>, 138 typedef typename ::boost::container::iterator_traits<I>::value_type value_type; in destroy_dispatch() 146 typedef typename ::boost::container::iterator_traits<I>::value_type value_type; in destroy() 161 typedef typename ::boost::container::iterator_traits<I>::value_type value_type; in destroy_dispatch() 168 typedef typename ::boost::container::iterator_traits<I>::value_type value_type; in destroy() [all …]
|
/third_party/boost/libs/geometry/test/test_geometries/ |
D | all_custom_container.hpp | 50 static inline void apply(all_custom_container<Item>& container) in apply() 52 container.custom_clear(); in apply() 59 static inline void apply(all_custom_container<Item>& container, Item const& item) in apply() 61 container.custom_push_back(item); in apply() 68 static inline void apply(all_custom_container<Item>& container, std::size_t new_size) in apply() 70 container.custom_resize(new_size); in apply() 101 range_begin(all_custom_container<Item>& container) in range_begin() argument 103 return container.custom_begin(); in range_begin() 108 range_begin(all_custom_container<Item> const& container) in range_begin() argument 110 return container.custom_begin(); in range_begin() [all …]
|
/third_party/boost/libs/hana/test/experimental/view/joined/ |
D | length.cpp | 18 auto container = ::seq; in main() local 21 auto storage1 = container(); in main() 22 auto storage2 = container(); in main() 31 auto storage1 = container(undefined<0>{}); in main() 32 auto storage2 = container(); in main() 41 auto storage1 = container(); in main() 42 auto storage2 = container(undefined<0>{}); in main() 51 auto storage1 = container(undefined<0>{}); in main() 52 auto storage2 = container(undefined<1>{}); in main() 61 auto storage1 = container(undefined<0>{}); in main() [all …]
|
D | unpack.cpp | 17 auto container = ::seq; in main() local 21 auto storage1 = container(); in main() 22 auto storage2 = container(); in main() 31 auto storage1 = container(ct_eq<0>{}); in main() 32 auto storage2 = container(); in main() 39 auto storage1 = container(); in main() 40 auto storage2 = container(ct_eq<0>{}); in main() 47 auto storage1 = container(ct_eq<0>{}); in main() 48 auto storage2 = container(ct_eq<1>{}); in main() 57 auto storage1 = container(ct_eq<0>{}, ct_eq<1>{}); in main() [all …]
|
/third_party/boost/tools/auto_index/src/ |
D | index_generator.cpp | 31 void check_index_type_and_placement(const std::string& parent, const std::string& container) in check_index_type_and_placement() argument 33 if(container == "section") in check_index_type_and_placement() 41 raise_invalid_xml(parent, container); in check_index_type_and_placement() 43 else if(container == "appendix") in check_index_type_and_placement() 48 raise_invalid_xml(parent, container); in check_index_type_and_placement() 50 else if(container == "index") in check_index_type_and_placement() 65 raise_invalid_xml(parent, container); in check_index_type_and_placement() 67 else if((container == "article") || (container == "chapter") || (container == "reference")) in check_index_type_and_placement() 71 raise_invalid_xml(parent, container); in check_index_type_and_placement() 73 else if(container == "part") in check_index_type_and_placement() [all …]
|
/third_party/skia/third_party/externals/microhttpd/src/microspdy/ |
D | structures.c | 35 SPDYF_name_value_is_empty(struct SPDY_NameValue *container) in SPDYF_name_value_is_empty() argument 37 SPDYF_ASSERT(NULL != container, "NULL is not an empty container!"); in SPDYF_name_value_is_empty() 38 return (NULL == container->name && NULL == container->value) ? SPDY_YES : SPDY_NO; in SPDYF_name_value_is_empty() 56 SPDY_name_value_add (struct SPDY_NameValue *container, in SPDY_name_value_add() argument 67 if(NULL == container || NULL == name || NULL == value || 0 == (len = strlen(name))) in SPDY_name_value_add() 78 if(SPDYF_name_value_is_empty(container)) in SPDY_name_value_add() 81 if (NULL == (container->name = strdup (name))) in SPDY_name_value_add() 85 if (NULL == (container->value = malloc(sizeof(char *)))) in SPDY_name_value_add() 87 free(container->name); in SPDY_name_value_add() 92 else */if (NULL == (container->value[0] = strdup (value))) in SPDY_name_value_add() [all …]
|
/third_party/boost/boost/container/detail/ |
D | advanced_insert_int.hpp | 44 namespace boost { namespace container { namespace dtl { namespace 58 this->first_ = ::boost::container::uninitialized_move_alloc_n_source in uninitialized_copy_n_and_update() 64 this->first_ = ::boost::container::move_n_source(this->first_, n, p); in copy_n_and_update() 83 this->first_ = ::boost::container::uninitialized_copy_alloc_n_source(a, this->first_, n, p); in uninitialized_copy_n_and_update() 88 this->first_ = ::boost::container::copy_n_source(this->first_, n, p); in copy_n_and_update() 106 { boost::container::uninitialized_fill_alloc_n(a, v_, n, p); } in uninitialized_copy_n_and_update() 121 typedef ::boost::container::allocator_traits<Allocator> alloc_traits; 126 { boost::container::uninitialized_value_init_alloc_n(a, n, p); } in uninitialized_copy_n_and_update() 143 typedef ::boost::container::allocator_traits<Allocator> alloc_traits; 148 { boost::container::uninitialized_default_init_alloc_n(a, n, p); } in uninitialized_copy_n_and_update() [all …]
|
/third_party/boost/libs/unordered/test/unordered/ |
D | insert_hint_tests.cpp | 21 typedef boost::unordered_multiset<int> container; in UNORDERED_AUTO_TEST() typedef 22 container x; in UNORDERED_AUTO_TEST() 30 typedef boost::unordered_multimap<std::string, int> container; in UNORDERED_AUTO_TEST() typedef 31 container x; in UNORDERED_AUTO_TEST() 40 typedef boost::unordered_multiset<std::string> container; in UNORDERED_AUTO_TEST() typedef 41 container x; in UNORDERED_AUTO_TEST() 50 typedef boost::unordered_multimap<int, std::string> container; in UNORDERED_AUTO_TEST() typedef 51 container x; in UNORDERED_AUTO_TEST() 57 container::iterator it = x.find(10); in UNORDERED_AUTO_TEST() 71 typedef boost::unordered_multiset<std::string> container; in UNORDERED_AUTO_TEST() typedef [all …]
|
/third_party/skia/third_party/externals/dawn/src/common/ |
D | ityp_stack_vec.h | 35 this->container().resize(static_cast<I>(size)); in stack_vec() 49 this->container().resize(static_cast<I>(size)); in resize() 53 this->container().reserve(static_cast<I>(size)); in reserve() 57 return this->container().data(); in data() 61 return this->container().data(); in data() 65 return this->container().begin(); in begin() 69 return this->container().begin(); in begin() 73 return this->container().end(); in end() 77 return this->container().end(); in end() 81 return this->container().front(); in front() [all …]
|