Class LabeledIntSimpleMap

java.lang.Object
it.univr.di.labeledvalue.AbstractLabeledIntMap
it.univr.di.labeledvalue.LabeledIntSimpleMap
All Implemented Interfaces:
LabeledIntMap, Serializable
Direct Known Subclasses:
LabeledIntSimpleMap.LabeledIntNotMinMapView
@Deprecated public class LabeledIntSimpleMap extends AbstractLabeledIntMap
Deprecated.
Simple implementation of LabeledIntMap interface without minimization. This class is provided only to give an evidence that without minimization of labeled value sets, any CSTN algorithm can be very slowly.
Version:
$Rev: 877 $
Author:
Roberto Posenato
See Also:

  • Field Details

    • mainMap

      it.unimi.dsi.fastutil.objects.Object2IntMap<Label> mainMap
      Deprecated.
      Map of label

    • updateCount

      final it.unimi.dsi.fastutil.objects.Object2IntMap<Label> updateCount
      Deprecated.
      Counter of labeled value updates.

  • Constructor Details

    • LabeledIntSimpleMap

      public LabeledIntSimpleMap(LabeledIntMap lvm)
      Deprecated.
      Constructor to clone the structure. For optimization issue, this method clone only LabeledIntTreeMap object.
      Parameters:
      lvm - the LabeledValueTreeMap to clone. If lvm is null, this will be an empty map.

    • LabeledIntSimpleMap

      public LabeledIntSimpleMap(LabeledIntMap lvm, boolean optimize)
      Deprecated.
      Constructor to clone the structure. For optimization issue, this method clone only LabeledIntTreeMap object.
      Parameters:
      lvm - the LabeledValueTreeMap to clone. If lvm is null, this will be an empty map.
      optimize - true for having the label shortest as possible, false otherwise. For example, the set {(0, ¬C), (1, C)} is represented as {(0, ⊡), (1, C)} if this parameter is true.

    • LabeledIntSimpleMap

      public LabeledIntSimpleMap()
      Deprecated.
      Necessary constructor for the factory. The internal structure is built and empty.

    • LabeledIntSimpleMap

      public LabeledIntSimpleMap(boolean optimize)
      Deprecated.
      Necessary constructor for the factory. The internal structure is built and empty.
      Parameters:
      optimize - true for having the label shortest as possible, false otherwise. For example, the set {(0, ¬C), (1, C)} is represented as {(0, ⊡), (1, C)} if this parameter is true.

  • Method Details

    • alreadyRepresents

      public final boolean alreadyRepresents(@Nonnull Label newLabel, int newValue)
      Deprecated.
      Parameters:
      newLabel - a Label object.
      newValue - the new value.
      Returns:
      true if the (newValue, newLabel) is already represented in the map.

    • clear

      public void clear()
      Deprecated.
      Description copied from interface: LabeledIntMap
      Remove all entries of the map.
      See Also:

    • entrySet

      public it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> entrySet()
      Deprecated.
      Description copied from interface: LabeledIntMap
      The set of all entries of the map. The set is a view of the map. A modification of the map is reflected on the entries of the returned set.
      If it is necessary to scan all the entries to modify the map, the only right way is to consider the keys returned by LabeledIntMap.keySet() and use methods like LabeledIntMap.remove(Label) and/or LabeledIntMap.put(Label, int).
      Returns:
      The set of all entries of the map.
      See Also:

    • get

      public int get(Label l)
      Deprecated.
      Parameters:
      l - an Label object.
      Returns:
      the value associated to l if it exists, Constants.INT_NULL otherwise.

    • keySet

      public it.unimi.dsi.fastutil.objects.ObjectSet<Label> keySet()
      Deprecated.
      Description copied from interface: LabeledIntMap
      A copy of all labels in the map.
      The returned set must not be connected with the map.
      The semantics of this method is different from the Map.keySet()!
      It can costs time and memory because it should duplicate all the keys of the map.
      This method allows one to scan all the keys of the map even if during the scan some key of the map are removed.
      It is important to modify this map using only method LabeledIntMap.remove(Label).
      Method LabeledIntMap.entrySet() returns a view of the entries of the map. Therefore, it cannot use to scan the map to modify it.
      Returns:
      a copy of all labels in the map.

    • newInstance

      public final LabeledIntSimpleMap newInstance()
      Deprecated.
      Description copied from interface: LabeledIntMap
      Factory
      Returns:
      an object of type LabeledIntMap.

    • newInstance

      public LabeledIntMap newInstance(boolean optimize)
      Deprecated.
      Factory
      Parameters:
      optimize - true for having the label shortest as possible, false otherwise. For example, the set {(0, ¬C), (1, C)} is represented as {(0, ⊡), (1, C)} if this parameter is true.
      Returns:
      an object of type LabeledIntMap.

    • newInstance

      public final LabeledIntSimpleMap newInstance(LabeledIntMap lim)
      Deprecated.
      Description copied from interface: LabeledIntMap
      Factory
      Parameters:
      lim - a map to clone.
      Returns:
      an object of type LabeledIntMap.

    • newInstance

      public LabeledIntMap newInstance(LabeledIntMap lim, boolean optimize)
      Deprecated.
      Factory
      Parameters:
      lim - an object to clone.
      optimize - true for having the label shortest as possible, false otherwise. For example, the set {(0, ¬C), (1, C)} is represented as {(0, ⊡), (1, C)} if this parameter is true.
      Returns:
      an object of type LabeledIntMap.

    • put

      public final boolean put(Label newLabel, int newValue)
      Deprecated.
      Description copied from interface: LabeledIntMap
      Put a label with value i if label l is not null and there is not a labeled value in the set with label l or it is present but with a value higher than l.

      Not mandatory: the method can remove or modify other labeled values of the set in order to minimize the labeled values present guaranteeing that no info is lost.

      Parameters:
      newLabel - a not null label.
      newValue - a not Constants.INT_NULL value.
      Returns:
      true if (l,i) has been inserted. Since an insertion can remove more than one redundant labeled values, it is nonsensical to return "the old value" as expected from a classical put method.

    • putForcibly

      public void putForcibly(Label l, int i)
      Deprecated.
      Put the labeled value without any control. It is dangerous, but it can help in some cases.
      Parameters:
      l - a Label object.
      i - the new value.

    • remove

      public int remove(@Nonnull Label l)
      Deprecated.
      Description copied from interface: LabeledIntMap
      Remove the label l from the map. If the l is not present, it does nothing.
      Parameters:
      l - a not null label.
      Returns:
      the previous value associated with l, or Constants.INT_NULL if there was no mapping for l.

    • size

      public int size()
      Deprecated.
      Specified by:
      size in interface LabeledIntMap
      Overrides:
      size in class AbstractLabeledIntMap
      Returns:
      the number of labeled value (value with empty label included).
      See Also:

    • unmodifiable

      public LabeledIntMap.LabeledIntMapView unmodifiable()
      Deprecated.
      Returns:
      a read-only view of this.

    • values

      public it.unimi.dsi.fastutil.ints.IntSet values()
      Deprecated.
      Returns:
      the set of all integer values present in the map as an ordered list.