object Orders

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Orders
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait PartialOrdering [T] extends scala.math.PartialOrdering[T]

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. def allConfigurations(configurations: Map[String, Seq[String]]): Map[String, Set[String]]

    All configurations that each configuration extends, including the ones it extends transitively

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def configurationPartialOrder(configurations: Map[String, Seq[String]]): PartialOrdering[String]

    Configurations partial order based on configuration mapping configurations.

  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. val exclusionsPartialOrder: PartialOrdering[Set[(String, String)]]

    Exclusions partial order.

    Exclusions partial order.

    x <= y iff all that x excludes is also excluded by y. x and y not related iff x excludes some elements not excluded by y AND y excludes some elements not excluded by x.

    In particular, no exclusions <= anything <= Set(("*", "*"))

  11. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. def minDependencies(dependencies: Set[Dependency], configs: ((Module, String)) ⇒ Map[String, Seq[String]]): Set[Dependency]

    Minified representation of dependencies.

    Minified representation of dependencies.

    The returned set brings exactly the same things as dependencies, with no redundancy.

  16. def minDependenciesUnsafe(dependencies: Set[Dependency], configs: Map[String, Seq[String]]): Set[Dependency]

    Assume all dependencies have same module, version, and artifact; see minDependencies if they don't.

  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  20. val optionalPartialOrder: PartialOrdering[Boolean]

    Non-optional < optional

  21. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  22. def toString(): String
    Definition Classes
    AnyRef → Any
  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped