Hoogle Search

Within LTS Haskell 24.42 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. allCopies :: TLS a -> {-# UNPACK #-} !IORef [StablePtr a]

   thread-local-storage	Data.TLS.PThread.Internal

   No documentation available.

2. allTLS :: TLS a -> IO [a]

   thread-local-storage	Data.TLS.PThread.Internal

   After a TLS-based computation is complete, iterate through all the copies of the TLS variable which were used by all threads. NOT thread safe.

3. allPunctuation :: Tokenizer

   tokenize	NLP.Tokenize.String

   Split tokens on transitions between punctuation and non-punctuation characters. This tokenizer is not included in defaultTokenizer pipeline because dealing with word-internal punctuation is quite application specific.

4. allPunctuation :: Tokenizer

   tokenize	NLP.Tokenize.Text

   Split tokens on transitions between punctuation and non-punctuation characters. This tokenizer is not included in defaultTokenizer pipeline because dealing with word-internal punctuation is quite application specific.

5. alloca :: Int -> (B -> IO a) -> IO a

   tools-yj	Foreign.C.ByteArray

   No documentation available.

6. allPaths :: forall v i . Ord i => G v i -> i -> i -> [[i]]

   topograph	Topograph

   All paths from a to b. Note that every path has at least 2 elements, start and end. Use allPaths' for the intermediate steps only. See dfs, which returns all paths starting at some vertice. This function returns paths with specified start and end vertices.

   >>> runG example $ \g@G{..} -> fmap3 gFromVertex $ allPaths g <$> gToVertex 'a' <*> gToVertex 'e'
   Right (Just ["axde","axe","abde","ade","ae"])
   

   There are no paths from element to itself:

   >>> runG example $ \g@G{..} -> fmap3 gFromVertex $ allPaths g <$> gToVertex 'a' <*> gToVertex 'a'
   Right (Just [])
   

7. allPaths' :: forall v i . Ord i => G v i -> i -> i -> [i] -> [[i]]

   topograph	Topograph

   allPaths without begin and end elements.

   >>> runG example $ \g@G{..} -> fmap3 gFromVertex $ allPaths' g <$> gToVertex 'a' <*> gToVertex 'e' <*> pure []
   Right (Just ["xd","x","bd","d",""])
   

8. allPathsTree :: forall v i . Ord i => G v i -> i -> i -> Maybe (Tree i)

   topograph	Topograph

   Like allPaths but return a Tree. All paths from a to b. Note that every path has at least 2 elements, start and end, Unfortunately, this is the same as dfs g <$> gToVertex 'a', as in our example graph, all paths from 'a' end up in 'e'.

   >>> let t = runG example $ \g@G{..} -> fmap3 gFromVertex $ allPathsTree g <$> gToVertex 'a' <*> gToVertex 'e'
   
   >>> fmap3 (foldTree $ \a bs -> if null bs then [[a]] else concatMap (map (a:)) bs) t
   Right (Just (Just ["axde","axe","abde","ade","ae"]))
   

   >>> fmap3 (Set.fromList . treePairs) t
   Right (Just (Just (fromList [('a','b'),('a','d'),('a','e'),('a','x'),('b','d'),('d','e'),('x','d'),('x','e')])))
   

   >>> let ls = runG example $ \g@G{..} -> fmap3 gFromVertex $ allPaths g <$> gToVertex 'a' <*> gToVertex 'e'
   
   >>> fmap2 (Set.fromList . concatMap pairs) ls
   Right (Just (fromList [('a','b'),('a','d'),('a','e'),('a','x'),('b','d'),('d','e'),('x','d'),('x','e')]))
   

   Tree paths show how one can explore the paths.

   >>> traverse3_ dispTree t
   'a'
   'x'
   'd'
   'e'
   'e'
   'b'
   'd'
   'e'
   'd'
   'e'
   'e'
   

   >>> traverse3_ (putStrLn . T.drawTree . fmap show) t
   'a'
   |
   +- 'x'
   |  |
   |  +- 'd'
   |  |  |
   |  |  `- 'e'
   |  |
   |  `- 'e'
   ...
   

   There are no paths from element to itself, but we'll return a single root node, as Tree cannot be empty.

   >>> runG example $ \g@G{..} -> fmap3 gFromVertex $ allPathsTree g <$> gToVertex 'a' <*> gToVertex 'a'
   Right (Just (Just (Node {rootLabel = 'a', subForest = []})))
   

9. allPairs :: [a] -> [(a, a)]

   wkt-types	Data.WKT.Helpers

   No documentation available.

10. allSides :: Triangle a -> [(Point a, Point a)]

    wkt-types	Data.WKT.Triangle

    No documentation available.

Page 145 of many | Previous | Next