Methods Summary |
---|
public boolean | add(javax.accessibility.AccessibleRelation relation)Adds a new relation to the current relation set. If the relation
is already in the relation set, the target(s) of the specified
relation is merged with the target(s) of the existing relation.
Otherwise, the new relation is added to the relation set.
if (relations == null) {
relations = new Vector();
}
// Merge the relation targets if the key exists
AccessibleRelation existingRelation = get(relation.getKey());
if (existingRelation == null) {
relations.addElement(relation);
return true;
} else {
Object [] existingTarget = existingRelation.getTarget();
Object [] newTarget = relation.getTarget();
int mergedLength = existingTarget.length + newTarget.length;
Object [] mergedTarget = new Object[mergedLength];
for (int i = 0; i < existingTarget.length; i++) {
mergedTarget[i] = existingTarget[i];
}
for (int i = existingTarget.length, j = 0;
i < mergedLength;
i++, j++) {
mergedTarget[i] = newTarget[j];
}
existingRelation.setTarget(mergedTarget);
}
return true;
|
public void | addAll(javax.accessibility.AccessibleRelation[] relations)Adds all of the relations to the existing relation set. Duplicate
entries are ignored.
if (relations.length != 0) {
if (this.relations == null) {
this.relations = new Vector(relations.length);
}
for (int i = 0; i < relations.length; i++) {
add(relations[i]);
}
}
|
public void | clear()Removes all the relations from the current relation set.
if (relations != null) {
relations.removeAllElements();
}
|
public boolean | contains(java.lang.String key)Returns whether the relation set contains a relation
that matches the specified key.
return get(key) != null;
|
public javax.accessibility.AccessibleRelation | get(java.lang.String key)Returns the relation that matches the specified key.
if (relations == null) {
return null;
} else {
int len = relations.size();
for (int i = 0; i < len; i++) {
AccessibleRelation relation =
(AccessibleRelation)relations.elementAt(i);
if (relation != null && relation.getKey().equals(key)) {
return relation;
}
}
return null;
}
|
public boolean | remove(javax.accessibility.AccessibleRelation relation)Removes a relation from the current relation set. If the relation
is not in the set, the relation set will be unchanged and the
return value will be false. If the relation is in the relation
set, it will be removed from the set and the return value will be
true.
if (relations == null) {
return false;
} else {
return relations.removeElement(relation);
}
|
public int | size()Returns the number of relations in the relation set.
if (relations == null) {
return 0;
} else {
return relations.size();
}
|
public javax.accessibility.AccessibleRelation[] | toArray()Returns the current relation set as an array of AccessibleRelation
if (relations == null) {
return new AccessibleRelation[0];
} else {
AccessibleRelation[] relationArray
= new AccessibleRelation[relations.size()];
for (int i = 0; i < relationArray.length; i++) {
relationArray[i] = (AccessibleRelation) relations.elementAt(i);
}
return relationArray;
}
|
public java.lang.String | toString()Creates a localized String representing all the relations in the set
using the default locale.
String ret = "";
if ((relations != null) && (relations.size() > 0)) {
ret = ((AccessibleRelation) (relations.elementAt(0))).toDisplayString();
for (int i = 1; i < relations.size(); i++) {
ret = ret + ","
+ ((AccessibleRelation) (relations.elementAt(i))).
toDisplayString();
}
}
return ret;
|