Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Enable "lazy_tree" for all Datamodels #358

Merged
merged 9 commits into from
Jul 31, 2024
Merged

Enable "lazy_tree" for all Datamodels #358

Changes from 1 commit
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
7da1fa6
allow lazy nodes
braingram May 13, 2024
6be8dc2
TST: enable lazy_tree as default
braingram May 31, 2024
cc8b2e7
convert to dict on serialization
braingram May 31, 2024
cc5b4b6
allow lazy nodes during flat_dict
braingram May 31, 2024
414c93d
fix append_individual_image_metadata for lazy nodes
braingram May 31, 2024
37eddf2
update asdf pin
braingram Jul 14, 2024
9553b01
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Jul 14, 2024
d14c4c2
update deps for oldestdeps
braingram Jul 30, 2024
e413e49
add changelog
braingram Jul 30, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
allow lazy nodes during flat_dict
  • Loading branch information
@braingram
braingram committed Jul 31, 2024
commit cc5b4b6a14755b11dd093faf9b7001c5cd5c55af
5 changes: 3 additions & 2 deletions src/roman_datamodels/datamodels/_core.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,6 +19,7 @@
import asdf
import numpy as np
from asdf.exceptions import ValidationError
from asdf.lazy_nodes import AsdfDictNode, AsdfListNode
from astropy.time import Time

from roman_datamodels import stnode, validate
Expand Down Expand Up @@ -315,10 +316,10 @@ def items(self):
"""

def recurse(tree, path=[]):
if isinstance(tree, (stnode.DNode, dict)):
if isinstance(tree, (stnode.DNode, dict, AsdfDictNode)):
for key, val in tree.items():
yield from recurse(val, path + [key])
elif isinstance(tree, (stnode.LNode, list, tuple)):
elif isinstance(tree, (stnode.LNode, list, tuple, AsdfListNode)):
for i, val in enumerate(tree):
yield from recurse(val, path + [i])
elif tree is not None:
Expand Down