/** * Constructs a new, empty instance of SkipList. */ public DiffListBySkipList(int capacity) { skipNodeList = new ArrayList<>(capacity); head = new SkipListNode(null, 0); }
Arrays.fill(nodePath, head); final SkipListNode newNode = new SkipListNode(diff, nodeLevel); for (int level = 0; level <= nodeLevel; level++) { if (level > 0) {
final SkipListNode[] nodePath = findPreviousNodes(null, nodeLevel); final SkipListNode newNode = new SkipListNode(diff, nodeLevel); for (int level = 0; level <= nodeLevel; level++) { if (level > 0 && nodePath[level] != head) {