Stevedekorte's vertex.js
github.com
github.com
It's used to implement storage (b-tree). Each vertex is a set of key value pairs in the following format:
pid/s/name (slot record) pid/m/name (meta record) pid/p/name (private record)
Since all keys are lexically ordered, you can efficiently iterate (and jump to) vertex records using a cursor.