Lines Matching defs:an
659 // Thus, there should always be an equally short path that
847 // Check we don't have an apparent infinite connector path.
1343 // The segments share an endpoint -- a1==b1.
1552 Avoid::Point& an = *(c_path[i]);
1555 vecDir(*c_path[i - 1], an,
1557 VertID vID(an.id, true, an.vn);
1567 bool orderSwapped = (*pointOrders)[an].addPoints(
1568 &bn, &an, reversed);
1597 Avoid::Point& an = *(c_path[i]);
1599 COLA_ASSERT(an == bn);
1617 int orientation = (ap.x == an.x) ? 0 : 1;
1619 //printf("1: %X, %X\n", (int) &(bn), (int) &(an));
1620 bool orderSwapped = (*pointOrders)[an].addPoints(
1623 std::make_pair(&an, connConnRef),
1698 // Crossing shouldn't be at an endpoint.