Lines Matching refs:arcs
1238 public Arc[] arcs;
1392 private void include(List<Arc> arcs, Interval key, MutableInt size,
1406 for (Arc arc : arcs) {
1413 arcs.add(new Arc(key, size));
1416 private void include(List<Arc> arcs, Interval key, MutableInt size) {
1417 include(arcs, key, size, true);
1420 // Group arcs by their first vertex, returning an array of arrays.
1421 // This is linear in the number of arcs.
1422 Arc[][] groupArcsByFirstVertex(Arc[] arcs) {
1426 for (Arc arc : arcs) {
1434 for (Arc arc : arcs) {
1442 private Arc[] topologicalSort(final Arc[] arcs) {
1444 Arc[] result = new Arc[arcs.length];
1446 Arc[][] arcsByVertex = groupArcsByFirstVertex(arcs);
1481 private Arc[] topologicalSort(List<Arc> arcs) {
1482 return topologicalSort(arcs.toArray(new Arc[arcs.size()]));
1529 if (arcs == null) {
1530 arcs = createArcs();
1536 return arcs;
1559 private String arcsToString(List<Arc> arcs) {
1563 for (Arc arc : arcs) {
1580 private void logError(String axisName, Arc[] arcs, boolean[] culprits0) {
1583 for (int c = 0; c < arcs.length; c++) {
1584 Arc arc = arcs[c];
1616 private boolean solve(Arc[] arcs, int[] locations) {
1617 return solve(arcs, locations, true);
1620 private boolean solve(Arc[] arcs, int[] locations, boolean modifyOnError) {
1625 for (int p = 0; p < arcs.length; p++) {
1631 for (int j = 0, length = arcs.length; j < length; j++) {
1632 changed |= relax(locations, arcs[j]);
1636 logError(axisName, arcs, originalCulprits);
1646 boolean[] culprits = new boolean[arcs.length];
1648 for (int j = 0, length = arcs.length; j < length; j++) {
1649 culprits[j] |= relax(locations, arcs[j]);
1657 for (int i = 0; i < arcs.length; i++) {
1659 Arc arc = arcs[i];
1899 arcs = null;
2234 In place of a HashMap from span to Int, use an array of key/value pairs - stored in Arcs.
