Lines Matching refs:edge
1621 void computeEdge(int which, int[] edge) {
1629 if (left < edge[j] || edge[j] < 0) {
1630 edge[j] = left;
1637 edge[j]) {
1638 edge[j] = right;
1645 if (top < edge[j] || edge[j] < 0) {
1646 edge[j] = top;
1653 if (bottom > edge[j]) {
1654 edge[j] = bottom;
1665 int[] edge = getEdge(whichEdge);
1670 if (edge[i] == cs.x + cs.spanX) {
1677 if (edge[i] == cs.x) {
1684 if (edge[i] == cs.y + cs.spanY) {
1691 if (edge[i] == cs.y) {
1805 public void sortConfigurationForEdgePush(int edge) {
1806 comparator.whichEdge = edge;
1820 // Determine the edge of the cluster that will be leading the push and how far
1854 // left edge, we consider sort the views by their right edge, from right to left.
1859 // For each view that isn't in the cluster, we see if the leading edge of the
1860 // cluster is contacting the edge of that view. If so, we add that view to the
