Uses of Class
it.univr.di.labeledvalue.Label

Packages that use Label

Package	Description
it.univr.di.cstnu.algorithms	Contains all checking algorithms for (C)STN(U)s.
it.univr.di.cstnu.graph	Contains all classes for representing vertices, edges and graphs related to (C)STN(U) model.
it.univr.di.labeledvalue	Provides the classes necessary to manage labeled value maps.

Uses of Label in it.univr.di.cstnu.algorithms

Methods in it.univr.di.cstnu.algorithms that return Label

Modifier and Type	Method	Description
(package private) Label	OSTNU.getLabel4ValueInvolvingContingent(LabeledNode contingent, LabeledNode node, boolean straight)
(package private) Label	AbstractCSTN.labelModificationR0qR0Core(LabeledNode nP, LabeledNode nX, Label alpha, int w)	Execute the core of AbstractCSTN.labelModificationR0qR0(LabeledNode, LabeledNode, CSTNEdge). It can be used for applying the rule to a specific pair (w, alpha). Returns the label to use for storing the new value considering rule R0qR0.
(package private) Label	AbstractCSTN.makeAlphaBetaGammaPrime4R3(LabeledNode nS, LabeledNode nD, LabeledNode nObs, char observed, Label labelFromObs, Label labelToClean)	Simple method to determine the label "αβγ" for rule CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge). See Table 1 and Table 2 ICAPS 2016 paper.
(package private) Label	AbstractCSTN.makeAlphaPrime(LabeledNode nX, LabeledNode nObs, char observed, Label labelFromObs)	Simple method to determine the α' to use in rules R0 and in rule qR0. Check paper TIME15 and ICAPS 2016 about CSTN sound&complete DC check. α' is obtained by α removing all children of the observed proposition. If X==Z, then it is necessary also to remove all children of unknown from α'.
(package private) Label	AbstractCSTN.makeBetaGammaDagger4qR3(LabeledNode nS, LabeledNode nObs, char observed, Label labelFromObs, Label labelToClean)	Simple method to determine the label (β*γ)† to use in rules qR3* CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge). See Table 1 and Table 2 ICAPS 2016 paper.
(package private) Label	AbstractCSTN.removeChildrenOfUnknown(Label l)	Returns a new label removing all children of possibly present unknown literals in l.

Methods in it.univr.di.cstnu.algorithms that return types with arguments of type Label

Modifier and Type	Method	Description
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	OSTNU.OSTNUCheckStatus.getNegativeScenarios()

Methods in it.univr.di.cstnu.algorithms with parameters of type Label

Modifier and Type	Method	Description
void	OSTNU.OSTNUCheckStatus.addNegativeScenario(Label label)	Adds to negative scenarios maintain minimal the representation of the set.
(package private) boolean	OSTNU.checkAndManageIfNewLabeledValueIsANegativeLoop(int value, Label label, LabeledNode source, LabeledNode destination, OSTNUEdgePluggable newEdge)	Checks if a new labeled value is negative and represents a negative cycle.
(package private) boolean	OSTNU.OSTNUCheckStatus.isInNegativeScenarios(Label label1)	Checks if the label belongs to the negativeScenarios.
(package private) Label	AbstractCSTN.labelModificationR0qR0Core(LabeledNode nP, LabeledNode nX, Label alpha, int w)	Execute the core of AbstractCSTN.labelModificationR0qR0(LabeledNode, LabeledNode, CSTNEdge). It can be used for applying the rule to a specific pair (w, alpha). Returns the label to use for storing the new value considering rule R0qR0.
(package private) static String	CSTNU.lowerCaseValueAsString(ALabel nodeName, int value, Label label)
(package private) static String	OSTNU.lowerCaseValueAsString(ALabel nodeName, int value, Label label)
(package private) Label	AbstractCSTN.makeAlphaBetaGammaPrime4R3(LabeledNode nS, LabeledNode nD, LabeledNode nObs, char observed, Label labelFromObs, Label labelToClean)	Simple method to determine the label "αβγ" for rule CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge). See Table 1 and Table 2 ICAPS 2016 paper.
(package private) Label	AbstractCSTN.makeAlphaPrime(LabeledNode nX, LabeledNode nObs, char observed, Label labelFromObs)	Simple method to determine the α' to use in rules R0 and in rule qR0. Check paper TIME15 and ICAPS 2016 about CSTN sound&complete DC check. α' is obtained by α removing all children of the observed proposition. If X==Z, then it is necessary also to remove all children of unknown from α'.
(package private) Label	AbstractCSTN.makeBetaGammaDagger4qR3(LabeledNode nS, LabeledNode nObs, char observed, Label labelFromObs, Label labelToClean)	Simple method to determine the label (β*γ)† to use in rules qR3* CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge). See Table 1 and Table 2 ICAPS 2016 paper.
(package private) static String	AbstractCSTN.pairAsString(Label label, int value)
(package private) Label	AbstractCSTN.removeChildrenOfUnknown(Label l)	Returns a new label removing all children of possibly present unknown literals in l.
static int	CSTNPotential.updatePotentialCount(LabeledNode node, Label l, boolean reset)	Updates the count associated to the pair (node, label) adding 1 unless reset is true.
(package private) static String	CSTNU.upperCaseValueAsString(ALabel nodeName, int value, Label label)
(package private) static String	OSTNU.upperCaseValueAsString(ALabel nodeName, int value, Label label)

