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 the (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
final Label	OSTNU.OSTNUCheckStatus.getLabel4PairContingentExternalNode(LabeledNode contingent, LabeledNode node, boolean straight)
(package private) final Label	OSTNU.getLabel4ValueInvolvingContingent(LabeledNode contingent, LabeledNode node, boolean straight)
(package private) final Label	AbstractCSTN.labelModificationR0qR0Core(LabeledNode nP, LabeledNode nX, Label alpha, int w)	Execute the core of AbstractCSTN.labelModificationR0qR0(LabeledNode, LabeledNode, CSTNEdge).
(package private) final Label	AbstractCSTN.makeAlphaBetaGammaPrime4R3(LabeledNode nS, LabeledNode nD, LabeledNode nObs, char observed, Label labelFromObs, Label labelToClean)	A simple method to determine the label "αβγ" for the rule CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge).
(package private) final 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.
(package private) final 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).
(package private) final 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
final 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
final void	OSTNU.OSTNUCheckStatus.addNegativeScenario(Label label)	Adds to negative scenarios the label, maintaining the minimal representation of the scenarios.
(package private) final 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.
int	CSTNPotential.getUpperPotential(LabeledNode node, Label l)
(package private) final boolean	OSTNU.OSTNUCheckStatus.isInNegativeScenarios(Label label1)	Checks if the label belongs to the negative scenarios.
(package private) final Label	AbstractCSTN.labelModificationR0qR0Core(LabeledNode nP, LabeledNode nX, Label alpha, int w)	Execute the core of AbstractCSTN.labelModificationR0qR0(LabeledNode, LabeledNode, CSTNEdge).
(package private) static String	CSTNU.lowerCaseValueAsString(ALabel nodeName, int value, Label label)
(package private) final Label	AbstractCSTN.makeAlphaBetaGammaPrime4R3(LabeledNode nS, LabeledNode nD, LabeledNode nObs, char observed, Label labelFromObs, Label labelToClean)	A simple method to determine the label "αβγ" for the rule CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge).
(package private) final 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.
(package private) final 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).
(package private) static String	AbstractCSTN.pairAsString(Label label, int value)
boolean	CSTNPotential.putUpperPotential(LabeledNode node, Label l, int value)	Adds the value to the upper potential of the node, with the usual labeled-value merge rules.
(package private) final Label	AbstractCSTN.removeChildrenOfUnknown(Label l)	Returns a new label removing all children of possibly present unknown literals in l.
int	CSTNPotential.updatePotentialCount(LabeledNode node, Label l, boolean reset)	Updates the count associated with the pair (node, label), adding 1 unless reset is true.
(package private) static String	CSTNU.upperCaseValueAsString(ALabel nodeName, int value, Label label)

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

Classes in it.univr.di.cstnu.graph that implement interfaces with type arguments of type Label

Modifier and Type	Class	Description
(package private) static final class	BasicCSTNUEdgePluggable.InternalEntry	Represents a pair (Label, String).
(package private) static final class	BasicCSTNUEdgePluggable.InternalEntry	Represents a pair (Label, String).

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
(package private) it.unimi.dsi.fastutil.objects.Object2IntMap<Label>	CSTNEdgePluggable.consideredLabeledValue	Maintains the log of labeled values that have already been 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 already been considered in the past to avoid adding 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 already been considered in the past to avoid adding it a second time.

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

