We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
An (a,b)-tree implementation for FreePascal + Delphi. (a,b)-trees are a type of balanced tree similiar to B+-trees. Experimental, not maintained.