mirror of https://github.com/sbt/sbt.git
36 lines
918 B
Scala
36 lines
918 B
Scala
/* sbt -- Simple Build Tool
|
|
* Copyright 2010 Mark Harrah
|
|
*/
|
|
package sbt
|
|
|
|
import Node._
|
|
import Types._
|
|
|
|
trait Node[A[_], T]
|
|
{
|
|
type Inputs <: MList[A]
|
|
type Results = Inputs#Map[Result]
|
|
|
|
val inputs: Inputs
|
|
def unitDependencies: Iterable[A[_]]
|
|
|
|
def work(results: Results, units: UnitResults[A]): Either[A[T], T]
|
|
}
|
|
|
|
object Node
|
|
{
|
|
/*def pure[T](f: () => T): PureNode[T]= map[Id, T, MNil](MNil, Nil)((_,_) => f() )
|
|
|
|
def map[A[_], T, Inputs0 <: MList[A]](inputs0: Inputs0, deps0: Iterable[A[_]])(work0: (Inputs0#Map[Result], UnitResults[A]) => T):
|
|
Node[A,T] { type Inputs = Inputs0 } =
|
|
new Node[A,T] {
|
|
type Inputs = Inputs0
|
|
val inputs = inputs0
|
|
def unitDependencies = deps0
|
|
def work(results: Results, units: UnitResults[A]) = Right(work0(results, units))
|
|
}
|
|
|
|
type PureNode[T] = Node[Id, T] { type Inputs = MNil; type Results = MNil }*/
|
|
type UnitResults[A[_]] = Iterable[(A[_], Incomplete)]
|
|
}
|