Lines Matching refs:solution
1488 // We save the current configuration -- if we fail to find a solution we will revert
1489 // to the initial state. The process of finding a solution modifies the configuration
1507 // The push solution includes the all apps button, this is not viable.
1529 // Due to the nature of the algorithm, the only check required to verify a valid solution
1598 // This method tries to find a reordering solution which satisfies the push mechanic by trying
1602 int[] direction, View ignoreView, ItemConfiguration solution) {
1610 ignoreView, solution)) {
1618 ignoreView, solution)) {
1630 ignoreView, solution)) {
1638 ignoreView, solution)) {
1650 ignoreView, solution)) {
1657 ignoreView, solution)) {
1664 // If we have failed to find a push solution with the above, then we try
1665 // to find a solution by pushing along the perpendicular axis.
1672 ignoreView, solution)) {
1680 ignoreView, solution)) {
1696 View ignoreView, ItemConfiguration solution) {
1705 CellAndSpan c = solution.map.get(ignoreView);
1713 for (View child: solution.map.keySet()) {
1715 CellAndSpan c = solution.map.get(child);
1726 solution.intersectingViews = new ArrayList<>(mIntersectingViews);
1728 // First we try to find a solution which respects the push mechanic. That is,
1729 // we try to find a solution such that no displaced item travels through another item
1732 solution)) {
1738 solution)) {
1744 if (!addViewToTempLocation(v, mOccupiedRect, direction, solution)) {
1770 ItemConfiguration solution) {
1771 // Copy the current state into the solution. This solution will be manipulated as necessary.
1772 copyCurrentStateToSolution(solution, false);
1774 // manipulated as necessary to find a solution.
1786 solution);
1793 direction, dragView, false, solution);
1796 direction, dragView, true, solution);
1798 solution.isSolution = false;
1800 solution.isSolution = true;
1801 solution.cellX = result[0];
1802 solution.cellY = result[1];
1803 solution.spanX = spanX;
1804 solution.spanY = spanY;
1806 return solution;
1809 private void copyCurrentStateToSolution(ItemConfiguration solution, boolean temp) {
1820 solution.add(child, c);
1824 private void copySolutionToTempState(ItemConfiguration solution, View dragView) {
1832 CellAndSpan c = solution.map.get(child);
1841 mTmpOccupied.markCells(solution, true);
1844 private void animateItemsToSolution(ItemConfiguration solution, View dragView, boolean
1854 CellAndSpan c = solution.map.get(child);
1862 occupied.markCells(solution, true);
1868 private void beginOrAdjustReorderPreviewAnimations(ItemConfiguration solution,
1874 CellAndSpan c = solution.map.get(child);
1875 boolean skip = mode == ReorderPreviewAnimation.MODE_HINT && solution.intersectingViews
1876 != null && !solution.intersectingViews.contains(child);
2091 int spanX, int spanY, View dragView, ItemConfiguration solution) {
2097 copyCurrentStateToSolution(solution, false);
2098 solution.cellX = result[0];
2099 solution.cellY = result[1];
2100 solution.spanX = resultSpan[0];
2101 solution.spanY = resultSpan[1];
2102 solution.isSolution = true;
2104 solution.isSolution = false;
2106 return solution;
2217 // committing anything or animating anything as we just want to determine if a solution
2246 // direction vector, since we want the solution to match the preview, and it's possible
2263 // Find a solution involving pushing / displacing any items in the way
2273 // If the reorder solution requires resizing (shrinking) the item being dropped, we instead
2274 // favor a solution in which the item is not resized, but
2307 // committing anything or animating anything as we just want to determine if a solution
2732 // Check for a solution starting at every cell.