Uses of Label in it.univr.di.cstnu.graph

Fields in it.univr.di.cstnu.graph declared as Label

Modifier and Type	Field	Description
(package private) final Label	BasicCSTNUEdgePluggable.InternalEntry.label

Fields in it.univr.di.cstnu.graph with type parameters of type Label

Modifier and Type	Field	Description
protected it.unimi.dsi.fastutil.objects.Object2IntMap<Label>	CSTNEdgePluggable.consideredLabeledValue	Maintains log of labeled values that have been already inserted and, therefore, cannot be reinserted.
(package private) it.unimi.dsi.fastutil.objects.Object2IntMap<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,ALabel>>	CSTNPSUEdgePluggable.consideredLowerCaseValue	The CSTNU controllability check algorithm needs to know if a labeled value has been already considered in the past in order to avoid to add it a second time.
(package private) it.unimi.dsi.fastutil.objects.Object2IntMap<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,ALabel>>	BasicCSTNUEdgePluggable.consideredUpperCaseValue	The CSTNU controllability check algorithm needs to know if a labeled value has been already considered in the past in order to avoid to add it a second time.
(package private) it.unimi.dsi.fastutil.objects.Object2IntMap<Label>	LabeledNode.labeledPotentialCount	Labeled potential count.

Methods in it.univr.di.cstnu.graph that return Label

Modifier and Type	Method	Description
Label	TNGraph.getChildrenOf(LabeledNode obs)	Given an observation node obs that observes the proposition 'p', its 'children' are all observation nodes, Q, for which 'p' appears in the label of node Q.
Label	BasicCSTNUEdgePluggable.InternalEntry.getKey()
Label	LabeledNode.getLabel()

Methods in it.univr.di.cstnu.graph that return types with arguments of type Label

Modifier and Type	Method	Description
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNEdge.getLabeledValueSet()
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNEdge.getLabeledValueSet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNEdgePluggable.getLabeledValueSet()
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNEdgePluggable.getLabeledValueSet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)
it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>	CSTNEdge.getMinLabeledValue()
it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>	CSTNEdgePluggable.getMinLabeledValue()
it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<ALabel>>	BasicCSTNUEdge.getMinLowerCaseValue()
it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<ALabel>>	CSTNPSUEdgePluggable.getMinLowerCaseValue()
it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<ALabel>>	CSTNUEdgePluggable.getMinLowerCaseValue()
it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<ALabel>>	BasicCSTNUEdge.getMinUpperCaseValue()
final it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<ALabel>>	BasicCSTNUEdgePluggable.getMinUpperCaseValue()

Methods in it.univr.di.cstnu.graph with parameters of type Label

