Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. allp :: [a -> Bool] -> a -> Bool

   swish	Swish.RDF.Query

   Test if a value satisfies all predicates in a list

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

   thread-local-storage	Data.TLS.GHC

   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. allTLS :: TLS a -> IO [a]

   thread-local-storage	Data.TLS.PThread

   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.

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

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

   No documentation available.

5. 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.

6. 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.

7. 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.

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

   tools-yj	Foreign.C.ByteArray

   No documentation available.

9. 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 [])
   

10. 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",""])
    

Page 145 of many | Previous | Next