Data.NonNull

Data.NonNull extends the concepts from Data.List.NonEmpty to any MonoFoldable.

NonNull is a newtype wrapper for a container with 1 or more elements.

Documentation

data NonNull mono

A monomorphic container that is not null.

Instances

Eq mono => Eq (NonNull mono)

Methods

(==) :: NonNull mono -> NonNull mono -> Bool

(/=) :: NonNull mono -> NonNull mono -> Bool

Data mono => Data (NonNull mono)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonNull mono -> c (NonNull mono)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NonNull mono)

toConstr :: NonNull mono -> Constr

dataTypeOf :: NonNull mono -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (NonNull mono))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NonNull mono))

gmapT :: (forall b. Data b => b -> b) -> NonNull mono -> NonNull mono

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonNull mono -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonNull mono -> r

gmapQ :: (forall d. Data d => d -> u) -> NonNull mono -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NonNull mono -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonNull mono -> m (NonNull mono)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonNull mono -> m (NonNull mono)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonNull mono -> m (NonNull mono)

Ord mono => Ord (NonNull mono)

Methods

compare :: NonNull mono -> NonNull mono -> Ordering

(<) :: NonNull mono -> NonNull mono -> Bool

(<=) :: NonNull mono -> NonNull mono -> Bool

(>) :: NonNull mono -> NonNull mono -> Bool

(>=) :: NonNull mono -> NonNull mono -> Bool

max :: NonNull mono -> NonNull mono -> NonNull mono

min :: NonNull mono -> NonNull mono -> NonNull mono

Read mono => Read (NonNull mono)

Methods

readsPrec :: Int -> ReadS (NonNull mono)

readList :: ReadS [NonNull mono]

readPrec :: ReadPrec (NonNull mono)

readListPrec :: ReadPrec [NonNull mono]

Show mono => Show (NonNull mono)

Methods

showsPrec :: Int -> NonNull mono -> ShowS

show :: NonNull mono -> String

showList :: [NonNull mono] -> ShowS

(Semigroup mono, GrowingAppend mono) => Semigroup (NonNull mono)

Methods

(<>) :: NonNull mono -> NonNull mono -> NonNull mono

sconcat :: NonEmpty (NonNull mono) -> NonNull mono

stimes :: Integral b => b -> NonNull mono -> NonNull mono

GrowingAppend mono => GrowingAppend (NonNull mono)

IsSequence mono => MonoComonad (NonNull mono)

Methods

oextract :: NonNull mono -> Element (NonNull mono)

oextend :: (NonNull mono -> Element (NonNull mono)) -> NonNull mono -> NonNull mono

MonoPointed mono => MonoPointed (NonNull mono)

Methods

opoint :: Element (NonNull mono) -> NonNull mono

MonoTraversable mono => MonoTraversable (NonNull mono)

Methods

otraverse :: Applicative f => (Element (NonNull mono) -> f (Element (NonNull mono))) -> NonNull mono -> f (NonNull mono)

omapM :: Applicative m => (Element (NonNull mono) -> m (Element (NonNull mono))) -> NonNull mono -> m (NonNull mono)

MonoFoldable mono => MonoFoldable (NonNull mono)

Methods

ofoldMap :: Monoid m => (Element (NonNull mono) -> m) -> NonNull mono -> m

ofoldr :: (Element (NonNull mono) -> b -> b) -> b -> NonNull mono -> b

ofoldl' :: (a -> Element (NonNull mono) -> a) -> a -> NonNull mono -> a

otoList :: NonNull mono -> [Element (NonNull mono)]

oall :: (Element (NonNull mono) -> Bool) -> NonNull mono -> Bool

oany :: (Element (NonNull mono) -> Bool) -> NonNull mono -> Bool

onull :: NonNull mono -> Bool

olength :: NonNull mono -> Int

olength64 :: NonNull mono -> Int64

ocompareLength :: Integral i => NonNull mono -> i -> Ordering

otraverse_ :: Applicative f => (Element (NonNull mono) -> f b) -> NonNull mono -> f ()

ofor_ :: Applicative f => NonNull mono -> (Element (NonNull mono) -> f b) -> f ()

omapM_ :: Applicative m => (Element (NonNull mono) -> m ()) -> NonNull mono -> m ()

oforM_ :: Applicative m => NonNull mono -> (Element (NonNull mono) -> m ()) -> m ()

ofoldlM :: Monad m => (a -> Element (NonNull mono) -> m a) -> a -> NonNull mono -> m a

ofoldMap1Ex :: Semigroup m => (Element (NonNull mono) -> m) -> NonNull mono -> m

ofoldr1Ex :: (Element (NonNull mono) -> Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> Element (NonNull mono)

ofoldl1Ex' :: (Element (NonNull mono) -> Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> Element (NonNull mono)

headEx :: NonNull mono -> Element (NonNull mono)

lastEx :: NonNull mono -> Element (NonNull mono)

unsafeHead :: NonNull mono -> Element (NonNull mono)

unsafeLast :: NonNull mono -> Element (NonNull mono)

maximumByEx :: (Element (NonNull mono) -> Element (NonNull mono) -> Ordering) -> NonNull mono -> Element (NonNull mono)

minimumByEx :: (Element (NonNull mono) -> Element (NonNull mono) -> Ordering) -> NonNull mono -> Element (NonNull mono)

MonoFunctor mono => MonoFunctor (NonNull mono)

Methods

omap :: (Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> NonNull mono

SemiSequence seq => SemiSequence (NonNull seq)

Associated Types

type Index (NonNull seq) :: *

Methods

intersperse :: Element (NonNull seq) -> NonNull seq -> NonNull seq

reverse :: NonNull seq -> NonNull seq

find :: (Element (NonNull seq) -> Bool) -> NonNull seq -> Maybe (Element (NonNull seq))

sortBy :: (Element (NonNull seq) -> Element (NonNull seq) -> Ordering) -> NonNull seq -> NonNull seq

cons :: Element (NonNull seq) -> NonNull seq -> NonNull seq

snoc :: NonNull seq -> Element (NonNull seq) -> NonNull seq

type Element (NonNull mono)

type Element (NonNull mono) = Element mono

type Index (NonNull seq)

type Index (NonNull seq) = Index seq

fromNullable :: MonoFoldable mono => mono -> Maybe (NonNull mono)

Safely convert from an unsafe monomorphic container to a safe non-null monomorphic container.

nonNull :: MonoFoldable mono => mono -> NonNull mono

Deprecated: Please use the more explicit impureNonNull instead

Old synonym for impureNonNull

toNullable :: NonNull mono -> mono

Safely convert from a non-null monomorphic container to a nullable monomorphic container.

fromNonEmpty :: IsSequence seq => NonEmpty (Element seq) -> NonNull seq

Safely convert from a NonEmpty list to a non-null monomorphic container.

ncons :: SemiSequence seq => Element seq -> seq -> NonNull seq

Prepend an element to a SemiSequence, creating a non-null SemiSequence.

Generally this uses cons underneath. cons is not efficient for most data structures.

Alternatives:

• if you don't need to cons, use fromNullable or nonNull if you can create your structure in one go.
• if you need to cons, you might be able to start off with an efficient data structure such as a NonEmpty List. fronNonEmpty will convert that to your data structure using the structure's fromList function.

nuncons :: IsSequence seq => NonNull seq -> (Element seq, Maybe (NonNull seq))

Extract the first element of a sequnce and the rest of the non-null sequence if it exists.

splitFirst :: IsSequence seq => NonNull seq -> (Element seq, seq)

Same as nuncons with no guarantee that the rest of the sequence is non-null.

nfilter :: IsSequence seq => (Element seq -> Bool) -> NonNull seq -> seq

Equivalent to Data.Sequence.filter, but works on non-nullable sequences.

nfilterM :: (Monad m, IsSequence seq) => (Element seq -> m Bool) -> NonNull seq -> m seq

Equivalent to Data.Sequence.filterM, but works on non-nullable sequences.

nReplicate :: IsSequence seq => Index seq -> Element seq -> NonNull seq

Equivalent to Data.Sequence.replicate

i must be > 0

i <= 0 is treated the same as providing 1

head :: MonoFoldable mono => NonNull mono -> Element mono

Return the first element of a monomorphic container.

Safe version of headEx, only works on monomorphic containers wrapped in a NonNull.

tail :: IsSequence seq => NonNull seq -> seq

Safe version of tailEx, only working on non-nullable sequences.

last :: MonoFoldable mono => NonNull mono -> Element mono

Return the last element of a monomorphic container.

Safe version of lastEx, only works on monomorphic containers wrapped in a NonNull.

init :: IsSequence seq => NonNull seq -> seq

Safe version of initEx, only working on non-nullable sequences.

ofoldMap1 :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> NonNull mono -> m

Map each element of a monomorphic container to a semigroup, and combine the results.

Safe version of ofoldMap1Ex, only works on monomorphic containers wrapped in a NonNull.

Examples

> let xs = ncons ("hello", 1 :: Integer) [(" world", 2)]
> ofoldMap1 fst xs
"hello world"

ofold1 :: (MonoFoldable mono, Semigroup (Element mono)) => NonNull mono -> Element mono

Join a monomorphic container, whose elements are Semigroups, together.

Safe, only works on monomorphic containers wrapped in a NonNull.

Examples

> let xs = ncons "a" ["b", "c"]
> xs
NonNull {toNullable = ["a","b","c"]}

> ofold1 xs
"abc"

ofoldr1 :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono

Right-associative fold of a monomorphic container with no base element.

Safe version of ofoldr1Ex, only works on monomorphic containers wrapped in a NonNull.

foldr1 f = Prelude.foldr1 f . otoList

Examples

> let xs = ncons "a" ["b", "c"]
> ofoldr1 (++) xs
"abc"

ofoldl1' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono

Strict left-associative fold of a monomorphic container with no base element.

Safe version of ofoldl1Ex', only works on monomorphic containers wrapped in a NonNull.

foldl1' f = Prelude.foldl1' f . otoList

Examples

> let xs = ncons "a" ["b", "c"]
> ofoldl1' (++) xs
"abc"

maximum :: (MonoFoldable mono, Ord (Element mono)) => NonNull mono -> Element mono

Get the maximum element of a monomorphic container.

Safe version of maximumEx, only works on monomorphic containers wrapped in a NonNull.

Examples

> let xs = ncons 1 [2, 3 :: Int]
> maximum xs
3

maximumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono

Get the maximum element of a monomorphic container, using a supplied element ordering function.

Safe version of maximumByEx, only works on monomorphic containers wrapped in a NonNull.

minimum :: (MonoFoldable mono, Ord (Element mono)) => NonNull mono -> Element mono

Get the minimum element of a monomorphic container.

Safe version of minimumEx, only works on monomorphic containers wrapped in a NonNull.

Examples

> let xs = ncons 1 [2, 3 :: Int]
> minimum xs
1

minimumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono

Get the minimum element of a monomorphic container, using a supplied element ordering function.

Safe version of minimumByEx, only works on monomorphic containers wrapped in a NonNull.

(<|) :: SemiSequence seq => Element seq -> NonNull seq -> NonNull seq infixr 5

Prepend an element to a non-null SemiSequence.

toMinList :: NonEmpty a -> NonNull [a]

Specializes fromNonEmpty to lists only.

class MonoFoldable mono => GrowingAppend mono

Containers which, when two values are combined, the combined length is no less than the larger of the two inputs. In code:

olength (x <> y) >= max (olength x) (olength y)

This class has no methods, and is simply used to assert that this law holds, in order to provide guarantees of correctness (see, for instance, Data.NonNull).

This should have a Semigroup superclass constraint, however, due to Semigroup only recently moving to base, some packages do not provide instances.

Instances

GrowingAppend ByteString

GrowingAppend ByteString

GrowingAppend IntSet

GrowingAppend Text

GrowingAppend Text

GrowingAppend [a]

GrowingAppend (NonEmpty a)

GrowingAppend (Seq a)

GrowingAppend (IntMap v)

Ord v => GrowingAppend (Set v)

(Eq v, Hashable v) => GrowingAppend (HashSet v)

GrowingAppend (Vector a)

Unbox a => GrowingAppend (Vector a)

Storable a => GrowingAppend (Vector a)

GrowingAppend mono => GrowingAppend (NonNull mono)

Ord k => GrowingAppend (Map k v)

(Eq k, Hashable k) => GrowingAppend (HashMap k v)