skipset

package
v1.2.12 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Mar 2, 2024 License: Apache-2.0 Imports: 5 Imported by: 0

README

Introduction

skipset is a high-performance concurrent set based on skip list. In typical pattern(100000 operations, 90%CONTAINS 9%ADD 1%REMOVE), the skipset up to 3x ~ 15x faster than the built-in sync.Map.

The main idea behind the skipset is A Simple Optimistic Skiplist Algorithm.

Different from the sync.Map, the items in the skipset are always sorted, and the Contains and Range operations are wait-free (A goroutine is guaranteed to complete an operation as long as it keeps taking steps, regardless of the activity of other goroutines).

Features

  • Concurrent safe API with high-performance.
  • Wait-free Contains and Range operations.
  • Sorted items.

When should you use skipset

In these situations, skipset is better

  • Sorted elements is needed.
  • Concurrent calls multiple operations. such as use both Contains and Add at the same time.
  • Memory intensive. The skipset save at least 50% memory in the benchmark.

In these situations, sync.Map is better

  • Only one goroutine access the set for most of the time, such as insert a batch of elements and then use only Contains (use built-in map is even better).

QuickStart

package main

import (
	"fmt"

	"github.com/songzhibin97/gkit/structure/skipset"
)

func main() {
	l := NewInt()

	for _, v := range []int{10, 12, 15} {
		if l.Add(v) {
			fmt.Println("skipset add", v)
		}
	}

	if l.Contains(10) {
		fmt.Println("skipset contains 10")
	}

	l.Range(func(value int) bool {
		fmt.Println("skipset range found ", value)
		return true
	})

	l.Remove(15)
	fmt.Printf("skipset contains %d items\r\n", l.Len())
}

Benchmark

Go version: go1.16.2 linux/amd64

CPU: AMD 3700x(8C16T), running at 3.6GHz

OS: ubuntu 18.04

MEMORY: 16G x 2 (3200MHz)

benchmark

$ go test -run=NOTEST -bench=. -benchtime=100000x -benchmem -count=20 -timeout=60m  > x.txt
$ benchstat x.txt

name                                              time/op
Int64/Add/skipset-16                              86.6ns ±11%
Int64/Add/sync.Map-16                              674ns ± 6%
Int64/Contains50Hits/skipset-16                   9.85ns ±12%
Int64/Contains50Hits/sync.Map-16                  14.7ns ±30%
Int64/30Add70Contains/skipset-16                  38.8ns ±18%
Int64/30Add70Contains/sync.Map-16                  586ns ± 5%
Int64/1Remove9Add90Contains/skipset-16            24.9ns ±17%
Int64/1Remove9Add90Contains/sync.Map-16            493ns ± 5%
Int64/1Range9Remove90Add900Contains/skipset-16    25.9ns ±16%
Int64/1Range9Remove90Add900Contains/sync.Map-16   1.00µs ±12%
String/Add/skipset-16                              130ns ±14%
String/Add/sync.Map-16                             878ns ± 4%
String/Contains50Hits/skipset-16                  18.3ns ± 9%
String/Contains50Hits/sync.Map-16                 19.2ns ±18%
String/30Add70Contains/skipset-16                 61.0ns ±15%
String/30Add70Contains/sync.Map-16                 756ns ± 7%
String/1Remove9Add90Contains/skipset-16           31.3ns ±13%
String/1Remove9Add90Contains/sync.Map-16           614ns ± 6%
String/1Range9Remove90Add900Contains/skipset-16   36.2ns ±18%
String/1Range9Remove90Add900Contains/sync.Map-16  1.20µs ±17%