Modifier and Type	Method	Description
final Label	DenseTCGraph.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.
default Label	TemporalConstraintGraph.getChildrenOf(LabeledNode obs)	Given an observer obs of proposition p, its "children" are all observers Q for which p appears in the label of Q.
Label	BasicCSTNUEdgePluggable.InternalEntry.getKey()
final 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.Object2ObjectMap.Entry<ALabel, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>>	CSTNPSUEdge.getAllLowerCaseAndLabeledValues()	Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<ALabel, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>>	CSTNPSUEdgePluggable.getAllLowerCaseAndLabeledValues()
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<ALabel, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>>	BasicCSTNUEdge.getAllUpperCaseAndLabeledValues()	Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
final it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<ALabel, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>>	BasicCSTNUEdgePluggable.getAllUpperCaseAndLabeledValues()
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNEdge.getLabeledValues()
final it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNEdgePluggable.getLabeledValues()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	CSTNEdge.getLabelsOfLabeledValues()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	CSTNEdgePluggable.getLabelsOfLabeledValues()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	CSTNPSUEdge.getLabelsOfLowerCaseValues()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	CSTNPSUEdge.getLabelsOfLowerCaseValues(ALabel aLabel)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	CSTNPSUEdgePluggable.getLabelsOfLowerCaseValues()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	CSTNPSUEdgePluggable.getLabelsOfLowerCaseValues(ALabel aLabel)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	BasicCSTNUEdge.getLabelsOfUpperCaseValues()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	BasicCSTNUEdge.getLabelsOfUpperCaseValues(ALabel aLabel)
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	BasicCSTNUEdgePluggable.getLabelsOfUpperCaseValues()
final it.unimi.dsi.fastutil.objects.ObjectSet<Label>	BasicCSTNUEdgePluggable.getLabelsOfUpperCaseValues(ALabel aLabel)
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<ALabel, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>>	CSTNPSUEdge.getLowerCaseValues()	Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNPSUEdge.getLowerCaseValues(ALabel lowerCaseLabel)
final it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<ALabel, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>>	CSTNPSUEdgePluggable.getLowerCaseValues()
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	CSTNPSUEdgePluggable.getLowerCaseValues(ALabel lowerCaseLabel)
it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>	CSTNEdge.getMinLabeledValue()
final 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>>	CSTNPSUEdge.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>>	BasicCSTNUEdge.getMinUpperCaseValue()
it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>	BasicCSTNUEdge.getMinUpperCaseValue(ALabel upperCaseLabel)
final it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<ALabel>>	BasicCSTNUEdgePluggable.getMinUpperCaseValue()
final it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>	BasicCSTNUEdgePluggable.getMinUpperCaseValue(ALabel upperCaseLabel)
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<ALabel, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>>	BasicCSTNUEdge.getUpperCaseValues()	Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	BasicCSTNUEdge.getUpperCaseValues(ALabel upperCaseLabel)	Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
final it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<ALabel, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>>	BasicCSTNUEdgePluggable.getUpperCaseValues()
final it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	BasicCSTNUEdgePluggable.getUpperCaseValues(ALabel aLabel)

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

Modifier and Type	Method	Description
final int	LabeledNode.getLabeledPotential(Label l)	Returns the potential associated with label 'l', if it exists; Constants.INT_NULL otherwise.
int	CSTNPSUEdge.getLowerCaseValue(Label l, ALabel name)
int	CSTNPSUEdgePluggable.getLowerCaseValue(Label l, ALabel name1)
int	CSTNEdge.getMinValueSubsumedBy(Label l)
final 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)
final int	CSTNEdgePluggable.getValue(Label label)
boolean	BasicCSTNUEdgePluggable.mergeLabeledValue(Label l, int i)
boolean	CSTNEdge.mergeLabeledValue(Label l, int i)	Merges the labeled value i into the set of labeled values of this edge.
boolean	CSTNEdgePluggable.mergeLabeledValue(Label l, int i)	Merges the labeled value i into the set of labeled values of this edge.
final boolean	CSTNPSUEdgePluggable.mergeLabeledValue(Label l, int i)
boolean	CSTNPSUEdge.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	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.
final boolean	BasicCSTNUEdgePluggable.mergeUpperCaseValue(Label l, ALabel nodeName, int i)
final boolean	LabeledNode.putLabeledPotential(Label l, int value)	Puts the labeled value (value, l) into the potential map.
(package private) final boolean	LabeledNode.putLabeledPotential(Label l, ALabel inputALabel, int value)	Puts the labeled value (value, l, aLabel) into the potential map, under an explicit A-Label instead of the implicit ALabel.emptyLabel used by LabeledNode.putLabeledPotential(Label, int).
final boolean	BasicCSTNUEdgePluggable.putLabeledValue(Label l, int i)
boolean	CSTNEdge.putLabeledValue(Label l, int i)
boolean	CSTNEdgePluggable.putLabeledValue(Label l, int i)
void	BasicCSTNUEdge.putLowerCaseValue(Label l, ALabel nodeName, int i)	Set or add a lower label constraint with delay i for the node n with label l.
final void	CSTNPSUEdgePluggable.putLowerCaseValue(Label l, ALabel nodeName, int i)
void	CSTNUEdgePluggable.putLowerCaseValue(Label l, ALabel nodeName, int i)	Wrapper of CSTNUEdgePluggable.setLowerCaseValue(Label, ALabel, int)
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.
final boolean	BasicCSTNUEdgePluggable.putUpperCaseValue(Label l, ALabel nodeName, int i)
final int	LabeledNode.removeLabeledPotential(Label l)	Removes the labeled potential associated with label l, if it exists.
(package private) final int	LabeledNode.removeLabeledPotential(Label l, ALabel inputALabel)	Removes the labeled potential associated with (label, aLabel), if it exists, under an explicit A-Label instead of the implicit ALabel.emptyLabel used by LabeledNode.removeLabeledPotential(Label).
void	CSTNEdge.removeLabeledValue(Label l)	Remove the value labeled by l from the map.
final void	CSTNEdgePluggable.removeLabeledValue(Label l)	Remove the value labeled by l from the map.
void	CSTNPSUEdge.removeLowerCaseValue(Label l, ALabel n)
final void	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)
final void	LabeledNode.setLabel(Label inputLabel)
void	CSTNUEdge.setLowerCaseValue(Label l, ALabel nodeName, int i)	Set a lower-case constraint with delay i for the node n with label l.
final void	CSTNUEdgePluggable.setLowerCaseValue(Label l, ALabel nodeName, int i)

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)

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

