moonbitstack/moonstl/spec

README
U
AhoCorasick
U
ArcCache
U
ArenaTree
U
BiMap
U
BitSet
U
BitVec
U
BloomFilter
U
BloomOptions
U
BoyerMoore
U
CacheStats
U
ChainMap
U
Combinations
U
CombinationsWithReplacement
U
CountMinSketch
U
Counter
U
CuckooFilter
U
CuckooOptions
U
DaryHeap
U
DefaultMap
U
DenseSlotMap
U
DisjointSet
U
DisjointSetMap
U
ExpiringCache
U
Fenwick
U
FibonacciHeap
U
FlatMap
U
FlatMultiMap
U
FlatMultiSet
U
FlatSet
U
GapBuffer
U
GrayCode
U
Growth
U
HeapKey
U
HyperLogLog
U
IndexHeap
U
IndexMap
U
IndexSet
U
IntervalKey
U
IntervalTree
U
JoinEntry
U
Kmp
U
LazySegmentTree
U
LfuCache
U
LinkedList
U
LruCache
U
Match
U
MinMaxHeap
U
MultiMap
U
MultiSet
U
Opcode
U
Order
U
OrderStatisticTree
U
Overflow
U
Overlap
U
PairingHeap
U
Permutations
U
PhfBuild
U
PhfBuilder
U
PhfLayout
U
PhfMap
U
PhfOptions
U
PhfOrderedMap
U
PhfOrderedSet
U
PhfSet
U
Position
U
Powerset
U
Product
U
RadixHeap
U
RadixTree
U
RangeMap
U
RangeSet
U
Refused
U
RingBuffer
U
Rope
U
RopeBuilder
U
RopeView
U
SecondaryMap
U
SegmentTree
U
SequenceMatcher
U
SequenceMatcherOptions
U
SkipList
U
SkipListOptions
U
Slab
U
SlotKey
U
SlotMap
U
SortedMultiMap
U
SortedMultiSet
U
SparseSet
U
SuffixArray
U
SuffixAutomaton
U
TDigest
U
ThetaSketch
U
Treap
U
TreeId
U
Trie

moonbitstack/moonstl/spec does not have a README file

Refused

pub(all) suberror Refused {
  Capacity(got~ : Int)
  Probability(got~ : Double)
  Arity(got~ : Int)
  Precision(got~ : Int)
  DuplicateValue
  NonMonotone(got~ : UInt64, limit~ : UInt64)
  TooMany(limit~ : Int)
  Incompatible
  Overlap
} derive(Eq, @moonbitlang/core/debug.Debug
Debug)

The only error this module raises. Input that cannot be used — a capacity that cannot hold the data, a rate outside its range, an arity that is not a tree — is refused here; a lookup that simply finds nothing returns None instead, and an out-of-range index aborts as Array does.

impl Show for Refused

Refused::equal

source

fn Refused::equal(Refused, Refused) -> Bool

Refused::not_equal

source

fn Refused::not_equal(x : Refused, y : Refused) -> Bool

Refused::output

source

fn Refused::output(self : Refused, logger : &Logger) -> Unit

Refused::to_repr

source

fn Refused::to_repr(Refused) -> @moonbitlang/core/debug.Repr
Repr

Refused::to_string

source

fn Refused::to_string(self : Refused) -> String

hash_seed

source

fn hash_seed() -> Int

The process-wide seed every hashed container starts from, drawn once from the platform's entropy on first use. A program that builds no hash table draws nothing.

A per-process seed makes the bucket layout, and with it the iteration order, differ between runs, so a key set chosen to collide in one run does not collide in the next. Pass hash_seed=0, or any fixed value, when a run has to be reproducible.

test {
  let a = @spec.hash_seed()
  let b = @spec.hash_seed()
  @test.assert_eq(a, b)
}

hash_seed_from

source

fn hash_seed_from(bytes : BytesView) -> Int

A seed derived from bytes the caller already holds, which is how a service reproduces the layout of its tables across restarts: pass the same bytes and every container lays out the same way.

test {
  @test.assert_eq(
    @spec.hash_seed_from(b"moonstl"),
    @spec.hash_seed_from(b"moonstl"),
  )
  @test.assert_not_eq(
    @spec.hash_seed_from(b"moonstl"),
    @spec.hash_seed_from(b"moonst"),
  )
}

hash_seed_is_random

source

fn hash_seed_is_random() -> Bool

Whether this platform gave real entropy to hash_seed. false means the platform has no source — a wasm host without WASI — and every hashed container runs from a seed of zero, which is still correct, only predictable.

test {
  let _ = @spec.hash_seed()
  let random = @spec.hash_seed_is_random()
  @test.assert_eq(random, @spec.hash_seed_is_random())
}

Source Files

Install

Download zip

Data structures and algorithms the MoonBit core library leaves out.

data-structuresalgorithmscollectionscontainersstlmoonbitindex-mapindex-setmultimapbimapcounterflat-mapsorted-maprange-maptrieradix-treelru-cachelfu-cachearc-cacheexpiring-cachememoizesortingselectionbisectbinary-searchpermutationscombinationspowersetpartitionmergering-bufferslotmapgap-bufferbit-vectorbit-setlinked-listbinary-heapfibonacci-heappairing-heapmin-max-heapradix-heapdisjoint-setunion-findsegment-treefenwick-treeinterval-treeskip-listtreapbloom-filtercuckoo-filtercount-min-sketchhyperloglogtheta-sketcht-digeststring-searchsuffix-arraysuffix-automatondiffropeperfect-hash

moonbitstack

Apache-2.0