Lines Matching refs:left
291 // have. We ignore the left/right padding on CellLayout because it turns out in our design
302 // have. We ignore the left/right padding on CellLayout because it turns out in our design
344 void setOverScrollAmount(float r, boolean left) {
345 if (left && mOverScrollForegroundDrawable != mOverScrollLeft) {
347 } else if (!left && mOverScrollForegroundDrawable != mOverScrollRight) {
399 r.left = (int) (r.left * scale + 0.5f);
823 * Given a cell coordinate, return the point that represents the upper left corner of that cell
877 final int left = hStartPadding + cellX * (mCellWidth + mWidthGap);
879 result.set(left, top, left + (spanX * mCellWidth + (spanX - 1) * mWidthGap),
910 int left = getPaddingLeft();
912 int right = left + getWidth() - getPaddingLeft() - getPaddingRight();
914 r.set(left, top, right, bottom);
1169 * Estimate where the top left cell of the dragged item will land if it is dropped.
1171 * @param originX The X value of the top left corner of the item
1172 * @param originY The Y value of the top left corner of the item
1181 // pointToCellRounded takes the top left of a cell but will pad that with
1190 result[0] = Math.max(0, result[0]); // Snap to left
1216 // Find the top left corner of the rect the object will occupy
1220 int left = topLeft[0];
1227 left += lp.leftMargin;
1235 left += ((mCellWidth * spanX) + ((spanX - 1) * mWidthGap)
1241 left += dragOffset.x + ((mCellWidth * spanX) + ((spanX - 1) * mWidthGap)
1246 left += ((mCellWidth * spanX) + ((spanX - 1) * mWidthGap)
1256 r.set(left, top, left + dragOutline.getWidth(), top + dragOutline.getHeight());
1370 // to the center of the item, but we are searching based on the top-left cell, so
1371 // we translate the point over to correspond to the top-left.
1628 int left = cs.x;
1630 if (left < edge[j] || edge[j] < 0) {
1631 edge[j] = left;
1789 public int compare(View left, View right) {
1790 CellAndSpan l = config.map.get(left);
1825 pushDistance = clusterRect.right - rectOccupiedByPotentialDrop.left;
1828 pushDistance = rectOccupiedByPotentialDrop.right - clusterRect.left;
1855 // left edge, we consider sort the views by their right edge, from right to left.
1891 if (!fail && clusterRect.left >= 0 && clusterRect.right <= mCountX && clusterRect.top >= 0 &&
1931 int left = boundingRect.left;
1936 markCellsForView(c.x - left, c.y - top, c.spanX, c.spanY, blockOccupied, true);
1941 findNearestArea(boundingRect.left, boundingRect.top, boundingRect.width(),
1946 int deltaX = mTempLocation[0] - boundingRect.left;
1965 markCellsForView(r.left, r.top, r.width(), r.height(), occupied, value);
2452 those cells. Instead we use some heuristics to often lock the vector to up, down, left
2471 regionToRect(dropRegionRect.left, dropRegionRect.top, dropRegionRect.width(),
2786 * Finds the upper-left coordinate of the first rectangle in the grid that can
2910 * Called when drag has left this CellLayout or has been completed (successfully or not)
2947 * @param cellX X coordinate of upper left corner expressed as a cell position
2948 * @param cellY Y coordinate of upper left corner expressed as a cell position