Preparing search index...
The search index is not available
@mikuroxina/mini-fn
@mikuroxina/mini-fn
Predicate
Namespace Predicate
Index
Interfaces
Predicate
Predicate
Hkt
Variables
contra
Functions
monoid
Settings
Member Visibility
Protected
Private
Inherited
External
Theme
OS
Light
Dark
@mikuroxina/mini-fn
MonadWriter
Array
ArrayHkt
applicative
foldable
functor
monad
partialEqUnary
reduce
traversable
apply
cmp
dec
enc
eq
equality
flatMap
foldR
fromReduce
map
ord
partialCmp
partialEq
partialEquality
partialOrd
pure
reduceL
reduceR
traverse
BinaryHeap
BinaryHeap
BinaryHeapInner
empty
getMin
insert
intoItems
isEmpty
length
maxHeap
minHeap
popMin
popMinAndInsert
sortItems
Bool
andMonoid
eq
orMonoid
dec
enc
equality
Cat
Cat
CatHkt
CatT
monad
apply
cat
catT
debug
dir
dirxml
doT
doVoidT
eq
error
flatMap
flatten
get
info
inspect
log
map
ord
partialEq
partialOrd
product
table
warn
withT
Cofree
Cofree
CofreeHkt
build
cmp
coiter
coiterW
comonad
comonadCofree
defer
eq
equality
extract
functor
head
hoist
make
map
ord
partialCmp
partialEq
partialEqUnary
partialEquality
partialOrd
section
tail
unfold
unfoldM
unwrap
ComonadCofree
ComonadCofree
ComonadStore
ComonadStore
experiment
peeks
seek
seeks
Compose
ComposeHkt
Compose
applicative
distributive
foldable
functor
getCompose
map
newCompose
partialEqUnary
traversable
Const
Const
ConstHkt
bifunctor
foldable
semiGroupoid
applicative
biMap
compose
eq
foldR
functor
get
newConst
ord
partialEq
partialEqUnary
partialOrd
Cont
ContHkt
ContT
ContTHkt
Cont
apply
callCC
evalCont
evalContT
flatMap
guard
lift
liftLocal
liftPromise
map
mapCont
mapContT
monad
product
pure
reset
resetT
runCont
runContT
shift
shiftT
unless
when
withCont
withContT
ControlFlow
ControlFlowHkt
Break
Continue
ControlFlow
bifunctor
applicative
apply
biMap
breakValue
continueValue
dec
enc
eq
flatMap
flatten
foldR
functor
isBreak
isContinue
mapBreak
mapContinue
monad
newBreak
newContinue
partialEq
partialEqUnary
traversable
traversableMonad
traverse
Coyoneda
CoyonedaHkt
CoyonedaTHkt
Coyoneda
CoyonedaT
applicative
applyT
comonad
coyoneda
distributeT
distributive
duplicateT
extractT
flatMapT
foldRT
foldable
functor
hoist
lift
lower
map
monad
partialEq
partialEqUnary
partialEquality
pureT
traversable
traverseT
unCoyoneda
Curry
Curried
curry
Dom
MapTHkt
Attribute
Dom
Event
Fact
FactsOrganization
Handler
HandlerPayload
Lazy
Map
MapT
Prop
Style
Tag
Text
attribute
descendantsCount
isLazy
isMap
isNode
isText
lazy
map
mapFact
mapHandler
noInnerHtmlOrFormAction
noJavaScriptOrHtmlUri
noOnOrFormAction
noScript
on
organizeFacts
property
runMap
style
tag
text
Dual
Dual
DualHkt
cat
contra
abelianGroup
bifunctor
group
monoid
Envelope
Envelope
decodeFor
encode
pack
Ether
EtherHkt
EtherTHkt
Ether
EtherDeps
EtherSymbol
EtherT
EtherValue
OmitType
compose
composeT
liftEther
newEther
newEtherSymbol
newEtherT
runEther
runEtherT
Exists
Exists
newExists
runExists
FingerTree
appendBetween
appendManyToHead
appendManyToTail
appendToHead
appendToTail
concat
deep
empty
fromArray
fromReduce
isEmpty
reduceTree
size
Deep
DigitHkt
Empty
FingerTreeHkt
NodeHkt
Single
Digit
FingerTree
Node
reduceDigit
reduceNode
isDeep
isSingle
pushToHead
pushToTail
single
Free
FreeHkt
Bind
Free
Return
applicative
apply
cmp
cutoff
eq
equality
flatMap
flatten
foldFree
foldL
foldMap
foldR
functor
hoistFree
intoCont
intoResult
isBind
isReturn
iter
iterA
iterM
liftF
map
monad
monadRec
newBind
newReturn
ord
partialCmp
partialEq
partialEqUnary
partialEquality
partialOrd
productT
pure
retract
runFree
runFreeM
substFree
suspendF
tailRecM
traverse
unfold
unfoldM
wrap
Frozen
FrozenHkt
Frozen
monad
apply
cmp
eq
equality
flatMap
freeze
map
ord
partialCmp
partialEq
partialEquality
partialOrd
product
pure
Func
Fn
FnHkt
fnArrow
abelianGroup
absurd
applicative
apply
compose
constant
distributive
flatMap
flip
functor
group
id
liftBinary
map
monad
monadReader
pipe
split
until
Graph
Bounds
CycleError
Edge
Graph
Vertex
adjsFrom
bounds
build
canReach
connectedComponents
dijkstra
edges
fromEdges
inDegree
isCyclic
outDegree
postOrder
preOrder
reachableVertices
reversedEdges
stronglyConnectedComponents
toReversed
toUndirected
topologicalSort
transpose
vertices
Hkt
Hkt0
Hkt1
Hkt2
Hkt3
Hkt4
Hkt5
Apply1
Apply2
Apply2Only
Apply3
Apply3Only
Apply4
Apply4Only
Apply5
Apply5Only
Get1
Get2
Get3
Get4
Get5
Instance
Identity
id
IdentityHkt
Identity
applicative
comonad
distributive
functor
monad
partialEqUnary
settable
traversable
run
Kleisli
Kleisli
KleisliHkt
category
Lazy
LazyHkt
DeferredLazy
KnownLazy
Lazy
applicative
functor
monad
partialEqUnary
traversable
apply
dec
defer
enc
eq
flatMap
foldR
force
known
map
ord
partialEq
partialOrd
product
pure
sequence
sequenceA
traverse
unzip
List
List
ListHkt
applicative
foldable
functor
iota
monad
partialEqUnary
reduce
traversable
appendToHead
appendToTail
apply
applyCartesian
atMay
build
cartesianProduct
choices
cmp
concat
concatMap
dec
diagonal
diagonals
digits
drop
dropWhile
dropWhileEnd
either
elemIndex
elemIndices
elemIndicesLazy
empty
enc
enumerate
eq
equality
filter
findIndex
findIndices
findIndicesLazy
flatMap
foldL
foldL1
foldR
foldR1
fromArray
fromIterable
fromOption
fromReduce
fromString
group
groupBy
head
init
intercalate
interleave
interleaveTwoWay
intersperse
isNull
last
length
map
mapOption
monoid
ord
partialCmp
partialEq
partialEquality
partialOrd
permutations
plus
range
repeat
repeatWith
replicate
reverse
scanL
singleton
singletonWith
span
spanNot
splitAt
stripPrefix
subsequences
subsequencesExceptEmpty
successors
tail
take
takeWhile
toArray
toIterator
toString
transpose
tupleCartesian
unCons
unfoldR
unique
unzip
zip
zip3
zip4
zipWith
Map
MapHkt
adjust
adjustWithKey
alter
alterF
clone
cmp
compose
countItems
dec
difference
differenceWith
differenceWithKey
empty
enc
entries
eq
equality
filter
filterWithKey
foldL
foldLWithKey
foldMapWithKey
foldR
foldRWithKey
foldable
fromArray
fromArrayWith
fromArrayWithKey
fromList
fromListWith
fromListWithKey
functor
get
has
insert
insertWith
insertWithKey
intersection
intersectionWith
intersectionWithKey
isDisjoint
isEmpty
isProperSubsetOf
isProperSubsetOfBy
isSubsetOf
isSubsetOfBy
keys
map
mapKeys
mapKeysWith
mapOption
mapOptionWithKey
mapResult
mapResultWithKey
mapWithKey
ord
partialCmp
partialEqUnary
partialEquality
partialOrd
partition
partitionWithKey
remove
scan
scanWithKey
singleton
size
sortedEntries
traversable
traverse
traverseSomeWithKey
traverseWithKey
union
unionMonoid
unionWith
unionWithKey
update
updateWithKey
values
Matrix
Matrix
Strides
partialEq
add
addGroup
addMonoid
at
atUnchecked
columnLength
dec
enc
fromColumns
fromRows
identity
interchangeMajorAxis
isMajorAxisRow
mul
mulElementWise
mulMonoid
partialEquality
rawNums
ring
rowLength
scalarProduct
strides
trace
transpose
zeroes
zeros
MonadCont
MonadCont
CallCC
label
labelWithoutArg
MonadFree
MonadFree
functorMonadFree
liftF
wrapT
MonadPromise
MonadPromise
MonadReader
MonadReader
reader
MultiSet
MultiSet
MultiSetInner
contains
count
empty
insert
intoMut
len
remove
Mut
MutHkt
MutRefHkt
Mut
MutCat
MutRef
MutVar
Thread
applicative
applyMut
doMut
dropMutRef
flatMapMut
functor
mapMut
mapMutRef
modifyMutRef
monad
newMutRef
pureMut
readMutRef
runMut
writeMutRef
Number
addAbelianGroup
field
mulAbelianGroup
partialOrd
ring
partialCmp
Optical
Getter
Getter
newGetter
Lens
Entries
key
keys
newLens
nth
Parallel
newParallel
Prism
filter
newPrism
newPrismSimple
only
unreachable
Retriable
exponentialBackoff
newRetriable
Sequential
newSequential
Setter
Setter
set
setF
setM
Traversal
Bitraversal
Traversal
both
newBitraversal
newTraversal
traversed
OpticCat
OpticalCat
OverCat
Optic
OpticSimple
Optical
compose
focused
focusedT
get
getT
identity
opticCat
opticalCat
over
overCat
overT
set
setT
unwrap
unwrapT
Option
OptionHkt
None
Option
Some
applicative
errorMonad
functor
monad
partialEqUnary
traversable
traversableMonad
and
andThen
apply
cmp
contains
dec
enc
eq
equality
filter
flatMap
flatten
foldR
fromPredicate
ifNone
ifSome
isNone
isNoneOr
isSome
isSomeAnd
map
mapOr
mapOrElse
monoid
none
okOr
okOrElse
optResToResOpt
or
orElse
ord
partialCmp
partialEq
partialEquality
partialOrd
some
toArray
toString
traverse
unwrap
unwrapOr
unwrapOrElse
unzip
xor
zip
zipWith
Ordering
Equal
Greater
Less
Ordering
Reversed
equal
greater
less
monoid
and
andThen
dec
enc
isEq
isGe
isGt
isLe
isLt
isNe
reverse
Predicate
Predicate
PredicateHkt
contra
monoid
Promise
PromiseHkt
PromiseTHkt
PromiseT
applicative
functor
monad
monadCont
monadPromise
monadRec
applicativeT
apply
applyT
callCC
flatMap
flatMapT
functorT
map
mapT
monadT
monoid
monoidT
product
productT
pure
pureT
tailRecM
RangeQ
RangeQ
fromIterable
fromList
isEmpty
len
sum
sumFromStartTo
Reader
ReaderHkt
ReaderT
ReaderTHkt
Reader
profunctor
apply
applyT
applyWeak
ask
askM
compose
diMap
flatMap
flatMapT
flatMapWeak
flatten
flattenWeak
functor
functorT
local
map
mapReaderT
mapT
monad
monadT
product
pure
pureT
run
weaken
withReader
withReaderT
Record
RecordHkt
adjust
adjustWithKey
alter
alterF
clone
cmp
compose
dec
difference
differenceWith
differenceWithKey
empty
enc
entries
eq
equality
filter
filterWithKey
foldL
foldLWithKey
foldR
foldRWithKey
foldRecordWithKey
foldable
fromArray
fromArrayWith
fromList
fromListWith
fromListWithKey
functor
get
has
insert
insertWith
insertWithKey
intersection
intersectionWith
intersectionWithKey
isDisjoint
isEmpty
isProperSubsetOf
isProperSubsetOfBy
isSubsetOf
isSubsetOfBy
keys
map
mapKeys
mapKeysWith
mapOption
mapOptionWithKey
mapResult
mapResultWithKey
mapWithKey
ord
partialCmp
partialEqUnary
partialEquality
partialOrd
partition
partitionWithKey
remove
scan
scanWithKey
singleton
size
sortedEntries
traversable
traverse
traverseSomeWithKey
traverseWithKey
union
unionMonoid
unionWith
unionWithKey
update
updateWithKey
values
Result
ResultHkt
CollectErrorValue
CollectReturn
CollectSuccessValue
Err
Ok
Result
bifoldable
bifunctor
bitraversable
and
andThen
applicative
apply
asyncAndThen
asyncMap
biMap
bifoldR
bitraverse
cmp
collect
dec
either
enc
eq
equality
err
errorMonad
flatten
foldR
functor
ifErr
ifOk
inspect
isErr
isOk
map
mapErr
mapOr
mapOrElse
mergeOkErr
monad
monoid
ok
optionErr
optionOk
or
orElse
ord
partialCmp
partialEq
partialEqUnary
partialEquality
partialOrd
product
resOptToOptRes
toArray
toString
traversable
traversableMonad
traverse
unwrap
unwrapErr
unwrapOr
unwrapOrElse
wrapAsyncThrowable
wrapThrowable
Reverse
Reverse
ReverseHkt
monad
traversable
apply
flatMap
map
ord
partialOrd
pure
SegTree
SegTree
SegTreeInner
clear
get
insert
intoItems
intoMut
query
withItems
withLen
Seq
SeqHkt
Seq
ViewL
ViewR
empty
reduce
appendBetween
appendManyToHead
appendManyToTail
appendToHead
appendToTail
concat
deep
fromArray
fromReduce
headL
headR
isEmpty
size
tailL
tailR
viewL
viewR
Serial
CodeMHkt
DecoderHkt
EncoderHkt
AllocationStrategy
Buffer
BufferRange
BuildSignal
BuildStep
Builder
Code
CodeM
DecContext
Decoder
Encoder
Encoding
FailureHandler
ParseResult
ReadLen
SuccessHandler
bufferFullNominal
buildDoneNominal
codeMonoid
failureNominal
flushCode
functorForCodeM
functorForDecoder
insertChunkNominal
monadForCodeM
monadForDecoder
monoid
parseDoneNominal
partialNominal
pureForCodeM
pureForDecoder
appendBuffer
applyCodeM
applyDecoder
bufferBytes
builderEncoder
bytesBuilder
concat
concatViews
decBytes
decF32Be
decF32Le
decF64Be
decF64Le
decI16Be
decI16Le
decI32Be
decI32Le
decI64Be
decI64Le
decI8
decSum
decU16Be
decU16Le
decU32Be
decU32Le
decU64Be
decU64Le
decU8
decUtf8
decodeRaw
empty
emptyBuffer
encF32Be
encF32Le
encF64Be
encF64Le
encFoldable
encI16Be
encI16Le
encI32Be
encI32Le
encI64Be
encI64Le
encI8
encSum
encU16Be
encU16Le
encU32Be
encU32Le
encU64Be
encU64Le
encU8
encUnit
encUtf8
ensure
execCodeM
extendBuffer
f32BeBuilder
f32LeBuilder
f64BeBuilder
f64LeBuilder
failDecoder
fillWithBuildStep
finalStep
flatMapCodeM
flatMapDecoder
flush
i16BeBuilder
i16LeBuilder
i32BeBuilder
i32LeBuilder
i64BeBuilder
i64LeBuilder
i8Builder
intoBytes
intoBytesWith
isEmpty
isolate
label
lookAhead
lookAheadOk
lookAheadSome
mapCodeM
mapDecoder
neededLen
onFailureIdentity
onSuccessIdentity
parsedBytes
pureCodeM
pureDecoder
putRaw
runBuilder
runCode
runCodeM
runDecoder
runDecoderChunk
runDecoderPartial
runDecoderState
runDecoderStateAndRest
safeStrategy
skip
tell
u16BeBuilder
u16LeBuilder
u32BeBuilder
u32LeBuilder
u64BeBuilder
u64LeBuilder
u8Builder
unparsedBytes
untrimmedStrategy
utf8Builder
Star
Star
StarHkt
map
pro
State
StateHkt
StateT
StateTHkt
State
applicative
apply
applyT
evaluateState
evaluateStateT
executeState
executeStateT
flatMap
flatMapT
flatten
flattenT
functor
functorT
get
map
mapState
mapStateT
mapT
monad
monadRec
monadT
product
productT
pure
pureT
put
runState
runStateT
tailRecM
withState
withStateT
StateMonad
MonadState
get
gets
modify
set
Store
StoreHkt
StoreT
StoreTHkt
Store
applyW
comonad
comonadStore
comonadW
duplicate
duplicateW
experiment
experimentW
extend
extendW
extract
extractW
functor
functorW
intoTuple
map
mapW
newStore
newStoreT
peek
peeks
pos
pureW
seek
seeks
String
monoid
ord
semiGroup
cmp
Tagged
Tagged
TaggedHkt
tagged
unTagged
These
TheseHkt
Both
That
These
This
bifunctor
app
apply
biMap
combine
dec
distributeTheseTuple
distributeTupleThese
enc
eq
flatMap
foldR
foldable
functor
intoTuple
isBoth
isThat
isThis
map
merge
mergeWith
monad
newBoth
newThat
newThis
partialEq
partialEqUnary
partition
partitionHere
semiGroup
these
traverse
undistributeTheseTuple
undistributeTupleThese
Trans
MonadTrans
MonadTransHkt
Tropical
Tropical
additive
multiplication
semiRing
fromNumber
fromNumberChecked
Tuple
TupleDHkt
TupleHkt
Tuple
bifoldable
bifunctor
bitraversable
functorD
applicative
apply
assocL
assocR
biMap
bifoldMap
bind
bitraverse
cmp
comonad
curry
dec
defer
duplicate
enc
eq
equality
extend
extract
first
flatMap
foldR
functor
make
map
mapD
monad
ord
partialCmp
partialEq
partialEqUnary
partialEquality
partialOrd
pure
second
swap
traverse
uncurry
TupleN
TupleN
cmp
ord
partialCmp
partialOrd
TypeClass
AbelianGroup
AbelianGroup
AbelianGroupExceptZero
abelSymbol
trivialAbelianGroup
AbelianMonoid
AbelianMonoid
Applicative
Applicative
liftA2
makeMonoid
Apply
Apply
ap
apFirst
apSecond
apSelective
makeSemiGroup
map2
Arrow
Arrow
fanOut
first
second
Associative
Associative
Bifoldable
Bifoldable
biReduceL
biReduceR
bifold
bifoldL
bifoldLM
bifoldMap
bifoldRM
fromBifoldMap
Bifunctor
Bifunctor
GenericBifunctor
first
genericLeftMap
genericRightMap
second
Bitraversable
Bitraversable
bisequenceA
Category
Category
compose
pipe
Choice
Choice
Comonad
Comonad
extend
Conjoined
Conjoined
Distributive
Distributive
coMapM
collect
collectM
contraverse
distributeM
Endo
Endo
monoid
Eq
Eq
eqSymbol
stringEq
fromEquality
fromProjection
ErrorMonad
ErrorMonad
ErrorCat
doError
errorCat
Field
Field
FlatMap
FlatMap
flatten
Foldable
Foldable
all
and
any
contains
fold
foldL
foldL1
foldMap
foldR1
isNull
length
mapMIgnore
or
toList
Functor
Functor
bindTo
flap
functorAsInvariant
map
replace
Group
Group
GroupExceptZero
addGroup
trivialGroup
powi
powiEZ
subtract
subtractEZ
toGroupExceptZero
HasInf
HasInf
minMonoid
HasNegInf
HasNegInf
maxMonoid
Hash
Hash
Hasher
nonNanHash
defaultHasher
fromEncoder
Indexable
Indexable
fnIndexable
Indexed
IndexedHkt
Indexed
diMap
indexedIndexable
Iso
Iso
Magma
Magma
Monad
Monad
Append
begin
bind
bindT
flat
flatMap2
flatMap3
flatMap4
flatMap5
kleisli
liftM
liftM2
liftM3
liftM4
liftM5
MonadRec
MonadRec
forever
tailRec
tailRec2
tailRec3
tailRecM2
tailRecM3
untilSome
whileSome
Monoid
Monoid
addMonoid
mulMonoid
trivialMonoid
append
concat
flippedMonoid
maxMonoid
minMonoid
Monoidal
Monoidal
Nt
Nt
NtHkt
Transformation
NaturalTransformation
category
monoid
semiGroup
transformation
unwrap
wrap
Ord
Ord
OrdHkt
contra
nonNanOrd
stringOrd
fromCmp
fromProjection
reversed
PartialEq
PartialEq
PartialEqHkt
PartialEqUnary
contravariant
fromLifter
fromPartialEquality
fromProjection
identity
monoid
strict
PartialOrd
PartialOrd
PartialOrdHkt
contravariant
identity
fromPartialCmp
fromProjection
monoid
Profunctor
Profunctor
fnPro
leftMap
rightMap
Pure
Pure
unless
when
Reduce
Reduce
Representable
HktRep
Representable
ApplyRep
GetRep
Rep
first
second
Reviewable
Reviewable
Ring
Ring
trivialRing
SemiGroup
SemiGroup
semiGroupSymbol
combineAll
SemiGroupal
GenericSemiGroupal
SemiGroupal
SemiGroupoid
SemiGroupoid
SemiRing
SemiRing
Settable
Settable
taintedDot
untaintedDot
Strong
Costrong
Strong
fanOut
split
Symmetric
Symmetric
Tensor
Tensor
Traversable
Traversable
forM
forMVoid
mapM
mapMVoid
sequence
sequenceA
Unital
Unital
Variance
Contravariant
Invariant
contraAsIn
phantom
replace
replaceFlipped
Writer
WriterHkt
WriterT
WriterTHkt
Writer
apply
censor
censorM
evaluateWriter
executeWriter
executeWriterT
flatMap
functor
listen
listenM
listens
listensM
makeMonad
map
mapWriter
mapWriterT
pass
passM
product
pure
tell
tellM
Yoneda
Yoneda
YonedaHkt
functor
lift
lower
map
partialEqUnary
Zipper
Zipper
ZipperHkt
comonad
functor
partialEqUnary
cmp
duplicate
end
eq
equality
extract
fromList
iterateLeft
iterateRight
left
map
ord
partialCmp
partialEq
partialEquality
partialOrd
right
singleton
start
toList
top
Generated using
TypeDoc