Summary

What change you think needs making.

The current consistent hashing algorithm employs a non-generic version of Google/B-tree. Consider using a generic version to improve performance.

Motivation

Please give examples of your use case, e.g. when would you use this.

The current Google/BTree version 1.1.2 implements the generic version BTreeG. The generic implementation offers a slight performance improvement over the non-generic version.

Proposal

How do you think this should be implemented?