Hi Gerd I'm amazed at how they've made something that could be simple and expressed with a few byte of control, around 140 bits for tree structure and 80 or so bytes of characters so big and complex! Maybe the few (5) layers closest to the root somehow hard coded. Where a node has a sub-tree on one side and a letter on the other, are these always the same way round, such that the these will always tend to one side of the tree, with nothing beyond because of double leaves closer to the root stop the tree. This would allow reasonable length bit sequences to describe the structure at each level, rather than it growing by powers of 2. Ticker On Sat, 2021-12-18 at 10:19 +0000, Gerd Petermann wrote:
Hi Ticker,
sorry, my last post turned out to be wrong. The byte at offset 2 must have a different meaning. The previously posted mdr16 for benelux has a value of 2 but 4 bytes for the "struct", while the hungary map has a value of 2 and only 3 bytes for struct. Maybe the value for 3 / 4 can be calculated from the depth of the tree.
I still have no idea what the values mean. I thought of some kind of raster image or a jump table but nothing worked out so far..
Gerd