@Beta public final class LeafInterner extends Object
LeafNode
s which have low cardinality-- e.g. those which hold
boolean or enumeration values. Instances containing attributes are not interned.
Such objects have cardinality which is capped at the product of QNAMES * TYPE_CARDINALITY, where QNAMES is the total number of different QNames where the type is used and TYPE_CARDINALITY is the number of possible values for the type. Boolean has cardinality of 2, enumerations have cardinality equal to the number of enum statements.
The theory here is that we tend to have a large number (100K+) of entries in a few places, which could end up hogging the heap retained via the DataTree with duplicate objects (same QName, same value, different object). Using this utility, such objects will end up reusing the same object, preventing this overhead.
Modifier and Type | Method and Description |
---|---|
static <T extends LeafNode<?>> |
forSchema(@Nullable LeafSchemaNode schema)
Return a
LeafInterner for a particular schema. |
public static <T extends LeafNode<?>> @NonNull com.google.common.collect.Interner<T> forSchema(@Nullable LeafSchemaNode schema)
LeafInterner
for a particular schema. Interner instances must not be reused for leaves of
different types, otherwise they may produce unexpected results.schema
- The leaf node's schemaCopyright © 2019 OpenDaylight. All rights reserved.