Package | Description |
---|---|
org.openjdk.jmc.common.unit |
This package contains the data model for quantities and units.
|
Modifier and Type | Interface and Description |
---|---|
interface |
IPersister<T>
|
Modifier and Type | Class and Description |
---|---|
class |
ComparableConstraint<T extends Comparable<T>>
A
constraint that wraps a persister for Comparable
values, and constrains the allowed values with minimum and maximum values. |
class |
KindOfQuantity<U extends TypedUnit<U>> |
class |
LinearKindOfQuantity
The kind of a linear (scalar) physical quantity.
|
class |
WrappingPersister<T> |
Modifier and Type | Field and Description |
---|---|
protected IConstraint<?> |
SimpleConstrainedMap.fallback |
Modifier and Type | Field and Description |
---|---|
protected Map<K,IConstraint<?>> |
SimpleConstrainedMap.constraints |
Modifier and Type | Method and Description |
---|---|
IConstraint<T> |
WrappingPersister.combine(IConstraint<?> other) |
IConstraint<T> |
IConstraint.combine(IConstraint<?> other)
Return a constraint that honors both this constraint and
other , if such a constraint
would accept anything except null . |
IConstraint<IQuantity> |
KindOfQuantity.combine(IConstraint<?> other) |
static <U,T extends Comparable<T>> |
ComparableConstraint.constrain(IConstraint<U> constraint,
String persistedMin,
String persistedMax) |
static <U,T extends Comparable<T>> |
ComparableConstraint.constrain(IConstraint<U> constraint,
U min,
U max) |
IConstraint<T> |
IOptionDescriptor.getConstraint() |
abstract IConstraint<?> |
MutableConstrainedMap.getConstraint(K key) |
IConstraint<?> |
SimpleConstrainedMap.getConstraint(K key) |
IConstraint<?> |
IConstrainedMap.getConstraint(K key)
|
protected IConstraint<?> |
MutableConstrainedMap.getSuggestedConstraint(K key)
This method will only be called for keys for which
MutableConstrainedMap.getConstraint(Object) currently
returns null for. |
protected IConstraint<?> |
SimpleConstrainedMap.getSuggestedConstraint(K key) |
Modifier and Type | Method and Description |
---|---|
protected void |
MutableConstrainedMap.addConstraint(K key,
IConstraint<?> constraint) |
protected void |
SimpleConstrainedMap.addConstraint(K key,
IConstraint<?> constraint) |
ComparableConstraint<T> |
ComparableConstraint.combine(IConstraint<?> other) |
IConstraint<T> |
WrappingPersister.combine(IConstraint<?> other) |
IConstraint<T> |
IConstraint.combine(IConstraint<?> other)
Return a constraint that honors both this constraint and
other , if such a constraint
would accept anything except null . |
IConstraint<IQuantity> |
KindOfQuantity.combine(IConstraint<?> other) |
static <U,T extends Comparable<T>> |
ComparableConstraint.constrain(IConstraint<U> constraint,
String persistedMin,
String persistedMax) |
static <U,T extends Comparable<T>> |
ComparableConstraint.constrain(IConstraint<U> constraint,
U min,
U max) |
<T> void |
MutableConstrainedMap.put(K key,
IConstraint<T> constraint,
T value) |
<T> void |
IMutableConstrainedMap.put(K key,
IConstraint<T> constraint,
T value)
Map
key to value , if allowed according to constraint and additional
restrictions on this map such as a conflicting constraint being in effect
for this key . |
<T> void |
MutableConstrainedMap.putPersistedString(K key,
IConstraint<T> constraint,
String persisted) |
<T> void |
IMutableConstrainedMap.putPersistedString(K key,
IConstraint<T> constraint,
String persisted)
Map
key to the value obtained by parsing persisted , if allowed according to
constraint and additional restrictions on this map such as a conflicting
constraint being in effect for this key . |
Constructor and Description |
---|
SimpleConstrainedMap(IConstraint<?> fallback) |
SimpleConstrainedMap(Map<K,IConstraint<?>> constraints,
IConstraint<?> fallback) |
SimpleConstrainedMap(Map<K,IConstraint<?>> constraints,
IConstraint<?> fallback,
Map<K,Object> values) |
Constructor and Description |
---|
SimpleConstrainedMap(Map<K,IConstraint<?>> constraints,
IConstraint<?> fallback) |
SimpleConstrainedMap(Map<K,IConstraint<?>> constraints,
IConstraint<?> fallback,
Map<K,Object> values) |
Copyright © 2019. All rights reserved.