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

Packages that use ALabel

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 ALabel in it.univr.di.cstnu.algorithms

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

Modifier and Type	Method	Description
(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) static String	CSTNU.upperCaseValueAsString(ALabel nodeName, int value, Label label)
(package private) static String	OSTNU.upperCaseValueAsString(ALabel nodeName, int value, Label label)

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

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

Modifier and Type	Field	Description
(package private) ALabel	BasicCSTNUEdgePluggable.InternalEntry.aLabel

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

Modifier and Type	Field	Description
(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.

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

Modifier and Type	Method	Description
ALabel	LabeledNode.getALabel()
ALabel	BasicCSTNUEdgePluggable.InternalEntry.getValue()
ALabel	BasicCSTNUEdgePluggable.InternalEntry.setValue(ALabel value)

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

Modifier and Type	Method	Description
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 ALabel

Modifier and Type	Method	Description
default int	CSTNPSUEdge.getLowerCaseValue(Label l, ALabel name)
int	CSTNPSUEdgePluggable.getLowerCaseValue(Label l, ALabel name1)
int	BasicCSTNUEdge.getUpperCaseValue(Label l, ALabel name)
final int	BasicCSTNUEdgePluggable.getUpperCaseValue(Label l, ALabel name1)
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)
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	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.setALabel(ALabel inputAlabel)	Sets the ALabel of the node.
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.
ALabel	BasicCSTNUEdgePluggable.InternalEntry.setValue(ALabel value)
(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 ALabel

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 ALabel

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

Uses of ALabel in it.univr.di.labeledvalue

Subclasses of ALabel in it.univr.di.labeledvalue

Modifier and Type	Class	Description
static final class	ALabel.EmptyLabel	An unmodifiable empty label.

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

Modifier and Type	Field	Description
static final ALabel	ALabel.emptyLabel	A constant empty label to represent an empty label that cannot be modified.

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

Modifier and Type	Field	Description
protected it.unimi.dsi.fastutil.objects.Object2ObjectRBTreeMap<ALabel,LabeledIntMap>	LabeledALabelIntTreeMap.map	Data structure.

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

Modifier and Type	Method	Description
static ALabel	ALabel.clone(ALabel label)	In order to have a correct copy of an a-label.
ALabel	ALabel.conjunction(ALabel label)	Conjoins a-label to this and returns the result without modifying this.
ALabel	ALabel.EmptyLabel.conjunction(ALabel label)
ALabel	LabeledLowerCaseValue.getNodeName()
ALabel	ALabel.intersect(ALabel label)
static ALabel	ALabel.parse(String s, ALabelAlphabet alphabet)	Parse a string representing an A-label and return an equivalent A-Label object if no errors are found, null otherwise.

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

Modifier and Type	Method	Description
it.unimi.dsi.fastutil.objects.Object2ObjectMap.Entry<Label,it.unimi.dsi.fastutil.objects.Object2IntMap.Entry<ALabel>>	LabeledALabelIntTreeMap.getMinValue()
it.unimi.dsi.fastutil.objects.ObjectSet<ALabel>	LabeledALabelIntTreeMap.keySet()

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

Modifier and Type	Method	Description
boolean	LabeledALabelIntTreeMap.alreadyRepresents(Label newLabel, ALabel newAlabel, int newValue)
static ALabel	ALabel.clone(ALabel label)	In order to have a correct copy of an a-label.
int	ALabel.compareTo(ALabel label)	In order to speed up this method and considering that the ALabelAlphabet order may be not the expected alphabetic one, (first letter in an ALabelAlphabet can be 'nodeZ' and the last one 'aNode'), the order of labels is given w.r.t.
int	ALabel.EmptyLabel.compareTo(ALabel l)
ALabel	ALabel.conjunction(ALabel label)	Conjoins a-label to this and returns the result without modifying this.
ALabel	ALabel.EmptyLabel.conjunction(ALabel label)
boolean	ALabel.contains(ALabel label)	L1 contains L2 if L1 contains all a-letters of L2.
boolean	ALabel.EmptyLabel.contains(ALabel label)
static LabeledLowerCaseValue	LabeledLowerCaseValue.create(ALabel nodeName, int value, Label label)	Creates a lower-case value.
static String	LabeledALabelIntTreeMap.entryAsString(Label label, int value, ALabel nodeName)	entryAsString.
static String	LabeledLowerCaseValue.entryAsString(ALabel nodeN, int v, Label l, boolean lower)
final LabeledIntMap	LabeledALabelIntTreeMap.get(ALabel alabel)
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	LabeledALabelIntTreeMap.getValue(Label l, ALabel p)
ALabel	ALabel.intersect(ALabel label)
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.LabeledALabelIntTreeMapView.mergeTriple(String label, ALabel p, int i)	Object Read-only.
boolean	LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView.mergeTriple(String label, ALabel p, int i, 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	LabeledALabelIntTreeMap.mergeTriple(String label, ALabel p, int i)	Wrapper method.
boolean	LabeledALabelIntTreeMap.mergeTriple(String label, ALabel p, int i, boolean force)	Wrapper method to LabeledALabelIntTreeMap.mergeTriple(Label, ALabel, int, boolean).
LabeledIntTreeMap	LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView.put(ALabel alabel, LabeledIntMap labeledValueMap)	Object Read-only.
LabeledIntMap	LabeledALabelIntTreeMap.put(ALabel alabel, LabeledIntMap labeledValueMap)	Put a map associate to key alabel.
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.
void	ALabel.remove(ALabel aLabel)	It removes all a-letters in aLabel from the current label.
int	LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView.remove(Label l, ALabel p)	Object Read-only.
boolean	LabeledALabelIntTreeMap.remove(ALabel aleph)	remove.
int	LabeledALabelIntTreeMap.remove(Label l, ALabel p)