3 ms·
How would writing a B*-tree be any harder? The actual logic of a B*-tree would be equally hard in any language. The macroized template part is easy.
by donkeybeer 5y ago
How would writing a B*-tree be any harder?
The actual logic of a B*-tree would be equally hard in any language. The macroized template part is easy.