1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
|
/* GridBagLayout - Layout manager for components according to GridBagConstraints
Copyright (C) 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
This file is part of GNU Classpath.
GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
GNU Classpath is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.
Linking this library statically or dynamically with other modules is
making a combined work based on this library. Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.
As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module. An independent module is a module which is not derived from
or based on this library. If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so. If you do not wish to do so, delete this
exception statement from your version. */
package java.awt;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Hashtable;
/**
* @author Michael Koch (konqueror@gmx.de)
* @author Jeroen Frijters (jeroen@frijters.net)
* @author Andrew John Hughes (gnu_andrew@member.fsf.org)
*/
public class GridBagLayout
implements Serializable, LayoutManager2
{
private static final long serialVersionUID = 8838754796412211005L;
protected static final int MINSIZE = 1;
protected static final int PREFERREDSIZE = 2;
protected static final int MAXGRIDSIZE = 512;
// comptable remembers the original contraints given to us.
// internalcomptable is used to keep track of modified constraint values
// that we calculate, particularly when we are given RELATIVE and
// REMAINDER constraints.
// Constraints kept in comptable are never modified, and constraints
// kept in internalcomptable can be modified internally only.
protected Hashtable<Component,GridBagConstraints> comptable;
private Hashtable<Component,GridBagConstraints> internalcomptable;
protected GridBagLayoutInfo layoutInfo;
protected GridBagConstraints defaultConstraints;
public double[] columnWeights;
public int[] columnWidths;
public double[] rowWeights;
public int[] rowHeights;
public GridBagLayout ()
{
this.comptable = new Hashtable<Component,GridBagConstraints>();
this.internalcomptable = new Hashtable<Component,GridBagConstraints>();
this.defaultConstraints= new GridBagConstraints();
}
/**
* Helper method to calc the sum of a range of elements in an int array.
*/
private int sumIntArray (int[] array, int upto)
{
int result = 0;
for (int i = 0; i < upto; i++)
result += array [i];
return result;
}
/**
* Helper method to calc the sum of all elements in an int array.
*/
private int sumIntArray (int[] array)
{
return sumIntArray(array, array.length);
}
/**
* Helper method to calc the sum of all elements in an double array.
*/
private double sumDoubleArray (double[] array)
{
double result = 0;
for (int i = 0; i < array.length; i++)
result += array [i];
return result;
}
public void addLayoutComponent (String name, Component component)
{
// do nothing here.
}
public void removeLayoutComponent (Component component)
{
// do nothing here
}
public void addLayoutComponent (Component component, Object constraints)
{
if (constraints == null)
return;
if (!(constraints instanceof GridBagConstraints))
throw new IllegalArgumentException("constraints "
+ constraints
+ " are not an instance of GridBagConstraints");
setConstraints (component, (GridBagConstraints) constraints);
}
public Dimension preferredLayoutSize (Container parent)
{
if (parent == null)
return new Dimension (0, 0);
GridBagLayoutInfo li = getLayoutInfo (parent, PREFERREDSIZE);
return getMinSize (parent, li);
}
public Dimension minimumLayoutSize (Container parent)
{
if (parent == null)
return new Dimension (0, 0);
GridBagLayoutInfo li = getLayoutInfo (parent, MINSIZE);
return getMinSize (parent, li);
}
public Dimension maximumLayoutSize (Container target)
{
return new Dimension (Integer.MAX_VALUE, Integer.MAX_VALUE);
}
public void layoutContainer (Container parent)
{
arrangeGrid (parent);
}
public float getLayoutAlignmentX (Container target)
{
return Component.CENTER_ALIGNMENT;
}
public float getLayoutAlignmentY (Container target)
{
return Component.CENTER_ALIGNMENT;
}
public void invalidateLayout (Container target)
{
this.layoutInfo = null;
}
public void setConstraints (Component component,
GridBagConstraints constraints)
{
GridBagConstraints clone = (GridBagConstraints) constraints.clone();
if (clone.gridx < 0)
clone.gridx = GridBagConstraints.RELATIVE;
if (clone.gridy < 0)
clone.gridy = GridBagConstraints.RELATIVE;
if (clone.gridwidth == 0)
clone.gridwidth = GridBagConstraints.REMAINDER;
else if (clone.gridwidth < 0
&& clone.gridwidth != GridBagConstraints.REMAINDER
&& clone.gridwidth != GridBagConstraints.RELATIVE)
clone.gridwidth = 1;
if (clone.gridheight == 0)
clone.gridheight = GridBagConstraints.REMAINDER;
else if (clone.gridheight < 0
&& clone.gridheight != GridBagConstraints.REMAINDER
&& clone.gridheight != GridBagConstraints.RELATIVE)
clone.gridheight = 1;
comptable.put (component, clone);
}
public GridBagConstraints getConstraints (Component component)
{
return (GridBagConstraints) (lookupConstraints (component).clone());
}
protected GridBagConstraints lookupConstraints (Component component)
{
GridBagConstraints result = (GridBagConstraints) comptable.get (component);
if (result == null)
{
setConstraints (component, defaultConstraints);
result = (GridBagConstraints) comptable.get (component);
}
return result;
}
private GridBagConstraints lookupInternalConstraints (Component component)
{
GridBagConstraints result =
(GridBagConstraints) internalcomptable.get (component);
if (result == null)
{
result = (GridBagConstraints) lookupConstraints(component).clone();
internalcomptable.put (component, result);
}
return result;
}
/**
* @since 1.1
*/
public Point getLayoutOrigin ()
{
if (layoutInfo == null)
return new Point (0, 0);
return new Point (layoutInfo.pos_x, layoutInfo.pos_y);
}
/**
* @since 1.1
*/
public int[][] getLayoutDimensions ()
{
int[][] result = new int [2][];
if (layoutInfo == null)
{
result[0] = new int[0];
result[1] = new int[0];
return result;
}
result [0] = new int [layoutInfo.cols];
System.arraycopy (layoutInfo.colWidths, 0, result [0], 0, layoutInfo.cols);
result [1] = new int [layoutInfo.rows];
System.arraycopy (layoutInfo.rowHeights, 0, result [1], 0, layoutInfo.rows);
return result;
}
public double[][] getLayoutWeights ()
{
double[][] result = new double [2][];
if (layoutInfo == null)
{
result[0] = new double[0];
result[1] = new double[0];
return result;
}
result [0] = new double [layoutInfo.cols];
System.arraycopy (layoutInfo.colWeights, 0, result [0], 0, layoutInfo.cols);
result [1] = new double [layoutInfo.rows];
System.arraycopy (layoutInfo.rowWeights, 0, result [1], 0, layoutInfo.rows);
return result;
}
/**
* @since 1.1
*/
public Point location (int x, int y)
{
if (layoutInfo == null)
return new Point (0, 0);
int col;
int row;
int pixel_x = layoutInfo.pos_x;
int pixel_y = layoutInfo.pos_y;
for (col = 0; col < layoutInfo.cols; col++)
{
int w = layoutInfo.colWidths [col];
if (x < pixel_x + w)
break;
pixel_x += w;
}
for (row = 0; row < layoutInfo.rows; row++)
{
int h = layoutInfo.rowHeights [row];
if (y < pixel_y + h)
break;
pixel_y += h;
}
return new Point (col, row);
}
/**
* Obsolete.
*/
protected void AdjustForGravity (GridBagConstraints gbc, Rectangle rect)
{
// FIXME
throw new Error ("Not implemented");
}
/**
* Obsolete.
*/
protected void ArrangeGrid (Container parent)
{
Component[] components = parent.getComponents();
if (components.length == 0)
return;
GridBagLayoutInfo info = getLayoutInfo (parent, PREFERREDSIZE);
if (info.cols == 0 && info.rows == 0)
return;
layoutInfo = info;
// DEBUG
//dumpLayoutInfo (layoutInfo);
for(int i = 0; i < components.length; i++)
{
Component component = components [i];
// If component is not visible we dont have to care about it.
if (!component.isVisible())
continue;
GridBagConstraints constraints =
lookupInternalConstraints(component);
int cellx = sumIntArray(layoutInfo.colWidths, constraints.gridx);
int celly = sumIntArray(layoutInfo.rowHeights, constraints.gridy);
int cellw = sumIntArray(layoutInfo.colWidths,
constraints.gridx + constraints.gridwidth) - cellx;
int cellh = sumIntArray(layoutInfo.rowHeights,
constraints.gridy + constraints.gridheight) - celly;
Insets insets = constraints.insets;
if (insets != null)
{
cellx += insets.left;
celly += insets.top;
cellw -= insets.left + insets.right;
cellh -= insets.top + insets.bottom;
}
Dimension dim = component.getPreferredSize();
// Note: Documentation says that padding is added on both sides, but
// visual inspection shows that the Sun implementation only adds it
// once, so we do the same.
dim.width += constraints.ipadx;
dim.height += constraints.ipady;
switch(constraints.fill)
{
case GridBagConstraints.HORIZONTAL:
dim.width = cellw;
break;
case GridBagConstraints.VERTICAL:
dim.height = cellh;
break;
case GridBagConstraints.BOTH:
dim.width = cellw;
dim.height = cellh;
break;
}
int x;
int y;
switch(constraints.anchor)
{
case GridBagConstraints.NORTH:
x = cellx + (cellw - dim.width) / 2;
y = celly;
break;
case GridBagConstraints.SOUTH:
x = cellx + (cellw - dim.width) / 2;
y = celly + cellh - dim.height;
break;
case GridBagConstraints.WEST:
x = cellx;
y = celly + (cellh - dim.height) / 2;
break;
case GridBagConstraints.EAST:
x = cellx + cellw - dim.width;
y = celly + (cellh - dim.height) / 2;
break;
case GridBagConstraints.NORTHEAST:
x = cellx + cellw - dim.width;
y = celly;
break;
case GridBagConstraints.NORTHWEST:
x = cellx;
y = celly;
break;
case GridBagConstraints.SOUTHEAST:
x = cellx + cellw - dim.width;
y = celly + cellh - dim.height;
break;
case GridBagConstraints.SOUTHWEST:
x = cellx;
y = celly + cellh - dim.height;
break;
default:
x = cellx + (cellw - dim.width) / 2;
y = celly + (cellh - dim.height) / 2;
break;
}
component.setBounds(layoutInfo.pos_x + x, layoutInfo.pos_y + y, dim.width, dim.height);
}
// DEBUG
//dumpLayoutInfo (layoutInfo);
}
/**
* Obsolete.
*/
protected GridBagLayoutInfo GetLayoutInfo (Container parent, int sizeflag)
{
if (sizeflag != MINSIZE && sizeflag != PREFERREDSIZE)
throw new IllegalArgumentException();
Dimension parentDim = parent.getSize ();
Insets parentInsets = parent.getInsets ();
parentDim.width -= parentInsets.left + parentInsets.right;
parentDim.height -= parentInsets.top + parentInsets.bottom;
int current_y = 0;
int max_x = 0;
int max_y = 0;
// Guaranteed to contain the last component added to the given row
// or column, whose gridwidth/height is not REMAINDER.
HashMap<Integer,Component> lastInRow = new HashMap<Integer,Component>();
HashMap<Integer,Component> lastInCol = new HashMap<Integer,Component>();
Component[] components = parent.getComponents();
// Components sorted by gridwidths/heights,
// smallest to largest, with REMAINDER and RELATIVE at the end.
// These are useful when determining sizes and weights.
ArrayList<Component> sortedByWidth =
new ArrayList<Component>(components.length);
ArrayList<Component> sortedByHeight =
new ArrayList<Component>(components.length);
// STEP 1: first we figure out how many rows/columns
for (int i = 0; i < components.length; i++)
{
Component component = components [i];
// If component is not visible we dont have to care about it.
if (!component.isVisible())
continue;
// When looking up the constraint for the first time, check the
// original unmodified constraint. After the first time, always
// refer to the internal modified constraint.
GridBagConstraints originalConstraints = lookupConstraints (component);
GridBagConstraints constraints = (GridBagConstraints) originalConstraints.clone();
internalcomptable.put(component, constraints);
// Cases:
//
// 1. gridy == RELATIVE, gridx == RELATIVE
//
// use y as the row number; check for the next
// available slot at row y
//
// 2. only gridx == RELATIVE
//
// check for the next available slot at row gridy
//
// 3. only gridy == RELATIVE
//
// check for the next available slot at column gridx
//
// 4. neither gridx or gridy == RELATIVE
//
// nothing to check; just add it
// cases 1 and 2
if(constraints.gridx == GridBagConstraints.RELATIVE)
{
if (constraints.gridy == GridBagConstraints.RELATIVE)
constraints.gridy = current_y;
int x;
// Check the component that occupies the right-most spot in this
// row. We want to add this component after it.
// If this row is empty, add to the 0 position.
if (!lastInRow.containsKey(new Integer(constraints.gridy)))
x = 0;
else
{
Component lastComponent = (Component) lastInRow.get(new Integer(constraints.gridy));
GridBagConstraints lastConstraints = lookupInternalConstraints(lastComponent);
x = lastConstraints.gridx + Math.max(1, lastConstraints.gridwidth);
}
// Determine if this component will fit in the slot vertically.
// If not, bump it over to where it does fit.
for (int y = constraints.gridy + 1; y < constraints.gridy + Math.max(1, constraints.gridheight); y++)
{
if (lastInRow.containsKey(new Integer(y)))
{
Component lastComponent = (Component) lastInRow.get(new Integer(y));
GridBagConstraints lastConstraints = lookupInternalConstraints(lastComponent);
x = Math.max (x,
lastConstraints.gridx + Math.max(1, lastConstraints.gridwidth));
}
}
constraints.gridx = x;
}
// case 3
else if(constraints.gridy == GridBagConstraints.RELATIVE)
{
int y;
// Check the component that occupies the bottom-most spot in
// this column. We want to add this component below it.
// If this column is empty, add to the 0 position.
if (!lastInCol.containsKey(new Integer(constraints.gridx)))
y = 0;
else
{
Component lastComponent = (Component)lastInCol.get(new Integer(constraints.gridx));
GridBagConstraints lastConstraints = lookupInternalConstraints(lastComponent);
y = lastConstraints.gridy + Math.max(1, lastConstraints.gridheight);
}
// Determine if this component will fit in the slot horizontally.
// If not, bump it down to where it does fit.
for (int x = constraints.gridx + 1; x < constraints.gridx + Math.max(1, constraints.gridwidth); x++)
{
if (lastInCol.containsKey(new Integer(x)))
{
Component lastComponent = (Component) lastInCol.get(new Integer(x));
GridBagConstraints lastConstraints = lookupInternalConstraints(lastComponent);
y = Math.max (y,
lastConstraints.gridy + Math.max(1, lastConstraints.gridheight));
}
}
constraints.gridy = y;
}
// case 4: do nothing
max_x = Math.max(max_x,
constraints.gridx + Math.max(1, constraints.gridwidth));
max_y = Math.max(max_y,
constraints.gridy + Math.max(1, constraints.gridheight));
sortBySpan(component, constraints.gridwidth, sortedByWidth, true);
sortBySpan(component, constraints.gridheight, sortedByHeight, false);
// Update our reference points for RELATIVE gridx and gridy.
if(constraints.gridwidth == GridBagConstraints.REMAINDER)
{
current_y = constraints.gridy + Math.max(1, constraints.gridheight);
}
else if (constraints.gridwidth != GridBagConstraints.REMAINDER)
{
for (int y = constraints.gridy; y < constraints.gridy + Math.max(1, constraints.gridheight); y++)
{
if(lastInRow.containsKey(new Integer(y)))
{
Component lastComponent = (Component) lastInRow.get(new Integer(y));
GridBagConstraints lastConstraints = lookupInternalConstraints(lastComponent);
if (constraints.gridx > lastConstraints.gridx)
{
lastInRow.put(new Integer(y), component);
}
}
else
{
lastInRow.put(new Integer(y), component);
}
}
for (int x = constraints.gridx; x < constraints.gridx + Math.max(1, constraints.gridwidth); x++)
{
if(lastInCol.containsKey(new Integer(x)))
{
Component lastComponent = (Component) lastInCol.get(new Integer(x));
GridBagConstraints lastConstraints = lookupInternalConstraints(lastComponent);
if (constraints.gridy > lastConstraints.gridy)
{
lastInCol.put(new Integer(x), component);
}
}
else
{
lastInCol.put(new Integer(x), component);
}
}
}
} // end of STEP 1
GridBagLayoutInfo info = new GridBagLayoutInfo(max_x, max_y);
// Check if column widths and row heights are overridden.
for (int x = 0; x < max_x; x++)
{
if(columnWidths != null && columnWidths.length > x)
info.colWidths[x] = columnWidths[x];
if(columnWeights != null && columnWeights.length > x)
info.colWeights[x] = columnWeights[x];
}
for (int y = 0; y < max_y; y++)
{
if(rowHeights != null && rowHeights.length > y)
info.rowHeights[y] = rowHeights[y];
if(rowWeights != null && rowWeights.length > y)
info.rowWeights[y] = rowWeights[y];
}
// STEP 2: Fix up any cells with width/height as REMAINDER/RELATIVE.
for (int i = 0; i < components.length; i++)
{
Component component = components [i];
// If component is not visible we dont have to care about it.
if (!component.isVisible())
continue;
GridBagConstraints constraints = lookupInternalConstraints (component);
if(constraints.gridwidth == GridBagConstraints.REMAINDER || constraints.gridwidth == GridBagConstraints.RELATIVE)
{
if(constraints.gridwidth == GridBagConstraints.REMAINDER)
{
for (int y = constraints.gridy; y < constraints.gridy + Math.max(1, constraints.gridheight); y++)
{
if (lastInRow.containsKey(new Integer(y)))
{
Component lastComponent = (Component) lastInRow.get(new Integer(y));
GridBagConstraints lastConstraints = lookupInternalConstraints(lastComponent);
if (lastConstraints.gridwidth == GridBagConstraints.RELATIVE)
{
constraints.gridx = max_x - 1;
break;
}
else
{
constraints.gridx = Math.max (constraints.gridx,
lastConstraints.gridx + Math.max (1, lastConstraints.gridwidth));
}
}
}
constraints.gridwidth = max_x - constraints.gridx;
}
else if (constraints.gridwidth == GridBagConstraints.RELATIVE)
{
constraints.gridwidth = max_x - constraints.gridx - 1;
}
// Re-sort
sortedByWidth.remove(sortedByWidth.indexOf(component));
sortBySpan(component, constraints.gridwidth, sortedByWidth, true);
}
if(constraints.gridheight == GridBagConstraints.REMAINDER || constraints.gridheight == GridBagConstraints.RELATIVE)
{
if(constraints.gridheight == GridBagConstraints.REMAINDER)
{
for (int x = constraints.gridx; x < constraints.gridx + Math.max(1, constraints.gridwidth); x++)
{
if (lastInCol.containsKey(new Integer(x)))
{
Component lastComponent = (Component) lastInRow.get(new Integer(x));
GridBagConstraints lastConstraints = lookupInternalConstraints(lastComponent);
if (lastConstraints.gridheight == GridBagConstraints.RELATIVE)
{
constraints.gridy = max_y - 1;
break;
}
else
{
constraints.gridy = Math.max (constraints.gridy,
lastConstraints.gridy + Math.max (1, lastConstraints.gridheight));
}
}
}
constraints.gridheight = max_y - constraints.gridy;
}
else if (constraints.gridheight == GridBagConstraints.RELATIVE)
{
constraints.gridheight = max_y - constraints.gridy - 1;
}
// Re-sort
sortedByHeight.remove(sortedByHeight.indexOf(component));
sortBySpan(component, constraints.gridheight, sortedByHeight, false);
}
} // end of STEP 2
// STEP 3: Determine sizes and weights for columns.
for (int i = 0; i < sortedByWidth.size(); i++)
{
Component component = sortedByWidth.get(i);
// If component is not visible we dont have to care about it.
if (!component.isVisible())
continue;
GridBagConstraints constraints = lookupInternalConstraints (component);
int width = (sizeflag == PREFERREDSIZE) ?
component.getPreferredSize().width :
component.getMinimumSize().width;
if(constraints.insets != null)
width += constraints.insets.left + constraints.insets.right;
width += constraints.ipadx;
distributeSizeAndWeight(width,
constraints.weightx,
constraints.gridx,
constraints.gridwidth,
info.colWidths,
info.colWeights);
} // end of STEP 3
// STEP 4: Determine sizes and weights for rows.
for (int i = 0; i < sortedByHeight.size(); i++)
{
Component component = (Component) sortedByHeight.get(i);
// If component is not visible we dont have to care about it.
if (!component.isVisible())
continue;
GridBagConstraints constraints = lookupInternalConstraints (component);
int height = (sizeflag == PREFERREDSIZE) ?
component.getPreferredSize().height :
component.getMinimumSize().height;
if(constraints.insets != null)
height += constraints.insets.top + constraints.insets.bottom;
height += constraints.ipady;
distributeSizeAndWeight(height,
constraints.weighty,
constraints.gridy,
constraints.gridheight,
info.rowHeights,
info.rowWeights);
} // end of STEP 4
// Adjust cell sizes iff parent size not zero.
if (parentDim.width > 0 && parentDim.height > 0)
{
calcCellSizes (info.colWidths, info.colWeights, parentDim.width);
calcCellSizes (info.rowHeights, info.rowWeights, parentDim.height);
}
int totalWidth = sumIntArray(info.colWidths);
int totalHeight = sumIntArray(info.rowHeights);
// Make sure pos_x and pos_y are never negative.
if (totalWidth >= parentDim.width)
info.pos_x = parentInsets.left;
else
info.pos_x = parentInsets.left + (parentDim.width - totalWidth) / 2;
if (totalHeight >= parentDim.height)
info.pos_y = parentInsets.top;
else
info.pos_y = parentInsets.top + (parentDim.height - totalHeight) / 2;
// DEBUG
//dumpLayoutInfo (info);
return info;
}
/**
* Obsolete.
*/
protected Dimension GetMinSize (Container parent, GridBagLayoutInfo info)
{
if (parent == null || info == null)
return new Dimension (0, 0);
Insets insets = parent.getInsets();
int width = sumIntArray (info.colWidths) + insets.left + insets.right;
int height = sumIntArray (info.rowHeights) + insets.top + insets.bottom;
return new Dimension (width, height);
}
/**
* @since 1.4
*/
protected Dimension getMinSize (Container parent, GridBagLayoutInfo info)
{
return GetMinSize (parent, info);
}
/**
* Helper method used by GetLayoutInfo to keep components sorted, either
* by gridwidth or gridheight.
*
* @param component Component to add to the sorted list.
* @param span Either the component's gridwidth or gridheight.
* @param list <code>ArrayList</code> of components, sorted by
* their span.
* @param sortByWidth Flag indicating sorting index. If true, sort by
* width. Otherwise, sort by height.
* FIXME: Use a better sorting algorithm.
*/
private void sortBySpan (Component component, int span,
ArrayList<Component> list, boolean sortByWidth)
{
if (span == GridBagConstraints.REMAINDER
|| span == GridBagConstraints.RELATIVE)
{
// Put all RELATIVE and REMAINDER components at the end.
list.add(component);
}
else
{
int i = 0;
if (list.size() > 0)
{
GridBagConstraints gbc = lookupInternalConstraints((Component) list.get(i));
int otherspan = sortByWidth ?
gbc.gridwidth :
gbc.gridheight;
while (otherspan != GridBagConstraints.REMAINDER
&& otherspan != GridBagConstraints.RELATIVE
&& span >= otherspan)
{
i++;
if (i < list.size())
{
gbc = lookupInternalConstraints((Component) list.get(i));
otherspan = sortByWidth ?
gbc.gridwidth :
gbc.gridheight;
}
else
break;
}
}
list.add(i, component);
}
}
/**
* Helper method used by GetLayoutInfo to distribute a component's size
* and weight.
*
* @param size Preferred size of component, with inset and padding
* already added.
* @param weight Weight of component.
* @param start Starting position of component. Either
* constraints.gridx or gridy.
* @param span Span of component. either contraints.gridwidth or
* gridheight.
* @param sizes Sizes of rows or columns.
* @param weights Weights of rows or columns.
*/
private void distributeSizeAndWeight (int size, double weight,
int start, int span,
int[] sizes, double[] weights)
{
if (span == 1)
{
sizes[start] = Math.max(sizes[start], size);
weights[start] = Math.max(weights[start], weight);
}
else if (span > 1)
{
int numOccupied = span;
int lastOccupied = -1;
for(int i = start; i < start + span; i++)
{
if (sizes[i] == 0.0)
numOccupied--;
else
{
size -= sizes[i];
lastOccupied = i;
}
}
// A component needs to occupy at least one row.
if(numOccupied == 0)
sizes[start + span - 1] = size;
else if (size > 0)
sizes[lastOccupied] += size;
calcCellWeights(weight, weights, start, span);
}
}
/**
* Helper method used by GetLayoutInfo to calculate weight distribution.
* @param weight Weight of component.
* @param weights Weights of rows/columns.
* @param start Starting position of component in grid (gridx/gridy).
* @param span Span of component (gridwidth/gridheight).
*/
private void calcCellWeights (double weight, double[] weights, int start, int span)
{
double totalWeight = 0.0;
for(int k = start; k < start + span; k++)
totalWeight += weights[k];
if(weight > totalWeight)
{
if (totalWeight == 0.0)
{
weights[start + span - 1] += weight;
}
else
{
double diff = weight - totalWeight ;
double remaining = diff;
for(int k = start; k < start + span; k++)
{
double extraWeight = diff * weights[k] / totalWeight;
weights[k] += extraWeight;
remaining -= extraWeight;
}
if (remaining > 0.0 && weights[start + span - 1] != 0.0)
{
weights[start + span - 1] += remaining;
}
}
}
}
/**
* Helper method used by GetLayoutInfo to distribute extra space
* based on weight distribution.
*
* @param sizes Sizes of rows/columns.
* @param weights Weights of rows/columns.
* @param range Dimension of container.
*/
private void calcCellSizes (int[] sizes, double[] weights, int range)
{
int totalSize = sumIntArray (sizes);
double totalWeight = sumDoubleArray (weights);
int diff = range - totalSize;
if (diff == 0)
return;
for (int i = 0; i < sizes.length; i++)
{
int newsize = (int) (sizes[i] + (((double) diff) * weights [i] / totalWeight ));
if (newsize > 0)
sizes[i] = newsize;
}
}
private void dumpLayoutInfo (GridBagLayoutInfo info)
{
System.out.println ("GridBagLayoutInfo:");
System.out.println ("cols: " + info.cols + ", rows: " + info.rows);
System.out.print ("colWidths: ");
dumpArray(info.colWidths);
System.out.print ("rowHeights: ");
dumpArray(info.rowHeights);
System.out.print ("colWeights: ");
dumpArray(info.colWeights);
System.out.print ("rowWeights: ");
dumpArray(info.rowWeights);
}
private void dumpArray(int[] array)
{
String sep = "";
for(int i = 0; i < array.length; i++)
{
System.out.print(sep);
System.out.print(array[i]);
sep = ", ";
}
System.out.println();
}
private void dumpArray(double[] array)
{
String sep = "";
for(int i = 0; i < array.length; i++)
{
System.out.print(sep);
System.out.print(array[i]);
sep = ", ";
}
System.out.println();
}
/**
* @since 1.4
*/
protected void arrangeGrid (Container parent)
{
ArrangeGrid (parent);
}
/**
* @since 1.4
*/
protected GridBagLayoutInfo getLayoutInfo (Container parent, int sizeflag)
{
return GetLayoutInfo (parent, sizeflag);
}
/**
* @since 1.4
*/
protected void adjustForGravity (GridBagConstraints gbc, Rectangle rect)
{
AdjustForGravity (gbc, rect);
}
}
|