collections.go

package skiplist

import (
	"math/rand"
	"time"

	"github.com/Ruth-Seven/skiplists_benchmark/tools"
	colSkiplist "github.com/golang-collections/go-datastructures/slice/skip"
)

type mockEntry uint64

func (me mockEntry) Compare(other colSkiplist.Entry) int {
	otherU := other.(mockEntry)
	if me == otherU {
		return 0
	}

	if me > otherU {
		return 1
	}

	return -1
}

func newMockEntry(key uint64) mockEntry {
	return mockEntry(key)
}

func colInserts(n int) {
	list := colSkiplist.New(uint(0))
	defer tools.TimeTrack(time.Now(), n)

	for i := 0; i < n; i++ {
		list.Insert(newMockEntry(uint64(n - i)))
	}
}

func colWorstInserts(n int) {
	list := colSkiplist.New(uint(0))
	defer tools.TimeTrack(time.Now(), n)

	for i := 0; i < n; i++ {
		list.Insert(newMockEntry(uint64(i)))
	}
}

func colRandomInserts(n int) {
	list := colSkiplist.New(uint(0))
	rList := rand.Perm(n)

	defer tools.TimeTrack(time.Now(), n)

	for _, e := range rList {
		list.Insert(newMockEntry(uint64(e)))
	}
}

func colAvgSearch(n int) {
	list := colSkiplist.New(uint(0))

	for i := 0; i < n; i++ {
		list.Insert(newMockEntry(uint64(i)))
	}

	defer tools.TimeTrack(time.Now(), n)

	for i := 0; i < n; i++ {
		_, _ = list.GetWithPosition(newMockEntry(uint64(i)))
	}
}

func colSearchEnd(n int) {
	list := colSkiplist.New(uint(0))

	for i := 0; i < n; i++ {
		list.Insert(newMockEntry(uint64(i)))
	}

	defer tools.TimeTrack(time.Now(), n)

	for i := 0; i < n; i++ {
		_, _ = list.GetWithPosition(newMockEntry(uint64(n - 1)))
	}
}

func colDelete(n int) {
	list := colSkiplist.New(uint(0))

	for i := 0; i < n; i++ {
		list.Insert(newMockEntry(uint64(i)))
	}

	defer tools.TimeTrack(time.Now(), n)

	for i := 0; i < n; i++ {
		_ = list.Delete(newMockEntry(uint64(i)))
	}
}

func colWorstDelete(n int) {
	list := colSkiplist.New(uint(0))

	for i := 0; i < n; i++ {
		list.Insert(newMockEntry(uint64(i)))
	}

	defer tools.TimeTrack(time.Now(), n)

	for i := 0; i < n; i++ {
		_ = list.Delete(newMockEntry(uint64(n - i)))
	}
}

func colRandomDelete(n int) {

	list := colSkiplist.New(uint(0))

	for i := 0; i < n; i++ {
		list.Insert(newMockEntry(uint64(i)))
	}

	rList := rand.Perm(n)
	defer tools.TimeTrack(time.Now(), n)

	for _, e := range rList {
		_ = list.Delete(newMockEntry(uint64(e)))
	}
}

var ColFunctions = []func(int){colInserts, colWorstInserts, colRandomInserts,
	colAvgSearch, colSearchEnd, colDelete, colWorstDelete, colRandomDelete}