How to use com.effektif.workflow.api.workflow.diagram

public Diagram addNode(String activityId, double ulx, double uly, double lrx, double lry) {
 ensureCanvas();
 canvas.addNode(new Node()
  .elementId(activityId)
  .bounds(new Bounds(ulx, uly, lrx, lry)));
 return this;
}

public Diagram addNodes(List<Node> nodes) {
 ensureCanvas();
 for (Node node : nodes) {
  canvas.addNode(node);
 }
 return this;
}

@Override
public int hashCode() {
 final int prime = 31;
 int result = 1;
 result = prime * result + ((lowerRight == null) ? 0 : lowerRight.hashCode());
 result = prime * result + ((upperLeft == null) ? 0 : upperLeft.hashCode());
 return result;
}

public Diagram addEdge(String transitionId, String fromId, String toId, Point...dockers) {
 return addEdge(new Edge()
  .transitionId(transitionId)
  .fromId(fromId)
  .toId(toId)
  .dockers(Arrays.asList(dockers)));
}

@Test
public void testSetBounds() {
 Bounds bounds = new Bounds(Point.of(1, 2), Point.of(3, 4));
 Node node = new Node();
 node.bounds(bounds);
 
 assertNotNull(bounds);
 assertEquals(new Bounds(Point.of(1, 2), Point.of(3, 4)), node.bounds);
 
 node.bounds(null);
 assertNull(node.bounds);
 
}
 

@Test
public void testSetCanvas() {
 Diagram diagram = Diagram.newInstance();
 assertNotNull(diagram.canvas);
 Node canvas = new Node().bounds(Bounds.of(1.0, 2.0, 3.0, 4.0));
 assertNotEquals(canvas, diagram.canvas);
 diagram.canvas(canvas);
 assertEquals(canvas, diagram.canvas);
 
 diagram.canvas(null);
 assertNull(diagram.canvas);
}
 

protected void ensureCanvas() {
 if (this.canvas == null) {
  this.canvas(new Node());
 }
 if (this.version == null) {
  this.version = 1l;
 }
 if (this.edges == null) {
  this.edges = new ArrayList<>();
 }
}
 

public static Diagram newInstance() {
 Diagram diagram = new Diagram();
 diagram.ensureCanvas();
 return diagram;
}
 

public Bounds(double ulx, double uly, double lrx, double lry) {
 this.upperLeft = new Point(ulx, uly);
 this.lowerRight = new Point(lrx, lry);
}

public Node getNode(String id) {
 if (canvas != null) {
  return canvas.getChild(id);
 }
 return null;
}

public boolean isValid() {
 // we don't check the canvas for validaty only the children
 // the canvas itself won't be valid because its bounds are zero
 if (canvas != null && canvas.children != null) {
  for (Node node : canvas.children) {
   if (!node.isValid()) {
    return false;
   }
  }
 }
 return true;
}

public Bounds(Point upperLeft, double width, double height) {
 this.upperLeft = upperLeft;
 this.lowerRight = upperLeft.translate(width, height);
}

public Diagram addEdge(String transitionId, String fromId, String toId, Point...dockers) {
 return addEdge(new Edge()
  .transitionId(transitionId)
  .fromId(fromId)
  .toId(toId)
  .dockers(Arrays.asList(dockers)));
}

public Diagram addNode(String activityId, double ulx, double uly, double lrx, double lry) {
 ensureCanvas();
 canvas.addNode(new Node()
  .elementId(activityId)
  .bounds(new Bounds(ulx, uly, lrx, lry)));
 return this;
}

protected void ensureCanvas() {
 if (this.canvas == null) {
  this.canvas(new Node());
 }
 if (this.version == null) {
  this.version = 1l;
 }
 if (this.edges == null) {
  this.edges = new ArrayList<>();
 }
}
 

public static Diagram newInstance() {
 Diagram diagram = new Diagram();
 diagram.ensureCanvas();
 return diagram;
}
 

public Diagram addNodes(List<Node> nodes) {
 ensureCanvas();
 for (Node node : nodes) {
  canvas.addNode(node);
 }
 return this;
}

@Override
public int hashCode() {
 final int prime = 31;
 int result = 1;
 result = prime * result + ((lowerRight == null) ? 0 : lowerRight.hashCode());
 result = prime * result + ((upperLeft == null) ? 0 : upperLeft.hashCode());
 return result;
}

public Node getNode(String id) {
 if (canvas != null) {
  return canvas.getChild(id);
 }
 return null;
}

public boolean isValid() {
 // we don't check the canvas for validaty only the children
 // the canvas itself won't be valid because its bounds are zero
 if (canvas != null && canvas.children != null) {
  for (Node node : canvas.children) {
   if (!node.isValid()) {
    return false;
   }
  }
 }
 return true;
}