Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  val blackboxReference: Array[Byte]
6.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @native() @throws( ... )

7.  def containsMacroDefinition(classpath: Seq[File]): Task[Seq[(File, Boolean)]]
8.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9.  def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

12.  def hash(classpath: Array[AbsolutePath], parallelUnits: Int, scheduler: Scheduler, logger: Logger, tracer: BraveTracer): Task[Seq[FileHash]]

    Hash the classpath in parallel with Monix's task.

    Hash the classpath in parallel with Monix's task.

    The hashing works in two steps: first, we try to acquire the hash of a given entry. This "negotiation" step is required because we may be hashing other project's classpath concurrently and we want to minimize stalling and make as much progress as we can hashing. Those entries whose hashing couldn't be "acquired" are left to the second step, which blocks until the ongoing hashing finishes.

    This approach allows us to control how many concurrent tasks we spawn to new threads (and, therefore, how many threads we create in the io pool) and, at the same time, allows us to do as much progress without blocking.

    classpath

    The list of files to be hashed (if they exist).

    parallelUnits

    The amount of parallel hashing we can do.

    tracer

    A tracer to keep track of timings in Zipkin.

    returns

    A task returning a list of hashes.

13.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

14.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

15.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

16.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

17.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

18.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

19.  def toString(): String

    Definition Classes

    AnyRef → Any

20.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

21.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

22.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )

23.  val whiteboxReference: Array[Byte]