Graph Core
2.0.2
API
Generated with
Graph Core/scalax.collection/scalax.collection.mutable

scalax.collection.mutable

package scalax.collection.mutable

Members list

Type members

Classlikes

trait AbstractBuilder[N, E <: Edge[N]] extends Growable[N, E]

Attributes

Supertypes
trait Growable[N, E]
class Object
trait Matchable
class Any
Known subtypes
trait GraphOps[N, E, CC]
trait GraphLike[N, E, CC]
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
trait Graph[N, E]
trait AdjacencyListGraph[N, E <: Edge[N], +CC <: ([X, Y <: Edge[X]] =>> AdjacencyListGraph[X, Y, CC] & Graph[X, Y])] extends GraphLike[N, E, CC], AdjacencyListBase[N, E, CC]

Implements an incident list based mutable graph representation.

Implements an incident list based mutable graph representation.

Attributes

Supertypes
trait AdjacencyListBase[N, E, CC]
trait GraphLike[N, E, CC]
trait GraphOps[N, E, CC]
trait Cloneable[CC[N, E]]
trait Cloneable
trait AbstractBuilder[N, E]
trait Shrinkable[N, E]
trait Growable[N, E]
trait GraphLike[N, E, CC]
trait GraphDegree[N, E, CC]
trait GraphTraversal[N, E]
trait GraphBase[N, E, CC]
trait Serializable
trait GraphOps[N, E, CC]
trait OuterElems[N, E]
class Object
trait Matchable
class Any
Show all
Known subtypes
class DefaultGraphImpl[N, E]
Self type
CC[N, E]
trait ArraySet[A] extends AbstractSet[A], SetOps[A, ArraySet, ArraySet[A]], IterableFactoryDefaults[A, ArraySet], ExtSetMethods[A]

A growable and compactable mutable.Set implementation based on Array and mutable.Set. It switches to the latter representation as soon as a given threshold for the number of elements is reached. Thus this implementation is a kind of mixture of scala.collection.mutable{ResizableArray, Set, HashSet} aimed at increasing the performance of sets having up to 200 to 250 elements.

A growable and compactable mutable.Set implementation based on Array and mutable.Set. It switches to the latter representation as soon as a given threshold for the number of elements is reached. Thus this implementation is a kind of mixture of scala.collection.mutable{ResizableArray, Set, HashSet} aimed at increasing the performance of sets having up to 200 to 250 elements.

Attributes

Companion
object
Supertypes
trait ExtSetMethods[A]
trait FilterableSet[A]
class AbstractSet[A]
trait Set[A]
trait SetOps[A, ArraySet, ArraySet[A]]
trait Shrinkable[A]
trait Builder[A, ArraySet[A]]
trait Growable[A]
trait Clearable
trait Cloneable[ArraySet[A]]
trait Cloneable
trait Iterable[A]
class AbstractSet[A]
trait Set[A]
trait Equals
trait SetOps[A, ArraySet, ArraySet[A]]
trait A => Boolean
class AbstractIterable[A]
trait Iterable[A]
trait IterableOps[A, ArraySet, ArraySet[A]]
trait IterableOnce[A]
class Object
trait Matchable
class Any
Show all
Known subtypes
class SimpleArraySet[A]
object ArraySet extends IterableFactory[ArraySet]

Attributes

Companion
trait
Supertypes
trait Serializable
class Object
trait Matchable
class Any
Self type
ArraySet.type
class Builder[N, E <: Edge[N], +CC <: ([N, E <: Edge[N]] =>> GraphLike[N, E, CC] & AnyGraph[N, E])](companion: Factory[CC])(implicit config: GraphConfig)

Attributes

Supertypes
trait AbstractBuilder[N, E]
trait Growable[N, E]
class Object
trait Matchable
class Any
class DefaultGraphImpl[N, E <: Edge[N]](iniNodes: Iterable[N], iniEdges: Iterable[E])(implicit val config: GraphConfig & AdjacencyListArrayConfig) extends Graph[N, E], AdjacencyListGraph[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]], GraphTraversalImpl[N, E]

Attributes

