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, needs approval). 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 2.0.2 is there; its commit 5b1eeb1740aa is from 2021-05-12 17:19 UTC, before the version was published (2021-05-12 17:20 UTC); elm.json differs from 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/y0hy0h/ordered-containers/zipball/2.0.2/
OrderedDict and OrderedSet that remember the order of insertion.
The default implementations, Dict and Set, do not keep track of their item's ordering. OrderedDict or OrderedSet, by contrast, will respect the insertion order when converting them to a List or iterating over their items (using foldlOrderedDict.foldl, foldrOrderedDict.foldr, or partitionOrderedDict.partition).
import OrderedSet
import Set
-- Remembers insertion order
OrderedSet.empty
|> OrderedSet.insert 2
|> OrderedSet.insert 1
|> OrderedSet.insert 3
|> OrderedSet.toList
--> [ 2, 1, 3 ]
-- Orders by keys
Set.empty
|> Set.insert 2
|> Set.insert 1
|> Set.insert 3
|> Set.toList
--> [ 1, 2, 3 ]import Dict
import OrderedDict
-- Remembers insertion order
OrderedDict.empty
|> OrderedDict.insert 3 "first"
|> OrderedDict.insert 1 "second"
|> OrderedDict.insert 2 "third"
|> OrderedDict.toList
--> [ ( 3, "first" ), ( 1, "second" ), ( 2, "third" ) ]
-- Orders by keys
Dict.empty
|> Dict.insert 3 "first"
|> Dict.insert 1 "second"
|> Dict.insert 2 "third"
|> Dict.toList
--> [ ( 1, "second" ), ( 2, "third" ), ( 3, "first") ]Dict and SetThe API purposely includes all functions from the regular Dict and Set with the exception for the "Combine" functions (e.g., unionDict.union, diffDict.diff, etc.). Those are left out, because combining ordered collections does not have a single obvious solution. You can always write custom combination functions for your use case!
In addition to the regular API there is a method for efficiently converting back to a regular collection, namely OrderedDict.toDict and OrderedSet.toSet.
The OrderedDict, in addition to a plain Dict, keeps a List of all the keys in the order they are inserted.
This means that we sacrifice some space, but get the performance of Dict for its "Query" operations, while only introducing minor overhead to the rest.
As an alternative, pzp1997/assoc-list stores only a list while providing a Dict-like interface.
Originally, this package was based on rnon's ordered-containers and updated for Elm 0.19. Later, it was merged with wittjosiah's elm-ordered-dict and rewritten to handle re-insertion in a clearly documented way.
This project is passively maintened. I intend to respond to issues and pull requests, but am not dedicating time to develop new features.