Hoogle Search

Within LTS Haskell 24.65 (ghc-9.10.3)

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

Exact lookup

1. slidingWindowMaxBy :: forall (m :: Type -> Type) a b . Monad m => (a -> a -> Ordering) -> Int -> Stream (Of a) m b -> Stream (Of a) m b

   streaming	Streaming.Prelude

   slidingWindowMaxBy finds the maximum in every sliding window of n elements of a stream according to the given comparison function (which should define a total ordering). See notes above about elements that are equal. It satisfies:

   slidingWindowMaxBy f n s = map (maximumBy f) (slidingWindow n s)
   

   Except that it is far more efficient, especially when the window size is large: it calls the comparison function O(m) times overall where m is the total number of elements in the stream.

2. slidingWindowMaxOn :: forall (m :: Type -> Type) p a b . (Monad m, Ord p) => (a -> p) -> Int -> Stream (Of a) m b -> Stream (Of a) m b

   streaming	Streaming.Prelude

   slidingWindowMaxOn finds the maximum in every sliding window of n elements of a stream according to the given projection function. See notes above about elements that are equal. It satisfies:

   slidingWindowMaxOn f n s = map (maximumOn (comparing f)) (slidingWindow n s)
   

   Except that it is far more efficient, especially when the window size is large: it calls compare on the projected value O(m) times overall where m is the total number of elements in the stream, and it calls the projection function exactly m times.

3. slidingWindowMin :: forall (m :: Type -> Type) a b . (Monad m, Ord a) => Int -> Stream (Of a) m b -> Stream (Of a) m b

   streaming	Streaming.Prelude

   slidingWindowMin finds the minimum in every sliding window of n elements of a stream. If within a window there are multiple elements that are the least, it prefers the first occurrence (if you prefer to have the last occurrence, use the max version and flip your comparator). It satisfies:

   slidingWindowMin n s = map minimum (slidingWindow n s)
   

   Except that it is far more efficient, especially when the window size is large: it calls compare O(m) times overall where m is the total number of elements in the stream.

4. slidingWindowMinBy :: forall (m :: Type -> Type) a b . Monad m => (a -> a -> Ordering) -> Int -> Stream (Of a) m b -> Stream (Of a) m b

   streaming	Streaming.Prelude

   slidingWindowMinBy finds the minimum in every sliding window of n elements of a stream according to the given comparison function (which should define a total ordering). See notes above about elements that are equal. It satisfies:

   slidingWindowMinBy f n s = map (minimumBy f) (slidingWindow n s)
   

   Except that it is far more efficient, especially when the window size is large: it calls the comparison function O(m) times overall where m is the total number of elements in the stream.

5. slidingWindowMinOn :: forall (m :: Type -> Type) p a b . (Monad m, Ord p) => (a -> p) -> Int -> Stream (Of a) m b -> Stream (Of a) m b

   streaming	Streaming.Prelude

   slidingWindowMinOn finds the minimum in every sliding window of n elements of a stream according to the given projection function. See notes above about elements that are equal. It satisfies:

   slidingWindowMinOn f n s = map (minimumOn (comparing f)) (slidingWindow n s)
   

   Except that it is far more efficient, especially when the window size is large: it calls compare on the projected value O(m) times overall where m is the total number of elements in the stream, and it calls the projection function exactly m times.

6. width :: Window a -> !a

   terminal-size	System.Console.Terminal.Size

   No documentation available.

7. validateEntry :: UTCTime -> CacheEntry body -> Maybe (Response body)

   wreq	Network.Wreq.Cache

   No documentation available.

8. class Semigroup a => Monoid a

   basement	Basement.Compat.Base

   The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

   • Right identity x <> mempty = x
   • Left identity mempty <> x = x
   • Associativity x <> (y <> z) = (x <> y) <> z (Semigroup law)
   • Concatenation mconcat = foldr (<>) mempty
   You can alternatively define mconcat instead of mempty, in which case the laws are:
   • Unit mconcat (pure x) = x
   • Multiplication mconcat (join xss) = mconcat (fmap mconcat xss)
   • Subclass mconcat (toList xs) = sconcat xs
   The method names refer to the monoid of lists under concatenation, but there are many other instances. Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product. NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

9. runIdentity :: Identity a -> a

   basement	Basement.Compat.Identity

   No documentation available.

10. data InvalidRecast

    basement	Basement.Exception

    No documentation available.

Page 780 of many | Previous | Next