scalax.collection

mutable

package mutable

Content Hierarchy Learn more about scaladoc diagrams
Visibility
  1. Public
  2. All

Type Members

  1. trait AdjacencyListGraph[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: AdjacencyListGraph[X, Y[X], This] with Graph[X, Y[X]]] extends GraphLike[N, E, This] with AdjacencyListBase[N, E, This]

    Implements an incident list based mutable graph representation.

  2. trait ArraySet[A] extends MSet[A] with GenericSetTemplate[A, ArraySet] with SetLike[A, ArraySet[A]] with ExtSetMethods[A]

    A growable and compactable mutable.Set implementation based on Array and mutable.Set.

  3. abstract class BuilderImpl[N, E[X] <: EdgeLikeIn[X], CC[N, E[X] <: EdgeLikeIn[X]] <: collection.Graph[N, E[X]] with collection.GraphLike[N, E[X], CC]] extends Builder[Param[N, E], CC[N, E]]

    Attributes
    protected[scalax.collection]
  4. class DefaultGraphImpl[N, E[X] <: EdgeLikeIn[X]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]

    Annotations
    @SerialVersionUID( 73L )
  5. trait EdgeOps[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends AnyRef

    This trait contains mutating edge addition methods that don't require an outer edge.

  6. trait EqHash[A <: AnyRef, This <: EqHash[A, This]] extends AnyRef

  7. class EqHashMap[K <: AnyRef, V] extends Map[K, V] with MapLike[K, V, EqHashMap[K, V]] with EqHash[(K, V), EqHashMap[K, V]]

  8. class EqHashSet[A <: AnyRef] extends Set[A] with SetLike[A, EqHashSet[A]] with EqHash[A, EqHashSet[A]]

  9. final class ExtBitSet extends BitSet

    Attributes
    protected[scalax.collection]
  10. class ExtHashSet[A] extends HashSet[A] with SetLike[A, ExtHashSet[A]] with GenericSetTemplate[A, ExtHashSet] with ExtSetMethods[A]

  11. trait Graph[N, E[X] <: EdgeLikeIn[X]] extends collection.Graph[N, E] with GraphLike[N, E, Graph]

    The main trait for mutable graphs bundling the functionality of traits concerned with specific aspects.

  12. class GraphBuilder[N, E[X] <: EdgeLikeIn[X], CC[N, E[X] <: EdgeLikeIn[X]] <: collection.GraphLike[N, E[X], CC] with collection.Graph[N, E[X]]] extends BuilderImpl[N, E, CC]

  13. trait GraphLike[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends collection.GraphLike[N, E, This] with Growable[Param[N, E]] with Shrinkable[Param[N, E]] with Cloneable[Graph[N, E]] with EdgeOps[N, E, This] with Mutable

    Trait with common mutable Graph methods.

  14. final class SimpleArraySet[A] extends ArraySet[A] with GenericSetTemplate[A, SimpleArraySet] with SetLike[A, SimpleArraySet[A]] with Serializable

    A basic ArraySet implementation suitable for efficient add operations.

Value Members

  1. object ArraySet extends MutableSetFactory[ArraySet]

  2. object DefaultGraphImpl extends MutableGraphCompanion[DefaultGraphImpl] with Serializable

  3. object EqHash

  4. object EqHashMap

  5. object EqHashSet

  6. object ExtHashSet extends MutableSetFactory[ExtHashSet] with Serializable

  7. object Graph extends MutableGraphCompanion[Graph] with Serializable

    The main companion object for mutable graphs.

  8. object SimpleArraySet extends MutableSetFactory[SimpleArraySet] with Serializable

Ungrouped