name                                              alloc/op
Int64/Add/skipset-16                               65.0B ± 0%
Int64/Add/sync.Map-16                               128B ± 1%
Int64/Contains50Hits/skipset-16                    0.00B     
Int64/Contains50Hits/sync.Map-16                   0.00B     
Int64/30Add70Contains/skipset-16                   19.0B ± 0%
Int64/30Add70Contains/sync.Map-16                  77.7B ±16%
Int64/1Remove9Add90Contains/skipset-16             5.00B ± 0%
Int64/1Remove9Add90Contains/sync.Map-16            57.5B ± 4%
Int64/1Range9Remove90Add900Contains/skipset-16     5.00B ± 0%
Int64/1Range9Remove90Add900Contains/sync.Map-16     255B ±22%
String/Add/skipset-16                              97.0B ± 0%
String/Add/sync.Map-16                              152B ± 0%
String/Contains50Hits/skipset-16                   15.0B ± 0%
String/Contains50Hits/sync.Map-16                  15.0B ± 0%
String/30Add70Contains/skipset-16                  40.0B ± 0%
String/30Add70Contains/sync.Map-16                 98.2B ±11%
String/1Remove9Add90Contains/skipset-16            23.0B ± 0%
String/1Remove9Add90Contains/sync.Map-16           73.9B ± 4%
String/1Range9Remove90Add900Contains/skipset-16    23.0B ± 0%
String/1Range9Remove90Add900Contains/sync.Map-16    261B ±18%

name                                              allocs/op
Int64/Add/skipset-16                                1.00 ± 0%
Int64/Add/sync.Map-16                               4.00 ± 0%
Int64/Contains50Hits/skipset-16                     0.00     
Int64/Contains50Hits/sync.Map-16                    0.00     
Int64/30Add70Contains/skipset-16                    0.00     
Int64/30Add70Contains/sync.Map-16                   1.00 ± 0%
Int64/1Remove9Add90Contains/skipset-16              0.00     
Int64/1Remove9Add90Contains/sync.Map-16             0.00     
Int64/1Range9Remove90Add900Contains/skipset-16      0.00     
Int64/1Range9Remove90Add900Contains/sync.Map-16     0.00     
String/Add/skipset-16                               2.00 ± 0%
String/Add/sync.Map-16                              5.00 ± 0%
String/Contains50Hits/skipset-16                    1.00 ± 0%
String/Contains50Hits/sync.Map-16                   1.00 ± 0%
String/30Add70Contains/skipset-16                   1.00 ± 0%
String/30Add70Contains/sync.Map-16                  2.00 ± 0%
String/1Remove9Add90Contains/skipset-16             1.00 ± 0%
String/1Remove9Add90Contains/sync.Map-16            1.00 ± 0%
String/1Range9Remove90Add900Contains/skipset-16     1.00 ± 0%
String/1Range9Remove90Add900Contains/sync.Map-16    1.00 ± 0%

Documentation

Overview

Package skipset is a high-performance, scalable, concurrent-safe set based on skip-list. In the typical pattern(100000 operations, 90%CONTAINS 9%Add 1%Remove, 8C16T), the skipset up to 15x faster than the built-in sync.Map.

Code generated by go run types_gen.go; DO NOT EDIT.

Example 
l := NewInt()

for _, v := range []int{10, 12, 15} {
	if l.Add(v) {
		fmt.Println("skipset add", v)
	}
}

if l.Contains(10) {
	fmt.Println("skipset contains 10")
}

l.Range(func(value int) bool {
	fmt.Println("skipset range found ", value)
	return true
})

l.Remove(15)
fmt.Printf("skipset contains %d items\r\n", l.Len())

Output:

Index

Examples

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type ByteSet added in v1.2.6 

type ByteSet struct {
	// contains filtered or unexported fields
}

ByteSet represents a set based on skip list in ascending order.

func NewByte added in v1.2.6 

func NewByte() *ByteSet

NewByte return an empty byte skip set in ascending order.

func (*ByteSet) Add added in v1.2.6 

func (s *ByteSet) Add(value byte) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*ByteSet) Contains added in v1.2.6 

func (s *ByteSet) Contains(value byte) bool

Contains check if the value is in the skip set.

func (*ByteSet) Len added in v1.2.6 

func (s *ByteSet) Len() int

Len return the length of this skip set.

func (*ByteSet) Range added in v1.2.6 

func (s *ByteSet) Range(f func(value byte) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*ByteSet) Remove added in v1.2.6 

func (s *ByteSet) Remove(value byte) bool

Remove a node from the skip set.

type ByteSetDesc added in v1.2.6 

type ByteSetDesc struct {
	// contains filtered or unexported fields
}

ByteSetDesc represents a set based on skip list in descending order.

func NewByteDesc added in v1.2.6 

func NewByteDesc() *ByteSetDesc

NewByteDesc return an empty byte skip set in descending order.

func (*ByteSetDesc) Add added in v1.2.6 

func (s *ByteSetDesc) Add(value byte) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*ByteSetDesc) Contains added in v1.2.6 

func (s *ByteSetDesc) Contains(value byte) bool

Contains check if the value is in the skip set.

func (*ByteSetDesc) Len added in v1.2.6 

func (s *ByteSetDesc) Len() int

Len return the length of this skip set.

func (*ByteSetDesc) Range added in v1.2.6 

func (s *ByteSetDesc) Range(f func(value byte) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*ByteSetDesc) Remove added in v1.2.6 

func (s *ByteSetDesc) Remove(value byte) bool

Remove a node from the skip set.

type Float32Set 

type Float32Set struct {
	// contains filtered or unexported fields
}

Float32Set represents a set based on skip list in ascending order.

func NewFloat32 

func NewFloat32() *Float32Set

NewFloat32 return an empty float32 skip set in ascending order.

func (*Float32Set) Add 

func (s *Float32Set) Add(value float32) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Float32Set) Contains 

func (s *Float32Set) Contains(value float32) bool

Contains check if the value is in the skip set.

func (*Float32Set) Len 

func (s *Float32Set) Len() int

Len return the length of this skip set.

func (*Float32Set) Range 

func (s *Float32Set) Range(f func(value float32) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Float32Set) Remove 

func (s *Float32Set) Remove(value float32) bool

Remove a node from the skip set.

type Float32SetDesc 

type Float32SetDesc struct {
	// contains filtered or unexported fields
}

Float32SetDesc represents a set based on skip list in descending order.

func NewFloat32Desc 

func NewFloat32Desc() *Float32SetDesc

NewFloat32Desc return an empty float32 skip set in descending order.

func (*Float32SetDesc) Add 

func (s *Float32SetDesc) Add(value float32) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Float32SetDesc) Contains 

func (s *Float32SetDesc) Contains(value float32) bool

Contains check if the value is in the skip set.

func (*Float32SetDesc) Len 

func (s *Float32SetDesc) Len() int

Len return the length of this skip set.

func (*Float32SetDesc) Range 

func (s *Float32SetDesc) Range(f func(value float32) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Float32SetDesc) Remove 

func (s *Float32SetDesc) Remove(value float32) bool

Remove a node from the skip set.

type Float64Set 

type Float64Set struct {
	// contains filtered or unexported fields
}

Float64Set represents a set based on skip list in ascending order.

func NewFloat64 

func NewFloat64() *Float64Set

NewFloat64 return an empty float64 skip set in ascending order.

func (*Float64Set) Add 

func (s *Float64Set) Add(value float64) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Float64Set) Contains 

func (s *Float64Set) Contains(value float64) bool

Contains check if the value is in the skip set.

func (*Float64Set) Len 

func (s *Float64Set) Len() int

Len return the length of this skip set.

func (*Float64Set) Range 

func (s *Float64Set) Range(f func(value float64) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Float64Set) Remove 

func (s *Float64Set) Remove(value float64) bool

Remove a node from the skip set.

type Float64SetDesc 

type Float64SetDesc struct {
	// contains filtered or unexported fields
}

Float64SetDesc represents a set based on skip list in descending order.

func NewFloat64Desc 

func NewFloat64Desc() *Float64SetDesc

NewFloat64Desc return an empty float64 skip set in descending order.

func (*Float64SetDesc) Add 

func (s *Float64SetDesc) Add(value float64) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Float64SetDesc) Contains 

func (s *Float64SetDesc) Contains(value float64) bool

Contains check if the value is in the skip set.

func (*Float64SetDesc) Len 

func (s *Float64SetDesc) Len() int

Len return the length of this skip set.

func (*Float64SetDesc) Range 

func (s *Float64SetDesc) Range(f func(value float64) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Float64SetDesc) Remove 

func (s *Float64SetDesc) Remove(value float64) bool

Remove a node from the skip set.

type Int16Set 

type Int16Set struct {
	// contains filtered or unexported fields
}

Int16Set represents a set based on skip list in ascending order.

func NewInt16 

func NewInt16() *Int16Set

NewInt16 return an empty int16 skip set in ascending order.

func (*Int16Set) Add 

func (s *Int16Set) Add(value int16) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Int16Set) Contains 

func (s *Int16Set) Contains(value int16) bool

Contains check if the value is in the skip set.

func (*Int16Set) Len 

func (s *Int16Set) Len() int

Len return the length of this skip set.

func (*Int16Set) Range 

func (s *Int16Set) Range(f func(value int16) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Int16Set) Remove 

func (s *Int16Set) Remove(value int16) bool

Remove a node from the skip set.

type Int16SetDesc 

type Int16SetDesc struct {
	// contains filtered or unexported fields
}

Int16SetDesc represents a set based on skip list in descending order.

func NewInt16Desc 

func NewInt16Desc() *Int16SetDesc

NewInt16Desc return an empty int16 skip set in descending order.

func (*Int16SetDesc) Add 

func (s *Int16SetDesc) Add(value int16) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Int16SetDesc) Contains 

func (s *Int16SetDesc) Contains(value int16) bool

Contains check if the value is in the skip set.

func (*Int16SetDesc) Len 

func (s *Int16SetDesc) Len() int

Len return the length of this skip set.

func (*Int16SetDesc) Range 

func (s *Int16SetDesc) Range(f func(value int16) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Int16SetDesc) Remove 

func (s *Int16SetDesc) Remove(value int16) bool

Remove a node from the skip set.

type Int32Set 

type Int32Set struct {
	// contains filtered or unexported fields
}

Int32Set represents a set based on skip list in ascending order.

func NewInt32 

func NewInt32() *Int32Set

NewInt32 return an empty int32 skip set in ascending order.

func (*Int32Set) Add 

func (s *Int32Set) Add(value int32) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Int32Set) Contains 

func (s *Int32Set) Contains(value int32) bool

Contains check if the value is in the skip set.

func (*Int32Set) Len 

func (s *Int32Set) Len() int

Len return the length of this skip set.

func (*Int32Set) Range 

func (s *Int32Set) Range(f func(value int32) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Int32Set) Remove 

func (s *Int32Set) Remove(value int32) bool

Remove a node from the skip set.

type Int32SetDesc 

type Int32SetDesc struct {
	// contains filtered or unexported fields
}

Int32SetDesc represents a set based on skip list in descending order.

func NewInt32Desc 

func NewInt32Desc() *Int32SetDesc

NewInt32Desc return an empty int32 skip set in descending order.

func (*Int32SetDesc) Add 

func (s *Int32SetDesc) Add(value int32) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Int32SetDesc) Contains 

func (s *Int32SetDesc) Contains(value int32) bool

Contains check if the value is in the skip set.

func (*Int32SetDesc) Len 

func (s *Int32SetDesc) Len() int

Len return the length of this skip set.

func (*Int32SetDesc) Range 

func (s *Int32SetDesc) Range(f func(value int32) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Int32SetDesc) Remove 

func (s *Int32SetDesc) Remove(value int32) bool

Remove a node from the skip set.

type Int64Set 

type Int64Set struct {
	// contains filtered or unexported fields
}

Int64Set represents a set based on skip list in ascending order.

func NewInt64 

func NewInt64() *Int64Set

NewInt64 return an empty int64 skip set in ascending order.

func (*Int64Set) Add 

func (s *Int64Set) Add(value int64) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Int64Set) Contains 

func (s *Int64Set) Contains(value int64) bool

Contains check if the value is in the skip set.

func (*Int64Set) Len 

func (s *Int64Set) Len() int

Len return the length of this skip set.

func (*Int64Set) Range 

func (s *Int64Set) Range(f func(value int64) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Int64Set) Remove 

func (s *Int64Set) Remove(value int64) bool

Remove a node from the skip set.

type Int8Set added in v1.2.6 

type Int8Set struct {
	// contains filtered or unexported fields
}

Int8Set represents a set based on skip list in ascending order.

func NewInt8 added in v1.2.6 

func NewInt8() *Int8Set

NewInt8 return an empty int8 skip set in ascending order.