Modifier and Type	Method	Description
int	LabeledNode.getLabeledPotential(Label l)	Returns the potential associated to label l, if it exists; Constants.INT_NULL otherwise.
final int	LabeledNode.getLabeledPotentialCount(Label l)
int	LabeledNode.getLabeledUpperPotential(Label l)	Returns the upper potential associated to label l, if it exists; Constants.INT_NULL otherwise.
default int	CSTNPSUEdge.getLowerCaseValue(Label l, ALabel name)
int	CSTNPSUEdgePluggable.getLowerCaseValue(Label l, ALabel name1)
int	CSTNEdge.getMinValueConsistentWith(Label l)
int	CSTNEdgePluggable.getMinValueConsistentWith(Label l)
int	CSTNEdge.getMinValueSubsumedBy(Label l)
int	CSTNEdgePluggable.getMinValueSubsumedBy(Label l)
int	BasicCSTNUEdge.getUpperCaseValue(Label l, ALabel name)
final int	BasicCSTNUEdgePluggable.getUpperCaseValue(Label l, ALabel name1)
int	CSTNEdge.getValue(Label label)
int	CSTNEdgePluggable.getValue(Label label)
boolean	BasicCSTNUEdgePluggable.mergeLabeledValue(Label l, int i)
boolean	CSTNEdge.mergeLabeledValue(Label l, int i)	Merges the labeled value i to the set of labeled values of this edge.
boolean	CSTNEdgePluggable.mergeLabeledValue(Label l, int i)	Merges the labeled value i to the set of labeled values of this edge.
boolean	CSTNPSUEdgePluggable.mergeLabeledValue(Label l, int i)
boolean	BasicCSTNUEdge.mergeLowerCaseValue(Label l, ALabel nodeName, int i)	Merge a lower label constraint with value i for the node name n with label l.
final boolean	CSTNPSUEdgePluggable.mergeLowerCaseValue(Label l, ALabel nodeName, int i)
boolean	CSTNUEdgePluggable.mergeLowerCaseValue(Label l, ALabel nodeName, int i)
boolean	BasicCSTNUEdge.mergeUpperCaseValue(Label l, ALabel nodeName, int i)	Merge an upper label constraint with delay i for the node name n with propositional label l. If the new value makes other already present values redundant, such values are removed.
final boolean	BasicCSTNUEdgePluggable.mergeUpperCaseValue(Label l, ALabel nodeName, int i)
(package private) static String	BasicCSTNUEdgePluggable.pairAsString(Label label, int value)
final boolean	LabeledNode.putLabeledPotential(Label l, int value)	Puts the labeled value (value, l) into the potential map.
final boolean	LabeledNode.putLabeledUpperPotential(Label l, int value)	Puts the labeled value (value, l) into the upper potential map.
final boolean	BasicCSTNUEdgePluggable.putLabeledValue(Label l, int i)
boolean	CSTNEdge.putLabeledValue(Label l, int i)
boolean	CSTNEdgePluggable.putLabeledValue(Label l, int i)
boolean	BasicCSTNUEdge.putLowerCaseValue(Label l, ALabel nodeName, int i)	Put a lower label constraint with value i for the node name n with label l. Putting does not make any label optimization.
final boolean	CSTNPSUEdgePluggable.putLowerCaseValue(Label l, ALabel nodeName, int i)
final boolean	CSTNUEdgePluggable.putLowerCaseValue(Label l, ALabel nodeName, int i)
boolean	BasicCSTNUEdge.putUpperCaseValue(Label l, ALabel nodeName, int i)	Put an upper label constraint with delay i for the node name n with label l. There is no optimization of the labeled values present after the insertion of this one.
final boolean	BasicCSTNUEdgePluggable.putUpperCaseValue(Label l, ALabel nodeName, int i)
int	LabeledNode.removeLabeledPotential(Label l)	Removes the labeled potential associated to label l, if it exists.
int	LabeledNode.removeLabeledUpperPotential(Label l)	Removes the labeled upper potential associated to label l, if it exists.
void	CSTNEdge.removeLabeledValue(Label l)	Remove the value labeled by l from the map.
void	CSTNEdgePluggable.removeLabeledValue(Label l)	Remove the value labeled by l from the map.
int	CSTNPSUEdge.removeLowerCaseValue(Label l, ALabel n)
final int	CSTNPSUEdgePluggable.removeLowerCaseValue(Label l, ALabel n)
int	BasicCSTNUEdge.removeUpperCaseValue(Label l, ALabel n)	Remove the upper label for node name n with label l.
final int	BasicCSTNUEdgePluggable.removeUpperCaseValue(Label l, ALabel n)
void	LabeledNode.setLabel(Label inputLabel)
final int	LabeledNode.setLabeledPotentialCount(Label l, int value)	Put the value with label l into the map.
void	CSTNUEdge.setLowerCaseValue(Label l, ALabel nodeName, int i)	Set a lower label constraint with delay i for the node n with label l. If a lower label with label l for node n is already present, it is overwritten.
void	CSTNUEdgePluggable.setLowerCaseValue(Label l, ALabel nodeName, int i)
(package private) int	CSTNPSUEdgePluggable.setLowerCaseValueAsConsidered(Label l, ALabel n, int i)	Set the triple as already considered in order to avoid to consider it again in the future.
(package private) final int	BasicCSTNUEdgePluggable.setUpperCaseValueAsConsidered(Label l, ALabel n, int i)	Set the triple as already considered in order to avoid to consider it again in the future.
(package private) static String	BasicCSTNUEdgePluggable.upperCaseValueAsString(ALabel nodeName, int value, Label label)

