Lines Matching refs:edge
1633 void computeEdge(int which, int[] edge) {
1641 if (left < edge[j] || edge[j] < 0) {
1642 edge[j] = left;
1649 if (right > edge[j]) {
1650 edge[j] = right;
1657 if (top < edge[j] || edge[j] < 0) {
1658 edge[j] = top;
1665 if (bottom > edge[j]) {
1666 edge[j] = bottom;
1677 int[] edge = getEdge(whichEdge);
1682 if (edge[i] == cs.x + cs.spanX) {
1689 if (edge[i] == cs.x) {
1696 if (edge[i] == cs.y + cs.spanY) {
1703 if (edge[i] == cs.y) {
1817 public void sortConfigurationForEdgePush(int edge) {
1818 comparator.whichEdge = edge;
1832 // Determine the edge of the cluster that will be leading the push and how far
1866 // left edge, we consider sort the views by their right edge, from right to left.
1871 // For each view that isn't in the cluster, we see if the leading edge of the
1872 // cluster is contacting the edge of that view. If so, we add that view to the
