fixed-vector-hetero 0.6.2.0 → 0.7.0.0
raw patch · 4 files changed
+18/−34 lines, 4 filesdep ~basedep ~fixed-vectorPVP ok
version bump matches the API change (PVP)
Dependency ranges changed: base, fixed-vector
API changes (from Hackage documentation)
- Data.Vector.HFixed: type ValueAt n xs :: Type
- Data.Vector.HFixed.Class: instance (Data.Primitive.Types.Prim a, Data.Vector.HFixed.Class.HomArity (Data.Vector.Fixed.Cont.Peano n) a, Data.Vector.HFixed.Class.Arity (Data.Vector.HFixed.TypeFuns.HomList (Data.Vector.Fixed.Cont.Peano n) a), GHC.TypeNats.KnownNat n, Data.Vector.Fixed.Cont.Peano (n GHC.TypeNats.+ 1) GHC.Types.~ 'Data.Vector.Fixed.Cont.S (Data.Vector.Fixed.Cont.Peano n)) => Data.Vector.HFixed.Class.HVector (Data.Vector.Fixed.Primitive.Vec n a)
- Data.Vector.HFixed.Class: instance (Data.Vector.Fixed.Unboxed.Unbox n a, Data.Vector.HFixed.Class.HomArity (Data.Vector.Fixed.Cont.Peano n) a, Data.Vector.HFixed.Class.Arity (Data.Vector.HFixed.TypeFuns.HomList (Data.Vector.Fixed.Cont.Peano n) a), GHC.TypeNats.KnownNat n, Data.Vector.Fixed.Cont.Peano (n GHC.TypeNats.+ 1) GHC.Types.~ 'Data.Vector.Fixed.Cont.S (Data.Vector.Fixed.Cont.Peano n)) => Data.Vector.HFixed.Class.HVector (Data.Vector.Fixed.Unboxed.Vec n a)
- Data.Vector.HFixed.Class: instance (Data.Vector.HFixed.Class.HomArity (Data.Vector.Fixed.Cont.Peano n) a, Data.Vector.HFixed.Class.Arity (Data.Vector.HFixed.TypeFuns.HomList (Data.Vector.Fixed.Cont.Peano n) a), GHC.TypeNats.KnownNat n, Data.Vector.Fixed.Cont.Peano (n GHC.TypeNats.+ 1) GHC.Types.~ 'Data.Vector.Fixed.Cont.S (Data.Vector.Fixed.Cont.Peano n)) => Data.Vector.HFixed.Class.HVector (Data.Vector.Fixed.Boxed.Vec n a)
- Data.Vector.HFixed.Class: instance (Foreign.Storable.Storable a, Data.Vector.HFixed.Class.HomArity (Data.Vector.Fixed.Cont.Peano n) a, Data.Vector.HFixed.Class.Arity (Data.Vector.HFixed.TypeFuns.HomList (Data.Vector.Fixed.Cont.Peano n) a), GHC.TypeNats.KnownNat n, Data.Vector.Fixed.Cont.Peano (n GHC.TypeNats.+ 1) GHC.Types.~ 'Data.Vector.Fixed.Cont.S (Data.Vector.Fixed.Cont.Peano n)) => Data.Vector.HFixed.Class.HVector (Data.Vector.Fixed.Storable.Vec n a)
- Data.Vector.HFixed.Class: instance forall k1 k2 (a :: k1). Data.Vector.HFixed.Class.NoType a '[]
- Data.Vector.HFixed.Class: type Lens s t a b = forall f. Functor f => (a -> f b) -> s -> f t
- Data.Vector.HFixed.Cont: type ValueAt n xs :: Type
+ Data.Vector.HFixed: ($dmconstruct) :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => Fun (Elems v) v
+ Data.Vector.HFixed: ($dminspect) :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => v -> Fun (Elems v) a -> a
+ Data.Vector.HFixed: type family ValueAt (n :: PeanoNum) (xs :: [Type])
+ Data.Vector.HFixed.Class: ($dmconstruct) :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => Fun (Elems v) v
+ Data.Vector.HFixed.Class: ($dminspect) :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => v -> Fun (Elems v) a -> a
+ Data.Vector.HFixed.Class: instance (Data.Primitive.Types.Prim a, Data.Vector.HFixed.Class.HomArity (Data.Vector.Fixed.Cont.Peano n) a, Data.Vector.HFixed.Class.Arity (Data.Vector.HFixed.TypeFuns.HomList (Data.Vector.Fixed.Cont.Peano n) a)) => Data.Vector.HFixed.Class.HVector (Data.Vector.Fixed.Primitive.Vec n a)
+ Data.Vector.HFixed.Class: instance (Data.Vector.Fixed.Unboxed.Unbox n a, Data.Vector.HFixed.Class.HomArity (Data.Vector.Fixed.Cont.Peano n) a, Data.Vector.HFixed.Class.Arity (Data.Vector.HFixed.TypeFuns.HomList (Data.Vector.Fixed.Cont.Peano n) a)) => Data.Vector.HFixed.Class.HVector (Data.Vector.Fixed.Unboxed.Vec n a)
+ Data.Vector.HFixed.Class: instance (Data.Vector.HFixed.Class.HomArity (Data.Vector.Fixed.Cont.Peano n) a, Data.Vector.HFixed.Class.Arity (Data.Vector.HFixed.TypeFuns.HomList (Data.Vector.Fixed.Cont.Peano n) a)) => Data.Vector.HFixed.Class.HVector (Data.Vector.Fixed.Boxed.Vec n a)
+ Data.Vector.HFixed.Class: instance (Foreign.Storable.Storable a, Data.Vector.HFixed.Class.HomArity (Data.Vector.Fixed.Cont.Peano n) a, Data.Vector.HFixed.Class.Arity (Data.Vector.HFixed.TypeFuns.HomList (Data.Vector.Fixed.Cont.Peano n) a)) => Data.Vector.HFixed.Class.HVector (Data.Vector.Fixed.Storable.Vec n a)
+ Data.Vector.HFixed.Class: instance forall k a1 (a2 :: k). Data.Vector.HFixed.Class.NoType a2 '[]
+ Data.Vector.HFixed.Class: type Lens s t a b = forall (f :: Type -> Type). Functor f => a -> f b -> s -> f t
+ Data.Vector.HFixed.Cont: ($dmconstruct) :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => Fun (Elems v) v
+ Data.Vector.HFixed.Cont: ($dminspect) :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => v -> Fun (Elems v) a -> a
- Data.Vector.HFixed: ContVecF :: (forall r. TFun f xs r -> r) -> ContVecF (xs :: [α]) (f :: α -> Type)
+ Data.Vector.HFixed: ContVecF :: (forall r. () => TFun f xs r -> r) -> ContVecF (xs :: [α]) (f :: α -> Type)
- Data.Vector.HFixed: [runContVecF] :: ContVecF (xs :: [α]) (f :: α -> Type) -> forall r. TFun f xs r -> r
+ Data.Vector.HFixed: [runContVecF] :: ContVecF (xs :: [α]) (f :: α -> Type) -> forall r. () => TFun f xs r -> r
- Data.Vector.HFixed: asCVec :: ContVec xs -> ContVec xs
+ Data.Vector.HFixed: asCVec :: forall (xs :: [Type]). ContVec xs -> ContVec xs
- Data.Vector.HFixed: asCVecF :: ContVecF f xs -> ContVecF f xs
+ Data.Vector.HFixed: asCVecF :: forall (f :: [Type]) (xs :: Type -> Type). ContVecF f xs -> ContVecF f xs
- Data.Vector.HFixed: class (Arity xs) => ArityC c xs
+ Data.Vector.HFixed: class Arity xs => ArityC (c :: k -> Constraint) (xs :: [k])
- Data.Vector.HFixed: class Arity (Elems v) => HVector v where {
+ Data.Vector.HFixed: class Arity Elems v => HVector v where {
- Data.Vector.HFixed: class Arity (ElemsF v) => HVectorF (v :: (α -> Type) -> Type) where {
+ Data.Vector.HFixed: class Arity ElemsF v => HVectorF (v :: α -> Type -> Type) where {
- Data.Vector.HFixed: cons :: (HVector v, HVector w, Elems w ~ (a : Elems v)) => a -> v -> w
+ Data.Vector.HFixed: cons :: (HVector v, HVector w, Elems w ~ (a ': Elems v)) => a -> v -> w
- Data.Vector.HFixed: construct :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => Fun (Elems v) v
+ Data.Vector.HFixed: construct :: HVector v => Fun (Elems v) v
- Data.Vector.HFixed: constructF :: HVectorF v => TFun f (ElemsF v) (v f)
+ Data.Vector.HFixed: constructF :: forall (f :: α -> Type). HVectorF v => TFun f (ElemsF v) (v f)
- Data.Vector.HFixed: data () => Proxy (t :: k)
+ Data.Vector.HFixed: data Proxy (t :: k)
- Data.Vector.HFixed: distributeF :: (Functor f, HVectorF v) => f (v g) -> v (f `Compose` g)
+ Data.Vector.HFixed: distributeF :: forall f v (g :: Type -> Type). (Functor f, HVectorF v) => f (v g) -> v (Compose f g)
- Data.Vector.HFixed: element :: forall n v proxy. (Index (Peano n) (Elems v), HVector v) => proxy n -> Lens' v (ValueAt (Peano n) (Elems v))
+ Data.Vector.HFixed: element :: forall (n :: Nat) v proxy. (Index (Peano n) (Elems v), HVector v) => proxy n -> Lens' v (ValueAt (Peano n) (Elems v))
- Data.Vector.HFixed: elementCh :: forall n v w a b proxy. (Index (Peano n) (Elems v), ValueAt (Peano n) (Elems v) ~ a, HVector v, HVector w, Elems w ~ NewElems (Peano n) (Elems v) b) => proxy n -> Lens v w a b
+ Data.Vector.HFixed: elementCh :: forall (n :: Nat) v w a b proxy. (Index (Peano n) (Elems v), ValueAt (Peano n) (Elems v) ~ a, HVector v, HVector w, Elems w ~ NewElems (Peano n) (Elems v) b) => proxy n -> Lens v w a b
- Data.Vector.HFixed: foldMapNatF :: (HVectorF v, Monoid m) => (forall a. f a -> m) -> v f -> m
+ Data.Vector.HFixed: foldMapNatF :: (HVectorF v, Monoid m) => (forall a. () => f a -> m) -> v f -> m
- Data.Vector.HFixed: foldlNatF :: HVectorF v => (forall a. b -> f a -> b) -> b -> v f -> b
+ Data.Vector.HFixed: foldlNatF :: HVectorF v => (forall a. () => b -> f a -> b) -> b -> v f -> b
- Data.Vector.HFixed: foldrNatF :: HVectorF v => (forall a. f a -> b -> b) -> b -> v f -> b
+ Data.Vector.HFixed: foldrNatF :: HVectorF v => (forall a. () => f a -> b -> b) -> b -> v f -> b
- Data.Vector.HFixed: head :: (HVector v, Elems v ~ (a : as), Arity as) => v -> a
+ Data.Vector.HFixed: head :: forall v a (as :: [Type]). (HVector v, Elems v ~ (a ': as), Arity as) => v -> a
- Data.Vector.HFixed: index :: forall n v proxy. (Index (Peano n) (Elems v), HVector v) => proxy n -> v -> ValueAt (Peano n) (Elems v)
+ Data.Vector.HFixed: index :: forall (n :: Nat) v proxy. (Index (Peano n) (Elems v), HVector v) => proxy n -> v -> ValueAt (Peano n) (Elems v)
- Data.Vector.HFixed: inspect :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => v -> Fun (Elems v) a -> a
+ Data.Vector.HFixed: inspect :: HVector v => v -> Fun (Elems v) a -> a
- Data.Vector.HFixed: inspectF :: HVectorF v => v f -> TFun f (ElemsF v) a -> a
+ Data.Vector.HFixed: inspectF :: forall (f :: α -> Type) a. HVectorF v => v f -> TFun f (ElemsF v) a -> a
- Data.Vector.HFixed: mapNat :: HVectorF v => (forall a. f a -> g a) -> v f -> v g
+ Data.Vector.HFixed: mapNat :: HVectorF v => (forall a. () => f a -> g a) -> v f -> v g
- Data.Vector.HFixed: mk0 :: forall v. (HVector v, Elems v ~ '[]) => v
+ Data.Vector.HFixed: mk0 :: (HVector v, Elems v ~ ('[] :: [Type])) => v
- Data.Vector.HFixed: mk0F :: forall f v. (HVectorF v, ElemsF v ~ '[]) => v f
+ Data.Vector.HFixed: mk0F :: forall (f :: Type -> Type) v. (HVectorF v, ElemsF v ~ ('[] :: [Type])) => v f
- Data.Vector.HFixed: mk1 :: forall v a. (HVector v, Elems v ~ '[a]) => a -> v
+ Data.Vector.HFixed: mk1 :: (HVector v, Elems v ~ '[a]) => a -> v
- Data.Vector.HFixed: mk2 :: forall v a b. (HVector v, Elems v ~ '[a, b]) => a -> b -> v
+ Data.Vector.HFixed: mk2 :: (HVector v, Elems v ~ '[a, b]) => a -> b -> v
- Data.Vector.HFixed: mk3 :: forall v a b c. (HVector v, Elems v ~ '[a, b, c]) => a -> b -> c -> v
+ Data.Vector.HFixed: mk3 :: (HVector v, Elems v ~ '[a, b, c]) => a -> b -> c -> v
- Data.Vector.HFixed: mk4 :: forall v a b c d. (HVector v, Elems v ~ '[a, b, c, d]) => a -> b -> c -> d -> v
+ Data.Vector.HFixed: mk4 :: (HVector v, Elems v ~ '[a, b, c, d]) => a -> b -> c -> d -> v
- Data.Vector.HFixed: mk5 :: forall v a b c d e. (HVector v, Elems v ~ '[a, b, c, d, e]) => a -> b -> c -> d -> e -> v
+ Data.Vector.HFixed: mk5 :: (HVector v, Elems v ~ '[a, b, c, d, e]) => a -> b -> c -> d -> e -> v
- Data.Vector.HFixed: monomorphize :: (HVector v, Peano n ~ Len (Elems v), ArityC c (Elems v)) => Proxy c -> (forall a. c a => a -> x) -> v -> ContVec n x
+ Data.Vector.HFixed: monomorphize :: (HVector v, ArityC c (Elems v)) => Proxy c -> (forall a. c a => a -> x) -> v -> ContVec (Len (Elems v)) x
- Data.Vector.HFixed: monomorphizeF :: (HVectorF v, Peano n ~ Len (ElemsF v), ArityC c (ElemsF v)) => Proxy c -> (forall a. c a => f a -> x) -> v f -> ContVec n x
+ Data.Vector.HFixed: monomorphizeF :: (HVectorF v, ArityC c (ElemsF v)) => Proxy c -> (forall a. c a => f a -> x) -> v f -> ContVec (Len (ElemsF v)) x
- Data.Vector.HFixed: replicateNatF :: (HVectorF v, Arity (ElemsF v)) => (forall a. f a) -> v f
+ Data.Vector.HFixed: replicateNatF :: HVectorF v => (forall a. () => f a) -> v f
- Data.Vector.HFixed: sequenceF :: (Applicative f, HVectorF v) => v (f `Compose` g) -> f (v g)
+ Data.Vector.HFixed: sequenceF :: forall f v (g :: Type -> Type). (Applicative f, HVectorF v) => v (Compose f g) -> f (v g)
- Data.Vector.HFixed: set :: forall n v proxy. (Index (Peano n) (Elems v), HVector v) => proxy n -> ValueAt (Peano n) (Elems v) -> v -> v
+ Data.Vector.HFixed: set :: forall (n :: Nat) v proxy. (Index (Peano n) (Elems v), HVector v) => proxy n -> ValueAt (Peano n) (Elems v) -> v -> v
- Data.Vector.HFixed: tail :: (HVector v, HVector w, (a : Elems w) ~ Elems v) => v -> w
+ Data.Vector.HFixed: tail :: (HVector v, HVector w, (a ': Elems w) ~ Elems v) => v -> w
- Data.Vector.HFixed: tupleSize :: forall v proxy. HVector v => proxy v -> Int
+ Data.Vector.HFixed: tupleSize :: HVector v => proxy v -> Int
- Data.Vector.HFixed: tupleSizeF :: forall v f proxy. HVectorF v => proxy (v f) -> Int
+ Data.Vector.HFixed: tupleSizeF :: forall {α} v (f :: α -> Type) proxy. HVectorF v => proxy (v f) -> Int
- Data.Vector.HFixed: type ContVec xs = ContVecF xs Identity
+ Data.Vector.HFixed: type ContVec (xs :: [Type]) = ContVecF xs Identity
- Data.Vector.HFixed: type Elems v = GElems (Rep v);
+ Data.Vector.HFixed: type Elems v = GElems Rep v;
- Data.Vector.HFixed: type ElemsF v :: [α];
+ Data.Vector.HFixed: type ElemsF (v :: α -> Type -> Type) :: [α];
- Data.Vector.HFixed: unwrap :: (HVectorF v, HVector w, ElemsF v ~ Elems w) => (forall a. f a -> a) -> v f -> w
+ Data.Vector.HFixed: unwrap :: (HVectorF v, HVector w, ElemsF v ~ Elems w) => (forall a. () => f a -> a) -> v f -> w
- Data.Vector.HFixed: wrap :: (HVector v, HVectorF w, Elems v ~ ElemsF w) => (forall a. a -> f a) -> v -> w f
+ Data.Vector.HFixed: wrap :: (HVector v, HVectorF w, Elems v ~ ElemsF w) => (forall a. () => a -> f a) -> v -> w f
- Data.Vector.HFixed: zipWithNatF :: HVectorF v => (forall a. f a -> g a -> h a) -> v f -> v g -> v h
+ Data.Vector.HFixed: zipWithNatF :: HVectorF v => (forall a. () => f a -> g a -> h a) -> v f -> v g -> v h
- Data.Vector.HFixed.Class: ContVecF :: (forall r. TFun f xs r -> r) -> ContVecF (xs :: [α]) (f :: α -> Type)
+ Data.Vector.HFixed.Class: ContVecF :: (forall r. () => TFun f xs r -> r) -> ContVecF (xs :: [α]) (f :: α -> Type)
- Data.Vector.HFixed.Class: TFun :: Fn f as b -> TFun f as b
+ Data.Vector.HFixed.Class: TFun :: Fn f as b -> TFun (f :: α -> Type) (as :: [α]) b
- Data.Vector.HFixed.Class: [runContVecF] :: ContVecF (xs :: [α]) (f :: α -> Type) -> forall r. TFun f xs r -> r
+ Data.Vector.HFixed.Class: [runContVecF] :: ContVecF (xs :: [α]) (f :: α -> Type) -> forall r. () => TFun f xs r -> r
- Data.Vector.HFixed.Class: [unTFun] :: TFun f as b -> Fn f as b
+ Data.Vector.HFixed.Class: [unTFun] :: TFun (f :: α -> Type) (as :: [α]) b -> Fn f as b
- Data.Vector.HFixed.Class: accum :: Arity xs => (forall a as. t (a : as) -> f a -> t as) -> (t '[] -> b) -> t xs -> TFun f xs b
+ Data.Vector.HFixed.Class: accum :: Arity xs => (forall (a :: α) (as :: [α]). () => t (a ': as) -> f a -> t as) -> (t ('[] :: [α]) -> b) -> t xs -> TFun f xs b
- Data.Vector.HFixed.Class: accumC :: ArityC c xs => proxy c -> (forall a as. c a => t (a : as) -> f a -> t as) -> (t '[] -> b) -> t xs -> TFun f xs b
+ Data.Vector.HFixed.Class: accumC :: ArityC c xs => proxy c -> (forall (a :: k) (as :: [k]). c a => t (a ': as) -> f a -> t as) -> (t ('[] :: [k]) -> b) -> t xs -> TFun f xs b
- Data.Vector.HFixed.Class: apply :: Arity xs => (forall a as. t (a : as) -> (f a, t as)) -> t xs -> ContVecF xs f
+ Data.Vector.HFixed.Class: apply :: Arity xs => (forall (a :: α) (as :: [α]). () => t (a ': as) -> (f a, t as)) -> t xs -> ContVecF xs f
- Data.Vector.HFixed.Class: applyC :: ArityC c xs => proxy c -> (forall a as. c a => t (a : as) -> (f a, t as)) -> t xs -> ContVecF xs f
+ Data.Vector.HFixed.Class: applyC :: ArityC c xs => proxy c -> (forall (a :: k) (as :: [k]). c a => t (a ': as) -> (f a, t as)) -> t xs -> ContVecF xs f
- Data.Vector.HFixed.Class: class (c1 a, c2 a) => (:&&:) c1 c2 a
+ Data.Vector.HFixed.Class: class (c1 a, c2 a) => ( (c1 :: k -> Constraint) :&&: (c2 :: k -> Constraint) ) (a :: k)
- Data.Vector.HFixed.Class: class (Arity xs) => ArityC c xs
+ Data.Vector.HFixed.Class: class Arity xs => ArityC (c :: k -> Constraint) (xs :: [k])
- Data.Vector.HFixed.Class: class Arity (Elems v) => HVector v where {
+ Data.Vector.HFixed.Class: class Arity Elems v => HVector v where {
- Data.Vector.HFixed.Class: class Arity (ElemsF v) => HVectorF (v :: (α -> Type) -> Type) where {
+ Data.Vector.HFixed.Class: class Arity ElemsF v => HVectorF (v :: α -> Type -> Type) where {
- Data.Vector.HFixed.Class: class (ArityPeano n, Arity (HomList n a)) => HomArity n a
+ Data.Vector.HFixed.Class: class (ArityPeano n, Arity HomList n a) => HomArity (n :: PeanoNum) a
- Data.Vector.HFixed.Class: class Arity xs => TyLookup x xs
+ Data.Vector.HFixed.Class: class Arity xs => TyLookup (x :: α) (xs :: [α])
- Data.Vector.HFixed.Class: concatF :: (Arity xs, Arity ys) => (a -> b -> c) -> Fun xs a -> Fun ys b -> Fun (xs ++ ys) c
+ Data.Vector.HFixed.Class: concatF :: forall (xs :: [Type]) (ys :: [Type]) a b c. (Arity xs, Arity ys) => (a -> b -> c) -> Fun xs a -> Fun ys b -> Fun (xs ++ ys) c
- Data.Vector.HFixed.Class: cons :: x -> ContVec xs -> ContVec (x : xs)
+ Data.Vector.HFixed.Class: cons :: forall x (xs :: [Type]). x -> ContVec xs -> ContVec (x ': xs)
- Data.Vector.HFixed.Class: consF :: f x -> ContVecF xs f -> ContVecF (x : xs) f
+ Data.Vector.HFixed.Class: consF :: forall {α} f (x :: α) (xs :: [α]). f x -> ContVecF xs f -> ContVecF (x ': xs) f
- Data.Vector.HFixed.Class: constFun :: Fun xs r -> Fun (x : xs) r
+ Data.Vector.HFixed.Class: constFun :: forall (xs :: [Type]) r x. Fun xs r -> Fun (x ': xs) r
- Data.Vector.HFixed.Class: constTFun :: TFun f xs r -> TFun f (x : xs) r
+ Data.Vector.HFixed.Class: constTFun :: forall {a} (f :: a -> Type) (xs :: [a]) r (x :: a). TFun f xs r -> TFun f (x ': xs) r
- Data.Vector.HFixed.Class: construct :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => Fun (Elems v) v
+ Data.Vector.HFixed.Class: construct :: HVector v => Fun (Elems v) v
- Data.Vector.HFixed.Class: constructF :: HVectorF v => TFun f (ElemsF v) (v f)
+ Data.Vector.HFixed.Class: constructF :: forall (f :: α -> Type). HVectorF v => TFun f (ElemsF v) (v f)
- Data.Vector.HFixed.Class: curryFun :: Fun (x : xs) r -> x -> Fun xs r
+ Data.Vector.HFixed.Class: curryFun :: forall x (xs :: [Type]) r. Fun (x ': xs) r -> x -> Fun xs r
- Data.Vector.HFixed.Class: curryMany :: forall xs ys r. Arity xs => Fun (xs ++ ys) r -> Fun xs (Fun ys r)
+ Data.Vector.HFixed.Class: curryMany :: forall (xs :: [Type]) (ys :: [Type]) r. Arity xs => Fun (xs ++ ys) r -> Fun xs (Fun ys r)
- Data.Vector.HFixed.Class: curryTFun :: TFun f (x : xs) r -> f x -> TFun f xs r
+ Data.Vector.HFixed.Class: curryTFun :: forall {α} f (x :: α) (xs :: [α]) r. TFun f (x ': xs) r -> f x -> TFun f xs r
- Data.Vector.HFixed.Class: data () => Proxy (t :: k)
+ Data.Vector.HFixed.Class: data Proxy (t :: k)
- Data.Vector.HFixed.Class: homConstruct :: forall v a. (Vector v a, HomArity (Peano (Dim v)) a) => Fun (HomList (Peano (Dim v)) a) (v a)
+ Data.Vector.HFixed.Class: homConstruct :: (Vector v a, HomArity (Dim v) a) => Fun (HomList (Dim v) a) (v a)
- Data.Vector.HFixed.Class: homInspect :: (Vector v a, HomArity (Peano (Dim v)) a) => v a -> Fun (HomList (Peano (Dim v)) a) r -> r
+ Data.Vector.HFixed.Class: homInspect :: (Vector v a, HomArity (Dim v) a) => v a -> Fun (HomList (Dim v) a) r -> r
- Data.Vector.HFixed.Class: inspect :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => v -> Fun (Elems v) a -> a
+ Data.Vector.HFixed.Class: inspect :: HVector v => v -> Fun (Elems v) a -> a
- Data.Vector.HFixed.Class: inspectF :: HVectorF v => v f -> TFun f (ElemsF v) a -> a
+ Data.Vector.HFixed.Class: inspectF :: forall (f :: α -> Type) a. HVectorF v => v f -> TFun f (ElemsF v) a -> a
- Data.Vector.HFixed.Class: lensWorkerF :: forall f r x y xs. (Functor f, Arity xs) => (x -> f y) -> Fun (y : xs) r -> Fun (x : xs) (f r)
+ Data.Vector.HFixed.Class: lensWorkerF :: forall f r x y (xs :: [Type]). (Functor f, Arity xs) => (x -> f y) -> Fun (y ': xs) r -> Fun (x ': xs) (f r)
- Data.Vector.HFixed.Class: lensWorkerTF :: forall f g r x y xs. (Functor f, Arity xs) => (g x -> f (g y)) -> TFun g (y : xs) r -> TFun g (x : xs) (f r)
+ Data.Vector.HFixed.Class: lensWorkerTF :: forall {a} f g r (x :: a) (y :: a) (xs :: [a]). (Functor f, Arity xs) => (g x -> f (g y)) -> TFun g (y ': xs) r -> TFun g (x ': xs) (f r)
- Data.Vector.HFixed.Class: newtype TFun f as b
+ Data.Vector.HFixed.Class: newtype TFun (f :: α -> Type) (as :: [α]) b
- Data.Vector.HFixed.Class: shuffleTF :: forall f x xs r. Arity xs => (x -> TFun f xs r) -> TFun f xs (x -> r)
+ Data.Vector.HFixed.Class: shuffleTF :: forall {α} (f :: α -> Type) x (xs :: [α]) r. Arity xs => (x -> TFun f xs r) -> TFun f xs (x -> r)
- Data.Vector.HFixed.Class: stepTFun :: (TFun f xs a -> TFun f ys b) -> TFun f (x : xs) a -> TFun f (x : ys) b
+ Data.Vector.HFixed.Class: stepTFun :: forall {a1} (f :: a1 -> Type) (xs :: [a1]) a2 (ys :: [a1]) b (x :: a1). (TFun f xs a2 -> TFun f ys b) -> TFun f (x ': xs) a2 -> TFun f (x ': ys) b
- Data.Vector.HFixed.Class: tupleSize :: forall v proxy. HVector v => proxy v -> Int
+ Data.Vector.HFixed.Class: tupleSize :: HVector v => proxy v -> Int
- Data.Vector.HFixed.Class: tupleSizeF :: forall v f proxy. HVectorF v => proxy (v f) -> Int
+ Data.Vector.HFixed.Class: tupleSizeF :: forall {α} v (f :: α -> Type) proxy. HVectorF v => proxy (v f) -> Int
- Data.Vector.HFixed.Class: type ContVec xs = ContVecF xs Identity
+ Data.Vector.HFixed.Class: type ContVec (xs :: [Type]) = ContVecF xs Identity
- Data.Vector.HFixed.Class: type Elems v = GElems (Rep v);
+ Data.Vector.HFixed.Class: type Elems v = GElems Rep v;
- Data.Vector.HFixed.Class: type ElemsF v :: [α];
+ Data.Vector.HFixed.Class: type ElemsF (v :: α -> Type -> Type) :: [α];
- Data.Vector.HFixed.Class: type NewElems n xs a :: [Type];
+ Data.Vector.HFixed.Class: type NewElems (n :: PeanoNum) (xs :: [Type]) a :: [Type];
- Data.Vector.HFixed.Class: type ValueAt n xs :: Type;
+ Data.Vector.HFixed.Class: type ValueAt (n :: PeanoNum) (xs :: [Type]);
- Data.Vector.HFixed.Class: uncurryFun :: (x -> Fun xs r) -> Fun (x : xs) r
+ Data.Vector.HFixed.Class: uncurryFun :: forall x (xs :: [Type]) r. (x -> Fun xs r) -> Fun (x ': xs) r
- Data.Vector.HFixed.Class: uncurryMany :: forall xs ys r. Arity xs => Fun xs (Fun ys r) -> Fun (xs ++ ys) r
+ Data.Vector.HFixed.Class: uncurryMany :: forall (xs :: [Type]) (ys :: [Type]) r. Arity xs => Fun xs (Fun ys r) -> Fun (xs ++ ys) r
- Data.Vector.HFixed.Class: uncurryTFun :: (f x -> TFun f xs r) -> TFun f (x : xs) r
+ Data.Vector.HFixed.Class: uncurryTFun :: forall {a} f (x :: a) (xs :: [a]) r. (f x -> TFun f xs r) -> TFun f (x ': xs) r
- Data.Vector.HFixed.Cont: ContVecF :: (forall r. TFun f xs r -> r) -> ContVecF (xs :: [α]) (f :: α -> Type)
+ Data.Vector.HFixed.Cont: ContVecF :: (forall r. () => TFun f xs r -> r) -> ContVecF (xs :: [α]) (f :: α -> Type)
- Data.Vector.HFixed.Cont: TFun :: Fn f as b -> TFun f as b
+ Data.Vector.HFixed.Cont: TFun :: Fn f as b -> TFun (f :: α -> Type) (as :: [α]) b
- Data.Vector.HFixed.Cont: [ConsF] :: f x -> VecListF xs f -> VecListF (x : xs) f
+ Data.Vector.HFixed.Cont: [ConsF] :: forall {α} (f :: α -> Type) (x :: α) (xs1 :: [α]). f x -> VecListF xs1 f -> VecListF (x ': xs1) f
- Data.Vector.HFixed.Cont: [Cons] :: x -> VecList xs -> VecList (x : xs)
+ Data.Vector.HFixed.Cont: [Cons] :: forall x (xs :: [Type]). x -> VecList xs -> VecList (x ': xs)
- Data.Vector.HFixed.Cont: [NilF] :: VecListF '[] f
+ Data.Vector.HFixed.Cont: [NilF] :: forall {α} (f :: α -> Type). VecListF ('[] :: [α]) f
- Data.Vector.HFixed.Cont: [Nil] :: VecList '[]
+ Data.Vector.HFixed.Cont: [Nil] :: VecList ('[] :: [Type])
- Data.Vector.HFixed.Cont: [runContVecF] :: ContVecF (xs :: [α]) (f :: α -> Type) -> forall r. TFun f xs r -> r
+ Data.Vector.HFixed.Cont: [runContVecF] :: ContVecF (xs :: [α]) (f :: α -> Type) -> forall r. () => TFun f xs r -> r
- Data.Vector.HFixed.Cont: [unTFun] :: TFun f as b -> Fn f as b
+ Data.Vector.HFixed.Cont: [unTFun] :: TFun (f :: α -> Type) (as :: [α]) b -> Fn f as b
- Data.Vector.HFixed.Cont: accum :: Arity xs => (forall a as. t (a : as) -> f a -> t as) -> (t '[] -> b) -> t xs -> TFun f xs b
+ Data.Vector.HFixed.Cont: accum :: Arity xs => (forall (a :: α) (as :: [α]). () => t (a ': as) -> f a -> t as) -> (t ('[] :: [α]) -> b) -> t xs -> TFun f xs b
- Data.Vector.HFixed.Cont: apply :: Arity xs => (forall a as. t (a : as) -> (f a, t as)) -> t xs -> ContVecF xs f
+ Data.Vector.HFixed.Cont: apply :: Arity xs => (forall (a :: α) (as :: [α]). () => t (a ': as) -> (f a, t as)) -> t xs -> ContVecF xs f
- Data.Vector.HFixed.Cont: class Arity (Elems v) => HVector v where {
+ Data.Vector.HFixed.Cont: class Arity Elems v => HVector v where {
- Data.Vector.HFixed.Cont: class Arity (ElemsF v) => HVectorF (v :: (α -> Type) -> Type) where {
+ Data.Vector.HFixed.Cont: class Arity ElemsF v => HVectorF (v :: α -> Type -> Type) where {
- Data.Vector.HFixed.Cont: concat :: Arity xs => ContVec xs -> ContVec ys -> ContVec (xs ++ ys)
+ Data.Vector.HFixed.Cont: concat :: forall (xs :: [Type]) (ys :: [Type]). Arity xs => ContVec xs -> ContVec ys -> ContVec (xs ++ ys)
- Data.Vector.HFixed.Cont: cons :: x -> ContVec xs -> ContVec (x : xs)
+ Data.Vector.HFixed.Cont: cons :: forall x (xs :: [Type]). x -> ContVec xs -> ContVec (x ': xs)
- Data.Vector.HFixed.Cont: consF :: f x -> ContVecF xs f -> ContVecF (x : xs) f
+ Data.Vector.HFixed.Cont: consF :: forall {α} f (x :: α) (xs :: [α]). f x -> ContVecF xs f -> ContVecF (x ': xs) f
- Data.Vector.HFixed.Cont: construct :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => Fun (Elems v) v
+ Data.Vector.HFixed.Cont: construct :: HVector v => Fun (Elems v) v
- Data.Vector.HFixed.Cont: constructF :: HVectorF v => TFun f (ElemsF v) (v f)
+ Data.Vector.HFixed.Cont: constructF :: forall (f :: α -> Type). HVectorF v => TFun f (ElemsF v) (v f)
- Data.Vector.HFixed.Cont: cvec :: (HVector v, Elems v ~ xs) => v -> ContVec xs
+ Data.Vector.HFixed.Cont: cvec :: forall v (xs :: [Type]). (HVector v, Elems v ~ xs) => v -> ContVec xs
- Data.Vector.HFixed.Cont: cvecF :: HVectorF v => v f -> ContVecF (ElemsF v) f
+ Data.Vector.HFixed.Cont: cvecF :: forall {α} v (f :: α -> Type). HVectorF v => v f -> ContVecF (ElemsF v) f
- Data.Vector.HFixed.Cont: data VecList :: [Type] -> Type
+ Data.Vector.HFixed.Cont: data VecList (a :: [Type])
- Data.Vector.HFixed.Cont: distributeF :: forall f g xs. (Arity xs, Functor f) => f (ContVecF xs g) -> ContVecF xs (f `Compose` g)
+ Data.Vector.HFixed.Cont: distributeF :: forall {k1} f (g :: k1 -> Type) (xs :: [k1]). (Arity xs, Functor f) => f (ContVecF xs g) -> ContVecF xs (Compose f g)
- Data.Vector.HFixed.Cont: foldMapF :: (Monoid m, ArityC c xs) => Proxy c -> (forall a. c a => f a -> m) -> ContVecF xs f -> m
+ Data.Vector.HFixed.Cont: foldMapF :: forall {α} m c (xs :: [α]) f. (Monoid m, ArityC c xs) => Proxy c -> (forall (a :: α). c a => f a -> m) -> ContVecF xs f -> m
- Data.Vector.HFixed.Cont: foldMapNatF :: (Monoid m, Arity xs) => (forall a. f a -> m) -> ContVecF xs f -> m
+ Data.Vector.HFixed.Cont: foldMapNatF :: forall {α} m (xs :: [α]) f. (Monoid m, Arity xs) => (forall (a :: α). () => f a -> m) -> ContVecF xs f -> m
- Data.Vector.HFixed.Cont: foldlF :: ArityC c xs => Proxy c -> (forall a. c a => b -> f a -> b) -> b -> ContVecF xs f -> b
+ Data.Vector.HFixed.Cont: foldlF :: forall {α} c (xs :: [α]) b f. ArityC c xs => Proxy c -> (forall (a :: α). c a => b -> f a -> b) -> b -> ContVecF xs f -> b
- Data.Vector.HFixed.Cont: foldlNatF :: Arity xs => (forall a. b -> f a -> b) -> b -> ContVecF xs f -> b
+ Data.Vector.HFixed.Cont: foldlNatF :: forall {α} (xs :: [α]) b f. Arity xs => (forall (a :: α). () => b -> f a -> b) -> b -> ContVecF xs f -> b
- Data.Vector.HFixed.Cont: foldrF :: ArityC c xs => Proxy c -> (forall a. c a => f a -> b -> b) -> b -> ContVecF xs f -> b
+ Data.Vector.HFixed.Cont: foldrF :: forall {α} c (xs :: [α]) f b. ArityC c xs => Proxy c -> (forall (a :: α). c a => f a -> b -> b) -> b -> ContVecF xs f -> b
- Data.Vector.HFixed.Cont: foldrNatF :: Arity xs => (forall a. f a -> b -> b) -> b -> ContVecF xs f -> b
+ Data.Vector.HFixed.Cont: foldrNatF :: forall {α} (xs :: [α]) f b. Arity xs => (forall (a :: α). () => f a -> b -> b) -> b -> ContVecF xs f -> b
- Data.Vector.HFixed.Cont: head :: Arity xs => ContVec (x : xs) -> x
+ Data.Vector.HFixed.Cont: head :: forall (xs :: [Type]) x. Arity xs => ContVec (x ': xs) -> x
- Data.Vector.HFixed.Cont: index :: Index n xs => ContVec xs -> proxy n -> ValueAt n xs
+ Data.Vector.HFixed.Cont: index :: forall (n :: PeanoNum) (xs :: [Type]) proxy. Index n xs => ContVec xs -> proxy n -> ValueAt n xs
- Data.Vector.HFixed.Cont: inspect :: (HVector v, Generic v, GHVector (Rep v), GElems (Rep v) ~ Elems v) => v -> Fun (Elems v) a -> a
+ Data.Vector.HFixed.Cont: inspect :: HVector v => v -> Fun (Elems v) a -> a
- Data.Vector.HFixed.Cont: inspectF :: HVectorF v => v f -> TFun f (ElemsF v) a -> a
+ Data.Vector.HFixed.Cont: inspectF :: forall (f :: α -> Type) a. HVectorF v => v f -> TFun f (ElemsF v) a -> a
- Data.Vector.HFixed.Cont: map :: ArityC c xs => Proxy c -> (forall a. c a => f a -> g a) -> ContVecF xs f -> ContVecF xs g
+ Data.Vector.HFixed.Cont: map :: forall {α} c (xs :: [α]) f g. ArityC c xs => Proxy c -> (forall (a :: α). c a => f a -> g a) -> ContVecF xs f -> ContVecF xs g
- Data.Vector.HFixed.Cont: mapNat :: Arity xs => (forall a. f a -> g a) -> ContVecF xs f -> ContVecF xs g
+ Data.Vector.HFixed.Cont: mapNat :: forall {α} (xs :: [α]) f g. Arity xs => (forall (a :: α). () => f a -> g a) -> ContVecF xs f -> ContVecF xs g
- Data.Vector.HFixed.Cont: monomorphizeF :: forall c xs a f n. (ArityC c xs, Peano n ~ Len xs) => Proxy c -> (forall x. c x => f x -> a) -> ContVecF xs f -> ContVec n a
+ Data.Vector.HFixed.Cont: monomorphizeF :: forall {α} c (xs :: [α]) a f. ArityC c xs => Proxy c -> (forall (x :: α). c x => f x -> a) -> ContVecF xs f -> ContVec (Len xs) a
- Data.Vector.HFixed.Cont: newtype TFun f as b
+ Data.Vector.HFixed.Cont: newtype TFun (f :: α -> Type) (as :: [α]) b
- Data.Vector.HFixed.Cont: replicateF :: ArityC c xs => Proxy c -> (forall a. c a => f a) -> ContVecF xs f
+ Data.Vector.HFixed.Cont: replicateF :: forall {α} c (xs :: [α]) f. ArityC c xs => Proxy c -> (forall (a :: α). c a => f a) -> ContVecF xs f
- Data.Vector.HFixed.Cont: replicateNatF :: Arity xs => (forall a. f a) -> ContVecF xs f
+ Data.Vector.HFixed.Cont: replicateNatF :: forall {α} (xs :: [α]) f. Arity xs => (forall (a :: α). () => f a) -> ContVecF xs f
- Data.Vector.HFixed.Cont: sequenceF :: (Arity xs, Applicative f) => ContVecF xs (f `Compose` g) -> f (ContVecF xs g)
+ Data.Vector.HFixed.Cont: sequenceF :: forall {α} (xs :: [α]) f (g :: α -> Type). (Arity xs, Applicative f) => ContVecF xs (Compose f g) -> f (ContVecF xs g)
- Data.Vector.HFixed.Cont: set :: Index n xs => proxy n -> ValueAt n xs -> ContVec xs -> ContVec xs
+ Data.Vector.HFixed.Cont: set :: forall (n :: PeanoNum) (xs :: [Type]) proxy. Index n xs => proxy n -> ValueAt n xs -> ContVec xs -> ContVec xs
- Data.Vector.HFixed.Cont: tail :: ContVec (x : xs) -> ContVec xs
+ Data.Vector.HFixed.Cont: tail :: forall x (xs :: [Type]). ContVec (x ': xs) -> ContVec xs
- Data.Vector.HFixed.Cont: tupleSize :: forall v proxy. HVector v => proxy v -> Int
+ Data.Vector.HFixed.Cont: tupleSize :: HVector v => proxy v -> Int
- Data.Vector.HFixed.Cont: tupleSizeF :: forall v f proxy. HVectorF v => proxy (v f) -> Int
+ Data.Vector.HFixed.Cont: tupleSizeF :: forall {α} v (f :: α -> Type) proxy. HVectorF v => proxy (v f) -> Int
- Data.Vector.HFixed.Cont: tyLookup :: TyLookup a xs => ContVec xs -> a
+ Data.Vector.HFixed.Cont: tyLookup :: forall a (xs :: [Type]). TyLookup a xs => ContVec xs -> a
- Data.Vector.HFixed.Cont: tyLookupF :: TyLookup a xs => ContVecF xs f -> f a
+ Data.Vector.HFixed.Cont: tyLookupF :: forall {α} (a :: α) (xs :: [α]) f. TyLookup a xs => ContVecF xs f -> f a
- Data.Vector.HFixed.Cont: type ContVec xs = ContVecF xs Identity
+ Data.Vector.HFixed.Cont: type ContVec (xs :: [Type]) = ContVecF xs Identity
- Data.Vector.HFixed.Cont: type Elems v = GElems (Rep v);
+ Data.Vector.HFixed.Cont: type Elems v = GElems Rep v;
- Data.Vector.HFixed.Cont: type ElemsF v :: [α];
+ Data.Vector.HFixed.Cont: type ElemsF (v :: α -> Type -> Type) :: [α];
- Data.Vector.HFixed.Cont: type family Fn (f :: α -> Type) (as :: [α]) b
+ Data.Vector.HFixed.Cont: type family ValueAt (n :: PeanoNum) (xs :: [Type])
- Data.Vector.HFixed.Cont: unfoldrF :: ArityC c xs => Proxy c -> (forall a. c a => b -> (f a, b)) -> b -> ContVecF xs f
+ Data.Vector.HFixed.Cont: unfoldrF :: forall {α} c (xs :: [α]) b f. ArityC c xs => Proxy c -> (forall (a :: α). c a => b -> (f a, b)) -> b -> ContVecF xs f
- Data.Vector.HFixed.Cont: vector :: (HVector v, Elems v ~ xs) => ContVec xs -> v
+ Data.Vector.HFixed.Cont: vector :: forall v (xs :: [Type]). (HVector v, Elems v ~ xs) => ContVec xs -> v
- Data.Vector.HFixed.Cont: vectorF :: HVectorF v => ContVecF (ElemsF v) f -> v f
+ Data.Vector.HFixed.Cont: vectorF :: forall {α} v (f :: α -> Type). HVectorF v => ContVecF (ElemsF v) f -> v f
- Data.Vector.HFixed.Cont: zipFoldF :: forall xs c m f. (ArityC c xs, Monoid m) => Proxy c -> (forall a. c a => f a -> f a -> m) -> ContVecF xs f -> ContVecF xs f -> m
+ Data.Vector.HFixed.Cont: zipFoldF :: forall {α} (xs :: [α]) c m f. (ArityC c xs, Monoid m) => Proxy c -> (forall (a :: α). c a => f a -> f a -> m) -> ContVecF xs f -> ContVecF xs f -> m
- Data.Vector.HFixed.Cont: zipWithF :: ArityC c xs => Proxy c -> (forall a. c a => f a -> g a -> h a) -> ContVecF xs f -> ContVecF xs g -> ContVecF xs h
+ Data.Vector.HFixed.Cont: zipWithF :: forall {α} c (xs :: [α]) f g h. ArityC c xs => Proxy c -> (forall (a :: α). c a => f a -> g a -> h a) -> ContVecF xs f -> ContVecF xs g -> ContVecF xs h
- Data.Vector.HFixed.Cont: zipWithNatF :: Arity xs => (forall a. f a -> g a -> h a) -> ContVecF xs f -> ContVecF xs g -> ContVecF xs h
+ Data.Vector.HFixed.Cont: zipWithNatF :: forall {α} (xs :: [α]) f g h. Arity xs => (forall (a :: α). () => f a -> g a -> h a) -> ContVecF xs f -> ContVecF xs g -> ContVecF xs h
- Data.Vector.HFixed.TypeFuns: data () => Proxy (t :: k)
+ Data.Vector.HFixed.TypeFuns: data Proxy (t :: k)
Files
- Data/Vector/HFixed.hs +3/−5
- Data/Vector/HFixed/Class.hs +5/−13
- Data/Vector/HFixed/Cont.hs +4/−8
- fixed-vector-hetero.cabal +6/−8
Data/Vector/HFixed.hs view
@@ -601,7 +601,7 @@ -- -- >>> replicateNatF Nothing :: HVecF '[Char,Int] Maybe -- [Nothing,Nothing]-replicateNatF :: (HVectorF v, Arity (ElemsF v))+replicateNatF :: (HVectorF v) => (forall a. f a) -> v f {-# INLINE replicateNatF #-} replicateNatF x = C.vectorF $ C.replicateNatF x@@ -665,20 +665,18 @@ -- | Convert heterogeneous vector to homogeneous monomorphize :: ( HVector v- , Peano n ~ Len (Elems v) , ArityC c (Elems v)) => Proxy c -> (forall a. c a => a -> x)- -> v -> F.ContVec n x+ -> v -> F.ContVec (Len (Elems v)) x {-# INLINE monomorphize #-} monomorphize c f = C.monomorphizeF c (f . runIdentity) . C.cvec -- | Convert heterogeneous vector to homogeneous monomorphizeF :: ( HVectorF v- , Peano n ~ Len (ElemsF v) , ArityC c (ElemsF v) ) => Proxy c -> (forall a. c a => f a -> x)- -> v f -> F.ContVec n x+ -> v f -> F.ContVec (Len (ElemsF v)) x {-# INLINE monomorphizeF #-} monomorphizeF c f = C.monomorphizeF c f . C.cvecF
Data/Vector/HFixed/Class.hs view
@@ -289,24 +289,22 @@ {-# INLINE toHomogeneous #-} -- | Default implementation of 'inspect' for homogeneous vector.-homInspect :: (F.Vector v a, HomArity (Peano (F.Dim v)) a)- => v a -> Fun (HomList (Peano (F.Dim v)) a) r -> r+homInspect :: (F.Vector v a, HomArity (F.Dim v) a)+ => v a -> Fun (HomList (F.Dim v) a) r -> r homInspect v f = F.inspect v (toHomogeneous f) {-# INLINE homInspect #-} -- | Default implementation of 'construct' for homogeneous vector. homConstruct :: forall v a.- (F.Vector v a, HomArity (Peano (F.Dim v)) a)- => Fun (HomList (Peano (F.Dim v)) a) (v a)-homConstruct = toHeterogeneous (F.construct :: F.Fun (Peano (F.Dim v)) a (v a))+ (F.Vector v a, HomArity (F.Dim v) a)+ => Fun (HomList (F.Dim v) a) (v a)+homConstruct = toHeterogeneous (F.construct :: F.Fun (F.Dim v) a (v a)) {-# INLINE homConstruct #-} instance ( HomArity (Peano n) a , Arity (HomList (Peano n) a)- , KnownNat n- , Peano (n + 1) ~ 'S (Peano n) ) => HVector (B.Vec n a) where type Elems (B.Vec n a) = HomList (Peano n) a inspect = homInspect@@ -317,8 +315,6 @@ instance ( U.Unbox n a , HomArity (Peano n) a , Arity (HomList (Peano n) a)- , KnownNat n- , Peano (n + 1) ~ 'S (Peano n) ) => HVector (U.Vec n a) where type Elems (U.Vec n a) = HomList (Peano n) a inspect = homInspect@@ -329,8 +325,6 @@ instance ( S.Storable a , HomArity (Peano n) a , Arity (HomList (Peano n) a)- , KnownNat n- , Peano (n + 1) ~ 'S (Peano n) ) => HVector (S.Vec n a) where type Elems (S.Vec n a) = HomList (Peano n) a inspect = homInspect@@ -341,8 +335,6 @@ instance ( P.Prim a , HomArity (Peano n) a , Arity (HomList (Peano n) a)- , KnownNat n- , Peano (n + 1) ~ 'S (Peano n) ) => HVector (P.Vec n a) where type Elems (P.Vec n a) = HomList (Peano n) a inspect = homInspect
Data/Vector/HFixed/Cont.hs view
@@ -362,21 +362,17 @@ (Const b0) -- | Convert heterogeneous vector to homogeneous-monomorphizeF :: forall c xs a f n. ( ArityC c xs- , F.Peano n ~ Len xs- )+monomorphizeF :: forall c xs a f. ( ArityC c xs ) => Proxy c -> (forall x. c x => f x -> a)- -> ContVecF xs f -> F.ContVec n a+ -> ContVecF xs f -> F.ContVec (Len xs) a {-# INLINE monomorphizeF #-} monomorphizeF cls f v = inspectF v $ accumC cls (\(T_mono cont) a -> T_mono (cont . F.consPeano (f a)))- (\(T_mono cont) -> fini (cont (F.CVecPeano F.unFun)))+ (\(T_mono cont) -> cont (F.ContVec F.unFun)) (T_mono id :: T_mono a xs xs)- where- fini (F.CVecPeano cont) = F.ContVec cont -data T_mono a all xs = T_mono (F.CVecPeano (Len xs) a -> F.CVecPeano (Len all) a)+data T_mono a all xs = T_mono (F.ContVec (Len xs) a -> F.ContVec (Len all) a) -- | Unfold vector.
fixed-vector-hetero.cabal view
@@ -1,5 +1,5 @@ Name: fixed-vector-hetero-Version: 0.6.2.0+Version: 0.7.0.0 Synopsis: Library for working with product types generically Description: Library allow to work with arbitrary product types in generic@@ -18,16 +18,14 @@ ChangeLog.md tested-with:- GHC ==8.4.4- || ==8.6.5- || ==8.8.4- || ==8.10.7+ GHC ==8.10.7 || ==9.0.1 || ==9.2.8 || ==9.4.8 || ==9.6.6 || ==9.8.2- || ==9.10.1+ || ==9.10.2+ || ==9.12.2 source-repository head@@ -39,9 +37,9 @@ -- tuples Ghc-options: -Wall -freduction-depth=50 default-language: Haskell2010- Build-Depends: base >=4.11 && <5+ Build-Depends: base >=4.14 && <5 , deepseq- , fixed-vector >= 1.0.0.0 && <1.3+ , fixed-vector >= 2.0.0.0 && <3 , primitive >= 0.6.2 Exposed-modules: Data.Vector.HFixed