Method parameters in it.univr.di.cstnu.graph with type arguments of type Label

Modifier and Type	Method	Description
int	BasicCSTNUEdgePluggable.InternalEntry.compareTo(it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,ALabel> o)
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNEdge.getLabeledValueSet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNEdgePluggable.getLabeledValueSet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)

Constructors in it.univr.di.cstnu.graph with parameters of type Label

Modifier	Constructor	Description
(package private)	InternalEntry(Label inputLabel, ALabel inputALabel)

Uses of Label in it.univr.di.labeledvalue

Fields in it.univr.di.labeledvalue declared as Label

Modifier and Type	Field	Description
static final Label	Label.emptyLabel	A constant empty label to represent an empty label that cannot be modified.
(package private) Label	LabeledIntHierarchyMap.HierarchyNode.label

Fields in it.univr.di.labeledvalue with type parameters of type Label

Modifier and Type	Field	Description
static final Comparator<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntMap.entryComparator	A natural comparator for Entry<Label>.
(package private) it.unimi.dsi.fastutil.ints.Int2ObjectArrayMap<it.unimi.dsi.fastutil.objects.Object2IntMap<Label>>	LabeledIntTreeMap.mainInt2SetMap	Design choice: the set of labeled values of this map is organized as a collection of sets each containing labels of the same length.
(package private) it.unimi.dsi.fastutil.objects.Object2IntMap<Label>	LabeledIntSimpleMap.mainMap	Map of label
(package private) it.unimi.dsi.fastutil.objects.Object2IntMap<Label>	LabeledIntSimpleMap.updateCount	Counter of labeled value updates.

Methods in it.univr.di.labeledvalue that return Label

Modifier and Type	Method	Description
static Label[]	Label.allComponentsOfBaseGenerator(char[] baseElements)	A base is a set of same-length labels that are can be used to build any other greater-length label of the universe.
Label	Label.conjunction(char proposition, char propositionState)	It returns a new label conjunction of proposition and this if this is consistent with proposition and its propositionState.
Label	Label.conjunction(Label label)	Conjuncts label to this if this is consistent with label and returns the result without modifying this.
Label	Label.conjunction(Literal literal)	Helper method for conjunction(char, char)
Label	Label.conjunctionExtended(char proposition, char propositionState)	It returns the conjunction of proposition to this.
Label	Label.conjunctionExtended(Label label)	Create a new label that represents the conjunction of this and label using also Literal.UNKNOWN literals.
Label	Label.conjunctionExtended(Literal literal)	Helper method conjunctionExtended(char, char)
Label	LabeledIntHierarchyMap.HierarchyNode.getKey()
Label	LabeledLowerCaseValue.getLabel()
Label	Label.getSubLabelIn(Label label, boolean inCommon)	Determines the sub label of this that is also present (not present) in label lab.
Label	Label.getSubLabelIn(Label label, boolean inCommon, boolean strict)	Determines the sub label of this that is also present (not present) in label lab.
static Label	Label.parse(String s)	Parse a string representing a label and return an equivalent Label object if no errors are found, null otherwise.
Label	Label.remove(char proposition)	Returns a new label that is a copy of this without proposition if it is present.
Label	Label.remove(Label inputLabel)	Returns a new label copy of this where all literals with names in inputLabel are removed.
Label	Label.remove(Literal literal)	Returns a new label that is a copy of this where literal is removed if it is present.
static Label	Label.valueOf(char proposition, char state)

