ContentsIndex
Darcs.Ordered
Documentation
data EqCheck where
Constructors
IsEq :: EqCheck
NotEq :: EqCheck
show/hide Instances
isEq :: EqCheck -> Bool
data Proof a where
Constructors
Proof :: a -> Proof a
data a1 :> a2
Constructors
a1 :> a2
show/hide Instances
(Show2 a, Show2 b) => Show (a :> b)
(Show2 a, Show2 b) => Show2 (a :> b)
data a1 :< a2
Constructors
a1 :< a2
data a1 :\/: a2
Constructors
a1 :\/: a2
show/hide Instances
(Show2 a, Show2 b) => Show (a :\/: b)
(Show2 a, Show2 b) => Show2 (a :\/: b)
data a1 :/\: a2
Constructors
a1 :/\: a2
class MyEq p where
Methods
unsafeCompare :: p -> p -> Bool
(=\/=) :: p -> p -> EqCheck
(=/\=) :: p -> p -> EqCheck
show/hide Instances
unsafeCoerceP :: a -> a
unsafeCoerceP2 :: t -> t
data FL a where
Constructors
:>: :: a -> FL a -> FL a
NilFL :: FL a
show/hide Instances
Show2 a => Show (FL a)
Show2 a => Show2 (FL a)
(MyEq p, Commute p) => MyEq (FL p)
(Invert p, Commute p) => Invert (FL p)
ReadPatch p => ReadPatch (FL p)
(Conflict p, Apply p, Effect p, ShowPatch p) => ShowPatch (FL p)
Commute p => Commute (FL p)
Apply p => Apply (FL p)
(Conflict p, Patchy p) => Patchy (FL p)
Effect p => Effect (FL p)
Conflict p => Conflict (FL p)
FromPrim p => FromPrims (FL p)
RepoPatchBase p => RepoPatch (FL p)
data RL a where
Constructors
:<: :: a -> RL a -> RL a
NilRL :: RL a
show/hide Instances
(MyEq p, Commute p) => MyEq (RL p)
(Commute p, Invert p) => Invert (RL p)
ReadPatch p => ReadPatch (RL p)
(Conflict p, Apply p, ShowPatch p) => ShowPatch (RL p)
Commute p => Commute (RL p)
Apply p => Apply (RL p)
(Conflict p, Patchy p) => Patchy (RL p)
Effect p => Effect (RL p)
Conflict p => Conflict (RL p)
FromPrim p => FromPrims (RL p)
nullFL :: FL a -> Bool
nullRL :: RL a -> Bool
filterFL :: (p -> EqCheck) -> FL p -> FL p
filterE :: (a -> EqCheck) -> [a] -> [Proof a]
(+>+) :: FL a -> FL a -> FL a
(+<+) :: RL a -> RL a -> RL a
reverseFL :: FL a -> RL a
reverseRL :: RL a -> FL a
concatFL :: FL (FL a) -> FL a
concatRL :: RL (RL a) -> RL a
spanFL :: (a -> Bool) -> FL a -> FL a :> FL a
splitAtFL :: Int -> FL a -> FL a :> FL a
bunchFL :: Int -> FL a -> FL (FL a)
allFL :: (a -> Bool) -> FL a -> Bool
foldlFL :: (a -> b -> a) -> a -> FL b -> a
foldlRL :: (a -> b -> a) -> a -> RL b -> a
mapFL_FL :: (a -> b) -> FL a -> FL b
zipWithFL :: (a -> p -> q) -> [a] -> FL p -> FL q
mapRL_RL :: (a -> b) -> RL a -> RL b
mapFL :: (a -> b) -> FL a -> [b]
mapRL :: (a -> b) -> RL a -> [b]
unsafeMap_l2f :: (a -> b) -> [a] -> FL b
lengthFL :: FL a -> Int
lengthRL :: RL a -> Int
isShorterThanRL :: RL a -> Int -> Bool
concatReverseFL :: FL (RL a) -> RL a
headRL :: RL a -> FlippedSeal a
consRLSealed :: a -> FlippedSeal (RL a) -> FlippedSeal (RL a)
unsafeUnFL :: FL a -> [a]
unsafeUnRL :: RL a -> [a]
unsafeFL :: [a] -> FL a
unsafeRL :: [a] -> RL a
Produced by Haddock version 2.4.2