object Graph
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Graph
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
class
TopoSorted extends AnyRef
The
values
Agg is guaranteed to be topological sorted and cycle free.The
values
Agg is guaranteed to be topological sorted and cycle free. That's why the constructor is package private.- See also
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupAroundImportantTargets[T](topoSortedTargets: TopoSorted)(important: PartialFunction[Task[_], T]): MultiBiMap[T, Task[_]]
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
topoSorted(transitiveTargets: api.Strict.Agg[Task[_]]): TopoSorted
Takes the given targets, finds all the targets they transitively depend on, and sort them topologically.
Takes the given targets, finds all the targets they transitively depend on, and sort them topologically. Fails if there are dependency cycles
-
def
transitiveTargets(sourceTargets: api.Strict.Agg[Task[_]]): api.Strict.Agg[Task[_]]
Collects all transitive dependencies (targets) of the given targets, including the given targets.
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )