gwjZHzR6.go

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
	}

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