public class GhostVertexRemover extends VertexJobConverter
VertexJobConverter.GraphProvider| Modifier and Type | Field and Description |
|---|---|
static String |
REMOVED_RELATION_COUNT |
static String |
REMOVED_VERTEX_COUNT |
static String |
SKIPPED_GHOST_LIMIT_COUNT |
GHOST_VERTEX_COUNT, graph, job, TRUNCATED_ENTRY_LISTS, tx, VERTEX_EXISTS_QUERY| Modifier | Constructor and Description |
|---|---|
|
GhostVertexRemover() |
protected |
GhostVertexRemover(GhostVertexRemover copy) |
|
GhostVertexRemover(TitanGraph graph) |
| Modifier and Type | Method and Description |
|---|---|
GhostVertexRemover |
clone()
Returns a clone of this ScanJob.
|
List<SliceQuery> |
getQueries()
Returns one or more
SliceQuery instances belonging to this ScanJob. |
void |
process(StaticBuffer key,
Map<SliceQuery,EntryList> entries,
ScanMetrics metrics)
Run this
ScanJob's computation on the supplied row-key and entries. |
void |
workerIterationStart(Configuration jobConfig,
Configuration graphConfig,
ScanMetrics metrics)
Invoked before a block of computation (i.e.
|
convert, convert, getKeyFilter, getVertexId, isGhostVertex, startTransaction, workerIterationEndpublic static final String REMOVED_RELATION_COUNT
public static final String REMOVED_VERTEX_COUNT
public static final String SKIPPED_GHOST_LIMIT_COUNT
public GhostVertexRemover(TitanGraph graph)
public GhostVertexRemover()
protected GhostVertexRemover(GhostVertexRemover copy)
public GhostVertexRemover clone()
ScanJobclone in interface ScanJobclone in class VertexJobConverterScanJobpublic void workerIterationStart(Configuration jobConfig, Configuration graphConfig, ScanMetrics metrics)
ScanJobcom.tinkerpop.gremlin.process.computer.VertexProgram#workerIterationStart()
This method may not be called if there is no data to be processed. Correspondingly, the end method won't be called either.
No-op default implementation.workerIterationStart in interface ScanJobworkerIterationStart in class VertexJobConverterjobConfig - configuration for this particular jobgraphConfig - configuration options for the entire graph against which this job is executedmetrics - ScanMetrics for this jobpublic void process(StaticBuffer key, Map<SliceQuery,EntryList> entries, ScanMetrics metrics)
ScanJobScanJob's computation on the supplied row-key and entries.
This method will be called by a client of this interface if and only if both of the following criteria are satisfied:
ScanJob.getKeyFilter() must evaluate to true
on the key.
entries parameter must contain an entry whose key is the first
SliceQuery returned by ScanJob.getQueries() and whose value
is an EntryList with at least size one. In other words, the
initial query in this job's query list must have matched at least once.
Implementations may assume these two conditions are satisfied. Calling this method when either of these two conditions is false yields undefined behavior.
It is the caller's responsibility to construct an entries map that
maps each SliceQuery to that query's matches.
The caller is also responsible for truncating the entries values
to honor BaseQuery.getLimit() when BaseQuery.hasLimit()
is true. Passing in an entries value longer than the limit set in
its respective key yields undefined behavior.
This method may be called by concurrent threads in a single process.
process in interface ScanJobprocess in class VertexJobConverterpublic List<SliceQuery> getQueries()
ScanJobSliceQuery instances belonging to this ScanJob.
Before calling
ScanJob.process(com.thinkaurelius.titan.diskstorage.StaticBuffer, java.util.Map, ScanMetrics),
users of this interface must check that the key in question contains at least one
entry matching the initial SliceQuery returned by this method. See the javadoc
for the process method for more information.
If this method returns more than one query, then the initial query's lower bound must
be all zero bits and the initial query's upper bound must be all one bits (per the
preconditions in StandardScannerExecutor, the reference ScanJob executor).
getQueries in interface ScanJobgetQueries in class VertexJobConverterCopyright © 2012–2015. All rights reserved.