Package | Description |
---|---|
org.processmining.servicelevelagreements.model.eventdatabase | |
org.processmining.servicelevelagreements.model.interval |
Modifier and Type | Method and Description |
---|---|
IntervalList |
EventDatabase.holdsFor(java.lang.String fluent,
java.lang.String arguments,
java.lang.String value)
Queries the database for holdsFor(F(A, I) and returns I.
|
IntervalList |
IEventDatabase.holdsFor(java.lang.String fluent,
java.lang.String arguments,
java.lang.String value) |
Modifier and Type | Method and Description |
---|---|
java.util.Map<java.lang.String,com.google.common.collect.Table<java.lang.String,java.lang.String,IntervalList>> |
EventDatabase.getFluentValueMVIs() |
java.util.Map<java.lang.String,com.google.common.collect.Table<java.lang.String,java.lang.String,IntervalList>> |
IEventDatabase.getFluentValueMVIs() |
Modifier and Type | Method and Description |
---|---|
void |
EventDatabase.set(java.lang.String fluent,
java.lang.String arguments,
java.lang.String value,
IntervalList list)
Will set the fluent F(A) to value V for the list of intervals L.
|
void |
IEventDatabase.set(java.lang.String fluent,
java.lang.String arguments,
java.lang.String value,
IntervalList list) |
Modifier and Type | Method and Description |
---|---|
void |
EventDatabase.setFluentValueMVIs(java.util.Map<java.lang.String,com.google.common.collect.Table<java.lang.String,java.lang.String,IntervalList>> fluentMVIs) |
void |
IEventDatabase.setFluentValueMVIs(java.util.Map<java.lang.String,com.google.common.collect.Table<java.lang.String,java.lang.String,IntervalList>> fluentValueMVIs) |
Modifier and Type | Method and Description |
---|---|
static IntervalList |
IntervalUtils.intersect_all(java.util.List<IntervalList> L)
Computes the list of maximal intervals I such that I is the intersection
of the lists of intervals of list L.
|
protected static IntervalList |
IntervalUtils.intersect(IntervalList L1,
IntervalList L2)
Computes the list of maximal intervals I such that I is the intersection
between the two lists of intervals L1 and L2.
|
protected static IntervalList |
IntervalUtils.intersect(IntervalList head,
java.util.List<IntervalList> tail)
Computes the list of maximal intervals I such that I is the intersection
between the head and every element of the tail.
|
protected static IntervalList |
IntervalUtils.minus(IntervalList I,
IntervalList J)
Computes the list of maximal intervals M such that M = I / J.
|
static IntervalList |
IntervalUtils.relative_complement_all(IntervalList Iprime,
java.util.List<IntervalList> L)
Computes the list of maximal intervals I such that I is the relative
complement of the list of maximal intervals J with respect to the maximal
intervals of list L.
|
protected static IntervalList |
IntervalUtils.remove_empty_intervals(IntervalList L)
Computes the list I produced by removing empty intervals from the list L.
|
static IntervalList |
IntervalUtils.textToIntervalList(java.lang.String text) |
static IntervalList |
IntervalUtils.union_all(java.util.List<IntervalList> L)
Computes the list I of maximal intervals produced by the union of the
lists of maximal intervals of list L.
|
Modifier and Type | Method and Description |
---|---|
static java.util.List<IntervalList> |
IntervalUtils.textToListOfIntervalList(java.lang.String text) |
Modifier and Type | Method and Description |
---|---|
protected static IntervalList |
IntervalUtils.intersect(IntervalList L1,
IntervalList L2)
Computes the list of maximal intervals I such that I is the intersection
between the two lists of intervals L1 and L2.
|
protected static IntervalList |
IntervalUtils.intersect(IntervalList head,
java.util.List<IntervalList> tail)
Computes the list of maximal intervals I such that I is the intersection
between the head and every element of the tail.
|
protected static IntervalList |
IntervalUtils.minus(IntervalList I,
IntervalList J)
Computes the list of maximal intervals M such that M = I / J.
|
static IntervalList |
IntervalUtils.relative_complement_all(IntervalList Iprime,
java.util.List<IntervalList> L)
Computes the list of maximal intervals I such that I is the relative
complement of the list of maximal intervals J with respect to the maximal
intervals of list L.
|
protected static IntervalList |
IntervalUtils.remove_empty_intervals(IntervalList L)
Computes the list I produced by removing empty intervals from the list L.
|
Modifier and Type | Method and Description |
---|---|
static IntervalList |
IntervalUtils.intersect_all(java.util.List<IntervalList> L)
Computes the list of maximal intervals I such that I is the intersection
of the lists of intervals of list L.
|
protected static IntervalList |
IntervalUtils.intersect(IntervalList head,
java.util.List<IntervalList> tail)
Computes the list of maximal intervals I such that I is the intersection
between the head and every element of the tail.
|
static IntervalList |
IntervalUtils.relative_complement_all(IntervalList Iprime,
java.util.List<IntervalList> L)
Computes the list of maximal intervals I such that I is the relative
complement of the list of maximal intervals J with respect to the maximal
intervals of list L.
|
static IntervalList |
IntervalUtils.union_all(java.util.List<IntervalList> L)
Computes the list I of maximal intervals produced by the union of the
lists of maximal intervals of list L.
|
Constructor and Description |
---|
IntervalList(IntervalList other) |