Modifier and Type | Method and Description |
---|---|
static <G,M> ConceptLattice<G,M> |
IPred.getConceptLattice(MatrixContext<G,M> cxt,
Set<Concept<G,M>> concepts) |
static <G,M> TimeTask<Void> |
IFox1.ignore(String id,
AdditiveConceptLayout<G,M> layout,
M m,
QualityMeasure<G,M,Pair<Concept<G,M>,Double>> conflictDistance,
AbstractExecutorService tpe) |
static <G,M> TimeTask<Void> |
IFox2.ignore(String id,
AdditiveConceptLayout<G,M> layout,
M m,
QualityMeasure<G,M,Pair<Concept<G,M>,Double>> conflictDistance,
ExecutorService tpe) |
static <G,M> TimeTask<Void> |
IFox1.select(String id,
AdditiveConceptLayout<G,M> layout,
M m,
QualityMeasure<G,M,Pair<Concept<G,M>,Double>> conflictDistance,
AbstractExecutorService tpe) |
static <G,M> TimeTask<Void> |
IFox2.select(String id,
AdditiveConceptLayout<G,M> layout,
M m,
QualityMeasure<G,M,Pair<Concept<G,M>,Double>> conflictDistance,
ExecutorService tpe) |
Modifier and Type | Method and Description |
---|---|
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosure.conceptsAndImplications(MatrixContext<G,M> cxt) |
static <G,M> Iterable<Either<Concept<G,M>,Implication<G,M>>> |
NextClosure.implications(MatrixContext<G,M> cxt) |
static <G,M> Iterable<Concept<G,M>> |
NextClosure.intents(MatrixContext<G,M> cxt) |
Iterator<Concept<G,M>> |
NextConcept.iterator() |
Modifier and Type | Field and Description |
---|---|
Set<Concept<G,M>> |
NextClosures1.Result.concepts |
Set<Concept<G,M>> |
NextClosuresState.concepts |
Set<Concept<G,M>> |
NextClosures1C.ResultC.concepts |
Modifier and Type | Method and Description |
---|---|
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2Bit.bitCleanedCompute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2Bit.bitCompute(Context<G,M> cxt) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2Bit.bitCompute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2Bit.bitReducedCompute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2.compute(Context<G,M> cxt,
Collection<Implication<G,M>>... backgroundKnowledge) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2.compute(Context<G,M> cxt,
ExecutorService executor,
Collection<Implication<G,M>>... backgroundKnowledge) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2.compute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled,
Collection<Implication<G,M>>... backgroundKnowledge) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2C.compute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled,
SetClosureOperator<M> constraint) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2C.compute(Context<G,M> cxt,
ExecutorService executor,
SetClosureOperator<M> constraint) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2.compute(Context<G,M> cxt,
int cores,
Collection<Implication<G,M>>... backgroundKnowledge) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2C.compute(Context<G,M> cxt,
int cores,
SetClosureOperator<M> constraint) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2C.compute(Context<G,M> cxt,
SetClosureOperator<M> constraint) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2.compute(Set<M> baseSet,
SetClosureOperator<M> clop,
Function<Set<M>,Set<G>> extension,
Predicate<Set<M>> monotoneBreakPredicate,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled,
Set<Implication<G,M>> backgroundKnowledge) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2.compute(Set<M> baseSet,
SetClosureOperator<M> clop,
Function<Set<M>,Set<G>> extension,
Set<Implication<G,M>> backgroundKnowledge) |
Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosuresState.getResultAndDispose() |
Modifier and Type | Method and Description |
---|---|
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2Bit.bitCleanedCompute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2Bit.bitCompute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2Bit.bitReducedCompute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2.compute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled,
Collection<Implication<G,M>>... backgroundKnowledge) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2C.compute(Context<G,M> cxt,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled,
SetClosureOperator<M> constraint) |
static <G,M> Pair<Set<Concept<G,M>>,Set<Implication<G,M>>> |
NextClosures2.compute(Set<M> baseSet,
SetClosureOperator<M> clop,
Function<Set<M>,Set<G>> extension,
Predicate<Set<M>> monotoneBreakPredicate,
ExecutorService executor,
Consumer<Concept<G,M>> conceptConsumer,
Consumer<Implication<G,M>> implicationConsumer,
Consumer<String> updateStatus,
Consumer<Double> updateProgress,
Supplier<Boolean> isCancelled,
Set<Implication<G,M>> backgroundKnowledge) |
Modifier and Type | Field and Description |
---|---|
javafx.collections.ObservableMap<M,Concept<G,M>> |
ConceptLattice.attributeConcepts |
javafx.collections.ObservableMap<G,Concept<G,M>> |
ConceptLattice.objectConcepts |
Modifier and Type | Method and Description |
---|---|
Concept<G,M> |
MatrixContext.attributeConcept(M m) |
Concept<G,M> |
MatrixContext.bottomConcept() |
Concept<G,M> |
Concept.clone() |
Concept<G,M> |
ConceptLattice.infimum(Concept<G,M>... concepts) |
Concept<G,M> |
ConceptLattice.infimum(Iterable<Concept<G,M>> concepts) |
Concept<G,M> |
MatrixContext.objectConcept(G g) |
Concept<G,M> |
ConceptLattice.supremum(Concept<G,M>... concepts) |
Concept<G,M> |
ConceptLattice.supremum(Iterable<Concept<G,M>> concepts) |
Concept<G,M> |
MatrixContext.topConcept() |
Modifier and Type | Method and Description |
---|---|
Set<Concept<G,M>> |
ConceptLattice.complement(Set<Concept<G,M>> concepts) |
Iterable<Concept<G,M>> |
MatrixContext.concepts() |
Set<Concept<G,M>> |
ConceptLattice.filter(Concept<G,M> concept) |
Set<Concept<G,M>> |
ConceptLattice.ideal(Concept<G,M> concept) |
Set<Concept<G,M>> |
ConceptLattice.interval(Concept<G,M> lower,
Concept<G,M> upper) |
Set<Concept<G,M>> |
ConceptLattice.lowerNeighbors(Concept<G,M> concept) |
Set<Concept<G,M>> |
ConceptLattice.upperNeighbors(Concept<G,M> concept) |
Modifier and Type | Method and Description |
---|---|
Set<M> |
ConceptLattice.attributeLabels(Concept<G,M> concept) |
int |
Concept.compareTo(Concept<G,M> concept) |
Set<Concept<G,M>> |
ConceptLattice.filter(Concept<G,M> concept) |
boolean |
Concept.greater(Concept<G,M> concept) |
boolean |
Concept.greaterEq(Concept<G,M> concept) |
default boolean |
Context.has(Concept<G,M> concept) |
Set<Concept<G,M>> |
ConceptLattice.ideal(Concept<G,M> concept) |
Concept<G,M> |
ConceptLattice.infimum(Concept<G,M>... concepts) |
Set<Concept<G,M>> |
ConceptLattice.interval(Concept<G,M> lower,
Concept<G,M> upper) |
Set<Concept<G,M>> |
ConceptLattice.interval(Concept<G,M> lower,
Concept<G,M> upper) |
Set<Concept<G,M>> |
ConceptLattice.lowerNeighbors(Concept<G,M> concept) |
Set<G> |
ConceptLattice.objectLabels(Concept<G,M> concept) |
boolean |
Concept.smaller(Concept<G,M> concept) |
boolean |
Concept.smallerEq(Concept<G,M> concept) |
Concept<G,M> |
ConceptLattice.supremum(Concept<G,M>... concepts) |
boolean |
Concept.uncomparable(Concept<G,M> concept) |
Set<Concept<G,M>> |
ConceptLattice.upperNeighbors(Concept<G,M> concept) |
Modifier and Type | Method and Description |
---|---|
Set<Concept<G,M>> |
ConceptLattice.complement(Set<Concept<G,M>> concepts) |
Concept<G,M> |
ConceptLattice.infimum(Iterable<Concept<G,M>> concepts) |
Concept<G,M> |
ConceptLattice.supremum(Iterable<Concept<G,M>> concepts) |
Modifier and Type | Field and Description |
---|---|
Concept<G,M> |
LayoutEvolution.Value.hint |
Modifier and Type | Field and Description |
---|---|
Map<Concept<G,M>,Concept<G,M>> |
ConceptLayout.generators |
Map<Concept<G,M>,Concept<G,M>> |
ConceptLayout.generators |
protected Map<Concept<G,M>,P> |
ConceptLayout.positionBindings |
Modifier and Type | Method and Description |
---|---|
static <G,M> QualityMeasure<G,M,Pair<Concept<G,M>,Double>> |
QualityMeasure.conflictDistance() |
Modifier and Type | Method and Description |
---|---|
void |
ConceptLayout.disposePosition(Concept<G,M> concept) |
P |
ConceptLayout.getOrAddPosition(Concept<G,M> concept) |
P |
ConceptLayout.getPosition(Concept<G,M> c) |
abstract void |
ConceptLayout.move(Concept<G,M> concept,
ConceptMovement movement,
javafx.geometry.Point3D delta) |
void |
AdditiveConceptLayout.move(Concept<G,M> concept,
ConceptMovement movement,
javafx.geometry.Point3D delta) |
void |
SimpleConceptLayout.move(Concept<G,M> concept,
ConceptMovement movement,
javafx.geometry.Point3D delta) |
protected abstract P |
ConceptLayout.newPositionBinding(Concept<G,M> concept) |
protected javafx.beans.binding.Binding<javafx.geometry.Point3D> |
AdditiveConceptLayout.newPositionBinding(Concept<G,M> concept) |
protected javafx.beans.property.SimpleObjectProperty<javafx.geometry.Point3D> |
SimpleConceptLayout.newPositionBinding(Concept<G,M> concept) |
Constructor and Description |
---|
LayoutEvolution(AdditiveConceptLayout<G,M> layout,
Concept<G,M> concept,
ConceptMovement movement,
double widthFactor,
double heightFactor,
int toSide,
int steps,
int zoomInto,
QualityMeasure<G,M,Pair<Concept<G,M>,Double>> conflictDistance,
ExecutorService tpe) |
Constructor and Description |
---|
LayoutEvolution(AdditiveConceptLayout<G,M> layout,
Concept<G,M> concept,
ConceptMovement movement,
double widthFactor,
double heightFactor,
int toSide,
int steps,
int zoomInto,
QualityMeasure<G,M,Pair<Concept<G,M>,Double>> conflictDistance,
ExecutorService tpe) |
Modifier and Type | Method and Description |
---|---|
void |
MatrixContextWidget.highlight(Concept<G,M> concept) |
Modifier and Type | Field and Description |
---|---|
javafx.collections.ObservableList<Concept<G,M>> |
FCADataset.concepts |
QualityMeasure<G,M,Pair<Concept<G,M>,Double>> |
FCADataset.conflictDistance |
Modifier and Type | Method and Description |
---|---|
LayoutEvolution<G,M> |
FCADataset.qualityChart(Concept<G,M> concept,
ConceptMovement movement) |
Modifier and Type | Method and Description |
---|---|
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.concept(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.filter(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.ideal(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.interval(Concept<G,M> lowerConcept,
Concept<G,M> upperConcept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.interval(Concept<G,M> lowerConcept,
Concept<G,M> upperConcept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.lowerNeighbors(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.strictFilter(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.strictIdeal(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.upperNeighbors(Concept<G,M> concept) |
Modifier and Type | Method and Description |
---|---|
abstract <G,M> String |
AttributeLabelText.get(Context<G,M> context,
ConceptLattice<G,M> lattice,
Concept<G,M> concept) |
abstract <G,M> String |
ObjectLabelText.get(Context<G,M> context,
ConceptLattice<G,M> lattice,
Concept<G,M> concept) |
abstract <G,M> double |
VertexRadius.get(Context<G,M> context,
ConceptLattice<G,M> lattice,
Concept<G,M> concept) |
Modifier and Type | Method and Description |
---|---|
abstract <G,M> double |
EdgeStroke.get(Context<G,M> context,
ConceptLattice<G,M> lattice,
Pair<Concept<G,M>,Concept<G,M>> concepts) |
abstract <G,M> double |
EdgeStroke.get(Context<G,M> context,
ConceptLattice<G,M> lattice,
Pair<Concept<G,M>,Concept<G,M>> concepts) |
Copyright © 2010–2023 Francesco Kriegel. All rights reserved.