:root selector in CSS. Its specificity is (0,0,1,0).
|Modifier and Type||Field and Description|
Root selector singleton to avoid creating several ones.
|Modifier and Type||Method and Description|
Checks whether or not this selector applies to the given widget.
Indicates whether some other object is "equal to" this one.
Returns the specificity of this selector.
Returns a hash code value for the object.
public static final RootSelector ROOT_SELECTOR
public boolean appliesToWidget(Widget widget)
equals method implements an equivalence relation on non-null object references:
trueif and only if
y, multiple invocations of
trueor consistently return
false, provided no information used in
equalscomparisons on the objects is modified.
equals method for class
Object implements the most discriminating possible
equivalence relation on objects; that is, for any non-null reference values
y, this method returns
true if and only if
y refer to the
same object (
x == y has the value
Note that it is generally necessary to override the
hashCode method whenever this method
is overridden, so as to maintain the general contract for the
hashCode method, which
states that equal objects must have equal hash codes.
public int getSpecificity()
The specificity allows to determine in which order the rules of a stylesheet should be applied.
A specificity is composed of four numbers (defined by CSS2 specification):
SelectorHelperprovides a method to compute the specificity of a selector.
public int hashCode()
The general contract of
hashCodemethod must consistently return the same integer, provided no information used in
equalscomparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
equals(Object)method, then calling the
hashCodemethod on each of the two objects must produce the same integer result.
Object.equals(java.lang.Object)method, then calling the
hashCodemethod on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.
As much as is reasonably practical, the hashCode method defined by class
return distinct integers for distinct objects. (This is typically implemented by converting the
internal address of the object into an integer, but this implementation technique is not required
by the JavaTM programming language.)