Classes in it.univr.di.labeledvalue that implement interfaces with type arguments of type Label

Modifier and Type	Class	Description
final class	Label	Represents an immutable propositional label in the CSTN/CSTNU framework.
(package private) static class	LabeledIntHierarchyMap.HierarchyNode	Simple class to represent a labeled value in the hierarchy.

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	Deprecated. Map of label
(package private) final it.unimi.dsi.fastutil.objects.Object2IntMap<Label>	LabeledIntSimpleMap.updateCount	Deprecated. 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 labels of the same length that can be used to build any other label of greater length in 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 Label.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 Label.conjunctionExtended(char, char)
final 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; otherwise, it is null.
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
final it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<ALabel, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>>	LabeledALabelIntTreeMap.entrySet()	Important The returned set is a view of the map.
final it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledALabelIntTreeMap.entrySet(ALabel alpha)	The returned set is a view of the map.
final 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>>	LabeledIntMap.entrySet()	The set of all map entries.
it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntSimpleMap.entrySet()	Deprecated.
final it.unimi.dsi.fastutil.objects.ObjectSet<it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>>	LabeledIntTreeMap.entrySet()	The set of all map entries.
default it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>	LabeledIntMap.getMinLabeledValue()
final it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label, it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<ALabel>>	LabeledALabelIntTreeMap.getMinValue()
final it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<Label>	LabeledALabelIntTreeMap.getMinValue(ALabel p)	Returns a copy of the entry containing the min value associated with ALabel p.
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntHierarchyMap.keySet()
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntMap.keySet()	A copy of all labels in the map.
it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntSimpleMap.keySet()	Deprecated.
final it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledIntTreeMap.keySet()
final it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledALabelIntTreeMap.labelSet()
final it.unimi.dsi.fastutil.objects.ObjectSet<Label>	LabeledALabelIntTreeMap.labelSet(ALabel alpha)

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

Modifier and Type	Method	Description
final boolean	LabeledALabelIntTreeMap.alreadyRepresents(Label newLabel, ALabel newAlabel, int newValue)
boolean	LabeledIntHierarchyMap.alreadyRepresents(Label newLabel, int newValue)
boolean	LabeledIntMap.alreadyRepresents(Label newLabel, int newValue)
final boolean	LabeledIntSimpleMap.alreadyRepresents(Label newLabel, int newValue)	Deprecated.
final boolean	LabeledIntTreeMap.alreadyRepresents(Label newLabel, int newValue)
int	Label.compareTo(Label label)	Determines an order based on the length of the 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)	Utility.
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)	Deprecated.
final int	LabeledIntTreeMap.get(Label l)
default int	LabeledIntMap.getMaxValueSubsumedBy(Label l)	Returns the value associated with the l if it exists, otherwise the maximal value among all labels consistent with l.
final int	LabeledALabelIntTreeMap.getMinValueConsistentWith(Label l, ALabel p)	Returns the value associated with (l, p) if it exists, otherwise the minimal value among all labels consistent with (l, p).
final int	LabeledIntHierarchyMap.getMinValueConsistentWith(Label l)
default int	LabeledIntMap.getMinValueConsistentWith(Label l)	Returns the value associated with 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 with 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.
final 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.
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)
boolean	LabeledALabelIntTreeMap.mergeTriple(Label newLabel, ALabel newAlabel, int newValue, boolean force)	Merges a label case value (p,l,i).
final 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 no labeled value in the set with label l, or it is present but with a value higher than l.
final boolean	LabeledIntSimpleMap.put(Label newLabel, int newValue)	Deprecated.
final boolean	LabeledIntTreeMap.put(Label newLabel, int newValue)	Put a label with value i if label l is not null and there is no 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)	Deprecated. 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)
final 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)	Deprecated.
final int	LabeledIntTreeMap.remove(Label l)	Remove the label l from the map.
boolean	Label.subsumes(Label label)	A label L1 subsumes (entails) a label L2 if L1 ⊨ L2.

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)

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

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