@@ -47,10 +47,10 @@ def test_deepcopy():
4747
4848 copied_container = deepcopy (container )
4949
50- assert container .node . id == copied_container .node . id
51- assert container .line . id == copied_container .line . id
52- assert container .transformer . id == copied_container .transformer . id
53- assert container .link . id == copied_container .link . id
50+ assert container .node [ "id" ] == copied_container .node [ "id" ]
51+ assert container .line [ "id" ] == copied_container .line [ "id" ]
52+ assert container .transformer [ "id" ] == copied_container .transformer [ "id" ]
53+ assert container .link [ "id" ] == copied_container .link [ "id" ]
5454
5555
5656def test_all_arrays ():
@@ -82,9 +82,9 @@ def test_check_ids_4_arrays_3_with_id():
8282def test_check_ids_two_arrays_no_conflicts ():
8383 container = _TwoArraysContainer .empty ()
8484 container .array_1 = IdArray .zeros (1 )
85- container .array_1 . id = 1
85+ container .array_1 [ "id" ] = 1
8686 container .array_2 = IdArray .zeros (1 )
87- container .array_1 . id = 2
87+ container .array_1 [ "id" ] = 2
8888
8989 assert 2 == len (list (container .all_arrays ()))
9090 container .check_ids ()
@@ -93,9 +93,9 @@ def test_check_ids_two_arrays_no_conflicts():
9393def test_check_ids_two_arrays_with_conflict ():
9494 container = _TwoArraysContainer .empty ()
9595 container .array_1 = IdArray .zeros (1 )
96- container .array_1 . id = 1
96+ container .array_1 [ "id" ] = 1
9797 container .array_2 = IdArray .zeros (1 )
98- container .array_2 . id = 1
98+ container .array_2 [ "id" ] = 1
9999
100100 assert 2 == len (list (container .all_arrays ()))
101101
@@ -106,9 +106,9 @@ def test_check_ids_two_arrays_with_conflict():
106106def test_check_ids_two_arrays_with_conflict_in_same_array ():
107107 container = _TwoArraysContainer .empty ()
108108 container .array_1 = IdArray .zeros (2 )
109- container .array_1 . id = [1 , 1 ]
109+ container .array_1 [ "id" ] = [1 , 1 ]
110110 container .array_2 = IdArray .zeros (1 )
111- container .array_2 . id = 2
111+ container .array_2 [ "id" ] = 2
112112
113113 assert 2 == len (list (container .all_arrays ()))
114114
@@ -125,10 +125,10 @@ def test_search_for_id_no_arrays():
125125def test_search_for_id_match_in_two_arrays ():
126126 container = Grid .empty ()
127127 container .node = NodeArray .zeros (1 )
128- container .node . id = 42
128+ container .node [ "id" ] = 42
129129
130130 container .line = LineArray .zeros (1 )
131- container .line . id = 42
131+ container .line [ "id" ] = 42
132132 result = container .search_for_id (42 )
133133
134134 expected_result = [container .node [0 :1 ], container .line [0 :1 ]]
@@ -139,10 +139,10 @@ def test_search_for_id_match_in_two_arrays():
139139def test_search_for_id_no_match_in_two_arrays ():
140140 container = Grid .empty ()
141141 container .node = NodeArray .zeros (1 )
142- container .node . id = 41
142+ container .node [ "id" ] = 41
143143
144144 container .line = LineArray .zeros (1 )
145- container .line . id = 42
145+ container .line [ "id" ] = 42
146146
147147 with pytest .raises (RecordDoesNotExist ):
148148 container .search_for_id (43 )
@@ -161,12 +161,12 @@ def test_append_with_overlapping_ids():
161161
162162 # Create first array with IDs [1, 2, 3]
163163 nodes_1 = NodeArray .zeros (3 )
164- nodes_1 . id = [1 , 2 , 3 ]
164+ nodes_1 [ "id" ] = [1 , 2 , 3 ]
165165 grid .append (nodes_1 )
166166
167167 # Create second array with overlapping IDs [3, 4, 5] (ID 3 overlaps)
168168 nodes_2 = NodeArray .zeros (3 )
169- nodes_2 . id = [3 , 4 , 5 ]
169+ nodes_2 [ "id" ] = [3 , 4 , 5 ]
170170
171171 # This should raise a ValueError due to overlapping ID 3
172172 with pytest .raises (ValueError , match = "Cannot append: minimum id 3 is not greater than the current id counter 3" ):
@@ -179,20 +179,20 @@ def test_append_with_non_overlapping_ids():
179179
180180 # Create first array with IDs [1, 2, 3]
181181 nodes_1 = NodeArray .zeros (3 )
182- nodes_1 . id = [1 , 2 , 3 ]
182+ nodes_1 [ "id" ] = [1 , 2 , 3 ]
183183 grid .append (nodes_1 )
184184
185185 # Create second array with non-overlapping IDs [4, 5, 6]
186186 nodes_2 = NodeArray .zeros (3 )
187- nodes_2 . id = [4 , 5 , 6 ]
187+ nodes_2 [ "id" ] = [4 , 5 , 6 ]
188188
189189 # This should work without error
190190 grid .append (nodes_2 )
191191
192192 # Verify all nodes are in the grid
193193 assert grid .node .size == 6
194194 expected_ids = [1 , 2 , 3 , 4 , 5 , 6 ]
195- assert sorted (grid .node . id .tolist ()) == expected_ids
195+ assert sorted (grid .node [ "id" ] .tolist ()) == expected_ids
196196
197197
198198def test_branches (grid : Grid ):
@@ -201,52 +201,52 @@ def test_branches(grid: Grid):
201201
202202 for branch_class in (LineArray , TransformerArray , LinkArray ):
203203 branches = branch_class .zeros (10 )
204- branches . from_node = nodes . id
205- branches . to_node = list (reversed (nodes . id .tolist ()))
204+ branches [ " from_node" ] = nodes [ "id" ]
205+ branches [ " to_node" ] = list (reversed (nodes [ "id" ] .tolist ()))
206206 grid .append (branches )
207207
208- expected_ids = np .concatenate ((grid .line . id , grid .transformer . id , grid .link . id ))
209- assert set (expected_ids ) == set (grid .branches . id )
208+ expected_ids = np .concatenate ((grid .line [ "id" ] , grid .transformer [ "id" ] , grid .link [ "id" ] ))
209+ assert set (expected_ids ) == set (grid .branches [ "id" ] )
210210
211211
212212def test_delete_node_without_additional_properties (basic_grid : Grid ):
213- assert 106 in basic_grid .node . id
213+ assert 106 in basic_grid .node [ "id" ]
214214 assert 106 in basic_grid .transformer ["to_node" ]
215215
216216 original_grid = deepcopy (basic_grid )
217217 node = basic_grid .node .get (id = 106 )
218218 basic_grid .delete_node (node )
219219
220220 assert 106 not in basic_grid .transformer ["to_node" ]
221- assert 106 not in basic_grid .node . id
221+ assert 106 not in basic_grid .node [ "id" ]
222222 assert len (original_grid .node ) == len (basic_grid .node ) + 1
223223 assert len (original_grid .transformer ) == len (basic_grid .transformer ) + 1
224224
225225
226226def test_delete_node_with_source (basic_grid : Grid ):
227- assert 101 in basic_grid .node . id
228- assert 101 in basic_grid .source . node
227+ assert 101 in basic_grid .node [ "id" ]
228+ assert 101 in basic_grid .source [ " node" ]
229229
230230 original_grid = deepcopy (basic_grid )
231231 node = basic_grid .node .get (id = 101 )
232232 basic_grid .delete_node (node )
233233
234- assert 101 not in basic_grid .node . id
235- assert 101 not in basic_grid .source . node
234+ assert 101 not in basic_grid .node [ "id" ]
235+ assert 101 not in basic_grid .source [ " node" ]
236236 assert len (original_grid .node ) == len (basic_grid .node ) + 1
237237 assert len (original_grid .source ) == len (basic_grid .source ) + 1
238238
239239
240240def test_delete_node_with_load (basic_grid : Grid ):
241- assert 102 in basic_grid .node . id
242- assert 102 in basic_grid .sym_load . node
241+ assert 102 in basic_grid .node [ "id" ]
242+ assert 102 in basic_grid .sym_load [ " node" ]
243243
244244 original_grid = deepcopy (basic_grid )
245245 node = basic_grid .node .get (id = 102 )
246246 basic_grid .delete_node (node )
247247
248- assert 102 not in basic_grid .node . id
249- assert 102 not in basic_grid .sym_load . node
248+ assert 102 not in basic_grid .node [ "id" ]
249+ assert 102 not in basic_grid .sym_load [ " node" ]
250250 assert len (original_grid .node ) == len (basic_grid .node ) + 1
251251 assert len (original_grid .sym_load ) == len (basic_grid .sym_load ) + 1
252252
@@ -302,9 +302,9 @@ def test_reverse_line(self, basic_grid: Grid):
302302
303303 new_line = basic_grid .line .get (from_node = 103 , to_node = 102 )
304304
305- assert new_line . from_node == line . to_node
306- assert new_line . to_node == line . from_node
307- assert new_line . id == line . id
305+ assert new_line [ " from_node" ] == line [ " to_node" ]
306+ assert new_line [ " to_node" ] == line [ " from_node" ]
307+ assert new_line [ "id" ] == line [ "id" ]
308308
309309 def test_reverse_branch (self , basic_grid : Grid ):
310310 branch = basic_grid .branches .get (from_node = 101 , to_node = 102 )
@@ -315,18 +315,18 @@ def test_reverse_branch(self, basic_grid: Grid):
315315
316316 new_branch = basic_grid .line .get (from_node = 102 , to_node = 101 )
317317
318- assert new_branch . from_node == branch . to_node
319- assert new_branch . to_node == branch . from_node
320- assert new_branch . id == branch . id
318+ assert new_branch [ " from_node" ] == branch [ " to_node" ]
319+ assert new_branch [ " to_node" ] == branch [ " from_node" ]
320+ assert new_branch [ "id" ] == branch [ "id" ]
321321
322322 def test_reverse_all_branches (self , basic_grid : Grid ):
323- from_nodes = basic_grid .branches . from_node
324- to_nodes = basic_grid .branches . to_node
323+ from_nodes = basic_grid .branches [ " from_node" ]
324+ to_nodes = basic_grid .branches [ " to_node" ]
325325
326326 basic_grid .reverse_branches (basic_grid .branches )
327327
328- assert np .all (from_nodes == basic_grid .branches . to_node )
329- assert np .all (to_nodes == basic_grid .branches . from_node )
328+ assert np .all (from_nodes == basic_grid .branches [ " to_node" ] )
329+ assert np .all (to_nodes == basic_grid .branches [ " from_node" ] )
330330
331331 def test_reverse_no_branches (self , basic_grid : Grid ):
332332 basic_grid .reverse_branches (BranchArray ())
0 commit comments