!7

sS text = [[
One node "A".
One node "B".
B to the right of A.
]];

static new TreeSet<S> nodes;
static new LinkedHashSet<Relation> relations;
static new LinkedHashSet<Relation> maybes;
static new TreeMap<S, Pt> coordinates;

p {
  for (S s : sentences(text)) {
    new Matches m;
    if "One node *"
      nodes.add($1);
    else if "* to the right of *"
      relations.add(new Relation("to the right of", $1, $2));
  }
  print("Got nodes: " + sfu(nodes));
  print("Got relations: " + sfu(relations));
  makeCoordinates();
  print("Got coordinates: " + sfu(coordinates));
  makeCAL().show();
}

svoid makeCoordinates {
  for (S node : nodes)
    coordinates.put(node, pt(random(100), random(100)));
  processRules();
}

svoid processRules {
  for (Relation r : cloneList(relations))
    if (r.is("to the right of")) {
      maybes.add(Relation("on same height as", r.a(), r.b()));
      Pt pa = coordinates.get(r.a()), pb = coordinates.get(r.b());
      if (pa != null && pb != null)
        pa.x = min(pa.x, pb.x+10);
    }
}

static CirclesAndLines makeCAL() {
  Rect r = mergeRects(map(f ptToRect, values(coordinates)));

  new CirclesAndLines cal;
  for (S node : keys(coordinates)) {
    Pt p = coordinates.get(node);
    double x = ((p.x-r.x)/(double) r.w)*0.9+0.05;
    double y = ((p.y-r.y)/(double) r.h)*0.9+0.05;
    cal.circle(node, x, y);
  }
  ret cal;
}