Concepts provided by the library. 
|  | 
|  | Applicative | 
|  | The Applicativeconcept representsFunctors with the ability to lift values and combine computations.
 | 
|  | 
|  | Comonad | 
|  | The Comonadconcept represents context-sensitive computations and data.
 | 
|  | 
|  | Comparable | 
|  | The Comparableconcept defines equality and inequality.
 | 
|  | 
|  | Constant | 
|  | The Constantconcept represents data that can be manipulated at compile-time.
 | 
|  | 
|  | Euclidean Ring | 
|  | The EuclideanRingconcept represents a commutativeRingthat can also be endowed with a division algorithm.
 | 
|  | 
|  | Foldable | 
|  | The Foldableconcept represents data structures that can be reduced to a single value.
 | 
|  | 
|  | Functor | 
|  | The Functorconcept represents types that can be mapped over.
 | 
|  | 
|  | Group | 
|  | The Groupconcept representsMonoids where all objects have an inverse w.r.t. theMonoid's binary operation.
 | 
|  | 
|  | Hashable | 
|  | The Hashableconcept represents objects that can be normalized to a type-level hash.
 | 
|  | 
|  | Iterable | 
|  | The Iterableconcept represents data structures supporting external iteration.
 | 
|  | 
|  | Logical | 
|  | The Logicalconcept represents types with a truth value.
 | 
|  | 
|  | Metafunction | 
|  | A Metafunctionis a function that takeshana::types as inputs and returns ahana::typeas output.
 | 
|  | 
|  | Monad | 
|  | The Monadconcept representsApplicatives with the ability to flatten nested levels of structure.
 | 
|  | 
|  | MonadPlus | 
|  | The MonadPlusconcept represents Monads with a monoidal structure.
 | 
|  | 
|  | Monoid | 
|  | The Monoidconcept represents data types with an associative binary operation that has an identity.
 | 
|  | 
|  | Orderable | 
|  | The Orderableconcept represents totally ordered data types.
 | 
|  | 
|  | Product | 
|  | Represents types that are generic containers of two elements. 
 | 
|  | 
|  | Ring | 
|  | The Ringconcept representsGroups that also form aMonoidunder a second binary operation that distributes over the first.
 | 
|  | 
|  | Searchable | 
|  | The Searchableconcept represents structures that can be searched.
 | 
|  | 
|  | Sequence | 
|  | The Sequenceconcept represents generic index-based sequences.
 | 
|  | 
|  | Struct | 
|  | The Structconcept representsstruct-like user-defined types.
 | 
|  |