labels

Type Members

1. class ArrayBasedLabel[L] extends Label[Int, L] with HasMaxId

   

   A subtype of Label that uses an underlying array to map an integer id to the value associated with that id.

   A subtype of Label that uses an underlying array to map an integer id to the value associated with that id. Useful when maxId is not too big.

   L

   type of the label value ClassTag is required to be able to build an array of type L TypeTag is required to be able to retrieve values of type L from the Label

   See also

   An array based label must be defined for all ids. If desired for only some ids, mix it in with PartialLabel

2. class ArrayBasedPartialLabel[L] extends ArrayBasedLabel[L] with BitSetBasedPartialLabel[L]

   

   Backed by an array, but allows some ids to have undefined ('None') value (the ids present are tracked by a bitset).

3. class BitSetBasedFlagLabel extends TrueLabel[Int] with BitSetBasedPartialLabel[Boolean] with HasMaxId

   

   A partially defined flag label backed by a bitset.

4. trait BitSetBasedPartialLabel[L] extends PartialLabel[Int, L]

   

   A partially defined label containing values of type L.

   A partially defined label containing values of type L. The tracking of which ids have the label defined is done by a BitSet, hence this trait must have self type HasMaxId.

5. class FlagLabel[ID] extends TrueLabel[ID] with PartialLabel[ID, Boolean]

   

   This label is suitable to keep a 'flag' type label which some ids have and others don't.

   This label is suitable to keep a 'flag' type label which some ids have and others don't. Those ids that have it return Some(x) and those don't have return None. x does not matter and here we use true.

6. trait HasMaxId extends AnyRef

   

7. class IntLabel[L] extends Label[Int, L]

   

   Specialized labels for int ids (label keys).

   Specialized labels for int ids (label keys). Label values can be anything.

   L

   the type of the label value

8. trait Label[ID, L] extends Map[ID, L]

   

   A trait to support adding labels to nodes and edges.

   A trait to support adding labels to nodes and edges. A label is of any type, has a name and optionally maps an 'id' (such as node-id or edge-id) to a value. Labels need not be defined for all ids.

   ID

   the id-type of the node or edges (e.g., Int)

   L

   the type of the label value

9. class Labels[ID] extends AnyRef

   

10. class MapBasedLabel[ID, L] extends HashMap[ID, L] with Label[ID, L]

    

11. trait PartialLabel[ID, L] extends Label[ID, L]

    

12. abstract class TrueLabel[ID] extends Label[ID, Boolean]