emkornfield commented on pull request #7319:
URL: https://github.com/apache/arrow/pull/7319#issuecomment-667618090
> IMO we can solve this in two steps: 1) have a top-level method to compute
def/rep levels for all leaf arrays of a given an arrow array, and then 2) use
column writer to write Parquet value/def/rep using the result from the previous
step and the input leaf array.
FWIW, this is the approach the C++ code takes (supports arbitrary nessting).
One thing to note which is currently a bug in C++ is once rep/def levels are
computed for any anything
with deep nesting (any leaf column one or more direct struct/group
ancestor), nullness should be determined rep/def-levels and not leaf-arrays
(this is currently a bug in C++).
----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
For queries about this service, please contact Infrastructure at:
[email protected]
