@mikuroxina/mini-fn
    Preparing search index...

    Namespace BTree

    This module provides an implementation of B-tree with the parameter B to 6.

    Methods here can be categorized to map methods and set methods.

    • Construct
      • newMap
      • fromIterable
    • Query
      • isEmpty
      • get
      • containsKey
      • len
      • toIterator
      • toRevIterator
      • toKeys
      • toValues
      • firstKeyValue
      • lastKeyValue
      • range
    • Insert
      • insert
    • Delete
      • remove
      • popFirstKeyValue
      • popLastKeyValue
    • Fold
      • reduceR
      • reduceL
    • Construct
      • newSet
      • setFromIterable
    • Query
      • setToIterator
      • setToRevIterator
      • has
      • first
      • last
      • isDisjoint
      • isSuperset
    • Insert
      • push
    • Delete
      • pop
      • popFirst
      • popLast
    • Set operate
      • union
      • `symmetricDifferenceP
      • difference
      • intersection
    • Fold
      • setReduceR
      • setReduceL

    Also most of map methods can be applied to Set<T>.

    Interfaces

    MapHkt
    SetHkt

    Type Aliases

    Map
    Set

    Variables

    newMap
    newSet
    setReduce

    Functions

    containsKey
    difference
    first
    firstKeyValue
    fromIterable
    get
    has
    insert
    intersection
    isDisjoint
    isEmpty
    isSubset
    isSuperset
    last
    lastKeyValue
    len
    pop
    popFirst
    popFirstKeyValue
    popLast
    popLastKeyValue
    push
    range
    reduce
    reduceL
    reduceR
    remove
    setFromIterable
    setReduceL
    setReduceR
    setToIterator
    setToRevIterator
    symmetricDifference
    toIterator
    toKeys
    toRevIterator
    toValues
    union
    unionMonoid