func (*Int8Set) Add added in v1.2.6 

func (s *Int8Set) Add(value int8) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Int8Set) Contains added in v1.2.6 

func (s *Int8Set) Contains(value int8) bool

Contains check if the value is in the skip set.

func (*Int8Set) Len added in v1.2.6 

func (s *Int8Set) Len() int

Len return the length of this skip set.

func (*Int8Set) Range added in v1.2.6 

func (s *Int8Set) Range(f func(value int8) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Int8Set) Remove added in v1.2.6 

func (s *Int8Set) Remove(value int8) bool

Remove a node from the skip set.

type Int8SetDesc added in v1.2.6 

type Int8SetDesc struct {
	// contains filtered or unexported fields
}

Int8SetDesc represents a set based on skip list in descending order.

func NewInt8Desc added in v1.2.6 

func NewInt8Desc() *Int8SetDesc

NewInt8Desc return an empty int8 skip set in descending order.

func (*Int8SetDesc) Add added in v1.2.6 

func (s *Int8SetDesc) Add(value int8) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Int8SetDesc) Contains added in v1.2.6 

func (s *Int8SetDesc) Contains(value int8) bool

Contains check if the value is in the skip set.

func (*Int8SetDesc) Len added in v1.2.6 

func (s *Int8SetDesc) Len() int

Len return the length of this skip set.

func (*Int8SetDesc) Range added in v1.2.6 

func (s *Int8SetDesc) Range(f func(value int8) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Int8SetDesc) Remove added in v1.2.6 

func (s *Int8SetDesc) Remove(value int8) bool

Remove a node from the skip set.

type IntSet 

type IntSet struct {
	// contains filtered or unexported fields
}

IntSet represents a set based on skip list in ascending order.

func NewInt 

func NewInt() *IntSet

NewInt return an empty int skip set in ascending order.

func (*IntSet) Add 

func (s *IntSet) Add(value int) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*IntSet) Contains 

func (s *IntSet) Contains(value int) bool

Contains check if the value is in the skip set.

func (*IntSet) Len 

func (s *IntSet) Len() int

Len return the length of this skip set.

func (*IntSet) Range 

func (s *IntSet) Range(f func(value int) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*IntSet) Remove 

func (s *IntSet) Remove(value int) bool

Remove a node from the skip set.

type IntSetDesc 

type IntSetDesc struct {
	// contains filtered or unexported fields
}

IntSetDesc represents a set based on skip list in descending order.

func NewIntDesc 

func NewIntDesc() *IntSetDesc

NewIntDesc return an empty int skip set in descending order.

func (*IntSetDesc) Add 

func (s *IntSetDesc) Add(value int) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*IntSetDesc) Contains 

func (s *IntSetDesc) Contains(value int) bool

Contains check if the value is in the skip set.

func (*IntSetDesc) Len 

func (s *IntSetDesc) Len() int

Len return the length of this skip set.

func (*IntSetDesc) Range 

func (s *IntSetDesc) Range(f func(value int) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*IntSetDesc) Remove 

func (s *IntSetDesc) Remove(value int) bool

Remove a node from the skip set.

type RuneSet added in v1.2.6 

type RuneSet struct {
	// contains filtered or unexported fields
}

RuneSet represents a set based on skip list in ascending order.

func NewRune added in v1.2.6 

func NewRune() *RuneSet

NewRune return an empty rune skip set in ascending order.

func (*RuneSet) Add added in v1.2.6 

func (s *RuneSet) Add(value rune) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*RuneSet) Contains added in v1.2.6 

func (s *RuneSet) Contains(value rune) bool

Contains check if the value is in the skip set.

func (*RuneSet) Len added in v1.2.6 

func (s *RuneSet) Len() int

Len return the length of this skip set.

func (*RuneSet) Range added in v1.2.6 

func (s *RuneSet) Range(f func(value rune) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*RuneSet) Remove added in v1.2.6 

func (s *RuneSet) Remove(value rune) bool

Remove a node from the skip set.

type RuneSetDesc added in v1.2.6 

type RuneSetDesc struct {
	// contains filtered or unexported fields
}

RuneSetDesc represents a set based on skip list in descending order.

