bloeys/nset
1
0
Fork 0
mirror of https://github.com/bloeys/nset.git synced 2025-12-29 06:28:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

Revert cuz golang :) messes up rand add full size

Browse Source
This commit is contained in:
bloeys
2022-06-10 11:22:48 +04:00
parent 82ab26e069
commit 97f19b3f38
1 changed files with 3 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
nset.go
View File

@ -38,13 +38,9 @@ type NSet[T IntsIf] struct {
func (n *NSet[T]) Add(x T) {
//NOTE: The inlines here improve addition times by a good amount (several seconds)
//NOTE: inline of n.GetBucketFromValue(x)
bucket := &n.Buckets[BucketType(x>>n.shiftAmount)]
//NOTE: This is an inline of n.GetStorageUnitIndex(x)
unitIndex := uint32(((x << BucketIndexingBits) >> BucketIndexingBits) / StorageTypeBits)
bucket := n.GetBucketFromValue(x)
unitIndex := n.GetStorageUnitIndex(x)
if unitIndex >= bucket.StorageUnitCount {
storageUnitsToAdd := unitIndex - bucket.StorageUnitCount + 1
@ -54,8 +50,7 @@ func (n *NSet[T]) Add(x T) {
bucket.StorageUnitCount += storageUnitsToAdd
}
//NOTE: Inline of n.GetBitMask(x)
bucket.Data[unitIndex] |= 1 << (((x << BucketIndexingBits) >> BucketIndexingBits) % StorageTypeBits)
bucket.Data[unitIndex] |= n.GetBitMask(x)
}
func (n *NSet[T]) Remove(x T) {