You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@arrow.apache.org by "Micah Kornfield (Jira)" <ji...@apache.org> on 2020/04/17 03:46:00 UTC
[jira] [Updated] (ARROW-8413) [C++] Refactor DefLevelsToBitmap
[ https://issues.apache.org/jira/browse/ARROW-8413?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Micah Kornfield updated ARROW-8413:
-----------------------------------
Summary: [C++] Refactor DefLevelsToBitmap (was: Refactor DefLevelsToBitmap)
> [C++] Refactor DefLevelsToBitmap
> --------------------------------
>
> Key: ARROW-8413
> URL: https://issues.apache.org/jira/browse/ARROW-8413
> Project: Apache Arrow
> Issue Type: Sub-task
> Components: C++
> Reporter: Micah Kornfield
> Assignee: Micah Kornfield
> Priority: Major
>
> The current code is should be split apart and made more efficient to consolidate logic need to support all nesting combinations.
>
> We need to be able to pass in an arbitrary min definitions level to prune away elements that aren't included in lists.
> The functionality is also somewhat replicated in reading the struct code, the two paths should be consolidated.
>
>
--
This message was sent by Atlassian Jira
(v8.3.4#803005)