Skip to content

Refine nested List unflattening #3385

Description

@mp911de

Unflattening has a time complexity of O(d² × n) (where d is the nesting level). Unfolding nesting to iterative descending changes time complexity to O(d × n). Given that we always assume a bounded input Map<String, Object>, we should be able to improve our performance.

Metadata

Metadata

Assignees

Labels

Type

No type

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions