Lines Matching defs:arcs
1238 public Arc[] arcs;
1390 private void include(List<Arc> arcs, Interval key, MutableInt size,
1404 for (Arc arc : arcs) {
1411 arcs.add(new Arc(key, size));
1414 private void include(List<Arc> arcs, Interval key, MutableInt size) {
1415 include(arcs, key, size, true);
1418 // Group arcs by their first vertex, returning an array of arrays.
1419 // This is linear in the number of arcs.
1420 Arc[][] groupArcsByFirstVertex(Arc[] arcs) {
1424 for (Arc arc : arcs) {
1432 for (Arc arc : arcs) {
1440 private Arc[] topologicalSort(final Arc[] arcs) {
1442 Arc[] result = new Arc[arcs.length];
1444 Arc[][] arcsByVertex = groupArcsByFirstVertex(arcs);
1479 private Arc[] topologicalSort(List<Arc> arcs) {
1480 return topologicalSort(arcs.toArray(new Arc[arcs.size()]));
1527 if (arcs == null) {
1528 arcs = createArcs();
1534 return arcs;
1557 private String arcsToString(List<Arc> arcs) {
1561 for (Arc arc : arcs) {
1578 private void logError(String axisName, Arc[] arcs, boolean[] culprits0) {
1581 for (int c = 0; c < arcs.length; c++) {
1582 Arc arc = arcs[c];
1614 private boolean solve(Arc[] arcs, int[] locations) {
1615 return solve(arcs, locations, true);
1618 private boolean solve(Arc[] arcs, int[] locations, boolean modifyOnError) {
1623 for (int p = 0; p < arcs.length; p++) {
1629 for (int j = 0, length = arcs.length; j < length; j++) {
1630 changed |= relax(locations, arcs[j]);
1634 logError(axisName, arcs, originalCulprits);
1644 boolean[] culprits = new boolean[arcs.length];
1646 for (int j = 0, length = arcs.length; j < length; j++) {
1647 culprits[j] |= relax(locations, arcs[j]);
1655 for (int i = 0; i < arcs.length; i++) {
1657 Arc arc = arcs[i];
1895 arcs = null;
2228 In place of a HashMap from span to Int, use an array of key/value pairs - stored in Arcs.
