any -parsec

any :: (a -> Bool) -> [a] -> Bool
base Prelude, base Data.List
Applied to a predicate and a list, any determines if any element of the list satisfies the predicate. For the result to be False, the list must be finite; True, however, results from a True value for the predicate applied to an element at a finite index of a finite or infinite list.
Any :: Bool -> Any
base Data.Monoid
newtype Any
base Data.Monoid
Boolean monoid under disjunction.
any :: Foldable t => (a -> Bool) -> t a -> Bool
base Data.Foldable
Determines whether any element of the structure satisfies the predicate.
any :: (Char -> Bool) -> ByteString -> Bool
bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy.Char8
Applied to a predicate and a ByteString, any determines if any element of the ByteString satisfies the predicate.
any :: (Char -> Bool) -> Text -> Bool
text Data.Text, text Data.Text.Lazy
O(n) any p t determines whether any character in the Text t satisifes the predicate p. Subject to fusion.
any :: (Word8 -> Bool) -> ByteString -> Bool
bytestring Data.ByteString, bytestring Data.ByteString.Lazy
O(n) Applied to a predicate and a ByteString, any determines if any element of the ByteString satisfies the predicate.
aNY_PORT :: PortNumber
network Network.Socket
package anydbm
package
This module provides a generic infrastructure for supporting storage of hash-like items with String-to-String mappings.  It can be used for in-memory or on-disk storage. Two simple backend drivers are included with this package: one that is RAM-only, and one that is persistent and disk-backed. The hdbc-anydbm package provides another driver, which lets you use simple tables in any SQL database to provide a DBM-like interface. MissingPy also provides a Python driver which lets you use any Python anydbm driver under Haskell AnyDBM. Version 1.0.7
eTOOMANYREFS :: Errno
base Foreign.C.Error
getAny :: Any -> Bool
base Data.Monoid
many :: ReadP a -> ReadP [a]
base Text.ParserCombinators.ReadP
Parses zero or more occurrences of the given parser.
many :: Alternative f => f a -> f [a]
base Control.Applicative
many1 :: ReadP a -> ReadP [a]
base Text.ParserCombinators.ReadP
Parses one or more occurrences of the given parser.
manyTill :: ReadP a -> ReadP end -> ReadP [a]
base Text.ParserCombinators.ReadP
manyTill p end parses zero or more occurrences of p, until end succeeds. Returns a list of values returned by p.
skipMany :: ReadP a -> ReadP ()
base Text.ParserCombinators.ReadP
Like many, but discards the result.
skipMany1 :: ReadP a -> ReadP ()
base Text.ParserCombinators.ReadP
Like many1, but discards the result.
withMany :: (a -> (b -> res) -> res) -> [a] -> ([b] -> res) -> res
base Foreign.Marshal.Utils
Replicates a withXXX combinator over a list of objects, yielding a list of marshalled objects
addGregorianYearsClip :: Integer -> Day -> Day
time Data.Time.Calendar
Add years, matching month and day, with Feb 29th clipped to Feb 28th if necessary. For instance, 2004-02-29 + 2 years = 2006-02-28.
addGregorianYearsRollOver :: Integer -> Day -> Day
time Data.Time.Calendar
Add years, matching month and day, with Feb 29th rolled over to Mar 1st if necessary. For instance, 2004-02-29 + 2 years = 2006-03-01.
addJulianYearsClip :: Integer -> Day -> Day
time Data.Time.Calendar.Julian
Add years, matching month and day, with Feb 29th clipped to Feb 28th if necessary. For instance, 2004-02-29 + 2 years = 2006-02-28.
addJulianYearsRollOver :: Integer -> Day -> Day
time Data.Time.Calendar.Julian
Add years, matching month and day, with Feb 29th rolled over to Mar 1st if necessary. For instance, 2004-02-29 + 2 years = 2006-03-01.
fromJulianYearAndDay :: Integer -> Int -> Day
time Data.Time.Calendar.Julian
convert from proleptic Julian year and day format. Invalid day numbers will be clipped to the correct range (1 to 365 or 366).
fromJulianYearAndDayValid :: Integer -> Int -> Maybe Day
time Data.Time.Calendar.Julian
convert from proleptic Julian year and day format. Invalid day numbers will return Nothing
package Ganymede
package
Ganymede is an Io interpreter, originally based on Martin ""vague"" Sandin's Amalthea, which is an Io interpreter written in OCaml. There are some differences since Amalthea is based on the description of Io found in Raphael Finkel's 1996 book  "Advanced Programming Language Design" (APLD), whereas Ganymede is more faithful to Raph Levien's original 1989 paper. Version 0.0.0.5
getAnyProcessStatus :: Bool -> Bool -> IO (Maybe (ProcessID, ProcessStatus))
unix System.Posix.Process.ByteString, unix System.Posix.Process
getAnyProcessStatus blk stopped calls waitpid, returning Just (pid, tc), the ProcessID and ProcessStatus for any child process if one is available, Nothing otherwise. If blk is False, then WNOHANG is set in the options for waitpid, otherwise not. If stopped is True, then WUNTRACED is set in the options for waitpid, otherwise not.
package hp2any-core
package
This is the core library of the hp2any suite. It makes heap profiles available during runtime through a simple interface, optionally managing all the data in the background. It can also process archived profiler output and present it in a structured form. Version 0.11.1
package hp2any-graph
package
This package contains two utilities: a grapher that can display heap profiles in real time both for local and remote processes, and a relay application the grapher connects to in the latter case. Additionally, the graphing capability is exposed to other programs as well in the form of a library module. Version 0.5.3
package hp2any-manager
package
This is a program that can display several heap profiles at the same time in the style of a tiling window manager. Version 0.4.5
iN6ADDR_ANY :: HostAddress6
network Network.Socket
The IPv6 wild card address.
iNADDR_ANY :: HostAddress
network Network.Socket
The IPv4 wild card address.
package manatee-anything
package
manatee-anything is interactive plugin for Manatee (Haskell/Gtk+ Integrated Live Environment) Video at (Select 720p HD) at : http://www.youtube.com/watch?v=weS6zys3U8k http://www.youtube.com/watch?v=A3DgKDVkyeM http://v.youku.com/v_show/id_XMjI2MDMzODI4.html Screenshots at : http://goo.gl/MkVw Manual at : http://haskell.org/haskellwiki/Manatee IRC channel: irc.freenode.net 6667 ##manatee Mailing-List: manatee-user@googlegroups.com manatee-develop@googlegroups.com Version 0.0.8
matchAny :: Graph gr => gr a b -> GDecomp gr a b
fgl Data.Graph.Inductive.Graph
matchAnyM :: GraphM m gr => m (gr a b) -> m (GDecomp gr a b)
fgl Data.Graph.Inductive.Monad
sendMany :: Socket -> [ByteString] -> IO ()
network Network.Socket.ByteString
Send data to the socket. The socket must be in a connected state. The data is sent as if the parts have been concatenated. This function continues to send data until either all data has been sent or an error occurs. On error, an exception is raised, and there is no way to determine how much data, if any, was successfully sent.
sendManyTo :: Socket -> [ByteString] -> SockAddr -> IO ()
network Network.Socket.ByteString
Send data to the socket. The recipient can be specified explicitly, so the socket need not be in a connected state. The data is sent as if the parts have been concatenated. This function continues to send data until either all data has been sent or an error occurs. On error, an exception is raised, and there is no way to determine how much data, if any, was successfully sent.
showJulianYearAndDay :: Day -> String
time Data.Time.Calendar.Julian
show in proleptic Julian year and day format (yyyy-ddd)
toJulianYearAndDay :: Day -> (Integer, Int)
time Data.Time.Calendar.Julian
convert to proleptic Julian year and day format. First element of result is year (proleptic Julian calendar), second is the day of the year, with 1 for Jan 1, and 365 (or 366 in leap years) for Dec 31.