sortedset

Documentation

Index

• Constants
• type Set
  • func New() Set
  • func (v *Set) Bits(subset Set) uint64
  • func (v Set) Equal(other Set) bool
  • func (v Set) IndexOf(b []byte) (int, bool)
  • func (v *Set) Insert(b []byte) bool
  • func (v Set) Intersect(committeeSet uint64) Set
  • func (v Set) Len() int
  • func (v Set) Less(i, j int) bool
  • func (v *Set) Remove(pubKeyBLS []byte) bool
  • func (v Set) String() string
  • func (v Set) Swap(i, j int)
  • func (v Set) Whole() uint64

Constants

const All uint64 = math.MaxUint64

Types

type Set

type Set []*big.Int

func New

func New() Set

func (*Set) Bits

func (v *Set) Bits(subset Set) uint64

Bits creates a bit representation of the subset of a Set. The subset is passed by value

func (Set) Equal

func (v Set) Equal(other Set) bool

func (Set) IndexOf

func (v Set) IndexOf(b []byte) (int, bool)

func (*Set) Insert

func (v *Set) Insert(b []byte) bool

Insert a big.Int representation of a BLS key at a proper index (respectful of the VotingCommittee order). If the element is already in the VotingCommittee does nothing and returns false

func (Set) Intersect

func (v Set) Intersect(committeeSet uint64) Set

Intersect the bit representation of a VotingCommittee subset with the whole VotingCommittee set

func (Set) Len

func (v Set) Len() int

func (Set) Less

func (v Set) Less(i, j int) bool

func (*Set) Remove

func (v *Set) Remove(pubKeyBLS []byte) bool

Remove an entry from the set. Return false if the entry can't be found

func (Set) String

func (v Set) String() string

func (Set) Swap

func (v Set) Swap(i, j int)

func (Set) Whole

func (v Set) Whole() uint64