53  * A layout that places its children in a rectangular <em>grid</em>.
55  * The grid is composed of a set of infinitely thin lines that separate the
58  * has {@code N + 1} grid indices that run from {@code 0}
69  * Each spec defines the set of rows or columns that are to be
73  * In this case however, there is no guarantee that children will not themselves
112  * is taken as <em>flexible</em> in that direction. If no alignment was set,
118  * within it are flexible. Row and column groups that sit either side of a common boundary
123  * gravity. To prevent a column from stretching, ensure that one of the components
127  * GridLayout's algorithms favour rows and columns that are closer to its <em>right</em>
134  * the policy of ignoring views that are marked as GONE outright. If, for example, a gone-marked
135  * view was alone in a column, that column would itself collapse to zero width if and only if
152  * When using either of these techniques, bear in mind that cell groups may be defined to overlap.
179      * The constant used to indicate that a value is undefined.
180      * Fields can use this value to indicate that their values
182      * to indicate that there is no suitable value that the implementation
200      * children that belong to a row group that uses {@link #TOP} alignment will
215      * the quantity {@code top - layoutParams.topMargin} is the same for all children that
216      * belong to a row group that uses {@link #TOP} alignment.
360      * Returns the current number of rows. This is either the last value that was set
393      * Returns the current number of columns. This is either the last value that was set
522      * so that their associated grid indices are in ascending order in the view.
558      * so that their associated grid indices are in ascending order in the view.
579      * Return the printer that will log diagnostics from this layout.
590      * Set the printer that will log diagnostics from this layout.
717     // Logic to avert infinite loops by ensuring that the cells can be placed somewhere.
727     // install default indices for cells that don't define them
1184                 // we must include views that are GONE here, see introductory javadoc
1200                 // we must include views that are GONE here, see introductory javadoc
1384             // Add the container constraints. Use the version of include that allows
1398             // getting the links validates the values that are shared by the arc list
1487         This is a special case of the Linear Programming problem that is, in turn,
1581                 // translate all the values so that they measure the distance from a[0]; the
1606             // between vertices 0 and N, assuming that locations[0] = 0.
1686      * and together specify the four grid indices that delimit the cells of this cell group.
1717      *          indicate that a default value should be computed on demand. </li>
1721      *          indicate that a default value should be computed on demand. </li>
1725      *          indicate that a default value should be computed on demand. </li>
1729      *          indicate that a default value should be computed on demand. </li>
1778          * The spec that defines the vertical characteristics of the cell group
1792          * The spec that defines the horizontal characteristics of the cell group
1857         public LayoutParams(LayoutParams that) {
1858             super(that);
1859             this.rowSpec = that.rowSpec;
1860             this.columnSpec = that.columnSpec;
1881         // so that a layout manager default can be accessed post set up. We need this as, at the
1952             LayoutParams that = (LayoutParams) o;
1954             if (!columnSpec.equals(that.columnSpec)) return false;
1955             if (!rowSpec.equals(that.rowSpec)) return false;
2042     This data structure is used in place of a Map where we have an index that refers to the order
2044     in arrays of a length that is equal to the number of unique keys. We also maintain an
2047     Note that behavior differs from that of a LinkedHashMap in that repeated entries
2169      * An Interval represents a contiguous range of values that lie between
2177      * {@code x} such that {@code min <= x < max}.
2218          * @param that the object to compare this interval with
2224         public boolean equals(Object that) {
2225             if (this == that) {
2228             if (that == null || getClass() != that.getClass()) {
2232             Interval interval = (Interval) that;
2314          * @param that the object to compare this spec with
2320         public boolean equals(Object that) {
2321             if (this == that) {
2324             if (that == null || getClass() != that.getClass()) {
2328             Spec spec = (Spec) that;
2434      * so that the locations defined by the alignment values
2491      * Indicates that a view should be aligned with the <em>start</em>
2507      * Indicates that a view should be aligned with the <em>end</em>
2523      * Indicates that a view should be aligned with the <em>top</em>
2529      * Indicates that a view should be aligned with the <em>bottom</em>
2535      * Indicates that a view should be aligned with the <em>start</em>
2541      * Indicates that a view should be aligned with the <em>end</em>
2565      * Indicates that a view should be aligned with the <em>left</em>
2571      * Indicates that a view should be aligned with the <em>right</em>
2577      * Indicates that a view should be <em>centered</em> with the other views in its cell group.
2594      * Indicates that a view should be aligned with the <em>baselines</em>
2622                 including those that don't define a baseline.
2652      * Indicates that a view should expanded to fit the boundaries of its cell group.

Indexes created Sat Jul 12 06:09:29 CEST 2014