Idris2Doc : Data.Fin.Map

Data.Fin.Map

(source)
Specialised map from `Fin`s to any type.
Isomorphic to a vector of appropriate size of maybe's of appropriate type.

This should be a replacement for `SortedMap (Fin n) v` working better at least in elaborator scripts.

Definitions

dataFinMap : Nat->Type->Type
Totality: total
Visibility: export
Constructor: 
MkFM : Vectn (Maybev) ->FinMapnv

Hints:
Eqv=>Eq (FinMapnv)
Foldable (FinMapn)
Functor (FinMapn)
Interpolationv=>Interpolation (Finn) =>Interpolation (FinMapnv)
Semigroupv=>Monoid (FinMapnv)
Semigroupv=>Semigroup (FinMapnv)
Traversable (FinMapn)
Zippable (FinMapn)
empty : FinMapnv
Totality: total
Visibility: export
lookup : Finn->FinMapnv->Maybev
Totality: total
Visibility: export
lookup' : FinMapnv->Finn->Maybev
Totality: total
Visibility: export
insert : Finn->v->FinMapnv->FinMapnv
Totality: total
Visibility: export
insertWith : (v->v->v) ->Finn->v->FinMapnv->FinMapnv
Totality: total
Visibility: export
insert' : FinMapnv-> (Finn, v) ->FinMapnv
Totality: total
Visibility: public export
singleton : Finn->v->FinMapnv
Totality: total
Visibility: export
insertFrom : Foldablef=>f (Finn, v) ->FinMapnv->FinMapnv
Totality: total
Visibility: export
insertFrom' : Foldablef=>FinMapnv->f (Finn, v) ->FinMapnv
Totality: total
Visibility: export
insertFromWith : Foldablef=> (v->v->v) ->f (Finn, v) ->FinMapnv->FinMapnv
Totality: total
Visibility: export
delete : Finn->FinMapnv->FinMapnv
Totality: total
Visibility: export
delete' : FinMapnv->Finn->FinMapnv
Totality: total
Visibility: export
update : (Maybev->Maybev) ->Finn->FinMapnv->FinMapnv
Totality: total
Visibility: export
update' : FinMapnv-> (Maybev->Maybev) ->Finn->FinMapnv
Totality: total
Visibility: public export
updateExisting : (v->v) ->Finn->FinMapnv->FinMapnv
Totality: total
Visibility: export
updateExisting' : FinMapnv-> (v->v) ->Finn->FinMapnv
Totality: total
Visibility: public export
fromFoldable : Foldablef=>f (Finn, v) ->FinMapnv
Totality: total
Visibility: export
fromFoldableWith : Foldablef=> (v->v->v) ->f (Finn, v) ->FinMapnv
Totality: total
Visibility: export
fromList : List (Finn, v) ->FinMapnv
Totality: total
Visibility: export
fromListWith : (v->v->v) ->List (Finn, v) ->FinMapnv
Totality: total
Visibility: export
iList : Vectna->List (Finn, a)
Totality: total
Visibility: export
kvList : FinMapnv->List (Finn, v)
Totality: total
Visibility: export
.asKVList : FinMapnv->List (Finn, v)
Totality: total
Visibility: public export
keys : FinMapnv->List (Finn)
Totality: total
Visibility: export
values : FinMapnv->Listv
Totality: total
Visibility: export
mapWithKey : (Finn->v->w) ->FinMapnv->FinMapnw
Totality: total
Visibility: export
mapWithKey' : FinMapnv-> (Finn->v->w) ->FinMapnw
Totality: total
Visibility: export
traverseWithKey : Applicativem=> (Finn->v->mw) ->FinMapnv->m (FinMapnw)
Totality: total
Visibility: export
forWithKey : Applicativem=>FinMapnv-> (Finn->v->mw) ->m (FinMapnw)
Totality: total
Visibility: public export
mergeWith : (v->v->v) ->FinMapnv->FinMapnv->FinMapnv
  Merge two maps, when encountering duplicate keys, uses a function to combine the values.

Totality: total
Visibility: export
merge : Semigroupv=>FinMapnv->FinMapnv->FinMapnv
Totality: total
Visibility: public export
mergeLeft : FinMapnv->FinMapnv->FinMapnv
Totality: total
Visibility: public export
leftMost : FinMapnv->Maybe (Finn, v)
Totality: total
Visibility: export
rightMost : FinMapnv->Maybe (Finn, v)
Totality: total
Visibility: export
size : FinMapnv->Nat
Totality: total
Visibility: public export
.size : FinMapnv->Nat
Totality: total
Visibility: public export
.asKVVect : (fs : FinMapnv) ->Vect (fs.size) (Finn, v)
Totality: total
Visibility: public export
fromSortedMap : SortedMap (Finn) v->FinMapnv
Totality: total
Visibility: export
weakenToSuper : FinMap (finToNati) v->FinMapnv
Totality: total
Visibility: export