Home
last modified time | relevance | path

Searched refs:CordRepBtree (Results 1 – 25 of 111) sorted by relevance

12345

/external/cronet/third_party/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h63 class CordRepBtree : public CordRep {
135 CordRepBtree* tree;
162 static CordRepBtree* Create(CordRep* rep);
166 static void Destroy(CordRepBtree* tree);
169 static void Delete(CordRepBtree* tree) { delete tree; } in Delete()
186 static CordRepBtree* Append(CordRepBtree* tree, CordRep* rep);
187 static CordRepBtree* Prepend(CordRepBtree* tree, CordRep* rep);
200 static CordRepBtree* Append(CordRepBtree* tree, string_view data,
202 static CordRepBtree* Prepend(CordRepBtree* tree, string_view data,
223 static CordRep* RemoveSuffix(CordRepBtree* tree, size_t n);
[all …]
Dcord_rep_btree_test.cc40 static void SetEdge(CordRepBtree* node, size_t idx, CordRep* edge) { in SetEdge()
43 static void AddEdge(CordRepBtree* node, CordRep* edge) { in AddEdge()
96 if (!CordRepBtree::IsValid(arg->btree())) {
97 CordRepBtree::Dump(arg->btree(), "Expected valid NODE, got:", false,
171 CordRepBtree* BtreeAdd(CordRepBtree* node, bool append, in BtreeAdd()
173 return append ? CordRepBtree::Append(node, data) in BtreeAdd()
174 : CordRepBtree::Prepend(node, data); in BtreeAdd()
178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
191 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges()
203 CordRepBtree* MakeLeaf(size_t size = CordRepBtree::kMaxCapacity) { in MakeLeaf()
[all …]
Dcord_rep_btree.cc39 constexpr size_t CordRepBtree::kMaxCapacity;
44 using NodeStack = CordRepBtree * [CordRepBtree::kMaxDepth];
45 using EdgeType = CordRepBtree::EdgeType;
46 using OpResult = CordRepBtree::OpResult;
47 using CopyResult = CordRepBtree::CopyResult;
49 constexpr auto kFront = CordRepBtree::kFront;
50 constexpr auto kBack = CordRepBtree::kBack;
65 assert(depth <= CordRepBtree::kMaxDepth + 2); in DumpAll()
90 const CordRepBtree* node = rep->btree(); in DumpAll()
237 inline CordRepBtree* node(int depth) const { return stack[depth]; } in node()
[all …]
Dcord_rep_btree_navigator.h70 CordRepBtree* btree() const;
77 CordRep* InitFirst(CordRepBtree* tree);
80 CordRep* InitLast(CordRepBtree* tree);
87 Position InitOffset(CordRepBtree* tree, size_t offset);
137 template <CordRepBtree::EdgeType edge_type>
138 CordRep* Init(CordRepBtree* tree);
146 uint8_t index_[CordRepBtree::kMaxDepth];
147 CordRepBtree* node_[CordRepBtree::kMaxDepth];
153 inline CordRepBtree* CordRepBtreeNavigator::btree() const { in btree()
164 inline CordRep* CordRepBtreeNavigator::InitFirst(CordRepBtree* tree) { in InitFirst()
[all …]
Dcord_rep_btree_navigator_test.cc75 CordRepBtree* tree() { return tree_; } in tree()
86 CordRepBtree* tree_;
91 testing::Values(1, CordRepBtree::kMaxCapacity - 1,
92 CordRepBtree::kMaxCapacity,
93 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity - 1,
94 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity,
95 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity + 1,
96 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity * 2 +
170 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
244 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
[all …]
/external/angle/third_party/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h71 class CordRepBtree : public CordRep {
143 CordRepBtree* tree;
170 static CordRepBtree* Create(CordRep* rep);
174 static void Destroy(CordRepBtree* tree);
177 static void Delete(CordRepBtree* tree) { delete tree; } in Delete()
194 static CordRepBtree* Append(CordRepBtree* tree, CordRep* rep);
195 static CordRepBtree* Prepend(CordRepBtree* tree, CordRep* rep);
208 static CordRepBtree* Append(CordRepBtree* tree, string_view data,
210 static CordRepBtree* Prepend(CordRepBtree* tree, string_view data,
231 static CordRep* RemoveSuffix(CordRepBtree* tree, size_t n);
[all …]
Dcord_rep_btree_test.cc40 static void SetEdge(CordRepBtree* node, size_t idx, CordRep* edge) { in SetEdge()
43 static void AddEdge(CordRepBtree* node, CordRep* edge) { in AddEdge()
96 if (!CordRepBtree::IsValid(arg->btree())) {
97 CordRepBtree::Dump(arg->btree(), "Expected valid NODE, got:", false,
171 CordRepBtree* BtreeAdd(CordRepBtree* node, bool append, in BtreeAdd()
173 return append ? CordRepBtree::Append(node, data) in BtreeAdd()
174 : CordRepBtree::Prepend(node, data); in BtreeAdd()
178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
191 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges()
203 CordRepBtree* MakeLeaf(size_t size = CordRepBtree::kMaxCapacity) { in MakeLeaf()
[all …]
Dcord_rep_btree.cc40 constexpr size_t CordRepBtree::kMaxCapacity;
45 using NodeStack = CordRepBtree * [CordRepBtree::kMaxDepth];
46 using EdgeType = CordRepBtree::EdgeType;
47 using OpResult = CordRepBtree::OpResult;
48 using CopyResult = CordRepBtree::CopyResult;
50 constexpr auto kFront = CordRepBtree::kFront;
51 constexpr auto kBack = CordRepBtree::kBack;
64 assert(depth <= CordRepBtree::kMaxDepth + 2); in DumpAll()
89 const CordRepBtree* node = rep->btree(); in DumpAll()
236 inline CordRepBtree* node(int depth) const { return stack[depth]; } in node()
[all …]
Dcord_rep_btree_navigator.h70 CordRepBtree* btree() const;
77 CordRep* InitFirst(CordRepBtree* tree);
80 CordRep* InitLast(CordRepBtree* tree);
87 Position InitOffset(CordRepBtree* tree, size_t offset);
137 template <CordRepBtree::EdgeType edge_type>
138 CordRep* Init(CordRepBtree* tree);
146 uint8_t index_[CordRepBtree::kMaxDepth];
147 CordRepBtree* node_[CordRepBtree::kMaxDepth];
153 inline CordRepBtree* CordRepBtreeNavigator::btree() const { in btree()
164 inline CordRep* CordRepBtreeNavigator::InitFirst(CordRepBtree* tree) { in InitFirst()
[all …]
Dcord_rep_btree_navigator_test.cc75 CordRepBtree* tree() { return tree_; } in tree()
86 CordRepBtree* tree_;
91 testing::Values(1, CordRepBtree::kMaxCapacity - 1,
92 CordRepBtree::kMaxCapacity,
93 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity - 1,
94 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity,
95 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity + 1,
96 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity * 2 +
170 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
244 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
[all …]
/external/tensorflow/third_party/absl/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h63 class CordRepBtree : public CordRep {
135 CordRepBtree* tree;
162 static CordRepBtree* Create(CordRep* rep);
166 static void Destroy(CordRepBtree* tree);
169 static void Delete(CordRepBtree* tree) { delete tree; } in Delete()
186 static CordRepBtree* Append(CordRepBtree* tree, CordRep* rep);
187 static CordRepBtree* Prepend(CordRepBtree* tree, CordRep* rep);
200 static CordRepBtree* Append(CordRepBtree* tree, string_view data,
202 static CordRepBtree* Prepend(CordRepBtree* tree, string_view data,
223 static CordRep* RemoveSuffix(CordRepBtree* tree, size_t n);
[all …]
Dcord_rep_btree_test.cc40 static void SetEdge(CordRepBtree* node, size_t idx, CordRep* edge) { in SetEdge()
43 static void AddEdge(CordRepBtree* node, CordRep* edge) { in AddEdge()
96 if (!CordRepBtree::IsValid(arg->btree())) {
97 CordRepBtree::Dump(arg->btree(), "Expected valid NODE, got:", false,
171 CordRepBtree* BtreeAdd(CordRepBtree* node, bool append, in BtreeAdd()
173 return append ? CordRepBtree::Append(node, data) in BtreeAdd()
174 : CordRepBtree::Prepend(node, data); in BtreeAdd()
178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
191 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges()
203 CordRepBtree* MakeLeaf(size_t size = CordRepBtree::kMaxCapacity) { in MakeLeaf()
[all …]
Dcord_rep_btree.cc38 constexpr size_t CordRepBtree::kMaxCapacity;
43 using NodeStack = CordRepBtree * [CordRepBtree::kMaxDepth];
44 using EdgeType = CordRepBtree::EdgeType;
45 using OpResult = CordRepBtree::OpResult;
46 using CopyResult = CordRepBtree::CopyResult;
48 constexpr auto kFront = CordRepBtree::kFront;
49 constexpr auto kBack = CordRepBtree::kBack;
64 assert(depth <= CordRepBtree::kMaxDepth + 2); in DumpAll()
89 const CordRepBtree* node = rep->btree(); in DumpAll()
236 inline CordRepBtree* node(int depth) const { return stack[depth]; } in node()
[all …]
Dcord_rep_btree_navigator.h70 CordRepBtree* btree() const;
77 CordRep* InitFirst(CordRepBtree* tree);
80 CordRep* InitLast(CordRepBtree* tree);
87 Position InitOffset(CordRepBtree* tree, size_t offset);
137 template <CordRepBtree::EdgeType edge_type>
138 CordRep* Init(CordRepBtree* tree);
146 uint8_t index_[CordRepBtree::kMaxDepth];
147 CordRepBtree* node_[CordRepBtree::kMaxDepth];
153 inline CordRepBtree* CordRepBtreeNavigator::btree() const { in btree()
164 inline CordRep* CordRepBtreeNavigator::InitFirst(CordRepBtree* tree) { in InitFirst()
[all …]
Dcord_rep_btree_navigator_test.cc75 CordRepBtree* tree() { return tree_; } in tree()
86 CordRepBtree* tree_;
91 testing::Values(1, CordRepBtree::kMaxCapacity - 1,
92 CordRepBtree::kMaxCapacity,
93 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity - 1,
94 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity,
95 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity + 1,
96 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity * 2 +
170 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
244 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
[all …]
/external/webrtc/third_party/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h63 class CordRepBtree : public CordRep {
135 CordRepBtree* tree;
162 static CordRepBtree* Create(CordRep* rep);
166 static void Destroy(CordRepBtree* tree);
169 static void Delete(CordRepBtree* tree) { delete tree; } in Delete()
186 static CordRepBtree* Append(CordRepBtree* tree, CordRep* rep);
187 static CordRepBtree* Prepend(CordRepBtree* tree, CordRep* rep);
200 static CordRepBtree* Append(CordRepBtree* tree, string_view data,
202 static CordRepBtree* Prepend(CordRepBtree* tree, string_view data,
223 static CordRep* RemoveSuffix(CordRepBtree* tree, size_t n);
[all …]
Dcord_rep_btree_test.cc40 static void SetEdge(CordRepBtree* node, size_t idx, CordRep* edge) { in SetEdge()
43 static void AddEdge(CordRepBtree* node, CordRep* edge) { in AddEdge()
96 if (!CordRepBtree::IsValid(arg->btree())) {
97 CordRepBtree::Dump(arg->btree(), "Expected valid NODE, got:", false,
171 CordRepBtree* BtreeAdd(CordRepBtree* node, bool append, in BtreeAdd()
173 return append ? CordRepBtree::Append(node, data) in BtreeAdd()
174 : CordRepBtree::Prepend(node, data); in BtreeAdd()
178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
191 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges()
203 CordRepBtree* MakeLeaf(size_t size = CordRepBtree::kMaxCapacity) { in MakeLeaf()
[all …]
Dcord_rep_btree.cc38 constexpr size_t CordRepBtree::kMaxCapacity;
43 using NodeStack = CordRepBtree * [CordRepBtree::kMaxDepth];
44 using EdgeType = CordRepBtree::EdgeType;
45 using OpResult = CordRepBtree::OpResult;
46 using CopyResult = CordRepBtree::CopyResult;
48 constexpr auto kFront = CordRepBtree::kFront;
49 constexpr auto kBack = CordRepBtree::kBack;
64 assert(depth <= CordRepBtree::kMaxDepth + 2); in DumpAll()
89 const CordRepBtree* node = rep->btree(); in DumpAll()
236 inline CordRepBtree* node(int depth) const { return stack[depth]; } in node()
[all …]
Dcord_rep_btree_navigator.h70 CordRepBtree* btree() const;
77 CordRep* InitFirst(CordRepBtree* tree);
80 CordRep* InitLast(CordRepBtree* tree);
87 Position InitOffset(CordRepBtree* tree, size_t offset);
137 template <CordRepBtree::EdgeType edge_type>
138 CordRep* Init(CordRepBtree* tree);
146 uint8_t index_[CordRepBtree::kMaxDepth];
147 CordRepBtree* node_[CordRepBtree::kMaxDepth];
153 inline CordRepBtree* CordRepBtreeNavigator::btree() const { in btree()
164 inline CordRep* CordRepBtreeNavigator::InitFirst(CordRepBtree* tree) { in InitFirst()
[all …]
Dcord_rep_btree_navigator_test.cc75 CordRepBtree* tree() { return tree_; } in tree()
86 CordRepBtree* tree_;
91 testing::Values(1, CordRepBtree::kMaxCapacity - 1,
92 CordRepBtree::kMaxCapacity,
93 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity - 1,
94 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity,
95 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity + 1,
96 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity * 2 +
170 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
244 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
[all …]
/external/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h63 class CordRepBtree : public CordRep {
134 CordRepBtree* tree;
161 static CordRepBtree* Create(CordRep* rep);
165 static void Destroy(CordRepBtree* tree);
168 static void Delete(CordRepBtree* tree) { delete tree; } in Delete()
185 static CordRepBtree* Append(CordRepBtree* tree, CordRep* rep);
186 static CordRepBtree* Prepend(CordRepBtree* tree, CordRep* rep);
199 static CordRepBtree* Append(CordRepBtree* tree, string_view data,
201 static CordRepBtree* Prepend(CordRepBtree* tree, string_view data,
222 static CordRep* RemoveSuffix(CordRepBtree* tree, size_t n);
[all …]
Dcord_rep_btree_test.cc40 static void SetEdge(CordRepBtree* node, size_t idx, CordRep* edge) { in SetEdge()
43 static void AddEdge(CordRepBtree* node, CordRep* edge) { in AddEdge()
96 if (!CordRepBtree::IsValid(arg->btree())) {
97 CordRepBtree::Dump(arg->btree(), "Expected valid NODE, got:", false,
171 CordRepBtree* BtreeAdd(CordRepBtree* node, bool append, in BtreeAdd()
173 return append ? CordRepBtree::Append(node, data) in BtreeAdd()
174 : CordRepBtree::Prepend(node, data); in BtreeAdd()
178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
191 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges()
203 CordRepBtree* MakeLeaf(size_t size = CordRepBtree::kMaxCapacity) { in MakeLeaf()
[all …]
Dcord_rep_btree.cc37 constexpr size_t CordRepBtree::kMaxCapacity;
42 using NodeStack = CordRepBtree * [CordRepBtree::kMaxDepth];
43 using EdgeType = CordRepBtree::EdgeType;
44 using OpResult = CordRepBtree::OpResult;
45 using CopyResult = CordRepBtree::CopyResult;
47 constexpr auto kFront = CordRepBtree::kFront;
48 constexpr auto kBack = CordRepBtree::kBack;
61 assert(depth <= CordRepBtree::kMaxDepth + 2); in DumpAll()
86 const CordRepBtree* node = rep->btree(); in DumpAll()
233 inline CordRepBtree* node(int depth) const { return stack[depth]; } in node()
[all …]
Dcord_rep_btree_navigator.h70 CordRepBtree* btree() const;
77 CordRep* InitFirst(CordRepBtree* tree);
80 CordRep* InitLast(CordRepBtree* tree);
87 Position InitOffset(CordRepBtree* tree, size_t offset);
137 template <CordRepBtree::EdgeType edge_type>
138 CordRep* Init(CordRepBtree* tree);
146 uint8_t index_[CordRepBtree::kMaxDepth];
147 CordRepBtree* node_[CordRepBtree::kMaxDepth];
153 inline CordRepBtree* CordRepBtreeNavigator::btree() const { in btree()
164 inline CordRep* CordRepBtreeNavigator::InitFirst(CordRepBtree* tree) { in InitFirst()
[all …]
Dcord_rep_btree_navigator_test.cc75 CordRepBtree* tree() { return tree_; } in tree()
86 CordRepBtree* tree_;
91 testing::Values(1, CordRepBtree::kMaxCapacity - 1,
92 CordRepBtree::kMaxCapacity,
93 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity - 1,
94 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity,
95 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity + 1,
96 CordRepBtree::kMaxCapacity* CordRepBtree::kMaxCapacity * 2 +
170 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
244 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST()
[all …]

12345