Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Data.SplayTree
Synopsis
- class Monoid v => Measured v a | a -> v where
- measure :: a -> v
- data SplayTree v a
- null :: SplayTree v a -> Bool
- singleton :: Measured v a => a -> SplayTree v a
- (<|) :: Measured v a => a -> SplayTree v a -> SplayTree v a
- (|>) :: Measured v a => SplayTree v a -> a -> SplayTree v a
- fork :: Measured v a => SplayTree v a -> a -> SplayTree v a -> SplayTree v a
- uncons :: Measured v a => SplayTree v a -> Maybe (a, SplayTree v a)
- unsnoc :: Measured v a => SplayTree v a -> Maybe (SplayTree v a, a)
- data SplitResult v a
- split :: Measured v a => (v -> Bool) -> SplayTree v a -> SplitResult v a
- map :: (Measured v a, Measured w b) => (a -> b) -> SplayTree v a -> SplayTree w b
- mapWithPos :: (Measured v a, Measured w b) => (v -> a -> b) -> SplayTree v a -> SplayTree w b
- mapWithContext :: (Measured v a, Measured w b) => (v -> a -> v -> b) -> SplayTree v a -> SplayTree w b
- traverse :: (Measured v a, Measured w b, Applicative f) => (a -> f b) -> SplayTree v a -> f (SplayTree w b)
- traverseWithPos :: (Measured v a, Measured w b, Applicative f) => (v -> a -> f b) -> SplayTree v a -> f (SplayTree w b)
- traverseWithContext :: (Measured v a, Measured w b, Applicative f) => (v -> a -> v -> f b) -> SplayTree v a -> f (SplayTree w b)
Documentation
class Monoid v => Measured v a | a -> v where #
Instances
Measured Position Chunk # | |
Defined in Data.Rope.UTF16.Internal | |
Measured Position Rope # | |
Defined in Data.Rope.UTF16.Internal | |
Measured v a => Measured v (SplayTree v a) # | |
Defined in Data.SplayTree |
Instances
Measured v a => Measured v (SplayTree v a) # | |
Defined in Data.SplayTree | |
Foldable (SplayTree v) # | |
Defined in Data.SplayTree Methods fold :: Monoid m => SplayTree v m -> m foldMap :: Monoid m => (a -> m) -> SplayTree v a -> m foldMap' :: Monoid m => (a -> m) -> SplayTree v a -> m foldr :: (a -> b -> b) -> b -> SplayTree v a -> b foldr' :: (a -> b -> b) -> b -> SplayTree v a -> b foldl :: (b -> a -> b) -> b -> SplayTree v a -> b foldl' :: (b -> a -> b) -> b -> SplayTree v a -> b foldr1 :: (a -> a -> a) -> SplayTree v a -> a foldl1 :: (a -> a -> a) -> SplayTree v a -> a toList :: SplayTree v a -> [a] length :: SplayTree v a -> Int elem :: Eq a => a -> SplayTree v a -> Bool maximum :: Ord a => SplayTree v a -> a minimum :: Ord a => SplayTree v a -> a | |
Measured v a => Monoid (SplayTree v a) # | |
Measured v a => Semigroup (SplayTree v a) # | |
(Show a, Show v) => Show (SplayTree v a) # | |
(Eq a, Eq v) => Eq (SplayTree v a) # | |
(Ord a, Ord v) => Ord (SplayTree v a) # | |
Defined in Data.SplayTree |
Construction
Deconstruction
data SplitResult v a #
Instances
(Show v, Show a) => Show (SplitResult v a) # | |
Defined in Data.SplayTree Methods showsPrec :: Int -> SplitResult v a -> ShowS show :: SplitResult v a -> String showList :: [SplitResult v a] -> ShowS | |
(Eq v, Eq a) => Eq (SplitResult v a) # | |
Defined in Data.SplayTree Methods (==) :: SplitResult v a -> SplitResult v a -> Bool (/=) :: SplitResult v a -> SplitResult v a -> Bool | |
(Ord v, Ord a) => Ord (SplitResult v a) # | |
Defined in Data.SplayTree Methods compare :: SplitResult v a -> SplitResult v a -> Ordering (<) :: SplitResult v a -> SplitResult v a -> Bool (<=) :: SplitResult v a -> SplitResult v a -> Bool (>) :: SplitResult v a -> SplitResult v a -> Bool (>=) :: SplitResult v a -> SplitResult v a -> Bool max :: SplitResult v a -> SplitResult v a -> SplitResult v a min :: SplitResult v a -> SplitResult v a -> SplitResult v a |
split :: Measured v a => (v -> Bool) -> SplayTree v a -> SplitResult v a #
Maps
mapWithContext :: (Measured v a, Measured w b) => (v -> a -> v -> b) -> SplayTree v a -> SplayTree w b #
Traversals
traverse :: (Measured v a, Measured w b, Applicative f) => (a -> f b) -> SplayTree v a -> f (SplayTree w b) #