func NewRuneDesc added in v1.2.6 

func NewRuneDesc() *RuneSetDesc

NewRuneDesc return an empty rune skip set in descending order.

func (*RuneSetDesc) Add added in v1.2.6 

func (s *RuneSetDesc) Add(value rune) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*RuneSetDesc) Contains added in v1.2.6 

func (s *RuneSetDesc) Contains(value rune) bool

Contains check if the value is in the skip set.

func (*RuneSetDesc) Len added in v1.2.6 

func (s *RuneSetDesc) Len() int

Len return the length of this skip set.

func (*RuneSetDesc) Range added in v1.2.6 

func (s *RuneSetDesc) Range(f func(value rune) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*RuneSetDesc) Remove added in v1.2.6 

func (s *RuneSetDesc) Remove(value rune) bool

Remove a node from the skip set.

type StringSet 

type StringSet struct {
	// contains filtered or unexported fields
}

StringSet represents a set based on skip list.

func NewString 

func NewString() *StringSet

NewString return an empty string skip set.

func (*StringSet) Add 

func (s *StringSet) Add(value string) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*StringSet) Contains 

func (s *StringSet) Contains(value string) bool

Contains check if the value is in the skip set.

func (*StringSet) Len 

func (s *StringSet) Len() int

Len return the length of this skip set.

func (*StringSet) Range 

func (s *StringSet) Range(f func(value string) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*StringSet) Remove 

func (s *StringSet) Remove(value string) bool

Remove a node from the skip set.

type Uint16Set 

type Uint16Set struct {
	// contains filtered or unexported fields
}

Uint16Set represents a set based on skip list in ascending order.

func NewUint16 

func NewUint16() *Uint16Set

NewUint16 return an empty uint16 skip set in ascending order.

func (*Uint16Set) Add 

func (s *Uint16Set) Add(value uint16) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Uint16Set) Contains 

func (s *Uint16Set) Contains(value uint16) bool

Contains check if the value is in the skip set.

func (*Uint16Set) Len 

func (s *Uint16Set) Len() int

Len return the length of this skip set.

func (*Uint16Set) Range 

func (s *Uint16Set) Range(f func(value uint16) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Uint16Set) Remove 

func (s *Uint16Set) Remove(value uint16) bool

Remove a node from the skip set.

type Uint16SetDesc 

type Uint16SetDesc struct {
	// contains filtered or unexported fields
}

Uint16SetDesc represents a set based on skip list in descending order.

func NewUint16Desc 

func NewUint16Desc() *Uint16SetDesc

NewUint16Desc return an empty uint16 skip set in descending order.

func (*Uint16SetDesc) Add 

func (s *Uint16SetDesc) Add(value uint16) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Uint16SetDesc) Contains 

func (s *Uint16SetDesc) Contains(value uint16) bool

Contains check if the value is in the skip set.

func (*Uint16SetDesc) Len 

func (s *Uint16SetDesc) Len() int

Len return the length of this skip set.

func (*Uint16SetDesc) Range 

func (s *Uint16SetDesc) Range(f func(value uint16) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Uint16SetDesc) Remove 

func (s *Uint16SetDesc) Remove(value uint16) bool

Remove a node from the skip set.

type Uint32Set 

type Uint32Set struct {
	// contains filtered or unexported fields
}

Uint32Set represents a set based on skip list in ascending order.

func NewUint32 

func NewUint32() *Uint32Set

NewUint32 return an empty uint32 skip set in ascending order.

func (*Uint32Set) Add 

func (s *Uint32Set) Add(value uint32) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Uint32Set) Contains 

func (s *Uint32Set) Contains(value uint32) bool

Contains check if the value is in the skip set.

func (*Uint32Set) Len 

func (s *Uint32Set) Len() int

Len return the length of this skip set.

func (*Uint32Set) Range 

func (s *Uint32Set) Range(f func(value uint32) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Uint32Set) Remove 

func (s *Uint32Set) Remove(value uint32) bool

Remove a node from the skip set.

type Uint32SetDesc 

type Uint32SetDesc struct {
	// contains filtered or unexported fields
}

Uint32SetDesc represents a set based on skip list in descending order.

