com.ctc.wstx.dtd
Class SmallPrefixedNameSet
java.lang.Object
com.ctc.wstx.dtd.PrefixedNameSet
com.ctc.wstx.dtd.SmallPrefixedNameSet
public final class SmallPrefixedNameSet
- extends PrefixedNameSet
PrefixedNameSet implementation suitable for storing small set of PrefixedName
values (generally 8 or less). Uses linear search, and is thus the
most compact presentation for a set
Notes about usage:
- All Strings contained in
PrefixedName
instances are assumed
interned, so that equality comparison can be done (both for values
stored and keys used)
- It is assumed that sets are never empty, ie. always contain at
least one entry.
- It is assumed that caller has ensured that there are no duplicates
in the set -- this data structure does no further validation.
SmallPrefixedNameSet
public SmallPrefixedNameSet(boolean nsAware,
PrefixedName[] names)
hasMultiple
public boolean hasMultiple()
- Specified by:
hasMultiple
in class PrefixedNameSet
- Returns:
- True if set contains more than one entry; false if not
(empty or has one)
contains
public boolean contains(PrefixedName name)
- Specified by:
contains
in class PrefixedNameSet
- Returns:
- True if the set contains specified name; false if not.
appendNames
public void appendNames(StringBuffer sb,
String sep)
- Specified by:
appendNames
in class PrefixedNameSet
Copyright © 2011 Codehaus. All Rights Reserved.