|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Match | |
---|---|
net.xqhs.graphs.context | The package contains classes and interfaces related to context representation, context patterns, and context matching. |
net.xqhs.graphs.matcher | This package contains the definition of the net.xqhs.graphs.matcher.GraphMatcher interface and the
GraphMatcherQuick implementation. |
net.xqhs.graphs.matchingPlatform | This package contains the definition of GraphMatchingPlatform and related classes. |
Uses of Match in net.xqhs.graphs.context |
---|
Methods in net.xqhs.graphs.context with parameters of type Match | |
---|---|
void |
ContinuousMatchingProcess.MatchNotificationReceiver.receiveMatchNotification(ContinuousMatchingProcess platform,
Match m)
The method is called by a ContinuousMatchingProcess when a match is detected that conforms to the
notification settings. |
Uses of Match in net.xqhs.graphs.matcher |
---|
Fields in net.xqhs.graphs.matcher with type parameters of type Match | |
---|---|
protected java.util.List<Match> |
GraphMatcherQuick.allMatches
A list of all generated matches. |
protected java.util.Iterator<Match> |
GraphMatcherQuick.matchIterator
An Iterator over GraphMatcherQuick.allMatches that keeps is used to remember the already-returned matches. |
protected java.util.PriorityQueue<Match> |
GraphMatcherQuick.matchQueue
The PriorityQueue of matches that still have merge candidates. |
(package private) java.util.Set<Match> |
Match.mergeCandidates
MC, matches that could possibly be merged with this one (i.e. |
(package private) java.util.Set<Match> |
Match.mergeOuterCandidates
MO, matches that could potentially merge with this one, but not immediately (they are not adjacent). |
Methods in net.xqhs.graphs.matcher that return Match | |
---|---|
protected Match |
GraphMatcherQuick.addInitialMatch(Edge e,
Edge eP,
java.lang.String matchID)
Create a single-edge match and add it to the matching queue; also add matches from the queue to its merge candidate list (as well as adding the match to other matches' merge candidates) |
protected Match |
GraphMatcherQuick.addMergeMatch(Match m1,
Match m2)
Merges two matches into one. |
Match |
GraphMatchingProcess.getNextMatch()
Searches for the next match with a k lower than or equal to the current threshold. |
Match |
GraphMatcherQuick.getNextMatch()
Searches for the next match with a k lower than or equal to the current threshold. |
Match |
Match.merge(Match m1,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
Merges two matches into a new one and returns the result. |
Methods in net.xqhs.graphs.matcher that return types with arguments of type Match | |
---|---|
java.util.List<Match> |
GraphMatchingProcess.getAllCompleteMatches()
The method returns all complete matches. |
java.util.List<Match> |
GraphMatcherQuick.getAllCompleteMatches()
|
java.util.List<Match> |
GraphMatchingProcess.getAllMatches(int k)
The method returns all matches with a k lower than or equal to the argument. |
java.util.List<Match> |
GraphMatcherQuick.getAllMatches(int k)
As with GraphMatcherQuick.getNextMatch() , satisfactory matches are searched in the list of existing matches. |
java.util.List<Match> |
GraphMatchingProcess.getBestMatches()
The method creates all matches and returns the set of matches with the best (lowest) k. |
java.util.List<Match> |
GraphMatcherQuick.getBestMatches()
|
protected java.util.List<Match> |
GraphMatcherQuick.growMatches(int threshold,
boolean stopAtFirstMatch)
Grows incrementally the list of matches, by merging existing matches from the match queue with their merge candidates. |
protected java.util.PriorityQueue<Match> |
GraphMatcherQuick.initializeMatchQueue()
The method initializes the match queue by creating an appropriate comparator (based on distances of edges to a start vertex). |
Methods in net.xqhs.graphs.matcher with parameters of type Match | |
---|---|
protected Match |
GraphMatcherQuick.addMergeMatch(Match m1,
Match m2)
Merges two matches into one. |
int |
Match.MatchComparator.compare(Match m1,
Match m2)
|
int |
GraphMatcherQuick.MatchSingleComparator.compare(Match m1,
Match m2)
|
Match.Candidacy |
Match.considerCandidate(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks if the given match is a merge candidate for this match, and if it is, the matches are added to the merge candidate lists of each other. |
MatchingVisualizer |
MatchingVisualizer.feedLine(Match m1,
Match m2,
Match m3,
java.lang.String comment)
Outputs a line of the matching process visualization to the canvas, consisting of three match, also adding the specified comment. |
MatchingVisualizer |
MatchingVisualizer.feedLine(Match m1,
Match m2,
java.lang.String comment)
Outputs a line of the matching process visualization to the canvas, consisting of two matches, also adding the specified comment. |
MatchingVisualizer |
MatchingVisualizer.feedLine(Match m1,
java.lang.String comment)
Outputs a line of the matching process visualization to the canvas, consisting of only one match, also adding the specified comment. |
Match.Candidacy |
Match.getCandidacy(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks whether another match can be considered as a candidate for merger with this match, and, if yes, what kind (see Match.Candidacy ). |
protected Match.Candidacy |
Match.getCandidacyInternal(Match mc,
MonitorPack monitor)
Internal method that tests candidacy status based solely on internal properties of the matches. |
protected void |
GraphMatcherQuick.invalidateMatch(Match m)
Relay for the invalidation of a match, since matches should only be invalidated by classes extending this class. |
Match |
Match.merge(Match m1,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
Merges two matches into a new one and returns the result. |
Method parameters in net.xqhs.graphs.matcher with type arguments of type Match | |
---|---|
Match.Candidacy |
Match.considerCandidate(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks if the given match is a merge candidate for this match, and if it is, the matches are added to the merge candidate lists of each other. |
Match.Candidacy |
Match.considerCandidate(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks if the given match is a merge candidate for this match, and if it is, the matches are added to the merge candidate lists of each other. |
MatchingVisualizer |
MatchingVisualizer.feedLine(java.util.List<Match> ms,
java.lang.String comment)
Outputs a line of the matching process visualization to the canvas, also adding the specified comment. |
Match.Candidacy |
Match.getCandidacy(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks whether another match can be considered as a candidate for merger with this match, and, if yes, what kind (see Match.Candidacy ). |
Match.Candidacy |
Match.getCandidacy(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks whether another match can be considered as a candidate for merger with this match, and, if yes, what kind (see Match.Candidacy ). |
Match |
Match.merge(Match m1,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
Merges two matches into a new one and returns the result. |
Match |
Match.merge(Match m1,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
Merges two matches into a new one and returns the result. |
Uses of Match in net.xqhs.graphs.matchingPlatform |
---|
Fields in net.xqhs.graphs.matchingPlatform with type parameters of type Match | |
---|---|
protected java.util.Map<Edge,java.util.Set<Match>> |
GraphMatcherPersistent.eMatchIndex
An index containing the matches that contain each graph edge. |
protected java.util.Map<Edge,java.util.Set<Match>> |
GraphMatcherPersistent.ePMatchIndex
An index containing the matches that contain each pattern edge. |
protected java.util.SortedSet<Match> |
GraphMatcherPersistent.sortedMatches
THe set of all matches, sorted by k (lowest k first). |
Methods in net.xqhs.graphs.matchingPlatform that return Match | |
---|---|
protected Match |
GraphMatcherPersistent.addInitialMatch(Edge e,
Edge eP,
java.lang.String matchID)
|
protected Match |
GraphMatcherPersistent.addMergeMatch(Match m1,
Match m2)
|
Methods in net.xqhs.graphs.matchingPlatform that return types with arguments of type Match | |
---|---|
java.util.Set<Match> |
GraphMatchingPlatform.getMatches(GraphPattern pattern,
int maxK)
Builds and returns the matches between the specified pattern and the principal graph (as it is in the current matching sequence). |
java.util.Set<Match> |
GMPImplementation.getMatches(GraphPattern pattern,
int maxK)
|
java.util.Set<Match> |
GraphMatchingPlatform.incrementSequence()
Builds and returns the full matches between the patterns and the principal graph with the next set of operations (transaction) applied, moving the matching sequence one step closer to the graph sequence. |
java.util.Set<Match> |
GMPImplementation.incrementSequence()
|
java.util.List<java.util.Map.Entry<java.lang.Integer,java.util.Set<Match>>> |
GraphMatchingPlatform.incrementSequence(int targetSequence)
Applies GraphMatchingPlatform.incrementSequence() until the matching process (matching sequence) reaches desired sequence of
the principal graph. |
java.util.List<java.util.Map.Entry<java.lang.Integer,java.util.Set<Match>>> |
GMPImplementation.incrementSequence(int targetSequence)
|
java.util.List<java.util.Map.Entry<java.lang.Integer,java.util.Set<Match>>> |
GraphMatchingPlatform.incrementSequenceFastForward()
Applies GraphMatchingPlatform.incrementSequence() until the matching process is synchronized with the principal graph. |
java.util.List<java.util.Map.Entry<java.lang.Integer,java.util.Set<Match>>> |
GMPImplementation.incrementSequenceFastForward()
|
Methods in net.xqhs.graphs.matchingPlatform with parameters of type Match | |
---|---|
protected Match |
GraphMatcherPersistent.addMergeMatch(Match m1,
Match m2)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |