Search results

snoc :: forall a. Array a -> a -> Array a

Append an element to the end of an array, creating a new array.

snoc [1, 2, 3] 4 = [1, 2, 3, 4]

genericWriteForeignUntaggedProductRep :: forall rep. WriteGenericUntaggedProduct rep => Array Foreign -> rep -> Array Foreign

_serialize :: forall a. ABIData a => Array EncodedValue -> a -> Array EncodedValue

clampToWindow :: Array IndexedTuple -> Int -> Array IndexedTuple

getTransactionsForWeekDay :: Array TransactionRec -> Weekday -> Array TransactionRec

transactionsForMerchant :: (Array TransactionRec) -> String -> Array TransactionRec

difference :: forall a. Eq a => Array a -> Array a -> Array a

Delete the first occurrence of each element in the second array from the first array, creating a new array.

difference [2, 1] [2, 3] = [1]

Running time: O(n*m), where n is the length of the first array, and m is the length of the second.

intersect :: forall a. Eq a => Array a -> Array a -> Array a

Calculate the intersection of two arrays, creating a new array. Note that duplicates in the first array are preserved while duplicates in the second array are removed.

intersect [1, 1, 2] [2, 2, 1] = [1, 1, 2]

union :: forall a. Eq a => Array a -> Array a -> Array a

Calculate the union of two arrays. Note that duplicates in the first array are preserved while duplicates in the second array are removed.

Running time: O(n^2)

union [1, 2, 1, 1] [3, 3, 3, 4] = [1, 2, 1, 1, 3, 4]

concat' :: forall buf m. MutableBuffer buf m => Array buf -> Int -> m buf

Concatenates a list of buffers, combining them into a new buffer of the specified length.

difference :: forall a. Eq a => Array a -> Array a -> Array a

Like difference in Data.Array but removes all of the elements from the first array which have a match in the second array.

difference [2, 1, 2] [2, 3] == [1,2] -- Data.Array
difference [2, 1, 2] [2, 3] == [1]   -- Data.Array.Extra.All

difference :: forall a. Eq a => Array a -> Array a -> Array a

Re-export of difference from Data.Array

difference [2, 1] [2, 3] = [1]

unsafeConsArray :: forall a. Array a -> Array a -> Array a

unsafeSnocArray :: forall a. Array a -> Array a -> Array a

_idiomArray :: Array String -> Array String -> Array String

_orderToWordArray :: Array String -> Array String -> Array String

anyOf :: forall v me. MonadEffect me => IndexedValue v => Array v -> WhereClause -> me Collection

Documentation: dexie.org/docs/WhereClause/WhereClause.anyOf()

idiomArray :: Array String -> Array IdiomOptions -> Array String

Use this over the underscore version

merge :: Array Int -> Array Int -> Array Int

noneOf :: forall v me. MonadEffect me => IndexedValue v => Array v -> WhereClause -> me Collection

Documentation: dexie.org/docs/WhereClause/WhereClause.noneOf()

orderToWordArray :: Array String -> Array OrderOptions -> Array String

Use this over the underscore version

selector'' :: Array Predicate -> Path Selector -> Array String

play :: Array Int -> Array Int -> Array Cycle

Deduces the disjoint cycles between a base and one of its permutations

supportedLocalesOf :: forall provided. ConvertOptionsWithDefaults ToCollatorOptions (Record CollatorOptions) (Record provided) (Record CollatorOptions) => Array Locale -> Record provided -> Array String

supportedLocalesOf :: forall provided. ConvertOptionsWithDefaults ToDateTimeFormatOptions (Record DateTimeFormatOptions) (Record provided) (Record DateTimeFormatOptions) => Array Locale -> Record provided -> Array String

supportedLocalesOf :: forall provided. Defaults (Record DisplayNamesOptions'Optional) (Record provided) (Record DisplayNamesOptions) => Array Locale -> Record provided -> Array String

supportedLocalesOf :: forall provided. ConvertOptionsWithDefaults ToDurationFormatOptions (Record DurationFormatOptions) (Record provided) (Record DurationFormatOptions) => Array Locale -> Record provided -> Array String

supportedLocalesOf :: forall provided. ConvertOptionsWithDefaults ToListFormatOptions (Record ListFormatOptions) (Record provided) (Record ListFormatOptions) => Array Locale -> Record provided -> Array String

supportedLocalesOf :: forall provided. ConvertOptionsWithDefaults ToNumberFormatOptions (Record NumberFormatOptions) (Record provided) (Record NumberFormatOptions) => Array Locale -> Record provided -> Array String

supportedLocalesOf :: forall provided. ConvertOptionsWithDefaults ToPluralRulesOptions (Record PluralRulesOptions) (Record provided) (Record PluralRulesOptions) => Array Locale -> Record provided -> Array String

supportedLocalesOf :: forall provided. ConvertOptionsWithDefaults ToRelativeTimeFormatOptions (Record RelativeTimeFormatOptions) (Record provided) (Record RelativeTimeFormatOptions) => Array Locale -> Record provided -> Array String

supportedLocalesOf :: forall provided. ConvertOptionsWithDefaults ToSegmenterOptions (Record SegmenterOptions) (Record provided) (Record SegmenterOptions) => Array Locale -> Record provided -> Array String

anyOfIgnoreCase :: forall me. MonadEffect me => Array String -> WhereClause -> me Collection

Documentation: dexie.org/docs/WhereClause/WhereClause.anyOfIgnoreCase()

getPricingForWeekdays :: Array Weekday -> Array TransactionRec -> Array Number

startsWithAnyOf :: forall me. MonadEffect me => Array String -> WhereClause -> me Collection

Documentation: dexie.org/docs/WhereClause/WhereClause.startsWithAnyOf()

startsWithAnyOfIgnoreCase :: forall me. MonadEffect me => Array String -> WhereClause -> me Collection

Documentation: dexie.org/docs/WhereClause/WhereClause.startsWithAnyOfIgnoreCase()

arr :: forall repr a. DataDSL repr => Array a -> repr (Array a)

Array literal

flipScalarMul :: forall k f. VectorField f k => f k -> k -> f k

downTo :: forall a. HasFromInt a => HasLess a => HasToInt a => a -> a -> Array a

Creates an array that ranges from the given upper bound down to the lower bound.

3 :downTo 1 -- [3, 2, 1]
1 :downTo 1 -- [1]
1 :downTo 3 -- []

range :: forall a. Range a => a -> a -> Array a

scalarDiv :: forall f a. Functor f => EuclideanRing a => f a -> a -> f a

Right scalar division

V2 6.0 9.0 ^/ 3.0 = V2 2.0 3.0

scalarR :: forall f a. Functor f => Semiring a => f a -> a -> f a

Right scalar multiplication

V2 1.0 2.0 ^* 3.0 = V2 3.0 6.0

snoc :: forall f a. Container f => f a -> a -> f a

upTo :: forall a. HasFromInt a => HasGreater a => HasToInt a => a -> a -> Array a

Creates an array that ranges from the given lower bound down to the upper bound.

1 :upTo 3 -- [1, 2, 3]
1 :upTo 1 -- [1]
3 :upTo 1 -- []

voidLeft :: forall f a b. Functor f => f a -> b -> f b

A version of voidRight with its arguments flipped.

functorDecorateFlipped :: forall b a f. Functor f => Decorate b a => f a -> b -> f b

unsafeIndex :: forall a. Partial => Array a -> Int -> a

Find the element of an array at the specified index.

unsafePartial $ unsafeIndex ["a", "b", "c"] 1 = "b"

Using unsafeIndex with an out-of-range index will not immediately raise a runtime error. Instead, the result will be undefined. Most attempts to subsequently use the result will cause a runtime error, of course, but this is not guaranteed, and is dependent on the backend; some programs will continue to run as if nothing is wrong. For example, in the JavaScript backend, the expression unsafePartial (unsafeIndex [true] 1) has type Boolean; since this expression evaluates to undefined, attempting to use it in an if statement will cause the else branch to be taken.

shouldContain :: forall m f a. MonadThrow Error m => Show a => Eq a => Show (f a) => Foldable f => f a -> a -> m Unit

shouldNotContain :: forall m f a. MonadThrow Error m => Show a => Eq a => Show (f a) => Foldable f => f a -> a -> m Unit

shouldNotReturn :: forall m t. MonadThrow Error m => Eq t => Show t => m t -> t -> m Unit

Asserts that m t does not return t