orthotope 0.1.7.0 → 0.1.7.1
raw patch · 1 files changed
+2/−2 lines, 1 filesdep ~QuickCheckPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: QuickCheck
API changes (from Hackage documentation)
- Data.Array.Internal: [_bmBars, _bmUnicode, _bmHeader] :: BoxMode -> Bool
- Data.Array.Internal.DynamicG: type VecElem v :: Type -> Constraint
- Data.Array.Internal.RankedG: type VecElem v :: Type -> Constraint
- Data.Array.Internal.ShapedG: type VecElem v :: Type -> Constraint
+ Data.Array.DynamicG: type family VecElem (v :: Type -> Type) :: Type -> Constraint
+ Data.Array.Internal: [_bmBars] :: BoxMode -> Bool
+ Data.Array.Internal: [_bmHeader] :: BoxMode -> Bool
+ Data.Array.Internal: [_bmUnicode] :: BoxMode -> Bool
+ Data.Array.Internal: type family VecElem (v :: Type -> Type) :: Type -> Constraint
+ Data.Array.Internal.DynamicG: type family VecElem (v :: Type -> Type) :: Type -> Constraint
+ Data.Array.Internal.RankedG: type family VecElem (v :: Type -> Type) :: Type -> Constraint
+ Data.Array.RankedG: type family VecElem (v :: Type -> Type) :: Type -> Constraint
- Data.Array.Dynamic: class Vector v
+ Data.Array.Dynamic: class Vector (v :: Type -> Type)
- Data.Array.DynamicG: allA :: (Vector v, VecElem v a) => (a -> Bool) -> Array v a -> Bool
+ Data.Array.DynamicG: allA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => (a -> Bool) -> Array v a -> Bool
- Data.Array.DynamicG: allSameA :: (Vector v, VecElem v a, Eq a) => Array v a -> Bool
+ Data.Array.DynamicG: allSameA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Eq a) => Array v a -> Bool
- Data.Array.DynamicG: anyA :: (Vector v, VecElem v a) => (a -> Bool) -> Array v a -> Bool
+ Data.Array.DynamicG: anyA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => (a -> Bool) -> Array v a -> Bool
- Data.Array.DynamicG: append :: (HasCallStack, Vector v, VecElem v a) => Array v a -> Array v a -> Array v a
+ Data.Array.DynamicG: append :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => Array v a -> Array v a -> Array v a
- Data.Array.DynamicG: broadcast :: (HasCallStack, Vector v, VecElem v a) => [Int] -> ShapeL -> Array v a -> Array v a
+ Data.Array.DynamicG: broadcast :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => [Int] -> ShapeL -> Array v a -> Array v a
- Data.Array.DynamicG: class Vector v where {
+ Data.Array.DynamicG: class Vector (v :: Type -> Type) where {
- Data.Array.DynamicG: concatOuter :: (HasCallStack, Vector v, VecElem v a) => [Array v a] -> Array v a
+ Data.Array.DynamicG: concatOuter :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => [Array v a] -> Array v a
- Data.Array.DynamicG: constant :: (HasCallStack, Vector v, VecElem v a) => ShapeL -> a -> Array v a
+ Data.Array.DynamicG: constant :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => ShapeL -> a -> Array v a
- Data.Array.DynamicG: data Array v a
+ Data.Array.DynamicG: data Array (v :: Type -> Type) a
- Data.Array.DynamicG: foldrA :: (Vector v, VecElem v a) => (a -> b -> b) -> b -> Array v a -> b
+ Data.Array.DynamicG: foldrA :: forall (v :: Type -> Type) a b. (Vector v, VecElem v a) => (a -> b -> b) -> b -> Array v a -> b
- Data.Array.DynamicG: fromList :: (HasCallStack, Vector v, VecElem v a) => ShapeL -> [a] -> Array v a
+ Data.Array.DynamicG: fromList :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => ShapeL -> [a] -> Array v a
- Data.Array.DynamicG: generate :: (Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> Array v a
+ Data.Array.DynamicG: generate :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> Array v a
- Data.Array.DynamicG: index :: (HasCallStack, Vector v) => Array v a -> Int -> Array v a
+ Data.Array.DynamicG: index :: forall (v :: Type -> Type) a. (HasCallStack, Vector v) => Array v a -> Int -> Array v a
- Data.Array.DynamicG: iota :: forall v a. (Vector v, VecElem v a, Enum a, Num a) => Int -> Array v a
+ Data.Array.DynamicG: iota :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Enum a, Num a) => Int -> Array v a
- Data.Array.DynamicG: iterateN :: forall v a. (Vector v, VecElem v a) => Int -> (a -> a) -> a -> Array v a
+ Data.Array.DynamicG: iterateN :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Int -> (a -> a) -> a -> Array v a
- Data.Array.DynamicG: mapA :: (Vector v, VecElem v a, VecElem v b) => (a -> b) -> Array v a -> Array v b
+ Data.Array.DynamicG: mapA :: forall (v :: Type -> Type) a b. (Vector v, VecElem v a, VecElem v b) => (a -> b) -> Array v a -> Array v b
- Data.Array.DynamicG: maximumA :: (HasCallStack, Vector v, VecElem v a, Ord a) => Array v a -> a
+ Data.Array.DynamicG: maximumA :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, Ord a) => Array v a -> a
- Data.Array.DynamicG: minimumA :: (HasCallStack, Vector v, VecElem v a, Ord a) => Array v a -> a
+ Data.Array.DynamicG: minimumA :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, Ord a) => Array v a -> a
- Data.Array.DynamicG: normalize :: (Vector v, VecElem v a) => Array v a -> Array v a
+ Data.Array.DynamicG: normalize :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Array v a -> Array v a
- Data.Array.DynamicG: pad :: forall a v. (Vector v, VecElem v a) => [(Int, Int)] -> a -> Array v a -> Array v a
+ Data.Array.DynamicG: pad :: forall a (v :: Type -> Type). (Vector v, VecElem v a) => [(Int, Int)] -> a -> Array v a -> Array v a
- Data.Array.DynamicG: productA :: (Vector v, VecElem v a, Num a) => Array v a -> a
+ Data.Array.DynamicG: productA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Num a) => Array v a -> a
- Data.Array.DynamicG: rank :: Array v a -> Int
+ Data.Array.DynamicG: rank :: forall (v :: Type -> Type) a. Array v a -> Int
- Data.Array.DynamicG: ravel :: (HasCallStack, Vector v, Vector v', VecElem v a, VecElem v' (Array v a)) => Array v' (Array v a) -> Array v a
+ Data.Array.DynamicG: ravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a. (HasCallStack, Vector v, Vector v', VecElem v a, VecElem v' (Array v a)) => Array v' (Array v a) -> Array v a
- Data.Array.DynamicG: reduce :: (Vector v, VecElem v a) => (a -> a -> a) -> a -> Array v a -> Array v a
+ Data.Array.DynamicG: reduce :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => (a -> a -> a) -> a -> Array v a -> Array v a
- Data.Array.DynamicG: rerank :: (HasCallStack, Vector v, Vector v', VecElem v a, VecElem v' b) => Int -> (Array v a -> Array v' b) -> Array v a -> Array v' b
+ Data.Array.DynamicG: rerank :: forall (v :: Type -> Type) (v' :: Type -> Type) a b. (HasCallStack, Vector v, Vector v', VecElem v a, VecElem v' b) => Int -> (Array v a -> Array v' b) -> Array v a -> Array v' b
- Data.Array.DynamicG: rerank2 :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c) => Int -> (Array v a -> Array v b -> Array v c) -> Array v a -> Array v b -> Array v c
+ Data.Array.DynamicG: rerank2 :: forall (v :: Type -> Type) a b c. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c) => Int -> (Array v a -> Array v b -> Array v c) -> Array v a -> Array v b -> Array v c
- Data.Array.DynamicG: reshape :: (HasCallStack, Vector v, VecElem v a) => ShapeL -> Array v a -> Array v a
+ Data.Array.DynamicG: reshape :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => ShapeL -> Array v a -> Array v a
- Data.Array.DynamicG: rev :: HasCallStack => [Int] -> Array v a -> Array v a
+ Data.Array.DynamicG: rev :: forall (v :: Type -> Type) a. HasCallStack => [Int] -> Array v a -> Array v a
- Data.Array.DynamicG: rotate :: (HasCallStack, Vector v, VecElem v a) => Int -> Int -> Array v a -> Array v a
+ Data.Array.DynamicG: rotate :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => Int -> Int -> Array v a -> Array v a
- Data.Array.DynamicG: scalar :: (Vector v, VecElem v a) => a -> Array v a
+ Data.Array.DynamicG: scalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => a -> Array v a
- Data.Array.DynamicG: shapeL :: Array v a -> ShapeL
+ Data.Array.DynamicG: shapeL :: forall (v :: Type -> Type) a. Array v a -> ShapeL
- Data.Array.DynamicG: size :: Array v a -> Int
+ Data.Array.DynamicG: size :: forall (v :: Type -> Type) a. Array v a -> Int
- Data.Array.DynamicG: slice :: HasCallStack => [(Int, Int)] -> Array v a -> Array v a
+ Data.Array.DynamicG: slice :: forall (v :: Type -> Type) a. HasCallStack => [(Int, Int)] -> Array v a -> Array v a
- Data.Array.DynamicG: stretch :: HasCallStack => ShapeL -> Array v a -> Array v a
+ Data.Array.DynamicG: stretch :: forall (v :: Type -> Type) a. HasCallStack => ShapeL -> Array v a -> Array v a
- Data.Array.DynamicG: stretchOuter :: HasCallStack => Int -> Array v a -> Array v a
+ Data.Array.DynamicG: stretchOuter :: forall (v :: Type -> Type) a. HasCallStack => Int -> Array v a -> Array v a
- Data.Array.DynamicG: stride :: (HasCallStack, Vector v) => [Int] -> Array v a -> Array v a
+ Data.Array.DynamicG: stride :: forall (v :: Type -> Type) a. (HasCallStack, Vector v) => [Int] -> Array v a -> Array v a
- Data.Array.DynamicG: sumA :: (Vector v, VecElem v a, Num a) => Array v a -> a
+ Data.Array.DynamicG: sumA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Num a) => Array v a -> a
- Data.Array.DynamicG: toList :: (Vector v, VecElem v a) => Array v a -> [a]
+ Data.Array.DynamicG: toList :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Array v a -> [a]
- Data.Array.DynamicG: transpose :: HasCallStack => [Int] -> Array v a -> Array v a
+ Data.Array.DynamicG: transpose :: forall (v :: Type -> Type) a. HasCallStack => [Int] -> Array v a -> Array v a
- Data.Array.DynamicG: traverseA :: (Vector v, VecElem v a, VecElem v b, Applicative f) => (a -> f b) -> Array v a -> f (Array v b)
+ Data.Array.DynamicG: traverseA :: forall (v :: Type -> Type) a b f. (Vector v, VecElem v a, VecElem v b, Applicative f) => (a -> f b) -> Array v a -> f (Array v b)
- Data.Array.DynamicG: type VecElem v :: Type -> Constraint;
+ Data.Array.DynamicG: type VecElem (v :: Type -> Type) :: Type -> Constraint;
- Data.Array.DynamicG: unScalar :: (HasCallStack, Vector v, VecElem v a) => Array v a -> a
+ Data.Array.DynamicG: unScalar :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => Array v a -> a
- Data.Array.DynamicG: unravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array v a)) => Array v a -> Array v' (Array v a)
+ Data.Array.DynamicG: unravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a. (Vector v, Vector v', VecElem v a, VecElem v' (Array v a)) => Array v a -> Array v' (Array v a)
- Data.Array.DynamicG: update :: (HasCallStack, Vector v, VecElem v a) => Array v a -> [([Int], a)] -> Array v a
+ Data.Array.DynamicG: update :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => Array v a -> [([Int], a)] -> Array v a
- Data.Array.DynamicG: window :: (HasCallStack, Vector v) => [Int] -> Array v a -> Array v a
+ Data.Array.DynamicG: window :: forall (v :: Type -> Type) a. (HasCallStack, Vector v) => [Int] -> Array v a -> Array v a
- Data.Array.DynamicG: zipWith3A :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => (a -> b -> c -> d) -> Array v a -> Array v b -> Array v c -> Array v d
+ Data.Array.DynamicG: zipWith3A :: forall (v :: Type -> Type) a b c d. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => (a -> b -> c -> d) -> Array v a -> Array v b -> Array v c -> Array v d
- Data.Array.DynamicG: zipWith4A :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e) => (a -> b -> c -> d -> e) -> Array v a -> Array v b -> Array v c -> Array v d -> Array v e
+ Data.Array.DynamicG: zipWith4A :: forall (v :: Type -> Type) a b c d e. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e) => (a -> b -> c -> d -> e) -> Array v a -> Array v b -> Array v c -> Array v d -> Array v e
- Data.Array.DynamicG: zipWith5A :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e, VecElem v f) => (a -> b -> c -> d -> e -> f) -> Array v a -> Array v b -> Array v c -> Array v d -> Array v e -> Array v f
+ Data.Array.DynamicG: zipWith5A :: forall (v :: Type -> Type) a b c d e f. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e, VecElem v f) => (a -> b -> c -> d -> e -> f) -> Array v a -> Array v b -> Array v c -> Array v d -> Array v e -> Array v f
- Data.Array.DynamicG: zipWithA :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c) => (a -> b -> c) -> Array v a -> Array v b -> Array v c
+ Data.Array.DynamicG: zipWithA :: forall (v :: Type -> Type) a b c. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c) => (a -> b -> c) -> Array v a -> Array v b -> Array v c
- Data.Array.DynamicS: bitcast :: forall a b. (HasCallStack, Unbox a, Unbox b) => Array a -> Array b
+ Data.Array.DynamicS: bitcast :: (HasCallStack, Unbox a, Unbox b) => Array a -> Array b
- Data.Array.DynamicS: class () => Storable a
+ Data.Array.DynamicS: class Storable a
- Data.Array.DynamicS: class Vector v
+ Data.Array.DynamicS: class Vector (v :: Type -> Type)
- Data.Array.DynamicU: class Vector v
+ Data.Array.DynamicU: class Vector (v :: Type -> Type)
- Data.Array.Internal: BoxMode :: Bool -> BoxMode
+ Data.Array.Internal: BoxMode :: Bool -> Bool -> Bool -> BoxMode
- Data.Array.Internal: T :: ![Int] -> !Int -> !v a -> T v a
+ Data.Array.Internal: T :: ![Int] -> !Int -> !v a -> T (v :: Type -> Type) a
- Data.Array.Internal: [offset] :: T v a -> !Int
+ Data.Array.Internal: [offset] :: T (v :: Type -> Type) a -> !Int
- Data.Array.Internal: [strides] :: T v a -> ![Int]
+ Data.Array.Internal: [strides] :: T (v :: Type -> Type) a -> ![Int]
- Data.Array.Internal: [values] :: T v a -> !v a
+ Data.Array.Internal: [values] :: T (v :: Type -> Type) a -> !v a
- Data.Array.Internal: allSameT :: (Vector v, VecElem v a, Eq a) => ShapeL -> T v a -> Bool
+ Data.Array.Internal: allSameT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Eq a) => ShapeL -> T v a -> Bool
- Data.Array.Internal: allT :: (Vector v, VecElem v a) => ShapeL -> (a -> Bool) -> T v a -> Bool
+ Data.Array.Internal: allT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => ShapeL -> (a -> Bool) -> T v a -> Bool
- Data.Array.Internal: anyT :: (Vector v, VecElem v a) => ShapeL -> (a -> Bool) -> T v a -> Bool
+ Data.Array.Internal: anyT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => ShapeL -> (a -> Bool) -> T v a -> Bool
- Data.Array.Internal: class Vector v where {
+ Data.Array.Internal: class Vector (v :: Type -> Type) where {
- Data.Array.Internal: compareT :: (Vector v, VecElem v a, Ord a, Ord (v a)) => ShapeL -> T v a -> T v a -> Ordering
+ Data.Array.Internal: compareT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Ord a, Ord (v a)) => ShapeL -> T v a -> T v a -> Ordering
- Data.Array.Internal: constantT :: (Vector v, VecElem v a) => ShapeL -> a -> T v a
+ Data.Array.Internal: constantT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => ShapeL -> a -> T v a
- Data.Array.Internal: data T v a
+ Data.Array.Internal: data T (v :: Type -> Type) a
- Data.Array.Internal: equalT :: (Vector v, VecElem v a, Eq a, Eq (v a)) => ShapeL -> T v a -> T v a -> Bool
+ Data.Array.Internal: equalT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Eq a, Eq (v a)) => ShapeL -> T v a -> T v a -> Bool
- Data.Array.Internal: foldrT :: (Vector v, VecElem v a) => ShapeL -> (a -> b -> b) -> b -> T v a -> b
+ Data.Array.Internal: foldrT :: forall (v :: Type -> Type) a b. (Vector v, VecElem v a) => ShapeL -> (a -> b -> b) -> b -> T v a -> b
- Data.Array.Internal: fromListT :: (Vector v, VecElem v a) => [Int] -> [a] -> T v a
+ Data.Array.Internal: fromListT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => [Int] -> [a] -> T v a
- Data.Array.Internal: generateT :: (Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> T v a
+ Data.Array.Internal: generateT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> T v a
- Data.Array.Internal: indexT :: T v a -> Int -> T v a
+ Data.Array.Internal: indexT :: forall (v :: Type -> Type) a. T v a -> Int -> T v a
- Data.Array.Internal: iotaT :: (Vector v, VecElem v a, Enum a, Num a) => Int -> T v a
+ Data.Array.Internal: iotaT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Enum a, Num a) => Int -> T v a
- Data.Array.Internal: isCanonicalT :: (Vector v, VecElem v a) => [Int] -> T v a -> Bool
+ Data.Array.Internal: isCanonicalT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => [Int] -> T v a -> Bool
- Data.Array.Internal: iterateNT :: (Vector v, VecElem v a) => Int -> (a -> a) -> a -> T v a
+ Data.Array.Internal: iterateNT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Int -> (a -> a) -> a -> T v a
- Data.Array.Internal: mapT :: (Vector v, VecElem v a, VecElem v b) => ShapeL -> (a -> b) -> T v a -> T v b
+ Data.Array.Internal: mapT :: forall (v :: Type -> Type) a b. (Vector v, VecElem v a, VecElem v b) => ShapeL -> (a -> b) -> T v a -> T v b
- Data.Array.Internal: maximumT :: (Vector v, VecElem v a, Ord a) => ShapeL -> T v a -> a
+ Data.Array.Internal: maximumT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Ord a) => ShapeL -> T v a -> a
- Data.Array.Internal: minimumT :: (Vector v, VecElem v a, Ord a) => ShapeL -> T v a -> a
+ Data.Array.Internal: minimumT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Ord a) => ShapeL -> T v a -> a
- Data.Array.Internal: padT :: forall v a. (Vector v, VecElem v a) => a -> [(Int, Int)] -> ShapeL -> T v a -> ([Int], T v a)
+ Data.Array.Internal: padT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => a -> [(Int, Int)] -> ShapeL -> T v a -> ([Int], T v a)
- Data.Array.Internal: ppT :: (Vector v, VecElem v a, Pretty a) => PrettyLevel -> Rational -> ShapeL -> T v a -> Doc
+ Data.Array.Internal: ppT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Pretty a) => PrettyLevel -> Rational -> ShapeL -> T v a -> Doc
- Data.Array.Internal: ppT_ :: (Vector v, VecElem v a) => (a -> String) -> ShapeL -> T v a -> Rect
+ Data.Array.Internal: ppT_ :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => (a -> String) -> ShapeL -> T v a -> Rect
- Data.Array.Internal: productT :: (Vector v, VecElem v a, Num a) => ShapeL -> T v a -> a
+ Data.Array.Internal: productT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Num a) => ShapeL -> T v a -> a
- Data.Array.Internal: reduceT :: (Vector v, VecElem v a) => ShapeL -> (a -> a -> a) -> a -> T v a -> T v a
+ Data.Array.Internal: reduceT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => ShapeL -> (a -> a -> a) -> a -> T v a -> T v a
- Data.Array.Internal: reverseT :: [Int] -> ShapeL -> T v a -> T v a
+ Data.Array.Internal: reverseT :: forall (v :: Type -> Type) a. [Int] -> ShapeL -> T v a -> T v a
- Data.Array.Internal: scalarT :: (Vector v, VecElem v a) => a -> T v a
+ Data.Array.Internal: scalarT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => a -> T v a
- Data.Array.Internal: stretchT :: [Bool] -> T v a -> T v a
+ Data.Array.Internal: stretchT :: forall (v :: Type -> Type) a. [Bool] -> T v a -> T v a
- Data.Array.Internal: subArraysT :: ShapeL -> T v a -> [T v a]
+ Data.Array.Internal: subArraysT :: forall (v :: Type -> Type) a. ShapeL -> T v a -> [T v a]
- Data.Array.Internal: sumT :: (Vector v, VecElem v a, Num a) => ShapeL -> T v a -> a
+ Data.Array.Internal: sumT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Num a) => ShapeL -> T v a -> a
- Data.Array.Internal: toListT :: (Vector v, VecElem v a) => ShapeL -> T v a -> [a]
+ Data.Array.Internal: toListT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => ShapeL -> T v a -> [a]
- Data.Array.Internal: transposeT :: [Int] -> T v a -> T v a
+ Data.Array.Internal: transposeT :: forall (v :: Type -> Type) a. [Int] -> T v a -> T v a
- Data.Array.Internal: traverseT :: (Vector v, VecElem v a, VecElem v b, Applicative f) => ShapeL -> (a -> f b) -> T v a -> f (T v b)
+ Data.Array.Internal: traverseT :: forall (v :: Type -> Type) a b f. (Vector v, VecElem v a, VecElem v b, Applicative f) => ShapeL -> (a -> f b) -> T v a -> f (T v b)
- Data.Array.Internal: type VecElem v :: Type -> Constraint;
+ Data.Array.Internal: type VecElem (v :: Type -> Type) :: Type -> Constraint;
- Data.Array.Internal: unScalarT :: (Vector v, VecElem v a) => T v a -> a
+ Data.Array.Internal: unScalarT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => T v a -> a
- Data.Array.Internal: updateT :: (Vector v, VecElem v a) => ShapeL -> T v a -> [([Int], a)] -> T v a
+ Data.Array.Internal: updateT :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => ShapeL -> T v a -> [([Int], a)] -> T v a
- Data.Array.Internal: valueOf :: forall n i. (KnownNat n, Num i) => i
+ Data.Array.Internal: valueOf :: forall (n :: Nat) i. (KnownNat n, Num i) => i
- Data.Array.Internal: zipWith3T :: (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => ShapeL -> (a -> b -> c -> d) -> T v a -> T v b -> T v c -> T v d
+ Data.Array.Internal: zipWith3T :: forall (v :: Type -> Type) a b c d. (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => ShapeL -> (a -> b -> c -> d) -> T v a -> T v b -> T v c -> T v d
- Data.Array.Internal: zipWith4T :: (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e) => ShapeL -> (a -> b -> c -> d -> e) -> T v a -> T v b -> T v c -> T v d -> T v e
+ Data.Array.Internal: zipWith4T :: forall (v :: Type -> Type) a b c d e. (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e) => ShapeL -> (a -> b -> c -> d -> e) -> T v a -> T v b -> T v c -> T v d -> T v e
- Data.Array.Internal: zipWith5T :: (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e, VecElem v f) => ShapeL -> (a -> b -> c -> d -> e -> f) -> T v a -> T v b -> T v c -> T v d -> T v e -> T v f
+ Data.Array.Internal: zipWith5T :: forall (v :: Type -> Type) a b c d e f. (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e, VecElem v f) => ShapeL -> (a -> b -> c -> d -> e -> f) -> T v a -> T v b -> T v c -> T v d -> T v e -> T v f
- Data.Array.Internal: zipWithT :: (Vector v, VecElem v a, VecElem v b, VecElem v c) => ShapeL -> (a -> b -> c) -> T v a -> T v b -> T v c
+ Data.Array.Internal: zipWithT :: forall (v :: Type -> Type) a b c. (Vector v, VecElem v a, VecElem v b, VecElem v c) => ShapeL -> (a -> b -> c) -> T v a -> T v b -> T v c
- Data.Array.Internal.Dynamic: class Vector v
+ Data.Array.Internal.Dynamic: class Vector (v :: Type -> Type)
- Data.Array.Internal.DynamicG: A :: !ShapeL -> !T v a -> Array v a
+ Data.Array.Internal.DynamicG: A :: !ShapeL -> !T v a -> Array (v :: Type -> Type) a
- Data.Array.Internal.DynamicG: allA :: (Vector v, VecElem v a) => (a -> Bool) -> Array v a -> Bool
+ Data.Array.Internal.DynamicG: allA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => (a -> Bool) -> Array v a -> Bool
- Data.Array.Internal.DynamicG: allSameA :: (Vector v, VecElem v a, Eq a) => Array v a -> Bool
+ Data.Array.Internal.DynamicG: allSameA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Eq a) => Array v a -> Bool
- Data.Array.Internal.DynamicG: anyA :: (Vector v, VecElem v a) => (a -> Bool) -> Array v a -> Bool
+ Data.Array.Internal.DynamicG: anyA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => (a -> Bool) -> Array v a -> Bool
- Data.Array.Internal.DynamicG: append :: (HasCallStack, Vector v, VecElem v a) => Array v a -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: append :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => Array v a -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: broadcast :: (HasCallStack, Vector v, VecElem v a) => [Int] -> ShapeL -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: broadcast :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => [Int] -> ShapeL -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: class Vector v
+ Data.Array.Internal.DynamicG: class Vector (v :: Type -> Type)
- Data.Array.Internal.DynamicG: concatOuter :: (HasCallStack, Vector v, VecElem v a) => [Array v a] -> Array v a
+ Data.Array.Internal.DynamicG: concatOuter :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => [Array v a] -> Array v a
- Data.Array.Internal.DynamicG: constant :: (HasCallStack, Vector v, VecElem v a) => ShapeL -> a -> Array v a
+ Data.Array.Internal.DynamicG: constant :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => ShapeL -> a -> Array v a
- Data.Array.Internal.DynamicG: data Array v a
+ Data.Array.Internal.DynamicG: data Array (v :: Type -> Type) a
- Data.Array.Internal.DynamicG: foldrA :: (Vector v, VecElem v a) => (a -> b -> b) -> b -> Array v a -> b
+ Data.Array.Internal.DynamicG: foldrA :: forall (v :: Type -> Type) a b. (Vector v, VecElem v a) => (a -> b -> b) -> b -> Array v a -> b
- Data.Array.Internal.DynamicG: fromList :: (HasCallStack, Vector v, VecElem v a) => ShapeL -> [a] -> Array v a
+ Data.Array.Internal.DynamicG: fromList :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => ShapeL -> [a] -> Array v a
- Data.Array.Internal.DynamicG: generate :: (Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> Array v a
+ Data.Array.Internal.DynamicG: generate :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> Array v a
- Data.Array.Internal.DynamicG: index :: (HasCallStack, Vector v) => Array v a -> Int -> Array v a
+ Data.Array.Internal.DynamicG: index :: forall (v :: Type -> Type) a. (HasCallStack, Vector v) => Array v a -> Int -> Array v a
- Data.Array.Internal.DynamicG: iota :: forall v a. (Vector v, VecElem v a, Enum a, Num a) => Int -> Array v a
+ Data.Array.Internal.DynamicG: iota :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Enum a, Num a) => Int -> Array v a
- Data.Array.Internal.DynamicG: iterateN :: forall v a. (Vector v, VecElem v a) => Int -> (a -> a) -> a -> Array v a
+ Data.Array.Internal.DynamicG: iterateN :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Int -> (a -> a) -> a -> Array v a
- Data.Array.Internal.DynamicG: mapA :: (Vector v, VecElem v a, VecElem v b) => (a -> b) -> Array v a -> Array v b
+ Data.Array.Internal.DynamicG: mapA :: forall (v :: Type -> Type) a b. (Vector v, VecElem v a, VecElem v b) => (a -> b) -> Array v a -> Array v b
- Data.Array.Internal.DynamicG: maximumA :: (HasCallStack, Vector v, VecElem v a, Ord a) => Array v a -> a
+ Data.Array.Internal.DynamicG: maximumA :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, Ord a) => Array v a -> a
- Data.Array.Internal.DynamicG: minimumA :: (HasCallStack, Vector v, VecElem v a, Ord a) => Array v a -> a
+ Data.Array.Internal.DynamicG: minimumA :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, Ord a) => Array v a -> a
- Data.Array.Internal.DynamicG: normalize :: (Vector v, VecElem v a) => Array v a -> Array v a
+ Data.Array.Internal.DynamicG: normalize :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Array v a -> Array v a
- Data.Array.Internal.DynamicG: pad :: forall a v. (Vector v, VecElem v a) => [(Int, Int)] -> a -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: pad :: forall a (v :: Type -> Type). (Vector v, VecElem v a) => [(Int, Int)] -> a -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: productA :: (Vector v, VecElem v a, Num a) => Array v a -> a
+ Data.Array.Internal.DynamicG: productA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Num a) => Array v a -> a
- Data.Array.Internal.DynamicG: rank :: Array v a -> Int
+ Data.Array.Internal.DynamicG: rank :: forall (v :: Type -> Type) a. Array v a -> Int
- Data.Array.Internal.DynamicG: ravel :: (HasCallStack, Vector v, Vector v', VecElem v a, VecElem v' (Array v a)) => Array v' (Array v a) -> Array v a
+ Data.Array.Internal.DynamicG: ravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a. (HasCallStack, Vector v, Vector v', VecElem v a, VecElem v' (Array v a)) => Array v' (Array v a) -> Array v a
- Data.Array.Internal.DynamicG: reduce :: (Vector v, VecElem v a) => (a -> a -> a) -> a -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: reduce :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => (a -> a -> a) -> a -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: rerank :: (HasCallStack, Vector v, Vector v', VecElem v a, VecElem v' b) => Int -> (Array v a -> Array v' b) -> Array v a -> Array v' b
+ Data.Array.Internal.DynamicG: rerank :: forall (v :: Type -> Type) (v' :: Type -> Type) a b. (HasCallStack, Vector v, Vector v', VecElem v a, VecElem v' b) => Int -> (Array v a -> Array v' b) -> Array v a -> Array v' b
- Data.Array.Internal.DynamicG: rerank2 :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c) => Int -> (Array v a -> Array v b -> Array v c) -> Array v a -> Array v b -> Array v c
+ Data.Array.Internal.DynamicG: rerank2 :: forall (v :: Type -> Type) a b c. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c) => Int -> (Array v a -> Array v b -> Array v c) -> Array v a -> Array v b -> Array v c
- Data.Array.Internal.DynamicG: reshape :: (HasCallStack, Vector v, VecElem v a) => ShapeL -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: reshape :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => ShapeL -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: rev :: HasCallStack => [Int] -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: rev :: forall (v :: Type -> Type) a. HasCallStack => [Int] -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: rotate :: (HasCallStack, Vector v, VecElem v a) => Int -> Int -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: rotate :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => Int -> Int -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: scalar :: (Vector v, VecElem v a) => a -> Array v a
+ Data.Array.Internal.DynamicG: scalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => a -> Array v a
- Data.Array.Internal.DynamicG: shapeL :: Array v a -> ShapeL
+ Data.Array.Internal.DynamicG: shapeL :: forall (v :: Type -> Type) a. Array v a -> ShapeL
- Data.Array.Internal.DynamicG: size :: Array v a -> Int
+ Data.Array.Internal.DynamicG: size :: forall (v :: Type -> Type) a. Array v a -> Int
- Data.Array.Internal.DynamicG: slice :: HasCallStack => [(Int, Int)] -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: slice :: forall (v :: Type -> Type) a. HasCallStack => [(Int, Int)] -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: stretch :: HasCallStack => ShapeL -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: stretch :: forall (v :: Type -> Type) a. HasCallStack => ShapeL -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: stretchOuter :: HasCallStack => Int -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: stretchOuter :: forall (v :: Type -> Type) a. HasCallStack => Int -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: stride :: (HasCallStack, Vector v) => [Int] -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: stride :: forall (v :: Type -> Type) a. (HasCallStack, Vector v) => [Int] -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: sumA :: (Vector v, VecElem v a, Num a) => Array v a -> a
+ Data.Array.Internal.DynamicG: sumA :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Num a) => Array v a -> a
- Data.Array.Internal.DynamicG: toList :: (Vector v, VecElem v a) => Array v a -> [a]
+ Data.Array.Internal.DynamicG: toList :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Array v a -> [a]
- Data.Array.Internal.DynamicG: transpose :: HasCallStack => [Int] -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: transpose :: forall (v :: Type -> Type) a. HasCallStack => [Int] -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: traverseA :: (Vector v, VecElem v a, VecElem v b, Applicative f) => (a -> f b) -> Array v a -> f (Array v b)
+ Data.Array.Internal.DynamicG: traverseA :: forall (v :: Type -> Type) a b f. (Vector v, VecElem v a, VecElem v b, Applicative f) => (a -> f b) -> Array v a -> f (Array v b)
- Data.Array.Internal.DynamicG: unScalar :: (HasCallStack, Vector v, VecElem v a) => Array v a -> a
+ Data.Array.Internal.DynamicG: unScalar :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => Array v a -> a
- Data.Array.Internal.DynamicG: unravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array v a)) => Array v a -> Array v' (Array v a)
+ Data.Array.Internal.DynamicG: unravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a. (Vector v, Vector v', VecElem v a, VecElem v' (Array v a)) => Array v a -> Array v' (Array v a)
- Data.Array.Internal.DynamicG: update :: (HasCallStack, Vector v, VecElem v a) => Array v a -> [([Int], a)] -> Array v a
+ Data.Array.Internal.DynamicG: update :: forall (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a) => Array v a -> [([Int], a)] -> Array v a
- Data.Array.Internal.DynamicG: window :: (HasCallStack, Vector v) => [Int] -> Array v a -> Array v a
+ Data.Array.Internal.DynamicG: window :: forall (v :: Type -> Type) a. (HasCallStack, Vector v) => [Int] -> Array v a -> Array v a
- Data.Array.Internal.DynamicG: zipWith3A :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => (a -> b -> c -> d) -> Array v a -> Array v b -> Array v c -> Array v d
+ Data.Array.Internal.DynamicG: zipWith3A :: forall (v :: Type -> Type) a b c d. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => (a -> b -> c -> d) -> Array v a -> Array v b -> Array v c -> Array v d
- Data.Array.Internal.DynamicG: zipWith4A :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e) => (a -> b -> c -> d -> e) -> Array v a -> Array v b -> Array v c -> Array v d -> Array v e
+ Data.Array.Internal.DynamicG: zipWith4A :: forall (v :: Type -> Type) a b c d e. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e) => (a -> b -> c -> d -> e) -> Array v a -> Array v b -> Array v c -> Array v d -> Array v e
- Data.Array.Internal.DynamicG: zipWith5A :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e, VecElem v f) => (a -> b -> c -> d -> e -> f) -> Array v a -> Array v b -> Array v c -> Array v d -> Array v e -> Array v f
+ Data.Array.Internal.DynamicG: zipWith5A :: forall (v :: Type -> Type) a b c d e f. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, VecElem v e, VecElem v f) => (a -> b -> c -> d -> e -> f) -> Array v a -> Array v b -> Array v c -> Array v d -> Array v e -> Array v f
- Data.Array.Internal.DynamicG: zipWithA :: (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c) => (a -> b -> c) -> Array v a -> Array v b -> Array v c
+ Data.Array.Internal.DynamicG: zipWithA :: forall (v :: Type -> Type) a b c. (HasCallStack, Vector v, VecElem v a, VecElem v b, VecElem v c) => (a -> b -> c) -> Array v a -> Array v b -> Array v c
- Data.Array.Internal.DynamicS: bitcast :: forall a b. (HasCallStack, Unbox a, Unbox b) => Array a -> Array b
+ Data.Array.Internal.DynamicS: bitcast :: (HasCallStack, Unbox a, Unbox b) => Array a -> Array b
- Data.Array.Internal.DynamicS: class () => Storable a
+ Data.Array.Internal.DynamicS: class Storable a
- Data.Array.Internal.DynamicS: class Vector v
+ Data.Array.Internal.DynamicS: class Vector (v :: Type -> Type)
- Data.Array.Internal.DynamicU: class Vector v
+ Data.Array.Internal.DynamicU: class Vector (v :: Type -> Type)
- Data.Array.Internal.Ranked: A :: Array n Vector a -> Array n a
+ Data.Array.Internal.Ranked: A :: Array n Vector a -> Array (n :: Nat) a
- Data.Array.Internal.Ranked: [unA] :: Array n a -> Array n Vector a
+ Data.Array.Internal.Ranked: [unA] :: Array (n :: Nat) a -> Array n Vector a
- Data.Array.Internal.Ranked: allA :: (a -> Bool) -> Array r a -> Bool
+ Data.Array.Internal.Ranked: allA :: forall a (r :: Nat). (a -> Bool) -> Array r a -> Bool
- Data.Array.Internal.Ranked: allSameA :: Eq a => Array r a -> Bool
+ Data.Array.Internal.Ranked: allSameA :: forall a (r :: Nat). Eq a => Array r a -> Bool
- Data.Array.Internal.Ranked: anyA :: (a -> Bool) -> Array r a -> Bool
+ Data.Array.Internal.Ranked: anyA :: forall a (r :: Nat). (a -> Bool) -> Array r a -> Bool
- Data.Array.Internal.Ranked: append :: KnownNat n => Array n a -> Array n a -> Array n a
+ Data.Array.Internal.Ranked: append :: forall (n :: Nat) a. KnownNat n => Array n a -> Array n a -> Array n a
- Data.Array.Internal.Ranked: broadcast :: forall r' r a. (HasCallStack, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
+ Data.Array.Internal.Ranked: broadcast :: forall (r' :: Nat) (r :: Nat) a. (HasCallStack, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
- Data.Array.Internal.Ranked: class Vector v
+ Data.Array.Internal.Ranked: class Vector (v :: Type -> Type)
- Data.Array.Internal.Ranked: concatOuter :: KnownNat n => [Array n a] -> Array n a
+ Data.Array.Internal.Ranked: concatOuter :: forall (n :: Nat) a. KnownNat n => [Array n a] -> Array n a
- Data.Array.Internal.Ranked: constant :: forall n a. KnownNat n => ShapeL -> a -> Array n a
+ Data.Array.Internal.Ranked: constant :: forall (n :: Nat) a. KnownNat n => ShapeL -> a -> Array n a
- Data.Array.Internal.Ranked: foldrA :: (a -> b -> b) -> b -> Array n a -> b
+ Data.Array.Internal.Ranked: foldrA :: forall a b (n :: Nat). (a -> b -> b) -> b -> Array n a -> b
- Data.Array.Internal.Ranked: fromList :: forall n a. KnownNat n => ShapeL -> [a] -> Array n a
+ Data.Array.Internal.Ranked: fromList :: forall (n :: Nat) a. KnownNat n => ShapeL -> [a] -> Array n a
- Data.Array.Internal.Ranked: fromVector :: forall n a. KnownNat n => ShapeL -> Vector a -> Array n a
+ Data.Array.Internal.Ranked: fromVector :: forall (n :: Nat) a. KnownNat n => ShapeL -> Vector a -> Array n a
- Data.Array.Internal.Ranked: generate :: forall n a. KnownNat n => ShapeL -> ([Int] -> a) -> Array n a
+ Data.Array.Internal.Ranked: generate :: forall (n :: Nat) a. KnownNat n => ShapeL -> ([Int] -> a) -> Array n a
- Data.Array.Internal.Ranked: index :: HasCallStack => Array (1 + n) a -> Int -> Array n a
+ Data.Array.Internal.Ranked: index :: forall (n :: Natural) a. HasCallStack => Array (1 + n) a -> Int -> Array n a
- Data.Array.Internal.Ranked: iterateN :: forall a. Int -> (a -> a) -> a -> Array 1 a
+ Data.Array.Internal.Ranked: iterateN :: Int -> (a -> a) -> a -> Array 1 a
- Data.Array.Internal.Ranked: mapA :: (a -> b) -> Array n a -> Array n b
+ Data.Array.Internal.Ranked: mapA :: forall a b (n :: Nat). (a -> b) -> Array n a -> Array n b
- Data.Array.Internal.Ranked: maximumA :: Ord a => Array r a -> a
+ Data.Array.Internal.Ranked: maximumA :: forall a (r :: Nat). Ord a => Array r a -> a
- Data.Array.Internal.Ranked: minimumA :: Ord a => Array r a -> a
+ Data.Array.Internal.Ranked: minimumA :: forall a (r :: Nat). Ord a => Array r a -> a
- Data.Array.Internal.Ranked: newtype Array n a
+ Data.Array.Internal.Ranked: newtype Array (n :: Nat) a
- Data.Array.Internal.Ranked: normalize :: KnownNat n => Array n a -> Array n a
+ Data.Array.Internal.Ranked: normalize :: forall (n :: Nat) a. KnownNat n => Array n a -> Array n a
- Data.Array.Internal.Ranked: pad :: KnownNat n => [(Int, Int)] -> a -> Array n a -> Array n a
+ Data.Array.Internal.Ranked: pad :: forall (n :: Nat) a. KnownNat n => [(Int, Int)] -> a -> Array n a -> Array n a
- Data.Array.Internal.Ranked: productA :: Num a => Array r a -> a
+ Data.Array.Internal.Ranked: productA :: forall a (r :: Nat). Num a => Array r a -> a
- Data.Array.Internal.Ranked: rank :: KnownNat n => Array n a -> Int
+ Data.Array.Internal.Ranked: rank :: forall (n :: Nat) a. KnownNat n => Array n a -> Int
- Data.Array.Internal.Ranked: ravel :: KnownNat (1 + n) => Array 1 (Array n a) -> Array (1 + n) a
+ Data.Array.Internal.Ranked: ravel :: forall (n :: Natural) a. KnownNat (1 + n) => Array 1 (Array n a) -> Array (1 + n) a
- Data.Array.Internal.Ranked: reduce :: (a -> a -> a) -> a -> Array n a -> Array 0 a
+ Data.Array.Internal.Ranked: reduce :: forall a (n :: Nat). (a -> a -> a) -> a -> Array n a -> Array 0 a
- Data.Array.Internal.Ranked: rerank :: forall n i o a b. (KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
+ Data.Array.Internal.Ranked: rerank :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b. (KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
- Data.Array.Internal.Ranked: rerank2 :: forall n i o a b c. (KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
+ Data.Array.Internal.Ranked: rerank2 :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b c. (KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
- Data.Array.Internal.Ranked: reshape :: forall n' n a. (KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
+ Data.Array.Internal.Ranked: reshape :: forall (n' :: Nat) (n :: Nat) a. (KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
- Data.Array.Internal.Ranked: rev :: [Int] -> Array n a -> Array n a
+ Data.Array.Internal.Ranked: rev :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.Internal.Ranked: rotate :: forall d p a. (KnownNat p, KnownNat d, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
+ Data.Array.Internal.Ranked: rotate :: forall (d :: Nat) (p :: Nat) a. (KnownNat p, KnownNat d, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
- Data.Array.Internal.Ranked: shapeL :: Array n a -> ShapeL
+ Data.Array.Internal.Ranked: shapeL :: forall (n :: Nat) a. Array n a -> ShapeL
- Data.Array.Internal.Ranked: size :: Array n a -> Int
+ Data.Array.Internal.Ranked: size :: forall (n :: Nat) a. Array n a -> Int
- Data.Array.Internal.Ranked: slice :: [(Int, Int)] -> Array n a -> Array n a
+ Data.Array.Internal.Ranked: slice :: forall (n :: Nat) a. [(Int, Int)] -> Array n a -> Array n a
- Data.Array.Internal.Ranked: stretch :: ShapeL -> Array n a -> Array n a
+ Data.Array.Internal.Ranked: stretch :: forall (n :: Nat) a. ShapeL -> Array n a -> Array n a
- Data.Array.Internal.Ranked: stretchOuter :: (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
+ Data.Array.Internal.Ranked: stretchOuter :: forall (n :: Natural) a. (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
- Data.Array.Internal.Ranked: stride :: [Int] -> Array n a -> Array n a
+ Data.Array.Internal.Ranked: stride :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.Internal.Ranked: sumA :: Num a => Array r a -> a
+ Data.Array.Internal.Ranked: sumA :: forall a (r :: Nat). Num a => Array r a -> a
- Data.Array.Internal.Ranked: toList :: Array n a -> [a]
+ Data.Array.Internal.Ranked: toList :: forall (n :: Nat) a. Array n a -> [a]
- Data.Array.Internal.Ranked: toVector :: Array n a -> Vector a
+ Data.Array.Internal.Ranked: toVector :: forall (n :: Nat) a. Array n a -> Vector a
- Data.Array.Internal.Ranked: transpose :: KnownNat n => [Int] -> Array n a -> Array n a
+ Data.Array.Internal.Ranked: transpose :: forall (n :: Nat) a. KnownNat n => [Int] -> Array n a -> Array n a
- Data.Array.Internal.Ranked: traverseA :: Applicative f => (a -> f b) -> Array n a -> f (Array n b)
+ Data.Array.Internal.Ranked: traverseA :: forall f a b (n :: Nat). Applicative f => (a -> f b) -> Array n a -> f (Array n b)
- Data.Array.Internal.Ranked: unravel :: Array (1 + n) a -> Array 1 (Array n a)
+ Data.Array.Internal.Ranked: unravel :: forall (n :: Natural) a. Array (1 + n) a -> Array 1 (Array n a)
- Data.Array.Internal.Ranked: window :: (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
+ Data.Array.Internal.Ranked: window :: forall (n :: Nat) (n' :: Nat) a. (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
- Data.Array.Internal.Ranked: zipWith3A :: (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
+ Data.Array.Internal.Ranked: zipWith3A :: forall a b c d (n :: Nat). (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
- Data.Array.Internal.Ranked: zipWithA :: (a -> b -> c) -> Array n a -> Array n b -> Array n c
+ Data.Array.Internal.Ranked: zipWithA :: forall a b c (n :: Nat). (a -> b -> c) -> Array n a -> Array n b -> Array n c
- Data.Array.Internal.RankedG: A :: !ShapeL -> !T v a -> Array (n :: Nat) v a
+ Data.Array.Internal.RankedG: A :: !ShapeL -> !T v a -> Array (n :: Nat) (v :: Type -> Type) a
- Data.Array.Internal.RankedG: allA :: (Vector v, VecElem v a) => (a -> Bool) -> Array r v a -> Bool
+ Data.Array.Internal.RankedG: allA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a) => (a -> Bool) -> Array r v a -> Bool
- Data.Array.Internal.RankedG: allSameA :: (Vector v, VecElem v a, Eq a) => Array r v a -> Bool
+ Data.Array.Internal.RankedG: allSameA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a, Eq a) => Array r v a -> Bool
- Data.Array.Internal.RankedG: anyA :: (Vector v, VecElem v a) => (a -> Bool) -> Array r v a -> Bool
+ Data.Array.Internal.RankedG: anyA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a) => (a -> Bool) -> Array r v a -> Bool
- Data.Array.Internal.RankedG: append :: (Vector v, VecElem v a, KnownNat n) => Array n v a -> Array n v a -> Array n v a
+ Data.Array.Internal.RankedG: append :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a, KnownNat n) => Array n v a -> Array n v a -> Array n v a
- Data.Array.Internal.RankedG: broadcast :: forall r' r v a. (HasCallStack, Vector v, VecElem v a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r v a -> Array r' v a
+ Data.Array.Internal.RankedG: broadcast :: forall (r' :: Nat) (r :: Nat) (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r v a -> Array r' v a
- Data.Array.Internal.RankedG: class Vector v
+ Data.Array.Internal.RankedG: class Vector (v :: Type -> Type)
- Data.Array.Internal.RankedG: concatOuter :: (Vector v, VecElem v a, KnownNat n) => [Array n v a] -> Array n v a
+ Data.Array.Internal.RankedG: concatOuter :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a, KnownNat n) => [Array n v a] -> Array n v a
- Data.Array.Internal.RankedG: constant :: forall n v a. (Vector v, VecElem v a, KnownNat n) => ShapeL -> a -> Array n v a
+ Data.Array.Internal.RankedG: constant :: forall (n :: Nat) (v :: Type -> Type) a. (Vector v, VecElem v a, KnownNat n) => ShapeL -> a -> Array n v a
- Data.Array.Internal.RankedG: data Array (n :: Nat) v a
+ Data.Array.Internal.RankedG: data Array (n :: Nat) (v :: Type -> Type) a
- Data.Array.Internal.RankedG: foldrA :: (Vector v, VecElem v a) => (a -> b -> b) -> b -> Array n v a -> b
+ Data.Array.Internal.RankedG: foldrA :: forall (v :: Type -> Type) a b (n :: Nat). (Vector v, VecElem v a) => (a -> b -> b) -> b -> Array n v a -> b
- Data.Array.Internal.RankedG: fromList :: forall n v a. (HasCallStack, Vector v, VecElem v a, KnownNat n) => ShapeL -> [a] -> Array n v a
+ Data.Array.Internal.RankedG: fromList :: forall (n :: Nat) (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, KnownNat n) => ShapeL -> [a] -> Array n v a
- Data.Array.Internal.RankedG: fromVector :: forall n v a. (HasCallStack, Vector v, VecElem v a, KnownNat n) => ShapeL -> v a -> Array n v a
+ Data.Array.Internal.RankedG: fromVector :: forall (n :: Nat) v a. (HasCallStack, Vector v, VecElem v a, KnownNat n) => ShapeL -> v a -> Array n v a
- Data.Array.Internal.RankedG: generate :: forall n v a. (KnownNat n, Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> Array n v a
+ Data.Array.Internal.RankedG: generate :: forall (n :: Nat) (v :: Type -> Type) a. (KnownNat n, Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> Array n v a
- Data.Array.Internal.RankedG: index :: (Vector v, HasCallStack) => Array (1 + n) v a -> Int -> Array n v a
+ Data.Array.Internal.RankedG: index :: forall (v :: Type -> Type) (n :: Natural) a. (Vector v, HasCallStack) => Array (1 + n) v a -> Int -> Array n v a
- Data.Array.Internal.RankedG: iota :: forall v a. (Vector v, VecElem v a, Enum a, Num a) => Int -> Array 1 v a
+ Data.Array.Internal.RankedG: iota :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Enum a, Num a) => Int -> Array 1 v a
- Data.Array.Internal.RankedG: iterateN :: forall v a. (Vector v, VecElem v a) => Int -> (a -> a) -> a -> Array 1 v a
+ Data.Array.Internal.RankedG: iterateN :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Int -> (a -> a) -> a -> Array 1 v a
- Data.Array.Internal.RankedG: mapA :: (Vector v, VecElem v a, VecElem v b) => (a -> b) -> Array n v a -> Array n v b
+ Data.Array.Internal.RankedG: mapA :: forall (v :: Type -> Type) a b (n :: Nat). (Vector v, VecElem v a, VecElem v b) => (a -> b) -> Array n v a -> Array n v b
- Data.Array.Internal.RankedG: maximumA :: (HasCallStack, Vector v, VecElem v a, Ord a) => Array r v a -> a
+ Data.Array.Internal.RankedG: maximumA :: forall (v :: Type -> Type) a (r :: Nat). (HasCallStack, Vector v, VecElem v a, Ord a) => Array r v a -> a
- Data.Array.Internal.RankedG: minimumA :: (HasCallStack, Vector v, VecElem v a, Ord a) => Array r v a -> a
+ Data.Array.Internal.RankedG: minimumA :: forall (v :: Type -> Type) a (r :: Nat). (HasCallStack, Vector v, VecElem v a, Ord a) => Array r v a -> a
- Data.Array.Internal.RankedG: normalize :: (Vector v, VecElem v a, KnownNat n) => Array n v a -> Array n v a
+ Data.Array.Internal.RankedG: normalize :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a, KnownNat n) => Array n v a -> Array n v a
- Data.Array.Internal.RankedG: pad :: forall n a v. (Vector v, VecElem v a) => [(Int, Int)] -> a -> Array n v a -> Array n v a
+ Data.Array.Internal.RankedG: pad :: forall (n :: Nat) a (v :: Type -> Type). (Vector v, VecElem v a) => [(Int, Int)] -> a -> Array n v a -> Array n v a
- Data.Array.Internal.RankedG: productA :: (Vector v, VecElem v a, Num a) => Array r v a -> a
+ Data.Array.Internal.RankedG: productA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a, Num a) => Array r v a -> a
- Data.Array.Internal.RankedG: rank :: forall n v a. KnownNat n => Array n v a -> Int
+ Data.Array.Internal.RankedG: rank :: forall (n :: Nat) (v :: Type -> Type) a. KnownNat n => Array n v a -> Int
- Data.Array.Internal.RankedG: ravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array n v a), KnownNat (1 + n)) => Array 1 v' (Array n v a) -> Array (1 + n) v a
+ Data.Array.Internal.RankedG: ravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a (n :: Nat). (Vector v, Vector v', VecElem v a, VecElem v' (Array n v a), KnownNat (1 + n)) => Array 1 v' (Array n v a) -> Array (1 + n) v a
- Data.Array.Internal.RankedG: reduce :: (Vector v, VecElem v a) => (a -> a -> a) -> a -> Array n v a -> Array 0 v a
+ Data.Array.Internal.RankedG: reduce :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a) => (a -> a -> a) -> a -> Array n v a -> Array 0 v a
- Data.Array.Internal.RankedG: rerank :: forall n i o v v' a b. (Vector v, Vector v', VecElem v a, VecElem v' b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i v a -> Array o v' b) -> Array (n + i) v a -> Array (n + o) v' b
+ Data.Array.Internal.RankedG: rerank :: forall (n :: Nat) (i :: Nat) (o :: Nat) (v :: Type -> Type) (v' :: Type -> Type) a b. (Vector v, Vector v', VecElem v a, VecElem v' b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i v a -> Array o v' b) -> Array (n + i) v a -> Array (n + o) v' b
- Data.Array.Internal.RankedG: rerank2 :: forall n i o a b c v. (Vector v, VecElem v a, VecElem v b, VecElem v c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i v a -> Array i v b -> Array o v c) -> Array (n + i) v a -> Array (n + i) v b -> Array (n + o) v c
+ Data.Array.Internal.RankedG: rerank2 :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b c (v :: Type -> Type). (Vector v, VecElem v a, VecElem v b, VecElem v c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i v a -> Array i v b -> Array o v c) -> Array (n + i) v a -> Array (n + i) v b -> Array (n + o) v c
- Data.Array.Internal.RankedG: reshape :: forall n n' v a. (HasCallStack, Vector v, VecElem v a, KnownNat n, KnownNat n') => ShapeL -> Array n v a -> Array n' v a
+ Data.Array.Internal.RankedG: reshape :: forall (n :: Nat) (n' :: Nat) (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, KnownNat n, KnownNat n') => ShapeL -> Array n v a -> Array n' v a
- Data.Array.Internal.RankedG: rev :: [Int] -> Array n v a -> Array n v a
+ Data.Array.Internal.RankedG: rev :: forall (n :: Nat) (v :: Type -> Type) a. [Int] -> Array n v a -> Array n v a
- Data.Array.Internal.RankedG: rotate :: forall d p v a. (KnownNat p, KnownNat d, Vector v, VecElem v a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) v a -> Array ((p + d) + 1) v a
+ Data.Array.Internal.RankedG: rotate :: forall (d :: Nat) (p :: Nat) (v :: Type -> Type) a. (KnownNat p, KnownNat d, Vector v, VecElem v a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) v a -> Array ((p + d) + 1) v a
- Data.Array.Internal.RankedG: scalar :: (Vector v, VecElem v a) => a -> Array 0 v a
+ Data.Array.Internal.RankedG: scalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => a -> Array 0 v a
- Data.Array.Internal.RankedG: shapeL :: Array n v a -> ShapeL
+ Data.Array.Internal.RankedG: shapeL :: forall (n :: Nat) (v :: Type -> Type) a. Array n v a -> ShapeL
- Data.Array.Internal.RankedG: size :: Array n v a -> Int
+ Data.Array.Internal.RankedG: size :: forall (n :: Nat) (v :: Type -> Type) a. Array n v a -> Int
- Data.Array.Internal.RankedG: slice :: [(Int, Int)] -> Array n v a -> Array n v a
+ Data.Array.Internal.RankedG: slice :: forall (n :: Nat) (v :: Type -> Type) a. [(Int, Int)] -> Array n v a -> Array n v a
- Data.Array.Internal.RankedG: stretch :: HasCallStack => ShapeL -> Array n v a -> Array n v a
+ Data.Array.Internal.RankedG: stretch :: forall (n :: Nat) (v :: Type -> Type) a. HasCallStack => ShapeL -> Array n v a -> Array n v a
- Data.Array.Internal.RankedG: stretchOuter :: (HasCallStack, 1 <= n) => Int -> Array n v a -> Array n v a
+ Data.Array.Internal.RankedG: stretchOuter :: forall (n :: Natural) (v :: Type -> Type) a. (HasCallStack, 1 <= n) => Int -> Array n v a -> Array n v a
- Data.Array.Internal.RankedG: stride :: Vector v => [Int] -> Array n v a -> Array n v a
+ Data.Array.Internal.RankedG: stride :: forall (v :: Type -> Type) (n :: Nat) a. Vector v => [Int] -> Array n v a -> Array n v a
- Data.Array.Internal.RankedG: sumA :: (Vector v, VecElem v a, Num a) => Array r v a -> a
+ Data.Array.Internal.RankedG: sumA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a, Num a) => Array r v a -> a
- Data.Array.Internal.RankedG: toList :: (Vector v, VecElem v a) => Array n v a -> [a]
+ Data.Array.Internal.RankedG: toList :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a) => Array n v a -> [a]
- Data.Array.Internal.RankedG: toVector :: (Vector v, VecElem v a) => Array n v a -> v a
+ Data.Array.Internal.RankedG: toVector :: forall v a (n :: Nat). (Vector v, VecElem v a) => Array n v a -> v a
- Data.Array.Internal.RankedG: transpose :: forall n v a. KnownNat n => [Int] -> Array n v a -> Array n v a
+ Data.Array.Internal.RankedG: transpose :: forall (n :: Nat) (v :: Type -> Type) a. KnownNat n => [Int] -> Array n v a -> Array n v a
- Data.Array.Internal.RankedG: traverseA :: (Vector v, VecElem v a, VecElem v b, Applicative f) => (a -> f b) -> Array n v a -> f (Array n v b)
+ Data.Array.Internal.RankedG: traverseA :: forall (v :: Type -> Type) a b f (n :: Nat). (Vector v, VecElem v a, VecElem v b, Applicative f) => (a -> f b) -> Array n v a -> f (Array n v b)
- Data.Array.Internal.RankedG: unScalar :: (Vector v, VecElem v a) => Array 0 v a -> a
+ Data.Array.Internal.RankedG: unScalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Array 0 v a -> a
- Data.Array.Internal.RankedG: unravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array n v a)) => Array (1 + n) v a -> Array 1 v' (Array n v a)
+ Data.Array.Internal.RankedG: unravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a (n :: Nat). (Vector v, Vector v', VecElem v a, VecElem v' (Array n v a)) => Array (1 + n) v a -> Array 1 v' (Array n v a)
- Data.Array.Internal.RankedG: window :: forall n n' v a. (Vector v, KnownNat n, KnownNat n') => [Int] -> Array n v a -> Array n' v a
+ Data.Array.Internal.RankedG: window :: forall (n :: Nat) (n' :: Nat) (v :: Type -> Type) a. (Vector v, KnownNat n, KnownNat n') => [Int] -> Array n v a -> Array n' v a
- Data.Array.Internal.RankedG: zipWith3A :: (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => (a -> b -> c -> d) -> Array n v a -> Array n v b -> Array n v c -> Array n v d
+ Data.Array.Internal.RankedG: zipWith3A :: forall (v :: Type -> Type) a b c d (n :: Nat). (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => (a -> b -> c -> d) -> Array n v a -> Array n v b -> Array n v c -> Array n v d
- Data.Array.Internal.RankedG: zipWithA :: (Vector v, VecElem v a, VecElem v b, VecElem v c) => (a -> b -> c) -> Array n v a -> Array n v b -> Array n v c
+ Data.Array.Internal.RankedG: zipWithA :: forall (v :: Type -> Type) a b c (n :: Nat). (Vector v, VecElem v a, VecElem v b, VecElem v c) => (a -> b -> c) -> Array n v a -> Array n v b -> Array n v c
- Data.Array.Internal.RankedS: A :: Array n Vector a -> Array n a
+ Data.Array.Internal.RankedS: A :: Array n Vector a -> Array (n :: Nat) a
- Data.Array.Internal.RankedS: [unA] :: Array n a -> Array n Vector a
+ Data.Array.Internal.RankedS: [unA] :: Array (n :: Nat) a -> Array n Vector a
- Data.Array.Internal.RankedS: allA :: Unbox a => (a -> Bool) -> Array r a -> Bool
+ Data.Array.Internal.RankedS: allA :: forall a (r :: Nat). Unbox a => (a -> Bool) -> Array r a -> Bool
- Data.Array.Internal.RankedS: allSameA :: (Unbox a, Eq a) => Array n a -> Bool
+ Data.Array.Internal.RankedS: allSameA :: forall a (n :: Nat). (Unbox a, Eq a) => Array n a -> Bool
- Data.Array.Internal.RankedS: anyA :: Unbox a => (a -> Bool) -> Array r a -> Bool
+ Data.Array.Internal.RankedS: anyA :: forall a (r :: Nat). Unbox a => (a -> Bool) -> Array r a -> Bool
- Data.Array.Internal.RankedS: append :: (Unbox a, KnownNat n) => Array n a -> Array n a -> Array n a
+ Data.Array.Internal.RankedS: append :: forall a (n :: Nat). (Unbox a, KnownNat n) => Array n a -> Array n a -> Array n a
- Data.Array.Internal.RankedS: broadcast :: forall r' r a. (HasCallStack, Unbox a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
+ Data.Array.Internal.RankedS: broadcast :: forall (r' :: Nat) (r :: Nat) a. (HasCallStack, Unbox a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
- Data.Array.Internal.RankedS: class Vector v
+ Data.Array.Internal.RankedS: class Vector (v :: Type -> Type)
- Data.Array.Internal.RankedS: concatOuter :: (Unbox a, KnownNat n) => [Array n a] -> Array n a
+ Data.Array.Internal.RankedS: concatOuter :: forall a (n :: Nat). (Unbox a, KnownNat n) => [Array n a] -> Array n a
- Data.Array.Internal.RankedS: constant :: (Unbox a, KnownNat n) => ShapeL -> a -> Array n a
+ Data.Array.Internal.RankedS: constant :: forall a (n :: Nat). (Unbox a, KnownNat n) => ShapeL -> a -> Array n a
- Data.Array.Internal.RankedS: foldrA :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Array n a -> b
+ Data.Array.Internal.RankedS: foldrA :: forall a b (n :: Nat). (Unbox a, Unbox b) => (a -> b -> b) -> b -> Array n a -> b
- Data.Array.Internal.RankedS: fromList :: forall n a. (Unbox a, KnownNat n) => ShapeL -> [a] -> Array n a
+ Data.Array.Internal.RankedS: fromList :: forall (n :: Nat) a. (Unbox a, KnownNat n) => ShapeL -> [a] -> Array n a
- Data.Array.Internal.RankedS: fromVector :: (Unbox a, KnownNat n) => ShapeL -> Vector a -> Array n a
+ Data.Array.Internal.RankedS: fromVector :: forall a (n :: Nat). (Unbox a, KnownNat n) => ShapeL -> Vector a -> Array n a
- Data.Array.Internal.RankedS: generate :: forall n a. (KnownNat n, Unbox a) => ShapeL -> ([Int] -> a) -> Array n a
+ Data.Array.Internal.RankedS: generate :: forall (n :: Nat) a. (KnownNat n, Unbox a) => ShapeL -> ([Int] -> a) -> Array n a
- Data.Array.Internal.RankedS: index :: Unbox a => Array (1 + n) a -> Int -> Array n a
+ Data.Array.Internal.RankedS: index :: forall a (n :: Natural). Unbox a => Array (1 + n) a -> Int -> Array n a
- Data.Array.Internal.RankedS: iterateN :: forall a. Unbox a => Int -> (a -> a) -> a -> Array 1 a
+ Data.Array.Internal.RankedS: iterateN :: Unbox a => Int -> (a -> a) -> a -> Array 1 a
- Data.Array.Internal.RankedS: mapA :: (Unbox a, Unbox b) => (a -> b) -> Array n a -> Array n b
+ Data.Array.Internal.RankedS: mapA :: forall a b (n :: Nat). (Unbox a, Unbox b) => (a -> b) -> Array n a -> Array n b
- Data.Array.Internal.RankedS: maximumA :: (Unbox a, Ord a) => Array r a -> a
+ Data.Array.Internal.RankedS: maximumA :: forall a (r :: Nat). (Unbox a, Ord a) => Array r a -> a
- Data.Array.Internal.RankedS: minimumA :: (Unbox a, Ord a) => Array r a -> a
+ Data.Array.Internal.RankedS: minimumA :: forall a (r :: Nat). (Unbox a, Ord a) => Array r a -> a
- Data.Array.Internal.RankedS: newtype Array n a
+ Data.Array.Internal.RankedS: newtype Array (n :: Nat) a
- Data.Array.Internal.RankedS: normalize :: (Unbox a, KnownNat n) => Array n a -> Array n a
+ Data.Array.Internal.RankedS: normalize :: forall a (n :: Nat). (Unbox a, KnownNat n) => Array n a -> Array n a
- Data.Array.Internal.RankedS: pad :: (Unbox a, KnownNat n) => [(Int, Int)] -> a -> Array n a -> Array n a
+ Data.Array.Internal.RankedS: pad :: forall a (n :: Nat). (Unbox a, KnownNat n) => [(Int, Int)] -> a -> Array n a -> Array n a
- Data.Array.Internal.RankedS: productA :: (Unbox a, Num a) => Array r a -> a
+ Data.Array.Internal.RankedS: productA :: forall a (r :: Nat). (Unbox a, Num a) => Array r a -> a
- Data.Array.Internal.RankedS: rank :: KnownNat n => Array n a -> Int
+ Data.Array.Internal.RankedS: rank :: forall (n :: Nat) a. KnownNat n => Array n a -> Int
- Data.Array.Internal.RankedS: ravel :: (Unbox a, KnownNat (1 + n)) => Array 1 (Array n a) -> Array (1 + n) a
+ Data.Array.Internal.RankedS: ravel :: forall a (n :: Natural). (Unbox a, KnownNat (1 + n)) => Array 1 (Array n a) -> Array (1 + n) a
- Data.Array.Internal.RankedS: reduce :: Unbox a => (a -> a -> a) -> a -> Array n a -> Array 0 a
+ Data.Array.Internal.RankedS: reduce :: forall a (n :: Nat). Unbox a => (a -> a -> a) -> a -> Array n a -> Array 0 a
- Data.Array.Internal.RankedS: rerank :: forall n i o a b. (Unbox a, Unbox b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
+ Data.Array.Internal.RankedS: rerank :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b. (Unbox a, Unbox b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
- Data.Array.Internal.RankedS: rerank2 :: forall n i o a b c. (Unbox a, Unbox b, Unbox c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
+ Data.Array.Internal.RankedS: rerank2 :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b c. (Unbox a, Unbox b, Unbox c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
- Data.Array.Internal.RankedS: reshape :: (Unbox a, KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
+ Data.Array.Internal.RankedS: reshape :: forall a (n :: Nat) (n' :: Nat). (Unbox a, KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
- Data.Array.Internal.RankedS: rev :: [Int] -> Array n a -> Array n a
+ Data.Array.Internal.RankedS: rev :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.Internal.RankedS: rotate :: forall d p a. (KnownNat p, KnownNat d, Unbox a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
+ Data.Array.Internal.RankedS: rotate :: forall (d :: Nat) (p :: Nat) a. (KnownNat p, KnownNat d, Unbox a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
- Data.Array.Internal.RankedS: shapeL :: Array n a -> ShapeL
+ Data.Array.Internal.RankedS: shapeL :: forall (n :: Nat) a. Array n a -> ShapeL
- Data.Array.Internal.RankedS: size :: Array n a -> Int
+ Data.Array.Internal.RankedS: size :: forall (n :: Nat) a. Array n a -> Int
- Data.Array.Internal.RankedS: slice :: [(Int, Int)] -> Array n a -> Array n a
+ Data.Array.Internal.RankedS: slice :: forall (n :: Nat) a. [(Int, Int)] -> Array n a -> Array n a
- Data.Array.Internal.RankedS: stretch :: ShapeL -> Array n a -> Array n a
+ Data.Array.Internal.RankedS: stretch :: forall (n :: Nat) a. ShapeL -> Array n a -> Array n a
- Data.Array.Internal.RankedS: stretchOuter :: (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
+ Data.Array.Internal.RankedS: stretchOuter :: forall (n :: Natural) a. (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
- Data.Array.Internal.RankedS: stride :: [Int] -> Array n a -> Array n a
+ Data.Array.Internal.RankedS: stride :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.Internal.RankedS: sumA :: (Unbox a, Num a) => Array r a -> a
+ Data.Array.Internal.RankedS: sumA :: forall a (r :: Nat). (Unbox a, Num a) => Array r a -> a
- Data.Array.Internal.RankedS: toList :: Unbox a => Array n a -> [a]
+ Data.Array.Internal.RankedS: toList :: forall a (n :: Nat). Unbox a => Array n a -> [a]
- Data.Array.Internal.RankedS: toVector :: forall n a. Unbox a => Array n a -> Vector a
+ Data.Array.Internal.RankedS: toVector :: forall (n :: Nat) a. Unbox a => Array n a -> Vector a
- Data.Array.Internal.RankedS: transpose :: KnownNat n => [Int] -> Array n a -> Array n a
+ Data.Array.Internal.RankedS: transpose :: forall (n :: Nat) a. KnownNat n => [Int] -> Array n a -> Array n a
- Data.Array.Internal.RankedS: traverseA :: (Unbox a, Unbox b, Applicative f) => (a -> f b) -> Array n a -> f (Array n b)
+ Data.Array.Internal.RankedS: traverseA :: forall a b f (n :: Nat). (Unbox a, Unbox b, Applicative f) => (a -> f b) -> Array n a -> f (Array n b)
- Data.Array.Internal.RankedS: unravel :: Unbox a => Array (1 + n) a -> Array 1 (Array n a)
+ Data.Array.Internal.RankedS: unravel :: forall a (n :: Natural). Unbox a => Array (1 + n) a -> Array 1 (Array n a)
- Data.Array.Internal.RankedS: window :: (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
+ Data.Array.Internal.RankedS: window :: forall (n :: Nat) (n' :: Nat) a. (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
- Data.Array.Internal.RankedS: zipWith3A :: (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
+ Data.Array.Internal.RankedS: zipWith3A :: forall a b c d (n :: Nat). (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
- Data.Array.Internal.RankedS: zipWithA :: (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Array n a -> Array n b -> Array n c
+ Data.Array.Internal.RankedS: zipWithA :: forall a b c (n :: Nat). (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Array n a -> Array n b -> Array n c
- Data.Array.Internal.RankedU: A :: Array n Vector a -> Array n a
+ Data.Array.Internal.RankedU: A :: Array n Vector a -> Array (n :: Nat) a
- Data.Array.Internal.RankedU: [unA] :: Array n a -> Array n Vector a
+ Data.Array.Internal.RankedU: [unA] :: Array (n :: Nat) a -> Array n Vector a
- Data.Array.Internal.RankedU: allA :: Unbox a => (a -> Bool) -> Array r a -> Bool
+ Data.Array.Internal.RankedU: allA :: forall a (r :: Nat). Unbox a => (a -> Bool) -> Array r a -> Bool
- Data.Array.Internal.RankedU: allSameA :: (Unbox a, Eq a) => Array n a -> Bool
+ Data.Array.Internal.RankedU: allSameA :: forall a (n :: Nat). (Unbox a, Eq a) => Array n a -> Bool
- Data.Array.Internal.RankedU: anyA :: Unbox a => (a -> Bool) -> Array r a -> Bool
+ Data.Array.Internal.RankedU: anyA :: forall a (r :: Nat). Unbox a => (a -> Bool) -> Array r a -> Bool
- Data.Array.Internal.RankedU: append :: (Unbox a, KnownNat n) => Array n a -> Array n a -> Array n a
+ Data.Array.Internal.RankedU: append :: forall a (n :: Nat). (Unbox a, KnownNat n) => Array n a -> Array n a -> Array n a
- Data.Array.Internal.RankedU: broadcast :: forall r' r a. (HasCallStack, Unbox a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
+ Data.Array.Internal.RankedU: broadcast :: forall (r' :: Nat) (r :: Nat) a. (HasCallStack, Unbox a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
- Data.Array.Internal.RankedU: class Vector v
+ Data.Array.Internal.RankedU: class Vector (v :: Type -> Type)
- Data.Array.Internal.RankedU: concatOuter :: (Unbox a, KnownNat n) => [Array n a] -> Array n a
+ Data.Array.Internal.RankedU: concatOuter :: forall a (n :: Nat). (Unbox a, KnownNat n) => [Array n a] -> Array n a
- Data.Array.Internal.RankedU: constant :: (Unbox a, KnownNat n) => ShapeL -> a -> Array n a
+ Data.Array.Internal.RankedU: constant :: forall a (n :: Nat). (Unbox a, KnownNat n) => ShapeL -> a -> Array n a
- Data.Array.Internal.RankedU: foldrA :: Unbox a => (a -> b -> b) -> b -> Array n a -> b
+ Data.Array.Internal.RankedU: foldrA :: forall a b (n :: Nat). Unbox a => (a -> b -> b) -> b -> Array n a -> b
- Data.Array.Internal.RankedU: fromList :: forall n a. (Unbox a, KnownNat n) => ShapeL -> [a] -> Array n a
+ Data.Array.Internal.RankedU: fromList :: forall (n :: Nat) a. (Unbox a, KnownNat n) => ShapeL -> [a] -> Array n a
- Data.Array.Internal.RankedU: fromVector :: (Unbox a, KnownNat n) => ShapeL -> Vector a -> Array n a
+ Data.Array.Internal.RankedU: fromVector :: forall a (n :: Nat). (Unbox a, KnownNat n) => ShapeL -> Vector a -> Array n a
- Data.Array.Internal.RankedU: generate :: forall n a. (KnownNat n, Unbox a) => ShapeL -> ([Int] -> a) -> Array n a
+ Data.Array.Internal.RankedU: generate :: forall (n :: Nat) a. (KnownNat n, Unbox a) => ShapeL -> ([Int] -> a) -> Array n a
- Data.Array.Internal.RankedU: index :: Unbox a => Array (1 + n) a -> Int -> Array n a
+ Data.Array.Internal.RankedU: index :: forall a (n :: Natural). Unbox a => Array (1 + n) a -> Int -> Array n a
- Data.Array.Internal.RankedU: iterateN :: forall a. Unbox a => Int -> (a -> a) -> a -> Array 1 a
+ Data.Array.Internal.RankedU: iterateN :: Unbox a => Int -> (a -> a) -> a -> Array 1 a
- Data.Array.Internal.RankedU: mapA :: (Unbox a, Unbox b) => (a -> b) -> Array n a -> Array n b
+ Data.Array.Internal.RankedU: mapA :: forall a b (n :: Nat). (Unbox a, Unbox b) => (a -> b) -> Array n a -> Array n b
- Data.Array.Internal.RankedU: maximumA :: (Unbox a, Ord a) => Array r a -> a
+ Data.Array.Internal.RankedU: maximumA :: forall a (r :: Nat). (Unbox a, Ord a) => Array r a -> a
- Data.Array.Internal.RankedU: minimumA :: (Unbox a, Ord a) => Array r a -> a
+ Data.Array.Internal.RankedU: minimumA :: forall a (r :: Nat). (Unbox a, Ord a) => Array r a -> a
- Data.Array.Internal.RankedU: newtype Array n a
+ Data.Array.Internal.RankedU: newtype Array (n :: Nat) a
- Data.Array.Internal.RankedU: normalize :: (Unbox a, KnownNat n) => Array n a -> Array n a
+ Data.Array.Internal.RankedU: normalize :: forall a (n :: Nat). (Unbox a, KnownNat n) => Array n a -> Array n a
- Data.Array.Internal.RankedU: pad :: (Unbox a, KnownNat n) => [(Int, Int)] -> a -> Array n a -> Array n a
+ Data.Array.Internal.RankedU: pad :: forall a (n :: Nat). (Unbox a, KnownNat n) => [(Int, Int)] -> a -> Array n a -> Array n a
- Data.Array.Internal.RankedU: productA :: (Unbox a, Num a) => Array r a -> a
+ Data.Array.Internal.RankedU: productA :: forall a (r :: Nat). (Unbox a, Num a) => Array r a -> a
- Data.Array.Internal.RankedU: rank :: KnownNat n => Array n a -> Int
+ Data.Array.Internal.RankedU: rank :: forall (n :: Nat) a. KnownNat n => Array n a -> Int
- Data.Array.Internal.RankedU: ravel :: (Unbox a, Unbox (Array n a), Unbox (Array n Vector a), KnownNat (1 + n)) => Array 1 (Array n a) -> Array (1 + n) a
+ Data.Array.Internal.RankedU: ravel :: forall a (n :: Nat). (Unbox a, Unbox (Array n a), Unbox (Array n Vector a), KnownNat (1 + n)) => Array 1 (Array n a) -> Array (1 + n) a
- Data.Array.Internal.RankedU: reduce :: Unbox a => (a -> a -> a) -> a -> Array n a -> Array 0 a
+ Data.Array.Internal.RankedU: reduce :: forall a (n :: Nat). Unbox a => (a -> a -> a) -> a -> Array n a -> Array 0 a
- Data.Array.Internal.RankedU: rerank :: forall n i o a b. (Unbox a, Unbox b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
+ Data.Array.Internal.RankedU: rerank :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b. (Unbox a, Unbox b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
- Data.Array.Internal.RankedU: rerank2 :: forall n i o a b c. (Unbox a, Unbox b, Unbox c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
+ Data.Array.Internal.RankedU: rerank2 :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b c. (Unbox a, Unbox b, Unbox c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
- Data.Array.Internal.RankedU: reshape :: (Unbox a, KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
+ Data.Array.Internal.RankedU: reshape :: forall a (n :: Nat) (n' :: Nat). (Unbox a, KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
- Data.Array.Internal.RankedU: rev :: [Int] -> Array n a -> Array n a
+ Data.Array.Internal.RankedU: rev :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.Internal.RankedU: rotate :: forall d p a. (KnownNat p, KnownNat d, Unbox a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
+ Data.Array.Internal.RankedU: rotate :: forall (d :: Nat) (p :: Nat) a. (KnownNat p, KnownNat d, Unbox a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
- Data.Array.Internal.RankedU: shapeL :: Array n a -> ShapeL
+ Data.Array.Internal.RankedU: shapeL :: forall (n :: Nat) a. Array n a -> ShapeL
- Data.Array.Internal.RankedU: size :: Array n a -> Int
+ Data.Array.Internal.RankedU: size :: forall (n :: Nat) a. Array n a -> Int
- Data.Array.Internal.RankedU: slice :: [(Int, Int)] -> Array n a -> Array n a
+ Data.Array.Internal.RankedU: slice :: forall (n :: Nat) a. [(Int, Int)] -> Array n a -> Array n a
- Data.Array.Internal.RankedU: stretch :: ShapeL -> Array n a -> Array n a
+ Data.Array.Internal.RankedU: stretch :: forall (n :: Nat) a. ShapeL -> Array n a -> Array n a
- Data.Array.Internal.RankedU: stretchOuter :: (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
+ Data.Array.Internal.RankedU: stretchOuter :: forall (n :: Natural) a. (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
- Data.Array.Internal.RankedU: stride :: [Int] -> Array n a -> Array n a
+ Data.Array.Internal.RankedU: stride :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.Internal.RankedU: sumA :: (Unbox a, Num a) => Array r a -> a
+ Data.Array.Internal.RankedU: sumA :: forall a (r :: Nat). (Unbox a, Num a) => Array r a -> a
- Data.Array.Internal.RankedU: toList :: Unbox a => Array n a -> [a]
+ Data.Array.Internal.RankedU: toList :: forall a (n :: Nat). Unbox a => Array n a -> [a]
- Data.Array.Internal.RankedU: toVector :: forall n a. Unbox a => Array n a -> Vector a
+ Data.Array.Internal.RankedU: toVector :: forall (n :: Nat) a. Unbox a => Array n a -> Vector a
- Data.Array.Internal.RankedU: transpose :: KnownNat n => [Int] -> Array n a -> Array n a
+ Data.Array.Internal.RankedU: transpose :: forall (n :: Nat) a. KnownNat n => [Int] -> Array n a -> Array n a
- Data.Array.Internal.RankedU: traverseA :: (Unbox a, Unbox b, Applicative f) => (a -> f b) -> Array n a -> f (Array n b)
+ Data.Array.Internal.RankedU: traverseA :: forall a b f (n :: Nat). (Unbox a, Unbox b, Applicative f) => (a -> f b) -> Array n a -> f (Array n b)
- Data.Array.Internal.RankedU: unravel :: (Unbox a, Unbox (Array n a), Unbox (Array n Vector a)) => Array (1 + n) a -> Array 1 (Array n a)
+ Data.Array.Internal.RankedU: unravel :: forall a (n :: Nat). (Unbox a, Unbox (Array n a), Unbox (Array n Vector a)) => Array (1 + n) a -> Array 1 (Array n a)
- Data.Array.Internal.RankedU: window :: (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
+ Data.Array.Internal.RankedU: window :: forall (n :: Nat) (n' :: Nat) a. (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
- Data.Array.Internal.RankedU: zipWith3A :: (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
+ Data.Array.Internal.RankedU: zipWith3A :: forall a b c d (n :: Nat). (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
- Data.Array.Internal.RankedU: zipWithA :: (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Array n a -> Array n b -> Array n c
+ Data.Array.Internal.RankedU: zipWithA :: forall a b c (n :: Nat). (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Array n a -> Array n b -> Array n c
- Data.Array.Internal.Shape: class (Typeable s) => Shape (s :: [Nat])
+ Data.Array.Internal.Shape: class Typeable s => Shape (s :: [Nat])
- Data.Array.Internal.Shape: shapeT :: forall sh. Shape sh => [Int]
+ Data.Array.Internal.Shape: shapeT :: forall (sh :: [Nat]). Shape sh => [Int]
- Data.Array.Internal.Shape: sizeT :: forall sh. Shape sh => Int
+ Data.Array.Internal.Shape: sizeT :: forall (sh :: [Nat]). Shape sh => Int
- Data.Array.Internal.Shape: type DivRoundUp n m = Div (n + m - 1) m
+ Data.Array.Internal.Shape: type DivRoundUp (n :: Natural) (m :: Natural) = Div n + m - 1 m
- Data.Array.Internal.Shape: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is (Take (Rank is) xs) ++ Drop (Rank is) xs
+ Data.Array.Internal.Shape: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is Take Rank is xs ++ Drop Rank is xs
- Data.Array.Internal.Shape: type family Index (xs :: [Nat]) (i :: Nat)
+ Data.Array.Internal.Shape: type family Index (xs :: [Nat]) (i :: Nat) :: Nat
- Data.Array.Internal.Shape: withShape :: [Int] -> (forall sh. Shape sh => r) -> r
+ Data.Array.Internal.Shape: withShape :: [Int] -> (forall (sh :: [Nat]). Shape sh => r) -> r
- Data.Array.Internal.Shape: withShapeP :: [Int] -> (forall sh. Shape sh => Proxy sh -> r) -> r
+ Data.Array.Internal.Shape: withShapeP :: [Int] -> (forall (sh :: [Nat]). Shape sh => Proxy sh -> r) -> r
- Data.Array.Internal.Shaped: A :: Array sh Vector a -> Array sh a
+ Data.Array.Internal.Shaped: A :: Array sh Vector a -> Array (sh :: [Nat]) a
- Data.Array.Internal.Shaped: [unA] :: Array sh a -> Array sh Vector a
+ Data.Array.Internal.Shaped: [unA] :: Array (sh :: [Nat]) a -> Array sh Vector a
- Data.Array.Internal.Shaped: allA :: Shape sh => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.Internal.Shaped: allA :: forall (sh :: [Nat]) a. Shape sh => (a -> Bool) -> Array sh a -> Bool
- Data.Array.Internal.Shaped: allSameA :: (Shape sh, Eq a) => Array sh a -> Bool
+ Data.Array.Internal.Shaped: allSameA :: forall (sh :: [Nat]) a. (Shape sh, Eq a) => Array sh a -> Bool
- Data.Array.Internal.Shaped: anyA :: Shape sh => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.Internal.Shaped: anyA :: forall (sh :: [Nat]) a. Shape sh => (a -> Bool) -> Array sh a -> Bool
- Data.Array.Internal.Shaped: append :: (Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
+ Data.Array.Internal.Shaped: append :: forall (sh :: [Nat]) (m :: Nat) (n :: Nat) a. (Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
- Data.Array.Internal.Shaped: broadcast :: forall ds sh' sh a. (Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
+ Data.Array.Internal.Shaped: broadcast :: forall (ds :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
- Data.Array.Internal.Shaped: class (Typeable s) => Shape (s :: [Nat])
+ Data.Array.Internal.Shaped: class Typeable s => Shape (s :: [Nat])
- Data.Array.Internal.Shaped: class Vector v
+ Data.Array.Internal.Shaped: class Vector (v :: Type -> Type)
- Data.Array.Internal.Shaped: constant :: forall sh a. Shape sh => a -> Array sh a
+ Data.Array.Internal.Shaped: constant :: forall (sh :: [Nat]) a. Shape sh => a -> Array sh a
- Data.Array.Internal.Shaped: foldrA :: Shape sh => (a -> b -> b) -> b -> Array sh a -> b
+ Data.Array.Internal.Shaped: foldrA :: forall (sh :: [Nat]) a b. Shape sh => (a -> b -> b) -> b -> Array sh a -> b
- Data.Array.Internal.Shaped: fromList :: forall sh a. (HasCallStack, Shape sh) => [a] -> Array sh a
+ Data.Array.Internal.Shaped: fromList :: forall (sh :: [Nat]) a. (HasCallStack, Shape sh) => [a] -> Array sh a
- Data.Array.Internal.Shaped: fromVector :: forall sh a. (HasCallStack, Shape sh) => Vector a -> Array sh a
+ Data.Array.Internal.Shaped: fromVector :: forall (sh :: [Nat]) a. (HasCallStack, Shape sh) => Vector a -> Array sh a
- Data.Array.Internal.Shaped: generate :: Shape sh => ([Int] -> a) -> Array sh a
+ Data.Array.Internal.Shaped: generate :: forall (sh :: [Nat]) a. Shape sh => ([Int] -> a) -> Array sh a
- Data.Array.Internal.Shaped: index :: (HasCallStack, KnownNat s) => Array (s : sh) a -> Int -> Array sh a
+ Data.Array.Internal.Shaped: index :: forall (s :: Nat) (sh :: [Nat]) a. (HasCallStack, KnownNat s) => Array (s ': sh) a -> Int -> Array sh a
- Data.Array.Internal.Shaped: iota :: (KnownNat n, Enum a, Num a) => Array '[n] a
+ Data.Array.Internal.Shaped: iota :: forall (n :: Nat) a. (KnownNat n, Enum a, Num a) => Array '[n] a
- Data.Array.Internal.Shaped: iterateN :: forall n a. KnownNat n => (a -> a) -> a -> Array '[n] a
+ Data.Array.Internal.Shaped: iterateN :: forall (n :: Nat) a. KnownNat n => (a -> a) -> a -> Array '[n] a
- Data.Array.Internal.Shaped: mapA :: Shape sh => (a -> b) -> Array sh a -> Array sh b
+ Data.Array.Internal.Shaped: mapA :: forall (sh :: [Nat]) a b. Shape sh => (a -> b) -> Array sh a -> Array sh b
- Data.Array.Internal.Shaped: maximumA :: (Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.Internal.Shaped: maximumA :: forall a (sh :: [Nat]). (Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.Internal.Shaped: minimumA :: (Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.Internal.Shaped: minimumA :: forall a (sh :: [Nat]). (Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.Internal.Shaped: newtype Array sh a
+ Data.Array.Internal.Shaped: newtype Array (sh :: [Nat]) a
- Data.Array.Internal.Shaped: normalize :: Shape sh => Array sh a -> Array sh a
+ Data.Array.Internal.Shaped: normalize :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Array sh a
- Data.Array.Internal.Shaped: pad :: forall ps sh' sh a. (HasCallStack, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
+ Data.Array.Internal.Shaped: pad :: forall (ps :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. (HasCallStack, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
- Data.Array.Internal.Shaped: productA :: (Num a, Shape sh) => Array sh a -> a
+ Data.Array.Internal.Shaped: productA :: forall a (sh :: [Nat]). (Num a, Shape sh) => Array sh a -> a
- Data.Array.Internal.Shaped: rank :: (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
+ Data.Array.Internal.Shaped: rank :: forall (sh :: [Nat]) a. (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
- Data.Array.Internal.Shaped: ravel :: (Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s : sh) a
+ Data.Array.Internal.Shaped: ravel :: forall (sh :: [Nat]) (s :: Nat) a. (Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s ': sh) a
- Data.Array.Internal.Shaped: reduce :: Shape sh => (a -> a -> a) -> a -> Array sh a -> Array '[] a
+ Data.Array.Internal.Shaped: reduce :: forall (sh :: [Nat]) a. Shape sh => (a -> a -> a) -> a -> Array sh a -> Array ('[] :: [Nat]) a
- Data.Array.Internal.Shaped: rerank :: forall n i o sh a b. (Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
+ Data.Array.Internal.Shaped: rerank :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b. (Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
- Data.Array.Internal.Shaped: rerank2 :: forall n i o sh a b c. (Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
+ Data.Array.Internal.Shaped: rerank2 :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b c. (Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
- Data.Array.Internal.Shaped: reshape :: forall sh' sh a. (Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
+ Data.Array.Internal.Shaped: reshape :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
- Data.Array.Internal.Shaped: rev :: forall rs sh a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
+ Data.Array.Internal.Shaped: rev :: forall (rs :: [Nat]) (sh :: [Nat]) a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
- Data.Array.Internal.Shaped: scalar :: a -> Array '[] a
+ Data.Array.Internal.Shaped: scalar :: a -> Array ('[] :: [Nat]) a
- Data.Array.Internal.Shaped: shapeL :: Shape sh => Array sh a -> ShapeL
+ Data.Array.Internal.Shaped: shapeL :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> ShapeL
- Data.Array.Internal.Shaped: size :: forall sh a. Shape sh => Array sh a -> Int
+ Data.Array.Internal.Shaped: size :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Int
- Data.Array.Internal.Shaped: slice :: forall sl sh' sh a. Slice sl sh sh' => Array sh a -> Array sh' a
+ Data.Array.Internal.Shaped: slice :: forall (sl :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. Slice sl sh sh' => Array sh a -> Array sh' a
- Data.Array.Internal.Shaped: stretch :: forall sh' sh a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
+ Data.Array.Internal.Shaped: stretch :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
- Data.Array.Internal.Shaped: stretchOuter :: (KnownNat s, Shape sh) => Array (1 : sh) a -> Array (s : sh) a
+ Data.Array.Internal.Shaped: stretchOuter :: forall (s :: Nat) (sh :: [Nat]) a. (KnownNat s, Shape sh) => Array (1 ': sh) a -> Array (s ': sh) a
- Data.Array.Internal.Shaped: stride :: forall ts sh' sh a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
+ Data.Array.Internal.Shaped: stride :: forall (ts :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
- Data.Array.Internal.Shaped: sumA :: (Num a, Shape sh) => Array sh a -> a
+ Data.Array.Internal.Shaped: sumA :: forall a (sh :: [Nat]). (Num a, Shape sh) => Array sh a -> a
- Data.Array.Internal.Shaped: toList :: forall sh a. Shape sh => Array sh a -> [a]
+ Data.Array.Internal.Shaped: toList :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> [a]
- Data.Array.Internal.Shaped: toVector :: Shape sh => Array sh a -> Vector a
+ Data.Array.Internal.Shaped: toVector :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Vector a
- Data.Array.Internal.Shaped: transpose :: forall is sh a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
+ Data.Array.Internal.Shaped: transpose :: forall (is :: [Nat]) (sh :: [Nat]) a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
- Data.Array.Internal.Shaped: traverseA :: (Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
+ Data.Array.Internal.Shaped: traverseA :: forall f (sh :: [Nat]) a b. (Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
- Data.Array.Internal.Shaped: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is (Take (Rank is) xs) ++ Drop (Rank is) xs
+ Data.Array.Internal.Shaped: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is Take Rank is xs ++ Drop Rank is xs
- Data.Array.Internal.Shaped: unScalar :: Array '[] a -> a
+ Data.Array.Internal.Shaped: unScalar :: Array ('[] :: [Nat]) a -> a
- Data.Array.Internal.Shaped: unravel :: (Shape sh, KnownNat s) => Array (s : sh) a -> Array '[s] (Array sh a)
+ Data.Array.Internal.Shaped: unravel :: forall (sh :: [Nat]) (s :: Nat) a. (Shape sh, KnownNat s) => Array (s ': sh) a -> Array '[s] (Array sh a)
- Data.Array.Internal.Shaped: window :: forall ws sh' sh a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
+ Data.Array.Internal.Shaped: window :: forall (ws :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
- Data.Array.Internal.Shaped: zipWith3A :: Shape sh => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
+ Data.Array.Internal.Shaped: zipWith3A :: forall (sh :: [Nat]) a b c d. Shape sh => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
- Data.Array.Internal.Shaped: zipWithA :: Shape sh => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
+ Data.Array.Internal.Shaped: zipWithA :: forall (sh :: [Nat]) a b c. Shape sh => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
- Data.Array.Internal.ShapedG: A :: T v a -> Array (sh :: [Nat]) v a
+ Data.Array.Internal.ShapedG: A :: T v a -> Array (sh :: [Nat]) (v :: Type -> Type) a
- Data.Array.Internal.ShapedG: allA :: (Vector v, VecElem v a, Shape sh) => (a -> Bool) -> Array sh v a -> Bool
+ Data.Array.Internal.ShapedG: allA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => (a -> Bool) -> Array sh v a -> Bool
- Data.Array.Internal.ShapedG: allSameA :: (Shape sh, Vector v, VecElem v a, Eq a) => Array sh v a -> Bool
+ Data.Array.Internal.ShapedG: allSameA :: forall (sh :: [Nat]) (v :: Type -> Type) a. (Shape sh, Vector v, VecElem v a, Eq a) => Array sh v a -> Bool
- Data.Array.Internal.ShapedG: anyA :: (Vector v, VecElem v a, Shape sh) => (a -> Bool) -> Array sh v a -> Bool
+ Data.Array.Internal.ShapedG: anyA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => (a -> Bool) -> Array sh v a -> Bool
- Data.Array.Internal.ShapedG: append :: (Vector v, VecElem v a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) v a -> Array (n ': sh) v a -> Array ((m + n) ': sh) v a
+ Data.Array.Internal.ShapedG: append :: forall (v :: Type -> Type) a (sh :: [Nat]) (m :: Nat) (n :: Nat). (Vector v, VecElem v a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) v a -> Array (n ': sh) v a -> Array ((m + n) ': sh) v a
- Data.Array.Internal.ShapedG: broadcast :: forall ds sh' sh v a. (Shape sh, Shape sh', Broadcast ds sh sh', Vector v, VecElem v a) => Array sh v a -> Array sh' v a
+ Data.Array.Internal.ShapedG: broadcast :: forall (ds :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Shape sh, Shape sh', Broadcast ds sh sh', Vector v, VecElem v a) => Array sh v a -> Array sh' v a
- Data.Array.Internal.ShapedG: class (Typeable s) => Shape (s :: [Nat])
+ Data.Array.Internal.ShapedG: class Typeable s => Shape (s :: [Nat])
- Data.Array.Internal.ShapedG: class Vector v
+ Data.Array.Internal.ShapedG: class Vector (v :: Type -> Type)
- Data.Array.Internal.ShapedG: constant :: forall sh v a. (Vector v, VecElem v a, Shape sh) => a -> Array sh v a
+ Data.Array.Internal.ShapedG: constant :: forall (sh :: [Nat]) (v :: Type -> Type) a. (Vector v, VecElem v a, Shape sh) => a -> Array sh v a
- Data.Array.Internal.ShapedG: foldrA :: (Vector v, VecElem v a, Shape sh) => (a -> b -> b) -> b -> Array sh v a -> b
+ Data.Array.Internal.ShapedG: foldrA :: forall (v :: Type -> Type) a (sh :: [Nat]) b. (Vector v, VecElem v a, Shape sh) => (a -> b -> b) -> b -> Array sh v a -> b
- Data.Array.Internal.ShapedG: fromList :: forall sh v a. (HasCallStack, Vector v, VecElem v a, Shape sh) => [a] -> Array sh v a
+ Data.Array.Internal.ShapedG: fromList :: forall (sh :: [Nat]) (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, Shape sh) => [a] -> Array sh v a
- Data.Array.Internal.ShapedG: fromVector :: forall sh v a. (HasCallStack, Vector v, VecElem v a, Shape sh) => v a -> Array sh v a
+ Data.Array.Internal.ShapedG: fromVector :: forall (sh :: [Nat]) v a. (HasCallStack, Vector v, VecElem v a, Shape sh) => v a -> Array sh v a
- Data.Array.Internal.ShapedG: generate :: forall sh v a. (Vector v, VecElem v a, Shape sh) => ([Int] -> a) -> Array sh v a
+ Data.Array.Internal.ShapedG: generate :: forall (sh :: [Nat]) (v :: Type -> Type) a. (Vector v, VecElem v a, Shape sh) => ([Int] -> a) -> Array sh v a
- Data.Array.Internal.ShapedG: index :: forall s sh v a. (HasCallStack, Vector v, KnownNat s) => Array (s : sh) v a -> Int -> Array sh v a
+ Data.Array.Internal.ShapedG: index :: forall (s :: Nat) (sh :: [Nat]) (v :: Type -> Type) a. (HasCallStack, Vector v, KnownNat s) => Array (s ': sh) v a -> Int -> Array sh v a
- Data.Array.Internal.ShapedG: iota :: forall n v a. (Vector v, VecElem v a, KnownNat n, Enum a, Num a) => Array '[n] v a
+ Data.Array.Internal.ShapedG: iota :: forall (n :: Nat) (v :: Type -> Type) a. (Vector v, VecElem v a, KnownNat n, Enum a, Num a) => Array '[n] v a
- Data.Array.Internal.ShapedG: iterateN :: forall n v a. (Vector v, VecElem v a, KnownNat n) => (a -> a) -> a -> Array '[n] v a
+ Data.Array.Internal.ShapedG: iterateN :: forall (n :: Nat) (v :: Type -> Type) a. (Vector v, VecElem v a, KnownNat n) => (a -> a) -> a -> Array '[n] v a
- Data.Array.Internal.ShapedG: mapA :: (Vector v, VecElem v a, VecElem v b, Shape sh) => (a -> b) -> Array sh v a -> Array sh v b
+ Data.Array.Internal.ShapedG: mapA :: forall (v :: Type -> Type) a b (sh :: [Nat]). (Vector v, VecElem v a, VecElem v b, Shape sh) => (a -> b) -> Array sh v a -> Array sh v b
- Data.Array.Internal.ShapedG: maximumA :: (Vector v, VecElem v a, Ord a, Shape sh, 1 <= Size sh) => Array sh v a -> a
+ Data.Array.Internal.ShapedG: maximumA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Ord a, Shape sh, 1 <= Size sh) => Array sh v a -> a
- Data.Array.Internal.ShapedG: minimumA :: (Vector v, VecElem v a, Ord a, Shape sh, 1 <= Size sh) => Array sh v a -> a
+ Data.Array.Internal.ShapedG: minimumA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Ord a, Shape sh, 1 <= Size sh) => Array sh v a -> a
- Data.Array.Internal.ShapedG: newtype Array (sh :: [Nat]) v a
+ Data.Array.Internal.ShapedG: newtype Array (sh :: [Nat]) (v :: Type -> Type) a
- Data.Array.Internal.ShapedG: normalize :: (Vector v, VecElem v a, Shape sh) => Array sh v a -> Array sh v a
+ Data.Array.Internal.ShapedG: normalize :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => Array sh v a -> Array sh v a
- Data.Array.Internal.ShapedG: pad :: forall ps sh' sh a v. (HasCallStack, Vector v, VecElem v a, Padded ps sh sh', Shape sh) => a -> Array sh v a -> Array sh' v a
+ Data.Array.Internal.ShapedG: pad :: forall (ps :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a (v :: Type -> Type). (HasCallStack, Vector v, VecElem v a, Padded ps sh sh', Shape sh) => a -> Array sh v a -> Array sh' v a
- Data.Array.Internal.ShapedG: productA :: (Vector v, VecElem v a, Num a, Shape sh) => Array sh v a -> a
+ Data.Array.Internal.ShapedG: productA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Num a, Shape sh) => Array sh v a -> a
- Data.Array.Internal.ShapedG: rank :: forall sh v a. (Shape sh, KnownNat (Rank sh)) => Array sh v a -> Int
+ Data.Array.Internal.ShapedG: rank :: forall (sh :: [Nat]) (v :: Type -> Type) a. (Shape sh, KnownNat (Rank sh)) => Array sh v a -> Int
- Data.Array.Internal.ShapedG: ravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array sh v a), Shape sh, KnownNat s) => Array '[s] v' (Array sh v a) -> Array (s : sh) v a
+ Data.Array.Internal.ShapedG: ravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a (sh :: [Nat]) (s :: Nat). (Vector v, Vector v', VecElem v a, VecElem v' (Array sh v a), Shape sh, KnownNat s) => Array '[s] v' (Array sh v a) -> Array (s ': sh) v a
- Data.Array.Internal.ShapedG: reduce :: (Vector v, VecElem v a, Shape sh) => (a -> a -> a) -> a -> Array sh v a -> Array '[] v a
+ Data.Array.Internal.ShapedG: reduce :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => (a -> a -> a) -> a -> Array sh v a -> Array ('[] :: [Nat]) v a
- Data.Array.Internal.ShapedG: rerank :: forall n i o sh v v' a b. (Vector v, Vector v', VecElem v a, VecElem v' b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i v a -> Array o v' b) -> Array sh v a -> Array (Take n sh ++ o) v' b
+ Data.Array.Internal.ShapedG: rerank :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) (v' :: Type -> Type) a b. (Vector v, Vector v', VecElem v a, VecElem v' b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i v a -> Array o v' b) -> Array sh v a -> Array (Take n sh ++ o) v' b
- Data.Array.Internal.ShapedG: rerank2 :: forall n i1 i2 o sh1 sh2 r v a b c. (Vector v, VecElem v a, VecElem v b, VecElem v c, Drop n sh1 ~ i1, Drop n sh2 ~ i2, Shape sh1, Shape sh2, Take n sh1 ~ r, Take n sh2 ~ r, KnownNat n, Shape o, Shape (r ++ o)) => (Array i1 v a -> Array i2 v b -> Array o v c) -> Array sh1 v a -> Array sh2 v b -> Array (r ++ o) v c
+ Data.Array.Internal.ShapedG: rerank2 :: forall (n :: Nat) (i1 :: [Nat]) (i2 :: [Nat]) (o :: [Nat]) (sh1 :: [Nat]) (sh2 :: [Nat]) (r :: [Nat]) (v :: Type -> Type) a b c. (Vector v, VecElem v a, VecElem v b, VecElem v c, Drop n sh1 ~ i1, Drop n sh2 ~ i2, Shape sh1, Shape sh2, Take n sh1 ~ r, Take n sh2 ~ r, KnownNat n, Shape o, Shape (r ++ o)) => (Array i1 v a -> Array i2 v b -> Array o v c) -> Array sh1 v a -> Array sh2 v b -> Array (r ++ o) v c
- Data.Array.Internal.ShapedG: reshape :: forall sh' sh v a. (Vector v, VecElem v a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh v a -> Array sh' v a
+ Data.Array.Internal.ShapedG: reshape :: forall (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Vector v, VecElem v a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh v a -> Array sh' v a
- Data.Array.Internal.ShapedG: rev :: forall rs sh v a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh v a -> Array sh v a
+ Data.Array.Internal.ShapedG: rev :: forall (rs :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh v a -> Array sh v a
- Data.Array.Internal.ShapedG: scalar :: (Vector v, VecElem v a) => a -> Array '[] v a
+ Data.Array.Internal.ShapedG: scalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => a -> Array ('[] :: [Nat]) v a
- Data.Array.Internal.ShapedG: shapeL :: forall sh v a. Shape sh => Array sh v a -> ShapeL
+ Data.Array.Internal.ShapedG: shapeL :: forall (sh :: [Nat]) (v :: Type -> Type) a. Shape sh => Array sh v a -> ShapeL
- Data.Array.Internal.ShapedG: size :: forall sh v a. Shape sh => Array sh v a -> Int
+ Data.Array.Internal.ShapedG: size :: forall (sh :: [Nat]) (v :: Type -> Type) a. Shape sh => Array sh v a -> Int
- Data.Array.Internal.ShapedG: slice :: forall sl sh' sh v a. Slice sl sh sh' => Array sh v a -> Array sh' v a
+ Data.Array.Internal.ShapedG: slice :: forall (sl :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. Slice sl sh sh' => Array sh v a -> Array sh' v a
- Data.Array.Internal.ShapedG: stretch :: forall sh' sh v a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh v a -> Array sh' v a
+ Data.Array.Internal.ShapedG: stretch :: forall (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh v a -> Array sh' v a
- Data.Array.Internal.ShapedG: stretchOuter :: forall s sh v a. Shape sh => Array (1 : sh) v a -> Array (s : sh) v a
+ Data.Array.Internal.ShapedG: stretchOuter :: forall (s :: Nat) (sh :: [Nat]) (v :: Type -> Type) a. Shape sh => Array (1 ': sh) v a -> Array (s ': sh) v a
- Data.Array.Internal.ShapedG: stride :: forall ts sh' sh v a. (Stride ts sh sh', Vector v, Shape ts) => Array sh v a -> Array sh' v a
+ Data.Array.Internal.ShapedG: stride :: forall (ts :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Stride ts sh sh', Vector v, Shape ts) => Array sh v a -> Array sh' v a
- Data.Array.Internal.ShapedG: sumA :: (Vector v, VecElem v a, Num a, Shape sh) => Array sh v a -> a
+ Data.Array.Internal.ShapedG: sumA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Num a, Shape sh) => Array sh v a -> a
- Data.Array.Internal.ShapedG: toList :: (Vector v, VecElem v a, Shape sh) => Array sh v a -> [a]
+ Data.Array.Internal.ShapedG: toList :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => Array sh v a -> [a]
- Data.Array.Internal.ShapedG: toVector :: (Vector v, VecElem v a, Shape sh) => Array sh v a -> v a
+ Data.Array.Internal.ShapedG: toVector :: forall v a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => Array sh v a -> v a
- Data.Array.Internal.ShapedG: transpose :: forall is sh v a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh v a -> Array (Permute is sh) v a
+ Data.Array.Internal.ShapedG: transpose :: forall (is :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh v a -> Array (Permute is sh) v a
- Data.Array.Internal.ShapedG: traverseA :: (Vector v, VecElem v a, VecElem v b, Applicative f, Shape sh) => (a -> f b) -> Array sh v a -> f (Array sh v b)
+ Data.Array.Internal.ShapedG: traverseA :: forall (v :: Type -> Type) a b f (sh :: [Nat]). (Vector v, VecElem v a, VecElem v b, Applicative f, Shape sh) => (a -> f b) -> Array sh v a -> f (Array sh v b)
- Data.Array.Internal.ShapedG: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is (Take (Rank is) xs) ++ Drop (Rank is) xs
+ Data.Array.Internal.ShapedG: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is Take Rank is xs ++ Drop Rank is xs
- Data.Array.Internal.ShapedG: type family Rank (s :: [Nat]) :: Nat
+ Data.Array.Internal.ShapedG: type family VecElem (v :: Type -> Type) :: Type -> Constraint
- Data.Array.Internal.ShapedG: unScalar :: (Vector v, VecElem v a) => Array '[] v a -> a
+ Data.Array.Internal.ShapedG: unScalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Array ('[] :: [Nat]) v a -> a
- Data.Array.Internal.ShapedG: unravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array sh v a), Shape sh, KnownNat s) => Array (s : sh) v a -> Array '[s] v' (Array sh v a)
+ Data.Array.Internal.ShapedG: unravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a (sh :: [Nat]) (s :: Nat). (Vector v, Vector v', VecElem v a, VecElem v' (Array sh v a), Shape sh, KnownNat s) => Array (s ': sh) v a -> Array '[s] v' (Array sh v a)
- Data.Array.Internal.ShapedG: window :: forall ws sh' sh v a. (Window ws sh sh', Vector v, KnownNat (Rank ws)) => Array sh v a -> Array sh' v a
+ Data.Array.Internal.ShapedG: window :: forall (ws :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Window ws sh sh', Vector v, KnownNat (Rank ws)) => Array sh v a -> Array sh' v a
- Data.Array.Internal.ShapedG: zipWith3A :: (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, Shape sh) => (a -> b -> c -> d) -> Array sh v a -> Array sh v b -> Array sh v c -> Array sh v d
+ Data.Array.Internal.ShapedG: zipWith3A :: forall (v :: Type -> Type) a b c d (sh :: [Nat]). (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, Shape sh) => (a -> b -> c -> d) -> Array sh v a -> Array sh v b -> Array sh v c -> Array sh v d
- Data.Array.Internal.ShapedG: zipWithA :: (Vector v, VecElem v a, VecElem v b, VecElem v c, Shape sh) => (a -> b -> c) -> Array sh v a -> Array sh v b -> Array sh v c
+ Data.Array.Internal.ShapedG: zipWithA :: forall (v :: Type -> Type) a b c (sh :: [Nat]). (Vector v, VecElem v a, VecElem v b, VecElem v c, Shape sh) => (a -> b -> c) -> Array sh v a -> Array sh v b -> Array sh v c
- Data.Array.Internal.ShapedS: A :: Array sh Vector a -> Array sh a
+ Data.Array.Internal.ShapedS: A :: Array sh Vector a -> Array (sh :: [Nat]) a
- Data.Array.Internal.ShapedS: [unA] :: Array sh a -> Array sh Vector a
+ Data.Array.Internal.ShapedS: [unA] :: Array (sh :: [Nat]) a -> Array sh Vector a
- Data.Array.Internal.ShapedS: allA :: (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.Internal.ShapedS: allA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
- Data.Array.Internal.ShapedS: allSameA :: (Shape sh, Unbox a, Eq a) => Array sh a -> Bool
+ Data.Array.Internal.ShapedS: allSameA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a, Eq a) => Array sh a -> Bool
- Data.Array.Internal.ShapedS: anyA :: (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.Internal.ShapedS: anyA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
- Data.Array.Internal.ShapedS: append :: (Unbox a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
+ Data.Array.Internal.ShapedS: append :: forall a (sh :: [Nat]) (m :: Nat) (n :: Nat). (Unbox a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
- Data.Array.Internal.ShapedS: broadcast :: forall ds sh' sh a. (Unbox a, Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedS: broadcast :: forall (ds :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedS: class (Typeable s) => Shape (s :: [Nat])
+ Data.Array.Internal.ShapedS: class Typeable s => Shape (s :: [Nat])
- Data.Array.Internal.ShapedS: class Vector v
+ Data.Array.Internal.ShapedS: class Vector (v :: Type -> Type)
- Data.Array.Internal.ShapedS: constant :: forall sh a. (Unbox a, Shape sh) => a -> Array sh a
+ Data.Array.Internal.ShapedS: constant :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => a -> Array sh a
- Data.Array.Internal.ShapedS: foldrA :: (Unbox a, Shape sh) => (a -> b -> b) -> b -> Array sh a -> b
+ Data.Array.Internal.ShapedS: foldrA :: forall a (sh :: [Nat]) b. (Unbox a, Shape sh) => (a -> b -> b) -> b -> Array sh a -> b
- Data.Array.Internal.ShapedS: fromList :: forall sh a. (HasCallStack, Unbox a, Shape sh) => [a] -> Array sh a
+ Data.Array.Internal.ShapedS: fromList :: forall (sh :: [Nat]) a. (HasCallStack, Unbox a, Shape sh) => [a] -> Array sh a
- Data.Array.Internal.ShapedS: fromVector :: forall sh a. (HasCallStack, Unbox a, Shape sh) => Vector a -> Array sh a
+ Data.Array.Internal.ShapedS: fromVector :: forall (sh :: [Nat]) a. (HasCallStack, Unbox a, Shape sh) => Vector a -> Array sh a
- Data.Array.Internal.ShapedS: generate :: (Unbox a, Shape sh) => ([Int] -> a) -> Array sh a
+ Data.Array.Internal.ShapedS: generate :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => ([Int] -> a) -> Array sh a
- Data.Array.Internal.ShapedS: index :: (Unbox a, KnownNat s) => Array (s : sh) a -> Int -> Array sh a
+ Data.Array.Internal.ShapedS: index :: forall a (s :: Nat) (sh :: [Nat]). (Unbox a, KnownNat s) => Array (s ': sh) a -> Int -> Array sh a
- Data.Array.Internal.ShapedS: iota :: (KnownNat n, Unbox a, Enum a, Num a) => Array '[n] a
+ Data.Array.Internal.ShapedS: iota :: forall (n :: Nat) a. (KnownNat n, Unbox a, Enum a, Num a) => Array '[n] a
- Data.Array.Internal.ShapedS: iterateN :: forall n a. (Unbox a, KnownNat n) => (a -> a) -> a -> Array '[n] a
+ Data.Array.Internal.ShapedS: iterateN :: forall (n :: Nat) a. (Unbox a, KnownNat n) => (a -> a) -> a -> Array '[n] a
- Data.Array.Internal.ShapedS: mapA :: (Unbox a, Unbox b, Shape sh) => (a -> b) -> Array sh a -> Array sh b
+ Data.Array.Internal.ShapedS: mapA :: forall a b (sh :: [Nat]). (Unbox a, Unbox b, Shape sh) => (a -> b) -> Array sh a -> Array sh b
- Data.Array.Internal.ShapedS: maximumA :: (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.Internal.ShapedS: maximumA :: forall a (sh :: [Nat]). (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.Internal.ShapedS: minimumA :: (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.Internal.ShapedS: minimumA :: forall a (sh :: [Nat]). (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.Internal.ShapedS: newtype Array sh a
+ Data.Array.Internal.ShapedS: newtype Array (sh :: [Nat]) a
- Data.Array.Internal.ShapedS: normalize :: (Unbox a, Shape sh) => Array sh a -> Array sh a
+ Data.Array.Internal.ShapedS: normalize :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => Array sh a -> Array sh a
- Data.Array.Internal.ShapedS: pad :: forall ps sh' sh a. (Unbox a, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedS: pad :: forall (ps :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
- Data.Array.Internal.ShapedS: productA :: (Unbox a, Num a, Shape sh) => Array sh a -> a
+ Data.Array.Internal.ShapedS: productA :: forall a (sh :: [Nat]). (Unbox a, Num a, Shape sh) => Array sh a -> a
- Data.Array.Internal.ShapedS: rank :: (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
+ Data.Array.Internal.ShapedS: rank :: forall (sh :: [Nat]) a. (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
- Data.Array.Internal.ShapedS: ravel :: (Unbox a, Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s : sh) a
+ Data.Array.Internal.ShapedS: ravel :: forall a (sh :: [Nat]) (s :: Nat). (Unbox a, Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s ': sh) a
- Data.Array.Internal.ShapedS: reduce :: (Unbox a, Shape sh) => (a -> a -> a) -> a -> Array sh a -> Array '[] a
+ Data.Array.Internal.ShapedS: reduce :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => (a -> a -> a) -> a -> Array sh a -> Array ('[] :: [Nat]) a
- Data.Array.Internal.ShapedS: rerank :: forall n i o sh a b. (Unbox a, Unbox b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
+ Data.Array.Internal.ShapedS: rerank :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b. (Unbox a, Unbox b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
- Data.Array.Internal.ShapedS: rerank2 :: forall n i o sh a b c. (Unbox a, Unbox b, Unbox c, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
+ Data.Array.Internal.ShapedS: rerank2 :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b c. (Unbox a, Unbox b, Unbox c, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
- Data.Array.Internal.ShapedS: reshape :: forall sh' sh a. (Unbox a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedS: reshape :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedS: rev :: forall rs sh a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
+ Data.Array.Internal.ShapedS: rev :: forall (rs :: [Nat]) (sh :: [Nat]) a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
- Data.Array.Internal.ShapedS: scalar :: Unbox a => a -> Array '[] a
+ Data.Array.Internal.ShapedS: scalar :: Unbox a => a -> Array ('[] :: [Nat]) a
- Data.Array.Internal.ShapedS: shapeL :: Shape sh => Array sh a -> ShapeL
+ Data.Array.Internal.ShapedS: shapeL :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> ShapeL
- Data.Array.Internal.ShapedS: size :: forall sh a. Shape sh => Array sh a -> Int
+ Data.Array.Internal.ShapedS: size :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Int
- Data.Array.Internal.ShapedS: slice :: forall sl sh' sh a. Slice sl sh sh' => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedS: slice :: forall (sl :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. Slice sl sh sh' => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedS: stretch :: forall sh' sh a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedS: stretch :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedS: stretchOuter :: (KnownNat s, Shape sh) => Array (1 : sh) a -> Array (s : sh) a
+ Data.Array.Internal.ShapedS: stretchOuter :: forall (s :: Nat) (sh :: [Nat]) a. (KnownNat s, Shape sh) => Array (1 ': sh) a -> Array (s ': sh) a
- Data.Array.Internal.ShapedS: stride :: forall ts sh' sh a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedS: stride :: forall (ts :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedS: sumA :: (Unbox a, Num a, Shape sh) => Array sh a -> a
+ Data.Array.Internal.ShapedS: sumA :: forall a (sh :: [Nat]). (Unbox a, Num a, Shape sh) => Array sh a -> a
- Data.Array.Internal.ShapedS: toList :: forall sh a. (Unbox a, Shape sh) => Array sh a -> [a]
+ Data.Array.Internal.ShapedS: toList :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => Array sh a -> [a]
- Data.Array.Internal.ShapedS: toVector :: (Unbox a, Shape sh) => Array sh a -> Vector a
+ Data.Array.Internal.ShapedS: toVector :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => Array sh a -> Vector a
- Data.Array.Internal.ShapedS: transpose :: forall is sh a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
+ Data.Array.Internal.ShapedS: transpose :: forall (is :: [Nat]) (sh :: [Nat]) a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
- Data.Array.Internal.ShapedS: traverseA :: (Unbox a, Unbox b, Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
+ Data.Array.Internal.ShapedS: traverseA :: forall a b f (sh :: [Nat]). (Unbox a, Unbox b, Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
- Data.Array.Internal.ShapedS: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is (Take (Rank is) xs) ++ Drop (Rank is) xs
+ Data.Array.Internal.ShapedS: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is Take Rank is xs ++ Drop Rank is xs
- Data.Array.Internal.ShapedS: unScalar :: Unbox a => Array '[] a -> a
+ Data.Array.Internal.ShapedS: unScalar :: Unbox a => Array ('[] :: [Nat]) a -> a
- Data.Array.Internal.ShapedS: unravel :: (Unbox a, Shape sh, KnownNat s) => Array (s : sh) a -> Array '[s] (Array sh a)
+ Data.Array.Internal.ShapedS: unravel :: forall a (sh :: [Nat]) (s :: Nat). (Unbox a, Shape sh, KnownNat s) => Array (s ': sh) a -> Array '[s] (Array sh a)
- Data.Array.Internal.ShapedS: window :: forall ws sh' sh a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedS: window :: forall (ws :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedS: zipWith3A :: (Unbox a, Unbox b, Unbox c, Unbox d, Shape sh) => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
+ Data.Array.Internal.ShapedS: zipWith3A :: forall a b c d (sh :: [Nat]). (Unbox a, Unbox b, Unbox c, Unbox d, Shape sh) => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
- Data.Array.Internal.ShapedS: zipWithA :: (Unbox a, Unbox b, Unbox c, Shape sh) => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
+ Data.Array.Internal.ShapedS: zipWithA :: forall a b c (sh :: [Nat]). (Unbox a, Unbox b, Unbox c, Shape sh) => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
- Data.Array.Internal.ShapedU: A :: Array sh Vector a -> Array sh a
+ Data.Array.Internal.ShapedU: A :: Array sh Vector a -> Array (sh :: [Nat]) a
- Data.Array.Internal.ShapedU: [unA] :: Array sh a -> Array sh Vector a
+ Data.Array.Internal.ShapedU: [unA] :: Array (sh :: [Nat]) a -> Array sh Vector a
- Data.Array.Internal.ShapedU: allA :: (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.Internal.ShapedU: allA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
- Data.Array.Internal.ShapedU: allSameA :: (Shape sh, Unbox a, Eq a) => Array sh a -> Bool
+ Data.Array.Internal.ShapedU: allSameA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a, Eq a) => Array sh a -> Bool
- Data.Array.Internal.ShapedU: anyA :: (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.Internal.ShapedU: anyA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
- Data.Array.Internal.ShapedU: append :: (Unbox a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
+ Data.Array.Internal.ShapedU: append :: forall a (sh :: [Nat]) (m :: Nat) (n :: Nat). (Unbox a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
- Data.Array.Internal.ShapedU: broadcast :: forall ds sh' sh a. (Unbox a, Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedU: broadcast :: forall (ds :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedU: class (Typeable s) => Shape (s :: [Nat])
+ Data.Array.Internal.ShapedU: class Typeable s => Shape (s :: [Nat])
- Data.Array.Internal.ShapedU: class Vector v
+ Data.Array.Internal.ShapedU: class Vector (v :: Type -> Type)
- Data.Array.Internal.ShapedU: constant :: forall sh a. (Unbox a, Shape sh) => a -> Array sh a
+ Data.Array.Internal.ShapedU: constant :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => a -> Array sh a
- Data.Array.Internal.ShapedU: foldrA :: (Unbox a, Shape sh) => (a -> b -> b) -> b -> Array sh a -> b
+ Data.Array.Internal.ShapedU: foldrA :: forall a (sh :: [Nat]) b. (Unbox a, Shape sh) => (a -> b -> b) -> b -> Array sh a -> b
- Data.Array.Internal.ShapedU: fromList :: forall sh a. (Unbox a, Shape sh) => [a] -> Array sh a
+ Data.Array.Internal.ShapedU: fromList :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => [a] -> Array sh a
- Data.Array.Internal.ShapedU: fromVector :: forall sh a. (Unbox a, Shape sh) => Vector a -> Array sh a
+ Data.Array.Internal.ShapedU: fromVector :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => Vector a -> Array sh a
- Data.Array.Internal.ShapedU: generate :: (Unbox a, Shape sh) => ([Int] -> a) -> Array sh a
+ Data.Array.Internal.ShapedU: generate :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => ([Int] -> a) -> Array sh a
- Data.Array.Internal.ShapedU: index :: (Unbox a, KnownNat s) => Array (s : sh) a -> Int -> Array sh a
+ Data.Array.Internal.ShapedU: index :: forall a (s :: Nat) (sh :: [Nat]). (Unbox a, KnownNat s) => Array (s ': sh) a -> Int -> Array sh a
- Data.Array.Internal.ShapedU: iota :: (KnownNat n, Unbox a, Enum a, Num a) => Array '[n] a
+ Data.Array.Internal.ShapedU: iota :: forall (n :: Nat) a. (KnownNat n, Unbox a, Enum a, Num a) => Array '[n] a
- Data.Array.Internal.ShapedU: iterateN :: forall n a. (Unbox a, KnownNat n) => (a -> a) -> a -> Array '[n] a
+ Data.Array.Internal.ShapedU: iterateN :: forall (n :: Nat) a. (Unbox a, KnownNat n) => (a -> a) -> a -> Array '[n] a
- Data.Array.Internal.ShapedU: mapA :: (Unbox a, Unbox b, Shape sh) => (a -> b) -> Array sh a -> Array sh b
+ Data.Array.Internal.ShapedU: mapA :: forall a b (sh :: [Nat]). (Unbox a, Unbox b, Shape sh) => (a -> b) -> Array sh a -> Array sh b
- Data.Array.Internal.ShapedU: maximumA :: (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.Internal.ShapedU: maximumA :: forall a (sh :: [Nat]). (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.Internal.ShapedU: minimumA :: (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.Internal.ShapedU: minimumA :: forall a (sh :: [Nat]). (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.Internal.ShapedU: newtype Array sh a
+ Data.Array.Internal.ShapedU: newtype Array (sh :: [Nat]) a
- Data.Array.Internal.ShapedU: normalize :: (Unbox a, Shape sh) => Array sh a -> Array sh a
+ Data.Array.Internal.ShapedU: normalize :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => Array sh a -> Array sh a
- Data.Array.Internal.ShapedU: pad :: forall ps sh' sh a. (Unbox a, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedU: pad :: forall (ps :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
- Data.Array.Internal.ShapedU: productA :: (Unbox a, Num a, Shape sh) => Array sh a -> a
+ Data.Array.Internal.ShapedU: productA :: forall a (sh :: [Nat]). (Unbox a, Num a, Shape sh) => Array sh a -> a
- Data.Array.Internal.ShapedU: rank :: (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
+ Data.Array.Internal.ShapedU: rank :: forall (sh :: [Nat]) a. (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
- Data.Array.Internal.ShapedU: ravel :: (Unbox a, Unbox (Array sh a), Unbox (Array sh Vector a), Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s : sh) a
+ Data.Array.Internal.ShapedU: ravel :: forall a (sh :: [Nat]) (s :: Nat). (Unbox a, Unbox (Array sh a), Unbox (Array sh Vector a), Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s ': sh) a
- Data.Array.Internal.ShapedU: reduce :: (Unbox a, Shape sh) => (a -> a -> a) -> a -> Array sh a -> Array '[] a
+ Data.Array.Internal.ShapedU: reduce :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => (a -> a -> a) -> a -> Array sh a -> Array ('[] :: [Nat]) a
- Data.Array.Internal.ShapedU: rerank :: forall n i o sh a b. (Unbox a, Unbox b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
+ Data.Array.Internal.ShapedU: rerank :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b. (Unbox a, Unbox b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
- Data.Array.Internal.ShapedU: rerank2 :: forall n i o sh a b c. (Unbox a, Unbox b, Unbox c, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
+ Data.Array.Internal.ShapedU: rerank2 :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b c. (Unbox a, Unbox b, Unbox c, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
- Data.Array.Internal.ShapedU: reshape :: forall sh' sh a. (Unbox a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedU: reshape :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedU: rev :: forall rs sh a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
+ Data.Array.Internal.ShapedU: rev :: forall (rs :: [Nat]) (sh :: [Nat]) a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
- Data.Array.Internal.ShapedU: scalar :: Unbox a => a -> Array '[] a
+ Data.Array.Internal.ShapedU: scalar :: Unbox a => a -> Array ('[] :: [Nat]) a
- Data.Array.Internal.ShapedU: shapeL :: Shape sh => Array sh a -> ShapeL
+ Data.Array.Internal.ShapedU: shapeL :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> ShapeL
- Data.Array.Internal.ShapedU: size :: forall sh a. Shape sh => Array sh a -> Int
+ Data.Array.Internal.ShapedU: size :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Int
- Data.Array.Internal.ShapedU: slice :: forall sl sh' sh a. Slice sl sh sh' => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedU: slice :: forall (sl :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. Slice sl sh sh' => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedU: stretch :: forall sh' sh a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedU: stretch :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedU: stretchOuter :: (KnownNat s, Shape sh) => Array (1 : sh) a -> Array (s : sh) a
+ Data.Array.Internal.ShapedU: stretchOuter :: forall (s :: Nat) (sh :: [Nat]) a. (KnownNat s, Shape sh) => Array (1 ': sh) a -> Array (s ': sh) a
- Data.Array.Internal.ShapedU: stride :: forall ts sh' sh a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedU: stride :: forall (ts :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedU: sumA :: (Unbox a, Num a, Shape sh) => Array sh a -> a
+ Data.Array.Internal.ShapedU: sumA :: forall a (sh :: [Nat]). (Unbox a, Num a, Shape sh) => Array sh a -> a
- Data.Array.Internal.ShapedU: toList :: forall sh a. (Unbox a, Shape sh) => Array sh a -> [a]
+ Data.Array.Internal.ShapedU: toList :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => Array sh a -> [a]
- Data.Array.Internal.ShapedU: toVector :: (Unbox a, Shape sh) => Array sh a -> Vector a
+ Data.Array.Internal.ShapedU: toVector :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => Array sh a -> Vector a
- Data.Array.Internal.ShapedU: transpose :: forall is sh a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
+ Data.Array.Internal.ShapedU: transpose :: forall (is :: [Nat]) (sh :: [Nat]) a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
- Data.Array.Internal.ShapedU: traverseA :: (Unbox a, Unbox b, Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
+ Data.Array.Internal.ShapedU: traverseA :: forall a b f (sh :: [Nat]). (Unbox a, Unbox b, Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
- Data.Array.Internal.ShapedU: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is (Take (Rank is) xs) ++ Drop (Rank is) xs
+ Data.Array.Internal.ShapedU: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is Take Rank is xs ++ Drop Rank is xs
- Data.Array.Internal.ShapedU: unScalar :: Unbox a => Array '[] a -> a
+ Data.Array.Internal.ShapedU: unScalar :: Unbox a => Array ('[] :: [Nat]) a -> a
- Data.Array.Internal.ShapedU: unravel :: (Unbox a, Unbox (Array sh a), Unbox (Array sh Vector a), Shape sh, KnownNat s) => Array (s : sh) a -> Array '[s] (Array sh a)
+ Data.Array.Internal.ShapedU: unravel :: forall a (sh :: [Nat]) (s :: Nat). (Unbox a, Unbox (Array sh a), Unbox (Array sh Vector a), Shape sh, KnownNat s) => Array (s ': sh) a -> Array '[s] (Array sh a)
- Data.Array.Internal.ShapedU: window :: forall ws sh' sh a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
+ Data.Array.Internal.ShapedU: window :: forall (ws :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
- Data.Array.Internal.ShapedU: zipWith3A :: (Unbox a, Unbox b, Unbox c, Unbox d, Shape sh) => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
+ Data.Array.Internal.ShapedU: zipWith3A :: forall a b c d (sh :: [Nat]). (Unbox a, Unbox b, Unbox c, Unbox d, Shape sh) => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
- Data.Array.Internal.ShapedU: zipWithA :: (Unbox a, Unbox b, Unbox c, Shape sh) => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
+ Data.Array.Internal.ShapedU: zipWithA :: forall a b c (sh :: [Nat]). (Unbox a, Unbox b, Unbox c, Shape sh) => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
- Data.Array.Ranked: allA :: (a -> Bool) -> Array r a -> Bool
+ Data.Array.Ranked: allA :: forall a (r :: Nat). (a -> Bool) -> Array r a -> Bool
- Data.Array.Ranked: allSameA :: Eq a => Array r a -> Bool
+ Data.Array.Ranked: allSameA :: forall a (r :: Nat). Eq a => Array r a -> Bool
- Data.Array.Ranked: anyA :: (a -> Bool) -> Array r a -> Bool
+ Data.Array.Ranked: anyA :: forall a (r :: Nat). (a -> Bool) -> Array r a -> Bool
- Data.Array.Ranked: append :: KnownNat n => Array n a -> Array n a -> Array n a
+ Data.Array.Ranked: append :: forall (n :: Nat) a. KnownNat n => Array n a -> Array n a -> Array n a
- Data.Array.Ranked: broadcast :: forall r' r a. (HasCallStack, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
+ Data.Array.Ranked: broadcast :: forall (r' :: Nat) (r :: Nat) a. (HasCallStack, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
- Data.Array.Ranked: class Vector v
+ Data.Array.Ranked: class Vector (v :: Type -> Type)
- Data.Array.Ranked: concatOuter :: KnownNat n => [Array n a] -> Array n a
+ Data.Array.Ranked: concatOuter :: forall (n :: Nat) a. KnownNat n => [Array n a] -> Array n a
- Data.Array.Ranked: constant :: forall n a. KnownNat n => ShapeL -> a -> Array n a
+ Data.Array.Ranked: constant :: forall (n :: Nat) a. KnownNat n => ShapeL -> a -> Array n a
- Data.Array.Ranked: data Array n a
+ Data.Array.Ranked: data Array (n :: Nat) a
- Data.Array.Ranked: foldrA :: (a -> b -> b) -> b -> Array n a -> b
+ Data.Array.Ranked: foldrA :: forall a b (n :: Nat). (a -> b -> b) -> b -> Array n a -> b
- Data.Array.Ranked: fromList :: forall n a. KnownNat n => ShapeL -> [a] -> Array n a
+ Data.Array.Ranked: fromList :: forall (n :: Nat) a. KnownNat n => ShapeL -> [a] -> Array n a
- Data.Array.Ranked: fromVector :: forall n a. KnownNat n => ShapeL -> Vector a -> Array n a
+ Data.Array.Ranked: fromVector :: forall (n :: Nat) a. KnownNat n => ShapeL -> Vector a -> Array n a
- Data.Array.Ranked: generate :: forall n a. KnownNat n => ShapeL -> ([Int] -> a) -> Array n a
+ Data.Array.Ranked: generate :: forall (n :: Nat) a. KnownNat n => ShapeL -> ([Int] -> a) -> Array n a
- Data.Array.Ranked: index :: HasCallStack => Array (1 + n) a -> Int -> Array n a
+ Data.Array.Ranked: index :: forall (n :: Natural) a. HasCallStack => Array (1 + n) a -> Int -> Array n a
- Data.Array.Ranked: iterateN :: forall a. Int -> (a -> a) -> a -> Array 1 a
+ Data.Array.Ranked: iterateN :: Int -> (a -> a) -> a -> Array 1 a
- Data.Array.Ranked: mapA :: (a -> b) -> Array n a -> Array n b
+ Data.Array.Ranked: mapA :: forall a b (n :: Nat). (a -> b) -> Array n a -> Array n b
- Data.Array.Ranked: maximumA :: Ord a => Array r a -> a
+ Data.Array.Ranked: maximumA :: forall a (r :: Nat). Ord a => Array r a -> a
- Data.Array.Ranked: minimumA :: Ord a => Array r a -> a
+ Data.Array.Ranked: minimumA :: forall a (r :: Nat). Ord a => Array r a -> a
- Data.Array.Ranked: normalize :: KnownNat n => Array n a -> Array n a
+ Data.Array.Ranked: normalize :: forall (n :: Nat) a. KnownNat n => Array n a -> Array n a
- Data.Array.Ranked: pad :: KnownNat n => [(Int, Int)] -> a -> Array n a -> Array n a
+ Data.Array.Ranked: pad :: forall (n :: Nat) a. KnownNat n => [(Int, Int)] -> a -> Array n a -> Array n a
- Data.Array.Ranked: productA :: Num a => Array r a -> a
+ Data.Array.Ranked: productA :: forall a (r :: Nat). Num a => Array r a -> a
- Data.Array.Ranked: rank :: KnownNat n => Array n a -> Int
+ Data.Array.Ranked: rank :: forall (n :: Nat) a. KnownNat n => Array n a -> Int
- Data.Array.Ranked: ravel :: KnownNat (1 + n) => Array 1 (Array n a) -> Array (1 + n) a
+ Data.Array.Ranked: ravel :: forall (n :: Natural) a. KnownNat (1 + n) => Array 1 (Array n a) -> Array (1 + n) a
- Data.Array.Ranked: reduce :: (a -> a -> a) -> a -> Array n a -> Array 0 a
+ Data.Array.Ranked: reduce :: forall a (n :: Nat). (a -> a -> a) -> a -> Array n a -> Array 0 a
- Data.Array.Ranked: rerank :: forall n i o a b. (KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
+ Data.Array.Ranked: rerank :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b. (KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
- Data.Array.Ranked: rerank2 :: forall n i o a b c. (KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
+ Data.Array.Ranked: rerank2 :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b c. (KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
- Data.Array.Ranked: reshape :: forall n' n a. (KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
+ Data.Array.Ranked: reshape :: forall (n' :: Nat) (n :: Nat) a. (KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
- Data.Array.Ranked: rev :: [Int] -> Array n a -> Array n a
+ Data.Array.Ranked: rev :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.Ranked: rotate :: forall d p a. (KnownNat p, KnownNat d, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
+ Data.Array.Ranked: rotate :: forall (d :: Nat) (p :: Nat) a. (KnownNat p, KnownNat d, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
- Data.Array.Ranked: shapeL :: Array n a -> ShapeL
+ Data.Array.Ranked: shapeL :: forall (n :: Nat) a. Array n a -> ShapeL
- Data.Array.Ranked: size :: Array n a -> Int
+ Data.Array.Ranked: size :: forall (n :: Nat) a. Array n a -> Int
- Data.Array.Ranked: slice :: [(Int, Int)] -> Array n a -> Array n a
+ Data.Array.Ranked: slice :: forall (n :: Nat) a. [(Int, Int)] -> Array n a -> Array n a
- Data.Array.Ranked: stretch :: ShapeL -> Array n a -> Array n a
+ Data.Array.Ranked: stretch :: forall (n :: Nat) a. ShapeL -> Array n a -> Array n a
- Data.Array.Ranked: stretchOuter :: (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
+ Data.Array.Ranked: stretchOuter :: forall (n :: Natural) a. (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
- Data.Array.Ranked: stride :: [Int] -> Array n a -> Array n a
+ Data.Array.Ranked: stride :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.Ranked: sumA :: Num a => Array r a -> a
+ Data.Array.Ranked: sumA :: forall a (r :: Nat). Num a => Array r a -> a
- Data.Array.Ranked: toList :: Array n a -> [a]
+ Data.Array.Ranked: toList :: forall (n :: Nat) a. Array n a -> [a]
- Data.Array.Ranked: toVector :: Array n a -> Vector a
+ Data.Array.Ranked: toVector :: forall (n :: Nat) a. Array n a -> Vector a
- Data.Array.Ranked: transpose :: KnownNat n => [Int] -> Array n a -> Array n a
+ Data.Array.Ranked: transpose :: forall (n :: Nat) a. KnownNat n => [Int] -> Array n a -> Array n a
- Data.Array.Ranked: traverseA :: Applicative f => (a -> f b) -> Array n a -> f (Array n b)
+ Data.Array.Ranked: traverseA :: forall f a b (n :: Nat). Applicative f => (a -> f b) -> Array n a -> f (Array n b)
- Data.Array.Ranked: unravel :: Array (1 + n) a -> Array 1 (Array n a)
+ Data.Array.Ranked: unravel :: forall (n :: Natural) a. Array (1 + n) a -> Array 1 (Array n a)
- Data.Array.Ranked: window :: (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
+ Data.Array.Ranked: window :: forall (n :: Nat) (n' :: Nat) a. (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
- Data.Array.Ranked: zipWith3A :: (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
+ Data.Array.Ranked: zipWith3A :: forall a b c d (n :: Nat). (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
- Data.Array.Ranked: zipWithA :: (a -> b -> c) -> Array n a -> Array n b -> Array n c
+ Data.Array.Ranked: zipWithA :: forall a b c (n :: Nat). (a -> b -> c) -> Array n a -> Array n b -> Array n c
- Data.Array.RankedG: allA :: (Vector v, VecElem v a) => (a -> Bool) -> Array r v a -> Bool
+ Data.Array.RankedG: allA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a) => (a -> Bool) -> Array r v a -> Bool
- Data.Array.RankedG: allSameA :: (Vector v, VecElem v a, Eq a) => Array r v a -> Bool
+ Data.Array.RankedG: allSameA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a, Eq a) => Array r v a -> Bool
- Data.Array.RankedG: anyA :: (Vector v, VecElem v a) => (a -> Bool) -> Array r v a -> Bool
+ Data.Array.RankedG: anyA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a) => (a -> Bool) -> Array r v a -> Bool
- Data.Array.RankedG: append :: (Vector v, VecElem v a, KnownNat n) => Array n v a -> Array n v a -> Array n v a
+ Data.Array.RankedG: append :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a, KnownNat n) => Array n v a -> Array n v a -> Array n v a
- Data.Array.RankedG: broadcast :: forall r' r v a. (HasCallStack, Vector v, VecElem v a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r v a -> Array r' v a
+ Data.Array.RankedG: broadcast :: forall (r' :: Nat) (r :: Nat) (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r v a -> Array r' v a
- Data.Array.RankedG: class Vector v where {
+ Data.Array.RankedG: class Vector (v :: Type -> Type) where {
- Data.Array.RankedG: concatOuter :: (Vector v, VecElem v a, KnownNat n) => [Array n v a] -> Array n v a
+ Data.Array.RankedG: concatOuter :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a, KnownNat n) => [Array n v a] -> Array n v a
- Data.Array.RankedG: constant :: forall n v a. (Vector v, VecElem v a, KnownNat n) => ShapeL -> a -> Array n v a
+ Data.Array.RankedG: constant :: forall (n :: Nat) (v :: Type -> Type) a. (Vector v, VecElem v a, KnownNat n) => ShapeL -> a -> Array n v a
- Data.Array.RankedG: data Array (n :: Nat) v a
+ Data.Array.RankedG: data Array (n :: Nat) (v :: Type -> Type) a
- Data.Array.RankedG: foldrA :: (Vector v, VecElem v a) => (a -> b -> b) -> b -> Array n v a -> b
+ Data.Array.RankedG: foldrA :: forall (v :: Type -> Type) a b (n :: Nat). (Vector v, VecElem v a) => (a -> b -> b) -> b -> Array n v a -> b
- Data.Array.RankedG: fromList :: forall n v a. (HasCallStack, Vector v, VecElem v a, KnownNat n) => ShapeL -> [a] -> Array n v a
+ Data.Array.RankedG: fromList :: forall (n :: Nat) (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, KnownNat n) => ShapeL -> [a] -> Array n v a
- Data.Array.RankedG: fromVector :: forall n v a. (HasCallStack, Vector v, VecElem v a, KnownNat n) => ShapeL -> v a -> Array n v a
+ Data.Array.RankedG: fromVector :: forall (n :: Nat) v a. (HasCallStack, Vector v, VecElem v a, KnownNat n) => ShapeL -> v a -> Array n v a
- Data.Array.RankedG: generate :: forall n v a. (KnownNat n, Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> Array n v a
+ Data.Array.RankedG: generate :: forall (n :: Nat) (v :: Type -> Type) a. (KnownNat n, Vector v, VecElem v a) => ShapeL -> ([Int] -> a) -> Array n v a
- Data.Array.RankedG: index :: (Vector v, HasCallStack) => Array (1 + n) v a -> Int -> Array n v a
+ Data.Array.RankedG: index :: forall (v :: Type -> Type) (n :: Natural) a. (Vector v, HasCallStack) => Array (1 + n) v a -> Int -> Array n v a
- Data.Array.RankedG: iota :: forall v a. (Vector v, VecElem v a, Enum a, Num a) => Int -> Array 1 v a
+ Data.Array.RankedG: iota :: forall (v :: Type -> Type) a. (Vector v, VecElem v a, Enum a, Num a) => Int -> Array 1 v a
- Data.Array.RankedG: iterateN :: forall v a. (Vector v, VecElem v a) => Int -> (a -> a) -> a -> Array 1 v a
+ Data.Array.RankedG: iterateN :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Int -> (a -> a) -> a -> Array 1 v a
- Data.Array.RankedG: mapA :: (Vector v, VecElem v a, VecElem v b) => (a -> b) -> Array n v a -> Array n v b
+ Data.Array.RankedG: mapA :: forall (v :: Type -> Type) a b (n :: Nat). (Vector v, VecElem v a, VecElem v b) => (a -> b) -> Array n v a -> Array n v b
- Data.Array.RankedG: maximumA :: (HasCallStack, Vector v, VecElem v a, Ord a) => Array r v a -> a
+ Data.Array.RankedG: maximumA :: forall (v :: Type -> Type) a (r :: Nat). (HasCallStack, Vector v, VecElem v a, Ord a) => Array r v a -> a
- Data.Array.RankedG: minimumA :: (HasCallStack, Vector v, VecElem v a, Ord a) => Array r v a -> a
+ Data.Array.RankedG: minimumA :: forall (v :: Type -> Type) a (r :: Nat). (HasCallStack, Vector v, VecElem v a, Ord a) => Array r v a -> a
- Data.Array.RankedG: normalize :: (Vector v, VecElem v a, KnownNat n) => Array n v a -> Array n v a
+ Data.Array.RankedG: normalize :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a, KnownNat n) => Array n v a -> Array n v a
- Data.Array.RankedG: pad :: forall n a v. (Vector v, VecElem v a) => [(Int, Int)] -> a -> Array n v a -> Array n v a
+ Data.Array.RankedG: pad :: forall (n :: Nat) a (v :: Type -> Type). (Vector v, VecElem v a) => [(Int, Int)] -> a -> Array n v a -> Array n v a
- Data.Array.RankedG: productA :: (Vector v, VecElem v a, Num a) => Array r v a -> a
+ Data.Array.RankedG: productA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a, Num a) => Array r v a -> a
- Data.Array.RankedG: rank :: forall n v a. KnownNat n => Array n v a -> Int
+ Data.Array.RankedG: rank :: forall (n :: Nat) (v :: Type -> Type) a. KnownNat n => Array n v a -> Int
- Data.Array.RankedG: ravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array n v a), KnownNat (1 + n)) => Array 1 v' (Array n v a) -> Array (1 + n) v a
+ Data.Array.RankedG: ravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a (n :: Nat). (Vector v, Vector v', VecElem v a, VecElem v' (Array n v a), KnownNat (1 + n)) => Array 1 v' (Array n v a) -> Array (1 + n) v a
- Data.Array.RankedG: reduce :: (Vector v, VecElem v a) => (a -> a -> a) -> a -> Array n v a -> Array 0 v a
+ Data.Array.RankedG: reduce :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a) => (a -> a -> a) -> a -> Array n v a -> Array 0 v a
- Data.Array.RankedG: rerank :: forall n i o v v' a b. (Vector v, Vector v', VecElem v a, VecElem v' b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i v a -> Array o v' b) -> Array (n + i) v a -> Array (n + o) v' b
+ Data.Array.RankedG: rerank :: forall (n :: Nat) (i :: Nat) (o :: Nat) (v :: Type -> Type) (v' :: Type -> Type) a b. (Vector v, Vector v', VecElem v a, VecElem v' b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i v a -> Array o v' b) -> Array (n + i) v a -> Array (n + o) v' b
- Data.Array.RankedG: rerank2 :: forall n i o a b c v. (Vector v, VecElem v a, VecElem v b, VecElem v c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i v a -> Array i v b -> Array o v c) -> Array (n + i) v a -> Array (n + i) v b -> Array (n + o) v c
+ Data.Array.RankedG: rerank2 :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b c (v :: Type -> Type). (Vector v, VecElem v a, VecElem v b, VecElem v c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i v a -> Array i v b -> Array o v c) -> Array (n + i) v a -> Array (n + i) v b -> Array (n + o) v c
- Data.Array.RankedG: reshape :: forall n n' v a. (HasCallStack, Vector v, VecElem v a, KnownNat n, KnownNat n') => ShapeL -> Array n v a -> Array n' v a
+ Data.Array.RankedG: reshape :: forall (n :: Nat) (n' :: Nat) (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, KnownNat n, KnownNat n') => ShapeL -> Array n v a -> Array n' v a
- Data.Array.RankedG: rev :: [Int] -> Array n v a -> Array n v a
+ Data.Array.RankedG: rev :: forall (n :: Nat) (v :: Type -> Type) a. [Int] -> Array n v a -> Array n v a
- Data.Array.RankedG: rotate :: forall d p v a. (KnownNat p, KnownNat d, Vector v, VecElem v a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) v a -> Array ((p + d) + 1) v a
+ Data.Array.RankedG: rotate :: forall (d :: Nat) (p :: Nat) (v :: Type -> Type) a. (KnownNat p, KnownNat d, Vector v, VecElem v a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) v a -> Array ((p + d) + 1) v a
- Data.Array.RankedG: scalar :: (Vector v, VecElem v a) => a -> Array 0 v a
+ Data.Array.RankedG: scalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => a -> Array 0 v a
- Data.Array.RankedG: shapeL :: Array n v a -> ShapeL
+ Data.Array.RankedG: shapeL :: forall (n :: Nat) (v :: Type -> Type) a. Array n v a -> ShapeL
- Data.Array.RankedG: size :: Array n v a -> Int
+ Data.Array.RankedG: size :: forall (n :: Nat) (v :: Type -> Type) a. Array n v a -> Int
- Data.Array.RankedG: slice :: [(Int, Int)] -> Array n v a -> Array n v a
+ Data.Array.RankedG: slice :: forall (n :: Nat) (v :: Type -> Type) a. [(Int, Int)] -> Array n v a -> Array n v a
- Data.Array.RankedG: stretch :: HasCallStack => ShapeL -> Array n v a -> Array n v a
+ Data.Array.RankedG: stretch :: forall (n :: Nat) (v :: Type -> Type) a. HasCallStack => ShapeL -> Array n v a -> Array n v a
- Data.Array.RankedG: stretchOuter :: (HasCallStack, 1 <= n) => Int -> Array n v a -> Array n v a
+ Data.Array.RankedG: stretchOuter :: forall (n :: Natural) (v :: Type -> Type) a. (HasCallStack, 1 <= n) => Int -> Array n v a -> Array n v a
- Data.Array.RankedG: stride :: Vector v => [Int] -> Array n v a -> Array n v a
+ Data.Array.RankedG: stride :: forall (v :: Type -> Type) (n :: Nat) a. Vector v => [Int] -> Array n v a -> Array n v a
- Data.Array.RankedG: sumA :: (Vector v, VecElem v a, Num a) => Array r v a -> a
+ Data.Array.RankedG: sumA :: forall (v :: Type -> Type) a (r :: Nat). (Vector v, VecElem v a, Num a) => Array r v a -> a
- Data.Array.RankedG: toList :: (Vector v, VecElem v a) => Array n v a -> [a]
+ Data.Array.RankedG: toList :: forall (v :: Type -> Type) a (n :: Nat). (Vector v, VecElem v a) => Array n v a -> [a]
- Data.Array.RankedG: toVector :: (Vector v, VecElem v a) => Array n v a -> v a
+ Data.Array.RankedG: toVector :: forall v a (n :: Nat). (Vector v, VecElem v a) => Array n v a -> v a
- Data.Array.RankedG: transpose :: forall n v a. KnownNat n => [Int] -> Array n v a -> Array n v a
+ Data.Array.RankedG: transpose :: forall (n :: Nat) (v :: Type -> Type) a. KnownNat n => [Int] -> Array n v a -> Array n v a
- Data.Array.RankedG: traverseA :: (Vector v, VecElem v a, VecElem v b, Applicative f) => (a -> f b) -> Array n v a -> f (Array n v b)
+ Data.Array.RankedG: traverseA :: forall (v :: Type -> Type) a b f (n :: Nat). (Vector v, VecElem v a, VecElem v b, Applicative f) => (a -> f b) -> Array n v a -> f (Array n v b)
- Data.Array.RankedG: type VecElem v :: Type -> Constraint;
+ Data.Array.RankedG: type VecElem (v :: Type -> Type) :: Type -> Constraint;
- Data.Array.RankedG: unScalar :: (Vector v, VecElem v a) => Array 0 v a -> a
+ Data.Array.RankedG: unScalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Array 0 v a -> a
- Data.Array.RankedG: unravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array n v a)) => Array (1 + n) v a -> Array 1 v' (Array n v a)
+ Data.Array.RankedG: unravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a (n :: Nat). (Vector v, Vector v', VecElem v a, VecElem v' (Array n v a)) => Array (1 + n) v a -> Array 1 v' (Array n v a)
- Data.Array.RankedG: window :: forall n n' v a. (Vector v, KnownNat n, KnownNat n') => [Int] -> Array n v a -> Array n' v a
+ Data.Array.RankedG: window :: forall (n :: Nat) (n' :: Nat) (v :: Type -> Type) a. (Vector v, KnownNat n, KnownNat n') => [Int] -> Array n v a -> Array n' v a
- Data.Array.RankedG: zipWith3A :: (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => (a -> b -> c -> d) -> Array n v a -> Array n v b -> Array n v c -> Array n v d
+ Data.Array.RankedG: zipWith3A :: forall (v :: Type -> Type) a b c d (n :: Nat). (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d) => (a -> b -> c -> d) -> Array n v a -> Array n v b -> Array n v c -> Array n v d
- Data.Array.RankedG: zipWithA :: (Vector v, VecElem v a, VecElem v b, VecElem v c) => (a -> b -> c) -> Array n v a -> Array n v b -> Array n v c
+ Data.Array.RankedG: zipWithA :: forall (v :: Type -> Type) a b c (n :: Nat). (Vector v, VecElem v a, VecElem v b, VecElem v c) => (a -> b -> c) -> Array n v a -> Array n v b -> Array n v c
- Data.Array.RankedS: allA :: Unbox a => (a -> Bool) -> Array r a -> Bool
+ Data.Array.RankedS: allA :: forall a (r :: Nat). Unbox a => (a -> Bool) -> Array r a -> Bool
- Data.Array.RankedS: allSameA :: (Unbox a, Eq a) => Array n a -> Bool
+ Data.Array.RankedS: allSameA :: forall a (n :: Nat). (Unbox a, Eq a) => Array n a -> Bool
- Data.Array.RankedS: anyA :: Unbox a => (a -> Bool) -> Array r a -> Bool
+ Data.Array.RankedS: anyA :: forall a (r :: Nat). Unbox a => (a -> Bool) -> Array r a -> Bool
- Data.Array.RankedS: append :: (Unbox a, KnownNat n) => Array n a -> Array n a -> Array n a
+ Data.Array.RankedS: append :: forall a (n :: Nat). (Unbox a, KnownNat n) => Array n a -> Array n a -> Array n a
- Data.Array.RankedS: broadcast :: forall r' r a. (HasCallStack, Unbox a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
+ Data.Array.RankedS: broadcast :: forall (r' :: Nat) (r :: Nat) a. (HasCallStack, Unbox a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
- Data.Array.RankedS: class Vector v
+ Data.Array.RankedS: class Vector (v :: Type -> Type)
- Data.Array.RankedS: concatOuter :: (Unbox a, KnownNat n) => [Array n a] -> Array n a
+ Data.Array.RankedS: concatOuter :: forall a (n :: Nat). (Unbox a, KnownNat n) => [Array n a] -> Array n a
- Data.Array.RankedS: constant :: (Unbox a, KnownNat n) => ShapeL -> a -> Array n a
+ Data.Array.RankedS: constant :: forall a (n :: Nat). (Unbox a, KnownNat n) => ShapeL -> a -> Array n a
- Data.Array.RankedS: data Array n a
+ Data.Array.RankedS: data Array (n :: Nat) a
- Data.Array.RankedS: foldrA :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Array n a -> b
+ Data.Array.RankedS: foldrA :: forall a b (n :: Nat). (Unbox a, Unbox b) => (a -> b -> b) -> b -> Array n a -> b
- Data.Array.RankedS: fromList :: forall n a. (Unbox a, KnownNat n) => ShapeL -> [a] -> Array n a
+ Data.Array.RankedS: fromList :: forall (n :: Nat) a. (Unbox a, KnownNat n) => ShapeL -> [a] -> Array n a
- Data.Array.RankedS: fromVector :: (Unbox a, KnownNat n) => ShapeL -> Vector a -> Array n a
+ Data.Array.RankedS: fromVector :: forall a (n :: Nat). (Unbox a, KnownNat n) => ShapeL -> Vector a -> Array n a
- Data.Array.RankedS: generate :: forall n a. (KnownNat n, Unbox a) => ShapeL -> ([Int] -> a) -> Array n a
+ Data.Array.RankedS: generate :: forall (n :: Nat) a. (KnownNat n, Unbox a) => ShapeL -> ([Int] -> a) -> Array n a
- Data.Array.RankedS: index :: Unbox a => Array (1 + n) a -> Int -> Array n a
+ Data.Array.RankedS: index :: forall a (n :: Natural). Unbox a => Array (1 + n) a -> Int -> Array n a
- Data.Array.RankedS: iterateN :: forall a. Unbox a => Int -> (a -> a) -> a -> Array 1 a
+ Data.Array.RankedS: iterateN :: Unbox a => Int -> (a -> a) -> a -> Array 1 a
- Data.Array.RankedS: mapA :: (Unbox a, Unbox b) => (a -> b) -> Array n a -> Array n b
+ Data.Array.RankedS: mapA :: forall a b (n :: Nat). (Unbox a, Unbox b) => (a -> b) -> Array n a -> Array n b
- Data.Array.RankedS: maximumA :: (Unbox a, Ord a) => Array r a -> a
+ Data.Array.RankedS: maximumA :: forall a (r :: Nat). (Unbox a, Ord a) => Array r a -> a
- Data.Array.RankedS: minimumA :: (Unbox a, Ord a) => Array r a -> a
+ Data.Array.RankedS: minimumA :: forall a (r :: Nat). (Unbox a, Ord a) => Array r a -> a
- Data.Array.RankedS: normalize :: (Unbox a, KnownNat n) => Array n a -> Array n a
+ Data.Array.RankedS: normalize :: forall a (n :: Nat). (Unbox a, KnownNat n) => Array n a -> Array n a
- Data.Array.RankedS: pad :: (Unbox a, KnownNat n) => [(Int, Int)] -> a -> Array n a -> Array n a
+ Data.Array.RankedS: pad :: forall a (n :: Nat). (Unbox a, KnownNat n) => [(Int, Int)] -> a -> Array n a -> Array n a
- Data.Array.RankedS: productA :: (Unbox a, Num a) => Array r a -> a
+ Data.Array.RankedS: productA :: forall a (r :: Nat). (Unbox a, Num a) => Array r a -> a
- Data.Array.RankedS: rank :: KnownNat n => Array n a -> Int
+ Data.Array.RankedS: rank :: forall (n :: Nat) a. KnownNat n => Array n a -> Int
- Data.Array.RankedS: ravel :: (Unbox a, KnownNat (1 + n)) => Array 1 (Array n a) -> Array (1 + n) a
+ Data.Array.RankedS: ravel :: forall a (n :: Natural). (Unbox a, KnownNat (1 + n)) => Array 1 (Array n a) -> Array (1 + n) a
- Data.Array.RankedS: reduce :: Unbox a => (a -> a -> a) -> a -> Array n a -> Array 0 a
+ Data.Array.RankedS: reduce :: forall a (n :: Nat). Unbox a => (a -> a -> a) -> a -> Array n a -> Array 0 a
- Data.Array.RankedS: rerank :: forall n i o a b. (Unbox a, Unbox b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
+ Data.Array.RankedS: rerank :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b. (Unbox a, Unbox b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
- Data.Array.RankedS: rerank2 :: forall n i o a b c. (Unbox a, Unbox b, Unbox c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
+ Data.Array.RankedS: rerank2 :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b c. (Unbox a, Unbox b, Unbox c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
- Data.Array.RankedS: reshape :: (Unbox a, KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
+ Data.Array.RankedS: reshape :: forall a (n :: Nat) (n' :: Nat). (Unbox a, KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
- Data.Array.RankedS: rev :: [Int] -> Array n a -> Array n a
+ Data.Array.RankedS: rev :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.RankedS: rotate :: forall d p a. (KnownNat p, KnownNat d, Unbox a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
+ Data.Array.RankedS: rotate :: forall (d :: Nat) (p :: Nat) a. (KnownNat p, KnownNat d, Unbox a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
- Data.Array.RankedS: shapeL :: Array n a -> ShapeL
+ Data.Array.RankedS: shapeL :: forall (n :: Nat) a. Array n a -> ShapeL
- Data.Array.RankedS: size :: Array n a -> Int
+ Data.Array.RankedS: size :: forall (n :: Nat) a. Array n a -> Int
- Data.Array.RankedS: slice :: [(Int, Int)] -> Array n a -> Array n a
+ Data.Array.RankedS: slice :: forall (n :: Nat) a. [(Int, Int)] -> Array n a -> Array n a
- Data.Array.RankedS: stretch :: ShapeL -> Array n a -> Array n a
+ Data.Array.RankedS: stretch :: forall (n :: Nat) a. ShapeL -> Array n a -> Array n a
- Data.Array.RankedS: stretchOuter :: (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
+ Data.Array.RankedS: stretchOuter :: forall (n :: Natural) a. (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
- Data.Array.RankedS: stride :: [Int] -> Array n a -> Array n a
+ Data.Array.RankedS: stride :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.RankedS: sumA :: (Unbox a, Num a) => Array r a -> a
+ Data.Array.RankedS: sumA :: forall a (r :: Nat). (Unbox a, Num a) => Array r a -> a
- Data.Array.RankedS: toList :: Unbox a => Array n a -> [a]
+ Data.Array.RankedS: toList :: forall a (n :: Nat). Unbox a => Array n a -> [a]
- Data.Array.RankedS: toVector :: forall n a. Unbox a => Array n a -> Vector a
+ Data.Array.RankedS: toVector :: forall (n :: Nat) a. Unbox a => Array n a -> Vector a
- Data.Array.RankedS: transpose :: KnownNat n => [Int] -> Array n a -> Array n a
+ Data.Array.RankedS: transpose :: forall (n :: Nat) a. KnownNat n => [Int] -> Array n a -> Array n a
- Data.Array.RankedS: traverseA :: (Unbox a, Unbox b, Applicative f) => (a -> f b) -> Array n a -> f (Array n b)
+ Data.Array.RankedS: traverseA :: forall a b f (n :: Nat). (Unbox a, Unbox b, Applicative f) => (a -> f b) -> Array n a -> f (Array n b)
- Data.Array.RankedS: unravel :: Unbox a => Array (1 + n) a -> Array 1 (Array n a)
+ Data.Array.RankedS: unravel :: forall a (n :: Natural). Unbox a => Array (1 + n) a -> Array 1 (Array n a)
- Data.Array.RankedS: window :: (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
+ Data.Array.RankedS: window :: forall (n :: Nat) (n' :: Nat) a. (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
- Data.Array.RankedS: zipWith3A :: (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
+ Data.Array.RankedS: zipWith3A :: forall a b c d (n :: Nat). (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
- Data.Array.RankedS: zipWithA :: (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Array n a -> Array n b -> Array n c
+ Data.Array.RankedS: zipWithA :: forall a b c (n :: Nat). (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Array n a -> Array n b -> Array n c
- Data.Array.RankedU: allA :: Unbox a => (a -> Bool) -> Array r a -> Bool
+ Data.Array.RankedU: allA :: forall a (r :: Nat). Unbox a => (a -> Bool) -> Array r a -> Bool
- Data.Array.RankedU: allSameA :: (Unbox a, Eq a) => Array n a -> Bool
+ Data.Array.RankedU: allSameA :: forall a (n :: Nat). (Unbox a, Eq a) => Array n a -> Bool
- Data.Array.RankedU: anyA :: Unbox a => (a -> Bool) -> Array r a -> Bool
+ Data.Array.RankedU: anyA :: forall a (r :: Nat). Unbox a => (a -> Bool) -> Array r a -> Bool
- Data.Array.RankedU: append :: (Unbox a, KnownNat n) => Array n a -> Array n a -> Array n a
+ Data.Array.RankedU: append :: forall a (n :: Nat). (Unbox a, KnownNat n) => Array n a -> Array n a -> Array n a
- Data.Array.RankedU: broadcast :: forall r' r a. (HasCallStack, Unbox a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
+ Data.Array.RankedU: broadcast :: forall (r' :: Nat) (r :: Nat) a. (HasCallStack, Unbox a, KnownNat r, KnownNat r') => [Int] -> ShapeL -> Array r a -> Array r' a
- Data.Array.RankedU: class Vector v
+ Data.Array.RankedU: class Vector (v :: Type -> Type)
- Data.Array.RankedU: concatOuter :: (Unbox a, KnownNat n) => [Array n a] -> Array n a
+ Data.Array.RankedU: concatOuter :: forall a (n :: Nat). (Unbox a, KnownNat n) => [Array n a] -> Array n a
- Data.Array.RankedU: constant :: (Unbox a, KnownNat n) => ShapeL -> a -> Array n a
+ Data.Array.RankedU: constant :: forall a (n :: Nat). (Unbox a, KnownNat n) => ShapeL -> a -> Array n a
- Data.Array.RankedU: data Array n a
+ Data.Array.RankedU: data Array (n :: Nat) a
- Data.Array.RankedU: foldrA :: Unbox a => (a -> b -> b) -> b -> Array n a -> b
+ Data.Array.RankedU: foldrA :: forall a b (n :: Nat). Unbox a => (a -> b -> b) -> b -> Array n a -> b
- Data.Array.RankedU: fromList :: forall n a. (Unbox a, KnownNat n) => ShapeL -> [a] -> Array n a
+ Data.Array.RankedU: fromList :: forall (n :: Nat) a. (Unbox a, KnownNat n) => ShapeL -> [a] -> Array n a
- Data.Array.RankedU: fromVector :: (Unbox a, KnownNat n) => ShapeL -> Vector a -> Array n a
+ Data.Array.RankedU: fromVector :: forall a (n :: Nat). (Unbox a, KnownNat n) => ShapeL -> Vector a -> Array n a
- Data.Array.RankedU: generate :: forall n a. (KnownNat n, Unbox a) => ShapeL -> ([Int] -> a) -> Array n a
+ Data.Array.RankedU: generate :: forall (n :: Nat) a. (KnownNat n, Unbox a) => ShapeL -> ([Int] -> a) -> Array n a
- Data.Array.RankedU: index :: Unbox a => Array (1 + n) a -> Int -> Array n a
+ Data.Array.RankedU: index :: forall a (n :: Natural). Unbox a => Array (1 + n) a -> Int -> Array n a
- Data.Array.RankedU: iterateN :: forall a. Unbox a => Int -> (a -> a) -> a -> Array 1 a
+ Data.Array.RankedU: iterateN :: Unbox a => Int -> (a -> a) -> a -> Array 1 a
- Data.Array.RankedU: mapA :: (Unbox a, Unbox b) => (a -> b) -> Array n a -> Array n b
+ Data.Array.RankedU: mapA :: forall a b (n :: Nat). (Unbox a, Unbox b) => (a -> b) -> Array n a -> Array n b
- Data.Array.RankedU: maximumA :: (Unbox a, Ord a) => Array r a -> a
+ Data.Array.RankedU: maximumA :: forall a (r :: Nat). (Unbox a, Ord a) => Array r a -> a
- Data.Array.RankedU: minimumA :: (Unbox a, Ord a) => Array r a -> a
+ Data.Array.RankedU: minimumA :: forall a (r :: Nat). (Unbox a, Ord a) => Array r a -> a
- Data.Array.RankedU: normalize :: (Unbox a, KnownNat n) => Array n a -> Array n a
+ Data.Array.RankedU: normalize :: forall a (n :: Nat). (Unbox a, KnownNat n) => Array n a -> Array n a
- Data.Array.RankedU: pad :: (Unbox a, KnownNat n) => [(Int, Int)] -> a -> Array n a -> Array n a
+ Data.Array.RankedU: pad :: forall a (n :: Nat). (Unbox a, KnownNat n) => [(Int, Int)] -> a -> Array n a -> Array n a
- Data.Array.RankedU: productA :: (Unbox a, Num a) => Array r a -> a
+ Data.Array.RankedU: productA :: forall a (r :: Nat). (Unbox a, Num a) => Array r a -> a
- Data.Array.RankedU: rank :: KnownNat n => Array n a -> Int
+ Data.Array.RankedU: rank :: forall (n :: Nat) a. KnownNat n => Array n a -> Int
- Data.Array.RankedU: ravel :: (Unbox a, Unbox (Array n a), Unbox (Array n Vector a), KnownNat (1 + n)) => Array 1 (Array n a) -> Array (1 + n) a
+ Data.Array.RankedU: ravel :: forall a (n :: Nat). (Unbox a, Unbox (Array n a), Unbox (Array n Vector a), KnownNat (1 + n)) => Array 1 (Array n a) -> Array (1 + n) a
- Data.Array.RankedU: reduce :: Unbox a => (a -> a -> a) -> a -> Array n a -> Array 0 a
+ Data.Array.RankedU: reduce :: forall a (n :: Nat). Unbox a => (a -> a -> a) -> a -> Array n a -> Array 0 a
- Data.Array.RankedU: rerank :: forall n i o a b. (Unbox a, Unbox b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
+ Data.Array.RankedU: rerank :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b. (Unbox a, Unbox b, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array o b) -> Array (n + i) a -> Array (n + o) b
- Data.Array.RankedU: rerank2 :: forall n i o a b c. (Unbox a, Unbox b, Unbox c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
+ Data.Array.RankedU: rerank2 :: forall (n :: Nat) (i :: Nat) (o :: Nat) a b c. (Unbox a, Unbox b, Unbox c, KnownNat n, KnownNat o, KnownNat (n + o), KnownNat (1 + o)) => (Array i a -> Array i b -> Array o c) -> Array (n + i) a -> Array (n + i) b -> Array (n + o) c
- Data.Array.RankedU: reshape :: (Unbox a, KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
+ Data.Array.RankedU: reshape :: forall a (n :: Nat) (n' :: Nat). (Unbox a, KnownNat n, KnownNat n') => ShapeL -> Array n a -> Array n' a
- Data.Array.RankedU: rev :: [Int] -> Array n a -> Array n a
+ Data.Array.RankedU: rev :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.RankedU: rotate :: forall d p a. (KnownNat p, KnownNat d, Unbox a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
+ Data.Array.RankedU: rotate :: forall (d :: Nat) (p :: Nat) a. (KnownNat p, KnownNat d, Unbox a, (d + (p + 1)) ~ ((p + d) + 1), (d + p) ~ (p + d), 1 <= (p + 1), KnownNat ((p + d) + 1), KnownNat (p + 1), KnownNat (1 + (p + 1))) => Int -> Array (p + d) a -> Array ((p + d) + 1) a
- Data.Array.RankedU: shapeL :: Array n a -> ShapeL
+ Data.Array.RankedU: shapeL :: forall (n :: Nat) a. Array n a -> ShapeL
- Data.Array.RankedU: size :: Array n a -> Int
+ Data.Array.RankedU: size :: forall (n :: Nat) a. Array n a -> Int
- Data.Array.RankedU: slice :: [(Int, Int)] -> Array n a -> Array n a
+ Data.Array.RankedU: slice :: forall (n :: Nat) a. [(Int, Int)] -> Array n a -> Array n a
- Data.Array.RankedU: stretch :: ShapeL -> Array n a -> Array n a
+ Data.Array.RankedU: stretch :: forall (n :: Nat) a. ShapeL -> Array n a -> Array n a
- Data.Array.RankedU: stretchOuter :: (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
+ Data.Array.RankedU: stretchOuter :: forall (n :: Natural) a. (HasCallStack, 1 <= n) => Int -> Array n a -> Array n a
- Data.Array.RankedU: stride :: [Int] -> Array n a -> Array n a
+ Data.Array.RankedU: stride :: forall (n :: Nat) a. [Int] -> Array n a -> Array n a
- Data.Array.RankedU: sumA :: (Unbox a, Num a) => Array r a -> a
+ Data.Array.RankedU: sumA :: forall a (r :: Nat). (Unbox a, Num a) => Array r a -> a
- Data.Array.RankedU: toList :: Unbox a => Array n a -> [a]
+ Data.Array.RankedU: toList :: forall a (n :: Nat). Unbox a => Array n a -> [a]
- Data.Array.RankedU: toVector :: forall n a. Unbox a => Array n a -> Vector a
+ Data.Array.RankedU: toVector :: forall (n :: Nat) a. Unbox a => Array n a -> Vector a
- Data.Array.RankedU: transpose :: KnownNat n => [Int] -> Array n a -> Array n a
+ Data.Array.RankedU: transpose :: forall (n :: Nat) a. KnownNat n => [Int] -> Array n a -> Array n a
- Data.Array.RankedU: traverseA :: (Unbox a, Unbox b, Applicative f) => (a -> f b) -> Array n a -> f (Array n b)
+ Data.Array.RankedU: traverseA :: forall a b f (n :: Nat). (Unbox a, Unbox b, Applicative f) => (a -> f b) -> Array n a -> f (Array n b)
- Data.Array.RankedU: unravel :: (Unbox a, Unbox (Array n a), Unbox (Array n Vector a)) => Array (1 + n) a -> Array 1 (Array n a)
+ Data.Array.RankedU: unravel :: forall a (n :: Nat). (Unbox a, Unbox (Array n a), Unbox (Array n Vector a)) => Array (1 + n) a -> Array 1 (Array n a)
- Data.Array.RankedU: window :: (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
+ Data.Array.RankedU: window :: forall (n :: Nat) (n' :: Nat) a. (KnownNat n, KnownNat n') => [Int] -> Array n a -> Array n' a
- Data.Array.RankedU: zipWith3A :: (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
+ Data.Array.RankedU: zipWith3A :: forall a b c d (n :: Nat). (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Array n a -> Array n b -> Array n c -> Array n d
- Data.Array.RankedU: zipWithA :: (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Array n a -> Array n b -> Array n c
+ Data.Array.RankedU: zipWithA :: forall a b c (n :: Nat). (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Array n a -> Array n b -> Array n c
- Data.Array.Shaped: allA :: Shape sh => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.Shaped: allA :: forall (sh :: [Nat]) a. Shape sh => (a -> Bool) -> Array sh a -> Bool
- Data.Array.Shaped: allSameA :: (Shape sh, Eq a) => Array sh a -> Bool
+ Data.Array.Shaped: allSameA :: forall (sh :: [Nat]) a. (Shape sh, Eq a) => Array sh a -> Bool
- Data.Array.Shaped: anyA :: Shape sh => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.Shaped: anyA :: forall (sh :: [Nat]) a. Shape sh => (a -> Bool) -> Array sh a -> Bool
- Data.Array.Shaped: append :: (Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
+ Data.Array.Shaped: append :: forall (sh :: [Nat]) (m :: Nat) (n :: Nat) a. (Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
- Data.Array.Shaped: broadcast :: forall ds sh' sh a. (Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
+ Data.Array.Shaped: broadcast :: forall (ds :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
- Data.Array.Shaped: class (Typeable s) => Shape (s :: [Nat])
+ Data.Array.Shaped: class Typeable s => Shape (s :: [Nat])
- Data.Array.Shaped: class Vector v
+ Data.Array.Shaped: class Vector (v :: Type -> Type)
- Data.Array.Shaped: constant :: forall sh a. Shape sh => a -> Array sh a
+ Data.Array.Shaped: constant :: forall (sh :: [Nat]) a. Shape sh => a -> Array sh a
- Data.Array.Shaped: data Array sh a
+ Data.Array.Shaped: data Array (sh :: [Nat]) a
- Data.Array.Shaped: foldrA :: Shape sh => (a -> b -> b) -> b -> Array sh a -> b
+ Data.Array.Shaped: foldrA :: forall (sh :: [Nat]) a b. Shape sh => (a -> b -> b) -> b -> Array sh a -> b
- Data.Array.Shaped: fromList :: forall sh a. (HasCallStack, Shape sh) => [a] -> Array sh a
+ Data.Array.Shaped: fromList :: forall (sh :: [Nat]) a. (HasCallStack, Shape sh) => [a] -> Array sh a
- Data.Array.Shaped: fromVector :: forall sh a. (HasCallStack, Shape sh) => Vector a -> Array sh a
+ Data.Array.Shaped: fromVector :: forall (sh :: [Nat]) a. (HasCallStack, Shape sh) => Vector a -> Array sh a
- Data.Array.Shaped: generate :: Shape sh => ([Int] -> a) -> Array sh a
+ Data.Array.Shaped: generate :: forall (sh :: [Nat]) a. Shape sh => ([Int] -> a) -> Array sh a
- Data.Array.Shaped: index :: (HasCallStack, KnownNat s) => Array (s : sh) a -> Int -> Array sh a
+ Data.Array.Shaped: index :: forall (s :: Nat) (sh :: [Nat]) a. (HasCallStack, KnownNat s) => Array (s ': sh) a -> Int -> Array sh a
- Data.Array.Shaped: iota :: (KnownNat n, Enum a, Num a) => Array '[n] a
+ Data.Array.Shaped: iota :: forall (n :: Nat) a. (KnownNat n, Enum a, Num a) => Array '[n] a
- Data.Array.Shaped: iterateN :: forall n a. KnownNat n => (a -> a) -> a -> Array '[n] a
+ Data.Array.Shaped: iterateN :: forall (n :: Nat) a. KnownNat n => (a -> a) -> a -> Array '[n] a
- Data.Array.Shaped: mapA :: Shape sh => (a -> b) -> Array sh a -> Array sh b
+ Data.Array.Shaped: mapA :: forall (sh :: [Nat]) a b. Shape sh => (a -> b) -> Array sh a -> Array sh b
- Data.Array.Shaped: maximumA :: (Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.Shaped: maximumA :: forall a (sh :: [Nat]). (Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.Shaped: minimumA :: (Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.Shaped: minimumA :: forall a (sh :: [Nat]). (Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.Shaped: normalize :: Shape sh => Array sh a -> Array sh a
+ Data.Array.Shaped: normalize :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Array sh a
- Data.Array.Shaped: pad :: forall ps sh' sh a. (HasCallStack, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
+ Data.Array.Shaped: pad :: forall (ps :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. (HasCallStack, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
- Data.Array.Shaped: productA :: (Num a, Shape sh) => Array sh a -> a
+ Data.Array.Shaped: productA :: forall a (sh :: [Nat]). (Num a, Shape sh) => Array sh a -> a
- Data.Array.Shaped: rank :: (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
+ Data.Array.Shaped: rank :: forall (sh :: [Nat]) a. (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
- Data.Array.Shaped: ravel :: (Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s : sh) a
+ Data.Array.Shaped: ravel :: forall (sh :: [Nat]) (s :: Nat) a. (Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s ': sh) a
- Data.Array.Shaped: reduce :: Shape sh => (a -> a -> a) -> a -> Array sh a -> Array '[] a
+ Data.Array.Shaped: reduce :: forall (sh :: [Nat]) a. Shape sh => (a -> a -> a) -> a -> Array sh a -> Array ('[] :: [Nat]) a
- Data.Array.Shaped: rerank :: forall n i o sh a b. (Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
+ Data.Array.Shaped: rerank :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b. (Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
- Data.Array.Shaped: rerank2 :: forall n i o sh a b c. (Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
+ Data.Array.Shaped: rerank2 :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b c. (Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
- Data.Array.Shaped: reshape :: forall sh' sh a. (Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
+ Data.Array.Shaped: reshape :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
- Data.Array.Shaped: rev :: forall rs sh a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
+ Data.Array.Shaped: rev :: forall (rs :: [Nat]) (sh :: [Nat]) a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
- Data.Array.Shaped: scalar :: a -> Array '[] a
+ Data.Array.Shaped: scalar :: a -> Array ('[] :: [Nat]) a
- Data.Array.Shaped: shapeL :: Shape sh => Array sh a -> ShapeL
+ Data.Array.Shaped: shapeL :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> ShapeL
- Data.Array.Shaped: size :: forall sh a. Shape sh => Array sh a -> Int
+ Data.Array.Shaped: size :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Int
- Data.Array.Shaped: slice :: forall sl sh' sh a. Slice sl sh sh' => Array sh a -> Array sh' a
+ Data.Array.Shaped: slice :: forall (sl :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. Slice sl sh sh' => Array sh a -> Array sh' a
- Data.Array.Shaped: stretch :: forall sh' sh a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
+ Data.Array.Shaped: stretch :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
- Data.Array.Shaped: stretchOuter :: (KnownNat s, Shape sh) => Array (1 : sh) a -> Array (s : sh) a
+ Data.Array.Shaped: stretchOuter :: forall (s :: Nat) (sh :: [Nat]) a. (KnownNat s, Shape sh) => Array (1 ': sh) a -> Array (s ': sh) a
- Data.Array.Shaped: stride :: forall ts sh' sh a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
+ Data.Array.Shaped: stride :: forall (ts :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
- Data.Array.Shaped: sumA :: (Num a, Shape sh) => Array sh a -> a
+ Data.Array.Shaped: sumA :: forall a (sh :: [Nat]). (Num a, Shape sh) => Array sh a -> a
- Data.Array.Shaped: toList :: forall sh a. Shape sh => Array sh a -> [a]
+ Data.Array.Shaped: toList :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> [a]
- Data.Array.Shaped: toVector :: Shape sh => Array sh a -> Vector a
+ Data.Array.Shaped: toVector :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Vector a
- Data.Array.Shaped: transpose :: forall is sh a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
+ Data.Array.Shaped: transpose :: forall (is :: [Nat]) (sh :: [Nat]) a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
- Data.Array.Shaped: traverseA :: (Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
+ Data.Array.Shaped: traverseA :: forall f (sh :: [Nat]) a b. (Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
- Data.Array.Shaped: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is (Take (Rank is) xs) ++ Drop (Rank is) xs
+ Data.Array.Shaped: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is Take Rank is xs ++ Drop Rank is xs
- Data.Array.Shaped: unScalar :: Array '[] a -> a
+ Data.Array.Shaped: unScalar :: Array ('[] :: [Nat]) a -> a
- Data.Array.Shaped: unravel :: (Shape sh, KnownNat s) => Array (s : sh) a -> Array '[s] (Array sh a)
+ Data.Array.Shaped: unravel :: forall (sh :: [Nat]) (s :: Nat) a. (Shape sh, KnownNat s) => Array (s ': sh) a -> Array '[s] (Array sh a)
- Data.Array.Shaped: window :: forall ws sh' sh a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
+ Data.Array.Shaped: window :: forall (ws :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
- Data.Array.Shaped: zipWith3A :: Shape sh => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
+ Data.Array.Shaped: zipWith3A :: forall (sh :: [Nat]) a b c d. Shape sh => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
- Data.Array.Shaped: zipWithA :: Shape sh => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
+ Data.Array.Shaped: zipWithA :: forall (sh :: [Nat]) a b c. Shape sh => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
- Data.Array.ShapedG: allA :: (Vector v, VecElem v a, Shape sh) => (a -> Bool) -> Array sh v a -> Bool
+ Data.Array.ShapedG: allA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => (a -> Bool) -> Array sh v a -> Bool
- Data.Array.ShapedG: allSameA :: (Shape sh, Vector v, VecElem v a, Eq a) => Array sh v a -> Bool
+ Data.Array.ShapedG: allSameA :: forall (sh :: [Nat]) (v :: Type -> Type) a. (Shape sh, Vector v, VecElem v a, Eq a) => Array sh v a -> Bool
- Data.Array.ShapedG: anyA :: (Vector v, VecElem v a, Shape sh) => (a -> Bool) -> Array sh v a -> Bool
+ Data.Array.ShapedG: anyA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => (a -> Bool) -> Array sh v a -> Bool
- Data.Array.ShapedG: append :: (Vector v, VecElem v a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) v a -> Array (n ': sh) v a -> Array ((m + n) ': sh) v a
+ Data.Array.ShapedG: append :: forall (v :: Type -> Type) a (sh :: [Nat]) (m :: Nat) (n :: Nat). (Vector v, VecElem v a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) v a -> Array (n ': sh) v a -> Array ((m + n) ': sh) v a
- Data.Array.ShapedG: broadcast :: forall ds sh' sh v a. (Shape sh, Shape sh', Broadcast ds sh sh', Vector v, VecElem v a) => Array sh v a -> Array sh' v a
+ Data.Array.ShapedG: broadcast :: forall (ds :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Shape sh, Shape sh', Broadcast ds sh sh', Vector v, VecElem v a) => Array sh v a -> Array sh' v a
- Data.Array.ShapedG: class (Typeable s) => Shape (s :: [Nat])
+ Data.Array.ShapedG: class Typeable s => Shape (s :: [Nat])
- Data.Array.ShapedG: class Vector v where {
+ Data.Array.ShapedG: class Vector (v :: Type -> Type) where {
- Data.Array.ShapedG: constant :: forall sh v a. (Vector v, VecElem v a, Shape sh) => a -> Array sh v a
+ Data.Array.ShapedG: constant :: forall (sh :: [Nat]) (v :: Type -> Type) a. (Vector v, VecElem v a, Shape sh) => a -> Array sh v a
- Data.Array.ShapedG: data Array (sh :: [Nat]) v a
+ Data.Array.ShapedG: data Array (sh :: [Nat]) (v :: Type -> Type) a
- Data.Array.ShapedG: foldrA :: (Vector v, VecElem v a, Shape sh) => (a -> b -> b) -> b -> Array sh v a -> b
+ Data.Array.ShapedG: foldrA :: forall (v :: Type -> Type) a (sh :: [Nat]) b. (Vector v, VecElem v a, Shape sh) => (a -> b -> b) -> b -> Array sh v a -> b
- Data.Array.ShapedG: fromList :: forall sh v a. (HasCallStack, Vector v, VecElem v a, Shape sh) => [a] -> Array sh v a
+ Data.Array.ShapedG: fromList :: forall (sh :: [Nat]) (v :: Type -> Type) a. (HasCallStack, Vector v, VecElem v a, Shape sh) => [a] -> Array sh v a
- Data.Array.ShapedG: fromVector :: forall sh v a. (HasCallStack, Vector v, VecElem v a, Shape sh) => v a -> Array sh v a
+ Data.Array.ShapedG: fromVector :: forall (sh :: [Nat]) v a. (HasCallStack, Vector v, VecElem v a, Shape sh) => v a -> Array sh v a
- Data.Array.ShapedG: generate :: forall sh v a. (Vector v, VecElem v a, Shape sh) => ([Int] -> a) -> Array sh v a
+ Data.Array.ShapedG: generate :: forall (sh :: [Nat]) (v :: Type -> Type) a. (Vector v, VecElem v a, Shape sh) => ([Int] -> a) -> Array sh v a
- Data.Array.ShapedG: index :: forall s sh v a. (HasCallStack, Vector v, KnownNat s) => Array (s : sh) v a -> Int -> Array sh v a
+ Data.Array.ShapedG: index :: forall (s :: Nat) (sh :: [Nat]) (v :: Type -> Type) a. (HasCallStack, Vector v, KnownNat s) => Array (s ': sh) v a -> Int -> Array sh v a
- Data.Array.ShapedG: iota :: forall n v a. (Vector v, VecElem v a, KnownNat n, Enum a, Num a) => Array '[n] v a
+ Data.Array.ShapedG: iota :: forall (n :: Nat) (v :: Type -> Type) a. (Vector v, VecElem v a, KnownNat n, Enum a, Num a) => Array '[n] v a
- Data.Array.ShapedG: iterateN :: forall n v a. (Vector v, VecElem v a, KnownNat n) => (a -> a) -> a -> Array '[n] v a
+ Data.Array.ShapedG: iterateN :: forall (n :: Nat) (v :: Type -> Type) a. (Vector v, VecElem v a, KnownNat n) => (a -> a) -> a -> Array '[n] v a
- Data.Array.ShapedG: mapA :: (Vector v, VecElem v a, VecElem v b, Shape sh) => (a -> b) -> Array sh v a -> Array sh v b
+ Data.Array.ShapedG: mapA :: forall (v :: Type -> Type) a b (sh :: [Nat]). (Vector v, VecElem v a, VecElem v b, Shape sh) => (a -> b) -> Array sh v a -> Array sh v b
- Data.Array.ShapedG: maximumA :: (Vector v, VecElem v a, Ord a, Shape sh, 1 <= Size sh) => Array sh v a -> a
+ Data.Array.ShapedG: maximumA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Ord a, Shape sh, 1 <= Size sh) => Array sh v a -> a
- Data.Array.ShapedG: minimumA :: (Vector v, VecElem v a, Ord a, Shape sh, 1 <= Size sh) => Array sh v a -> a
+ Data.Array.ShapedG: minimumA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Ord a, Shape sh, 1 <= Size sh) => Array sh v a -> a
- Data.Array.ShapedG: normalize :: (Vector v, VecElem v a, Shape sh) => Array sh v a -> Array sh v a
+ Data.Array.ShapedG: normalize :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => Array sh v a -> Array sh v a
- Data.Array.ShapedG: pad :: forall ps sh' sh a v. (HasCallStack, Vector v, VecElem v a, Padded ps sh sh', Shape sh) => a -> Array sh v a -> Array sh' v a
+ Data.Array.ShapedG: pad :: forall (ps :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a (v :: Type -> Type). (HasCallStack, Vector v, VecElem v a, Padded ps sh sh', Shape sh) => a -> Array sh v a -> Array sh' v a
- Data.Array.ShapedG: productA :: (Vector v, VecElem v a, Num a, Shape sh) => Array sh v a -> a
+ Data.Array.ShapedG: productA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Num a, Shape sh) => Array sh v a -> a
- Data.Array.ShapedG: rank :: forall sh v a. (Shape sh, KnownNat (Rank sh)) => Array sh v a -> Int
+ Data.Array.ShapedG: rank :: forall (sh :: [Nat]) (v :: Type -> Type) a. (Shape sh, KnownNat (Rank sh)) => Array sh v a -> Int
- Data.Array.ShapedG: ravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array sh v a), Shape sh, KnownNat s) => Array '[s] v' (Array sh v a) -> Array (s : sh) v a
+ Data.Array.ShapedG: ravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a (sh :: [Nat]) (s :: Nat). (Vector v, Vector v', VecElem v a, VecElem v' (Array sh v a), Shape sh, KnownNat s) => Array '[s] v' (Array sh v a) -> Array (s ': sh) v a
- Data.Array.ShapedG: reduce :: (Vector v, VecElem v a, Shape sh) => (a -> a -> a) -> a -> Array sh v a -> Array '[] v a
+ Data.Array.ShapedG: reduce :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => (a -> a -> a) -> a -> Array sh v a -> Array ('[] :: [Nat]) v a
- Data.Array.ShapedG: rerank :: forall n i o sh v v' a b. (Vector v, Vector v', VecElem v a, VecElem v' b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i v a -> Array o v' b) -> Array sh v a -> Array (Take n sh ++ o) v' b
+ Data.Array.ShapedG: rerank :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) (v' :: Type -> Type) a b. (Vector v, Vector v', VecElem v a, VecElem v' b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i v a -> Array o v' b) -> Array sh v a -> Array (Take n sh ++ o) v' b
- Data.Array.ShapedG: rerank2 :: forall n i1 i2 o sh1 sh2 r v a b c. (Vector v, VecElem v a, VecElem v b, VecElem v c, Drop n sh1 ~ i1, Drop n sh2 ~ i2, Shape sh1, Shape sh2, Take n sh1 ~ r, Take n sh2 ~ r, KnownNat n, Shape o, Shape (r ++ o)) => (Array i1 v a -> Array i2 v b -> Array o v c) -> Array sh1 v a -> Array sh2 v b -> Array (r ++ o) v c
+ Data.Array.ShapedG: rerank2 :: forall (n :: Nat) (i1 :: [Nat]) (i2 :: [Nat]) (o :: [Nat]) (sh1 :: [Nat]) (sh2 :: [Nat]) (r :: [Nat]) (v :: Type -> Type) a b c. (Vector v, VecElem v a, VecElem v b, VecElem v c, Drop n sh1 ~ i1, Drop n sh2 ~ i2, Shape sh1, Shape sh2, Take n sh1 ~ r, Take n sh2 ~ r, KnownNat n, Shape o, Shape (r ++ o)) => (Array i1 v a -> Array i2 v b -> Array o v c) -> Array sh1 v a -> Array sh2 v b -> Array (r ++ o) v c
- Data.Array.ShapedG: reshape :: forall sh' sh v a. (Vector v, VecElem v a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh v a -> Array sh' v a
+ Data.Array.ShapedG: reshape :: forall (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Vector v, VecElem v a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh v a -> Array sh' v a
- Data.Array.ShapedG: rev :: forall rs sh v a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh v a -> Array sh v a
+ Data.Array.ShapedG: rev :: forall (rs :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh v a -> Array sh v a
- Data.Array.ShapedG: scalar :: (Vector v, VecElem v a) => a -> Array '[] v a
+ Data.Array.ShapedG: scalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => a -> Array ('[] :: [Nat]) v a
- Data.Array.ShapedG: shapeL :: forall sh v a. Shape sh => Array sh v a -> ShapeL
+ Data.Array.ShapedG: shapeL :: forall (sh :: [Nat]) (v :: Type -> Type) a. Shape sh => Array sh v a -> ShapeL
- Data.Array.ShapedG: size :: forall sh v a. Shape sh => Array sh v a -> Int
+ Data.Array.ShapedG: size :: forall (sh :: [Nat]) (v :: Type -> Type) a. Shape sh => Array sh v a -> Int
- Data.Array.ShapedG: slice :: forall sl sh' sh v a. Slice sl sh sh' => Array sh v a -> Array sh' v a
+ Data.Array.ShapedG: slice :: forall (sl :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. Slice sl sh sh' => Array sh v a -> Array sh' v a
- Data.Array.ShapedG: stretch :: forall sh' sh v a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh v a -> Array sh' v a
+ Data.Array.ShapedG: stretch :: forall (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh v a -> Array sh' v a
- Data.Array.ShapedG: stretchOuter :: forall s sh v a. Shape sh => Array (1 : sh) v a -> Array (s : sh) v a
+ Data.Array.ShapedG: stretchOuter :: forall (s :: Nat) (sh :: [Nat]) (v :: Type -> Type) a. Shape sh => Array (1 ': sh) v a -> Array (s ': sh) v a
- Data.Array.ShapedG: stride :: forall ts sh' sh v a. (Stride ts sh sh', Vector v, Shape ts) => Array sh v a -> Array sh' v a
+ Data.Array.ShapedG: stride :: forall (ts :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Stride ts sh sh', Vector v, Shape ts) => Array sh v a -> Array sh' v a
- Data.Array.ShapedG: sumA :: (Vector v, VecElem v a, Num a, Shape sh) => Array sh v a -> a
+ Data.Array.ShapedG: sumA :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Num a, Shape sh) => Array sh v a -> a
- Data.Array.ShapedG: toList :: (Vector v, VecElem v a, Shape sh) => Array sh v a -> [a]
+ Data.Array.ShapedG: toList :: forall (v :: Type -> Type) a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => Array sh v a -> [a]
- Data.Array.ShapedG: toVector :: (Vector v, VecElem v a, Shape sh) => Array sh v a -> v a
+ Data.Array.ShapedG: toVector :: forall v a (sh :: [Nat]). (Vector v, VecElem v a, Shape sh) => Array sh v a -> v a
- Data.Array.ShapedG: transpose :: forall is sh v a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh v a -> Array (Permute is sh) v a
+ Data.Array.ShapedG: transpose :: forall (is :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh v a -> Array (Permute is sh) v a
- Data.Array.ShapedG: traverseA :: (Vector v, VecElem v a, VecElem v b, Applicative f, Shape sh) => (a -> f b) -> Array sh v a -> f (Array sh v b)
+ Data.Array.ShapedG: traverseA :: forall (v :: Type -> Type) a b f (sh :: [Nat]). (Vector v, VecElem v a, VecElem v b, Applicative f, Shape sh) => (a -> f b) -> Array sh v a -> f (Array sh v b)
- Data.Array.ShapedG: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is (Take (Rank is) xs) ++ Drop (Rank is) xs
+ Data.Array.ShapedG: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is Take Rank is xs ++ Drop Rank is xs
- Data.Array.ShapedG: type VecElem v :: Type -> Constraint;
+ Data.Array.ShapedG: type VecElem (v :: Type -> Type) :: Type -> Constraint;
- Data.Array.ShapedG: unScalar :: (Vector v, VecElem v a) => Array '[] v a -> a
+ Data.Array.ShapedG: unScalar :: forall (v :: Type -> Type) a. (Vector v, VecElem v a) => Array ('[] :: [Nat]) v a -> a
- Data.Array.ShapedG: unravel :: (Vector v, Vector v', VecElem v a, VecElem v' (Array sh v a), Shape sh, KnownNat s) => Array (s : sh) v a -> Array '[s] v' (Array sh v a)
+ Data.Array.ShapedG: unravel :: forall (v :: Type -> Type) (v' :: Type -> Type) a (sh :: [Nat]) (s :: Nat). (Vector v, Vector v', VecElem v a, VecElem v' (Array sh v a), Shape sh, KnownNat s) => Array (s ': sh) v a -> Array '[s] v' (Array sh v a)
- Data.Array.ShapedG: window :: forall ws sh' sh v a. (Window ws sh sh', Vector v, KnownNat (Rank ws)) => Array sh v a -> Array sh' v a
+ Data.Array.ShapedG: window :: forall (ws :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) (v :: Type -> Type) a. (Window ws sh sh', Vector v, KnownNat (Rank ws)) => Array sh v a -> Array sh' v a
- Data.Array.ShapedG: zipWith3A :: (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, Shape sh) => (a -> b -> c -> d) -> Array sh v a -> Array sh v b -> Array sh v c -> Array sh v d
+ Data.Array.ShapedG: zipWith3A :: forall (v :: Type -> Type) a b c d (sh :: [Nat]). (Vector v, VecElem v a, VecElem v b, VecElem v c, VecElem v d, Shape sh) => (a -> b -> c -> d) -> Array sh v a -> Array sh v b -> Array sh v c -> Array sh v d
- Data.Array.ShapedG: zipWithA :: (Vector v, VecElem v a, VecElem v b, VecElem v c, Shape sh) => (a -> b -> c) -> Array sh v a -> Array sh v b -> Array sh v c
+ Data.Array.ShapedG: zipWithA :: forall (v :: Type -> Type) a b c (sh :: [Nat]). (Vector v, VecElem v a, VecElem v b, VecElem v c, Shape sh) => (a -> b -> c) -> Array sh v a -> Array sh v b -> Array sh v c
- Data.Array.ShapedS: allA :: (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.ShapedS: allA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
- Data.Array.ShapedS: allSameA :: (Shape sh, Unbox a, Eq a) => Array sh a -> Bool
+ Data.Array.ShapedS: allSameA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a, Eq a) => Array sh a -> Bool
- Data.Array.ShapedS: anyA :: (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.ShapedS: anyA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
- Data.Array.ShapedS: append :: (Unbox a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
+ Data.Array.ShapedS: append :: forall a (sh :: [Nat]) (m :: Nat) (n :: Nat). (Unbox a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
- Data.Array.ShapedS: broadcast :: forall ds sh' sh a. (Unbox a, Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
+ Data.Array.ShapedS: broadcast :: forall (ds :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
- Data.Array.ShapedS: class (Typeable s) => Shape (s :: [Nat])
+ Data.Array.ShapedS: class Typeable s => Shape (s :: [Nat])
- Data.Array.ShapedS: class Vector v
+ Data.Array.ShapedS: class Vector (v :: Type -> Type)
- Data.Array.ShapedS: constant :: forall sh a. (Unbox a, Shape sh) => a -> Array sh a
+ Data.Array.ShapedS: constant :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => a -> Array sh a
- Data.Array.ShapedS: data Array sh a
+ Data.Array.ShapedS: data Array (sh :: [Nat]) a
- Data.Array.ShapedS: foldrA :: (Unbox a, Shape sh) => (a -> b -> b) -> b -> Array sh a -> b
+ Data.Array.ShapedS: foldrA :: forall a (sh :: [Nat]) b. (Unbox a, Shape sh) => (a -> b -> b) -> b -> Array sh a -> b
- Data.Array.ShapedS: fromList :: forall sh a. (HasCallStack, Unbox a, Shape sh) => [a] -> Array sh a
+ Data.Array.ShapedS: fromList :: forall (sh :: [Nat]) a. (HasCallStack, Unbox a, Shape sh) => [a] -> Array sh a
- Data.Array.ShapedS: fromVector :: forall sh a. (HasCallStack, Unbox a, Shape sh) => Vector a -> Array sh a
+ Data.Array.ShapedS: fromVector :: forall (sh :: [Nat]) a. (HasCallStack, Unbox a, Shape sh) => Vector a -> Array sh a
- Data.Array.ShapedS: generate :: (Unbox a, Shape sh) => ([Int] -> a) -> Array sh a
+ Data.Array.ShapedS: generate :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => ([Int] -> a) -> Array sh a
- Data.Array.ShapedS: index :: (Unbox a, KnownNat s) => Array (s : sh) a -> Int -> Array sh a
+ Data.Array.ShapedS: index :: forall a (s :: Nat) (sh :: [Nat]). (Unbox a, KnownNat s) => Array (s ': sh) a -> Int -> Array sh a
- Data.Array.ShapedS: iota :: (KnownNat n, Unbox a, Enum a, Num a) => Array '[n] a
+ Data.Array.ShapedS: iota :: forall (n :: Nat) a. (KnownNat n, Unbox a, Enum a, Num a) => Array '[n] a
- Data.Array.ShapedS: iterateN :: forall n a. (Unbox a, KnownNat n) => (a -> a) -> a -> Array '[n] a
+ Data.Array.ShapedS: iterateN :: forall (n :: Nat) a. (Unbox a, KnownNat n) => (a -> a) -> a -> Array '[n] a
- Data.Array.ShapedS: mapA :: (Unbox a, Unbox b, Shape sh) => (a -> b) -> Array sh a -> Array sh b
+ Data.Array.ShapedS: mapA :: forall a b (sh :: [Nat]). (Unbox a, Unbox b, Shape sh) => (a -> b) -> Array sh a -> Array sh b
- Data.Array.ShapedS: maximumA :: (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.ShapedS: maximumA :: forall a (sh :: [Nat]). (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.ShapedS: minimumA :: (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.ShapedS: minimumA :: forall a (sh :: [Nat]). (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.ShapedS: normalize :: (Unbox a, Shape sh) => Array sh a -> Array sh a
+ Data.Array.ShapedS: normalize :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => Array sh a -> Array sh a
- Data.Array.ShapedS: pad :: forall ps sh' sh a. (Unbox a, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
+ Data.Array.ShapedS: pad :: forall (ps :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
- Data.Array.ShapedS: productA :: (Unbox a, Num a, Shape sh) => Array sh a -> a
+ Data.Array.ShapedS: productA :: forall a (sh :: [Nat]). (Unbox a, Num a, Shape sh) => Array sh a -> a
- Data.Array.ShapedS: rank :: (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
+ Data.Array.ShapedS: rank :: forall (sh :: [Nat]) a. (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
- Data.Array.ShapedS: ravel :: (Unbox a, Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s : sh) a
+ Data.Array.ShapedS: ravel :: forall a (sh :: [Nat]) (s :: Nat). (Unbox a, Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s ': sh) a
- Data.Array.ShapedS: reduce :: (Unbox a, Shape sh) => (a -> a -> a) -> a -> Array sh a -> Array '[] a
+ Data.Array.ShapedS: reduce :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => (a -> a -> a) -> a -> Array sh a -> Array ('[] :: [Nat]) a
- Data.Array.ShapedS: rerank :: forall n i o sh a b. (Unbox a, Unbox b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
+ Data.Array.ShapedS: rerank :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b. (Unbox a, Unbox b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
- Data.Array.ShapedS: rerank2 :: forall n i o sh a b c. (Unbox a, Unbox b, Unbox c, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
+ Data.Array.ShapedS: rerank2 :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b c. (Unbox a, Unbox b, Unbox c, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
- Data.Array.ShapedS: reshape :: forall sh' sh a. (Unbox a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
+ Data.Array.ShapedS: reshape :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
- Data.Array.ShapedS: rev :: forall rs sh a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
+ Data.Array.ShapedS: rev :: forall (rs :: [Nat]) (sh :: [Nat]) a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
- Data.Array.ShapedS: scalar :: Unbox a => a -> Array '[] a
+ Data.Array.ShapedS: scalar :: Unbox a => a -> Array ('[] :: [Nat]) a
- Data.Array.ShapedS: shapeL :: Shape sh => Array sh a -> ShapeL
+ Data.Array.ShapedS: shapeL :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> ShapeL
- Data.Array.ShapedS: size :: forall sh a. Shape sh => Array sh a -> Int
+ Data.Array.ShapedS: size :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Int
- Data.Array.ShapedS: slice :: forall sl sh' sh a. Slice sl sh sh' => Array sh a -> Array sh' a
+ Data.Array.ShapedS: slice :: forall (sl :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. Slice sl sh sh' => Array sh a -> Array sh' a
- Data.Array.ShapedS: stretch :: forall sh' sh a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
+ Data.Array.ShapedS: stretch :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
- Data.Array.ShapedS: stretchOuter :: (KnownNat s, Shape sh) => Array (1 : sh) a -> Array (s : sh) a
+ Data.Array.ShapedS: stretchOuter :: forall (s :: Nat) (sh :: [Nat]) a. (KnownNat s, Shape sh) => Array (1 ': sh) a -> Array (s ': sh) a
- Data.Array.ShapedS: stride :: forall ts sh' sh a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
+ Data.Array.ShapedS: stride :: forall (ts :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
- Data.Array.ShapedS: sumA :: (Unbox a, Num a, Shape sh) => Array sh a -> a
+ Data.Array.ShapedS: sumA :: forall a (sh :: [Nat]). (Unbox a, Num a, Shape sh) => Array sh a -> a
- Data.Array.ShapedS: toList :: forall sh a. (Unbox a, Shape sh) => Array sh a -> [a]
+ Data.Array.ShapedS: toList :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => Array sh a -> [a]
- Data.Array.ShapedS: toVector :: (Unbox a, Shape sh) => Array sh a -> Vector a
+ Data.Array.ShapedS: toVector :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => Array sh a -> Vector a
- Data.Array.ShapedS: transpose :: forall is sh a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
+ Data.Array.ShapedS: transpose :: forall (is :: [Nat]) (sh :: [Nat]) a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
- Data.Array.ShapedS: traverseA :: (Unbox a, Unbox b, Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
+ Data.Array.ShapedS: traverseA :: forall a b f (sh :: [Nat]). (Unbox a, Unbox b, Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
- Data.Array.ShapedS: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is (Take (Rank is) xs) ++ Drop (Rank is) xs
+ Data.Array.ShapedS: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is Take Rank is xs ++ Drop Rank is xs
- Data.Array.ShapedS: unScalar :: Unbox a => Array '[] a -> a
+ Data.Array.ShapedS: unScalar :: Unbox a => Array ('[] :: [Nat]) a -> a
- Data.Array.ShapedS: unravel :: (Unbox a, Shape sh, KnownNat s) => Array (s : sh) a -> Array '[s] (Array sh a)
+ Data.Array.ShapedS: unravel :: forall a (sh :: [Nat]) (s :: Nat). (Unbox a, Shape sh, KnownNat s) => Array (s ': sh) a -> Array '[s] (Array sh a)
- Data.Array.ShapedS: window :: forall ws sh' sh a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
+ Data.Array.ShapedS: window :: forall (ws :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
- Data.Array.ShapedS: zipWith3A :: (Unbox a, Unbox b, Unbox c, Unbox d, Shape sh) => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
+ Data.Array.ShapedS: zipWith3A :: forall a b c d (sh :: [Nat]). (Unbox a, Unbox b, Unbox c, Unbox d, Shape sh) => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
- Data.Array.ShapedS: zipWithA :: (Unbox a, Unbox b, Unbox c, Shape sh) => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
+ Data.Array.ShapedS: zipWithA :: forall a b c (sh :: [Nat]). (Unbox a, Unbox b, Unbox c, Shape sh) => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
- Data.Array.ShapedU: allA :: (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.ShapedU: allA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
- Data.Array.ShapedU: allSameA :: (Shape sh, Unbox a, Eq a) => Array sh a -> Bool
+ Data.Array.ShapedU: allSameA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a, Eq a) => Array sh a -> Bool
- Data.Array.ShapedU: anyA :: (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
+ Data.Array.ShapedU: anyA :: forall (sh :: [Nat]) a. (Shape sh, Unbox a) => (a -> Bool) -> Array sh a -> Bool
- Data.Array.ShapedU: append :: (Unbox a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
+ Data.Array.ShapedU: append :: forall a (sh :: [Nat]) (m :: Nat) (n :: Nat). (Unbox a, Shape sh, KnownNat m, KnownNat n, KnownNat (m + n)) => Array (m ': sh) a -> Array (n ': sh) a -> Array ((m + n) ': sh) a
- Data.Array.ShapedU: broadcast :: forall ds sh' sh a. (Unbox a, Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
+ Data.Array.ShapedU: broadcast :: forall (ds :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Shape sh, Shape sh', Broadcast ds sh sh') => Array sh a -> Array sh' a
- Data.Array.ShapedU: class (Typeable s) => Shape (s :: [Nat])
+ Data.Array.ShapedU: class Typeable s => Shape (s :: [Nat])
- Data.Array.ShapedU: class Vector v
+ Data.Array.ShapedU: class Vector (v :: Type -> Type)
- Data.Array.ShapedU: constant :: forall sh a. (Unbox a, Shape sh) => a -> Array sh a
+ Data.Array.ShapedU: constant :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => a -> Array sh a
- Data.Array.ShapedU: data Array sh a
+ Data.Array.ShapedU: data Array (sh :: [Nat]) a
- Data.Array.ShapedU: foldrA :: (Unbox a, Shape sh) => (a -> b -> b) -> b -> Array sh a -> b
+ Data.Array.ShapedU: foldrA :: forall a (sh :: [Nat]) b. (Unbox a, Shape sh) => (a -> b -> b) -> b -> Array sh a -> b
- Data.Array.ShapedU: fromList :: forall sh a. (Unbox a, Shape sh) => [a] -> Array sh a
+ Data.Array.ShapedU: fromList :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => [a] -> Array sh a
- Data.Array.ShapedU: fromVector :: forall sh a. (Unbox a, Shape sh) => Vector a -> Array sh a
+ Data.Array.ShapedU: fromVector :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => Vector a -> Array sh a
- Data.Array.ShapedU: generate :: (Unbox a, Shape sh) => ([Int] -> a) -> Array sh a
+ Data.Array.ShapedU: generate :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => ([Int] -> a) -> Array sh a
- Data.Array.ShapedU: index :: (Unbox a, KnownNat s) => Array (s : sh) a -> Int -> Array sh a
+ Data.Array.ShapedU: index :: forall a (s :: Nat) (sh :: [Nat]). (Unbox a, KnownNat s) => Array (s ': sh) a -> Int -> Array sh a
- Data.Array.ShapedU: iota :: (KnownNat n, Unbox a, Enum a, Num a) => Array '[n] a
+ Data.Array.ShapedU: iota :: forall (n :: Nat) a. (KnownNat n, Unbox a, Enum a, Num a) => Array '[n] a
- Data.Array.ShapedU: iterateN :: forall n a. (Unbox a, KnownNat n) => (a -> a) -> a -> Array '[n] a
+ Data.Array.ShapedU: iterateN :: forall (n :: Nat) a. (Unbox a, KnownNat n) => (a -> a) -> a -> Array '[n] a
- Data.Array.ShapedU: mapA :: (Unbox a, Unbox b, Shape sh) => (a -> b) -> Array sh a -> Array sh b
+ Data.Array.ShapedU: mapA :: forall a b (sh :: [Nat]). (Unbox a, Unbox b, Shape sh) => (a -> b) -> Array sh a -> Array sh b
- Data.Array.ShapedU: maximumA :: (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.ShapedU: maximumA :: forall a (sh :: [Nat]). (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.ShapedU: minimumA :: (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
+ Data.Array.ShapedU: minimumA :: forall a (sh :: [Nat]). (Unbox a, Ord a, Shape sh, 1 <= Size sh) => Array sh a -> a
- Data.Array.ShapedU: normalize :: (Unbox a, Shape sh) => Array sh a -> Array sh a
+ Data.Array.ShapedU: normalize :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => Array sh a -> Array sh a
- Data.Array.ShapedU: pad :: forall ps sh' sh a. (Unbox a, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
+ Data.Array.ShapedU: pad :: forall (ps :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Padded ps sh sh', Shape sh) => a -> Array sh a -> Array sh' a
- Data.Array.ShapedU: productA :: (Unbox a, Num a, Shape sh) => Array sh a -> a
+ Data.Array.ShapedU: productA :: forall a (sh :: [Nat]). (Unbox a, Num a, Shape sh) => Array sh a -> a
- Data.Array.ShapedU: rank :: (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
+ Data.Array.ShapedU: rank :: forall (sh :: [Nat]) a. (Shape sh, KnownNat (Rank sh)) => Array sh a -> Int
- Data.Array.ShapedU: ravel :: (Unbox a, Unbox (Array sh a), Unbox (Array sh Vector a), Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s : sh) a
+ Data.Array.ShapedU: ravel :: forall a (sh :: [Nat]) (s :: Nat). (Unbox a, Unbox (Array sh a), Unbox (Array sh Vector a), Shape sh, KnownNat s) => Array '[s] (Array sh a) -> Array (s ': sh) a
- Data.Array.ShapedU: reduce :: (Unbox a, Shape sh) => (a -> a -> a) -> a -> Array sh a -> Array '[] a
+ Data.Array.ShapedU: reduce :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => (a -> a -> a) -> a -> Array sh a -> Array ('[] :: [Nat]) a
- Data.Array.ShapedU: rerank :: forall n i o sh a b. (Unbox a, Unbox b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
+ Data.Array.ShapedU: rerank :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b. (Unbox a, Unbox b, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array o b) -> Array sh a -> Array (Take n sh ++ o) b
- Data.Array.ShapedU: rerank2 :: forall n i o sh a b c. (Unbox a, Unbox b, Unbox c, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
+ Data.Array.ShapedU: rerank2 :: forall (n :: Nat) (i :: [Nat]) (o :: [Nat]) (sh :: [Nat]) a b c. (Unbox a, Unbox b, Unbox c, Drop n sh ~ i, Shape sh, KnownNat n, Shape o, Shape (Take n sh ++ o)) => (Array i a -> Array i b -> Array o c) -> Array sh a -> Array sh b -> Array (Take n sh ++ o) c
- Data.Array.ShapedU: reshape :: forall sh' sh a. (Unbox a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
+ Data.Array.ShapedU: reshape :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Unbox a, Shape sh, Shape sh', Size sh ~ Size sh') => Array sh a -> Array sh' a
- Data.Array.ShapedU: rev :: forall rs sh a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
+ Data.Array.ShapedU: rev :: forall (rs :: [Nat]) (sh :: [Nat]) a. (ValidDims rs sh, Shape rs, Shape sh) => Array sh a -> Array sh a
- Data.Array.ShapedU: scalar :: Unbox a => a -> Array '[] a
+ Data.Array.ShapedU: scalar :: Unbox a => a -> Array ('[] :: [Nat]) a
- Data.Array.ShapedU: shapeL :: Shape sh => Array sh a -> ShapeL
+ Data.Array.ShapedU: shapeL :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> ShapeL
- Data.Array.ShapedU: size :: forall sh a. Shape sh => Array sh a -> Int
+ Data.Array.ShapedU: size :: forall (sh :: [Nat]) a. Shape sh => Array sh a -> Int
- Data.Array.ShapedU: slice :: forall sl sh' sh a. Slice sl sh sh' => Array sh a -> Array sh' a
+ Data.Array.ShapedU: slice :: forall (sl :: [(Nat, Nat)]) (sh' :: [Nat]) (sh :: [Nat]) a. Slice sl sh sh' => Array sh a -> Array sh' a
- Data.Array.ShapedU: stretch :: forall sh' sh a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
+ Data.Array.ShapedU: stretch :: forall (sh' :: [Nat]) (sh :: [Nat]) a. (Shape sh, Shape sh', ValidStretch sh sh') => Array sh a -> Array sh' a
- Data.Array.ShapedU: stretchOuter :: (KnownNat s, Shape sh) => Array (1 : sh) a -> Array (s : sh) a
+ Data.Array.ShapedU: stretchOuter :: forall (s :: Nat) (sh :: [Nat]) a. (KnownNat s, Shape sh) => Array (1 ': sh) a -> Array (s ': sh) a
- Data.Array.ShapedU: stride :: forall ts sh' sh a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
+ Data.Array.ShapedU: stride :: forall (ts :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Stride ts sh sh', Shape ts) => Array sh a -> Array sh' a
- Data.Array.ShapedU: sumA :: (Unbox a, Num a, Shape sh) => Array sh a -> a
+ Data.Array.ShapedU: sumA :: forall a (sh :: [Nat]). (Unbox a, Num a, Shape sh) => Array sh a -> a
- Data.Array.ShapedU: toList :: forall sh a. (Unbox a, Shape sh) => Array sh a -> [a]
+ Data.Array.ShapedU: toList :: forall (sh :: [Nat]) a. (Unbox a, Shape sh) => Array sh a -> [a]
- Data.Array.ShapedU: toVector :: (Unbox a, Shape sh) => Array sh a -> Vector a
+ Data.Array.ShapedU: toVector :: forall a (sh :: [Nat]). (Unbox a, Shape sh) => Array sh a -> Vector a
- Data.Array.ShapedU: transpose :: forall is sh a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
+ Data.Array.ShapedU: transpose :: forall (is :: [Nat]) (sh :: [Nat]) a. (Permutation is, Rank is <= Rank sh, Shape sh, Shape is, KnownNat (Rank sh)) => Array sh a -> Array (Permute is sh) a
- Data.Array.ShapedU: traverseA :: (Unbox a, Unbox b, Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
+ Data.Array.ShapedU: traverseA :: forall a b f (sh :: [Nat]). (Unbox a, Unbox b, Applicative f, Shape sh) => (a -> f b) -> Array sh a -> f (Array sh b)
- Data.Array.ShapedU: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is (Take (Rank is) xs) ++ Drop (Rank is) xs
+ Data.Array.ShapedU: type Permute (is :: [Nat]) (xs :: [Nat]) = Permute' is Take Rank is xs ++ Drop Rank is xs
- Data.Array.ShapedU: unScalar :: Unbox a => Array '[] a -> a
+ Data.Array.ShapedU: unScalar :: Unbox a => Array ('[] :: [Nat]) a -> a
- Data.Array.ShapedU: unravel :: (Unbox a, Unbox (Array sh a), Unbox (Array sh Vector a), Shape sh, KnownNat s) => Array (s : sh) a -> Array '[s] (Array sh a)
+ Data.Array.ShapedU: unravel :: forall a (sh :: [Nat]) (s :: Nat). (Unbox a, Unbox (Array sh a), Unbox (Array sh Vector a), Shape sh, KnownNat s) => Array (s ': sh) a -> Array '[s] (Array sh a)
- Data.Array.ShapedU: window :: forall ws sh' sh a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
+ Data.Array.ShapedU: window :: forall (ws :: [Nat]) (sh' :: [Nat]) (sh :: [Nat]) a. (Window ws sh sh', KnownNat (Rank ws)) => Array sh a -> Array sh' a
- Data.Array.ShapedU: zipWith3A :: (Unbox a, Unbox b, Unbox c, Unbox d, Shape sh) => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
+ Data.Array.ShapedU: zipWith3A :: forall a b c d (sh :: [Nat]). (Unbox a, Unbox b, Unbox c, Unbox d, Shape sh) => (a -> b -> c -> d) -> Array sh a -> Array sh b -> Array sh c -> Array sh d
- Data.Array.ShapedU: zipWithA :: (Unbox a, Unbox b, Unbox c, Shape sh) => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
+ Data.Array.ShapedU: zipWithA :: forall a b c (sh :: [Nat]). (Unbox a, Unbox b, Unbox c, Shape sh) => (a -> b -> c) -> Array sh a -> Array sh b -> Array sh c
Files
- orthotope.cabal +2/−2
orthotope.cabal view
@@ -1,5 +1,5 @@ name: orthotope-version: 0.1.7.0+version: 0.1.7.1 synopsis: Multidimensional arrays inspired by APL license: Apache license-file: LICENSE@@ -61,7 +61,7 @@ , Data.Array.Internal.ShapedU build-depends: base >= 4.12 && < 4.22,- QuickCheck >= 2.14.3 && < 2.16,+ QuickCheck >= 2.14.3 && < 2.17, deepseq >= 1.4.4 && < 1.7, pretty >= 1.1.3 && < 1.2, dlist >= 1.0 && < 1.1,