Changes between Version 7 and Version 8 of DependencyAnalysis
- Timestamp:
- 08/13/07 18:13:03 (6 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
DependencyAnalysis
v7 v8 89 89 ---- 90 90 91 So, after trying to code this, I finding the rule chain has a runtime worst case O(numRules^2 ) unless you cache the results as a dependency graph. I guess you were right then, Duncan :)91 So, after trying to code this, I finding the rule chain has a runtime worst case O(numRules^2^) unless you cache the results as a dependency graph. I guess you were right then, Duncan :) 92 92 93 93 So, anyhow, I think I'm going to thread the depgraph in a monad. I figure … … 97 97 should suffice, and 98 98 99 newtype DepGraphT a = StateT DepGraphT IO a99 type DepGraphT a = StateT DepGraphT IO a 100 100 101 101 will do the trick.
