50  * A layout that places its children in a rectangular <em>grid</em>.
52  * The grid is composed of a set of infinitely thin lines that separate the
55  * has {@code N + 1} grid indices that run from {@code 0}
66  * Each spec defines the set of rows or columns that are to be
70  * In this case however, there is no guarantee that children will not themselves
109  * is taken as <em>flexible</em> in that direction. If no alignment was set,
115  * within it are flexible. Row and column groups that sit either side of a common boundary
120  * gravity. To prevent a column from stretching, ensure that one of the components
124  * GridLayout's algorithms favour rows and columns that are closer to its <em>right</em>
138  * When using either of these techniques, bear in mind that cell groups may be defined to overlap.
165      * The constant used to indicate that a value is undefined.
166      * Fields can use this value to indicate that their values
168      * to indicate that there is no suitable value that the implementation
186      * children that belong to a row group that uses {@link #TOP} alignment will
201      * the quantity {@code top - layoutParams.topMargin} is the same for all children that
202      * belong to a row group that uses {@link #TOP} alignment.
321      * Returns the current number of rows. This is either the last value that was set
354      * Returns the current number of columns. This is either the last value that was set
483      * so that their associated grid indices are in ascending order in the view.
519      * so that their associated grid indices are in ascending order in the view.
651     // Logic to avert infinite loops by ensuring that the cells can be placed somewhere.
661     // install default indices for cells that don't define them
1369             // Add the container constraints. Use the version of include that allows
1383             // getting the links validates the values that are shared by the arc list
1472         This is a special case of the Linear Programming problem that is, in turn,
1482         fact that there can be no negative weight chains of length > N - unless a
1484         checking phase that reports failure.
1580                 // translate all the values so that they measure the distance from a[0]; the
1605             // between vertices 0 and N, assuming that locations[0] = 0.
1685      * and together specify the four grid indices that delimit the cells of this cell group.
1716      *          indicate that a default value should be computed on demand. </li>
1720      *          indicate that a default value should be computed on demand. </li>
1724      *          indicate that a default value should be computed on demand. </li>
1728      *          indicate that a default value should be computed on demand. </li>
1777          * The spec that defines the vertical characteristics of the cell group
1791          * The spec that defines the horizontal characteristics of the cell group
1856         public LayoutParams(LayoutParams that) {
1857             super(that);
1858             this.rowSpec = that.rowSpec;
1859             this.columnSpec = that.columnSpec;
1880         // so that a layout manager default can be accessed post set up. We need this as, at the
1951             LayoutParams that = (LayoutParams) o;
1953             if (!columnSpec.equals(that.columnSpec)) return false;
1954             if (!rowSpec.equals(that.rowSpec)) return false;
2041     This data structure is used in place of a Map where we have an index that refers to the order
2043     in arrays of a length that is equal to the number of unique keys. We also maintain an
2046     Note that behavior differs from that of a LinkedHashMap in that repeated entries
2167      * An Interval represents a contiguous range of values that lie between
2175      * {@code x} such that {@code min <= x < max}.
2216          * @param that the object to compare this interval with
2222         public boolean equals(Object that) {
2223             if (this == that) {
2226             if (that == null || getClass() != that.getClass()) {
2230             Interval interval = (Interval) that;
2312          * @param that the object to compare this spec with
2318         public boolean equals(Object that) {
2319             if (this == that) {
2322             if (that == null || getClass() != that.getClass()) {
2326             Spec spec = (Spec) that;
2418      * so that the locations defined by the alignment values
2474      * Indicates that a view should be aligned with the <em>start</em>
2490      * Indicates that a view should be aligned with the <em>end</em>
2506      * Indicates that a view should be aligned with the <em>top</em>
2512      * Indicates that a view should be aligned with the <em>bottom</em>
2518      * Indicates that a view should be aligned with the <em>start</em>
2524      * Indicates that a view should be aligned with the <em>end</em>
2544      * Indicates that a view should be aligned with the <em>left</em>
2550      * Indicates that a view should be aligned with the <em>right</em>
2556      * Indicates that a view should be <em>centered</em> with the other views in its cell group.
2573      * Indicates that a view should be aligned with the <em>baselines</em>
2598                 including those that don't define a baseline.
2628      * Indicates that a view should expanded to fit the boundaries of its cell group.

Indexes created Thu Feb 14 23:00:39 CET 2013