Methods in it.univr.di.labeledvalue that return types with arguments of type Label

Modifier and Type	Method	Description
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntHierarchyMap.entrySet()
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntHierarchyMap.entrySet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntMap.entrySet()	The set of all entries of the map.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntMap.entrySet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)	The set of all entries of the map.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntSimpleMap.entrySet()	This method returns a copy of the view of the map.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntSimpleMap.entrySet(@NotNull it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)	This method returns a copy of the view of the map.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntTreeMap.entrySet()	The set of all entries of the map.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntTreeMap.entrySet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)
default it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>	LabeledIntMap.getMinLabeledValue()
it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<ALabel>>	LabeledALabelIntTreeMap.getMinValue()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntHierarchyMap.keySet()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntHierarchyMap.keySet(it.unimi.dsi.fastutil.objects.ObjectSet<Label> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntMap.keySet()	A copy of all labels in the map.
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntMap.keySet(it.unimi.dsi.fastutil.objects.ObjectSet<Label> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntSimpleMap.keySet()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntSimpleMap.keySet(it.unimi.dsi.fastutil.objects.ObjectSet<Label> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntTreeMap.keySet()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntTreeMap.keySet(it.unimi.dsi.fastutil.objects.ObjectSet<Label> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledALabelIntTreeMap.labelSet()	labelSet.

Methods in it.univr.di.labeledvalue with parameters of type Label

Modifier and Type	Method	Description
boolean	LabeledALabelIntTreeMap.alreadyRepresents(Label newLabel, ALabel newAlabel, int newValue)
boolean	LabeledIntHierarchyMap.alreadyRepresents(Label newLabel, int newValue)
boolean	LabeledIntMap.alreadyRepresents(Label newLabel, int newValue)
boolean	LabeledIntSimpleMap.alreadyRepresents(Label newLabel, int newValue)
boolean	LabeledIntTreeMap.alreadyRepresents(Label newLabel, int newValue)
int	Label.compareTo(Label label)	Determines an order based on length of label.
Label	Label.conjunction(Label label)	Conjuncts label to this if this is consistent with label and returns the result without modifying this.
Label	Label.conjunctionExtended(Label label)	Create a new label that represents the conjunction of this and label using also Literal.UNKNOWN literals.
static LabeledLowerCaseValue	LabeledLowerCaseValue.create(ALabel nodeName, int value, Label label)	Creates a lower-case value.
static String	AbstractLabeledIntMap.entryAsString(Label label, int value)
static String	LabeledALabelIntTreeMap.entryAsString(Label label, int value, ALabel nodeName)	entryAsString.
static String	LabeledLowerCaseValue.entryAsString(ALabel nodeN, int v, Label l, boolean lower)
int	LabeledIntHierarchyMap.get(Label l)
int	LabeledIntMap.get(Label l)
int	LabeledIntSimpleMap.get(Label l)
int	LabeledIntTreeMap.get(Label l)
default int	LabeledIntMap.getMaxValueSubsumedBy(Label l)	Returns the value associated to the l if it exists, otherwise the maximal value among all labels consistent with l.
int	LabeledALabelIntTreeMap.getMinValueConsistentWith(Label l, ALabel p)	Returns the value associated to (l, p) if it exists, otherwise the minimal value among all labels consistent with (l, p).
int	LabeledIntHierarchyMap.getMinValueConsistentWith(Label l)
default int	LabeledIntMap.getMinValueConsistentWith(Label l)	Returns the value associated to the l if it exists, otherwise the minimal value among all labels consistent with l.
int	LabeledIntHierarchyMap.getMinValueSubsumedBy(Label l)
default int	LabeledIntMap.getMinValueSubsumedBy(Label l)	Returns the minimal value among those associated to labels subsumed by l if it exists, Constants.INT_NULL otherwise.
int	LabeledIntTreeMap.getMinValueSubsumedBy(Label l)
Label	Label.getSubLabelIn(Label label, boolean inCommon)	Determines the sub label of this that is also present (not present) in label lab.
Label	Label.getSubLabelIn(Label label, boolean inCommon, boolean strict)	Determines the sub label of this that is also present (not present) in label lab.
Literal	Label.getUniqueDifferentLiteral(Label label)	Finds and returns the unique different literal between this and lab if it exists.
int	LabeledALabelIntTreeMap.getValue(Label l, ALabel p)
boolean	Label.isConsistentWith(Label label)	A label L1 is consistent with a label L2 if L1 ∧ L2 is satisfiable. L1 subsumes L2 implies L1 is consistent with L2 but not vice-versa.
boolean	LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView.mergeTriple(Label l, ALabel p, int i)	Object Read-only.
boolean	LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView.mergeTriple(Label newLabel, ALabel newAlabel, int newValue, boolean force)	Object Read-only.
boolean	LabeledALabelIntTreeMap.mergeTriple(Label l, ALabel p, int i)	mergeTriple.
boolean	LabeledALabelIntTreeMap.mergeTriple(Label newLabel, ALabel newAlabel, int newValue, boolean force)	Merges a label case value (p,l,i).
boolean	LabeledIntHierarchyMap.put(Label newLabel, int newValue)
default boolean	LabeledIntMap.LabeledIntMapView.put(Label l, int i)	Object Read-only.
boolean	LabeledIntMap.put(Label l, int i)	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.
boolean	LabeledIntSimpleMap.put(Label newLabel, int newValue)
boolean	LabeledIntTreeMap.put(Label newLabel, int newValue)	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.
void	LabeledIntHierarchyMap.putForcibly(Label l, int i)	Put the labeled value without any control.
void	LabeledIntMap.putForcibly(Label l, int i)	Put the labeled value without any control.
void	LabeledIntSimpleMap.putForcibly(Label l, int i)	Put the labeled value without any control.
void	LabeledIntTreeMap.LabeledIntTreeMapView.putForcibly(Label l, int i)	Object Read-only.
void	LabeledIntTreeMap.putForcibly(Label l, int i)
boolean	LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView.putTriple(Label l, ALabel p, int i)	Object Read-only.
boolean	LabeledALabelIntTreeMap.putTriple(Label l, ALabel p, int i)	Put the triple (p,l,i) into the map.
Label	Label.remove(Label inputLabel)	Returns a new label copy of this where all literals with names in inputLabel are removed.
int	LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView.remove(Label l, ALabel p)	Object Read-only.
int	LabeledALabelIntTreeMap.remove(Label l, ALabel p)
int	LabeledIntHierarchyMap.remove(Label l)
default int	LabeledIntMap.LabeledIntMapView.remove(Label l)
int	LabeledIntMap.remove(Label l)	Remove the label l from the map.
int	LabeledIntSimpleMap.remove(Label l)
int	LabeledIntTreeMap.remove(Label l)
boolean	Label.subsumes(Label label)	A label L1 subsumes (entails) a label L2 if L1 ⊨ L2. In other words, L1 subsumes L2 if L1 contains all literals of L2 when both they have no unknown literals.

Method parameters in it.univr.di.labeledvalue with type arguments of type Label

Modifier and Type	Method	Description
(package private) static String	AbstractLabeledIntMap.entryAsString(it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label> entry)
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntHierarchyMap.entrySet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntMap.entrySet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)	The set of all entries of the map.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntSimpleMap.entrySet(@NotNull it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)	This method returns a copy of the view of the map.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntTreeMap.entrySet(it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntHierarchyMap.keySet(it.unimi.dsi.fastutil.objects.ObjectSet<Label> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntMap.keySet(it.unimi.dsi.fastutil.objects.ObjectSet<Label> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntSimpleMap.keySet(it.unimi.dsi.fastutil.objects.ObjectSet<Label> setToReuse)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntTreeMap.keySet(it.unimi.dsi.fastutil.objects.ObjectSet<Label> setToReuse)

Constructors in it.univr.di.labeledvalue with parameters of type Label

Modifier	Constructor	Description
(package private)	HierarchyNode(Label l, int v)