maurice/snix
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

* Main the `substitutes-rev' table again, but now in a way that

Browse source 
doesn't take \Theta(n^2) space/time complexity.
This commit is contained in:
Eelco Dolstra 2004-08-31 16:13:10 +00:00
parent c25f2883b1
commit 5c443b6550
3 changed files with 40 additions and 21 deletions
Download patch file Download diff file Expand all files Collapse all files

5
src/libstore/store.hh
View file

@ -66,8 +66,9 @@ bool querySuccessor(const Path & srcPath, Path & sucPath);
Paths queryPredecessors(const Path & sucPath);
/* Register a substitute. */
void registerSubstitute(const Transaction & txn,
const Path & srcPath, const Substitute & sub);
typedef list<pair<Path, Substitute> > SubstitutePairs;
void registerSubstitutes(const Transaction & txn,
const SubstitutePairs & subPairs);
/* Return the substitutes expression for the given path. */
Substitutes querySubstitutes(const Path & srcPath);