Lines Matching defs:solution
1619 // We save the current configuration -- if we fail to find a solution we will revert
1620 // to the initial state. The process of finding a solution modifies the configuration
1638 // The push solution includes the all apps button, this is not viable.
1660 // Due to the nature of the algorithm, the only check required to verify a valid solution
1729 // This method tries to find a reordering solution which satisfies the push mechanic by trying
1733 int[] direction, View ignoreView, ItemConfiguration solution) {
1741 ignoreView, solution)) {
1749 ignoreView, solution)) {
1761 ignoreView, solution)) {
1769 ignoreView, solution)) {
1781 ignoreView, solution)) {
1788 ignoreView, solution)) {
1795 // If we have failed to find a push solution with the above, then we try
1796 // to find a solution by pushing along the perpendicular axis.
1803 ignoreView, solution)) {
1811 ignoreView, solution)) {
1827 View ignoreView, ItemConfiguration solution) {
1836 CellAndSpan c = solution.map.get(ignoreView);
1844 for (View child: solution.map.keySet()) {
1846 CellAndSpan c = solution.map.get(child);
1857 solution.intersectingViews = new ArrayList<View>(mIntersectingViews);
1859 // First we try to find a solution which respects the push mechanic. That is,
1860 // we try to find a solution such that no displaced item travels through another item
1863 solution)) {
1869 solution)) {
1875 if (!addViewToTempLocation(v, mOccupiedRect, direction, solution)) {
1901 ItemConfiguration solution) {
1902 // Copy the current state into the solution. This solution will be manipulated as necessary.
1903 copyCurrentStateToSolution(solution, false);
1905 // manipulated as necessary to find a solution.
1917 solution);
1924 direction, dragView, false, solution);
1927 direction, dragView, true, solution);
1929 solution.isSolution = false;
1931 solution.isSolution = true;
1932 solution.cellX = result[0];
1933 solution.cellY = result[1];
1934 solution.spanX = spanX;
1935 solution.spanY = spanY;
1937 return solution;
1940 private void copyCurrentStateToSolution(ItemConfiguration solution, boolean temp) {
1951 solution.add(child, c);
1955 private void copySolutionToTempState(ItemConfiguration solution, View dragView) {
1963 CellAndSpan c = solution.map.get(child);
1972 mTmpOccupied.markCells(solution, true);
1975 private void animateItemsToSolution(ItemConfiguration solution, View dragView, boolean
1985 CellAndSpan c = solution.map.get(child);
1993 occupied.markCells(solution, true);
1999 private void beginOrAdjustReorderPreviewAnimations(ItemConfiguration solution,
2005 CellAndSpan c = solution.map.get(child);
2006 boolean skip = mode == ReorderPreviewAnimation.MODE_HINT && solution.intersectingViews
2007 != null && !solution.intersectingViews.contains(child);
2200 int spanX, int spanY, View dragView, ItemConfiguration solution) {
2206 copyCurrentStateToSolution(solution, false);
2207 solution.cellX = result[0];
2208 solution.cellY = result[1];
2209 solution.spanX = resultSpan[0];
2210 solution.spanY = resultSpan[1];
2211 solution.isSolution = true;
2213 solution.isSolution = false;
2215 return solution;
2330 // committing anything or animating anything as we just want to determine if a solution
2359 // direction vector, since we want the solution to match the preview, and it's possible
2376 // Find a solution involving pushing / displacing any items in the way
2386 // If the reorder solution requires resizing (shrinking) the item being dropped, we instead
2387 // favor a solution in which the item is not resized, but
2420 // committing anything or animating anything as we just want to determine if a solution
2847 // Check for a solution starting at every cell.