func NewUint32Desc 

func NewUint32Desc() *Uint32SetDesc

NewUint32Desc return an empty uint32 skip set in descending order.

func (*Uint32SetDesc) Add 

func (s *Uint32SetDesc) Add(value uint32) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Uint32SetDesc) Contains 

func (s *Uint32SetDesc) Contains(value uint32) bool

Contains check if the value is in the skip set.

func (*Uint32SetDesc) Len 

func (s *Uint32SetDesc) Len() int

Len return the length of this skip set.

func (*Uint32SetDesc) Range 

func (s *Uint32SetDesc) Range(f func(value uint32) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Uint32SetDesc) Remove 

func (s *Uint32SetDesc) Remove(value uint32) bool

Remove a node from the skip set.

type Uint64Set 

type Uint64Set struct {
	// contains filtered or unexported fields
}

Uint64Set represents a set based on skip list in ascending order.

func NewUint64 

func NewUint64() *Uint64Set

NewUint64 return an empty uint64 skip set in ascending order.

func (*Uint64Set) Add 

func (s *Uint64Set) Add(value uint64) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Uint64Set) Contains 

func (s *Uint64Set) Contains(value uint64) bool

Contains check if the value is in the skip set.

func (*Uint64Set) Len 

func (s *Uint64Set) Len() int

Len return the length of this skip set.

func (*Uint64Set) Range 

func (s *Uint64Set) Range(f func(value uint64) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Uint64Set) Remove 

func (s *Uint64Set) Remove(value uint64) bool

Remove a node from the skip set.

type Uint64SetDesc 

type Uint64SetDesc struct {
	// contains filtered or unexported fields
}

Uint64SetDesc represents a set based on skip list in descending order.

func NewUint64Desc 

func NewUint64Desc() *Uint64SetDesc

NewUint64Desc return an empty uint64 skip set in descending order.

func (*Uint64SetDesc) Add 

func (s *Uint64SetDesc) Add(value uint64) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Uint64SetDesc) Contains 

func (s *Uint64SetDesc) Contains(value uint64) bool

Contains check if the value is in the skip set.

func (*Uint64SetDesc) Len 

func (s *Uint64SetDesc) Len() int

Len return the length of this skip set.

func (*Uint64SetDesc) Range 

func (s *Uint64SetDesc) Range(f func(value uint64) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Uint64SetDesc) Remove 

func (s *Uint64SetDesc) Remove(value uint64) bool

Remove a node from the skip set.

type Uint8Set added in v1.2.6 

type Uint8Set struct {
	// contains filtered or unexported fields
}

Uint8Set represents a set based on skip list in ascending order.

func NewUint8 added in v1.2.6 

func NewUint8() *Uint8Set

NewUint8 return an empty uint8 skip set in ascending order.

func (*Uint8Set) Add added in v1.2.6 

func (s *Uint8Set) Add(value uint8) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Uint8Set) Contains added in v1.2.6 

func (s *Uint8Set) Contains(value uint8) bool

Contains check if the value is in the skip set.

func (*Uint8Set) Len added in v1.2.6 

func (s *Uint8Set) Len() int

Len return the length of this skip set.

func (*Uint8Set) Range added in v1.2.6 

func (s *Uint8Set) Range(f func(value uint8) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Uint8Set) Remove added in v1.2.6 

func (s *Uint8Set) Remove(value uint8) bool

Remove a node from the skip set.

type Uint8SetDesc added in v1.2.6 

type Uint8SetDesc struct {
	// contains filtered or unexported fields
}

Uint8SetDesc represents a set based on skip list in descending order.

func NewUint8Desc added in v1.2.6 

func NewUint8Desc() *Uint8SetDesc

NewUint8Desc return an empty uint8 skip set in descending order.

func (*Uint8SetDesc) Add added in v1.2.6 

func (s *Uint8SetDesc) Add(value uint8) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*Uint8SetDesc) Contains added in v1.2.6 

func (s *Uint8SetDesc) Contains(value uint8) bool

Contains check if the value is in the skip set.

func (*Uint8SetDesc) Len added in v1.2.6 

func (s *Uint8SetDesc) Len() int

Len return the length of this skip set.