Companion
object
Supertypes
trait GraphTraversalImpl[N, E]
trait TraverserImpl[N, E]
trait AdjacencyListGraph[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait AdjacencyListBase[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait Graph[N, E]
trait GraphLike[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait GraphOps[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait Cloneable
trait AbstractBuilder[N, E]
trait Shrinkable[N, E]
trait Growable[N, E]
trait AnyGraph[N, E]
trait GraphLike[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait GraphDegree[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait GraphTraversal[N, E]
trait GraphBase[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait Serializable
trait GraphOps[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait OuterElems[N, E]
class Object
trait Matchable
class Any
Show all
object DefaultGraphImpl extends MutableFactory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]

Attributes

Companion
class
Supertypes
trait MutableFactory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait GenericGraphCoreFactory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait GenericGraphFactory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait Factory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
class Object
trait Matchable
class Any
Show all
Self type
trait EqHash[A, C <: EqHash[A, C]]

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class EqHashMap[K, V]
class EqHashSet[A]
Self type
object EqHash

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
EqHash.type
class EqHashMap[K <: AnyRef, V](_sizeHint: Int) extends Map[K, V], EqHash[(K, V), EqHashMap[K, V]]

Attributes

Companion
object
Supertypes
trait EqHash[(K, V), EqHashMap[K, V]]
trait Map[K, V]
trait MapOps[K, V, Map, Map[K, V]]
trait Shrinkable[K]
trait Builder[(K, V), Map[K, V]]
trait Growable[(K, V)]
trait Clearable
trait Cloneable[Map[K, V]]
trait Cloneable
trait Map[K, V]
trait Equals
trait MapOps[K, V, Map, Map[K, V]]
trait PartialFunction[K, V]
trait K => V
trait Iterable[(K, V)]
trait Iterable[(K, V)]
trait IterableOps[(K, V), Iterable, Map[K, V]]
trait IterableOnceOps[(K, V), Iterable, Map[K, V]]
trait IterableOnce[(K, V)]
class Object
trait Matchable
class Any
Show all
object EqHashMap

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type
EqHashMap.type
class EqHashSet[A <: AnyRef](_sizeHint: Int) extends Set[A], EqHash[A, EqHashSet[A]]

Attributes

Companion
object
Supertypes
trait EqHash[A, EqHashSet[A]]
trait Set[A]
trait SetOps[A, Set, Set[A]]
trait Shrinkable[A]
trait Builder[A, Set[A]]
trait Growable[A]
trait Clearable
trait Cloneable[Set[A]]
trait Cloneable
trait Set[A]
trait Equals
trait SetOps[A, Set, Set[A]]
trait A => Boolean
trait Iterable[A]
trait Iterable[A]
trait IterableOps[A, Set, Set[A]]
trait IterableOnceOps[A, Set, Set[A]]
trait IterableOnce[A]
class Object
trait Matchable
class Any
Show all
object EqHashSet

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type
EqHashSet.type
object ExtBitSet

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type
ExtBitSet.type
trait Graph[N, E <: Edge[N]] extends AnyGraph[N, E], GraphLike[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]

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

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

Type parameters

E

the kind of the edges in this graph.

N

the type of the nodes (vertices) in this graph.

Attributes

Companion
object
Supertypes
trait GraphLike[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait GraphOps[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait Cloneable[Graph[N, E]]
trait Cloneable
trait AbstractBuilder[N, E]
trait Shrinkable[N, E]
trait Growable[N, E]
trait AnyGraph[N, E]
trait GraphLike[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait GraphDegree[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait GraphTraversal[N, E]
trait GraphBase[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait Serializable
trait GraphOps[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait OuterElems[N, E]
class Object
trait Matchable
class Any
Show all
Known subtypes
class DefaultGraphImpl[N, E]
object Graph extends MutableFactory[[N, E <: Edge[N]] =>> Graph[N, E]]

The main companion object for mutable graphs.

The main companion object for mutable graphs.

Attributes

Companion
trait
Supertypes
trait MutableFactory[[N, E <: Edge[N]] =>> Graph[N, E]]
trait GenericGraphCoreFactory[[N, E <: Edge[N]] =>> Graph[N, E]]
trait GenericGraphFactory[[N, E <: Edge[N]] =>> Graph[N, E]]
trait Factory[[N, E <: Edge[N]] =>> Graph[N, E]]
class Object
trait Matchable
class Any
Show all
Self type
Graph.type
trait GraphLike[N, E <: Edge[N], +CC <: ([X, Y <: Edge[X]] =>> GraphLike[X, Y, CC] & Graph[X, Y])] extends GraphLike[N, E, CC], GraphOps[N, E, CC]

Trait with common mutable Graph methods.

Trait with common mutable Graph methods.

Attributes

Supertypes
trait GraphOps[N, E, CC]
trait Cloneable[CC[N, E]]
trait Cloneable
trait AbstractBuilder[N, E]
trait Shrinkable[N, E]
trait Growable[N, E]
trait GraphLike[N, E, CC]
trait GraphDegree[N, E, CC]
trait GraphTraversal[N, E]
trait GraphBase[N, E, CC]
trait Serializable
trait GraphOps[N, E, CC]
trait OuterElems[N, E]
class Object
trait Matchable
class Any
Show all
Known subtypes
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
trait Graph[N, E]
Self type
CC[N, E]
trait GraphOps[N, E <: Edge[N], +CC <: ([X, Y <: Edge[X]] =>> GraphLike[X, Y, CC] & Graph[X, Y])] extends Growable[N, E], Shrinkable[N, E], AbstractBuilder[N, E], Cloneable[CC[N, E]]

Attributes

Supertypes
trait Cloneable[CC[N, E]]
trait Cloneable
trait AbstractBuilder[N, E]
trait Shrinkable[N, E]
trait OuterElems[N, E]
trait Growable[N, E]
class Object
trait Matchable
class Any
Show all
Known subtypes
trait GraphLike[N, E, CC]
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
trait Graph[N, E]
Self type
GraphOps[N, E, CC]
trait Growable[-N, -E <: Edge[N]]

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait AbstractBuilder[N, E]
trait GraphOps[N, E, CC]
trait GraphLike[N, E, CC]
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
trait Graph[N, E]
Show all
trait Shrinkable[-N, -E <: Edge[N]] extends OuterElems[N, E]

Attributes

Supertypes
trait OuterElems[N, E]
class Object
trait Matchable
class Any
Known subtypes
trait GraphOps[N, E, CC]
trait GraphLike[N, E, CC]
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
trait Graph[N, E]
final class SimpleArraySet[A](val hints: Hints) extends ArraySet[A], StrictOptimizedIterableOps[A, SimpleArraySet, SimpleArraySet[A]], IterableFactoryDefaults[A, SimpleArraySet], Serializable

A basic ArraySet implementation suitable for efficient add operations. Element removal could be optimized by another implementation.

A basic ArraySet implementation suitable for efficient add operations. Element removal could be optimized by another implementation.

Value parameters

hints

Optimization hints controlling the growth of the underlying scala.collection.mutable.ArrayBuffer!.

Attributes

Companion
object
Supertypes
trait Serializable
trait ArraySet[A]
trait ExtSetMethods[A]
trait FilterableSet[A]
class AbstractSet[A]
trait Set[A]
trait SetOps[A, ArraySet, ArraySet[A]]
trait Shrinkable[A]
trait Builder[A, ArraySet[A]]
trait Growable[A]
trait Clearable
trait Cloneable[ArraySet[A]]
trait Cloneable
trait Iterable[A]
class AbstractSet[A]
trait Set[A]
trait Equals
trait SetOps[A, ArraySet, ArraySet[A]]
trait A => Boolean
class AbstractIterable[A]
trait Iterable[A]
trait IterableOnce[A]
class Object
trait Matchable
class Any
Show all
object SimpleArraySet extends IterableFactory[SimpleArraySet]

Attributes

Companion
class
Supertypes
trait Serializable
class Object
trait Matchable
class Any
Self type
trait TypedGraphFactory[N, E <: Edge[N]] extends TypedGraphCoreFactory[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]

Attributes

Supertypes
trait TypedGraphCoreFactory[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait TypedGraphFactory[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait Factory[[N, E <: Edge[N]] =>> Graph[N, E]]
class Object
trait Matchable
class Any
Show all
Generated with