ComputerSurge/bind9
3
0
Fork 0
Code Pull Requests 1 Activity

fixed comment about support for splitting of bitstring labels

Browse Source
This commit is contained in:
David Lawrence
2000-03-14 04:10:20 +00:00
parent a0dbccdaf6
commit 1641377cba
1 changed files with 3 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
doc/design/red-black
View File

@@ -70,10 +70,9 @@ marginally); the nodes at d.e.f and w.y do not represent keys.
As an aside, remember that when ordering DNS names, labels are
examined from the right, therefore w.y sorts after x and before z.
When bitfields are fully supported (they aren't yet) then a split can
occur not only on a regular label boundary, but also between any two
bits. The common-suffix rules will be applied to keep as many bits
together as possible.
A split can occur not only on a regular label boundary, but also
between any two bits in an EDNS bitstring label. The common-suffix
rules will be applied to keep as many bits together as possible.
In the current implementation of the tree of trees, a node is
considered to "formally" exist only if it has data associated with