Safe Haskell	None
Language	Haskell2010

SubHask.Compatibility.Containers

Description

Bindings to make the popular containers library compatible with subhask

Synopsis

Documentation

newtype Seq a Source

This is a thin wrapper around Data.Sequence

Constructors

Seq (Seq a)

Instances

Read a => Read (Seq a) Source
Show a => Show (Seq a) Source
(Eq a, Arbitrary a) => Arbitrary (Seq a) Source
NFData a => NFData (Seq a) Source
IsMutable (Seq a) Source
ValidEq a => Foldable (Seq a) Source
Eq a => Container (Seq a) Source
Constructible (Seq a) Source
Normed (Seq a) Source
Monoid (Seq a) Source
Semigroup (Seq a) Source
POrd a => MinBound_ (Seq a) Source
POrd a => POrd_ (Seq a) Source
Eq a => Eq_ (Seq a) Source
ValidEq a => Partitionable (Seq a) Source
data Mutable m (Seq a0) = Mutable_AppT__ConT_SubHask_Compatibility_Containers_Seq___VarT_a_1628103216_ (PrimRef m (Seq a)) Source
type Elem (Seq a) = a Source
type Scalar (Seq a) = Int Source
type Logic (Seq a) = Bool Source
type SetElem (Seq a) b = Seq b Source

newtype Map i e Source

This is a thin wrapper around Data.Map

Constructors

Map (Map (WithPreludeOrd i) (WithPreludeOrd e))

Instances

(Show i, Show e) => Show (Map i e) Source
(Eq e, Ord i, Semigroup e, Arbitrary i, Arbitrary e) => Arbitrary (Map i e) Source
(NFData i, NFData e) => NFData (Map i e) Source
IsMutable (Map i e) Source
(Ord i, Eq e) => IxConstructible (Map i e) Source
(Ord i, Eq e) => IxContainer (Map i e) Source
Normed (Map i e) Source
Ord i => Monoid (Map i e) Source
Ord i => Semigroup (Map i e) Source
(Ord i, POrd e) => MinBound_ (Map i e) Source
(Ord i, Eq e) => POrd_ (Map i e) Source
(Eq i, Eq e) => Eq_ (Map i e) Source
data Mutable m (Map i0 e0) = Mutable_AppT__AppT__ConT_SubHask_Compatibility_Containers_Map___VarT_i_1628104360____VarT_e_1628104361_ (PrimRef m (Map i e)) Source
type Index (Map i e) = i Source
type Elem (Map i e) = e Source
type Scalar (Map i e) = Int Source
type Logic (Map i e) = Bool Source
type ValidElem (Map i e1) e = ()
type SetIndex (Map i e) i' = Map i' e Source
type SetElem (Map i e) e' = Map i e' Source

newtype Map' i e Source

This is a thin wrapper around Data.Map.Strict

Constructors

Map' (Map (WithPreludeOrd i) (WithPreludeOrd e))

Instances