func (*Uint8SetDesc) Range added in v1.2.6 

func (s *Uint8SetDesc) Range(f func(value uint8) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*Uint8SetDesc) Remove added in v1.2.6 

func (s *Uint8SetDesc) Remove(value uint8) bool

Remove a node from the skip set.

type UintSet 

type UintSet struct {
	// contains filtered or unexported fields
}

UintSet represents a set based on skip list in ascending order.

func NewUint 

func NewUint() *UintSet

NewUint return an empty uint skip set in ascending order.

func (*UintSet) Add 

func (s *UintSet) Add(value uint) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*UintSet) Contains 

func (s *UintSet) Contains(value uint) bool

Contains check if the value is in the skip set.

func (*UintSet) Len 

func (s *UintSet) Len() int

Len return the length of this skip set.

func (*UintSet) Range 

func (s *UintSet) Range(f func(value uint) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*UintSet) Remove 

func (s *UintSet) Remove(value uint) bool

Remove a node from the skip set.

type UintSetDesc 

type UintSetDesc struct {
	// contains filtered or unexported fields
}

UintSetDesc represents a set based on skip list in descending order.

func NewUintDesc 

func NewUintDesc() *UintSetDesc

NewUintDesc return an empty uint skip set in descending order.

func (*UintSetDesc) Add 

func (s *UintSetDesc) Add(value uint) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*UintSetDesc) Contains 

func (s *UintSetDesc) Contains(value uint) bool

Contains check if the value is in the skip set.

func (*UintSetDesc) Len 

func (s *UintSetDesc) Len() int

Len return the length of this skip set.

func (*UintSetDesc) Range 

func (s *UintSetDesc) Range(f func(value uint) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*UintSetDesc) Remove 

func (s *UintSetDesc) Remove(value uint) bool

Remove a node from the skip set.

type UintptrSet added in v1.2.6 

type UintptrSet struct {
	// contains filtered or unexported fields
}

UintptrSet represents a set based on skip list in ascending order.

func NewUintptr added in v1.2.6 

func NewUintptr() *UintptrSet

NewUintptr return an empty uintptr skip set in ascending order.

func (*UintptrSet) Add added in v1.2.6 

func (s *UintptrSet) Add(value uintptr) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*UintptrSet) Contains added in v1.2.6 

func (s *UintptrSet) Contains(value uintptr) bool

Contains check if the value is in the skip set.

func (*UintptrSet) Len added in v1.2.6 

func (s *UintptrSet) Len() int

Len return the length of this skip set.

func (*UintptrSet) Range added in v1.2.6 

func (s *UintptrSet) Range(f func(value uintptr) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*UintptrSet) Remove added in v1.2.6 

func (s *UintptrSet) Remove(value uintptr) bool

Remove a node from the skip set.

type UintptrSetDesc added in v1.2.6 

type UintptrSetDesc struct {
	// contains filtered or unexported fields
}

UintptrSetDesc represents a set based on skip list in descending order.

func NewUintptrDesc added in v1.2.6 

func NewUintptrDesc() *UintptrSetDesc

NewUintptrDesc return an empty uintptr skip set in descending order.

func (*UintptrSetDesc) Add added in v1.2.6 

func (s *UintptrSetDesc) Add(value uintptr) bool

Add add the value into skip set, return true if this process insert the value into skip set, return false if this process can't insert this value, because another process has insert the same value.

If the value is in the skip set but not fully linked, this process will wait until it is.

func (*UintptrSetDesc) Contains added in v1.2.6 

func (s *UintptrSetDesc) Contains(value uintptr) bool

Contains check if the value is in the skip set.

func (*UintptrSetDesc) Len added in v1.2.6 

func (s *UintptrSetDesc) Len() int

Len return the length of this skip set.

func (*UintptrSetDesc) Range added in v1.2.6 

func (s *UintptrSetDesc) Range(f func(value uintptr) bool)

Range calls f sequentially for each value present in the skip set. If f returns false, range stops the iteration.

func (*UintptrSetDesc) Remove added in v1.2.6 

func (s *UintptrSetDesc) Remove(value uintptr) bool

Remove a node from the skip set.

Source Files

View all Source files

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.