Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

  1. pattern (:<) :: forall s sh st a (os :: [Nat]) (ls :: [Nat]) (ds :: [Natural]) . (KnownNats s, KnownNats sh, KnownNats st, 'True ~ Eval (InsertOk 0 st sh), s ~ Eval (IncAt 0 st), ds ~ '[0], sh ~ Eval (DeleteDims ds s), KnownNats ls, KnownNats os, Eval (SlicesOk ds os ls s) ~ 'True, os ~ Eval (Replicate (Eval (Rank ds)) 1), ls ~ Eval (GetLastPositions ds s), st ~ Eval (SetDims ds ls s)) => Array sh a -> Array st a -> Array s a

    harpie Harpie.Fixed

    Convenience pattern for row extraction and consolidation at the beginning of an Array. 

    >>> (x:<xs) = array @'[4] [0..3]

>>> toDynamic x
UnsafeArray [] [0]

>>> toDynamic xs
UnsafeArray [3] [1,2,3]

>>> toDynamic (x:<xs)
UnsafeArray [4] [0,1,2,3]

  2. pattern (:>) :: forall si sl s a (ds :: [Nat]) (ls :: [Nat]) (os :: [Nat]) . (KnownNats si, KnownNats sl, KnownNats s, 'True ~ Eval (InsertOk 0 si sl), s ~ Eval (IncAt 0 si), KnownNats ds, KnownNats ls, KnownNats os, sl ~ Eval (DeleteDim 0 si), ds ~ '[0], Eval (SlicesOk ds os ls s) ~ 'True, os ~ Eval (Replicate (Eval (Rank ds)) 0), ls ~ Eval (GetLastPositions ds s), si ~ Eval (SetDims ds ls s), sl ~ Eval (DeleteDims ds s)) => Array si a -> Array sl a -> Array s a

    harpie Harpie.Fixed

    Convenience pattern for row extraction and consolidation at the end of an Array. 

    >>> (xs:>x) = array @'[4] [0..3]

>>> toDynamic x
UnsafeArray [] [3]

>>> toDynamic xs
UnsafeArray [3] [0,1,2]

>>> toDynamic (xs:>x)
UnsafeArray [4] [0,1,2,3]

  3. (:=) :: Option m a -> a -> OptionVal (m :: Type -> Type)

    hint Language.Haskell.Interpreter

    No documentation available.

  4. type (:::) = 'Required

    json-spec Data.JsonSpec

    Alias for Required.

  5. type (::?) = 'Optional

    json-spec Data.JsonSpec

    Alias for Optional.

  6. (:|) :: a -> Sig s es a r -> ISig s (es :: Set Type) a r

    moffy Control.Moffy.Internal.Sig.Type

    No documentation available.

  7. pattern (:<||) :: a -> Seq a -> NESeq a

    nonempty-containers Data.Sequence.NonEmpty

    O(1). An abstract constructor for an NESeq that consists of a "head" a and a "tail" Seq a. Similar to :| for NonEmpty. Can be used to match on the head and tail of an NESeq, and also used to construct an NESeq by consing an item to the beginnong of a Seq, ensuring that the result is non-empty.

  8. pattern (:||>) :: Seq a -> a -> NESeq a

    nonempty-containers Data.Sequence.NonEmpty

    O(1). An abstract constructor for an NESeq that consists of a "init" Seq a and a "last" a. Similar to :| for NonEmpty, but at the end of the list instead of at the beginning. Can be used to match on the init and last of an NESeq, and also used to construct an NESeq by snocing an item to the end of a Seq, ensuring that the result is non-empty.

  9. pattern (:<||) :: a -> Seq a -> NESeq a

    nonempty-containers Data.Sequence.NonEmpty.Internal

    O(1). An abstract constructor for an NESeq that consists of a "head" a and a "tail" Seq a. Similar to :| for NonEmpty. Can be used to match on the head and tail of an NESeq, and also used to construct an NESeq by consing an item to the beginnong of a Seq, ensuring that the result is non-empty.

  10. pattern (:||>) :: Seq a -> a -> NESeq a

    nonempty-containers Data.Sequence.NonEmpty.Internal

    O(1). An abstract constructor for an NESeq that consists of a "init" Seq a and a "last" a. Similar to :| for NonEmpty, but at the end of the list instead of at the beginning. Can be used to match on the init and last of an NESeq, and also used to construct an NESeq by snocing an item to the end of a Seq, ensuring that the result is non-empty.

Page 32 of many | Previous | Next