packages feed

chatty-utils (empty) → 0.6

raw patch · 14 files changed

+1786/−0 lines, 14 filesdep +basedep +mtldep +textsetup-changed

Dependencies added: base, mtl, text, transformers

Files

+ Data/Chatty/AVL.hs view
@@ -0,0 +1,170 @@+{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances #-}++{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++-- | Provides an AVL tree.+module Data.Chatty.AVL (avlMax,avlMin,avlLookup,avlHeight,avlSize,avlInsert,avlRemove,AVL (EmptyAVL,AVL),avlRoot,avlPreorder,avlPostorder,avlInorder) where++import Data.Chatty.BST+import Data.Chatty.None++instance Indexable i o v => AnyBST AVL i o v where+  anyBstMax = avlMax+  anyBstMin = avlMin+  anyBstLookup = avlLookup+  anyBstEmpty = EmptyAVL+  anyBstInsert = avlInsert+  anyBstRemove = avlRemove+  anyBstHead = avlHead+  anyBstInorder = avlInorder++instance None (AVL a) where+  none = EmptyAVL++-- | An AVL tree.+data AVL a = EmptyAVL | AVL a Int Int !(AVL a) !(AVL a)++-- | Get the greatest element.+avlMax :: AVL i -> Maybe i+avlMax EmptyAVL = Nothing+avlMax (AVL a _ _ _ EmptyAVL) = Just a+avlMax (AVL _ _ _ _ r) = avlMax r++-- | Get the least element.+avlMin :: AVL i -> Maybe i+avlMin EmptyAVL = Nothing+avlMin (AVL a _ _ EmptyAVL _) = Just a+avlMin (AVL _ _ _ l _) = avlMin l++-- | Lookup a given key.+avlLookup :: Indexable i o v => o -> AVL i -> Maybe v+avlLookup _ EmptyAVL = Nothing+avlLookup o (AVL a _ _ l r)+  | o == indexOf a = Just $ valueOf a+  | o < indexOf a = avlLookup o l+  | o > indexOf a = avlLookup o r++-- | Get the height of the tree.+avlHeight :: AVL i -> Int+avlHeight EmptyAVL = 0+avlHeight (AVL _ _ h _ _) = h++-- | Get the size of the tree.+avlSize :: AVL i -> Int+avlSize EmptyAVL = 0+avlSize (AVL _ s _ _ _) = s++avlBalance :: AVL i -> AVL i+avlBalance EmptyAVL = EmptyAVL+avlBalance t@(AVL a _ _ l r)+  | abs (avlHeight l - avlHeight r) < 2 = t+  | avlHeight l < avlHeight r = case r of+    AVL a1 _ _ l1 r1 ->+      let child = AVL a (findSize l l1) (findHeight l l1) l l1+      in AVL a1 (findSize child r1) (findHeight child r1) child r1+  | otherwise = case l of+    AVL a1 _ _ l1 r1 ->+      let child = AVL a (findSize r1 r) (findHeight r1 r) r1 r+      in AVL a1 (findSize l1 child) (findHeight l1 child) l1 child++findSize :: AVL i -> AVL i -> Int+findSize a b = 1 + avlSize a + avlSize b++findHeight :: AVL i -> AVL i -> Int+findHeight a b = 1 + max (avlHeight a) (avlHeight b)++-- | Insert into the tree.+avlInsert :: Indexable i o v => i -> AVL i -> AVL i+avlInsert a EmptyAVL = AVL a 1 1 EmptyAVL EmptyAVL+avlInsert a (AVL a1 s h l r)+  | indexOf a == indexOf a1 = AVL a s h l r+  | indexOf a < indexOf a1 =+    let l' = avlInsert a l+    in avlBalance $ AVL a1 (s+1) (findHeight l' r) l' r+  | otherwise =+    let r' = avlInsert a r+    in avlBalance $ AVL a1 (s+1) (findHeight l r') l r' ++-- | Remove from the tree.+avlRemove :: Indexable i o v => o -> AVL i -> AVL i+avlRemove _ EmptyAVL = EmptyAVL+avlRemove o t@(AVL a _ _ EmptyAVL EmptyAVL)+  | indexOf a == o = EmptyAVL+  | otherwise = t+avlRemove o t@(AVL a _ _ l r)+  | indexOf a == o =+    case t of+      AVL _ _ _ EmptyAVL _ -> case getLeft r of+        (Just a',r') -> avlBalance $ AVL a' (findSize EmptyAVL r') (findHeight EmptyAVL r') EmptyAVL r'+      _ -> case getRight l of+        (Just a',l') -> avlBalance $ AVL a' (findSize l' r) (findHeight l' r) l' r+  | o < indexOf a =+    let l' = avlRemove o l+    in avlBalance $ AVL a (findSize l' r) (findHeight l' r) l' r+  | otherwise =+    let r' = avlRemove o r+    in avlBalance $ AVL a (findSize l r') (findHeight l r') l r'++getLeft :: AVL i -> (Maybe i,AVL i)+getLeft EmptyAVL = (Nothing,EmptyAVL)+getLeft (AVL a _ _ EmptyAVL EmptyAVL) = (Just a,EmptyAVL)+getLeft (AVL a _ _ EmptyAVL r) = (Just a,r)+getLeft (AVL a _ _ l r) =+  case getLeft l of+    (p, t2) -> (p, AVL a (findSize r t2) (findHeight r t2) t2 r)++getRight :: AVL i -> (Maybe i,AVL i)+getRight EmptyAVL = (Nothing,EmptyAVL)+getRight (AVL a _ _ EmptyAVL EmptyAVL) = (Just a,EmptyAVL)+getRight (AVL a _ _ l EmptyAVL) = (Just a,l)+getRight (AVL a _ _ l r) =+  case getRight r of+    (p, t2) -> (p, AVL a (findSize l t2) (findHeight l t2) l t2)++instance Functor AVL where+  fmap _ EmptyAVL = EmptyAVL+  fmap f (AVL a s h l r) = AVL (f a) s h (fmap f l) (fmap f r)++-- | Get the root of the tree.+avlRoot :: AVL i -> i+avlRoot EmptyAVL = error "Trying to get the root of an empty AVL tree."+avlRoot (AVL a _ _ _ _) = a++-- | Get the root of the tree (safely)+avlHead :: AVL i -> Maybe i+avlHead EmptyAVL = Nothing+avlHead t = Just $ avlRoot t++-- | Traverse the tree, order (head, left, right)+avlPreorder :: AVL i -> [i]+avlPreorder EmptyAVL = []+avlPreorder (AVL a _ _ l r) = a : avlPreorder l ++ avlPreorder r++-- | Traverse the tree, order (left, right, head)+avlPostorder :: AVL i -> [i]+avlPostorder EmptyAVL = []+avlPostorder (AVL a _ _ l r) = avlPostorder l ++ avlPostorder r ++ [a]++-- | Traverse the tree, order (left, head, right)+avlInorder :: AVL i -> [i]+avlInorder EmptyAVL = []+avlInorder (AVL a _ _ l r) = avlInorder l ++ [a] ++ avlInorder r
+ Data/Chatty/Atoms.hs view
@@ -0,0 +1,104 @@+{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++-- | Provides a variable-storing monad and functions for access+module Data.Chatty.Atoms where++import Control.Arrow+import qualified Control.Category as C+import Control.Monad+import Control.Monad.Trans.Class+import Control.Monad.IO.Class+import Data.Dynamic+import Data.Typeable+import Data.Chatty.AVL+import Data.Chatty.Counter++-- | Phantom type for atom IDs+newtype Atom a = Atom Int deriving (Ord,Eq)++-- | The storage monad+newtype AtomStoreT m a = AtomStore { runAtomStoreT :: AVL (Int,Dynamic) -> m (a,AVL (Int,Dynamic)) }++instance Functor m => Functor (AtomStoreT m) where+  fmap f a = AtomStore $ \s -> fmap (first f) $ runAtomStoreT a s++instance Monad m => Monad (AtomStoreT m) where+  return a = AtomStore $ \s -> return (a,s)+  m >>= f = AtomStore $ \s -> do (a,s') <- runAtomStoreT m s; runAtomStoreT (f a) s'++instance MonadTrans AtomStoreT where+  lift m = AtomStore $ \s -> do a <- m; return (a,s)++instance MonadIO m => MonadIO (AtomStoreT m) where+  liftIO = lift . liftIO++instance ChCounter m => ChCounter (AtomStoreT m) where+  countOn = lift countOn++-- | Typeclass for all atom-storing monads.+class ChCounter m => ChAtoms m where+  -- | Reserve a new atom.+  newAtom :: Typeable v => m (Atom v)+  -- | Save a value for the given atom.+  putAtom :: Typeable v => Atom v -> v -> m ()+  -- | Get the value from a given atom.+  getAtom :: Typeable v => Atom v -> m v+  -- | Dispose the given atom.+  dispAtom :: Atom v -> m ()+  -- | Clone the given atom.+  cloneAtom :: Typeable v => Atom v -> m (Atom v)+  cloneAtom a = do+    b <- newAtom+    v <- getAtom a+    putAtom b v+    return b++instance (Functor m,ChCounter m) => ChAtoms (AtomStoreT m) where+  newAtom = fmap Atom $ lift countOn+  putAtom (Atom a) v = AtomStore $ \s -> return ((),avlInsert (a,toDyn v) s)+  getAtom (Atom a) = AtomStore $ \s -> let Just v = avlLookup a s in return (fromDyn v undefined,s)+  dispAtom (Atom a) = AtomStore $ \s -> return ((),avlRemove a s)++-- | Atomar operation (almost arrow)+newtype (Typeable a,Typeable b) => Atomar m a b = Atomar { runAtomar :: Atom a -> m (Atom b) }++{-instance MonadAtoms m => C.Category (Atomar m) where+  id = Atomar return+  a . b = Atomar (runAtomar a <=< runAtomar b)++instance MonadAtoms m => Arrow (Atomar m) where+  arr = Atomar . mapAtom+  first f = Atomar $ \a -> do+    b <- cloneAtom a+    b' <- mapAtom fst b+    c <- runAtomar f b'+    v <- getAtom c+    mapAtom (first $ const v) a+    dispAtom c-}++-- | Run a pure function on atoms.+mapAtom :: (Typeable a, Typeable b, ChAtoms m) => (a -> b) -> Atom a -> m (Atom b)+mapAtom f (Atom a) = do+  v <- getAtom (Atom a)+  putAtom (Atom a) $ f v+  return (Atom a)+
+ Data/Chatty/BST.hs view
@@ -0,0 +1,141 @@+{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances, FunctionalDependencies #-}++{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++-- | Provides a typeclass for all binary search trees and an unbalanced implementation+module Data.Chatty.BST where++import Data.Chatty.None++-- | Only instances of Indexable may be saved in a BST+class Ord o => Indexable i o v | i -> o, i -> v where+  -- | Extract the index+  indexOf :: i -> o+  -- | Extract the value+  valueOf :: i -> v++instance Indexable Int Int Int where+  indexOf = id+  valueOf = id++instance Ord o => Indexable (o,a) o a where+  indexOf = fst+  valueOf = snd++instance Ord o => Indexable (o,a,b) o (a,b) where+  indexOf (o,_,_) = o+  valueOf (_,a,b) = (a,b)++instance Ord o => Indexable (o,a,b,c) o (a,b,c) where+  indexOf (o,_,_,_) = o+  valueOf (_,a,b,c) = (a,b,c)++instance Ord o => Indexable (o,a,b,c,d) o (a,b,c,d) where+  indexOf (o,_,_,_,_) = o+  valueOf (_,a,b,c,d) = (a,b,c,d)++instance Ord o => Indexable (o,a,b,c,d,e) o (a,b,c,d,e) where+  indexOf (o,a,b,c,d,e) = o+  valueOf (o,a,b,c,d,e) = (a,b,c,d,e)++-- | Typeclass for all BSTs that store the given Indexable+class Indexable i o v => AnyBST t i o v where+  -- | Insert into the tree+  anyBstInsert :: i -> t i -> t i+  -- | Remove from the tree+  anyBstRemove :: o -> t i -> t i+  -- | Get the greatest element+  anyBstMax :: t i -> Maybe i+  -- | Get the least element+  anyBstMin :: t i -> Maybe i+  -- | Lookup a given key+  anyBstLookup :: o -> t i -> Maybe v+  -- | An empty tree+  anyBstEmpty :: t i+  -- | The root of the tree+  anyBstHead :: t i -> Maybe i+  -- | Traverse the tree in order+  anyBstInorder :: t i -> [i]++instance Indexable i o v => AnyBST BST i o v where+  anyBstInsert = bstInsert+  anyBstRemove = bstRemove+  anyBstMax = bstMax+  anyBstMin =  bstMin+  anyBstLookup = bstLookup+  anyBstEmpty = EmptyBST+  anyBstHead = bstHead+  anyBstInorder = bstInorder++instance None (BST a) where+  none = EmptyBST++-- | An unbalanced binary search tree+data BST a = EmptyBST | BST a !(BST a) !(BST a)++-- | Insert into the BST+bstInsert :: Indexable i o v => i -> BST i -> BST i+bstInsert i EmptyBST = BST i EmptyBST EmptyBST+bstInsert i (BST a l r)+  | indexOf i < indexOf a = BST a (bstInsert i l) r+  | indexOf i > indexOf a = BST a l (bstInsert i r)+  | otherwise = BST i l r++-- | Remove from the BST+bstRemove :: Indexable i o v => o -> BST i -> BST i+bstRemove o EmptyBST = EmptyBST+bstRemove o (BST a EmptyBST r) | indexOf a == o = r+bstRemove o (BST a l EmptyBST) | indexOf a == o = l+bstRemove o (BST a l r)+  | indexOf a < o = BST a (bstRemove o l) r+  | indexOf a > o = BST a l (bstRemove o r)+  | otherwise = let (Just m) = bstMax l in BST m (bstRemove (indexOf m) l) r++-- | Get the greatest element+bstMax :: BST i -> Maybe i+bstMax EmptyBST = Nothing+bstMax (BST a _ EmptyBST) = Just a+bstMax (BST _ _ r) = bstMax r++-- | Get the least element+bstMin :: BST i -> Maybe i+bstMin EmptyBST = Nothing+bstMin (BST a EmptyBST _) = Just a+bstMin (BST _ l _) = bstMin l++-- | Lookup a given key+bstLookup :: Indexable i o v => o -> BST i -> Maybe v+bstLookup _ EmptyBST = Nothing+bstLookup o (BST a l r)+  | o == indexOf a = Just $ valueOf a+  | o < indexOf a = bstLookup o l+  | o > indexOf a = bstLookup o r++-- | Return the tree's root+bstHead :: Indexable i o v => BST i -> Maybe i+bstHead EmptyBST = Nothing+bstHead (BST a _ _) = Just a++-- | Traverse the tree in order+bstInorder :: Indexable i o v => BST i -> [i]+bstInorder EmptyBST = []+bstInorder (BST a l r) = bstInorder l ++ [a] ++ bstInorder r
+ Data/Chatty/Counter.hs view
@@ -0,0 +1,52 @@+{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++-- | Provides a counter monad.+module Data.Chatty.Counter where++import Control.Arrow+import Control.Monad+import Control.Monad.Trans.Class++-- | A counter monad.+newtype CounterT m a = Counter { runCounterT :: Int -> m (a,Int) }++instance Functor m => Functor (CounterT m) where+  fmap f a = Counter $ \s -> fmap (first f) $ runCounterT a s++instance Monad m => Monad (CounterT m) where+  return a = Counter $ \s -> return (a,s)+  m >>= f = Counter $ \s -> do (a,s') <- runCounterT m s; runCounterT (f a) s'++instance MonadTrans CounterT where+  lift m = Counter $ \s -> do a <- m; return (a,s)++-- | Typeclass for all counter monads.+class Monad m => ChCounter m where+  -- | Tell the current number and increment it+  countOn :: m Int++instance Monad m => ChCounter (CounterT m) where+  countOn = Counter $ \s -> return (s,s+1)++-- | Run the given function inside a counter+withCounter :: (Monad m,Functor m) => CounterT m a -> m a+withCounter m = fmap fst $ runCounterT m 0
+ Data/Chatty/Fail.hs view
@@ -0,0 +1,62 @@+{-# LANGUAGE FlexibleInstances, MultiParamTypeClasses #-}++{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++-- | Provides a monad for error handling. Okay, I confess it's equal to ErrorT...+module Data.Chatty.Fail where++import Control.Monad+import Control.Monad.Identity+import Control.Monad.Error.Class+import Control.Monad.Trans.Class++-- | The error handling monad.+newtype FailT e m a = Fail { runFailT :: m (Either e a) }+type Fail e = FailT e Identity++instance Monad m => Functor (FailT e m) where+  fmap f a = Fail $ do+     v <- runFailT a+     case v of+       Left e -> return $ Left e+       Right x -> return $ Right (f x)++instance Monad m => Monad (FailT e m) where+  return a = Fail $ return $ Right a+  m >>= f = Fail $ do+    v <- runFailT m+    case v of+      Left e -> return $ Left e+      Right x -> runFailT $ f x++instance MonadTrans (FailT e) where+  lift m = Fail $ do+    a <- m+    return $ Right a++instance Monad m => MonadError e (FailT e m) where+  throwError e = Fail $ return $ Left e+  catchError m h = Fail $ do+    v <- runFailT m+    case v of+      Left e -> runFailT $ h e+      Right x -> return v
+ Data/Chatty/Focus.hs view
@@ -0,0 +1,62 @@+{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances, FunctionalDependencies #-}++{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++-- | Provides an unbalanced BST with a focus on the root.+module Data.Chatty.Focus (Focus, focusSelect) where++import Data.Chatty.BST+import Data.Chatty.None++-- | An unbalanced BST with a focus on the root.+newtype Focus a = Focus { runFocus :: BST a }++instance None (Focus a) where+  none = Focus none++instance Indexable i o v => AnyBST Focus i o v where+  anyBstInsert i t = Focus $ bstInsert i $ runFocus t+  anyBstRemove o t = Focus $ bstRemove o $ runFocus t+  anyBstMax t = bstMax $ runFocus t+  anyBstMin t = bstMin $ runFocus t+  anyBstLookup o t = bstLookup o $ runFocus t+  anyBstHead t = bstHead $ runFocus t+  anyBstEmpty = Focus none+  anyBstInorder t = bstInorder $ runFocus t++focusSelect' :: Indexable i o v => o -> BST i -> Maybe (BST i)+focusSelect' _ EmptyBST = Nothing+focusSelect' o t@(BST a l r)+  | o == indexOf a = Just t+  | o < indexOf a = case focusSelect' o l of+      Just (BST a' l' r') -> Just $ BST a' l' (BST a r' r)+      Nothing -> Nothing+  | otherwise = case focusSelect' o r of+      Nothing -> Nothing+      Just (BST a' l' r') -> Just $ BST a' (BST a l l') r'++focusInsert' :: Indexable i o v => i -> BST i -> BST i+focusInsert' i = unjust . focusSelect' (indexOf i) . bstInsert i+  where unjust (Just j) = j++-- | Rotate the tree such that the given element becomes the root node.+focusSelect o t = fmap Focus $ focusSelect' o $ runFocus t
+ Data/Chatty/Graph.hs view
@@ -0,0 +1,150 @@+{-# LANGUAGE MultiParamTypeClasses #-}++{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++-- | Provides a general graph.+module Data.Chatty.Graph where++import Data.Chatty.BST+import Data.Chatty.AVL+import Data.Chatty.None++-- | Phantom type for a node ID+newtype NodeId = NodeId Int deriving (Eq,Show,Ord)++-- | A general graph+data Graph a b c = Graph { nodes :: AVL (Node a), edges :: [Edge b c], nextId :: NodeId }++-- | A node for the graph+data Node a = Node { nodeMarked :: Bool, nodeContent :: a, nodeId :: NodeId }++-- | An edge for the graph+data Edge b c = Edge { fromNode :: NodeId, toNode :: NodeId, weight :: Int, label :: b, content :: c }++instance Indexable (Node a) NodeId (Node a) where+  indexOf = nodeId+  valueOf = id++--instance (Show a,Show b) => Show (Graph a b) where+--  show (Graph ns es _) = unlines (map show (reverse ns) ++ map show es)+  +instance (Show a) => Show (Node a) where+  show (Node _ c i) = concat [show i, ": ", show c]++instance (Show b) => Show (Edge b c) where+  show (Edge f t w l _) = concat [show f, " --", show l, "-> ", show t, " [", show w, "]"]++-- | Increment a NodeId+incId :: NodeId -> NodeId+incId (NodeId i) = NodeId (i+1)++-- | An empty graph+emptyGraph :: Graph a b c+emptyGraph = Graph EmptyAVL [] (NodeId 0)++instance None (Graph a b c) where+  none = emptyGraph++-- | Add a node to the graph+addNode :: a -> Graph a b c -> Graph a b c+addNode x = snd . addNode' x++-- | Add a node to the graph and also return its ID+addNode' :: a -> Graph a b c -> (NodeId,Graph a b c)+addNode' x (Graph ns es nid) = (nid, Graph (avlInsert (Node False x nid) ns) es (incId nid))++-- | Add a bunch of nodes+addNodes :: [a] -> Graph a b c -> Graph a b c+addNodes xs = snd . addNodes' xs++-- | Add a bunch of nodes and also return their IDs+addNodes' :: [a] -> Graph a b c -> ([NodeId],Graph a b c)+addNodes' [] g = ([],g)+addNodes' (p:ps) g = let (ls, g'') = addNodes' ps g'+                         (l, g') = addNode' p g+                     in (l:ls, g'')++-- | Return all nodes+allNodes :: Graph a b c -> [Node a]+allNodes = avlInorder . nodes++-- | Return the node in the AVL tree's root+rootNode :: Graph a b c -> NodeId+rootNode = nodeId . avlRoot . nodes++-- | Add a unidirectional edge to the graph (provide both nodes, a weight and a label)+addEdge :: NodeId -> NodeId -> Int -> b -> c -> Graph a b c -> Graph a b c+addEdge f t w l c = addEdge' (Edge f t w l c)++-- | Add a unidirectional edge to the graph (provide the 'Edge')+addEdge' :: Edge b c -> Graph a b c -> Graph a b c+addEdge' e g = g{edges=e:edges g}++-- | Add a bidirectional edge to the graph (provide both nodes, a weight and a label)+addMutualEdge :: NodeId -> NodeId -> Int -> b -> c -> Graph a b c -> Graph a b c+addMutualEdge f t w l c = addEdge f t w l c . addEdge t f w l c++-- | Add a bunch of edges unidirectionally (provide both nodes, a weight and a label)+addEdges :: [(NodeId,NodeId,Int,b,c)] -> Graph a b c -> Graph a b c+addEdges es g = foldr (addEdge' . (\(f,t,w,l,c) -> Edge f t w l c)) g es++-- | Add a bunch of edges unidirectionally (provide the 'Edge's)+addEdges' :: [Edge b c] -> Graph a b c -> Graph a b c+addEdges' = flip $ foldr addEdge'++-- | Add a bunch of edges bidirectionally (provide both nodes, a weight and a label)+addMutualEdges :: [(NodeId,NodeId,Int,b,c)] -> Graph a b c -> Graph a b c+addMutualEdges es = addEdges es . addEdges (map (\(f,t,w,l,c) -> (t,f,w,l,c)) es)++-- | Get the node's content from its ID+getNode :: NodeId -> Graph a b c -> a+getNode n = nodeContent . getNode' n++-- | Get the 'Node' object from its ID+getNode' :: NodeId -> Graph a b c -> Node a+getNode' n = (\(Just x) -> x) . avlLookup n . nodes++-- | Set the node's content by its ID+setNode :: NodeId -> a -> Graph a b c -> Graph a b c+setNode n a g@(Graph ns _ _) = g{nodes=fmap setNode' ns}+  where setNode' (Node m c i) = if i == n then Node m a i else Node m c i++-- | Mark a node by its ID+markNode :: NodeId -> Graph a b c -> Graph a b c+markNode n g@(Graph ns _ _) = g{nodes=fmap markNode' ns}+  where markNode' (Node m c i) = if i == n then Node True c i else Node m c i ++-- | Follow an edge by its source node and label+followEdge :: Eq b => NodeId -> b -> Graph a b c -> Maybe NodeId+followEdge n l g = case filter ((==l).label) $ filter ((==n).fromNode) $ edges g of+  [] -> Nothing+  (x:_) -> Just (toNode x)++-- | Query an edge's content+queryEdge :: Eq b => NodeId -> b -> Graph a b c -> Maybe c+queryEdge n l g = case filter ((==l).label) $ filter ((==n).fromNode) $ edges g of+  [] -> Nothing+  (x:_) -> Just (content x)++-- | List all edges from the given node+listEdges :: NodeId -> Graph a b c -> [(b,c,NodeId)]+listEdges n g = fmap (\(Edge _ t _ l c) -> (l,c,t)) $ filter ((==n).fromNode) $ edges g
+ Data/Chatty/Hetero.hs view
@@ -0,0 +1,91 @@+{-# LANGUAGE MultiParamTypeClasses, FunctionalDependencies, FlexibleInstances, UndecidableInstances, RankNTypes, FlexibleContexts, LambdaCase, ScopedTypeVariables #-}++{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++module Data.Chatty.Hetero where++infixr 9 :-:+-- | The Cons type for a heterogenous list+data Cons a b = (:-:) a b+-- | The empty list+data Nil = Nil++-- | Typeclass for appending one heterogenous list to another one+class Append a b ab | a b -> ab where+  tappend :: a -> b -> ab+instance Append Nil b b where+  tappend Nil b = b+instance Append b c bc => Append (Cons a b) c (Cons a bc) where+  tappend (a :-: b) c = a :-: tappend b c++-- | Typeclass for wrapping a heterogenous list into a Maybe on demand+class IntoMaybe a ar  where+  tjust :: a -> ar+  tnothing :: a -> ar+instance IntoMaybe Nil Nil where+  tjust Nil = Nil+  tnothing a = Nil+instance IntoMaybe (Cons a as) (Cons (Maybe (Cons a as)) Nil) where+  tjust a = Just a :-: Nil+  tnothing a = Nothing :-: Nil++-- | Typeclass for everything that may be converted to a tuple+class Tuplify l t | l -> t where+  tuplify :: l -> t++instance Tuplify Nil () where+  tuplify Nil = ()++instance Tuplify a ar => Tuplify (Cons a Nil) ar where+  tuplify (a :-: Nil) = tuplify a++instance (Tuplify a ar, Tuplify b br) => Tuplify (Cons a (Cons b Nil)) (ar,br) where+  tuplify (a :-: b :-: Nil) = (tuplify a, tuplify b)++instance (Tuplify a ar, Tuplify b br, Tuplify c cr) => Tuplify (Cons a (Cons b (Cons c Nil))) (ar,br,cr) where+  tuplify (a :-: b :-: c :-: Nil) = (tuplify a, tuplify b, tuplify c)++instance (Tuplify a ar, Tuplify b br, Tuplify c cr, Tuplify d dr) => Tuplify (Cons a (Cons b (Cons c (Cons d Nil)))) (ar,br,cr,dr) where+  tuplify (a :-: b :-: c :-: d :-: Nil) = (tuplify a, tuplify b,tuplify c,tuplify d)++instance (Tuplify a ar, Tuplify b br, Tuplify c cr, Tuplify d dr, Tuplify e er) => Tuplify (Cons a (Cons b (Cons c (Cons d (Cons e Nil))))) (ar,br,cr,dr,er) where+  tuplify (a :-: b :-: c :-: d :-: e :-: Nil) = (tuplify a,tuplify b,tuplify c,tuplify d,tuplify e)++instance (Tuplify a ar, Tuplify b br, Tuplify c cr, Tuplify d dr, Tuplify e er, Tuplify f fr) => Tuplify (Cons a (Cons b (Cons c (Cons d (Cons e (Cons f Nil)))))) (ar,br,cr,dr,er,fr) where+  tuplify (a :-: b :-: c :-: d :-: e :-: f :-: Nil) = (tuplify a,tuplify b,tuplify c,tuplify d,tuplify e,tuplify f)++instance Tuplify Int Int where+  tuplify = id++instance Tuplify Char Char where+  tuplify = id++instance Tuplify a ar => Tuplify [a] [ar] where+  tuplify = map tuplify++instance Tuplify a ar => Tuplify (Maybe a) (Maybe ar) where+  tuplify = fmap tuplify++data Titled a = Titled String a++instance Tuplify a ar => Tuplify (Titled a) ar where+  tuplify (Titled _ a) = tuplify a
+ Data/Chatty/ListBuilder.hs view
@@ -0,0 +1,81 @@+{-# LANGUAGE TypeSynonymInstances, MultiParamTypeClasses, FunctionalDependencies, FlexibleInstances, FlexibleContexts #-}++{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++module Data.Chatty.ListBuilder where++import Control.Arrow+import Control.Monad.Trans.Class+import Control.Monad.Identity++class Monad l => ListBuilder l i | l -> i where+  li :: i -> l ()+  buildList :: l () -> [i]++newtype StrictBuilderT i m a = StrictBuilder { runStrictBuilderT :: [i] -> m (a,[i]) }+type StrictBuilder i = StrictBuilderT i Identity++instance Functor m => Functor (StrictBuilderT i m) where+  fmap f a = StrictBuilder $ \s -> fmap (first f) $ runStrictBuilderT a s++instance Monad m => Monad (StrictBuilderT i m) where+  return a = StrictBuilder $ \s -> return (a,s)+  m >>= f = StrictBuilder $ \s -> do (a,s') <- runStrictBuilderT m s; runStrictBuilderT (f a) s'++instance MonadTrans (StrictBuilderT i) where+  lift m = StrictBuilder $ \s -> do a <- m; return (a,s)++instance ListBuilder (StrictBuilder i) i where+  li a = seq a $ StrictBuilder $ \s -> return ((),s++[a])+  buildList m = snd $ runIdentity $ runStrictBuilderT m []++strictBuild :: StrictBuilderT i Identity () -> [i]+strictBuild = buildList++newtype LazyBuilderT i m a = LazyBuilder { runLazyBuilderT :: ([i] -> [i]) -> m (a,[i] -> [i]) }+type LazyBuilder i = LazyBuilderT i Identity++instance Functor m => Functor (LazyBuilderT i m) where+  fmap f a = LazyBuilder $ \s -> fmap (first f) $ runLazyBuilderT a s++instance Monad m => Monad (LazyBuilderT i m) where+  return a = LazyBuilder $ \s -> return (a,s)+  m >>= f = LazyBuilder $ \s -> do (a,s') <- runLazyBuilderT m s; runLazyBuilderT (f a) s'++instance MonadTrans (LazyBuilderT i) where+  lift m = LazyBuilder $ \s -> do a <- m; return (a,s)++instance ListBuilder (LazyBuilder i) i where+  li a = LazyBuilder $ \s -> return ((),s.([a]++))+  buildList m = ($[]) $ snd $ runIdentity $ runLazyBuilderT m ([]++)++lazyBuild :: LazyBuilderT i Identity () -> [i]+lazyBuild = buildList++lis :: ListBuilder l i => [i] -> l ()+lis = mapM_ li++lit :: ListBuilder l (a,b) => a -> b -> l ()+lit a b = li (a,b)++(>-<) :: ListBuilder l (a,b) => a -> b -> l ()+(>-<) = lit
+ Data/Chatty/None.hs view
@@ -0,0 +1,87 @@+{-# LANGUAGE FlexibleInstances #-}++{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++-- | Provides a typeclass for everything that may carry a void value+module Data.Chatty.None where++import Data.Maybe+import Data.Text (pack, Text)++-- | Typeclass for everything that may carry a void value+class None n where+  none :: n++instance None [a] where+  none = []++instance None (Maybe a) where+  none = Nothing++instance None () where+  none = ()++instance None Text where+  none = pack ""++instance None (a -> a) where+  none = id++instance Monad m => None (a -> m a) where+  none = return++instance None Int where+  none = 0++instance None Integer where+  none = 0++instance None Bool where+  none = False++-- | Wrap the void into a monad.+noneM :: (Monad m,None n) => m n+noneM = return none++-- | Join a maybe into the underlying type. 'Nothing' becomes 'none'.+joinMaybe :: None n => Maybe n -> n+joinMaybe (Just j) = j+joinMaybe Nothing = none++-- | Wrap the value into a maybe. 'none' becomes 'Nothing'.+expandMaybe :: (Eq n,None n) => n -> Maybe n+expandMaybe n+  | n == none = Nothing+  | otherwise = Just n++-- | Clean the maybe by pulling wrapped 'none's to the outside (as a 'Nothing').+cleanMaybe :: (Eq n,None n) => Maybe n -> Maybe n+cleanMaybe = expandMaybe . joinMaybe++-- | Eliminate all void elements from the list.+reduce :: (Eq n,None n) => [n] -> [n]+reduce = filter (/=none)++-- | Eliminate all 'Nothing's from the list and unjust all remaining values.+reduceMaybe :: [Maybe a] -> [a]+reduceMaybe = map unjust . filter isJust+  where unjust (Just j) = j
+ Data/Chatty/TST.hs view
@@ -0,0 +1,55 @@+{-+  This module is part of Chatty.+  Copyleft (c) 2014 Marvin Cohrs++  All wrongs reversed. Sharing is an act of love, not crime.+  Please share Chatty with everyone you like.++  Chatty is free software: you can redistribute it and/or modify+  it under the terms of the GNU Affero General Public License as published by+  the Free Software Foundation, either version 3 of the License, or+  (at your option) any later version.++  Chatty is distributed in the hope that it will be useful,+  but WITHOUT ANY WARRANTY; without even the implied warranty of+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+  GNU Affero General Public License for more details.++  You should have received a copy of the GNU Affero General Public License+  along with Chatty. If not, see <http://www.gnu.org/licenses/>.+-}++-- | Provides a ternary search trie+module Data.Chatty.TST where++import Data.Maybe+import Data.Chatty.None++-- | A ternary search trie+data TST a = EmptyTST | TST Char (Maybe a) (TST a) (TST a) (TST a)++-- | Insert something into the TST+tstInsert :: String -> a -> TST a -> TST a+tstInsert (c:[]) a EmptyTST = TST c (Just a) EmptyTST EmptyTST EmptyTST+tstInsert (c:cs) a EmptyTST = TST c Nothing (tstInsert cs a EmptyTST) EmptyTST EmptyTST+tstInsert cs a (TST c1 a1 f l r)+  | head cs < c1 = TST c1 a1 f (tstInsert cs a l) r+  | head cs > c1 = TST c1 a1 f l (tstInsert cs a r)+  | cs == [c1] = TST c1 (Just a) f l r+  | otherwise = TST c1 a1 (tstInsert (tail cs) a f) l r++-- | Lookup some string in the TST+tstLookup :: String -> TST a -> Maybe a+tstLookup _ EmptyTST = Nothing+tstLookup cs (TST c1 a1 f l r)+  | head cs < c1 = tstLookup cs l+  | head cs > c1 = tstLookup cs r+  | cs == [c1] = a1+  | otherwise = tstLookup (tail cs) f++-- | Check if the TST contains the given key+tstContains :: String -> TST a -> Bool+tstContains cs = isJust . tstLookup cs++instance None (TST a) where+  none = EmptyTST
+ LICENSE view
@@ -0,0 +1,661 @@+                    GNU AFFERO GENERAL PUBLIC LICENSE+                       Version 3, 19 November 2007++ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>+ Everyone is permitted to copy and distribute verbatim copies+ of this license document, but changing it is not allowed.++                            Preamble++  The GNU Affero General Public License is a free, copyleft license for+software and other kinds of works, specifically designed to ensure+cooperation with the community in the case of network server software.++  The licenses for most software and other practical works are designed+to take away your freedom to share and change the works.  By contrast,+our General Public Licenses are intended to guarantee your freedom to+share and change all versions of a program--to make sure it remains free+software for all its users.++  When we speak of free software, we are referring to freedom, not+price.  Our General Public Licenses are designed to make sure that you+have the freedom to distribute copies of free software (and charge for+them if you wish), that you receive source code or can get it if you+want it, that you can change the software or use pieces of it in new+free programs, and that you know you can do these things.++  Developers that use our General Public Licenses protect your rights+with two steps: (1) assert copyright on the software, and (2) offer+you this License which gives you legal permission to copy, distribute+and/or modify the software.++  A secondary benefit of defending all users' freedom is that+improvements made in alternate versions of the program, if they+receive widespread use, become available for other developers to+incorporate.  Many developers of free software are heartened and+encouraged by the resulting cooperation.  However, in the case of+software used on network servers, this result may fail to come about.+The GNU General Public License permits making a modified version and+letting the public access it on a server without ever releasing its+source code to the public.++  The GNU Affero General Public License is designed specifically to+ensure that, in such cases, the modified source code becomes available+to the community.  It requires the operator of a network server to+provide the source code of the modified version running there to the+users of that server.  Therefore, public use of a modified version, on+a publicly accessible server, gives the public access to the source+code of the modified version.++  An older license, called the Affero General Public License and+published by Affero, was designed to accomplish similar goals.  This is+a different license, not a version of the Affero GPL, but Affero has+released a new version of the Affero GPL which permits relicensing under+this license.++  The precise terms and conditions for copying, distribution and+modification follow.++                       TERMS AND CONDITIONS++  0. Definitions.++  "This License" refers to version 3 of the GNU Affero General Public License.++  "Copyright" also means copyright-like laws that apply to other kinds of+works, such as semiconductor masks.++  "The Program" refers to any copyrightable work licensed under this+License.  Each licensee is addressed as "you".  "Licensees" and+"recipients" may be individuals or organizations.++  To "modify" a work means to copy from or adapt all or part of the work+in a fashion requiring copyright permission, other than the making of an+exact copy.  The resulting work is called a "modified version" of the+earlier work or a work "based on" the earlier work.++  A "covered work" means either the unmodified Program or a work based+on the Program.++  To "propagate" a work means to do anything with it that, without+permission, would make you directly or secondarily liable for+infringement under applicable copyright law, except executing it on a+computer or modifying a private copy.  Propagation includes copying,+distribution (with or without modification), making available to the+public, and in some countries other activities as well.++  To "convey" a work means any kind of propagation that enables other+parties to make or receive copies.  Mere interaction with a user through+a computer network, with no transfer of a copy, is not conveying.++  An interactive user interface displays "Appropriate Legal Notices"+to the extent that it includes a convenient and prominently visible+feature that (1) displays an appropriate copyright notice, and (2)+tells the user that there is no warranty for the work (except to the+extent that warranties are provided), that licensees may convey the+work under this License, and how to view a copy of this License.  If+the interface presents a list of user commands or options, such as a+menu, a prominent item in the list meets this criterion.++  1. Source Code.++  The "source code" for a work means the preferred form of the work+for making modifications to it.  "Object code" means any non-source+form of a work.++  A "Standard Interface" means an interface that either is an official+standard defined by a recognized standards body, or, in the case of+interfaces specified for a particular programming language, one that+is widely used among developers working in that language.++  The "System Libraries" of an executable work include anything, other+than the work as a whole, that (a) is included in the normal form of+packaging a Major Component, but which is not part of that Major+Component, and (b) serves only to enable use of the work with that+Major Component, or to implement a Standard Interface for which an+implementation is available to the public in source code form.  A+"Major Component", in this context, means a major essential component+(kernel, window system, and so on) of the specific operating system+(if any) on which the executable work runs, or a compiler used to+produce the work, or an object code interpreter used to run it.++  The "Corresponding Source" for a work in object code form means all+the source code needed to generate, install, and (for an executable+work) run the object code and to modify the work, including scripts to+control those activities.  However, it does not include the work's+System Libraries, or general-purpose tools or generally available free+programs which are used unmodified in performing those activities but+which are not part of the work.  For example, Corresponding Source+includes interface definition files associated with source files for+the work, and the source code for shared libraries and dynamically+linked subprograms that the work is specifically designed to require,+such as by intimate data communication or control flow between those+subprograms and other parts of the work.++  The Corresponding Source need not include anything that users+can regenerate automatically from other parts of the Corresponding+Source.++  The Corresponding Source for a work in source code form is that+same work.++  2. Basic Permissions.++  All rights granted under this License are granted for the term of+copyright on the Program, and are irrevocable provided the stated+conditions are met.  This License explicitly affirms your unlimited+permission to run the unmodified Program.  The output from running a+covered work is covered by this License only if the output, given its+content, constitutes a covered work.  This License acknowledges your+rights of fair use or other equivalent, as provided by copyright law.++  You may make, run and propagate covered works that you do not+convey, without conditions so long as your license otherwise remains+in force.  You may convey covered works to others for the sole purpose+of having them make modifications exclusively for you, or provide you+with facilities for running those works, provided that you comply with+the terms of this License in conveying all material for which you do+not control copyright.  Those thus making or running the covered works+for you must do so exclusively on your behalf, under your direction+and control, on terms that prohibit them from making any copies of+your copyrighted material outside their relationship with you.++  Conveying under any other circumstances is permitted solely under+the conditions stated below.  Sublicensing is not allowed; section 10+makes it unnecessary.++  3. Protecting Users' Legal Rights From Anti-Circumvention Law.++  No covered work shall be deemed part of an effective technological+measure under any applicable law fulfilling obligations under article+11 of the WIPO copyright treaty adopted on 20 December 1996, or+similar laws prohibiting or restricting circumvention of such+measures.++  When you convey a covered work, you waive any legal power to forbid+circumvention of technological measures to the extent such circumvention+is effected by exercising rights under this License with respect to+the covered work, and you disclaim any intention to limit operation or+modification of the work as a means of enforcing, against the work's+users, your or third parties' legal rights to forbid circumvention of+technological measures.++  4. Conveying Verbatim Copies.++  You may convey verbatim copies of the Program's source code as you+receive it, in any medium, provided that you conspicuously and+appropriately publish on each copy an appropriate copyright notice;+keep intact all notices stating that this License and any+non-permissive terms added in accord with section 7 apply to the code;+keep intact all notices of the absence of any warranty; and give all+recipients a copy of this License along with the Program.++  You may charge any price or no price for each copy that you convey,+and you may offer support or warranty protection for a fee.++  5. Conveying Modified Source Versions.++  You may convey a work based on the Program, or the modifications to+produce it from the Program, in the form of source code under the+terms of section 4, provided that you also meet all of these conditions:++    a) The work must carry prominent notices stating that you modified+    it, and giving a relevant date.++    b) The work must carry prominent notices stating that it is+    released under this License and any conditions added under section+    7.  This requirement modifies the requirement in section 4 to+    "keep intact all notices".++    c) You must license the entire work, as a whole, under this+    License to anyone who comes into possession of a copy.  This+    License will therefore apply, along with any applicable section 7+    additional terms, to the whole of the work, and all its parts,+    regardless of how they are packaged.  This License gives no+    permission to license the work in any other way, but it does not+    invalidate such permission if you have separately received it.++    d) If the work has interactive user interfaces, each must display+    Appropriate Legal Notices; however, if the Program has interactive+    interfaces that do not display Appropriate Legal Notices, your+    work need not make them do so.++  A compilation of a covered work with other separate and independent+works, which are not by their nature extensions of the covered work,+and which are not combined with it such as to form a larger program,+in or on a volume of a storage or distribution medium, is called an+"aggregate" if the compilation and its resulting copyright are not+used to limit the access or legal rights of the compilation's users+beyond what the individual works permit.  Inclusion of a covered work+in an aggregate does not cause this License to apply to the other+parts of the aggregate.++  6. Conveying Non-Source Forms.++  You may convey a covered work in object code form under the terms+of sections 4 and 5, provided that you also convey the+machine-readable Corresponding Source under the terms of this License,+in one of these ways:++    a) Convey the object code in, or embodied in, a physical product+    (including a physical distribution medium), accompanied by the+    Corresponding Source fixed on a durable physical medium+    customarily used for software interchange.++    b) Convey the object code in, or embodied in, a physical product+    (including a physical distribution medium), accompanied by a+    written offer, valid for at least three years and valid for as+    long as you offer spare parts or customer support for that product+    model, to give anyone who possesses the object code either (1) a+    copy of the Corresponding Source for all the software in the+    product that is covered by this License, on a durable physical+    medium customarily used for software interchange, for a price no+    more than your reasonable cost of physically performing this+    conveying of source, or (2) access to copy the+    Corresponding Source from a network server at no charge.++    c) Convey individual copies of the object code with a copy of the+    written offer to provide the Corresponding Source.  This+    alternative is allowed only occasionally and noncommercially, and+    only if you received the object code with such an offer, in accord+    with subsection 6b.++    d) Convey the object code by offering access from a designated+    place (gratis or for a charge), and offer equivalent access to the+    Corresponding Source in the same way through the same place at no+    further charge.  You need not require recipients to copy the+    Corresponding Source along with the object code.  If the place to+    copy the object code is a network server, the Corresponding Source+    may be on a different server (operated by you or a third party)+    that supports equivalent copying facilities, provided you maintain+    clear directions next to the object code saying where to find the+    Corresponding Source.  Regardless of what server hosts the+    Corresponding Source, you remain obligated to ensure that it is+    available for as long as needed to satisfy these requirements.++    e) Convey the object code using peer-to-peer transmission, provided+    you inform other peers where the object code and Corresponding+    Source of the work are being offered to the general public at no+    charge under subsection 6d.++  A separable portion of the object code, whose source code is excluded+from the Corresponding Source as a System Library, need not be+included in conveying the object code work.++  A "User Product" is either (1) a "consumer product", which means any+tangible personal property which is normally used for personal, family,+or household purposes, or (2) anything designed or sold for incorporation+into a dwelling.  In determining whether a product is a consumer product,+doubtful cases shall be resolved in favor of coverage.  For a particular+product received by a particular user, "normally used" refers to a+typical or common use of that class of product, regardless of the status+of the particular user or of the way in which the particular user+actually uses, or expects or is expected to use, the product.  A product+is a consumer product regardless of whether the product has substantial+commercial, industrial or non-consumer uses, unless such uses represent+the only significant mode of use of the product.++  "Installation Information" for a User Product means any methods,+procedures, authorization keys, or other information required to install+and execute modified versions of a covered work in that User Product from+a modified version of its Corresponding Source.  The information must+suffice to ensure that the continued functioning of the modified object+code is in no case prevented or interfered with solely because+modification has been made.++  If you convey an object code work under this section in, or with, or+specifically for use in, a User Product, and the conveying occurs as+part of a transaction in which the right of possession and use of the+User Product is transferred to the recipient in perpetuity or for a+fixed term (regardless of how the transaction is characterized), the+Corresponding Source conveyed under this section must be accompanied+by the Installation Information.  But this requirement does not apply+if neither you nor any third party retains the ability to install+modified object code on the User Product (for example, the work has+been installed in ROM).++  The requirement to provide Installation Information does not include a+requirement to continue to provide support service, warranty, or updates+for a work that has been modified or installed by the recipient, or for+the User Product in which it has been modified or installed.  Access to a+network may be denied when the modification itself materially and+adversely affects the operation of the network or violates the rules and+protocols for communication across the network.++  Corresponding Source conveyed, and Installation Information provided,+in accord with this section must be in a format that is publicly+documented (and with an implementation available to the public in+source code form), and must require no special password or key for+unpacking, reading or copying.++  7. Additional Terms.++  "Additional permissions" are terms that supplement the terms of this+License by making exceptions from one or more of its conditions.+Additional permissions that are applicable to the entire Program shall+be treated as though they were included in this License, to the extent+that they are valid under applicable law.  If additional permissions+apply only to part of the Program, that part may be used separately+under those permissions, but the entire Program remains governed by+this License without regard to the additional permissions.++  When you convey a copy of a covered work, you may at your option+remove any additional permissions from that copy, or from any part of+it.  (Additional permissions may be written to require their own+removal in certain cases when you modify the work.)  You may place+additional permissions on material, added by you to a covered work,+for which you have or can give appropriate copyright permission.++  Notwithstanding any other provision of this License, for material you+add to a covered work, you may (if authorized by the copyright holders of+that material) supplement the terms of this License with terms:++    a) Disclaiming warranty or limiting liability differently from the+    terms of sections 15 and 16 of this License; or++    b) Requiring preservation of specified reasonable legal notices or+    author attributions in that material or in the Appropriate Legal+    Notices displayed by works containing it; or++    c) Prohibiting misrepresentation of the origin of that material, or+    requiring that modified versions of such material be marked in+    reasonable ways as different from the original version; or++    d) Limiting the use for publicity purposes of names of licensors or+    authors of the material; or++    e) Declining to grant rights under trademark law for use of some+    trade names, trademarks, or service marks; or++    f) Requiring indemnification of licensors and authors of that+    material by anyone who conveys the material (or modified versions of+    it) with contractual assumptions of liability to the recipient, for+    any liability that these contractual assumptions directly impose on+    those licensors and authors.++  All other non-permissive additional terms are considered "further+restrictions" within the meaning of section 10.  If the Program as you+received it, or any part of it, contains a notice stating that it is+governed by this License along with a term that is a further+restriction, you may remove that term.  If a license document contains+a further restriction but permits relicensing or conveying under this+License, you may add to a covered work material governed by the terms+of that license document, provided that the further restriction does+not survive such relicensing or conveying.++  If you add terms to a covered work in accord with this section, you+must place, in the relevant source files, a statement of the+additional terms that apply to those files, or a notice indicating+where to find the applicable terms.++  Additional terms, permissive or non-permissive, may be stated in the+form of a separately written license, or stated as exceptions;+the above requirements apply either way.++  8. Termination.++  You may not propagate or modify a covered work except as expressly+provided under this License.  Any attempt otherwise to propagate or+modify it is void, and will automatically terminate your rights under+this License (including any patent licenses granted under the third+paragraph of section 11).++  However, if you cease all violation of this License, then your+license from a particular copyright holder is reinstated (a)+provisionally, unless and until the copyright holder explicitly and+finally terminates your license, and (b) permanently, if the copyright+holder fails to notify you of the violation by some reasonable means+prior to 60 days after the cessation.++  Moreover, your license from a particular copyright holder is+reinstated permanently if the copyright holder notifies you of the+violation by some reasonable means, this is the first time you have+received notice of violation of this License (for any work) from that+copyright holder, and you cure the violation prior to 30 days after+your receipt of the notice.++  Termination of your rights under this section does not terminate the+licenses of parties who have received copies or rights from you under+this License.  If your rights have been terminated and not permanently+reinstated, you do not qualify to receive new licenses for the same+material under section 10.++  9. Acceptance Not Required for Having Copies.++  You are not required to accept this License in order to receive or+run a copy of the Program.  Ancillary propagation of a covered work+occurring solely as a consequence of using peer-to-peer transmission+to receive a copy likewise does not require acceptance.  However,+nothing other than this License grants you permission to propagate or+modify any covered work.  These actions infringe copyright if you do+not accept this License.  Therefore, by modifying or propagating a+covered work, you indicate your acceptance of this License to do so.++  10. Automatic Licensing of Downstream Recipients.++  Each time you convey a covered work, the recipient automatically+receives a license from the original licensors, to run, modify and+propagate that work, subject to this License.  You are not responsible+for enforcing compliance by third parties with this License.++  An "entity transaction" is a transaction transferring control of an+organization, or substantially all assets of one, or subdividing an+organization, or merging organizations.  If propagation of a covered+work results from an entity transaction, each party to that+transaction who receives a copy of the work also receives whatever+licenses to the work the party's predecessor in interest had or could+give under the previous paragraph, plus a right to possession of the+Corresponding Source of the work from the predecessor in interest, if+the predecessor has it or can get it with reasonable efforts.++  You may not impose any further restrictions on the exercise of the+rights granted or affirmed under this License.  For example, you may+not impose a license fee, royalty, or other charge for exercise of+rights granted under this License, and you may not initiate litigation+(including a cross-claim or counterclaim in a lawsuit) alleging that+any patent claim is infringed by making, using, selling, offering for+sale, or importing the Program or any portion of it.++  11. Patents.++  A "contributor" is a copyright holder who authorizes use under this+License of the Program or a work on which the Program is based.  The+work thus licensed is called the contributor's "contributor version".++  A contributor's "essential patent claims" are all patent claims+owned or controlled by the contributor, whether already acquired or+hereafter acquired, that would be infringed by some manner, permitted+by this License, of making, using, or selling its contributor version,+but do not include claims that would be infringed only as a+consequence of further modification of the contributor version.  For+purposes of this definition, "control" includes the right to grant+patent sublicenses in a manner consistent with the requirements of+this License.++  Each contributor grants you a non-exclusive, worldwide, royalty-free+patent license under the contributor's essential patent claims, to+make, use, sell, offer for sale, import and otherwise run, modify and+propagate the contents of its contributor version.++  In the following three paragraphs, a "patent license" is any express+agreement or commitment, however denominated, not to enforce a patent+(such as an express permission to practice a patent or covenant not to+sue for patent infringement).  To "grant" such a patent license to a+party means to make such an agreement or commitment not to enforce a+patent against the party.++  If you convey a covered work, knowingly relying on a patent license,+and the Corresponding Source of the work is not available for anyone+to copy, free of charge and under the terms of this License, through a+publicly available network server or other readily accessible means,+then you must either (1) cause the Corresponding Source to be so+available, or (2) arrange to deprive yourself of the benefit of the+patent license for this particular work, or (3) arrange, in a manner+consistent with the requirements of this License, to extend the patent+license to downstream recipients.  "Knowingly relying" means you have+actual knowledge that, but for the patent license, your conveying the+covered work in a country, or your recipient's use of the covered work+in a country, would infringe one or more identifiable patents in that+country that you have reason to believe are valid.++  If, pursuant to or in connection with a single transaction or+arrangement, you convey, or propagate by procuring conveyance of, a+covered work, and grant a patent license to some of the parties+receiving the covered work authorizing them to use, propagate, modify+or convey a specific copy of the covered work, then the patent license+you grant is automatically extended to all recipients of the covered+work and works based on it.++  A patent license is "discriminatory" if it does not include within+the scope of its coverage, prohibits the exercise of, or is+conditioned on the non-exercise of one or more of the rights that are+specifically granted under this License.  You may not convey a covered+work if you are a party to an arrangement with a third party that is+in the business of distributing software, under which you make payment+to the third party based on the extent of your activity of conveying+the work, and under which the third party grants, to any of the+parties who would receive the covered work from you, a discriminatory+patent license (a) in connection with copies of the covered work+conveyed by you (or copies made from those copies), or (b) primarily+for and in connection with specific products or compilations that+contain the covered work, unless you entered into that arrangement,+or that patent license was granted, prior to 28 March 2007.++  Nothing in this License shall be construed as excluding or limiting+any implied license or other defenses to infringement that may+otherwise be available to you under applicable patent law.++  12. No Surrender of Others' Freedom.++  If conditions are imposed on you (whether by court order, agreement or+otherwise) that contradict the conditions of this License, they do not+excuse you from the conditions of this License.  If you cannot convey a+covered work so as to satisfy simultaneously your obligations under this+License and any other pertinent obligations, then as a consequence you may+not convey it at all.  For example, if you agree to terms that obligate you+to collect a royalty for further conveying from those to whom you convey+the Program, the only way you could satisfy both those terms and this+License would be to refrain entirely from conveying the Program.++  13. Remote Network Interaction; Use with the GNU General Public License.++  Notwithstanding any other provision of this License, if you modify the+Program, your modified version must prominently offer all users+interacting with it remotely through a computer network (if your version+supports such interaction) an opportunity to receive the Corresponding+Source of your version by providing access to the Corresponding Source+from a network server at no charge, through some standard or customary+means of facilitating copying of software.  This Corresponding Source+shall include the Corresponding Source for any work covered by version 3+of the GNU General Public License that is incorporated pursuant to the+following paragraph.++  Notwithstanding any other provision of this License, you have+permission to link or combine any covered work with a work licensed+under version 3 of the GNU General Public License into a single+combined work, and to convey the resulting work.  The terms of this+License will continue to apply to the part which is the covered work,+but the work with which it is combined will remain governed by version+3 of the GNU General Public License.++  14. Revised Versions of this License.++  The Free Software Foundation may publish revised and/or new versions of+the GNU Affero General Public License from time to time.  Such new versions+will be similar in spirit to the present version, but may differ in detail to+address new problems or concerns.++  Each version is given a distinguishing version number.  If the+Program specifies that a certain numbered version of the GNU Affero General+Public License "or any later version" applies to it, you have the+option of following the terms and conditions either of that numbered+version or of any later version published by the Free Software+Foundation.  If the Program does not specify a version number of the+GNU Affero General Public License, you may choose any version ever published+by the Free Software Foundation.++  If the Program specifies that a proxy can decide which future+versions of the GNU Affero General Public License can be used, that proxy's+public statement of acceptance of a version permanently authorizes you+to choose that version for the Program.++  Later license versions may give you additional or different+permissions.  However, no additional obligations are imposed on any+author or copyright holder as a result of your choosing to follow a+later version.++  15. Disclaimer of Warranty.++  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.++  16. Limitation of Liability.++  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF+SUCH DAMAGES.++  17. Interpretation of Sections 15 and 16.++  If the disclaimer of warranty and limitation of liability provided+above cannot be given local legal effect according to their terms,+reviewing courts shall apply local law that most closely approximates+an absolute waiver of all civil liability in connection with the+Program, unless a warranty or assumption of liability accompanies a+copy of the Program in return for a fee.++                     END OF TERMS AND CONDITIONS++            How to Apply These Terms to Your New Programs++  If you develop a new program, and you want it to be of the greatest+possible use to the public, the best way to achieve this is to make it+free software which everyone can redistribute and change under these terms.++  To do so, attach the following notices to the program.  It is safest+to attach them to the start of each source file to most effectively+state the exclusion of warranty; and each file should have at least+the "copyright" line and a pointer to where the full notice is found.++    <one line to give the program's name and a brief idea of what it does.>+    Copyright (C) <year>  <name of author>++    This program is free software: you can redistribute it and/or modify+    it under the terms of the GNU Affero General Public License as published by+    the Free Software Foundation, either version 3 of the License, or+    (at your option) any later version.++    This program is distributed in the hope that it will be useful,+    but WITHOUT ANY WARRANTY; without even the implied warranty of+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the+    GNU Affero General Public License for more details.++    You should have received a copy of the GNU Affero General Public License+    along with this program.  If not, see <http://www.gnu.org/licenses/>.++Also add information on how to contact you by electronic and paper mail.++  If your software can interact with users remotely through a computer+network, you should also make sure that it provides a way for users to+get its source.  For example, if your program is a web application, its+interface could display a "Source" link that leads users to an archive+of the code.  There are many ways you could offer source, and different+solutions will be better for different programs; see section 13 for the+specific requirements.++  You should also get your employer (if you work as a programmer) or school,+if any, to sign a "copyright disclaimer" for the program, if necessary.+For more information on this, and how to apply and follow the GNU AGPL, see+<http://www.gnu.org/licenses/>.
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple+main = defaultMain
+ chatty-utils.cabal view
@@ -0,0 +1,68 @@+-- Initial chatty-utils.cabal generated by cabal init.  For further +-- documentation, see http://haskell.org/cabal/users-guide/++-- The name of the package.+name:                chatty-utils++-- The package version.  See the Haskell package versioning policy (PVP) +-- for standards guiding when and how versions should be incremented.+-- http://www.haskell.org/haskellwiki/Package_versioning_policy+-- PVP summary:      +-+------- breaking API changes+--                   | | +----- non-breaking API additions+--                   | | | +--- code changes with no API change+version:             0.6++-- A short (one-line) description of the package.+synopsis:            Some utilities every serious chatty-based application may need.++-- A longer description of the package.+description:         Some utilities every serious chatty-based application may need. Includes a graph type, search trees, a None class, a counter and an atom store.++-- The license under which the package is released.+license:             AGPL-3++-- The file containing the license text.+license-file:        LICENSE++-- The package author(s).+author:              Marvin Cohrs++-- An email address to which users can send suggestions, bug reports, and +-- patches.+maintainer:          m@doomanddarkness.eu++-- A copyright notice.+-- copyright:           ++category:            Data++build-type:          Simple++-- Extra files to be distributed with the package, such as examples or a +-- README.+-- extra-source-files:  ++-- Constraint on the version of Cabal needed to build this package.+cabal-version:       >=1.10+++library+  -- Modules exported by the library.+  exposed-modules:     Data.Chatty.Atoms, Data.Chatty.AVL, Data.Chatty.BST, Data.Chatty.Counter, Data.Chatty.None, Data.Chatty.Fail, Data.Chatty.Focus, Data.Chatty.Graph, Data.Chatty.Hetero,+                       Data.Chatty.ListBuilder, Data.Chatty.TST+  +  -- Modules included in this library but not exported.+  -- other-modules:       +  +  -- LANGUAGE extensions used by modules in this package.+  -- other-extensions:    +  +  -- Other library packages from which modules are imported.+  build-depends:       base >=4.6 && <4.7, transformers >=0.3 && <0.4, text >=0.11 && <0.12, mtl >=2.1 && <2.2+  +  -- Directories containing source files.+  -- hs-source-dirs:      +  +  -- Base language which the package is written in.+  default-language:    Haskell2010+