Rerouted (retagged, needs approval). The tag now points at a different commit than when this version was published. The Lamdera package server serves a copy recovered from https://github.com/lue-bird/elm-typesafe-array.
What we checked: Tag 7.1.0 is still on github.com/lue-bird/elm-typesafe-array; its commit c17a96304817 is from 2021-05-03 17:31 UTC, after the version was published (2021-05-03 17:29 UTC); elm.json is byte-identical to package.elm-lang.org's; the exposed modules match docs.json; the zip's SHA-1 is not the published one and nothing else confirms its contents.
We could not verify this copy against what was published, so the Lamdera compiler asks before using it (y/n). Without a terminal, as in CI, it stops with an error unless approved:
lamdera make --auto-approve-package-rerouting approves rerouted versions for that run,LAMDERA_AUTO_APPROVE_PACKAGE_REROUTING=1 does the same for every run in that environment,LAMDERA_CACHE=off skips the Lamdera package server altogether: packages come from package.elm-lang.org and GitHub only, as with elm, and a rerouted version then fails to download.Details · package.elm-lang.org's zip: https://github.com/lue-bird/elm-typesafe-array/zipball/7.1.0/
An Arr describes an array where you know more about the amount of elements.
Array.empty |> Array.get 0
--> Nothing
Arr.empty |> Arr.at nat0 FirstToLast
--> compile time errorIs this any useful? Let's look at an example:
0 to 100 joined by a space
joinBy between =
\before after -> before ++ between ++ after
let
intStringsAfter =
Array.fromList (List.range 1 100)
String.fromInt
in
Array.foldl (joinBy " ") "0" intStringsAfter
--> "0 1 2 3 4 5 ..."
Arr.nats nat100
|> Arr.map (val >> String.fromInt)
|> Arr.foldWith FirstToLast (joinBy " ")
--> "0 1 2 3 4 5 ..."The Array version just seems hacky and is less readable. Arr simply knows more about the length at compile time, so you can e.g. call foldWith without a worry.
Create an Arr from an Array. As every Array has >= 0 elements:
Arr.fromArray arrayFromSomewhere
--> : Arr (Min Nat0)
Arr.fromArray
(Array.fromList [ 0, 1, 2, 3, 4, 5, 6 ])
--> big no
Arr.from7 0 1 2 3 4 5 6
--> ok
Arr.nats nat7
--> big yesTell the compiler if you know the amount of elements. Make sure the it knows as much as you!
An Arr with a given amount of same elements.
Arr.repeat nat4 'L'
--> Arr.from4 'L' 'L' 'L' 'L'
--> : Arr (In Nat4 (Nat4Plus a)) Char
Arr.repeat atLeast3 'L'
--> : Arr (Min Nat3) CharIncreasing natural numbers. In the end, there are length numbers.
Arr.nats nat10
--> : Arr
--> (N Nat10 ...)
--> (Nat (In Nat0 (Nat9Plus a)))
from first length_ =
Arr.nats length_
|> Arr.map (InNat.add first)Generate a given amount of elements and put them in an Arr.
No elements.
Arr.empty
--> : Arr (In Nat0 atLeast0) element
|> NArr.push ":)"
--> : Arr (In Nat1 (Nat1Plus atLeast0)) StringCreate an Arr from exactly 1 elements in this order.
Create an Arr from exactly 2 elements in this order.
Create an Arr from exactly 3 elements in this order.
Create an Arr from exactly 4 elements in this order.
Create an Arr from exactly 5 elements in this order.
Create an Arr from exactly 6 elements in this order.
Create an Arr from exactly 7 elements in this order.
Create an Arr from exactly 8 elements in this order.
Create an Arr from exactly 9 elements in this order.
Create an Arr from exactly 10 elements in this order.
Create an Arr from exactly 11 elements in this order.
Create an Arr from exactly 12 elements in this order.
Create an Arr from exactly 13 elements in this order.
Create an Arr from exactly 14 elements in this order.
Create an Arr from exactly 15 elements in this order.
Create an Arr from exactly 16 elements in this order.
The amount of elements.
Element at a valid position.
Arr.from4 1 2 3 4
|> Arr.at nat1 FirstToLast
--> 2
Arr.from4 1 2 3 4
|> Arr.at nat1 LastToFirst
--> 3This works for both
Arr.from8 0 1 2 3 4 5 6 7
|> Arr.take nat3 nat3 LastToFirst
--> Arr.from3 5 6 7
Arr.from8 0 1 2 3 4 5 6 7
|> Arr.take between3To7 nat7 FirstToLast
--> : Arr (In Nat3 Nat7) ...Split the Arr into equal-sized chunks.
{ groups : the Arr divided into equal-sized Arrs
, less : values to one side which aren't enough
}
Arr.from7 1 2 3 4 5 6 7
|> MinArr.groupsOf nat5 FirstToLast
--> { groups = Arr.from1 (Arr.from5 1 2 3 4 5)
--> , less = Arr.from2 6 7
--> }The type of the result isn't as accurate as in the example, though!
Change every element.
aToZ =
Arr.nats nat26
|> Arr.map
(val >> fromPositionInABC)
fromPositionInABC =
(+) ('a' |> Char.toCode)
>> Char.fromCodeval refers to Typed.val.
Reduce an Arr in a direction.
Arr.from5 "l" "i" "v" "e"
|> Arr.fold FirstToLast (++) ""
--> "live"
Arr.from5 "l" "i" "v" "e"
|> Arr.fold LastToFirst (++) ""
--> "evil"Convert the Arr to an Array.
Just do this in the end.
Try to keep extra information as long as you can.
Arr.nats nat5
|> Arr.map val
|> Arr.toArray
--> Array.fromList [ 0, 1, 2, 3, 4 ]A fold where the initial result is the first value.
Arr.foldWith FirstToLast maximum
(Arr.from3 234 345 543)
--> 543Flip the order of the elements.
Arr.from5 "l" "i" "v" "e"
|> Arr.reverse
--> Arr.from5 "e" "v" "i" "l"Resize an Arr in a direction, padding with a given value.
Arr.resize LastToFirst nat4 0
(Arr.from2 1 2)
--> Array.from4 0 0 1 2
Arr.resize LastToFirst nat2 0
(Array.from3 1 2 3)
--> Array.from2 2 3
Arr.resize FirstToLast nat4 0
(Array.from2 1 2)
--> Array.from4 1 2 0 0
Arr.resize FirstToLast nat2 0
(Array.from3 1 2 3)
--> Array.from2 1 2This is a quick way to gain some type-level knowledge about the length.
Combine the elements of 2 Arrs to a new element.
If one list is longer, the extra elements are dropped.
teamLifes aBoard bBoard =
Arr.map2 (\a b -> a.lifes + b.lifes)
aBoard
bBoardThe length pf all Arrs must be in the same range.
Arr is a potential Arr (Min ...), you have toArr.map2 (\a b -> a.lifes + b.lifes)
(aBoard |> MinArr.value)
(bBoard |> MinArr.value)
aBoard, bBoard : Arr (In Nat2 someMax) Fieldfor every non-Arr (Min ...).
Arr has a higher minimum length, you have toArr.map2 (\a b -> a.lifes + b.lifes)
(aBoard |> Arr.lowerMinLength nat2)
bBoard
aBoard : Arr (In Nat5 Nat10) FieldWorks like map2.
Works like map2.
Set the element at an index in a direction.
Arr.from3 "I" "am" "ok"
|> Arr.replaceAt nat2 FirstToLast "confusion"
--> Arr.from3 "I" "am" "confusion"
Arr.from3 "I" "am" "ok"
|> Arr.replaceAt nat1 LastToFirst "feel"
--> Arr.from3 "I" "feel" "ok"Use a lower minimum length in the type.
[ atLeast3Elements
, atLeast4Elements
]Elm complains:
But all the previous elements in the list are
Arr (Min Nat3) ...
[ atLeast3Elements
, atLeast4Elements
|> Arr.lowerMinLength nat3
]Make an Arr with a fixed maximum length fit into functions with require a higher maximum length.
While designing argument annotations as general as possible:
atMost18Elements : Arr (In min Nat18) ...The argument in atMost18Elements should also fit in atMost19Elements.
atMost19Elements theArgument
--> error :(
atMost19Elements
(theArgument |> Arr.restoreMaxLength nat18)
--> worksA Codec to serialize Arrs with a specific amount of elements.
import Serialize
-- we can't start if we have no worlds to choose from!
serializeGameRow :
Serialize.Codec
String
(Arr (Only Nat10) GameField)
serializeGameRow =
Arr.serialize nat10 serializeGameField
encode : Arr (Only Nat10) GameField -> Bytes
encode =
Serialize.encodeToBytes serializeGameRow
decode :
Bytes
->
Result
(Serialize.Error String)
(Arr (Only Nat10) GameField)
decode =
Serialize.decodeFromBytes serializeGameRow
An
Arrdescribes an array where you know more about the amount of elements.types
as argument types