Module
Data.ArrayView.NonEmpty
- Package
- purescript-array-views
- Repository
- klntsky/purescript-array-views
#fromArrayView Source
fromArrayView :: forall a. ArrayView a -> Maybe (NonEmptyArrayView a)
O(1)
#fromNonEmpty Source
fromNonEmpty :: forall a. NonEmpty ArrayView a -> NonEmptyArrayView a
#toNonEmpty Source
toNonEmpty :: forall a. NonEmptyArrayView a -> NonEmpty ArrayView a
#fromFoldable Source
fromFoldable :: forall a f. Foldable f => f a -> Maybe (NonEmptyArrayView a)
#fromFoldable1 Source
fromFoldable1 :: forall a f. Foldable1 f => f a -> NonEmptyArrayView a
#toUnfoldable Source
toUnfoldable :: forall a f. Unfoldable f => NonEmptyArrayView a -> f a
#toUnfoldable1 Source
toUnfoldable1 :: forall a f. Unfoldable1 f => NonEmptyArrayView a -> f a
#singleton Source
singleton :: forall a. a -> NonEmptyArrayView a
#replicate Source
replicate :: forall a. Int -> a -> NonEmptyArrayView a
#some Source
some :: forall a f. Alternative f => Lazy (f (Array a)) => f a -> f (NonEmptyArrayView a)
#length Source
length :: forall a. NonEmptyArrayView a -> Int
#cons Source
cons :: forall a. a -> NonEmptyArrayView a -> NonEmptyArrayView a
#cons' Source
cons' :: forall a. a -> ArrayView a -> NonEmptyArrayView a
#snoc Source
snoc :: forall a. NonEmptyArrayView a -> a -> NonEmptyArrayView a
#snoc' Source
snoc' :: forall a. ArrayView a -> a -> NonEmptyArrayView a
#appendArrayView Source
appendArrayView :: forall a. NonEmptyArrayView a -> ArrayView a -> NonEmptyArrayView a
#insert Source
insert :: forall a. Ord a => a -> NonEmptyArrayView a -> NonEmptyArrayView a
#insertBy Source
insertBy :: forall a. (a -> a -> Ordering) -> a -> NonEmptyArrayView a -> NonEmptyArrayView a
#head Source
head :: forall a. NonEmptyArrayView a -> a
#last Source
last :: forall a. NonEmptyArrayView a -> a
#tail Source
tail :: forall a. NonEmptyArrayView a -> ArrayView a
#init Source
init :: forall a. NonEmptyArrayView a -> ArrayView a
#uncons Source
uncons :: forall a. NonEmptyArrayView a -> { head :: a, tail :: ArrayView a }
#unsnoc Source
unsnoc :: forall a. NonEmptyArrayView a -> { init :: ArrayView a, last :: a }
#elemLastIndex Source
elemLastIndex :: forall a. Eq a => a -> NonEmptyArrayView a -> Maybe Int
#findLastIndex Source
findLastIndex :: forall a. (a -> Boolean) -> NonEmptyArrayView a -> Maybe Int
#insertAt Source
insertAt :: forall a. Int -> a -> NonEmptyArrayView a -> Maybe (NonEmptyArrayView a)
#updateAt Source
updateAt :: forall a. Int -> a -> NonEmptyArrayView a -> Maybe (NonEmptyArrayView a)
#updateAtIndices Source
updateAtIndices :: forall a t. Foldable t => t (Tuple Int a) -> NonEmptyArrayView a -> NonEmptyArrayView a
#modifyAt Source
modifyAt :: forall a. Int -> (a -> a) -> NonEmptyArrayView a -> Maybe (NonEmptyArrayView a)
#modifyAtIndices Source
modifyAtIndices :: forall a t. Foldable t => t Int -> (a -> a) -> NonEmptyArrayView a -> NonEmptyArrayView a
#reverse Source
reverse :: forall a. NonEmptyArrayView a -> NonEmptyArrayView a
#concat Source
concat :: forall a. NonEmptyArrayView (NonEmptyArrayView a) -> NonEmptyArrayView a
#concatMap Source
concatMap :: forall b a. (a -> NonEmptyArrayView b) -> NonEmptyArrayView a -> NonEmptyArrayView b
#partition Source
partition :: forall a. (a -> Boolean) -> NonEmptyArrayView a -> { no :: ArrayView a, yes :: ArrayView a }
#filterA Source
filterA :: forall f a. Applicative f => (a -> f Boolean) -> NonEmptyArrayView a -> f (ArrayView a)
#sort Source
sort :: forall a. Ord a => NonEmptyArrayView a -> NonEmptyArrayView a
#sortBy Source
sortBy :: forall a. (a -> a -> Ordering) -> NonEmptyArrayView a -> NonEmptyArrayView a
#sortWith Source
sortWith :: forall b a. Ord b => (a -> b) -> NonEmptyArrayView a -> NonEmptyArrayView a
#span Source
span :: forall a. (a -> Boolean) -> NonEmptyArrayView a -> { init :: ArrayView a, rest :: ArrayView a }
#nub Source
nub :: forall a. Ord a => NonEmptyArrayView a -> NonEmptyArrayView a
#nubBy Source
nubBy :: forall a. (a -> a -> Ordering) -> NonEmptyArrayView a -> NonEmptyArrayView a
#nubEq Source
nubEq :: forall a. Eq a => NonEmptyArrayView a -> NonEmptyArrayView a
#nubByEq Source
nubByEq :: forall a. (a -> a -> Boolean) -> NonEmptyArrayView a -> NonEmptyArrayView a
#union Source
union :: forall a. Eq a => NonEmptyArrayView a -> NonEmptyArrayView a -> NonEmptyArrayView a
#union' Source
union' :: forall a. Eq a => NonEmptyArrayView a -> ArrayView a -> NonEmptyArrayView a
#unionBy Source
unionBy :: forall a. (a -> a -> Boolean) -> NonEmptyArrayView a -> NonEmptyArrayView a -> NonEmptyArrayView a
#unionBy' Source
unionBy' :: forall a. (a -> a -> Boolean) -> NonEmptyArrayView a -> ArrayView a -> NonEmptyArrayView a
#deleteBy Source
deleteBy :: forall a. (a -> a -> Boolean) -> a -> NonEmptyArrayView a -> ArrayView a
#difference Source
difference :: forall a. Eq a => NonEmptyArrayView a -> NonEmptyArrayView a -> ArrayView a
#difference' Source
difference' :: forall a. Eq a => NonEmptyArrayView a -> ArrayView a -> ArrayView a
#intersect Source
intersect :: forall a. Eq a => NonEmptyArrayView a -> NonEmptyArrayView a -> ArrayView a
#intersect' Source
intersect' :: forall a. Eq a => NonEmptyArrayView a -> ArrayView a -> ArrayView a
#intersectBy Source
intersectBy :: forall a. (a -> a -> Boolean) -> NonEmptyArrayView a -> NonEmptyArrayView a -> ArrayView a
#intersectBy' Source
intersectBy' :: forall a. (a -> a -> Boolean) -> NonEmptyArrayView a -> ArrayView a -> ArrayView a
#zipWith Source
zipWith :: forall c b a. (a -> b -> c) -> NonEmptyArrayView a -> NonEmptyArrayView b -> NonEmptyArrayView c
#zipWithA Source
zipWithA :: forall c b a m. Applicative m => (a -> b -> m c) -> NonEmptyArrayView a -> NonEmptyArrayView b -> m (NonEmptyArrayView c)
#zip Source
zip :: forall b a. NonEmptyArrayView a -> NonEmptyArrayView b -> NonEmptyArrayView (Tuple a b)
#unzip Source
unzip :: forall b a. NonEmptyArrayView (Tuple a b) -> Tuple (NonEmptyArrayView a) (NonEmptyArrayView b)
#foldM Source
foldM :: forall b a m. Monad m => (a -> b -> m a) -> a -> NonEmptyArrayView b -> m a
#foldRecM Source
foldRecM :: forall b a m. MonadRec m => (a -> b -> m a) -> a -> NonEmptyArrayView b -> m a
#unsafeIndex Source
unsafeIndex :: forall a. Partial => NonEmptyArrayView a -> Int -> a
#force Source
force :: forall a. NonEmptyArrayView a -> NonEmptyArrayView a
Perform deferred slice
. This function allows the garbage collector to
free unused parts of the array referenced by given NonEmptyArrayView
.
O(n)
Re-exports from Data.ArrayView.Internal
#NonEmptyArrayView Source
newtype NonEmptyArrayView a
Instances
Newtype (NonEmptyArrayView a) _
(Show a) => Show (NonEmptyArrayView a)
(Eq a) => Eq (NonEmptyArrayView a)
Eq1 NonEmptyArrayView
(Ord a) => Ord (NonEmptyArrayView a)
Ord1 NonEmptyArrayView
Functor NonEmptyArrayView
Semigroup (NonEmptyArrayView a)
FunctorWithIndex Int NonEmptyArrayView
Apply NonEmptyArrayView
Bind NonEmptyArrayView
Applicative NonEmptyArrayView
Monad NonEmptyArrayView
Foldable NonEmptyArrayView
FoldableWithIndex Int NonEmptyArrayView
Foldable1 NonEmptyArrayView
Unfoldable1 NonEmptyArrayView
Traversable NonEmptyArrayView
TraversableWithIndex Int NonEmptyArrayView
Traversable1 NonEmptyArrayView
Alt NonEmptyArrayView
(ArrayToView a b) => ArrayToView (NonEmptyArray a) (NonEmptyArrayView b)
(ArrayToView a b) => ArrayToView (NonEmptyArrayView a) (NonEmptyArray b)
#toArrayView Source
toArrayView :: forall a. NonEmptyArrayView a -> ArrayView a