(Show i, Show e) => Show (Map' i e) Source
(Eq e, Ord i, Semigroup e, Arbitrary i, Arbitrary e) => Arbitrary (Map' i e) Source
(NFData i, NFData e) => NFData (Map' i e) Source
IsMutable (Map' i e) Source
(Ord i, Eq e) => IxConstructible (Map' i e) Source
(Ord i, Eq e) => IxContainer (Map' i e) Source
Normed (Map' i e) Source
Ord i => Monoid (Map' i e) Source
Ord i => Semigroup (Map' i e) Source
(Ord i, POrd e) => MinBound_ (Map' i e) Source
(Ord i, Eq e) => POrd_ (Map' i e) Source
(Eq i, Eq e) => Eq_ (Map' i e) Source
data Mutable m (Map' i0 e0) = Mutable_AppT__AppT__ConT_SubHask_Compatibility_Containers_Map'___VarT_i_1628105501____VarT_e_1628105502_ (PrimRef m (Map' i e)) Source
type Index (Map' i e) = i Source
type Elem (Map' i e) = e Source
type Scalar (Map' i e) = Int Source
type Logic (Map' i e) = Bool Source
type ValidElem (Map' i e1) e = ()
type SetIndex (Map' i e) i' = Map' i' e Source
type SetElem (Map' i e) e' = Map' i e' Source

newtype IntMap e Source

This is a thin wrapper around Data.IntMap

Constructors

IntMap (IntMap (WithPreludeOrd e))

Instances

Read e => Read (IntMap e) Source
Show e => Show (IntMap e) Source
(Eq e, Semigroup e, Arbitrary e) => Arbitrary (IntMap e) Source
NFData e => NFData (IntMap e) Source
IsMutable (IntMap a) Source
Eq e => IxConstructible (IntMap e) Source
Eq e => IxContainer (IntMap e) Source
Normed (IntMap e) Source
Monoid (IntMap e) Source
Semigroup (IntMap e) Source
POrd e => MinBound_ (IntMap e) Source
Eq e => POrd_ (IntMap e) Source
Eq e => Eq_ (IntMap e) Source
data Mutable m (IntMap a0) = Mutable_AppT__ConT_SubHask_Compatibility_Containers_IntMap___VarT_a_1628106664_ (PrimRef m (IntMap a)) Source
type Index (IntMap e) = Key Source
type Elem (IntMap e) = e Source
type Scalar (IntMap e) = Int Source
type Logic (IntMap e) = Bool Source
type ValidElem (IntMap e1) e = ()
type SetElem (IntMap e) e' = IntMap e' Source

newtype IntMap' e Source

This is a thin wrapper around Data.IntMap.Strict

Constructors

IntMap' (IntMap (WithPreludeOrd e))

Instances

Read e => Read (IntMap' e) Source
Show e => Show (IntMap' e) Source
(Eq e, Semigroup e, Arbitrary e) => Arbitrary (IntMap' e) Source
NFData e => NFData (IntMap' e) Source
IsMutable (IntMap' a) Source
Eq e => IxConstructible (IntMap' e) Source
Eq e => IxContainer (IntMap' e) Source
Normed (IntMap' e) Source
Monoid (IntMap' e) Source
Semigroup (IntMap' e) Source
POrd e => MinBound_ (IntMap' e) Source
Eq e => POrd_ (IntMap' e) Source
Eq e => Eq_ (IntMap' e) Source
data Mutable m (IntMap' a0) = Mutable_AppT__ConT_SubHask_Compatibility_Containers_IntMap'___VarT_a_1628107561_ (PrimRef m (IntMap' a)) Source
type Index (IntMap' e) = Key Source
type Elem (IntMap' e) = e Source
type Scalar (IntMap' e) = Int Source
type Logic (IntMap' e) = Bool Source
type ValidElem (IntMap' e1) e = ()
type SetElem (IntMap' e) e' = IntMap' e' Source

newtype Set a Source

This is a thin wrapper around the container's set type

Constructors

Set (Set (WithPreludeOrd a))

Instances

Show a => Show (Set a) Source
(Ord a, Arbitrary a) => Arbitrary (Set a) Source
NFData a => NFData (Set a) Source
IsMutable (Set a) Source
Ord a => Foldable (Set a) Source
Ord a => Container (Set a) Source
Ord a => Constructible (Set a) Source
Normed (Set a) Source
Ord a => Abelian (Set a) Source
Ord a => Monoid (Set a) Source
Ord a => Semigroup (Set a) Source
Ord a => Lattice_ (Set a) Source
Ord a => MinBound_ (Set a) Source
Ord a => POrd_ (Set a) Source
Eq a => Eq_ (Set a) Source
data Mutable m (Set a0) = Mutable_AppT__ConT_SubHask_Compatibility_Containers_Set___VarT_a_1628108370_ (PrimRef m (Set a)) Source
type Elem (Set a) = a Source
type Scalar (Set a) = Int Source
type Logic (Set a) = Logic a Source
type SetElem (Set a) b = Set b Source

data LexSet a where Source

FIXME: implement this in terms of Lexical and Set

FIXME: add the Constrained Monad

Constructors

LexSet :: Ord a => Set a -> LexSet a

Instances

Monad OrdHask LexSet Source
Monad Mon LexSet Source	FIXME: is there a more efficient implementation?
Then * LexSet Source
Functor * OrdHask LexSet Source
Functor * Mon LexSet Source
Show a => Show (LexSet a) Source
IsMutable (LexSet a) Source
Ord a => Foldable (LexSet a) Source
Ord a => Container (LexSet a) Source
Ord a => Constructible (LexSet a) Source
Ord a => Normed (LexSet a) Source
Ord a => Monoid (LexSet a) Source
Semigroup (LexSet a) Source
Ord_ (LexSet a) Source
Lattice_ (LexSet a) Source
Ord a => MinBound_ (LexSet a) Source
POrd_ (LexSet a) Source
Eq_ (LexSet a) Source
data Mutable m (LexSet a0) = Mutable_AppT__ConT_SubHask_Compatibility_Containers_LexSet___VarT_a_1628109321_ (PrimRef m (LexSet a)) Source
type Elem (LexSet a) = a Source
type Scalar (LexSet a) = Int Source
type Logic (LexSet a) = Bool Source
type SetElem (LexSet a) b = LexSet b Source

liftPreludeOrd :: (a -> b) -> WithPreludeOrd a -> WithPreludeOrd b Source