Package | Description |
---|---|
org.openjdk.jmc.common.item |
This package contains the
IItem data model. |
org.openjdk.jmc.common.unit |
This package contains the data model for quantities and units.
|
org.openjdk.jmc.common.util | |
org.openjdk.jmc.flightrecorder | |
org.openjdk.jmc.flightrecorder.internal | |
org.openjdk.jmc.flightrecorder.memleak | |
org.openjdk.jmc.flightrecorder.rules.util |
Modifier and Type | Method and Description |
---|---|
static <M extends Comparable<? super M>> |
ItemFilters.centerContainedIn(ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit)
Match a range according to
RangeMatchPolicy.CENTER_CONTAINED_IN_RIGHT_OPEN . |
static <M extends Comparable<? super M>> |
ItemFilters.matchRange(PersistableItemFilter.Kind kind,
ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit) |
static <M extends Comparable<? super M>> |
ItemFilters.matchRange(RangeMatchPolicy policy,
ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit) |
static <M extends Comparable<? super M>> |
ItemFilters.rangeContainedIn(ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit)
Match a range according to
RangeMatchPolicy.CONTAINED_IN_CLOSED . |
static <M extends Comparable<? super M>> |
ItemFilters.rangeIntersects(ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit)
Match a range according to
RangeMatchPolicy.CLOSED_INTERSECTS_WITH_CLOSED . |
Modifier and Type | Method and Description |
---|---|
static <M extends Comparable<? super M>> |
ItemFilters.centerContainedIn(ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit)
Match a range according to
RangeMatchPolicy.CENTER_CONTAINED_IN_RIGHT_OPEN . |
static <M extends Comparable<? super M>> |
ItemFilters.matchRange(PersistableItemFilter.Kind kind,
ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit) |
static <M extends Comparable<? super M>> |
ItemFilters.matchRange(RangeMatchPolicy policy,
ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit) |
static <M extends Comparable<? super M>> |
ItemFilters.rangeContainedIn(ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit)
Match a range according to
RangeMatchPolicy.CONTAINED_IN_CLOSED . |
static <M extends Comparable<? super M>> |
ItemFilters.rangeIntersects(ICanonicalAccessorFactory<IRange<M>> rangeAttribute,
IRange<M> rangeLimit)
Match a range according to
RangeMatchPolicy.CLOSED_INTERSECTS_WITH_CLOSED . |
Modifier and Type | Class and Description |
---|---|
class |
QuantityRange<U extends TypedUnit<U>>
A finite range of quantities.
|
Modifier and Type | Field and Description |
---|---|
static ContentType<IRange<IQuantity>> |
UnitLookup.TIMERANGE |
Modifier and Type | Method and Description |
---|---|
static <U extends TypedUnit<U>> |
QuantityRange.createPoint(IQuantity start) |
static <U extends TypedUnit<U>> |
QuantityRange.createWithEnd(IQuantity start,
IQuantity end) |
static <U extends TypedUnit<U>> |
QuantityRange.createWithExtent(IQuantity start,
ITypedQuantity<LinearUnit> extent) |
IRange<IQuantity> |
KindOfQuantity.getFirstBucket(IQuantity start,
IQuantity end,
double maxBuckets)
Divide the given range into at most
maxBuckets "naturally" aligned buckets, and
return the first one. |
protected IRange<IQuantity> |
KindOfQuantity.getFirstBucket(ITypedQuantity<U> start,
ITypedQuantity<U> end,
double maxBuckets) |
static IRange<IQuantity> |
QuantityRange.intersection(IRange<IQuantity> a,
IRange<IQuantity> b) |
abstract IRange<T> |
RangeContentType.rangeWithEnd(T start,
T end) |
Modifier and Type | Method and Description |
---|---|
IFormatter<IRange<IQuantity>> |
KindOfQuantity.getRangeFormatter(String formatHint)
Temporary helper to format quantity ranges.
|
Modifier and Type | Method and Description |
---|---|
abstract IFormatter<IQuantity> |
KindOfQuantity.getFormatterResolving(IRange<IQuantity> range)
Get a formatter with sufficient resolution to produce unique strings for both ends of
range , and consecutive equally spaced quantities. |
IFormatter<IQuantity> |
LinearKindOfQuantity.getFormatterResolving(IRange<IQuantity> range) |
static IRange<IQuantity> |
QuantityRange.intersection(IRange<IQuantity> a,
IRange<IQuantity> b) |
static IRange<IQuantity> |
QuantityRange.intersection(IRange<IQuantity> a,
IRange<IQuantity> b) |
Modifier and Type | Method and Description |
---|---|
static <T> IMemberAccessor<IRange<IQuantity>,T> |
MemberAccessorToolkit.pointRange(IMemberAccessor<IQuantity,T> point)
Create an accessor that constructs point ranges (ranges with zero extent) based on point
values.
|
static <T> IMemberAccessor<IRange<IQuantity>,T> |
MemberAccessorToolkit.rangeWithEnd(IMemberAccessor<IQuantity,T> start,
IMemberAccessor<IQuantity,T> end)
Create an accessor that constructs ranges based on start and end values.
|
static <T> IMemberAccessor<IRange<IQuantity>,T> |
MemberAccessorToolkit.rangeWithExtent(IMemberAccessor<IQuantity,T> start,
IMemberAccessor<IQuantity,T> extent)
Create an accessor that constructs ranges based on start and extent values.
|
static <T> IMemberAccessor<IRange<IQuantity>,T> |
MemberAccessorToolkit.rangeWithExtentEnd(IMemberAccessor<IQuantity,T> extent,
IMemberAccessor<IQuantity,T> end)
Create an accessor that constructs ranges based on end and extent values.
|
Modifier and Type | Method and Description |
---|---|
static <T,M extends Comparable<? super M>> |
PredicateToolkit.centerContained(IMemberAccessor<? extends IRange<M>,T> rangeAccessor,
IRange<M> limit)
Return a predicate based on
limit according to
RangeMatchPolicy.CENTER_CONTAINED_IN_RIGHT_OPEN . |
static <T,M extends Comparable<? super M>> |
PredicateToolkit.rangeContained(IMemberAccessor<? extends IRange<M>,T> rangeAccessor,
IRange<M> limit)
Return a predicate based on
limit according to
RangeMatchPolicy.CONTAINED_IN_CLOSED . |
static <T,M extends Comparable<? super M>> |
PredicateToolkit.rangeIntersects(IMemberAccessor<? extends IRange<M>,T> rangeAccessor,
IRange<M> limit)
Return a predicate based on
limit according to
RangeMatchPolicy.CLOSED_INTERSECTS_WITH_CLOSED . |
Modifier and Type | Method and Description |
---|---|
static <T,M extends Comparable<? super M>> |
PredicateToolkit.centerContained(IMemberAccessor<? extends IRange<M>,T> rangeAccessor,
IRange<M> limit)
Return a predicate based on
limit according to
RangeMatchPolicy.CENTER_CONTAINED_IN_RIGHT_OPEN . |
static <T,M extends Comparable<? super M>> |
PredicateToolkit.rangeContained(IMemberAccessor<? extends IRange<M>,T> rangeAccessor,
IRange<M> limit)
Return a predicate based on
limit according to
RangeMatchPolicy.CONTAINED_IN_CLOSED . |
static <T,M extends Comparable<? super M>> |
PredicateToolkit.rangeIntersects(IMemberAccessor<? extends IRange<M>,T> rangeAccessor,
IRange<M> limit)
Return a predicate based on
limit according to
RangeMatchPolicy.CLOSED_INTERSECTS_WITH_CLOSED . |
Modifier and Type | Field and Description |
---|---|
static IAttribute<IRange<IQuantity>> |
JfrAttributes.LIFETIME |
Modifier and Type | Method and Description |
---|---|
IRange<IQuantity> |
ChunkInfo.getChunkRange() |
Constructor and Description |
---|
ChunkInfo(long position,
long size,
IRange<IQuantity> range) |
Modifier and Type | Method and Description |
---|---|
int |
ReferenceTreeModel.getLeakCountInRange(IRange<IQuantity> timerange,
ReferenceTreeObject referenceTreeObject)
A helper method to calculate number of Referenced Object within specified period.
|
Collection<ReferenceTreeObject> |
ReferenceTreeModel.getLeakObjects(IRange<IQuantity> timerange) |
Collection<ReferenceTreeObject> |
ReferenceTreeModel.getRootObjects(IRange<IQuantity> timerange) |
Modifier and Type | Method and Description |
---|---|
static Pair<IQuantity,IRange<IQuantity>> |
SlidingWindowToolkit.slidingWindowUnorderedMinMaxValue(IItemCollection items,
IQuantity windowSize,
FutureTask<Result> cancellationSupplier,
SlidingWindowToolkit.IUnorderedWindowValueFunction<IQuantity> valueFunction,
boolean max,
boolean includeIntersecting)
Calculates max/min window quantity value of items.
|
static <V> Pair<V,IRange<IQuantity>> |
SlidingWindowToolkit.slidingWindowUnorderedMinMaxValue(IItemCollection items,
IQuantity windowSize,
FutureTask<Result> cancellationSupplier,
SlidingWindowToolkit.IUnorderedWindowValueFunction<V> valueFunction,
Comparator<V> valueComparator,
boolean max,
boolean includeIntersecting)
Calculates max/min window value of items.
|
static Pair<IQuantity,IRange<IQuantity>> |
SlidingWindowToolkit.slidingWindowUnorderedMinMaxValue(IItemCollection items,
IQuantity windowSize,
IQuantity slideSize,
FutureTask<Result> cancellationSupplier,
SlidingWindowToolkit.IUnorderedWindowValueFunction<IQuantity> valueFunction,
boolean max,
boolean includeIntersecting)
Calculates max/min window quantity value of items.
|
static <V> Pair<V,IRange<IQuantity>> |
SlidingWindowToolkit.slidingWindowUnorderedMinMaxValue(IItemCollection items,
IQuantity windowSize,
IQuantity slideSize,
FutureTask<Result> cancellationSupplier,
SlidingWindowToolkit.IUnorderedWindowValueFunction<V> valueFunction,
Comparator<V> valueComparator,
boolean max,
boolean includeIntersecting)
Calculates max/min window value of items.
|
Copyright © 2020. All rights reserved.