David Lawrence
|
266655efae
|
When using chains, the foundname does not need to be a fixedname, just
a regular dns_name_t.
|
1999-04-14 14:24:51 +00:00 |
|
David Lawrence
|
1adfd0a911
|
Top level tree always has an origin of "." and all names are relative to "."
in it.
chain _first and _last now work.
Other stuff I can't recall. Lots of little fiddling with chains.
|
1999-04-14 12:03:18 +00:00 |
|
David Lawrence
|
7bd28cb40b
|
Preliminary testing of new iterator methods.
|
1999-04-09 15:17:57 +00:00 |
|
David Lawrence
|
bbf390959d
|
Test new foundname parameter to dns_rbt_findname.
|
1999-03-16 16:27:41 +00:00 |
|
Bob Halley
|
20c5672ca6
|
include unistd.h to get getopt
|
1999-03-11 20:00:13 +00:00 |
|
David Lawrence
|
bfa370f29d
|
Option to show final memory stats (-m).
|
1999-03-11 19:20:34 +00:00 |
|
David Lawrence
|
ec40d2ec68
|
use dns_rbt_findname instead of dns_rbt_findnode, and adjust tests for
possible return values.
|
1999-03-04 21:04:33 +00:00 |
|
David Lawrence
|
7f40165c89
|
include the root label in names that have it, for extra clarity (especially
when the root label is the entire name).
|
1999-03-03 19:55:03 +00:00 |
|
Michael Graff
|
882350d11c
|
Clean up many compiler warnings.
|
1999-02-11 06:38:12 +00:00 |
|
Bob Halley
|
b5fd61fd19
|
conforming changes
|
1999-02-06 01:28:15 +00:00 |
|
David Lawrence
|
0d73b3fffe
|
test the data deleter callback by making the data pointer for each node be
dynamic memory.
have 'search' print the name stored at the node's data pointer.
|
1999-01-31 16:45:48 +00:00 |
|
David Lawrence
|
fbcd8c7a5c
|
delete does not now do recursive deletion.
new function nuke does what delete did.
fixed up some changed interfaces to the dns_rbt library.
|
1999-01-31 00:54:14 +00:00 |
|
David Lawrence
|
0fb1c498ec
|
Enable the deletion test.
|
1999-01-27 02:04:28 +00:00 |
|
David Lawrence
|
9e4292a2b4
|
New rbt_test program for the red/black trees. Sample test instructions
in rbt_test.txt.
|
1999-01-26 03:30:25 +00:00 |
|