Data.NonEmpty.Indexed

data NonEmpty f k v

Constructors

• NonEmpty (Tuple k v) (f k v)

Instances

• Generic (NonEmpty f k v) _
• (Show (f k v), Show k, Show v) => Show (NonEmpty f k v)
• (Eq k, Eq v, Eq (f k v)) => Eq (NonEmpty f k v)
• (Eq k, Eq1 (f k)) => Eq1 (NonEmpty f k)
• (Ord k, Ord v, Ord (f k v)) => Ord (NonEmpty f k v)
• (Ord k, Ord1 (f k)) => Ord1 (NonEmpty f k)
• (Functor (f k)) => Functor (NonEmpty f k)
• (FunctorWithIndex k (f k)) => FunctorWithIndex k (NonEmpty f k)
• (Foldable (f k)) => Foldable (NonEmpty f k)
• (FoldableWithIndex k (f k)) => FoldableWithIndex k (NonEmpty f k)
• (Foldable (f k)) => Foldable1 (NonEmpty f k)
• (Traversable (f k)) => Traversable (NonEmpty f k)
• (TraversableWithIndex k (f k)) => TraversableWithIndex k (NonEmpty f k)

Operator alias for Data.NonEmpty.Indexed.NonEmpty (right-associative / precedence 5)

foldl1 :: forall v k f. Foldable (f k) => (v -> v -> v) -> NonEmpty f k v -> v

fromNonEmpty :: forall r v k f. (k -> v -> f k v -> r) -> NonEmpty f k v -> r

nonEmpty :: forall v k f. (f k v -> Maybe (Tuple (Tuple k v) (f k v))) -> f k v -> Maybe (NonEmpty f k v)

head :: forall v k f. NonEmpty f k v -> Tuple k v

tail :: forall v k f. NonEmpty f k v -> f k v

hmap :: forall k g f. ((f k) ~> (g k)) -> (NonEmpty f k) ~> (NonEmpty g k)

deindex :: forall u v k g f. (Tuple k v -> u) -> (f k v -> g u) -> NonEmpty f k v -> NonEmpty g u

reindex :: forall v f k j. (k -> j) -> (f k v -> f j v) -> NonEmpty f k v -> NonEmpty f j v

index :: forall v k u g f. (u -> Tuple k v) -> (g u -> f k v) -> NonEmpty g u -> NonEmpty f k v

foldMapWithIndex1 :: forall s v k f. FoldableWithIndex k (f k) => Semigroup s => (k -> v -> s) -> NonEmpty f k v -> s