| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
| |
definition, target discovery, and target evaluation
|
|
|
|
| |
cycles exist
|
|
|
|
|
|
| |
caches `def`s (and complains about `val`s) if it's defined top-level in a class/trait/object, for easy overriding.
If it's in some helper function somewhere, overriding doesn't matter, and it's up to the user to figure out how to construct a target graph without redundancy
|
| |
|
|
|
|
| |
- Switch to using just `sourcecode.Enclosing` to key the `cacherLazyMap`, since the caller is already present as the `this` owning the `cacherLazyMap` and does not need to be stored
|
|
|
|
| |
to turn `def foo = T{}` into pseudo-`lazy val`s, that we can override in subclasses using stackable traits
|
|
the `T#apply` macro in the implementation of `scalaplugin.Subproject`
Also needed to implement inter-`Subproject` dependencies so the `MetacircularTests` can continue to support the new layout
|