Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. Bounded :: Bool -> a -> Bound a

   postgresql-typed	Database.PostgreSQL.Typed.Range

   No documentation available.

2. class Bounded a

   classy-prelude-yesod	ClassyPrelude.Yesod

   The Bounded class is used to name the upper and lower limits of a type. Ord is not a superclass of Bounded since types that are not totally ordered may also have upper and lower bounds. The Bounded class may be derived for any enumeration type; minBound is the first constructor listed in the data declaration and maxBound is the last. Bounded may also be derived for single-constructor datatypes whose constituent types are in Bounded.

3. class Bounded a

   constrained-categories	Control.Category.Constrained.Prelude

   The Bounded class is used to name the upper and lower limits of a type. Ord is not a superclass of Bounded since types that are not totally ordered may also have upper and lower bounds. The Bounded class may be derived for any enumeration type; minBound is the first constructor listed in the data declaration and maxBound is the last. Bounded may also be derived for single-constructor datatypes whose constituent types are in Bounded.

4. class Bounded a

   constrained-categories	Control.Category.Hask

   The Bounded class is used to name the upper and lower limits of a type. Ord is not a superclass of Bounded since types that are not totally ordered may also have upper and lower bounds. The Bounded class may be derived for any enumeration type; minBound is the first constructor listed in the data declaration and maxBound is the last. Bounded may also be derived for single-constructor datatypes whose constituent types are in Bounded.

5. class Bounded a

   copilot-language	Copilot.Language.Prelude

   The Bounded class is used to name the upper and lower limits of a type. Ord is not a superclass of Bounded since types that are not totally ordered may also have upper and lower bounds. The Bounded class may be derived for any enumeration type; minBound is the first constructor listed in the data declaration and maxBound is the last. Bounded may also be derived for single-constructor datatypes whose constituent types are in Bounded.

6. class Bounded a

   quaalude	Essentials

   The Bounded class is used to name the upper and lower limits of a type. Ord is not a superclass of Bounded since types that are not totally ordered may also have upper and lower bounds. The Bounded class may be derived for any enumeration type; minBound is the first constructor listed in the data declaration and maxBound is the last. Bounded may also be derived for single-constructor datatypes whose constituent types are in Bounded.

7. class Bounded a

   verset	Verset

   The Bounded class is used to name the upper and lower limits of a type. Ord is not a superclass of Bounded since types that are not totally ordered may also have upper and lower bounds. The Bounded class may be derived for any enumeration type; minBound is the first constructor listed in the data declaration and maxBound is the last. Bounded may also be derived for single-constructor datatypes whose constituent types are in Bounded.

8. class Bounded a

   xmonad-contrib	XMonad.Config.Prime

   The Bounded class is used to name the upper and lower limits of a type. Ord is not a superclass of Bounded since types that are not totally ordered may also have upper and lower bounds. The Bounded class may be derived for any enumeration type; minBound is the first constructor listed in the data declaration and maxBound is the last. Bounded may also be derived for single-constructor datatypes whose constituent types are in Bounded.

9. bounded :: Int -> Int -> Pattern a -> Pattern [a]

   turtle	Turtle.Pattern

   Apply the given pattern a number of times restricted by given lower and upper bounds, collecting the results

   >>> match (bounded 2 5 "cat") "catcatcat"
   [["cat","cat","cat"]]
   
   >>> match (bounded 2 5 "cat") "cat"
   []
   
   >>> match (bounded 2 5 "cat") "catcatcatcatcatcat"
   []
   

   bounded could be implemented naively as follows:

   bounded m n p = do
   x <- choice (map pure [m..n])
   count x p
   

10. bounded :: (PositionalSystem s, Ord α, Bounded α, Integral α, Monad μ, CharParsing μ) => s -> μ α

    data-textual	Data.Textual.Integral

    A shorthand for bounded' optMinus.

Page 5 of many | Previous | Next