forked from lix-project/lix
8463f27d8c
mapping. The referer table is replaced by a referrer table (note
spelling fix) that stores each referrer separately. That is,
instead of having
referer[P] = {Q_1, Q_2, Q_3, ...}
we store
referer[(P, Q_1)] = ""
referer[(P, Q_2)] = ""
referer[(P, Q_3)] = ""
...
To find the referrers of P, we enumerate over the keys with a value
lexicographically greater than P. This requires the referrer table
to be stored as a B-Tree rather than a hash table.
(The tuples (P, Q) are stored as P + null-byte + Q.)
Old Nix databases are upgraded automatically to the new schema.
|
||
|---|---|---|
| .. | ||
| bin2c | ||
| boost | ||
| bsdiff-4.2 | ||
| libexpr | ||
| libmain | ||
| libstore | ||
| libutil | ||
| nix-env | ||
| nix-hash | ||
| nix-instantiate | ||
| nix-log2xml | ||
| nix-store | ||
| aterm-helper.pl | ||
| Makefile.am | ||