| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
|
|
|
|
(i.e. no constraints means anything goes).
|
|
|
|
test.
|
|
|
|
|
|
|
|
where one contains another (starting with the first element).
|
|
|
|
a tree.
|
|
Making it linear time at cost of knowing the data for all path elements
was probably a bad idea.
|
|
It now lives in a Util, a module that implements the adopter design pattern.
|
|
Looks like it was a bad idea.
This reverts commit 7c02dc2a949798a3fea3dbcce5a63888a3f10f51.
|
|
|
|
|
|
for multilevel insert.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
insert remains a special case, maybe it can fit it in it if we pass
to functions instead of one (one for "found" and another one for "not found").
|
|
|
|
|
|
They will be used in node reordering.
|
|
|
|
|
|
|
|
everywhere.
|
|
|
|
|
|
It's not like there's anything else we can insert or delete.
|
|
|
|
Splitting directories was a bit premature and unnecessary.
|
|
|
|
|
|
|
|
|
|
Right now it doesn't compare data, but maybe it should.
|
|
This is embarassing.
|
|
|
|
|
|
|
|
|
