References

summary
public	F Node(key: *, down: undefined, left: undefined, right: undefined, up: undefined)
public	F SkipList(p: Number, compare: Function, head: Node)
public	F bottomMostPredecessor(compare: , node: , key: ):
public	F * debug(skiplist: *)
public	F deleteFromTopMost(node: *)
public	F downMost(node: ):
public	F heads(bias: *)
public	F insertFromBottomMostPredecessor(p: , pred: , key: ):
public	F * iter(head: *)
public	F * iterDown(head: *)
public	F * keys(level: *)
public	F makeBottomLevel(compare: , iterable: ): *
public	F makeDeterministic(p: , head: ): * Make a balanced Skip-list with p = 1/2.
public	F makeQuasiRandom(p: , head: ): * Make a balanced Skip-list with p = 1/2 but randomizing the choice of promoted nodes at each level.
public	F node(key: , down: undefined, left: undefined, right: undefined, up: undefined):
public	F predecessorOnPreviousLevel(node: ):
public	F searchTopMost(compare: , node: , key: ):