Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. (:<) :: Expr -> Expr -> Prop

   ghc-typelits-presburger	GHC.TypeLits.Presburger.Types

   No documentation available.

2. (:<=) :: Expr -> Expr -> Prop

   ghc-typelits-presburger	GHC.TypeLits.Presburger.Types

   No documentation available.

3. (:==) :: Expr -> Expr -> Prop

   ghc-typelits-presburger	GHC.TypeLits.Presburger.Types

   No documentation available.

4. (:>) :: Expr -> Expr -> Prop

   ghc-typelits-presburger	GHC.TypeLits.Presburger.Types

   No documentation available.

5. (:>=) :: Expr -> Expr -> Prop

   ghc-typelits-presburger	GHC.TypeLits.Presburger.Types

   No documentation available.

6. (:||) :: Prop -> Prop -> Prop

   ghc-typelits-presburger	GHC.TypeLits.Presburger.Types

   No documentation available.

7. pattern (:<) :: Array a -> Array a -> Array a

   harpie	Harpie.Array

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

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

8. pattern (:>) :: Array a -> Array a -> Array a

   harpie	Harpie.Array

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

   >>> (xs:>x) = array [4] [0..3]
   
   >>> x
   UnsafeArray [] [3]
   
   >>> xs
   UnsafeArray [3] [0,1,2]
   
   >>> (xs:>x)
   UnsafeArray [4] [0,1,2,3]
   

9. 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]
   

10. 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]
    

Page 31 of many | Previous | Next