/*
 *     Copyright 2020 The Dragonfly Authors
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package sortedlist

type empty struct{}

type bucket struct {
	count   int
	buckets []map[Item]empty
}

func (b *bucket) Size() int {
	return b.count
}

func (b *bucket) Add(key int, data Item) {
	for key >= len(b.buckets) {
		b.buckets = append(b.buckets, make(map[Item]empty))
	}
	b.buckets[key][data] = empty{}
	b.count++
	return
}

func (b *bucket) Delete(key int, data Item) {
	for key >= len(b.buckets) {
		b.buckets = append(b.buckets, make(map[Item]empty))
	}
	_, ok := b.buckets[key][data]
	if ok {
		delete(b.buckets[key], data)
		b.count--
	}
	return
}