inRange -package:range

inRange :: Ix a => (a, a) -> a -> Bool
base Data.Ix GHC.Arr GHC.Ix, base-prelude BasePrelude, ghc-internal GHC.Internal.Arr GHC.Internal.Data.Ix GHC.Internal.Ix, rebase Rebase.Prelude
Returns True the given subscript lies in the range defined the bounding pair.
inRange :: Enum a => (a, a) -> a -> Bool
utility-ht Data.Ix.Enum
>>> inRange ('a','z') 'e'
True

>>> inRange ('x','z') 'a'
False
inRange :: Ord a => (a, a) -> a -> Bool
utility-ht Data.Ord.HT
limit (lower,upper) x checks whether x is in the range from lower to upper. Don't expect a sensible result for lower>upper.
inRange :: GIx a => (a, a) -> a -> Bool
generic-deriving Generics.Deriving.Enum
Returns True the given subscript lies in the range defined the bounding pair.
inRange :: (GIx a, GEq a, Generic a, Enum' (Rep a)) => (a, a) -> a -> Bool
generic-deriving Generics.Deriving.Enum
Returns True the given subscript lies in the range defined the bounding pair.
inRange :: (Ix f, Ix i) => (f i, f i) -> f i -> Bool
non-empty Data.NonEmpty.Class
inRange :: Range sh -> sh -> Bool
repa Data.Array.Repa.Repr.Partitioned
Check whether an index is within the given range.
inRange :: Refinement
clay Clay Clay.Pseudo
inrange :: Ord a => a -> (a, a) -> Bool
PSQueue Data.PSQueue.Internal
inRange :: OrdSymbolic a => a -> (a, a) -> SBool
sbv Data.SBV Data.SBV.Trans
Is the value within the allowed inclusive range?
inRange :: Bin b => b -> BinValue b -> Bool
histogram-fill Data.Histogram.Bin.Classes
Check whether value in range. Have default implementation. Should satisfy: inRange b x ⇔ toIndex b x ∈ [0,nBins b)
inRange :: Range a -> Gen a
falsify Test.Falsify.Generator
Generate value in the specified range
inRange :: Real a => KdMap a p v -> p -> p -> [(p, v)]
kdt Data.KdMap.Dynamic
Finds all point-value pairs in a KdMap with points within a given range, where the range is specified as a set of lower and upper bounds. Points are not returned in any particular order. Worst case time complexity: O(n) for n data points and a range that spans all the points.
inRange :: Real a => KdMap a p v -> p -> p -> [(p, v)]
kdt Data.KdMap.Static
Finds all point-value pairs in a KdMap with points within a given range, where the range is specified as a set of lower and upper bounds. Points are not returned in any particular order. Worst case time complexity: O(n) for n data points and a range that spans all the points. TODO: Maybe use known bounds on entire tree structure to be able to automatically count whole portions of tree as being within given range.
inRange :: Real a => KdTree a p -> p -> p -> [p]
kdt Data.KdTree.Dynamic Data.KdTree.Static
Finds all points in a KdTree with points within a given range, where the range is specified as a set of lower and upper bounds. Points are not returned in any particular order. Worst case time complexity: O(n) for n data points and a range that spans all the points.
inRange :: Ord a => a -> Range a -> Bool
ranges Data.Ranges
Tests if a given range contains a particular value.
inRange :: (Ord a, Functor b) => (a, a) -> Wizard b a -> Wizard b a
wizards System.Console.Wizard
Makes a wizard fail if it gets an ordered quantity outside of the given range.
InRange :: Word8 -> Word8 -> InSquare
redis-glob Redis.Glob.Internal
inRange_RDR :: RdrName
ghc GHC.Builtin.Names, ghc-lib-parser GHC.Builtin.Names, breakpoint Debug.Breakpoint.GhcFacade
inRangeDefault :: (GEq a, Generic a, Enum' (Rep a)) => (a, a) -> a -> Bool
generic-deriving Generics.Deriving.Enum
inRangeValName :: Name
deriving-compat Data.Deriving.Internal
inRanges :: Ord a => a -> Ranges a -> Bool
ranges Data.Ranges
Tests if any of the ranges contains a particular value.
isInRange :: UniformRange a => (a, a) -> a -> Bool
random System.Random.Stateful
A notion of (inclusive) ranges prescribed to a. Ranges are symmetric: 
isInRange (lo, hi) x == isInRange (hi, lo) x
Ranges include their endpoints: 
isInRange (lo, hi) lo == True
When endpoints coincide, there is nothing else: 
isInRange (x, x) y == x == y
Endpoints are endpoints: 
isInRange (lo, hi) x ==>
isInRange (lo, x) hi == x == hi
Ranges are transitive relations: 
isInRange (lo, hi) lo' && isInRange (lo, hi) hi' && isInRange (lo', hi') x
==> isInRange (lo, hi) x
There is a default implementation of isInRange via Generic. Other helper function that can be used for implementing this function are isInRangeOrd and isInRangeEnum. Note that the isRange method from Data.Ix is not a suitable default implementation of isInRange. Unlike isInRange, isRange is not required to be symmetric, and many isRange implementations are not symmetric in practice.
isInRange :: (UniformRange a, Generic a, GUniformRange (Rep a)) => (a, a) -> a -> Bool
random System.Random.Stateful
A notion of (inclusive) ranges prescribed to a. Ranges are symmetric: 
isInRange (lo, hi) x == isInRange (hi, lo) x
Ranges include their endpoints: 
isInRange (lo, hi) lo == True
When endpoints coincide, there is nothing else: 
isInRange (x, x) y == x == y
Endpoints are endpoints: 
isInRange (lo, hi) x ==>
isInRange (lo, x) hi == x == hi
Ranges are transitive relations: 
isInRange (lo, hi) lo' && isInRange (lo, hi) hi' && isInRange (lo', hi') x
==> isInRange (lo, hi) x
There is a default implementation of isInRange via Generic. Other helper function that can be used for implementing this function are isInRangeOrd and isInRangeEnum. Note that the isRange method from Data.Ix is not a suitable default implementation of isInRange. Unlike isInRange, isRange is not required to be symmetric, and many isRange implementations are not symmetric in practice.
isInRangeEnum :: Enum a => (a, a) -> a -> Bool
random System.Random.Stateful
Utilize Enum instance to decide if a value is within the range. Designed to be used for implementing isInRange