 | GeomAlg-0.2.3: Library of geometric algorithms in Haskell | Source code | Contents | Index |
| GeomAlg.External.FiniteMap |
Endliche Abbildungen Dieses ist das Modul texttt{FiniteMap} der GHC-Bibliothek. Wir haben nur die Funktionen umbenannt.
Die von mir hinzugefgten Funktionen texttt{prev}, texttt{prevBy}, texttt{next}, texttt{nextBy}, texttt{addToBy} und texttt{addToBy_C} sind fehlerhaft. Ich hatte keine Zeit sie genauer zu implementieren.
| data FiniteMap key elt | Source |
 Instances |
| empty :: FiniteMap key elt | Source |
| unit :: (key, elt) -> FiniteMap key elt | Source |
| fromList :: Ord key => [(key, elt)] -> FiniteMap key elt | Source |
| insert :: Ord key => FiniteMap key elt -> (key, elt) -> FiniteMap key elt | Source |
| insertC :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> (key, elt) -> FiniteMap key elt | Source |
| insertMany :: Ord key => FiniteMap key elt -> [(key, elt)] -> FiniteMap key elt | Source |
| insertManyC :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> [(key, elt)] -> FiniteMap key elt | Source |
| insertBy :: Ord key => ((key, elt) -> (key, elt) -> Ordering) -> FiniteMap key elt -> (key, elt) -> FiniteMap key elt | Source |
| insertByC :: Ord key => ((key, elt) -> (key, elt) -> Ordering) -> (elt -> elt -> elt) -> FiniteMap key elt -> (key, elt) -> FiniteMap key elt | Source |
| delete :: Ord key => FiniteMap key elt -> key -> FiniteMap key elt | Source |
| deleteMany :: Ord key => FiniteMap key elt -> [key] -> FiniteMap key elt | Source |
| deleteBy :: Ord key => ((key, elt) -> (key, elt) -> Ordering) -> FiniteMap key elt -> (key, elt) -> FiniteMap key elt | Source |
| deleteManyBy :: Ord key => ((key, elt) -> (key, elt) -> Ordering) -> FiniteMap key elt -> [(key, elt)] -> FiniteMap key elt | Source |
| plus :: Ord key => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt | Source |
| plus_C :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt | Source |
| minus :: Ord key => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt | Source |
| fold :: (key -> elt -> a -> a) -> a -> FiniteMap key elt -> a | Source |
| intersect :: Ord key => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt | Source |
| intersect_C :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt | Source |
| map :: (key -> elt1 -> elt2) -> FiniteMap key elt1 -> FiniteMap key elt2 | Source |
| filter :: Ord key => (key -> elt -> Bool) -> FiniteMap key elt -> FiniteMap key elt | Source |
| size :: FiniteMap key elt -> Int | Source |
| isEmpty :: FiniteMap key elt -> Bool | Source |
| elem :: Ord key => key -> FiniteMap key elt -> Bool | Source |
| lookup :: Ord key => FiniteMap key elt -> key -> Maybe elt | Source |
| lookupWithDefault :: Ord key => FiniteMap key elt -> elt -> key -> elt | Source |
| toList :: FiniteMap key elt -> [(key, elt)] | Source |
| keys :: FiniteMap key elt -> [key] | Source |
| elts :: FiniteMap key elt -> [elt] | Source |
| pred :: Ord key => FiniteMap key elt -> key -> Maybe (key, elt) | Source |
| succ :: Ord key => FiniteMap key elt -> key -> Maybe (key, elt) | Source |
| predBy :: Ord key => OrderRel (key, elt) -> FiniteMap key elt -> key -> Maybe (key, elt) | Source |
| succBy :: Ord key => OrderRel (key, elt) -> FiniteMap key elt -> key -> Maybe (key, elt) | Source |
| swap :: Ord key => FiniteMap key elt -> key -> key -> FiniteMap key elt | Source |