ap -base -unix

ap :: Graph gr => gr a b -> [Node]
fgl Data.Graph.Inductive.Query.ArtPoint
Finds the articulation points for a connected undirected graph, by using the low numbers criteria: a) The root node is an articulation point iff it has two or more children. b) An non-root node v is an articulation point iff there exists at least one child w of v such that lowNumber(w) >= dfsNumber(v).
package apache-md5
Haskell implementation of Apache HTTP server specific MD5 digest algorithm that uses OpenSSL MD5() function. README and ChangeLog can be found in source code package and on GitHub: * https://github.com/trskop/apache-md5/blob/master/README.md * https://github.com/trskop/apache-md5/blob/master/ChangeLog.md Version
package apelsin
A gtk2hs server and clan browser for the open source game Tremulous http://tremulous.net. Both Tremulous 1.1 and GPP are supported. Features filtering, player search, a list of online clan members, a clan list and basic perferences. Version 1.2.3
package appar
A simple applicative parser in Parsec style Version 0.1.4
appE :: ExpQ -> ExpQ -> ExpQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
append :: ByteString -> ByteString -> ByteString
bytestring Data.ByteString, bytestring Data.ByteString.Char8
O(n) Append two ByteStrings
append :: ByteString -> ByteString -> ByteString
bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
O(n\c)/ Append two ByteStrings
append :: Text -> Text -> Text
text Data.Text
O(n) Appends one Text to the other by copying both of them into a new Text. Subject to fusion.
append :: Text -> Text -> Text
text Data.Text.Lazy
O(n\c)/ Appends one Text to another. Subject to fusion.
appendFile :: FilePath -> ByteString -> IO ()
bytestring Data.ByteString, bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
Append a ByteString to a file.
appendFile :: FilePath -> Text -> IO ()
text Data.Text.IO, text Data.Text.Lazy.IO
Write a string the end of a file.
appK :: Kind -> Kind -> Kind
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
applet :: Html -> Html
html Text.Html, xhtml Text.XHtml.Transitional
package applicative-extras
Some instances for applicative functors and type-level composition. Forkable on github. Version 0.1.8
package applicative-numbers
Any applicative functor can be given numeric instances in a boilerplate way. The applicative-numbers package provides an include file that makes it a snap to define these instances. See Data.Numeric.Function for an example. Project wiki page: http://haskell.org/haskellwiki/applicative-numbers Copyright 2009-2013 Conal Elliott; BSD3 license. Instances of Num classes for applicative functors.  To be #include'd after defining APPLICATIVE as the applicative functor name and CONSTRAINTS as a list of constraints, which must carry its own trailing comma if non-empty. The APPLICATIVE symbol gets #undef'd at the end of the include file, so that multiple includes are convenient. For instance, @ #define INSTANCE_Ord #define INSTANCE_Enum #define APPLICATIVE Vec2 #include "ApplicativeNumeric-inc.hs" #define APPLICATIVE Vec3 #include "ApplicativeNumeric-inc.hs" #define APPLICATIVE Vec4 #include "ApplicativeNumeric-inc.hs" @ You'll also have to import pure and liftA2 from Control.Applicative and specify the FlexibleContexts language extension (due to an implementation hack). Some instances are generated only if a corresponding CPP symbol is defined: INSTANCE_Eq, INSTANCE_Ord, INSTANCE_Show, INSTANCE_Enum Version 0.1.2
package applicative-quoters
Quasiquoters taken from Matt Morrow's haskell-src-meta to implement Conor McBride's idiom brackets, and a do-notation that only requires Applicative (and is correspondingly less powerful). applicative-quoters currently has no maintainer: if it is broken and you want it to be fixed, then fix it! Version
apply :: Fun a b -> (a -> b)
QuickCheck Test.QuickCheck.Function
apply :: GT m g a -> m g -> m (a, g)
fgl Data.Graph.Inductive.Query.Monad
apply' :: Monad m => GT m g a -> g -> m (a, g)
fgl Data.Graph.Inductive.Query.Monad
applyWith :: Monad m => (a -> b) -> GT m g a -> m g -> m (b, g)
fgl Data.Graph.Inductive.Query.Monad

Show more results