{-# LANGUAGE CPP #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DeriveTraversable #-}
{-# LANGUAGE DerivingVia #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}

-- | Adapted from [Linear.V1](https://hackage.haskell.org/package/linear-1.21.8/docs/Linear-V1.html)
module Nonlinear.V1 where

import Data.Data (Data, Typeable)
import Data.Functor.Classes
import Data.Functor.Identity
import Foreign (Storable)
import GHC.Generics (Generic, Generic1)
import Nonlinear.Internal (Lens')
import Nonlinear.Vector (Vec (..))
#if MIN_VERSION_base(4,14,0)
import GHC.Ix (Ix)
#else
import Data.Ix (Ix)
#endif

newtype V1 a = V1 {V1 a -> a
v1x :: a}
  deriving stock (V1 a -> V1 a -> Bool
(V1 a -> V1 a -> Bool) -> (V1 a -> V1 a -> Bool) -> Eq (V1 a)
forall a. Eq a => V1 a -> V1 a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: V1 a -> V1 a -> Bool
$c/= :: forall a. Eq a => V1 a -> V1 a -> Bool
== :: V1 a -> V1 a -> Bool
$c== :: forall a. Eq a => V1 a -> V1 a -> Bool
Eq, Int -> V1 a -> ShowS
[V1 a] -> ShowS
V1 a -> String
(Int -> V1 a -> ShowS)
-> (V1 a -> String) -> ([V1 a] -> ShowS) -> Show (V1 a)
forall a. Show a => Int -> V1 a -> ShowS
forall a. Show a => [V1 a] -> ShowS
forall a. Show a => V1 a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [V1 a] -> ShowS
$cshowList :: forall a. Show a => [V1 a] -> ShowS
show :: V1 a -> String
$cshow :: forall a. Show a => V1 a -> String
showsPrec :: Int -> V1 a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> V1 a -> ShowS
Show, ReadPrec [V1 a]
ReadPrec (V1 a)
Int -> ReadS (V1 a)
ReadS [V1 a]
(Int -> ReadS (V1 a))
-> ReadS [V1 a]
-> ReadPrec (V1 a)
-> ReadPrec [V1 a]
-> Read (V1 a)
forall a. Read a => ReadPrec [V1 a]
forall a. Read a => ReadPrec (V1 a)
forall a. Read a => Int -> ReadS (V1 a)
forall a. Read a => ReadS [V1 a]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [V1 a]
$creadListPrec :: forall a. Read a => ReadPrec [V1 a]
readPrec :: ReadPrec (V1 a)
$creadPrec :: forall a. Read a => ReadPrec (V1 a)
readList :: ReadS [V1 a]
$creadList :: forall a. Read a => ReadS [V1 a]
readsPrec :: Int -> ReadS (V1 a)
$creadsPrec :: forall a. Read a => Int -> ReadS (V1 a)
Read, a -> V1 b -> V1 a
(a -> b) -> V1 a -> V1 b
(forall a b. (a -> b) -> V1 a -> V1 b)
-> (forall a b. a -> V1 b -> V1 a) -> Functor V1
forall a b. a -> V1 b -> V1 a
forall a b. (a -> b) -> V1 a -> V1 b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: a -> V1 b -> V1 a
$c<$ :: forall a b. a -> V1 b -> V1 a
fmap :: (a -> b) -> V1 a -> V1 b
$cfmap :: forall a b. (a -> b) -> V1 a -> V1 b
Functor, V1 a -> Bool
(a -> m) -> V1 a -> m
(a -> b -> b) -> b -> V1 a -> b
(forall m. Monoid m => V1 m -> m)
-> (forall m a. Monoid m => (a -> m) -> V1 a -> m)
-> (forall m a. Monoid m => (a -> m) -> V1 a -> m)
-> (forall a b. (a -> b -> b) -> b -> V1 a -> b)
-> (forall a b. (a -> b -> b) -> b -> V1 a -> b)
-> (forall b a. (b -> a -> b) -> b -> V1 a -> b)
-> (forall b a. (b -> a -> b) -> b -> V1 a -> b)
-> (forall a. (a -> a -> a) -> V1 a -> a)
-> (forall a. (a -> a -> a) -> V1 a -> a)
-> (forall a. V1 a -> [a])
-> (forall a. V1 a -> Bool)
-> (forall a. V1 a -> Int)
-> (forall a. Eq a => a -> V1 a -> Bool)
-> (forall a. Ord a => V1 a -> a)
-> (forall a. Ord a => V1 a -> a)
-> (forall a. Num a => V1 a -> a)
-> (forall a. Num a => V1 a -> a)
-> Foldable V1
forall a. Eq a => a -> V1 a -> Bool
forall a. Num a => V1 a -> a
forall a. Ord a => V1 a -> a
forall m. Monoid m => V1 m -> m
forall a. V1 a -> Bool
forall a. V1 a -> Int
forall a. V1 a -> [a]
forall a. (a -> a -> a) -> V1 a -> a
forall m a. Monoid m => (a -> m) -> V1 a -> m
forall b a. (b -> a -> b) -> b -> V1 a -> b
forall a b. (a -> b -> b) -> b -> V1 a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: V1 a -> a
$cproduct :: forall a. Num a => V1 a -> a
sum :: V1 a -> a
$csum :: forall a. Num a => V1 a -> a
minimum :: V1 a -> a
$cminimum :: forall a. Ord a => V1 a -> a
maximum :: V1 a -> a
$cmaximum :: forall a. Ord a => V1 a -> a
elem :: a -> V1 a -> Bool
$celem :: forall a. Eq a => a -> V1 a -> Bool
length :: V1 a -> Int
$clength :: forall a. V1 a -> Int
null :: V1 a -> Bool
$cnull :: forall a. V1 a -> Bool
toList :: V1 a -> [a]
$ctoList :: forall a. V1 a -> [a]
foldl1 :: (a -> a -> a) -> V1 a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> V1 a -> a
foldr1 :: (a -> a -> a) -> V1 a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> V1 a -> a
foldl' :: (b -> a -> b) -> b -> V1 a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> V1 a -> b
foldl :: (b -> a -> b) -> b -> V1 a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> V1 a -> b
foldr' :: (a -> b -> b) -> b -> V1 a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> V1 a -> b
foldr :: (a -> b -> b) -> b -> V1 a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> V1 a -> b
foldMap' :: (a -> m) -> V1 a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> V1 a -> m
foldMap :: (a -> m) -> V1 a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> V1 a -> m
fold :: V1 m -> m
$cfold :: forall m. Monoid m => V1 m -> m
Foldable, Functor V1
Foldable V1
Functor V1
-> Foldable V1
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> V1 a -> f (V1 b))
-> (forall (f :: * -> *) a. Applicative f => V1 (f a) -> f (V1 a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> V1 a -> m (V1 b))
-> (forall (m :: * -> *) a. Monad m => V1 (m a) -> m (V1 a))
-> Traversable V1
(a -> f b) -> V1 a -> f (V1 b)
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (m :: * -> *) a. Monad m => V1 (m a) -> m (V1 a)
forall (f :: * -> *) a. Applicative f => V1 (f a) -> f (V1 a)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> V1 a -> m (V1 b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> V1 a -> f (V1 b)
sequence :: V1 (m a) -> m (V1 a)
$csequence :: forall (m :: * -> *) a. Monad m => V1 (m a) -> m (V1 a)
mapM :: (a -> m b) -> V1 a -> m (V1 b)
$cmapM :: forall (m :: * -> *) a b. Monad m => (a -> m b) -> V1 a -> m (V1 b)
sequenceA :: V1 (f a) -> f (V1 a)
$csequenceA :: forall (f :: * -> *) a. Applicative f => V1 (f a) -> f (V1 a)
traverse :: (a -> f b) -> V1 a -> f (V1 b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> V1 a -> f (V1 b)
$cp2Traversable :: Foldable V1
$cp1Traversable :: Functor V1
Traversable, (forall x. V1 a -> Rep (V1 a) x)
-> (forall x. Rep (V1 a) x -> V1 a) -> Generic (V1 a)
forall x. Rep (V1 a) x -> V1 a
forall x. V1 a -> Rep (V1 a) x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a x. Rep (V1 a) x -> V1 a
forall a x. V1 a -> Rep (V1 a) x
$cto :: forall a x. Rep (V1 a) x -> V1 a
$cfrom :: forall a x. V1 a -> Rep (V1 a) x
Generic, (forall a. V1 a -> Rep1 V1 a)
-> (forall a. Rep1 V1 a -> V1 a) -> Generic1 V1
forall a. Rep1 V1 a -> V1 a
forall a. V1 a -> Rep1 V1 a
forall k (f :: k -> *).
(forall (a :: k). f a -> Rep1 f a)
-> (forall (a :: k). Rep1 f a -> f a) -> Generic1 f
$cto1 :: forall a. Rep1 V1 a -> V1 a
$cfrom1 :: forall a. V1 a -> Rep1 V1 a
Generic1, Typeable (V1 a)
DataType
Constr
Typeable (V1 a)
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> V1 a -> c (V1 a))
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c (V1 a))
-> (V1 a -> Constr)
-> (V1 a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c (V1 a)))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V1 a)))
-> ((forall b. Data b => b -> b) -> V1 a -> V1 a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r)
-> (forall u. (forall d. Data d => d -> u) -> V1 a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> V1 a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> V1 a -> m (V1 a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> V1 a -> m (V1 a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> V1 a -> m (V1 a))
-> Data (V1 a)
V1 a -> DataType
V1 a -> Constr
(forall d. Data d => c (t d)) -> Maybe (c (V1 a))
(forall b. Data b => b -> b) -> V1 a -> V1 a
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> V1 a -> c (V1 a)
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (V1 a)
forall a. Data a => Typeable (V1 a)
forall a. Data a => V1 a -> DataType
forall a. Data a => V1 a -> Constr
forall a. Data a => (forall b. Data b => b -> b) -> V1 a -> V1 a
forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> V1 a -> u
forall a u. Data a => (forall d. Data d => d -> u) -> V1 a -> [u]
forall a r r'.
Data a =>
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r
forall a r r'.
Data a =>
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r
forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (V1 a)
forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> V1 a -> c (V1 a)
forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (V1 a))
forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V1 a))
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> V1 a -> u
forall u. (forall d. Data d => d -> u) -> V1 a -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (V1 a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> V1 a -> c (V1 a)
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (V1 a))
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V1 a))
$cV1 :: Constr
$tV1 :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
$cgmapMo :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
gmapMp :: (forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
$cgmapMp :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
gmapM :: (forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
$cgmapM :: forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d) -> V1 a -> m (V1 a)
gmapQi :: Int -> (forall d. Data d => d -> u) -> V1 a -> u
$cgmapQi :: forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> V1 a -> u
gmapQ :: (forall d. Data d => d -> u) -> V1 a -> [u]
$cgmapQ :: forall a u. Data a => (forall d. Data d => d -> u) -> V1 a -> [u]
gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r
$cgmapQr :: forall a r r'.
Data a =>
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r
gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r
$cgmapQl :: forall a r r'.
Data a =>
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V1 a -> r
gmapT :: (forall b. Data b => b -> b) -> V1 a -> V1 a
$cgmapT :: forall a. Data a => (forall b. Data b => b -> b) -> V1 a -> V1 a
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V1 a))
$cdataCast2 :: forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V1 a))
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c (V1 a))
$cdataCast1 :: forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (V1 a))
dataTypeOf :: V1 a -> DataType
$cdataTypeOf :: forall a. Data a => V1 a -> DataType
toConstr :: V1 a -> Constr
$ctoConstr :: forall a. Data a => V1 a -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (V1 a)
$cgunfold :: forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (V1 a)
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> V1 a -> c (V1 a)
$cgfoldl :: forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> V1 a -> c (V1 a)
$cp1Data :: forall a. Data a => Typeable (V1 a)
Data, Typeable)
  deriving newtype (Ptr b -> Int -> IO (V1 a)
Ptr b -> Int -> V1 a -> IO ()
Ptr (V1 a) -> IO (V1 a)
Ptr (V1 a) -> Int -> IO (V1 a)
Ptr (V1 a) -> Int -> V1 a -> IO ()
Ptr (V1 a) -> V1 a -> IO ()
V1 a -> Int
(V1 a -> Int)
-> (V1 a -> Int)
-> (Ptr (V1 a) -> Int -> IO (V1 a))
-> (Ptr (V1 a) -> Int -> V1 a -> IO ())
-> (forall b. Ptr b -> Int -> IO (V1 a))
-> (forall b. Ptr b -> Int -> V1 a -> IO ())
-> (Ptr (V1 a) -> IO (V1 a))
-> (Ptr (V1 a) -> V1 a -> IO ())
-> Storable (V1 a)
forall b. Ptr b -> Int -> IO (V1 a)
forall b. Ptr b -> Int -> V1 a -> IO ()
forall a. Storable a => Ptr (V1 a) -> IO (V1 a)
forall a. Storable a => Ptr (V1 a) -> Int -> IO (V1 a)
forall a. Storable a => Ptr (V1 a) -> Int -> V1 a -> IO ()
forall a. Storable a => Ptr (V1 a) -> V1 a -> IO ()
forall a. Storable a => V1 a -> Int
forall a b. Storable a => Ptr b -> Int -> IO (V1 a)
forall a b. Storable a => Ptr b -> Int -> V1 a -> IO ()
forall a.
(a -> Int)
-> (a -> Int)
-> (Ptr a -> Int -> IO a)
-> (Ptr a -> Int -> a -> IO ())
-> (forall b. Ptr b -> Int -> IO a)
-> (forall b. Ptr b -> Int -> a -> IO ())
-> (Ptr a -> IO a)
-> (Ptr a -> a -> IO ())
-> Storable a
poke :: Ptr (V1 a) -> V1 a -> IO ()
$cpoke :: forall a. Storable a => Ptr (V1 a) -> V1 a -> IO ()
peek :: Ptr (V1 a) -> IO (V1 a)
$cpeek :: forall a. Storable a => Ptr (V1 a) -> IO (V1 a)
pokeByteOff :: Ptr b -> Int -> V1 a -> IO ()
$cpokeByteOff :: forall a b. Storable a => Ptr b -> Int -> V1 a -> IO ()
peekByteOff :: Ptr b -> Int -> IO (V1 a)
$cpeekByteOff :: forall a b. Storable a => Ptr b -> Int -> IO (V1 a)
pokeElemOff :: Ptr (V1 a) -> Int -> V1 a -> IO ()
$cpokeElemOff :: forall a. Storable a => Ptr (V1 a) -> Int -> V1 a -> IO ()
peekElemOff :: Ptr (V1 a) -> Int -> IO (V1 a)
$cpeekElemOff :: forall a. Storable a => Ptr (V1 a) -> Int -> IO (V1 a)
alignment :: V1 a -> Int
$calignment :: forall a. Storable a => V1 a -> Int
sizeOf :: V1 a -> Int
$csizeOf :: forall a. Storable a => V1 a -> Int
Storable, V1 a
V1 a -> V1 a -> Bounded (V1 a)
forall a. a -> a -> Bounded a
forall a. Bounded a => V1 a
maxBound :: V1 a
$cmaxBound :: forall a. Bounded a => V1 a
minBound :: V1 a
$cminBound :: forall a. Bounded a => V1 a
Bounded, Eq (V1 a)
Eq (V1 a)
-> (V1 a -> V1 a -> Ordering)
-> (V1 a -> V1 a -> Bool)
-> (V1 a -> V1 a -> Bool)
-> (V1 a -> V1 a -> Bool)
-> (V1 a -> V1 a -> Bool)
-> (V1 a -> V1 a -> V1 a)
-> (V1 a -> V1 a -> V1 a)
-> Ord (V1 a)
V1 a -> V1 a -> Bool
V1 a -> V1 a -> Ordering
V1 a -> V1 a -> V1 a
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall a. Ord a => Eq (V1 a)
forall a. Ord a => V1 a -> V1 a -> Bool
forall a. Ord a => V1 a -> V1 a -> Ordering
forall a. Ord a => V1 a -> V1 a -> V1 a
min :: V1 a -> V1 a -> V1 a
$cmin :: forall a. Ord a => V1 a -> V1 a -> V1 a
max :: V1 a -> V1 a -> V1 a
$cmax :: forall a. Ord a => V1 a -> V1 a -> V1 a
>= :: V1 a -> V1 a -> Bool
$c>= :: forall a. Ord a => V1 a -> V1 a -> Bool
> :: V1 a -> V1 a -> Bool
$c> :: forall a. Ord a => V1 a -> V1 a -> Bool
<= :: V1 a -> V1 a -> Bool
$c<= :: forall a. Ord a => V1 a -> V1 a -> Bool
< :: V1 a -> V1 a -> Bool
$c< :: forall a. Ord a => V1 a -> V1 a -> Bool
compare :: V1 a -> V1 a -> Ordering
$ccompare :: forall a. Ord a => V1 a -> V1 a -> Ordering
$cp1Ord :: forall a. Ord a => Eq (V1 a)
Ord, Integer -> V1 a
V1 a -> V1 a
V1 a -> V1 a -> V1 a
(V1 a -> V1 a -> V1 a)
-> (V1 a -> V1 a -> V1 a)
-> (V1 a -> V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (Integer -> V1 a)
-> Num (V1 a)
forall a. Num a => Integer -> V1 a
forall a. Num a => V1 a -> V1 a
forall a. Num a => V1 a -> V1 a -> V1 a
forall a.
(a -> a -> a)
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (Integer -> a)
-> Num a
fromInteger :: Integer -> V1 a
$cfromInteger :: forall a. Num a => Integer -> V1 a
signum :: V1 a -> V1 a
$csignum :: forall a. Num a => V1 a -> V1 a
abs :: V1 a -> V1 a
$cabs :: forall a. Num a => V1 a -> V1 a
negate :: V1 a -> V1 a
$cnegate :: forall a. Num a => V1 a -> V1 a
* :: V1 a -> V1 a -> V1 a
$c* :: forall a. Num a => V1 a -> V1 a -> V1 a
- :: V1 a -> V1 a -> V1 a
$c- :: forall a. Num a => V1 a -> V1 a -> V1 a
+ :: V1 a -> V1 a -> V1 a
$c+ :: forall a. Num a => V1 a -> V1 a -> V1 a
Num, Num (V1 a)
Num (V1 a)
-> (V1 a -> V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (Rational -> V1 a)
-> Fractional (V1 a)
Rational -> V1 a
V1 a -> V1 a
V1 a -> V1 a -> V1 a
forall a. Fractional a => Num (V1 a)
forall a. Fractional a => Rational -> V1 a
forall a. Fractional a => V1 a -> V1 a
forall a. Fractional a => V1 a -> V1 a -> V1 a
forall a.
Num a
-> (a -> a -> a) -> (a -> a) -> (Rational -> a) -> Fractional a
fromRational :: Rational -> V1 a
$cfromRational :: forall a. Fractional a => Rational -> V1 a
recip :: V1 a -> V1 a
$crecip :: forall a. Fractional a => V1 a -> V1 a
/ :: V1 a -> V1 a -> V1 a
$c/ :: forall a. Fractional a => V1 a -> V1 a -> V1 a
$cp1Fractional :: forall a. Fractional a => Num (V1 a)
Fractional, Fractional (V1 a)
V1 a
Fractional (V1 a)
-> V1 a
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a -> V1 a)
-> (V1 a -> V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> (V1 a -> V1 a)
-> Floating (V1 a)
V1 a -> V1 a
V1 a -> V1 a -> V1 a
forall a. Floating a => Fractional (V1 a)
forall a. Floating a => V1 a
forall a. Floating a => V1 a -> V1 a
forall a. Floating a => V1 a -> V1 a -> V1 a
forall a.
Fractional a
-> a
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> Floating a
log1mexp :: V1 a -> V1 a
$clog1mexp :: forall a. Floating a => V1 a -> V1 a
log1pexp :: V1 a -> V1 a
$clog1pexp :: forall a. Floating a => V1 a -> V1 a
expm1 :: V1 a -> V1 a
$cexpm1 :: forall a. Floating a => V1 a -> V1 a
log1p :: V1 a -> V1 a
$clog1p :: forall a. Floating a => V1 a -> V1 a
atanh :: V1 a -> V1 a
$catanh :: forall a. Floating a => V1 a -> V1 a
acosh :: V1 a -> V1 a
$cacosh :: forall a. Floating a => V1 a -> V1 a
asinh :: V1 a -> V1 a
$casinh :: forall a. Floating a => V1 a -> V1 a
tanh :: V1 a -> V1 a
$ctanh :: forall a. Floating a => V1 a -> V1 a
cosh :: V1 a -> V1 a
$ccosh :: forall a. Floating a => V1 a -> V1 a
sinh :: V1 a -> V1 a
$csinh :: forall a. Floating a => V1 a -> V1 a
atan :: V1 a -> V1 a
$catan :: forall a. Floating a => V1 a -> V1 a
acos :: V1 a -> V1 a
$cacos :: forall a. Floating a => V1 a -> V1 a
asin :: V1 a -> V1 a
$casin :: forall a. Floating a => V1 a -> V1 a
tan :: V1 a -> V1 a
$ctan :: forall a. Floating a => V1 a -> V1 a
cos :: V1 a -> V1 a
$ccos :: forall a. Floating a => V1 a -> V1 a
sin :: V1 a -> V1 a
$csin :: forall a. Floating a => V1 a -> V1 a
logBase :: V1 a -> V1 a -> V1 a
$clogBase :: forall a. Floating a => V1 a -> V1 a -> V1 a
** :: V1 a -> V1 a -> V1 a
$c** :: forall a. Floating a => V1 a -> V1 a -> V1 a
sqrt :: V1 a -> V1 a
$csqrt :: forall a. Floating a => V1 a -> V1 a
log :: V1 a -> V1 a
$clog :: forall a. Floating a => V1 a -> V1 a
exp :: V1 a -> V1 a
$cexp :: forall a. Floating a => V1 a -> V1 a
pi :: V1 a
$cpi :: forall a. Floating a => V1 a
$cp1Floating :: forall a. Floating a => Fractional (V1 a)
Floating, b -> V1 a -> V1 a
NonEmpty (V1 a) -> V1 a
V1 a -> V1 a -> V1 a
(V1 a -> V1 a -> V1 a)
-> (NonEmpty (V1 a) -> V1 a)
-> (forall b. Integral b => b -> V1 a -> V1 a)
-> Semigroup (V1 a)
forall b. Integral b => b -> V1 a -> V1 a
forall a. Semigroup a => NonEmpty (V1 a) -> V1 a
forall a. Semigroup a => V1 a -> V1 a -> V1 a
forall a b. (Semigroup a, Integral b) => b -> V1 a -> V1 a
forall a.
(a -> a -> a)
-> (NonEmpty a -> a)
-> (forall b. Integral b => b -> a -> a)
-> Semigroup a
stimes :: b -> V1 a -> V1 a
$cstimes :: forall a b. (Semigroup a, Integral b) => b -> V1 a -> V1 a
sconcat :: NonEmpty (V1 a) -> V1 a
$csconcat :: forall a. Semigroup a => NonEmpty (V1 a) -> V1 a
<> :: V1 a -> V1 a -> V1 a
$c<> :: forall a. Semigroup a => V1 a -> V1 a -> V1 a
Semigroup, Semigroup (V1 a)
V1 a
Semigroup (V1 a)
-> V1 a
-> (V1 a -> V1 a -> V1 a)
-> ([V1 a] -> V1 a)
-> Monoid (V1 a)
[V1 a] -> V1 a
V1 a -> V1 a -> V1 a
forall a.
Semigroup a -> a -> (a -> a -> a) -> ([a] -> a) -> Monoid a
forall a. Monoid a => Semigroup (V1 a)
forall a. Monoid a => V1 a
forall a. Monoid a => [V1 a] -> V1 a
forall a. Monoid a => V1 a -> V1 a -> V1 a
mconcat :: [V1 a] -> V1 a
$cmconcat :: forall a. Monoid a => [V1 a] -> V1 a
mappend :: V1 a -> V1 a -> V1 a
$cmappend :: forall a. Monoid a => V1 a -> V1 a -> V1 a
mempty :: V1 a
$cmempty :: forall a. Monoid a => V1 a
$cp1Monoid :: forall a. Monoid a => Semigroup (V1 a)
Monoid, Ord (V1 a)
Ord (V1 a)
-> ((V1 a, V1 a) -> [V1 a])
-> ((V1 a, V1 a) -> V1 a -> Int)
-> ((V1 a, V1 a) -> V1 a -> Int)
-> ((V1 a, V1 a) -> V1 a -> Bool)
-> ((V1 a, V1 a) -> Int)
-> ((V1 a, V1 a) -> Int)
-> Ix (V1 a)
(V1 a, V1 a) -> Int
(V1 a, V1 a) -> [V1 a]
(V1 a, V1 a) -> V1 a -> Bool
(V1 a, V1 a) -> V1 a -> Int
forall a.
Ord a
-> ((a, a) -> [a])
-> ((a, a) -> a -> Int)
-> ((a, a) -> a -> Int)
-> ((a, a) -> a -> Bool)
-> ((a, a) -> Int)
-> ((a, a) -> Int)
-> Ix a
forall a. Ix a => Ord (V1 a)
forall a. Ix a => (V1 a, V1 a) -> Int
forall a. Ix a => (V1 a, V1 a) -> [V1 a]
forall a. Ix a => (V1 a, V1 a) -> V1 a -> Bool
forall a. Ix a => (V1 a, V1 a) -> V1 a -> Int
unsafeRangeSize :: (V1 a, V1 a) -> Int
$cunsafeRangeSize :: forall a. Ix a => (V1 a, V1 a) -> Int
rangeSize :: (V1 a, V1 a) -> Int
$crangeSize :: forall a. Ix a => (V1 a, V1 a) -> Int
inRange :: (V1 a, V1 a) -> V1 a -> Bool
$cinRange :: forall a. Ix a => (V1 a, V1 a) -> V1 a -> Bool
unsafeIndex :: (V1 a, V1 a) -> V1 a -> Int
$cunsafeIndex :: forall a. Ix a => (V1 a, V1 a) -> V1 a -> Int
index :: (V1 a, V1 a) -> V1 a -> Int
$cindex :: forall a. Ix a => (V1 a, V1 a) -> V1 a -> Int
range :: (V1 a, V1 a) -> [V1 a]
$crange :: forall a. Ix a => (V1 a, V1 a) -> [V1 a]
$cp1Ix :: forall a. Ix a => Ord (V1 a)
Ix)
  deriving ((a -> b -> Bool) -> V1 a -> V1 b -> Bool
(forall a b. (a -> b -> Bool) -> V1 a -> V1 b -> Bool) -> Eq1 V1
forall a b. (a -> b -> Bool) -> V1 a -> V1 b -> Bool
forall (f :: * -> *).
(forall a b. (a -> b -> Bool) -> f a -> f b -> Bool) -> Eq1 f
liftEq :: (a -> b -> Bool) -> V1 a -> V1 b -> Bool
$cliftEq :: forall a b. (a -> b -> Bool) -> V1 a -> V1 b -> Bool
Eq1, ReadPrec a -> ReadPrec [a] -> ReadPrec (V1 a)
ReadPrec a -> ReadPrec [a] -> ReadPrec [V1 a]
(Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (V1 a)
(Int -> ReadS a) -> ReadS [a] -> ReadS [V1 a]
(forall a. (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (V1 a))
-> (forall a. (Int -> ReadS a) -> ReadS [a] -> ReadS [V1 a])
-> (forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec (V1 a))
-> (forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec [V1 a])
-> Read1 V1
forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec [V1 a]
forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec (V1 a)
forall a. (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (V1 a)
forall a. (Int -> ReadS a) -> ReadS [a] -> ReadS [V1 a]
forall (f :: * -> *).
(forall a. (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (f a))
-> (forall a. (Int -> ReadS a) -> ReadS [a] -> ReadS [f a])
-> (forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec (f a))
-> (forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec [f a])
-> Read1 f
liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [V1 a]
$cliftReadListPrec :: forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec [V1 a]
liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (V1 a)
$cliftReadPrec :: forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec (V1 a)
liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [V1 a]
$cliftReadList :: forall a. (Int -> ReadS a) -> ReadS [a] -> ReadS [V1 a]
liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (V1 a)
$cliftReadsPrec :: forall a. (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (V1 a)
Read1, (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V1 a -> ShowS
(Int -> a -> ShowS) -> ([a] -> ShowS) -> [V1 a] -> ShowS
(forall a.
 (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V1 a -> ShowS)
-> (forall a.
    (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V1 a] -> ShowS)
-> Show1 V1
forall a.
(Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V1 a -> ShowS
forall a. (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V1 a] -> ShowS
forall (f :: * -> *).
(forall a.
 (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> f a -> ShowS)
-> (forall a.
    (Int -> a -> ShowS) -> ([a] -> ShowS) -> [f a] -> ShowS)
-> Show1 f
liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V1 a] -> ShowS
$cliftShowList :: forall a. (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V1 a] -> ShowS
liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V1 a -> ShowS
$cliftShowsPrec :: forall a.
(Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V1 a -> ShowS
Show1, Eq1 V1
Eq1 V1
-> (forall a b. (a -> b -> Ordering) -> V1 a -> V1 b -> Ordering)
-> Ord1 V1
(a -> b -> Ordering) -> V1 a -> V1 b -> Ordering
forall a b. (a -> b -> Ordering) -> V1 a -> V1 b -> Ordering
forall (f :: * -> *).
Eq1 f
-> (forall a b. (a -> b -> Ordering) -> f a -> f b -> Ordering)
-> Ord1 f
liftCompare :: (a -> b -> Ordering) -> V1 a -> V1 b -> Ordering
$cliftCompare :: forall a b. (a -> b -> Ordering) -> V1 a -> V1 b -> Ordering
$cp1Ord1 :: Eq1 V1
Ord1, Functor V1
a -> V1 a
Functor V1
-> (forall a. a -> V1 a)
-> (forall a b. V1 (a -> b) -> V1 a -> V1 b)
-> (forall a b c. (a -> b -> c) -> V1 a -> V1 b -> V1 c)
-> (forall a b. V1 a -> V1 b -> V1 b)
-> (forall a b. V1 a -> V1 b -> V1 a)
-> Applicative V1
V1 a -> V1 b -> V1 b
V1 a -> V1 b -> V1 a
V1 (a -> b) -> V1 a -> V1 b
(a -> b -> c) -> V1 a -> V1 b -> V1 c
forall a. a -> V1 a
forall a b. V1 a -> V1 b -> V1 a
forall a b. V1 a -> V1 b -> V1 b
forall a b. V1 (a -> b) -> V1 a -> V1 b
forall a b c. (a -> b -> c) -> V1 a -> V1 b -> V1 c
forall (f :: * -> *).
Functor f
-> (forall a. a -> f a)
-> (forall a b. f (a -> b) -> f a -> f b)
-> (forall a b c. (a -> b -> c) -> f a -> f b -> f c)
-> (forall a b. f a -> f b -> f b)
-> (forall a b. f a -> f b -> f a)
-> Applicative f
<* :: V1 a -> V1 b -> V1 a
$c<* :: forall a b. V1 a -> V1 b -> V1 a
*> :: V1 a -> V1 b -> V1 b
$c*> :: forall a b. V1 a -> V1 b -> V1 b
liftA2 :: (a -> b -> c) -> V1 a -> V1 b -> V1 c
$cliftA2 :: forall a b c. (a -> b -> c) -> V1 a -> V1 b -> V1 c
<*> :: V1 (a -> b) -> V1 a -> V1 b
$c<*> :: forall a b. V1 (a -> b) -> V1 a -> V1 b
pure :: a -> V1 a
$cpure :: forall a. a -> V1 a
$cp1Applicative :: Functor V1
Applicative, Applicative V1
a -> V1 a
Applicative V1
-> (forall a b. V1 a -> (a -> V1 b) -> V1 b)
-> (forall a b. V1 a -> V1 b -> V1 b)
-> (forall a. a -> V1 a)
-> Monad V1
V1 a -> (a -> V1 b) -> V1 b
V1 a -> V1 b -> V1 b
forall a. a -> V1 a
forall a b. V1 a -> V1 b -> V1 b
forall a b. V1 a -> (a -> V1 b) -> V1 b
forall (m :: * -> *).
Applicative m
-> (forall a b. m a -> (a -> m b) -> m b)
-> (forall a b. m a -> m b -> m b)
-> (forall a. a -> m a)
-> Monad m
return :: a -> V1 a
$creturn :: forall a. a -> V1 a
>> :: V1 a -> V1 b -> V1 b
$c>> :: forall a b. V1 a -> V1 b -> V1 b
>>= :: V1 a -> (a -> V1 b) -> V1 b
$c>>= :: forall a b. V1 a -> (a -> V1 b) -> V1 b
$cp1Monad :: Applicative V1
Monad) via Identity

instance Vec V1 where
  construct :: ((forall b. Lens' (V1 b) b) -> a) -> V1 a
construct (forall b. Lens' (V1 b) b) -> a
f = a -> V1 a
forall a. a -> V1 a
V1 ((forall b. Lens' (V1 b) b) -> a
f forall b. Lens' (V1 b) b
forall (t :: * -> *) a. R1 t => Lens' (t a) a
_x)

class R1 t where
  _x :: Lens' (t a) a

instance R1 V1 where
  {-# INLINE _x #-}
  _x :: (a -> m a) -> V1 a -> m (V1 a)
_x a -> m a
f (V1 a
a) = a -> V1 a
forall a. a -> V1 a
V1 (a -> V1 a) -> m a -> m (V1 a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> a -> m a
f a
a