linear-maps-0.6: Finite maps for linear useSource codeContentsIndex
Data.Graph.IdMap.Tests
Documentation
toFunction :: I i => Map i k [a] -> Id k -> [a]Source
relationToFunction :: Eq a => [(a, b)] -> a -> [b]Source
testWalk :: (forall k i. I i => Children (Id k) -> Set i k -> [Id k] -> [Id k]) -> [Char] -> [Char]Source
testPrWalk :: (forall k i i'. (I i, I i') => Map i k [Id k] -> Map i' k Int -> Id k -> [Id k]) -> Char -> [Char]Source
testMapWalk :: (forall k i. I i => Children (Id k) -> Set i k -> [Id k] -> [[Id k]]) -> [Char] -> [[Char]]Source
testSCC :: (forall k i. I i => Children (Id k) -> Children (Id k) -> Set i k -> [Id k] -> [[Id k]]) -> [Char] -> [[Char]]Source
withGraph :: forall a. (forall k i i' i'' i''' i4. (I i, I i', I i'', I i''', I i4) => (Id k -> Char) -> (Char -> Id k) -> Map i'' k [Id k] -> Map i''' k [Id k] -> Set i k -> Set i' k -> (forall x. Map i4 k x) -> a) -> aSource
tests :: IO CountsSource
Produced by Haddock version 2.4.2