/src/flatbuffers/tests/64bit/test_64bit_generated.h
Line | Count | Source (jump to first uncovered line) |
1 | | // automatically generated by the FlatBuffers compiler, do not modify |
2 | | |
3 | | |
4 | | #ifndef FLATBUFFERS_GENERATED_TEST64BIT_H_ |
5 | | #define FLATBUFFERS_GENERATED_TEST64BIT_H_ |
6 | | |
7 | | #include "flatbuffers/flatbuffers.h" |
8 | | |
9 | | // Ensure the included flatbuffers.h is the same version as when this file was |
10 | | // generated, otherwise it may not be compatible. |
11 | | static_assert(FLATBUFFERS_VERSION_MAJOR == 23 && |
12 | | FLATBUFFERS_VERSION_MINOR == 5 && |
13 | | FLATBUFFERS_VERSION_REVISION == 26, |
14 | | "Non-compatible flatbuffers version included"); |
15 | | |
16 | | // For access to the binary schema that produced this file. |
17 | | #include "test_64bit_bfbs_generated.h" |
18 | | |
19 | | struct LeafStruct; |
20 | | |
21 | | struct WrapperTable; |
22 | | struct WrapperTableBuilder; |
23 | | struct WrapperTableT; |
24 | | |
25 | | struct RootTable; |
26 | | struct RootTableBuilder; |
27 | | struct RootTableT; |
28 | | |
29 | | bool operator==(const LeafStruct &lhs, const LeafStruct &rhs); |
30 | | bool operator!=(const LeafStruct &lhs, const LeafStruct &rhs); |
31 | | bool operator==(const WrapperTableT &lhs, const WrapperTableT &rhs); |
32 | | bool operator!=(const WrapperTableT &lhs, const WrapperTableT &rhs); |
33 | | bool operator==(const RootTableT &lhs, const RootTableT &rhs); |
34 | | bool operator!=(const RootTableT &lhs, const RootTableT &rhs); |
35 | | |
36 | | inline const ::flatbuffers::TypeTable *LeafStructTypeTable(); |
37 | | |
38 | | inline const ::flatbuffers::TypeTable *WrapperTableTypeTable(); |
39 | | |
40 | | inline const ::flatbuffers::TypeTable *RootTableTypeTable(); |
41 | | |
42 | | FLATBUFFERS_MANUALLY_ALIGNED_STRUCT(8) LeafStruct FLATBUFFERS_FINAL_CLASS { |
43 | | private: |
44 | | int32_t a_; |
45 | | int32_t padding0__; |
46 | | double b_; |
47 | | |
48 | | public: |
49 | 0 | static const ::flatbuffers::TypeTable *MiniReflectTypeTable() { |
50 | 0 | return LeafStructTypeTable(); |
51 | 0 | } |
52 | | LeafStruct() |
53 | | : a_(0), |
54 | | padding0__(0), |
55 | 0 | b_(0) { |
56 | 0 | (void)padding0__; |
57 | 0 | } |
58 | | LeafStruct(int32_t _a, double _b) |
59 | | : a_(::flatbuffers::EndianScalar(_a)), |
60 | | padding0__(0), |
61 | 0 | b_(::flatbuffers::EndianScalar(_b)) { |
62 | 0 | (void)padding0__; |
63 | 0 | } |
64 | 9.15k | int32_t a() const { |
65 | 9.15k | return ::flatbuffers::EndianScalar(a_); |
66 | 9.15k | } |
67 | 0 | void mutate_a(int32_t _a) { |
68 | 0 | ::flatbuffers::WriteScalar(&a_, _a); |
69 | 0 | } |
70 | 9.15k | double b() const { |
71 | 9.15k | return ::flatbuffers::EndianScalar(b_); |
72 | 9.15k | } |
73 | 0 | void mutate_b(double _b) { |
74 | 0 | ::flatbuffers::WriteScalar(&b_, _b); |
75 | 0 | } |
76 | | }; |
77 | | FLATBUFFERS_STRUCT_END(LeafStruct, 16); |
78 | | |
79 | 0 | inline bool operator==(const LeafStruct &lhs, const LeafStruct &rhs) { |
80 | 0 | return |
81 | 0 | (lhs.a() == rhs.a()) && |
82 | 0 | (lhs.b() == rhs.b()); |
83 | 0 | } |
84 | | |
85 | 0 | inline bool operator!=(const LeafStruct &lhs, const LeafStruct &rhs) { |
86 | 0 | return !(lhs == rhs); |
87 | 0 | } |
88 | | |
89 | | |
90 | | struct WrapperTableT : public ::flatbuffers::NativeTable { |
91 | | typedef WrapperTable TableType; |
92 | | std::vector<int8_t> vector{}; |
93 | | }; |
94 | | |
95 | | struct WrapperTable FLATBUFFERS_FINAL_CLASS : private ::flatbuffers::Table { |
96 | | typedef WrapperTableT NativeTableType; |
97 | | typedef WrapperTableBuilder Builder; |
98 | | typedef RootTableBinarySchema BinarySchema; |
99 | 0 | static const ::flatbuffers::TypeTable *MiniReflectTypeTable() { |
100 | 0 | return WrapperTableTypeTable(); |
101 | 0 | } |
102 | | enum FlatBuffersVTableOffset FLATBUFFERS_VTABLE_UNDERLYING_TYPE { |
103 | | VT_VECTOR = 4 |
104 | | }; |
105 | 411k | const ::flatbuffers::Vector<int8_t> *vector() const { |
106 | 411k | return GetPointer64<const ::flatbuffers::Vector<int8_t> *>(VT_VECTOR); |
107 | 411k | } |
108 | 0 | ::flatbuffers::Vector<int8_t> *mutable_vector() { |
109 | 0 | return GetPointer64<::flatbuffers::Vector<int8_t> *>(VT_VECTOR); |
110 | 0 | } |
111 | 411k | bool Verify(::flatbuffers::Verifier &verifier) const { |
112 | 411k | return VerifyTableStart(verifier) && |
113 | 411k | VerifyOffset64(verifier, VT_VECTOR) && |
114 | 411k | verifier.VerifyVector(vector()) && |
115 | 411k | verifier.EndTable(); |
116 | 411k | } |
117 | | WrapperTableT *UnPack(const ::flatbuffers::resolver_function_t *_resolver = nullptr) const; |
118 | | void UnPackTo(WrapperTableT *_o, const ::flatbuffers::resolver_function_t *_resolver = nullptr) const; |
119 | | static ::flatbuffers::Offset<WrapperTable> Pack(::flatbuffers::FlatBufferBuilder64 &_fbb, const WrapperTableT* _o, const ::flatbuffers::rehasher_function_t *_rehasher = nullptr); |
120 | | }; |
121 | | |
122 | | struct WrapperTableBuilder { |
123 | | typedef WrapperTable Table; |
124 | | ::flatbuffers::FlatBufferBuilder64 &fbb_; |
125 | | ::flatbuffers::uoffset_t start_; |
126 | 0 | void add_vector(::flatbuffers::Offset64<::flatbuffers::Vector<int8_t>> vector) { |
127 | 0 | fbb_.AddOffset(WrapperTable::VT_VECTOR, vector); |
128 | 0 | } |
129 | | explicit WrapperTableBuilder(::flatbuffers::FlatBufferBuilder64 &_fbb) |
130 | 0 | : fbb_(_fbb) { |
131 | 0 | start_ = fbb_.StartTable(); |
132 | 0 | } |
133 | 0 | ::flatbuffers::Offset<WrapperTable> Finish() { |
134 | 0 | const auto end = fbb_.EndTable(start_); |
135 | 0 | auto o = ::flatbuffers::Offset<WrapperTable>(end); |
136 | 0 | return o; |
137 | 0 | } |
138 | | }; |
139 | | |
140 | | inline ::flatbuffers::Offset<WrapperTable> CreateWrapperTable( |
141 | | ::flatbuffers::FlatBufferBuilder64 &_fbb, |
142 | 0 | ::flatbuffers::Offset64<::flatbuffers::Vector<int8_t>> vector = 0) { |
143 | 0 | WrapperTableBuilder builder_(_fbb); |
144 | 0 | builder_.add_vector(vector); |
145 | 0 | return builder_.Finish(); |
146 | 0 | } |
147 | | |
148 | | inline ::flatbuffers::Offset<WrapperTable> CreateWrapperTableDirect( |
149 | | ::flatbuffers::FlatBufferBuilder64 &_fbb, |
150 | 0 | const std::vector<int8_t> *vector = nullptr) { |
151 | 0 | auto vector__ = vector ? _fbb.CreateVector64<::flatbuffers::Vector>(*vector) : 0; |
152 | 0 | return CreateWrapperTable( |
153 | 0 | _fbb, |
154 | 0 | vector__); |
155 | 0 | } |
156 | | |
157 | | ::flatbuffers::Offset<WrapperTable> CreateWrapperTable(::flatbuffers::FlatBufferBuilder64 &_fbb, const WrapperTableT *_o, const ::flatbuffers::rehasher_function_t *_rehasher = nullptr); |
158 | | |
159 | | struct RootTableT : public ::flatbuffers::NativeTable { |
160 | | typedef RootTable TableType; |
161 | | std::vector<uint8_t> far_vector{}; |
162 | | int32_t a = 0; |
163 | | std::string far_string{}; |
164 | | std::vector<uint8_t> big_vector{}; |
165 | | std::string near_string{}; |
166 | | std::vector<uint8_t> nested_root{}; |
167 | | std::vector<LeafStruct> far_struct_vector{}; |
168 | | std::vector<LeafStruct> big_struct_vector{}; |
169 | | std::vector<std::unique_ptr<WrapperTableT>> many_vectors{}; |
170 | | std::vector<uint8_t> forced_aligned_vector{}; |
171 | | RootTableT() = default; |
172 | | RootTableT(const RootTableT &o); |
173 | | RootTableT(RootTableT&&) FLATBUFFERS_NOEXCEPT = default; |
174 | | RootTableT &operator=(RootTableT o) FLATBUFFERS_NOEXCEPT; |
175 | | }; |
176 | | |
177 | | struct RootTable FLATBUFFERS_FINAL_CLASS : private ::flatbuffers::Table { |
178 | | typedef RootTableT NativeTableType; |
179 | | typedef RootTableBuilder Builder; |
180 | | typedef RootTableBinarySchema BinarySchema; |
181 | 0 | static const ::flatbuffers::TypeTable *MiniReflectTypeTable() { |
182 | 0 | return RootTableTypeTable(); |
183 | 0 | } |
184 | | enum FlatBuffersVTableOffset FLATBUFFERS_VTABLE_UNDERLYING_TYPE { |
185 | | VT_FAR_VECTOR = 4, |
186 | | VT_A = 6, |
187 | | VT_FAR_STRING = 8, |
188 | | VT_BIG_VECTOR = 10, |
189 | | VT_NEAR_STRING = 12, |
190 | | VT_NESTED_ROOT = 14, |
191 | | VT_FAR_STRUCT_VECTOR = 16, |
192 | | VT_BIG_STRUCT_VECTOR = 18, |
193 | | VT_MANY_VECTORS = 20, |
194 | | VT_FORCED_ALIGNED_VECTOR = 22 |
195 | | }; |
196 | 4.78k | const ::flatbuffers::Vector<uint8_t> *far_vector() const { |
197 | 4.78k | return GetPointer64<const ::flatbuffers::Vector<uint8_t> *>(VT_FAR_VECTOR); |
198 | 4.78k | } |
199 | 0 | ::flatbuffers::Vector<uint8_t> *mutable_far_vector() { |
200 | 0 | return GetPointer64<::flatbuffers::Vector<uint8_t> *>(VT_FAR_VECTOR); |
201 | 0 | } |
202 | 800 | int32_t a() const { |
203 | 800 | return GetField<int32_t>(VT_A, 0); |
204 | 800 | } |
205 | 0 | bool mutate_a(int32_t _a = 0) { |
206 | 0 | return SetField<int32_t>(VT_A, _a, 0); |
207 | 0 | } |
208 | 4.46k | const ::flatbuffers::String *far_string() const { |
209 | 4.46k | return GetPointer64<const ::flatbuffers::String *>(VT_FAR_STRING); |
210 | 4.46k | } |
211 | 0 | ::flatbuffers::String *mutable_far_string() { |
212 | 0 | return GetPointer64<::flatbuffers::String *>(VT_FAR_STRING); |
213 | 0 | } |
214 | 4.14k | const ::flatbuffers::Vector64<uint8_t> *big_vector() const { |
215 | 4.14k | return GetPointer64<const ::flatbuffers::Vector64<uint8_t> *>(VT_BIG_VECTOR); |
216 | 4.14k | } |
217 | 0 | ::flatbuffers::Vector64<uint8_t> *mutable_big_vector() { |
218 | 0 | return GetPointer64<::flatbuffers::Vector64<uint8_t> *>(VT_BIG_VECTOR); |
219 | 0 | } |
220 | 3.91k | const ::flatbuffers::String *near_string() const { |
221 | 3.91k | return GetPointer<const ::flatbuffers::String *>(VT_NEAR_STRING); |
222 | 3.91k | } |
223 | 0 | ::flatbuffers::String *mutable_near_string() { |
224 | 0 | return GetPointer<::flatbuffers::String *>(VT_NEAR_STRING); |
225 | 0 | } |
226 | 7.27k | const ::flatbuffers::Vector64<uint8_t> *nested_root() const { |
227 | 7.27k | return GetPointer64<const ::flatbuffers::Vector64<uint8_t> *>(VT_NESTED_ROOT); |
228 | 7.27k | } |
229 | 0 | ::flatbuffers::Vector64<uint8_t> *mutable_nested_root() { |
230 | 0 | return GetPointer64<::flatbuffers::Vector64<uint8_t> *>(VT_NESTED_ROOT); |
231 | 0 | } |
232 | 642 | const RootTable *nested_root_nested_root() const { |
233 | 642 | const auto _f = nested_root(); |
234 | 642 | return _f ? ::flatbuffers::GetRoot<RootTable>(_f->Data()) |
235 | 642 | : nullptr; |
236 | 642 | } |
237 | 3.33k | const ::flatbuffers::Vector<const LeafStruct *> *far_struct_vector() const { |
238 | 3.33k | return GetPointer64<const ::flatbuffers::Vector<const LeafStruct *> *>(VT_FAR_STRUCT_VECTOR); |
239 | 3.33k | } |
240 | 0 | ::flatbuffers::Vector<const LeafStruct *> *mutable_far_struct_vector() { |
241 | 0 | return GetPointer64<::flatbuffers::Vector<const LeafStruct *> *>(VT_FAR_STRUCT_VECTOR); |
242 | 0 | } |
243 | 3.22k | const ::flatbuffers::Vector64<const LeafStruct *> *big_struct_vector() const { |
244 | 3.22k | return GetPointer64<const ::flatbuffers::Vector64<const LeafStruct *> *>(VT_BIG_STRUCT_VECTOR); |
245 | 3.22k | } |
246 | 0 | ::flatbuffers::Vector64<const LeafStruct *> *mutable_big_struct_vector() { |
247 | 0 | return GetPointer64<::flatbuffers::Vector64<const LeafStruct *> *>(VT_BIG_STRUCT_VECTOR); |
248 | 0 | } |
249 | 4.36k | const ::flatbuffers::Vector<::flatbuffers::Offset<WrapperTable>> *many_vectors() const { |
250 | 4.36k | return GetPointer<const ::flatbuffers::Vector<::flatbuffers::Offset<WrapperTable>> *>(VT_MANY_VECTORS); |
251 | 4.36k | } |
252 | 0 | ::flatbuffers::Vector<::flatbuffers::Offset<WrapperTable>> *mutable_many_vectors() { |
253 | 0 | return GetPointer<::flatbuffers::Vector<::flatbuffers::Offset<WrapperTable>> *>(VT_MANY_VECTORS); |
254 | 0 | } |
255 | 1.61k | const ::flatbuffers::Vector64<uint8_t> *forced_aligned_vector() const { |
256 | 1.61k | return GetPointer64<const ::flatbuffers::Vector64<uint8_t> *>(VT_FORCED_ALIGNED_VECTOR); |
257 | 1.61k | } |
258 | 0 | ::flatbuffers::Vector64<uint8_t> *mutable_forced_aligned_vector() { |
259 | 0 | return GetPointer64<::flatbuffers::Vector64<uint8_t> *>(VT_FORCED_ALIGNED_VECTOR); |
260 | 0 | } |
261 | 4.39k | bool Verify(::flatbuffers::Verifier &verifier) const { |
262 | 4.39k | return VerifyTableStart(verifier) && |
263 | 4.39k | VerifyOffset64(verifier, VT_FAR_VECTOR) && |
264 | 4.39k | verifier.VerifyVector(far_vector()) && |
265 | 4.39k | VerifyField<int32_t>(verifier, VT_A, 4) && |
266 | 4.39k | VerifyOffset64(verifier, VT_FAR_STRING) && |
267 | 4.39k | verifier.VerifyString(far_string()) && |
268 | 4.39k | VerifyOffset64(verifier, VT_BIG_VECTOR) && |
269 | 4.39k | verifier.VerifyVector(big_vector()) && |
270 | 4.39k | VerifyOffset(verifier, VT_NEAR_STRING) && |
271 | 4.39k | verifier.VerifyString(near_string()) && |
272 | 4.39k | VerifyOffset64(verifier, VT_NESTED_ROOT) && |
273 | 4.39k | verifier.VerifyVector(nested_root()) && |
274 | 4.39k | verifier.VerifyNestedFlatBuffer<RootTable>(nested_root(), nullptr) && |
275 | 4.39k | VerifyOffset64(verifier, VT_FAR_STRUCT_VECTOR) && |
276 | 4.39k | verifier.VerifyVector(far_struct_vector()) && |
277 | 4.39k | VerifyOffset64(verifier, VT_BIG_STRUCT_VECTOR) && |
278 | 4.39k | verifier.VerifyVector(big_struct_vector()) && |
279 | 4.39k | VerifyOffset(verifier, VT_MANY_VECTORS) && |
280 | 4.39k | verifier.VerifyVector(many_vectors()) && |
281 | 4.39k | verifier.VerifyVectorOfTables(many_vectors()) && |
282 | 4.39k | VerifyOffset64(verifier, VT_FORCED_ALIGNED_VECTOR) && |
283 | 4.39k | verifier.VerifyVector(forced_aligned_vector()) && |
284 | 4.39k | verifier.EndTable(); |
285 | 4.39k | } |
286 | | RootTableT *UnPack(const ::flatbuffers::resolver_function_t *_resolver = nullptr) const; |
287 | | void UnPackTo(RootTableT *_o, const ::flatbuffers::resolver_function_t *_resolver = nullptr) const; |
288 | | static ::flatbuffers::Offset<RootTable> Pack(::flatbuffers::FlatBufferBuilder64 &_fbb, const RootTableT* _o, const ::flatbuffers::rehasher_function_t *_rehasher = nullptr); |
289 | | }; |
290 | | |
291 | | struct RootTableBuilder { |
292 | | typedef RootTable Table; |
293 | | ::flatbuffers::FlatBufferBuilder64 &fbb_; |
294 | | ::flatbuffers::uoffset_t start_; |
295 | 0 | void add_far_vector(::flatbuffers::Offset64<::flatbuffers::Vector<uint8_t>> far_vector) { |
296 | 0 | fbb_.AddOffset(RootTable::VT_FAR_VECTOR, far_vector); |
297 | 0 | } |
298 | 0 | void add_a(int32_t a) { |
299 | 0 | fbb_.AddElement<int32_t>(RootTable::VT_A, a, 0); |
300 | 0 | } |
301 | 0 | void add_far_string(::flatbuffers::Offset64<::flatbuffers::String> far_string) { |
302 | 0 | fbb_.AddOffset(RootTable::VT_FAR_STRING, far_string); |
303 | 0 | } |
304 | 0 | void add_big_vector(::flatbuffers::Offset64<::flatbuffers::Vector64<uint8_t>> big_vector) { |
305 | 0 | fbb_.AddOffset(RootTable::VT_BIG_VECTOR, big_vector); |
306 | 0 | } |
307 | 0 | void add_near_string(::flatbuffers::Offset<::flatbuffers::String> near_string) { |
308 | 0 | fbb_.AddOffset(RootTable::VT_NEAR_STRING, near_string); |
309 | 0 | } |
310 | 0 | void add_nested_root(::flatbuffers::Offset64<::flatbuffers::Vector64<uint8_t>> nested_root) { |
311 | 0 | fbb_.AddOffset(RootTable::VT_NESTED_ROOT, nested_root); |
312 | 0 | } |
313 | 0 | void add_far_struct_vector(::flatbuffers::Offset64<::flatbuffers::Vector<const LeafStruct *>> far_struct_vector) { |
314 | 0 | fbb_.AddOffset(RootTable::VT_FAR_STRUCT_VECTOR, far_struct_vector); |
315 | 0 | } |
316 | 0 | void add_big_struct_vector(::flatbuffers::Offset64<::flatbuffers::Vector64<const LeafStruct *>> big_struct_vector) { |
317 | 0 | fbb_.AddOffset(RootTable::VT_BIG_STRUCT_VECTOR, big_struct_vector); |
318 | 0 | } |
319 | 0 | void add_many_vectors(::flatbuffers::Offset<::flatbuffers::Vector<::flatbuffers::Offset<WrapperTable>>> many_vectors) { |
320 | 0 | fbb_.AddOffset(RootTable::VT_MANY_VECTORS, many_vectors); |
321 | 0 | } |
322 | 0 | void add_forced_aligned_vector(::flatbuffers::Offset64<::flatbuffers::Vector64<uint8_t>> forced_aligned_vector) { |
323 | 0 | fbb_.AddOffset(RootTable::VT_FORCED_ALIGNED_VECTOR, forced_aligned_vector); |
324 | 0 | } |
325 | | explicit RootTableBuilder(::flatbuffers::FlatBufferBuilder64 &_fbb) |
326 | 0 | : fbb_(_fbb) { |
327 | 0 | start_ = fbb_.StartTable(); |
328 | 0 | } |
329 | 0 | ::flatbuffers::Offset<RootTable> Finish() { |
330 | 0 | const auto end = fbb_.EndTable(start_); |
331 | 0 | auto o = ::flatbuffers::Offset<RootTable>(end); |
332 | 0 | return o; |
333 | 0 | } |
334 | | }; |
335 | | |
336 | | inline ::flatbuffers::Offset<RootTable> CreateRootTable( |
337 | | ::flatbuffers::FlatBufferBuilder64 &_fbb, |
338 | | ::flatbuffers::Offset64<::flatbuffers::Vector<uint8_t>> far_vector = 0, |
339 | | int32_t a = 0, |
340 | | ::flatbuffers::Offset64<::flatbuffers::String> far_string = 0, |
341 | | ::flatbuffers::Offset64<::flatbuffers::Vector64<uint8_t>> big_vector = 0, |
342 | | ::flatbuffers::Offset<::flatbuffers::String> near_string = 0, |
343 | | ::flatbuffers::Offset64<::flatbuffers::Vector64<uint8_t>> nested_root = 0, |
344 | | ::flatbuffers::Offset64<::flatbuffers::Vector<const LeafStruct *>> far_struct_vector = 0, |
345 | | ::flatbuffers::Offset64<::flatbuffers::Vector64<const LeafStruct *>> big_struct_vector = 0, |
346 | | ::flatbuffers::Offset<::flatbuffers::Vector<::flatbuffers::Offset<WrapperTable>>> many_vectors = 0, |
347 | 0 | ::flatbuffers::Offset64<::flatbuffers::Vector64<uint8_t>> forced_aligned_vector = 0) { |
348 | 0 | RootTableBuilder builder_(_fbb); |
349 | 0 | builder_.add_forced_aligned_vector(forced_aligned_vector); |
350 | 0 | builder_.add_big_struct_vector(big_struct_vector); |
351 | 0 | builder_.add_nested_root(nested_root); |
352 | 0 | builder_.add_big_vector(big_vector); |
353 | 0 | builder_.add_many_vectors(many_vectors); |
354 | 0 | builder_.add_far_struct_vector(far_struct_vector); |
355 | 0 | builder_.add_near_string(near_string); |
356 | 0 | builder_.add_far_string(far_string); |
357 | 0 | builder_.add_a(a); |
358 | 0 | builder_.add_far_vector(far_vector); |
359 | 0 | return builder_.Finish(); |
360 | 0 | } |
361 | | |
362 | | inline ::flatbuffers::Offset<RootTable> CreateRootTableDirect( |
363 | | ::flatbuffers::FlatBufferBuilder64 &_fbb, |
364 | | const std::vector<uint8_t> *far_vector = nullptr, |
365 | | int32_t a = 0, |
366 | | const char *far_string = nullptr, |
367 | | const std::vector<uint8_t> *big_vector = nullptr, |
368 | | const char *near_string = nullptr, |
369 | | const std::vector<uint8_t> *nested_root = nullptr, |
370 | | const std::vector<LeafStruct> *far_struct_vector = nullptr, |
371 | | const std::vector<LeafStruct> *big_struct_vector = nullptr, |
372 | | const std::vector<::flatbuffers::Offset<WrapperTable>> *many_vectors = nullptr, |
373 | 0 | const std::vector<uint8_t> *forced_aligned_vector = nullptr) { |
374 | 0 | auto far_vector__ = far_vector ? _fbb.CreateVector64<::flatbuffers::Vector>(*far_vector) : 0; |
375 | 0 | auto far_string__ = far_string ? _fbb.CreateString<::flatbuffers::Offset64>(far_string) : 0; |
376 | 0 | auto big_vector__ = big_vector ? _fbb.CreateVector64(*big_vector) : 0; |
377 | 0 | auto nested_root__ = nested_root ? _fbb.CreateVector64(*nested_root) : 0; |
378 | 0 | auto far_struct_vector__ = far_struct_vector ? _fbb.CreateVectorOfStructs64<::flatbuffers::Vector>(*far_struct_vector) : 0; |
379 | 0 | auto big_struct_vector__ = big_struct_vector ? _fbb.CreateVectorOfStructs64(*big_struct_vector) : 0; |
380 | 0 | if (forced_aligned_vector) { _fbb.ForceVectorAlignment64(forced_aligned_vector->size(), sizeof(uint8_t), 32); } |
381 | 0 | auto forced_aligned_vector__ = forced_aligned_vector ? _fbb.CreateVector64(*forced_aligned_vector) : 0; |
382 | 0 | auto near_string__ = near_string ? _fbb.CreateString(near_string) : 0; |
383 | 0 | auto many_vectors__ = many_vectors ? _fbb.CreateVector<::flatbuffers::Offset<WrapperTable>>(*many_vectors) : 0; |
384 | 0 | return CreateRootTable( |
385 | 0 | _fbb, |
386 | 0 | far_vector__, |
387 | 0 | a, |
388 | 0 | far_string__, |
389 | 0 | big_vector__, |
390 | 0 | near_string__, |
391 | 0 | nested_root__, |
392 | 0 | far_struct_vector__, |
393 | 0 | big_struct_vector__, |
394 | 0 | many_vectors__, |
395 | 0 | forced_aligned_vector__); |
396 | 0 | } |
397 | | |
398 | | ::flatbuffers::Offset<RootTable> CreateRootTable(::flatbuffers::FlatBufferBuilder64 &_fbb, const RootTableT *_o, const ::flatbuffers::rehasher_function_t *_rehasher = nullptr); |
399 | | |
400 | | |
401 | 0 | inline bool operator==(const WrapperTableT &lhs, const WrapperTableT &rhs) { |
402 | 0 | return |
403 | 0 | (lhs.vector == rhs.vector); |
404 | 0 | } |
405 | | |
406 | 0 | inline bool operator!=(const WrapperTableT &lhs, const WrapperTableT &rhs) { |
407 | 0 | return !(lhs == rhs); |
408 | 0 | } |
409 | | |
410 | | |
411 | 0 | inline WrapperTableT *WrapperTable::UnPack(const ::flatbuffers::resolver_function_t *_resolver) const { |
412 | 0 | auto _o = std::unique_ptr<WrapperTableT>(new WrapperTableT()); |
413 | 0 | UnPackTo(_o.get(), _resolver); |
414 | 0 | return _o.release(); |
415 | 0 | } |
416 | | |
417 | 0 | inline void WrapperTable::UnPackTo(WrapperTableT *_o, const ::flatbuffers::resolver_function_t *_resolver) const { |
418 | 0 | (void)_o; |
419 | 0 | (void)_resolver; |
420 | 0 | { auto _e = vector(); if (_e) { _o->vector.resize(_e->size()); std::copy(_e->begin(), _e->end(), _o->vector.begin()); } } |
421 | 0 | } |
422 | | |
423 | 0 | inline ::flatbuffers::Offset<WrapperTable> WrapperTable::Pack(::flatbuffers::FlatBufferBuilder64 &_fbb, const WrapperTableT* _o, const ::flatbuffers::rehasher_function_t *_rehasher) { |
424 | 0 | return CreateWrapperTable(_fbb, _o, _rehasher); |
425 | 0 | } |
426 | | |
427 | 0 | inline ::flatbuffers::Offset<WrapperTable> CreateWrapperTable(::flatbuffers::FlatBufferBuilder64 &_fbb, const WrapperTableT *_o, const ::flatbuffers::rehasher_function_t *_rehasher) { |
428 | 0 | (void)_rehasher; |
429 | 0 | (void)_o; |
430 | 0 | struct _VectorArgs { ::flatbuffers::FlatBufferBuilder64 *__fbb; const WrapperTableT* __o; const ::flatbuffers::rehasher_function_t *__rehasher; } _va = { &_fbb, _o, _rehasher}; (void)_va; |
431 | 0 | auto _vector = _o->vector.size() ? _fbb.CreateVector64<::flatbuffers::Vector>(_o->vector) : 0; |
432 | 0 | return CreateWrapperTable( |
433 | 0 | _fbb, |
434 | 0 | _vector); |
435 | 0 | } |
436 | | |
437 | | |
438 | 0 | inline bool operator==(const RootTableT &lhs, const RootTableT &rhs) { |
439 | 0 | return |
440 | 0 | (lhs.far_vector == rhs.far_vector) && |
441 | 0 | (lhs.a == rhs.a) && |
442 | 0 | (lhs.far_string == rhs.far_string) && |
443 | 0 | (lhs.big_vector == rhs.big_vector) && |
444 | 0 | (lhs.near_string == rhs.near_string) && |
445 | 0 | (lhs.nested_root == rhs.nested_root) && |
446 | 0 | (lhs.far_struct_vector == rhs.far_struct_vector) && |
447 | 0 | (lhs.big_struct_vector == rhs.big_struct_vector) && |
448 | 0 | (lhs.many_vectors.size() == rhs.many_vectors.size() && std::equal(lhs.many_vectors.cbegin(), lhs.many_vectors.cend(), rhs.many_vectors.cbegin(), [](std::unique_ptr<WrapperTableT> const &a, std::unique_ptr<WrapperTableT> const &b) { return (a == b) || (a && b && *a == *b); })) && |
449 | 0 | (lhs.forced_aligned_vector == rhs.forced_aligned_vector); |
450 | 0 | } |
451 | | |
452 | 0 | inline bool operator!=(const RootTableT &lhs, const RootTableT &rhs) { |
453 | 0 | return !(lhs == rhs); |
454 | 0 | } |
455 | | |
456 | | |
457 | | inline RootTableT::RootTableT(const RootTableT &o) |
458 | | : far_vector(o.far_vector), |
459 | | a(o.a), |
460 | | far_string(o.far_string), |
461 | | big_vector(o.big_vector), |
462 | | near_string(o.near_string), |
463 | | nested_root(o.nested_root), |
464 | | far_struct_vector(o.far_struct_vector), |
465 | | big_struct_vector(o.big_struct_vector), |
466 | | forced_aligned_vector(o.forced_aligned_vector) { |
467 | | many_vectors.reserve(o.many_vectors.size()); |
468 | | for (const auto &many_vectors_ : o.many_vectors) { many_vectors.emplace_back((many_vectors_) ? new WrapperTableT(*many_vectors_) : nullptr); } |
469 | | } |
470 | | |
471 | 0 | inline RootTableT &RootTableT::operator=(RootTableT o) FLATBUFFERS_NOEXCEPT { |
472 | 0 | std::swap(far_vector, o.far_vector); |
473 | 0 | std::swap(a, o.a); |
474 | 0 | std::swap(far_string, o.far_string); |
475 | 0 | std::swap(big_vector, o.big_vector); |
476 | 0 | std::swap(near_string, o.near_string); |
477 | 0 | std::swap(nested_root, o.nested_root); |
478 | 0 | std::swap(far_struct_vector, o.far_struct_vector); |
479 | 0 | std::swap(big_struct_vector, o.big_struct_vector); |
480 | 0 | std::swap(many_vectors, o.many_vectors); |
481 | 0 | std::swap(forced_aligned_vector, o.forced_aligned_vector); |
482 | 0 | return *this; |
483 | 0 | } |
484 | | |
485 | 0 | inline RootTableT *RootTable::UnPack(const ::flatbuffers::resolver_function_t *_resolver) const { |
486 | 0 | auto _o = std::unique_ptr<RootTableT>(new RootTableT()); |
487 | 0 | UnPackTo(_o.get(), _resolver); |
488 | 0 | return _o.release(); |
489 | 0 | } |
490 | | |
491 | 0 | inline void RootTable::UnPackTo(RootTableT *_o, const ::flatbuffers::resolver_function_t *_resolver) const { |
492 | 0 | (void)_o; |
493 | 0 | (void)_resolver; |
494 | 0 | { auto _e = far_vector(); if (_e) { _o->far_vector.resize(_e->size()); std::copy(_e->begin(), _e->end(), _o->far_vector.begin()); } } |
495 | 0 | { auto _e = a(); _o->a = _e; } |
496 | 0 | { auto _e = far_string(); if (_e) _o->far_string = _e->str(); } |
497 | 0 | { auto _e = big_vector(); if (_e) { _o->big_vector.resize(_e->size()); std::copy(_e->begin(), _e->end(), _o->big_vector.begin()); } } |
498 | 0 | { auto _e = near_string(); if (_e) _o->near_string = _e->str(); } |
499 | 0 | { auto _e = nested_root(); if (_e) { _o->nested_root.resize(_e->size()); std::copy(_e->begin(), _e->end(), _o->nested_root.begin()); } } |
500 | 0 | { auto _e = far_struct_vector(); if (_e) { _o->far_struct_vector.resize(_e->size()); for (::flatbuffers::uoffset_t _i = 0; _i < _e->size(); _i++) { _o->far_struct_vector[_i] = *_e->Get(_i); } } else { _o->far_struct_vector.resize(0); } } |
501 | 0 | { auto _e = big_struct_vector(); if (_e) { _o->big_struct_vector.resize(_e->size()); for (::flatbuffers::uoffset64_t _i = 0; _i < _e->size(); _i++) { _o->big_struct_vector[_i] = *_e->Get(_i); } } else { _o->big_struct_vector.resize(0); } } |
502 | 0 | { auto _e = many_vectors(); if (_e) { _o->many_vectors.resize(_e->size()); for (::flatbuffers::uoffset_t _i = 0; _i < _e->size(); _i++) { if(_o->many_vectors[_i]) { _e->Get(_i)->UnPackTo(_o->many_vectors[_i].get(), _resolver); } else { _o->many_vectors[_i] = std::unique_ptr<WrapperTableT>(_e->Get(_i)->UnPack(_resolver)); }; } } else { _o->many_vectors.resize(0); } } |
503 | 0 | { auto _e = forced_aligned_vector(); if (_e) { _o->forced_aligned_vector.resize(_e->size()); std::copy(_e->begin(), _e->end(), _o->forced_aligned_vector.begin()); } } |
504 | 0 | } |
505 | | |
506 | 0 | inline ::flatbuffers::Offset<RootTable> RootTable::Pack(::flatbuffers::FlatBufferBuilder64 &_fbb, const RootTableT* _o, const ::flatbuffers::rehasher_function_t *_rehasher) { |
507 | 0 | return CreateRootTable(_fbb, _o, _rehasher); |
508 | 0 | } |
509 | | |
510 | 0 | inline ::flatbuffers::Offset<RootTable> CreateRootTable(::flatbuffers::FlatBufferBuilder64 &_fbb, const RootTableT *_o, const ::flatbuffers::rehasher_function_t *_rehasher) { |
511 | 0 | (void)_rehasher; |
512 | 0 | (void)_o; |
513 | 0 | struct _VectorArgs { ::flatbuffers::FlatBufferBuilder64 *__fbb; const RootTableT* __o; const ::flatbuffers::rehasher_function_t *__rehasher; } _va = { &_fbb, _o, _rehasher}; (void)_va; |
514 | 0 | auto _far_vector = _o->far_vector.size() ? _fbb.CreateVector64<::flatbuffers::Vector>(_o->far_vector) : 0; |
515 | 0 | auto _a = _o->a; |
516 | 0 | auto _far_string = _o->far_string.empty() ? 0 : _fbb.CreateString<::flatbuffers::Offset64>(_o->far_string); |
517 | 0 | auto _big_vector = _o->big_vector.size() ? _fbb.CreateVector64(_o->big_vector) : 0; |
518 | 0 | auto _near_string = _o->near_string.empty() ? 0 : _fbb.CreateString(_o->near_string); |
519 | 0 | auto _nested_root = _o->nested_root.size() ? _fbb.CreateVector64(_o->nested_root) : 0; |
520 | 0 | auto _far_struct_vector = _o->far_struct_vector.size() ? _fbb.CreateVectorOfStructs64<::flatbuffers::Vector>(_o->far_struct_vector) : 0; |
521 | 0 | auto _big_struct_vector = _o->big_struct_vector.size() ? _fbb.CreateVectorOfStructs64(_o->big_struct_vector) : 0; |
522 | 0 | auto _many_vectors = _o->many_vectors.size() ? _fbb.CreateVector<::flatbuffers::Offset<WrapperTable>> (_o->many_vectors.size(), [](size_t i, _VectorArgs *__va) { return CreateWrapperTable(*__va->__fbb, __va->__o->many_vectors[i].get(), __va->__rehasher); }, &_va ) : 0; |
523 | 0 | _fbb.ForceVectorAlignment64(_o->forced_aligned_vector.size(), sizeof(uint8_t), 32); |
524 | 0 | auto _forced_aligned_vector = _o->forced_aligned_vector.size() ? _fbb.CreateVector64(_o->forced_aligned_vector) : 0; |
525 | 0 | return CreateRootTable( |
526 | 0 | _fbb, |
527 | 0 | _far_vector, |
528 | 0 | _a, |
529 | 0 | _far_string, |
530 | 0 | _big_vector, |
531 | 0 | _near_string, |
532 | 0 | _nested_root, |
533 | 0 | _far_struct_vector, |
534 | 0 | _big_struct_vector, |
535 | 0 | _many_vectors, |
536 | 0 | _forced_aligned_vector); |
537 | 0 | } |
538 | | |
539 | 0 | inline const ::flatbuffers::TypeTable *LeafStructTypeTable() { |
540 | 0 | static const ::flatbuffers::TypeCode type_codes[] = { |
541 | 0 | { ::flatbuffers::ET_INT, 0, -1 }, |
542 | 0 | { ::flatbuffers::ET_DOUBLE, 0, -1 } |
543 | 0 | }; |
544 | 0 | static const int64_t values[] = { 0, 8, 16 }; |
545 | 0 | static const char * const names[] = { |
546 | 0 | "a", |
547 | 0 | "b" |
548 | 0 | }; |
549 | 0 | static const ::flatbuffers::TypeTable tt = { |
550 | 0 | ::flatbuffers::ST_STRUCT, 2, type_codes, nullptr, nullptr, values, names |
551 | 0 | }; |
552 | 0 | return &tt; |
553 | 0 | } |
554 | | |
555 | 0 | inline const ::flatbuffers::TypeTable *WrapperTableTypeTable() { |
556 | 0 | static const ::flatbuffers::TypeCode type_codes[] = { |
557 | 0 | { ::flatbuffers::ET_CHAR, 1, -1 } |
558 | 0 | }; |
559 | 0 | static const char * const names[] = { |
560 | 0 | "vector" |
561 | 0 | }; |
562 | 0 | static const ::flatbuffers::TypeTable tt = { |
563 | 0 | ::flatbuffers::ST_TABLE, 1, type_codes, nullptr, nullptr, nullptr, names |
564 | 0 | }; |
565 | 0 | return &tt; |
566 | 0 | } |
567 | | |
568 | 0 | inline const ::flatbuffers::TypeTable *RootTableTypeTable() { |
569 | 0 | static const ::flatbuffers::TypeCode type_codes[] = { |
570 | 0 | { ::flatbuffers::ET_UCHAR, 1, -1 }, |
571 | 0 | { ::flatbuffers::ET_INT, 0, -1 }, |
572 | 0 | { ::flatbuffers::ET_STRING, 0, -1 }, |
573 | 0 | { ::flatbuffers::ET_UCHAR, 1, -1 }, |
574 | 0 | { ::flatbuffers::ET_STRING, 0, -1 }, |
575 | 0 | { ::flatbuffers::ET_UCHAR, 1, -1 }, |
576 | 0 | { ::flatbuffers::ET_SEQUENCE, 1, 0 }, |
577 | 0 | { ::flatbuffers::ET_SEQUENCE, 1, 0 }, |
578 | 0 | { ::flatbuffers::ET_SEQUENCE, 1, 1 }, |
579 | 0 | { ::flatbuffers::ET_UCHAR, 1, -1 } |
580 | 0 | }; |
581 | 0 | static const ::flatbuffers::TypeFunction type_refs[] = { |
582 | 0 | LeafStructTypeTable, |
583 | 0 | WrapperTableTypeTable |
584 | 0 | }; |
585 | 0 | static const char * const names[] = { |
586 | 0 | "far_vector", |
587 | 0 | "a", |
588 | 0 | "far_string", |
589 | 0 | "big_vector", |
590 | 0 | "near_string", |
591 | 0 | "nested_root", |
592 | 0 | "far_struct_vector", |
593 | 0 | "big_struct_vector", |
594 | 0 | "many_vectors", |
595 | 0 | "forced_aligned_vector" |
596 | 0 | }; |
597 | 0 | static const ::flatbuffers::TypeTable tt = { |
598 | 0 | ::flatbuffers::ST_TABLE, 10, type_codes, type_refs, nullptr, nullptr, names |
599 | 0 | }; |
600 | 0 | return &tt; |
601 | 0 | } |
602 | | |
603 | 511 | inline const RootTable *GetRootTable(const void *buf) { |
604 | 511 | return ::flatbuffers::GetRoot<RootTable>(buf); |
605 | 511 | } |
606 | | |
607 | 131 | inline const RootTable *GetSizePrefixedRootTable(const void *buf) { |
608 | 131 | return ::flatbuffers::GetSizePrefixedRoot<RootTable,::flatbuffers::uoffset64_t>(buf); |
609 | 131 | } |
610 | | |
611 | 0 | inline RootTable *GetMutableRootTable(void *buf) { |
612 | 0 | return ::flatbuffers::GetMutableRoot<RootTable>(buf); |
613 | 0 | } |
614 | | |
615 | 0 | inline RootTable *GetMutableSizePrefixedRootTable(void *buf) { |
616 | 0 | return ::flatbuffers::GetMutableSizePrefixedRoot<RootTable,::flatbuffers::uoffset64_t>(buf); |
617 | 0 | } |
618 | | |
619 | | inline bool VerifyRootTableBuffer( |
620 | 3.18k | ::flatbuffers::Verifier &verifier) { |
621 | 3.18k | return verifier.VerifyBuffer<RootTable>(nullptr); |
622 | 3.18k | } |
623 | | |
624 | | inline bool VerifySizePrefixedRootTableBuffer( |
625 | 516 | ::flatbuffers::Verifier &verifier) { |
626 | 516 | return verifier.VerifySizePrefixedBuffer<RootTable,::flatbuffers::uoffset64_t>(nullptr); |
627 | 516 | } |
628 | | |
629 | | inline void FinishRootTableBuffer( |
630 | | ::flatbuffers::FlatBufferBuilder64 &fbb, |
631 | 0 | ::flatbuffers::Offset<RootTable> root) { |
632 | 0 | fbb.Finish(root); |
633 | 0 | } |
634 | | |
635 | | inline void FinishSizePrefixedRootTableBuffer( |
636 | | ::flatbuffers::FlatBufferBuilder64 &fbb, |
637 | 0 | ::flatbuffers::Offset<RootTable> root) { |
638 | 0 | fbb.FinishSizePrefixed(root); |
639 | 0 | } |
640 | | |
641 | | inline std::unique_ptr<RootTableT> UnPackRootTable( |
642 | | const void *buf, |
643 | 0 | const ::flatbuffers::resolver_function_t *res = nullptr) { |
644 | 0 | return std::unique_ptr<RootTableT>(GetRootTable(buf)->UnPack(res)); |
645 | 0 | } |
646 | | |
647 | | inline std::unique_ptr<RootTableT> UnPackSizePrefixedRootTable( |
648 | | const void *buf, |
649 | 0 | const ::flatbuffers::resolver_function_t *res = nullptr) { |
650 | 0 | return std::unique_ptr<RootTableT>(GetSizePrefixedRootTable(buf)->UnPack(res)); |
651 | 0 | } |
652 | | |
653 | | #endif // FLATBUFFERS_GENERATED_TEST64BIT_H_ |