BFEVFL: Difference between revisions
Jump to navigation
Jump to search
m
→Dictionary
imported>Leoetlino No edit summary |
imported>Leoetlino m (→Dictionary) |
||
| Line 100: | Line 100: | ||
=== Dictionary === | === Dictionary === | ||
A dictionary is a data structure that is used to quickly look up the index of an element based on its name. Thus, they are always used in conjunction with an array of elements. However, the way the dictionary and the array are associated depends on the structure. | |||
BFEVFL dictionaries are essentially binary radix trees (also called PATRICIA trees or tries). The structure contains a binary search tree and bit-by-bit comparisons of strings are done to navigate through it. It is extremely similar to the Wii U bfres "index group" structure, but with significant changes to the algorithm. The Switch bfres format shares the same algorithm. | BFEVFL dictionaries are essentially binary radix trees (also called PATRICIA trees or tries). The structure contains a binary search tree and bit-by-bit comparisons of strings are done to navigate through it. It is extremely similar to the Wii U bfres "index group" structure, but with significant changes to the algorithm. The Switch bfres format shares the same algorithm. | ||