Lines Matching refs:edge
1608 void computeEdge(int which, int[] edge) {
1616 if (left < edge[j] || edge[j] < 0) {
1617 edge[j] = left;
1624 if (right > edge[j]) {
1625 edge[j] = right;
1632 if (top < edge[j] || edge[j] < 0) {
1633 edge[j] = top;
1640 if (bottom > edge[j]) {
1641 edge[j] = bottom;
1652 int[] edge = getEdge(whichEdge);
1657 if (edge[i] == cs.x + cs.spanX) {
1664 if (edge[i] == cs.x) {
1671 if (edge[i] == cs.y + cs.spanY) {
1678 if (edge[i] == cs.y) {
1792 public void sortConfigurationForEdgePush(int edge) {
1793 comparator.whichEdge = edge;
1807 // Determine the edge of the cluster that will be leading the push and how far
1841 // left edge, we consider sort the views by their right edge, from right to left.
1846 // For each view that isn't in the cluster, we see if the leading edge of the
1847 // cluster is contacting the edge of that view. If so, we add that view to the
