coursier.core

Resolution

case class Resolution(rootDependencies: Set[Dependency], dependencies: Set[Dependency], forceVersions: Map[Module, String], conflicts: Set[Dependency], projectCache: Map[(Module, String), (Source, Project)], errorCache: Map[(Module, String), Seq[String]], filter: Option[(Dependency) ⇒ Boolean], profileActivation: Option[(String, Activation, Map[String, String]) ⇒ Boolean]) extends Product with Serializable

State of a dependency resolution.

Done if method isDone returns true.

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Resolution
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Resolution(rootDependencies: Set[Dependency], dependencies: Set[Dependency], forceVersions: Map[Module, String], conflicts: Set[Dependency], projectCache: Map[(Module, String), (Source, Project)], errorCache: Map[(Module, String), Seq[String]], filter: Option[(Dependency) ⇒ Boolean], profileActivation: Option[(String, Activation, Map[String, String]) ⇒ Boolean])

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. def artifacts: Seq[Artifact]

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def classifiersArtifacts(classifiers: Seq[String]): Seq[Artifact]

  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. val conflicts: Set[Dependency]

  11. val dependencies: Set[Dependency]

  12. def dependencyArtifacts: Seq[(Dependency, Artifact)]

  13. def dependencyClassifiersArtifacts(classifiers: Seq[String]): Seq[(Dependency, Artifact)]

  14. def dependencyManagementMissing(project: Project): Set[(Module, String)]

    Missing modules in cache, to get the full list of dependencies of project, taking dependency management / inheritance into account.

    Missing modules in cache, to get the full list of dependencies of project, taking dependency management / inheritance into account.

    Note that adding the missing modules to the cache may unveil other missing modules, so these modules should be added to the cache, and dependencyManagementMissing checked again for new missing modules.

  15. def dependencyManagementRequirements(project: Project): Set[(Module, String)]

    Required modules for the dependency management of project.

  16. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  17. val errorCache: Map[(Module, String), Seq[String]]

  18. def errors: Seq[(Dependency, Seq[String])]

  19. val filter: Option[(Dependency) ⇒ Boolean]

  20. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. val forceVersions: Map[Module, String]

  22. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  23. def isDone: Boolean

    Whether the resolution is done.

  24. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  25. def minDependencies: Set[Dependency]

  26. def missingFromCache: Set[(Module, String)]

    The modules we miss some info about.

  27. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  28. def newDependencies: Set[Dependency]

    The final next dependency set, stripped of no more required ones.

  29. def nextDependenciesAndConflicts: (Seq[Dependency], Seq[Dependency], Map[Module, String])

    The "next" dependency set, made of the current dependencies and their transitive dependencies, trying to solve version conflicts.

    The "next" dependency set, made of the current dependencies and their transitive dependencies, trying to solve version conflicts. Transitive dependencies are calculated with the current cache.

    May contain dependencies added in previous iterations, but no more required. These are filtered below, see newDependencies.

    Returns a tuple made of the conflicting dependencies, all the dependencies, and the retained version of each module.

  30. final def nextIfNoMissing: Resolution

    If no module info is missing, the next state of the resolution, which can be immediately calculated.

    If no module info is missing, the next state of the resolution, which can be immediately calculated. Else, the current resolution.

    Annotations
    @tailrec()
  31. final def notify(): Unit

    Definition Classes
    AnyRef
  32. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  33. val profileActivation: Option[(String, Activation, Map[String, String]) ⇒ Boolean]

  34. val projectCache: Map[(Module, String), (Source, Project)]

  35. def remainingDependencies: Set[Dependency]

    Returns dependencies from the "next" dependency set, filtering out those that are no more required.

    Returns dependencies from the "next" dependency set, filtering out those that are no more required.

    The versions of all the dependencies returned are erased (emptied).

  36. def reverseDependencies: Map[Dependency, Vector[Dependency]]

    Returns a map giving the dependencies that brought each of the dependency of the "next" dependency set.

    Returns a map giving the dependencies that brought each of the dependency of the "next" dependency set.

    The versions of all the dependencies returned are erased (emptied).

  37. val rootDependencies: Set[Dependency]

  38. def subset(dependencies: Set[Dependency]): Resolution

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

    Definition Classes
    AnyRef
  40. def transitiveDependencies: Seq[Dependency]

    Transitive dependencies of the current dependencies, according to what there currently is in cache.

    Transitive dependencies of the current dependencies, according to what there currently is in cache.

    No attempt is made to solve version conflicts here.

  41. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  44. def withDependencyManagement(project: Project): Project

    Add dependency management / inheritance related items to project, from what's available in cache.

    Add dependency management / inheritance related items to project, from what's available in cache.

    It is recommended to have fetched what dependencyManagementMissing returned prior to calling this.

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped