actually it's more like an a-z tree ;).
In reply to Re^2: optimizing a linear search by Indexed or bucketed hashing
by GrandFather
in thread optimizing a linear search by Indexed or bucketed hashing
by princepawn
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |