Renamed to j-maas/ordered-containers. That is where the repository lives now. It has not been published as a package under the new name.
Versions published as y0hy0h/ordered-containers still install under that name. 5 versions of 5 come from the new location (see their notes).
Rerouted (renamed, verified). The GitHub user or repository was renamed. The tag is still there, at the new name. The Lamdera package server serves a copy recovered from https://github.com/j-maas/ordered-containers.
What we checked: The repo moved to github.com/j-maas/ordered-containers and tag 1.0.0 is there; its commit b079cbc2a79a is from 2018-08-28 21:06 UTC, before the version was published (2018-08-28 21:07 UTC); every file Elm uses matches a copy in a Lamdera package cache from 2021-02-13, from before the change; 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 (GitHub's zip no longer comes out byte for byte the same), so the contents were checked instead.
The Lamdera compiler uses this copy and prints a one-line notice saying so. elm itself fails to download this version.
Details · package.elm-lang.org's zip: https://github.com/y0hy0h/ordered-containers/zipball/1.0.0/
A dictionary type that when iterated or converted to a list, the order of entries will be the same as the order they were inserted.
As it uses Dict under the hood, the keys can only be comparable types, which
include Int, Float, Time, Char, String, and tuples or lists of
comparable types.
Create an empty dictionary.
Create a dictionary with one key-value pair.
Insert a key-value pair into a dictionary. Replace the value if the key already exists.
Update the value of a specific key with an updater function.
Since the key may not exist before or after the update, the updater function
takes a Maybe v and returns a Maybe v.
Remove a key-value pair from a dictionary. If the key doesn't exist, no changes are made.
Check if a dictionary is empty.
Check if a key is in a dictionary.
Get the value associated with a key. Return Nothing if the key is not found.
Get the number of key-value pairs in the dictionary.
Get all of the keys in a dictionary, in insertion order.
Get all of the values in a dictionary, in insertion order.
Convert a dictionary into an association list of key-value pairs, in insertion order.
Convert an association list into a dictionary.
Apply a function to all values in a dictionary.
Fold the key-value pairs in a dictionary, in insertion order.
Fold the key-value pairs in a dictionary, in reverse insertion order.
Return a new OrderedDict that only contains entries that satisfy a predicate.
Split a OrderedDict to a tuple of OrderedDict. The first contains all
entries that satisfy the predicate, and the second contains the rest.
Combine two dictionaries. If there is a collision, preference is given to the first dictionary.
union (singleton "x" 1) (singleton "x" 2) == singleton "x" 1Keep a key-value pair when its key appears in the second dictionary. Preference is given to values in the first dictionary.
Keep a key-value pair when its key does not appear in the second dictionary.
A type of
Dictthat is iterated by the order of insertion.