congrats Icon
New! Announcing our next generation AI code completions
Read here
Tabnine Logo
org.apache.tinkerpop.gremlin.process.computer
Code IndexAdd Tabnine to your IDE (free)

How to use org.apache.tinkerpop.gremlin.process.computer

Best Java code snippets using org.apache.tinkerpop.gremlin.process.computer (Showing top 20 results out of 315)

origin: thinkaurelius/titan

@Override
public boolean terminate(Memory memory)
{
  return memory.getIteration() > 1;
}
origin: thinkaurelius/titan

@Override
public boolean doStage(final Stage stage) {
  return stage.equals(Stage.MAP);
}
origin: thinkaurelius/titan

@Override
public void removeRelation(InternalRelation e) {
  throw GraphComputer.Exceptions.adjacentVertexPropertiesCanNotBeReadOrUpdated();
}
origin: JanusGraph/janusgraph

public FulgoraMemory(final VertexProgram<?> vertexProgram, final Set<MapReduce> mapReducers) {
  this.currentMap = new ConcurrentHashMap<>();
  this.previousMap = new ConcurrentHashMap<>();
  if (null != vertexProgram) {
    for (final MemoryComputeKey key : vertexProgram.getMemoryComputeKeys()) {
      this.memoryKeys.put(key.getKey(), key);
    }
  }
  for (final MapReduce mapReduce : mapReducers) {
    this.memoryKeys.put(mapReduce.getMemoryKey(), MemoryComputeKey.of(mapReduce.getMemoryKey(), Operator.assign, false, false));
  }
}
origin: JanusGraph/janusgraph

@Override
public <R> R get(final String key) throws IllegalArgumentException {
  final R r = (R) this.previousMap.get(key);
  if (null == r)
    throw Memory.Exceptions.memoryDoesNotExist(key);
  else if (this.inExecute && !this.memoryKeys.get(key).isBroadcast())
    throw Memory.Exceptions.memoryDoesNotExist(key);
  else
    return r;
}
origin: thinkaurelius/titan

@Override
public <R> R get(final String key) throws IllegalArgumentException {
  final R r = (R) this.previousMap.get(key);
  if (null == r)
    throw Memory.Exceptions.memoryDoesNotExist(key);
  else
    return r;
}
origin: JanusGraph/janusgraph

@Override
public GraphComputer edges(final Traversal<Vertex, Edge> edgeFilter) {
  this.graphFilter.setEdgeFilter(edgeFilter);
  return this;
}
origin: JanusGraph/janusgraph

@Override
public GraphComputer vertices(final Traversal<Vertex, Vertex> vertexFilter) {
  this.graphFilter.setVertexFilter(vertexFilter);
  return this;
}
origin: thinkaurelius/titan

@Override
public TitanEdge addEdge(String s, Vertex vertex, Object... keyValues) {
  throw GraphComputer.Exceptions.adjacentVertexEdgesAndVerticesCanNotBeReadOrUpdated();
}
origin: thinkaurelius/titan

@Override
public final void accessEdges() {
  throw GraphComputer.Exceptions.incidentAndAdjacentElementsCanNotBeAccessedInMapReduce();
}
origin: thinkaurelius/titan

@Override
public void accessSetProperty() {
  throw GraphComputer.Exceptions.vertexPropertiesCanNotBeUpdatedInMapReduce();
}
origin: thinkaurelius/titan

@Override
public boolean terminate(Memory memory) {
  return memory.getIteration() >= maxIterations;
}
origin: thinkaurelius/titan

@Override
public final void accessProperties() {
  throw GraphComputer.Exceptions.adjacentVertexPropertiesCanNotBeReadOrUpdated();
}
origin: thinkaurelius/titan

@Override
public boolean doStage(final Stage stage) {
  return stage.equals(Stage.MAP);
}
origin: thinkaurelius/titan

@Override
public boolean terminate(Memory memory) {
  return memory.getIteration()>=length;
}
origin: thinkaurelius/titan

@Override
public boolean addRelation(InternalRelation e) {
  throw GraphComputer.Exceptions.adjacentVertexPropertiesCanNotBeReadOrUpdated();
}
origin: thinkaurelius/titan

@Override
public boolean terminate(final Memory memory) {
  return memory.getIteration() >= this.maxDepth;
}
origin: thinkaurelius/titan

@Override
public final void accessEdges() {
  throw GraphComputer.Exceptions.adjacentVertexPropertiesCanNotBeReadOrUpdated();
}
origin: JanusGraph/janusgraph

@Override
public boolean terminate(Memory memory)
{
  return memory.getIteration() > 1;
}
origin: thinkaurelius/titan

@Override
public void accessSetProperty() {
  throw GraphComputer.Exceptions.adjacentVertexPropertiesCanNotBeReadOrUpdated();
}
org.apache.tinkerpop.gremlin.process.computer

Most used classes

  • KeyValue
  • VertexProgram
    A VertexProgram represents one component of a distributed graph computation. Each vertex in the grap
  • GraphComputer$Exceptions
  • MapReduce
    A MapReduce is composed of map(), combine(), and reduce() stages. The map() stage processes the vert
  • Memory$Exceptions
  • MessageScope$Local,
  • VertexProgramHelper,
  • GraphFilter,
  • MemoryHelper,
  • ComputerResult,
  • MessageScope$Global,
  • Messenger,
  • VertexComputeKey,
  • MapReduce$MapEmitter,
  • Memory,
  • MessageCombiner,
  • ComputerGraph,
  • DefaultComputerResult,
  • GraphComputerHelper
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyStudentsTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now