1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
import re
import pytest
import numpy as np
from asdf import AsdfFile
@pytest.fixture
def asdf_file():
tree = {
"foo": 42,
"nested": {"foo": 24, "foible": "whoops", "folicle": "yup", "moo": 24},
"bar": "hello",
"list": [{"index": 0}, {"index": 1}, {"index": 2}]
}
return AsdfFile(tree)
def test_no_arguments(asdf_file):
result = asdf_file.search()
assert len(result.paths) == 15
assert len(result.nodes) == 15
def test_repr(asdf_file):
result = asdf_file.search()
assert "foo" in repr(result)
assert "nested" in repr(result)
assert "bar" in repr(result)
assert "list" in repr(result)
def test_single_result(asdf_file):
result = asdf_file.search("bar")
assert len(result.paths) == 1
assert len(result.nodes) == 1
assert result.node == "hello"
assert result.path == "root.tree['bar']"
def test_multiple_results(asdf_file):
result = asdf_file.search("foo")
assert len(result.paths) == 2
assert len(result.nodes) == 2
assert 42 in result.nodes
assert 24 in result.nodes
assert "root.tree['foo']" in result.paths
assert "root.tree['nested']['foo']" in result.paths
with pytest.raises(RuntimeError):
result.path
with pytest.raises(RuntimeError):
result.node
def test_by_key(asdf_file):
result = asdf_file.search("bar")
assert result.node == "hello"
result = asdf_file.search("^b.r$")
assert result.node == "hello"
result = asdf_file.search(re.compile("fo[oi]"))
assert set(result.nodes) == {42, 24, "whoops"}
result = asdf_file.search(0)
assert result.node == {"index": 0}
def test_by_type(asdf_file):
result = asdf_file.search(type=str)
assert sorted(result.nodes) == sorted(["hello", "whoops", "yup"])
result = asdf_file.search(type="int")
assert result.nodes == [42, 24, 24, 0, 1, 2]
result = asdf_file.search(type="dict|list")
assert len(result.nodes) == 5
result = asdf_file.search(type=re.compile("^i.t$"))
assert result.nodes == [42, 24, 24, 0, 1, 2]
with pytest.raises(TypeError):
asdf_file.search(type=4)
def test_by_value(asdf_file):
result = asdf_file.search(value=42)
assert result.node == 42
def test_by_value_with_ndarray():
"""
Check some edge cases when comparing integers and booleans to numpy arrays.
"""
tree = {
"foo": np.arange(10)
}
af = AsdfFile(tree)
result = af.search(value=True)
assert len(result.nodes) == 0
result = af.search(value=42)
assert len(result.nodes) == 0
def test_by_filter(asdf_file):
with pytest.raises(ValueError):
asdf_file.search(filter=lambda: True)
result = asdf_file.search(filter=lambda n: isinstance(n, int) and n % 2 == 0)
assert result.nodes == [42, 24, 24, 0, 2]
result = asdf_file.search(filter=lambda n, k: k == "foo" and n > 30)
assert result.node == 42
def test_multiple_conditions(asdf_file):
result = asdf_file.search("foo", value=24)
assert len(result.nodes) == 1
assert result.node == 24
def test_chaining(asdf_file):
result = asdf_file.search("foo").search(value=24)
assert len(result.nodes) == 1
assert result.node == 24
def test_index_operator(asdf_file):
result = asdf_file.search()["nested"].search("foo")
assert len(result.nodes) == 1
assert result.node == 24
with pytest.raises(TypeError):
asdf_file.search()["foo"][0]
def test_format(asdf_file):
result = asdf_file.search()
original_len = len(repr(result).split("\n"))
result = result.format(max_rows=original_len - 5)
new_len = len(repr(result).split("\n"))
assert new_len < original_len
result = result.format(max_rows=(None, 5))
new_len = len(repr(result).split("\n"))
assert new_len < original_len
assert repr(result) == repr(result.format())
def test_no_results(asdf_file):
result = asdf_file.search("missing")
assert len(result.nodes) == 0
assert "No results found." in repr(result)
assert result.node is None
assert result.path is None
def test_recursive_tree():
tree = {"foo": {"bar": "baz"}}
af = AsdfFile(tree)
af.tree["foo"]["nested"] = af.tree["foo"]
result = af.search()
assert "(recursive reference)" in repr(result)
result = af.search("bar")
assert len(result.nodes) == 1
assert result.node == "baz"
|
