Copyright | (c) dramforever 2015 |
---|---|

License | BSD3 |

Maintainer | dramforever |

Stability | unstable |

Portability | non-portable (GHC extensions) |

Safe Haskell | Safe-Inferred |

Language | Haskell2010 |

- data Splay s a
- class Monoid s => Measured s a | a -> s where
- measure :: a -> s

- singleton :: Measured s a => a -> Splay s a
- split :: Measured s a => (s -> Bool) -> Splay s a -> (Splay s a, Splay s a)
- traverseSplay :: (Measured sa a, Measured sb b, Applicative f) => (a -> f b) -> Splay sa a -> f (Splay sb b)

# Documentation

A representation of a sequence of values of type `a`

using a splay
tree, which can also contain measurements of type `s`

.

traverseSplay :: (Measured sa a, Measured sb b, Applicative f) => (a -> f b) -> Splay sa a -> f (Splay sb b) Source

Traverse the sequence

traverseSplay :: (Measured sa a, Measured sb b) => Traversal a b (Splay sa a) (Splay sb b)