| Age | Commit message (Collapse) | Author |
|---|
|
We represent entries in the graph with integers instead of levels and
add a table remembering the corresponding association in the graph.
|
|
We expose the representation function in UGraph and change the printer
signature to work over the representation instead of the abstract type.
Similarly, the topological sorting algorithm is moved to Vernacentries.
It is now even simpler.
|
|
Instead we export a representation function that gives a high-level view
of the data structure in terms of constraints.
|
|
We try to avoid reallocating the map in two different ways.
- We only add a value when actually needed.
- We compute the union of maps with the first element as a starting point.
|
|
A set was created only to be folded over. Since the list is ensured to
be duplicate-free, there is no point in creating the former, we just
fold over the list directly.
|
|
Add headers to a few files which were missing them.
|
|
|
|
Not sure how often this happens in practice but it seems it could.
|
|
This means removing [univ], [level] and derived abbreviations like
[lvl].
We keep using u, v for variable names as doing otherwise would be too
intrusive, and it's not overly universe specific.
|
|
This should give better visibility of universe specific operations vs
generic graph operations.
|
