BFEVFL: Difference between revisions

BFEVFL (view source)

417 bytes removed , 1 year ago

1,157

edits

@@ Line 142: / Line 142: @@
 ! Offset !! Type !! Description
 |-
-| 0x0 || u32 || Compact representation of bit index
+| 0x0 || u32 || Bit index
 |-
-| 0x4 || u16 || Next index if bit is 0
+| 0x4 || u16 || Index of next node if bit is 0
 |-
-| 0x6 || u16 || Next index if bit is 1
+| 0x6 || u16 || Index of next node if bit is 1
 |-
 | 0x8 || PascalString* || Name
 |}
-The compact representation of the bit index has two parts:
-* Bits 3-7: index of the byte that should be checked
-* Bits 0-2: index of the bit in that byte
-A bit index can be translated to its compact representation using:
-<syntaxhighlight lang="python">
-def get_compact_representation(bit_idx: int) -> int:
-    byte_idx = bit_idx // 8
-    return (byte_idx << 3) | (bit_idx - 8*byte_idx)
-</syntaxhighlight>
 Example: <code>Hello</code> corresponds to 100100001100101011011000110110001101111. Bits 0-3 are 1, bit 4 is 0, etc.