pacuna

package main

import (
	"fmt"
	"sortedlist/coarselist"
	"sync"
)

func main() {
	l := coarselist.New()

pacuna

type list struct {
	mu   sync.Mutex
	head *node
	size int
}

pacuna

type node struct {
	item []byte
	key  uint64
	next *node
}

func newNode(item []byte) *node {
	key, _ := hashstructure.Hash(item, nil)
	return &node{
		item: item,

pacuna

func (l *list) Add(item []byte) bool {
	var pred, curr *node
	key, _ := hashstructure.Hash(item, nil)

	pred = l.head
	curr = pred.next

	for curr.key < key {
		pred = curr
		curr = curr.next

pacuna

func (l *list) Remove(item []byte) bool {
	var pred, curr *node
	key, _ := hashstructure.Hash(item, nil)

	pred = l.head
	curr = pred.next

	for curr.key < key {
		pred = curr
		curr = curr.next

pacuna

func (l *list) Contains(item []byte) bool {
	var pred, curr *node
	key, _ := hashstructure.Hash(item, nil)

	pred = l.head
	curr = pred.next

	for curr.key < key {
		pred = curr
		curr = curr.next

pacuna

package main

import (
	"fmt"
	"sortedlist/simplelist"
	"sync"
)

func main() {
	l := simplelist.New()

pacuna

package simplelist

import "testing"

func Test_List(t *testing.T) {
	l := New()
	l.Add([]byte("item1"))
	l.Add([]byte("item2"))

	if l.Size() != 2 {

pacuna

package set

type Set interface {
	Add(item []byte) bool
	Remove(item []byte) bool
	Contains(item []byte) bool
}

pacuna

package set

type Set interface {
	Add(item []byte) bool
	Remove(item []byte) bool
	Contains(item []byte) bool
}