MCPcopy Create free account
hub / github.com/apache/arrow / NullableTerminalNode

Class NullableTerminalNode

cpp/src/parquet/arrow/path_internal.cc:274–307  ·  view source on GitHub ↗

Node for handling the case when the leaf-array is nullable and contains null elements.

Source from the content-addressed store, hash-verified

272/// Node for handling the case when the leaf-array is nullable
273/// and contains null elements.
274struct NullableTerminalNode {
275 NullableTerminalNode() = default;
276
277 NullableTerminalNode(const uint8_t* bitmap, int64_t element_offset,
278 int16_t def_level_if_present)
279 : bitmap_(bitmap),
280 element_offset_(element_offset),
281 def_level_if_present_(def_level_if_present),
282 def_level_if_null_(def_level_if_present - 1) {}
283
284 IterationResult Run(const ElementRange& range, PathWriteContext* context) {
285 int64_t elements = range.Size();
286 RETURN_IF_ERROR(context->ReserveDefLevels(elements));
287
288 DCHECK_GT(elements, 0);
289
290 auto bit_visitor = [&](bool is_set) {
291 context->UnsafeAppendDefLevel(is_set ? def_level_if_present_ : def_level_if_null_);
292 };
293
294 if (elements > 16) { // 16 guarantees at least one unrolled loop.
295 ::arrow::internal::VisitBitsUnrolled(bitmap_, range.start + element_offset_,
296 elements, bit_visitor);
297 } else {
298 ::arrow::internal::VisitBits(bitmap_, range.start + element_offset_, elements,
299 bit_visitor);
300 }
301 return kDone;
302 }
303 const uint8_t* bitmap_;
304 int64_t element_offset_;
305 int16_t def_level_if_present_;
306 int16_t def_level_if_null_;
307};
308
309// List nodes handle populating rep_level for Arrow Lists and def-level for empty lists.
310// Nullability (both list and children) is handled by other Nodes. By

Callers 1

AddTerminalInfoMethod · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected