Agda-2.4.2.3: A dependently typed functional programming language and proof assistant

Safe HaskellNone
LanguageHaskell98

Agda.Utils.Null

Contents

Description

Overloaded null and empty for collections and sequences.

Synopsis

Documentation

class Null a where Source

Minimal complete definition

empty

Methods

empty :: a Source

null :: a -> Bool Source

Satisfying null empty == True.

Instances

Null () Source 
Null ByteString Source 
Null IntSet Source 
Null Permutation Source 
Null ClauseBody Source 
Null Clause Source

A null clause is one with no patterns and no rhs. Should not exist in practice.

Null Simplification Source 
Null Fields Source 
Null ProblemRest Source 
Null [a] Source 
Null (Maybe a) Source

A Maybe is null when it corresponds to the empty list.

Null (IntMap a) Source 
Null (Set a) Source 
Null (Seq a) Source 
Null (Bag a) Source 
Null a => Null (SizedThing a) Source 
Null (Favorites a) Source 
Null (CMSet cinfo) Source 
Null (CallGraph cinfo) Source

null checks whether the call graph is completely disconnected.

Null (Range' a) Source 
Null (Tele a) Source 
Null (Match a) Source 
Null a => Null (Problem' a) Source 
(Null a, Null b) => Null (a, b) Source 
Null (Map k a) Source 

Testing for null.

ifNull :: Null a => a -> b -> (a -> b) -> b Source

ifNullM :: (Monad m, Null a) => m a -> m b -> (a -> m b) -> m b Source

whenNull :: (Monad m, Null a) => a -> m () -> m () Source

unlessNull :: (Monad m, Null a) => a -> (a -> m ()) -> m () Source

whenNullM :: (Monad m, Null a) => m a -> m () -> m () Source

unlessNullM :: (Monad m, Null a) => m a -> (a -> m ()) -> m () Source