any -parsec -network
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.
Determines whether any element of the structure satisfies the predicate.
Applied to a predicate and a ByteString, any determines if any element of the ByteString satisfies the predicate.
O(n) any p t determines whether any character in the Text t satisifes the predicate p. Subject to fusion.
O(n) Applied to a predicate and a ByteString, any determines if any element of the ByteString satisfies the predicate.
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.
Boolean monoid under disjunction.
Parses zero or more occurrences of the given parser.
Parses one or more occurrences of the given parser.
manyTill p end parses zero or more occurrences of p, until end succeeds. Returns a list of values returned by p.
Like many, but discards the result.
Like many1, but discards the result.
Replicates a withXXX combinator over a list of objects, yielding a list of marshalled objects
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.
Show more results