sbt.internal.util

Members list

Concise view

Type members

Classlikes

trait AList[K[F[_]]]

Arity-generic List. An abstraction over structured Tuple/List type constructor X1[f[a]].

Arity-generic List. An abstraction over structured Tuple/List type constructor X1[f[a]].

Attributes

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any
object AList

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
AList.type
abstract class AbstractRMap[K[_], V[_]] extends RMap[K, V]

Attributes

Graph
Supertypes
trait RMap[K, V]
class Object
trait Matchable
class Any
Known subtypes
class DelegatingPMap[K, V]
final case class AttributeEntry[T](key: AttributeKey[T], value: T)

A map entry where key is constrained to only be associated with a fixed value of type T.

A map entry where key is constrained to only be associated with a fixed value of type T.

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
sealed trait AttributeKey[A]

A key in an AttributeMap that constrains its associated value to be of type T. The key is uniquely defined by its label and type T, represented at runtime by manifest.

A key in an AttributeMap that constrains its associated value to be of type T. The key is uniquely defined by its label and type T, represented at runtime by manifest.

Attributes

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type

An immutable map where a key is the tuple (String,T) for a fixed type T and can only be associated with values of type T. It is therefore possible for this map to contain mappings for keys with the same label but different types. Excluding this possibility is the responsibility of the client if desired.

An immutable map where a key is the tuple (String,T) for a fixed type T and can only be associated with values of type T. It is therefore possible for this map to contain mappings for keys with the same label but different types. Excluding this possibility is the responsibility of the client if desired.

Attributes

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
final case class Attributed[D](data: D)(metadata: AttributeMap)

Associates a metadata map with data.

Associates a metadata map with data.

Attributes

Companion:
object
Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
object Attributed

Attributes

Companion:
class
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
trait Dag[Node <: Dag[Node]]

Attributes

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Node
object Dag

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Dag.type
class DelegatingPMap[K[_], V[_]](backing: Map[K[Any], V[Any]]) extends AbstractRMap[K, V] with PMap[K, V]

Only suitable for K that is invariant in its type parameter. Option and List keys are not suitable, for example, because None <:< Option[String] and None <: Option[Int].

Only suitable for K that is invariant in its type parameter. Option and List keys are not suitable, for example, because None <:< Option[String] and None <: Option[Int].

Attributes

Graph
Supertypes
trait PMap[K, V]
trait K ~> V
class AbstractRMap[K, V]
trait RMap[K, V]
class Object
trait Matchable
class Any
abstract class EvaluateSettings[ScopeType]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any

Attributes

Graph
Supertypes
trait Enum
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
trait IDSet[T]

A mutable set interface that uses object identity to test for set membership.

A mutable set interface that uses object identity to test for set membership.

Attributes

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any
object IDSet

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
IDSet.type
trait IMap[K[_], V[_]] extends K ~> V with RMap[K, V]

Attributes

Companion:
object
Graph
Supertypes
trait RMap[K, V]
trait K ~> V
class Object
trait Matchable
class Any
object IMap

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
IMap.type
trait Init[ScopeType]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
trait PMap[K[_], V[_]] extends K ~> V with RMap[K, V]

Attributes

Companion:
object
Graph
Supertypes
trait RMap[K, V]
trait K ~> V
class Object
trait Matchable
class Any
Known subtypes
class DelegatingPMap[K, V]
object PMap

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
PMap.type
trait RMap[K[_], V[_]]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class AbstractRMap[K, V]
class DelegatingPMap[K, V]
trait IMap[K, V]
trait PMap[K, V]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type
sealed trait Settings[ScopeType]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
object Signals

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Signals.type

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
object Types.type
object Types extends TypeFunctions

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Types.type
object Util

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Util.type
trait ~>[-F1[_], +F2[_]]

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait IMap[K, V]
trait PMap[K, V]
class DelegatingPMap[K, V]
Self type
F1 ~> F2