Methods Summary |
---|
public static java.lang.String | dump(int[] states)
StringBuilder sb = new StringBuilder();
int count = states.length;
for (int i = 0; i < count; i++) {
switch (states[i]) {
case R.attr.state_window_focused:
sb.append("W ");
break;
case R.attr.state_pressed:
sb.append("P ");
break;
case R.attr.state_selected:
sb.append("S ");
break;
case R.attr.state_focused:
sb.append("F ");
break;
case R.attr.state_enabled:
sb.append("E ");
break;
}
}
return sb.toString();
|
public static boolean | isWildCard(int[] stateSetOrSpec)Return whether the stateSetOrSpec is matched by all StateSets.
return stateSetOrSpec.length == 0 || stateSetOrSpec[0] == 0;
|
public static boolean | stateSetMatches(int[] stateSpec, int[] stateSet)Return whether the stateSet matches the desired stateSpec.
if (stateSet == null) {
return (stateSpec == null || isWildCard(stateSpec));
}
int stateSpecSize = stateSpec.length;
int stateSetSize = stateSet.length;
for (int i = 0; i < stateSpecSize; i++) {
int stateSpecState = stateSpec[i];
if (stateSpecState == 0) {
// We've reached the end of the cases to match against.
return true;
}
final boolean mustMatch;
if (stateSpecState > 0) {
mustMatch = true;
} else {
// We use negative values to indicate must-NOT-match states.
mustMatch = false;
stateSpecState = -stateSpecState;
}
boolean found = false;
for (int j = 0; j < stateSetSize; j++) {
final int state = stateSet[j];
if (state == 0) {
// We've reached the end of states to match.
if (mustMatch) {
// We didn't find this must-match state.
return false;
} else {
// Continue checking other must-not-match states.
break;
}
}
if (state == stateSpecState) {
if (mustMatch) {
found = true;
// Continue checking other other must-match states.
break;
} else {
// Any match of a must-not-match state returns false.
return false;
}
}
}
if (mustMatch && !found) {
// We've reached the end of states to match and we didn't
// find a must-match state.
return false;
}
}
return true;
|
public static boolean | stateSetMatches(int[] stateSpec, int state)Return whether the state matches the desired stateSpec.
int stateSpecSize = stateSpec.length;
for (int i = 0; i < stateSpecSize; i++) {
int stateSpecState = stateSpec[i];
if (stateSpecState == 0) {
// We've reached the end of the cases to match against.
return true;
}
if (stateSpecState > 0) {
if (state != stateSpecState) {
return false;
}
} else {
// We use negative values to indicate must-NOT-match states.
if (state == -stateSpecState) {
// We matched a must-not-match case.
return false;
}
}
}
return true;
|
public static int[] | trimStateSet(int[] states, int newSize)
if (states.length == newSize) {
return states;
}
int[] trimmedStates = new int[newSize];
System.arraycopy(states, 0, trimmedStates, 0, newSize);
return trimmedStates;
|