{-# LANGUAGE MultiParamTypeClasses
,TypeFamilies
,FlexibleInstances #-}
{-# OPTIONS -fno-warn-orphans #-}
module Data.ListLike.Vector.Vector ()
where
import Prelude as P
import qualified Data.Vector as V
import Data.Vector ((!))
import Data.ListLike.Base
import Data.ListLike.FoldableLL
import Data.ListLike.String
import Data.String (IsString)
instance FoldableLL (V.Vector a) a where
foldl :: forall a. (a -> a -> a) -> a -> Vector a -> a
foldl = forall a b. (a -> b -> a) -> a -> Vector b -> a
V.foldl
foldl' :: forall a. (a -> a -> a) -> a -> Vector a -> a
foldl' = forall a b. (a -> b -> a) -> a -> Vector b -> a
V.foldl'
foldl1 :: (a -> a -> a) -> Vector a -> a
foldl1 = forall a. (a -> a -> a) -> Vector a -> a
V.foldl1
foldr :: forall b. (a -> b -> b) -> b -> Vector a -> b
foldr = forall a b. (a -> b -> b) -> b -> Vector a -> b
V.foldr
foldr' :: forall b. (a -> b -> b) -> b -> Vector a -> b
foldr' = forall a b. (a -> b -> b) -> b -> Vector a -> b
V.foldr'
foldr1 :: (a -> a -> a) -> Vector a -> a
foldr1 = forall a. (a -> a -> a) -> Vector a -> a
V.foldr1
instance ListLike (V.Vector a) a where
empty :: Vector a
empty = forall a. Vector a
V.empty
singleton :: a -> Vector a
singleton = forall a. a -> Vector a
V.singleton
cons :: a -> Vector a -> Vector a
cons = forall a. a -> Vector a -> Vector a
V.cons
snoc :: Vector a -> a -> Vector a
snoc = forall a. Vector a -> a -> Vector a
V.snoc
append :: Vector a -> Vector a -> Vector a
append = forall a. Monoid a => a -> a -> a
mappend
head :: Vector a -> a
head = forall a. Vector a -> a
V.head
last :: Vector a -> a
last = forall a. Vector a -> a
V.last
tail :: Vector a -> Vector a
tail = forall a. Vector a -> Vector a
V.tail
init :: Vector a -> Vector a
init = forall a. Vector a -> Vector a
V.init
null :: Vector a -> Bool
null = forall a. Vector a -> Bool
V.null
length :: Vector a -> Int
length = forall a. Vector a -> Int
V.length
rigidMap :: (a -> a) -> Vector a -> Vector a
rigidMap = forall a b. (a -> b) -> Vector a -> Vector b
V.map
reverse :: Vector a -> Vector a
reverse = forall a. Vector a -> Vector a
V.reverse
concat :: forall full'. ListLike full' (Vector a) => full' -> Vector a
concat = forall a. [Vector a] -> Vector a
V.concat forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l. IsList l => l -> [Item l]
toList
rigidConcatMap :: (a -> Vector a) -> Vector a -> Vector a
rigidConcatMap = forall a b. (a -> Vector b) -> Vector a -> Vector b
V.concatMap
any :: (a -> Bool) -> Vector a -> Bool
any = forall a. (a -> Bool) -> Vector a -> Bool
V.any
all :: (a -> Bool) -> Vector a -> Bool
all = forall a. (a -> Bool) -> Vector a -> Bool
V.all
maximum :: Ord a => Vector a -> a
maximum = forall a. Ord a => Vector a -> a
V.maximum
minimum :: Ord a => Vector a -> a
minimum = forall a. Ord a => Vector a -> a
V.minimum
replicate :: Int -> a -> Vector a
replicate = forall a. Int -> a -> Vector a
V.replicate
take :: Int -> Vector a -> Vector a
take = forall a. Int -> Vector a -> Vector a
V.take
drop :: Int -> Vector a -> Vector a
drop = forall a. Int -> Vector a -> Vector a
V.drop
takeWhile :: (a -> Bool) -> Vector a -> Vector a
takeWhile = forall a. (a -> Bool) -> Vector a -> Vector a
V.takeWhile
dropWhile :: (a -> Bool) -> Vector a -> Vector a
dropWhile = forall a. (a -> Bool) -> Vector a -> Vector a
V.dropWhile
span :: (a -> Bool) -> Vector a -> (Vector a, Vector a)
span = forall a. (a -> Bool) -> Vector a -> (Vector a, Vector a)
V.span
break :: (a -> Bool) -> Vector a -> (Vector a, Vector a)
break = forall a. (a -> Bool) -> Vector a -> (Vector a, Vector a)
V.break
isPrefixOf :: Eq a => Vector a -> Vector a -> Bool
isPrefixOf = forall a. Eq a => Vector a -> Vector a -> Bool
isPrefixOf'
isSuffixOf :: Eq a => Vector a -> Vector a -> Bool
isSuffixOf = forall a. Eq a => Vector a -> Vector a -> Bool
isSuffixOf'
elem :: Eq a => a -> Vector a -> Bool
elem = forall a. Eq a => a -> Vector a -> Bool
V.elem
find :: (a -> Bool) -> Vector a -> Maybe a
find = forall a. (a -> Bool) -> Vector a -> Maybe a
V.find
filter :: (a -> Bool) -> Vector a -> Vector a
filter = forall a. (a -> Bool) -> Vector a -> Vector a
V.filter
index :: Vector a -> Int -> a
index = forall a. Vector a -> Int -> a
(!)
findIndex :: (a -> Bool) -> Vector a -> Maybe Int
findIndex = forall a. (a -> Bool) -> Vector a -> Maybe Int
V.findIndex
genericLength :: forall a. Num a => Vector a -> a
genericLength = forall a. Num a => Integer -> a
fromInteger forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (Integral a, Num b) => a -> b
fromIntegral forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Vector a -> Int
V.length
genericTake :: forall a. Integral a => a -> Vector a -> Vector a
genericTake a
i = forall a. Int -> Vector a -> Vector a
V.take (forall a b. (Integral a, Num b) => a -> b
fromIntegral a
i)
genericDrop :: forall a. Integral a => a -> Vector a -> Vector a
genericDrop a
i = forall a. Int -> Vector a -> Vector a
V.drop (forall a b. (Integral a, Num b) => a -> b
fromIntegral a
i)
genericReplicate :: forall a. Integral a => a -> a -> Vector a
genericReplicate a
i = forall a. Int -> a -> Vector a
V.replicate (forall a b. (Integral a, Num b) => a -> b
fromIntegral a
i)
sequence :: forall (m :: * -> *) fullinp.
(Applicative m, ListLike fullinp (m a)) =>
fullinp -> m (Vector a)
sequence = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall l. IsList l => [Item l] -> l
fromList forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) (f :: * -> *) a.
(Traversable t, Applicative f) =>
t (f a) -> f (t a)
P.sequenceA forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l. IsList l => l -> [Item l]
toList
mapM :: forall (m :: * -> *) full' item'.
(Applicative m, ListLike full' item') =>
(a -> m item') -> Vector a -> m full'
mapM a -> m item'
func = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall l. IsList l => [Item l] -> l
fromList forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
P.traverse a -> m item'
func forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l. IsList l => l -> [Item l]
toList
instance IsString (V.Vector Char) where
fromString :: String -> Vector Char
fromString = forall l. IsList l => [Item l] -> l
fromList
instance StringLike (V.Vector Char) where
toString :: Vector Char -> String
toString = forall l. IsList l => l -> [Item l]
toList
unwords :: forall full. ListLike full (Vector Char) => full -> Vector Char
unwords = let sp :: Vector Char
sp = forall a. a -> Vector a
V.singleton Char
' ' in forall a. [Vector a] -> Vector a
V.concat forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall full item. ListLike full item => item -> full -> full
intersperse Vector Char
sp forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l. IsList l => l -> [Item l]
toList
unlines :: forall full. ListLike full (Vector Char) => full -> Vector Char
unlines = let eol :: Vector Char
eol = forall a. a -> Vector a
V.singleton Char
'\n' in forall a. [Vector a] -> Vector a
V.concat forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall full item. ListLike full item => item -> full -> full
intersperse Vector Char
eol forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l. IsList l => l -> [Item l]
toList
isPrefixOf' :: Eq a => V.Vector a -> V.Vector a -> Bool
isPrefixOf' :: forall a. Eq a => Vector a -> Vector a -> Bool
isPrefixOf' Vector a
needle Vector a
haystack
| forall a. Vector a -> Bool
V.null Vector a
needle = Bool
True
| forall a. Vector a -> Int
V.length Vector a
needle forall a. Ord a => a -> a -> Bool
< forall a. Vector a -> Int
V.length Vector a
haystack =
Vector a
needle forall a. Eq a => a -> a -> Bool
== forall a. Int -> Int -> Vector a -> Vector a
V.slice Int
0 (forall a. Vector a -> Int
V.length Vector a
needle) Vector a
haystack
| forall a. Vector a -> Int
V.length Vector a
needle forall a. Eq a => a -> a -> Bool
== forall a. Vector a -> Int
V.length Vector a
haystack = Vector a
needle forall a. Eq a => a -> a -> Bool
== Vector a
haystack
| Bool
otherwise = Bool
False
isSuffixOf' :: Eq a => V.Vector a -> V.Vector a -> Bool
isSuffixOf' :: forall a. Eq a => Vector a -> Vector a -> Bool
isSuffixOf' Vector a
needle Vector a
haystack
| forall a. Vector a -> Bool
V.null Vector a
needle = Bool
True
| forall a. Vector a -> Int
V.length Vector a
needle forall a. Ord a => a -> a -> Bool
< forall a. Vector a -> Int
V.length Vector a
haystack =
Vector a
needle forall a. Eq a => a -> a -> Bool
== forall a. Int -> Int -> Vector a -> Vector a
V.slice (forall a. Vector a -> Int
V.length Vector a
haystack forall a. Num a => a -> a -> a
- forall a. Vector a -> Int
V.length Vector a
needle)
(forall a. Vector a -> Int
V.length Vector a
needle)
Vector a
haystack
| forall a. Vector a -> Int
V.length Vector a
needle forall a. Eq a => a -> a -> Bool
== forall a. Vector a -> Int
V.length Vector a
haystack = Vector a
needle forall a. Eq a => a -> a -> Bool
== Vector a
haystack
| Bool
otherwise = Bool
False