Hi Larry, sets (and mappings, ie dicts), have a common functionality among
many languages and libraries that does Not include an ordering. Already, in
CPython, there is a need to somehow indicate that insertion ordering is
being used in dicts or use OrderedDict. I am quite happy with keeping sets
a
On 12/28/19 6:24 PM, Tim Peters wrote:
[Larry]
Here is the original description of my problem, from the original email in
this thread. I considered this an adequate explanation of my problem
at the time.
I do have a use case for this. In one project I maintain a "ready" list of
jobs; I need t
[Larry]
> It's a lightweight abstract dependency graph. Its nodes are opaque,
> only required to be hashable. And it doesn't require that you give it
> all the nodes in strict dependency order.
>
> When you add a node, you can also optionally specify
> dependencies, and those dependencies aren't
Due to version and platform constraints, a SAT solver is necessary for
conda and (now) pip. Libsolv is one of the fastest around.
https://github.com/QuantStack/mamba is conda implemented with libsolv (and
parallel downloading of *declarative* dependency metadata).
For general purpose graphs with
