packages feed

rope 0.6 → 0.6.1

raw patch · 2 files changed

+1/−2 lines, 2 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Data.Rope.Branded: instance [incoherent] (Measured v t) => Measured v (Branded s t a)
- Data.Rope.Branded: instance [incoherent] (Monoid t) => Applicative (Branded Unsafe t)
- Data.Rope.Branded: instance [incoherent] (Monoid t) => Monad (Branded Unsafe t)
- Data.Rope.Branded: instance [incoherent] (Monoid t) => MonadWriter t (Branded Unsafe t)
+ Data.Rope.Branded: instance [incoherent] Measured v t => Measured v (Branded s t a)
+ Data.Rope.Branded: instance [incoherent] Monoid t => Applicative (Branded Unsafe t)
+ Data.Rope.Branded: instance [incoherent] Monoid t => Monad (Branded Unsafe t)
+ Data.Rope.Branded: instance [incoherent] Monoid t => MonadWriter t (Branded Unsafe t)
- Data.Rope: break :: (Breakable a) => (a -> Bool) -> Rope -> (Rope, Rope)
+ Data.Rope: break :: Breakable a => (a -> Bool) -> Rope -> (Rope, Rope)
- Data.Rope: cons :: (Packable c) => c -> Rope -> Rope
+ Data.Rope: cons :: Packable c => c -> Rope -> Rope
- Data.Rope: dropWhile :: (Breakable a) => (a -> Bool) -> Rope -> Rope
+ Data.Rope: dropWhile :: Breakable a => (a -> Bool) -> Rope -> Rope
- Data.Rope: head :: (Unpackable a) => Rope -> a
+ Data.Rope: head :: Unpackable a => Rope -> a
- Data.Rope: last :: (Unpackable a) => Rope -> a
+ Data.Rope: last :: Unpackable a => Rope -> a
- Data.Rope: pack :: (Packable c) => c -> Rope
+ Data.Rope: pack :: Packable c => c -> Rope
- Data.Rope: snoc :: (Packable c) => Rope -> c -> Rope
+ Data.Rope: snoc :: Packable c => Rope -> c -> Rope
- Data.Rope: span :: (Breakable a) => (a -> Bool) -> Rope -> (Rope, Rope)
+ Data.Rope: span :: Breakable a => (a -> Bool) -> Rope -> (Rope, Rope)
- Data.Rope: takeWhile :: (Breakable a) => (a -> Bool) -> Rope -> Rope
+ Data.Rope: takeWhile :: Breakable a => (a -> Bool) -> Rope -> Rope
- Data.Rope: uncons :: (Unpackable a) => Rope -> Maybe (a, Rope)
+ Data.Rope: uncons :: Unpackable a => Rope -> Maybe (a, Rope)
- Data.Rope: unpack :: (Unpackable a) => Rope -> [a]
+ Data.Rope: unpack :: Unpackable a => Rope -> [a]
- Data.Rope: unsnoc :: (Unpackable a) => Rope -> Maybe (Rope, a)
+ Data.Rope: unsnoc :: Unpackable a => Rope -> Maybe (Rope, a)
- Data.Rope.Annotated: append :: (MonoidalAnn f) => Ann f a -> Ann f b -> Ann f (a :<> b)
+ Data.Rope.Annotated: append :: MonoidalAnn f => Ann f a -> Ann f b -> Ann f (a :<> b)
- Data.Rope.Annotated: class (MonoidalAnn f) => PackableAnn f
+ Data.Rope.Annotated: class MonoidalAnn f => PackableAnn f
- Data.Rope.Annotated: drop :: (BreakableAnn f) => Int -> Ann f a -> (forall n. Ann f (Drop n a) -> r) -> r
+ Data.Rope.Annotated: drop :: BreakableAnn f => Int -> Ann f a -> (forall n. Ann f (Drop n a) -> r) -> r
- Data.Rope.Annotated: empty :: (MonoidalAnn f) => Ann f Nil
+ Data.Rope.Annotated: empty :: MonoidalAnn f => Ann f Nil
- Data.Rope.Annotated: head :: (Unpackable t) => Branded s Rope a -> t
+ Data.Rope.Annotated: head :: Unpackable t => Branded s Rope a -> t
- Data.Rope.Annotated: last :: (Unpackable t) => Branded s Rope a -> t
+ Data.Rope.Annotated: last :: Unpackable t => Branded s Rope a -> t
- Data.Rope.Annotated: splitAt :: (BreakableAnn f) => Int -> Ann f a -> (forall n. Ann f (Take n a) -> Ann f (Drop n a) -> r) -> r
+ Data.Rope.Annotated: splitAt :: BreakableAnn f => Int -> Ann f a -> (forall n. Ann f (Take n a) -> Ann f (Drop n a) -> r) -> r
- Data.Rope.Annotated: take :: (BreakableAnn f) => Int -> Ann f a -> (forall n. Ann f (Take n a) -> r) -> r
+ Data.Rope.Annotated: take :: BreakableAnn f => Int -> Ann f a -> (forall n. Ann f (Take n a) -> r) -> r
- Data.Rope.Annotated: unpack :: (Unpackable t) => Branded s Rope a -> [t]
+ Data.Rope.Annotated: unpack :: Unpackable t => Branded s Rope a -> [t]
- Data.Rope.Annotation: appendAnn :: (MonoidalAnn f) => Rope -> f a -> Rope -> f b -> f c
+ Data.Rope.Annotation: appendAnn :: MonoidalAnn f => Rope -> f a -> Rope -> f b -> f c
- Data.Rope.Annotation: class (MonoidalAnn f) => PackableAnn f
+ Data.Rope.Annotation: class MonoidalAnn f => PackableAnn f
- Data.Rope.Annotation: consAnn :: (PackableAnn f) => Int -> Rope -> f a -> f b
+ Data.Rope.Annotation: consAnn :: PackableAnn f => Int -> Rope -> f a -> f b
- Data.Rope.Annotation: dropAnn :: (BreakableAnn f) => Int -> Rope -> f a -> f b
+ Data.Rope.Annotation: dropAnn :: BreakableAnn f => Int -> Rope -> f a -> f b
- Data.Rope.Annotation: emptyAnn :: (MonoidalAnn f) => f a
+ Data.Rope.Annotation: emptyAnn :: MonoidalAnn f => f a
- Data.Rope.Annotation: packAnn :: (PackableAnn f) => Rope -> f a
+ Data.Rope.Annotation: packAnn :: PackableAnn f => Rope -> f a
- Data.Rope.Annotation: snocAnn :: (PackableAnn f) => Int -> Rope -> f a -> f b
+ Data.Rope.Annotation: snocAnn :: PackableAnn f => Int -> Rope -> f a -> f b
- Data.Rope.Annotation: splitAtAnn :: (BreakableAnn f) => Int -> Rope -> f a -> (f b, f c)
+ Data.Rope.Annotation: splitAtAnn :: BreakableAnn f => Int -> Rope -> f a -> (f b, f c)
- Data.Rope.Annotation: takeAnn :: (BreakableAnn f) => Int -> Rope -> f a -> f b
+ Data.Rope.Annotation: takeAnn :: BreakableAnn f => Int -> Rope -> f a -> f b
- Data.Rope.Body: measureBody :: (Measured Offset a) => FingerTree Offset a -> Int
+ Data.Rope.Body: measureBody :: Measured Offset a => FingerTree Offset a -> Int
- Data.Rope.Branded: head :: (Unpackable t) => Branded s Rope a -> t
+ Data.Rope.Branded: head :: Unpackable t => Branded s Rope a -> t
- Data.Rope.Branded: last :: (Unpackable t) => Branded s Rope a -> t
+ Data.Rope.Branded: last :: Unpackable t => Branded s Rope a -> t
- Data.Rope.Branded: unpack :: (Unpackable t) => Branded s Rope a -> [t]
+ Data.Rope.Branded: unpack :: Unpackable t => Branded s Rope a -> [t]
- Data.Rope.Branded.Comonad: class (Functor w) => Comonad w
+ Data.Rope.Branded.Comonad: class Functor w => Comonad w
- Data.Rope.Branded.Comonad: duplicate :: (Comonad w) => w a -> w (w a)
+ Data.Rope.Branded.Comonad: duplicate :: Comonad w => w a -> w (w a)
- Data.Rope.Branded.Comonad: extend :: (Comonad w) => (w a -> b) -> w a -> w b
+ Data.Rope.Branded.Comonad: extend :: Comonad w => (w a -> b) -> w a -> w b
- Data.Rope.Branded.Comonad: extract :: (Comonad w) => w a -> a
+ Data.Rope.Branded.Comonad: extract :: Comonad w => w a -> a
- Data.Rope.Internal: break :: (Breakable a) => (a -> Bool) -> Rope -> (Rope, Rope)
+ Data.Rope.Internal: break :: Breakable a => (a -> Bool) -> Rope -> (Rope, Rope)
- Data.Rope.Internal: cons :: (Packable c) => c -> Rope -> Rope
+ Data.Rope.Internal: cons :: Packable c => c -> Rope -> Rope
- Data.Rope.Internal: dropWhile :: (Breakable a) => (a -> Bool) -> Rope -> Rope
+ Data.Rope.Internal: dropWhile :: Breakable a => (a -> Bool) -> Rope -> Rope
- Data.Rope.Internal: head :: (Unpackable a) => Rope -> a
+ Data.Rope.Internal: head :: Unpackable a => Rope -> a
- Data.Rope.Internal: last :: (Unpackable a) => Rope -> a
+ Data.Rope.Internal: last :: Unpackable a => Rope -> a
- Data.Rope.Internal: pack :: (Packable c) => c -> Rope
+ Data.Rope.Internal: pack :: Packable c => c -> Rope
- Data.Rope.Internal: snoc :: (Packable c) => Rope -> c -> Rope
+ Data.Rope.Internal: snoc :: Packable c => Rope -> c -> Rope
- Data.Rope.Internal: span :: (Breakable a) => (a -> Bool) -> Rope -> (Rope, Rope)
+ Data.Rope.Internal: span :: Breakable a => (a -> Bool) -> Rope -> (Rope, Rope)
- Data.Rope.Internal: takeWhile :: (Breakable a) => (a -> Bool) -> Rope -> Rope
+ Data.Rope.Internal: takeWhile :: Breakable a => (a -> Bool) -> Rope -> Rope
- Data.Rope.Internal: uncons :: (Unpackable a) => Rope -> Maybe (a, Rope)
+ Data.Rope.Internal: uncons :: Unpackable a => Rope -> Maybe (a, Rope)
- Data.Rope.Internal: unpack :: (Unpackable a) => Rope -> [a]
+ Data.Rope.Internal: unpack :: Unpackable a => Rope -> [a]
- Data.Rope.Internal: unsnoc :: (Unpackable a) => Rope -> Maybe (Rope, a)
+ Data.Rope.Internal: unsnoc :: Unpackable a => Rope -> Maybe (Rope, a)
- Data.Rope.Unsafe: append :: (MonoidalAnn f) => Ann f a -> Ann f b -> Ann f Unsafe
+ Data.Rope.Unsafe: append :: MonoidalAnn f => Ann f a -> Ann f b -> Ann f Unsafe
- Data.Rope.Unsafe: class (MonoidalAnn f) => PackableAnn f
+ Data.Rope.Unsafe: class MonoidalAnn f => PackableAnn f
- Data.Rope.Unsafe: drop :: (BreakableAnn f) => Int -> Ann f a -> Ann f Unsafe
+ Data.Rope.Unsafe: drop :: BreakableAnn f => Int -> Ann f a -> Ann f Unsafe
- Data.Rope.Unsafe: empty :: (MonoidalAnn f) => Ann f Unsafe
+ Data.Rope.Unsafe: empty :: MonoidalAnn f => Ann f Unsafe
- Data.Rope.Unsafe: head :: (Unpackable t) => Branded s Rope a -> t
+ Data.Rope.Unsafe: head :: Unpackable t => Branded s Rope a -> t
- Data.Rope.Unsafe: last :: (Unpackable t) => Branded s Rope a -> t
+ Data.Rope.Unsafe: last :: Unpackable t => Branded s Rope a -> t
- Data.Rope.Unsafe: splitAt :: (BreakableAnn f) => Int -> Ann f a -> (Ann f Unsafe, Ann f Unsafe)
+ Data.Rope.Unsafe: splitAt :: BreakableAnn f => Int -> Ann f a -> (Ann f Unsafe, Ann f Unsafe)
- Data.Rope.Unsafe: take :: (BreakableAnn f) => Int -> Ann f a -> Ann f Unsafe
+ Data.Rope.Unsafe: take :: BreakableAnn f => Int -> Ann f a -> Ann f Unsafe
- Data.Rope.Unsafe: unpack :: (Unpackable t) => Branded s Rope a -> [t]
+ Data.Rope.Unsafe: unpack :: Unpackable t => Branded s Rope a -> [t]

Files

Data/Rope/Internal.hs view
@@ -3,7 +3,6 @@     ( Rope(..)     -- * Construction     , Packable(..)-    , pack                  -- :: Packable a => a -> Rope     , empty                 -- :: Rope     , fromChunks            -- :: [ByteString] -> Rope     , fromByteString        -- :: ByteString -> Rope
rope.cabal view
@@ -1,5 +1,5 @@ name:           rope-version:        0.6+version:        0.6.1 license:        BSD3 license-file:   LICENSE author:         Edward A. Kmett