ap -base

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
package
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 0.5.0.1
package apelsin
package
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
package
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 :: OpenFileFlags -> Bool
unix System.Posix.IO.ByteString, unix System.Posix.IO
O_APPEND
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
package
Some instances for applicative functors and type-level composition. Forkable on github. Version 0.1.8
package applicative-numbers
package
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
package
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 0.1.0.8
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
applyWith' :: Monad m => (a -> b) -> GT m g a -> g -> m (b, g)
fgl Data.Graph.Inductive.Query.Monad
package approx-rand-test
package
Functions and utilities to perform paired and unpaired approximate randomization tests (Noreen, 1989). The utilities can also draw histograms of the applications of the test statistic to the randomized samples. For support for more file formats, install the package with the -withCairo flag. Version 0.2.1
package approximate
package
This package provides approximate discrete values and numbers. Version 0.2
package approximate-equality
package
The purpose of this module is to provide newtype wrappers that allow one to effectively override the equality operator of a value so that it is approximate rather than exact. The wrappers use type annotations to specify the tolerance; the Digits type constructor has been provided for specifying the tolerance using type-level natural numbers.  Instances for all of the classes in the numerical hierarchy have been provided for the wrappers, so the wrapped values can mostly be used in the same way as the original values. (In fact, most of the time one doesn't even have to wrap the starting values, since expressions such as (1+sqrt 2/3) are automatically wrapped thanks to the fromIntegral method of the Num typeclass.) See the documentation for Data.Eq.Approximate for more detailed information on how to use this package. New in version 1.1:  Added explicit Show constraints to the Show instances, as the Num class in the newest version of GHC (wisely) no longer includes Show as a constraint. Version 1.1
appsE :: [ExpQ] -> ExpQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
appT :: TypeQ -> TypeQ -> TypeQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
AppE :: Exp -> Exp -> Exp
template-haskell Language.Haskell.TH.Syntax, template-haskell Language.Haskell.TH
> { f x }
AppendOnWrite :: FdOption
unix System.Posix.IO.ByteString, unix System.Posix.IO
O_APPEND
package ApplePush
package
This library provides an interface to send notifications with the Apple Push Notification Service. Note: Your connection to Apple's Push Notification service must be secured with SSL. Currently, Haskell's support for SSL is incomplete, therefore you should use an SSL tunnel to connect your application to the push service, such as                       stunnel. Version 0.1
package AppleScript
package
This package enables you to compile and execute AppleScript code from Haskell, and provides support for this AppleScript code to call back into Haskell. To get started, see Foreign.AppleScript.Rich. Version 0.2.0.1
Applied :: NameIs
template-haskell Language.Haskell.TH.Syntax
AppT :: Type -> Type -> Type
template-haskell Language.Haskell.TH.Syntax, template-haskell Language.Haskell.TH
> T a b
April :: Month
old-time System.Time
module Graphics.Rendering.OpenGL.GL.Texturing.Application
OpenGL Graphics.Rendering.OpenGL.GL.Texturing.Application
This module corresponds to section 3.8.15 (Texture Application) of the OpenGL 2.1 specs.
package 3d-graphics-examples
package
This package demonstrates how to program simple interactive 3D graphics with OpenGL. It contains two programs, which are both about fractals: L-systems: generates graphics from Lindenmayer systems (L-systems). It defines a language for L-systems as an embedded DSL. Mountains: uses the generalized Brownian motion to generate graphics that resemble mountain landscapes. The original versions of these programs were written by Matthias Reisner as part of a student project at the Brandenburg University of Technology at Cottbus, Germany. Wolfgang Jeltsch, who supervised this student project, is now maintaining these programs. Version 0.0.0.0
package acme-lookofdisapproval
package
The Acme.LookOfDisapproval module provides one function ಠ_ಠ, which lets you to express your profound disapproval. Version 0.1
package Adaptive
package
This is a Haskell (plus some extensions) implementation of a library for incremental computing.  It closely follows the implementation in the nice POPL 2002 paper "Adaptive Functional Programming", by Umut Acar, Guy Blelloch and Bob Harper. Version 0.23
package Adaptive-Blaisorblade
package
This is a Haskell (plus some extensions) implementation of a library for incremental computing.  It closely follows the implementation in the nice POPL 2002 paper "Adaptive Functional Programming", by Umut Acar, Guy Blelloch and Bob Harper. This is a small fork of the original library named Adaptive, with the same interface but small adaptations to GHC 7.4. Version 0.23
package adaptive-containers
package
Self optimizing polymorphic container types. Adaptive containers are polymorphic container types that use class associated data types to specialize particular element types to a more efficient container representation. The resulting structures tend to be both more time and space efficient. A self-optimizing pair, for example, will unpack the constructors, yielding a representation for (Int,Char) requiring 8 bytes, instead of 24. This difference can be visualized. Consider the expression: > [ (x,y) | x <- [1..3], y <- [x..3] ] * [(Int,Int)]: A regular list of pairs http://code.haskell.org/~dons/images/vacuum/tuple-list.png * [Pair Int Int]: An adaptive list of pairs http://code.haskell.org/~dons/images/vacuum/pair-list.png * List (Pair Int Int): An adaptive list of adaptive pairs http://code.haskell.org/~dons/images/vacuum/list-pair.png Currently supported adaptive containers: pairs, lists, maybes Most unboxed element types are supported. Version 0.3

Show more results