Home
last modified time | relevance | path

Searched refs:header_ptr (Results 1 – 12 of 12) sorted by relevance

/third_party/boost/boost/intrusive/
Dbstree.hpp127 node_algorithms::init_header(this->header_ptr()); in bstbase3()
130 BOOST_INTRUSIVE_FORCEINLINE node_ptr header_ptr() in header_ptr() function
133 BOOST_INTRUSIVE_FORCEINLINE const_node_ptr header_ptr() const in header_ptr() function
149 …{ return iterator(node_algorithms::begin_node(this->header_ptr()), this->priv_value_traits_ptr())… in begin()
155 …{ return const_iterator(node_algorithms::begin_node(this->header_ptr()), this->priv_value_traits_… in cbegin()
158 …{ return iterator(node_algorithms::end_node(this->header_ptr()), this->priv_value_traits_ptr()); … in end()
164 …{ return const_iterator(node_algorithms::end_node(this->header_ptr()), this->priv_value_traits_pt… in cend()
167 …{ return iterator(node_algorithms::root_node(this->header_ptr()), this->priv_value_traits_ptr());… in root()
173 …{ return const_iterator(node_algorithms::root_node(this->header_ptr()), this->priv_value_traits_p… in croot()
196 , this->header_ptr() in replace_node()
[all …]
Dtreap.hpp439 ( this->tree_type::header_ptr() in insert_equal()
468 ( this->tree_type::header_ptr() in insert_equal()
681 ( this->tree_type::header_ptr() in BOOST_INTRUSIVE_DOC1ST()
734 ( this->tree_type::header_ptr(), hint.pointed_node() in insert_unique_check()
762 node_algorithms::insert_unique_commit(this->tree_type::header_ptr(), to_insert, commit_data); in insert_unique_commit()
787 ( this->tree_type::header_ptr() in insert_before()
816 (this->tree_type::header_ptr(), to_insert, this->prio_node_prio_comp(this->priv_pcomp())); in push_back()
839 (this->tree_type::header_ptr(), to_insert, this->prio_node_prio_comp(this->priv_pcomp())); in push_front()
858 (this->tree_type::header_ptr(), to_erase, this->prio_node_prio_comp(this->priv_pcomp())); in erase()
1028 node_algorithms::clear_and_dispose(this->tree_type::header_ptr() in clear_and_dispose()
[all …]
Dsgtree.hpp454 (this->tree_type::header_ptr(), to_insert, this->key_node_comp(this->key_comp()) in insert_equal()
469 …( this->tree_type::header_ptr(), hint.pointed_node(), to_insert, this->key_node_comp(this->key_com… in insert_equal()
518 (this->tree_type::header_ptr(), key, this->key_node_comp(comp), commit_data); in BOOST_INTRUSIVE_DOC1ST()
530 … (this->tree_type::header_ptr(), hint.pointed_node(), key, this->key_node_comp(comp), commit_data); in insert_unique_check()
552 ( this->tree_type::header_ptr(), to_insert, commit_data in insert_unique_commit()
582 ( this->tree_type::header_ptr(), pos.pointed_node(), to_insert in insert_before()
597 ( this->tree_type::header_ptr(), to_insert in push_back()
611 ( this->tree_type::header_ptr(), to_insert in push_front()
628 ( this->tree_type::header_ptr(), to_erase, (std::size_t)this->size() in erase()
724 node_ptr it (node_algorithms::begin_node(source.header_ptr())) in merge_unique()
[all …]
Dlist.hpp1335 const_node_ptr header_ptr = get_root_node(); in check() local
1337 BOOST_INTRUSIVE_INVARIANT_ASSERT(node_traits::get_next(header_ptr)); in check()
1338 BOOST_INTRUSIVE_INVARIANT_ASSERT(node_traits::get_previous(header_ptr)); in check()
1340 BOOST_INTRUSIVE_INVARIANT_ASSERT((node_traits::get_next(header_ptr) == header_ptr) in check()
1341 == (node_traits::get_previous(header_ptr) == header_ptr)); in check()
1342 if (node_traits::get_next(header_ptr) == header_ptr) in check()
1349 const_node_ptr p = header_ptr; in check()
1356 if (p == header_ptr) break; in check()
Dslist.hpp1935 const_node_ptr header_ptr = get_root_node(); in check() local
1937 BOOST_INTRUSIVE_INVARIANT_ASSERT(node_traits::get_next(header_ptr)); in check()
1938 if (node_traits::get_next(header_ptr) == header_ptr) in check()
1945 const_node_ptr p = header_ptr; in check()
1955 BOOST_INTRUSIVE_INVARIANT_ASSERT(next_p != header_ptr); in check()
1957 if ((!linear && next_p == header_ptr) || (linear && !next_p)) in check()
Dsplaytree.hpp485 { return node_algorithms::splay_up(i.pointed_node(), tree_type::header_ptr()); } in splay_up()
502 node_ptr r = node_algorithms::splay_down(tree_type::header_ptr(), key, key_node_comp); in splay_down()
/third_party/mindspore/mindspore/ccsrc/minddata/mindrecord/meta/
Dshard_header.cc83 Status ShardHeader::ValidateHeader(const std::string &path, std::shared_ptr<json> *header_ptr) { in ValidateHeader() argument
84 RETURN_UNEXPECTED_IF_NULL(header_ptr); in ValidateHeader()
119 *header_ptr = std::make_shared<json>(json_header); in ValidateHeader()
123 …s ShardHeader::BuildSingleHeader(const std::string &file_path, std::shared_ptr<json> *header_ptr) { in BuildSingleHeader() argument
124 RETURN_UNEXPECTED_IF_NULL(header_ptr); in BuildSingleHeader()
137 *header_ptr = std::make_shared<json>(header); in BuildSingleHeader()
631 Status ShardHeader::Initialize(const std::shared_ptr<ShardHeader> *header_ptr, const json &schema, in Initialize() argument
634 RETURN_UNEXPECTED_IF_NULL(header_ptr); in Initialize()
637 schema_id = (*header_ptr)->AddSchema(schema_ptr); in Initialize()
643 RETURN_IF_NOT_OK((*header_ptr)->AddIndexFields(id_index_fields)); in Initialize()
[all …]
/third_party/mindspore/mindspore/ccsrc/minddata/mindrecord/include/
Dshard_header.h42 static Status BuildSingleHeader(const std::string &file_path, std::shared_ptr<json> *header_ptr);
138 static Status Initialize(const std::shared_ptr<ShardHeader> *header_ptr, const json &schema,
156 static Status ValidateHeader(const std::string &path, std::shared_ptr<json> *header_ptr);
/third_party/ffmpeg/libavcodec/
Dlibsvtav1.c225 EbBufferHeaderType *header_ptr) in read_in_data() argument
227 EbSvtIOFormat *in_data = (EbSvtIOFormat *)header_ptr->p_buffer; in read_in_data()
256 header_ptr->n_filled_len = frame_size; in read_in_data()
/third_party/mindspore/mindspore/ccsrc/minddata/mindrecord/io/
Dshard_reader.cc60 std::shared_ptr<json> header_ptr; in GetMeta() local
61 RETURN_IF_NOT_OK(ShardHeader::BuildSingleHeader(file_path, &header_ptr)); in GetMeta()
63 …*meta_data_ptr = {{"header_size", (*header_ptr)["header_size"]}, {"page_size", (*header_ptr)["page… in GetMeta()
64 … {"version", (*header_ptr)["version"]}, {"index_fields", (*header_ptr)["index_fields"]}, in GetMeta()
65 … {"schema", (*header_ptr)["schema"]}, {"blob_fields", (*header_ptr)["blob_fields"]}}; in GetMeta()
66 *addresses_ptr = std::make_shared<std::vector<std::string>>((*header_ptr)["shard_addresses"]); in GetMeta()
Dshard_index_generator.cc39 std::shared_ptr<json> header_ptr; in Build() local
40 RETURN_IF_NOT_OK(ShardHeader::BuildSingleHeader(file_path_, &header_ptr)); in Build()
42 RETURN_IF_NOT_OK(GetDatasetFiles(file_path_, (*header_ptr)["shard_addresses"], &ds)); in Build()
Dshard_writer.cc151 std::shared_ptr<json> header_ptr; in OpenForAppend() local
152 RETURN_IF_NOT_OK(ShardHeader::BuildSingleHeader(path, &header_ptr)); in OpenForAppend()
154 RETURN_IF_NOT_OK(GetDatasetFiles(path, (*header_ptr)["shard_addresses"], &ds)); in OpenForAppend()