Searched defs:left (Results 1 - 3 of 3) sorted by relevance
| /solaris-userland-s11u3/components/visual-panels/core/src/java/util/com/oracle/solaris/vp/util/swing/ |
| H A D | ClippedBorder.java | 45 private boolean left; field in class:ClippedBorder
63 * @param left
64 * {@code true} to include the left side of {@code border} in
75 public ClippedBorder(Border border, boolean top, boolean left, argument
82 this.left = left;
96 int left = this.left ? i.left : 0;
100 return new Insets(top, left, botto
[all...] |
| /solaris-userland-s11u3/components/visual-panels/usermgr/src/java/vpanels/app/usermgr/com/oracle/solaris/vp/panels/usermgr/client/swing/ |
| H A D | Constraints.java | 59 int left,
73 if (top+bottom+left+right > 0)
74 gbc.insets = new Insets(top, left, bottom, right);
112 int left,
119 0.0, 0.0, top, left, bottom, right);
47 constrain( Container container, Component component, int gridx, int gridy, int gridwidth, int gridheight, int fill, int anchor, double weightx, double weighty, int top, int left, int bottom, int right) argument
104 constrain( Container container, Component component, int gridx, int gridy, int gridwidth, int gridheight, int top, int left, int bottom, int right) argument
|
| H A D | Sort.java | 62 * @param left - the start index - from where to begin sorting
66 private static void quicksort(Object arr[], int left, int right, argument
71 if (left >= right) { /* do nothing if array contains fewer than two */
75 swap(arr, left, left+(Math.abs(rn.nextInt())%(right-left)+1));
76 last = left;
77 for (i = left+1; i <= right; i++) {
78 if (comp.doCompare(arr[i], arr[left]) < 0) {
82 swap(arr, left, las
96 quicksort(String arr[], int left, int right, int order) argument
138 quicksort(Vector vec, int left, int right, Compare comp) argument
166 quicksort(Vector vec, int left, int right, int order) argument
200 quicksort(QuickVector vec, int left, int right, Compare comp) argument
230 quicksort(QuickVector vec, int left, int right, int order) argument
[all...] |
Completed in 28 milliseconds