Class SmallPrefixedNameSet
java.lang.Object
com.ctc.wstx.dtd.PrefixedNameSet
com.ctc.wstx.dtd.SmallPrefixedNameSet
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
PrefixedNameinstances 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.
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoidappendNames(StringBuilder sb, String sep) booleancontains(PrefixedName name) booleanMethods inherited from class PrefixedNameSet
toString, toString
-
Field Details
-
mNsAware
final boolean mNsAware -
mStrings
-
-
Constructor Details
-
SmallPrefixedNameSet
-
-
Method Details
-
hasMultiple
public boolean hasMultiple()- Specified by:
hasMultiplein classPrefixedNameSet- Returns:
- True if set contains more than one entry; false if not (empty or has one)
-
contains
- Specified by:
containsin classPrefixedNameSet- Returns:
- True if the set contains specified name; false if not.
-
appendNames
- Specified by:
appendNamesin classPrefixedNameSet
-