(packed, edgeindex, prev_child_offset, offset)
| 425 | return node_count, final, node |
| 426 | |
| 427 | def decode_edge(packed, edgeindex, prev_child_offset, offset): |
| 428 | x, offset = decode_varint_unsigned(packed, offset) |
| 429 | if x == 0 and edgeindex == 0: |
| 430 | raise KeyError # trying to decode past a final node |
| 431 | child_offset_difference, len1, last_edge = number_split_bits(x, 2) |
| 432 | child_offset = prev_child_offset + child_offset_difference |
| 433 | if len1: |
| 434 | size = 1 |
| 435 | else: |
| 436 | size, offset = decode_varint_unsigned(packed, offset) |
| 437 | return child_offset, last_edge, size, offset |
| 438 | |
| 439 | def _match_edge(packed, s, size, node_offset, stringpos): |
| 440 | if size > 1 and stringpos + size > len(s): |
no test coverage detected
searching dependent graphs…