eaU5rn8d.go

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

	l.mu.Lock()
	defer l.mu.Unlock()
	pred = l.head
	curr = pred.next

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

	if key == curr.key {
		return false
	}
	n := newNode(item)
	n.next = curr
	pred.next = n
	l.size++
	return true
}

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

	l.mu.Lock()
	defer l.mu.Unlock()
	pred = l.head
	curr = pred.next

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

	if key == curr.key {
		pred.next = curr.next
		return true
	}
	return false
}

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

	l.mu.Lock()
	defer l.mu.Unlock()
	pred = l.head
	curr = pred.next

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