bugged
stringlengths 6
599k
| fixed
stringlengths 10
599k
| __index_level_0__
int64 0
1.13M
|
|---|---|---|
StreamHandler( OutputStream out, String propertyPrefix, Level defaultLevel, Formatter formatter, Class defaultFormatterClass) { this.level = LogManager.getLevelProperty(propertyPrefix + ".level", defaultLevel); this.filter = (Filter) LogManager.getInstanceProperty( propertyPrefix + ".filter", /* must be instance of */ Filter.class, /* default: new instance of */ null); if (formatter != null) this.formatter = formatter; else this.formatter = (Formatter) LogManager.getInstanceProperty( propertyPrefix + ".formatter", /* must be instance of */ Formatter.class, /* default: new instance of */ defaultFormatterClass); try { String enc = LogManager.getLogManager().getProperty(propertyPrefix + ".encoding"); /* make sure enc actually is a valid encoding */ if ((enc != null) && (enc.length() > 0)) new String(new byte[0], enc); this.encoding = enc; } catch (Exception _) { } if (out != null) { try { changeWriter(out, getEncoding()); } catch (UnsupportedEncodingException uex) { /* This should never happen, since the validity of the encoding * name has been checked above. */ throw new RuntimeException(uex.getMessage()); } } }
|
StreamHandler( OutputStream out, String propertyPrefix, Level defaultLevel, Formatter formatter, Class defaultFormatterClass) { this.level = LogManager.getLevelProperty(propertyPrefix + ".level", defaultLevel); this.filter = (Filter) LogManager.getInstanceProperty( propertyPrefix + ".filter", /* must be instance of */ Filter.class, /* default: new instance of */ null); if (formatter != null) this.formatter = formatter; else this.formatter = (Formatter) LogManager.getInstanceProperty( propertyPrefix + ".formatter", /* must be instance of */ Formatter.class, /* default: new instance of */ defaultFormatterClass); try { String enc = LogManager.getLogManager().getProperty(propertyPrefix + ".encoding"); /* make sure enc actually is a valid encoding */ if ((enc != null) && (enc.length() > 0)) new String(new byte[0], enc); this.encoding = enc; } catch (Exception _) { } if (out != null) { try { changeWriter(out, getEncoding()); } catch (UnsupportedEncodingException uex) { /* This should never happen, since the validity of the encoding * name has been checked above. */ throw new RuntimeException(uex.getMessage()); } } }
| 9,919
|
public final Class getCategory() { return PrinterMakeAndModel.class; }
|
public Class getCategory() { return PrinterMakeAndModel.class; }
| 9,920
|
public final String getName() { return "printer-make-and-model"; }
|
public String getName() { return "printer-make-and-model"; }
| 9,921
|
public void setLeadSelectionIndex(int leadIndex) { int oldLeadIndex = leadSelectionIndex; leadSelectionIndex = leadIndex; if (anchorSelectionIndex == -1) return; int R1 = Math.min(anchorSelectionIndex, oldLeadIndex); int R2 = Math.max(anchorSelectionIndex, oldLeadIndex); int S1 = Math.min(anchorSelectionIndex, leadIndex); int S2 = Math.max(anchorSelectionIndex, leadIndex); int lo = Math.min(R1, S1); int hi = Math.max(R2, S2); BitSet oldRange = sel.get(lo, hi+1); if (isSelectedIndex(anchorSelectionIndex)) { sel.clear(R1, R2+1); sel.set(S1, S2+1); } else { sel.set(R1, R2+1); sel.clear(S1, S2+1); } BitSet newRange = sel.get(lo, hi+1); newRange.xor(oldRange); int beg = sel.nextSetBit(0), end = -1; for(int i=beg; i >= 0; i=sel.nextSetBit(i+1)) { end = i; } fireValueChanged(beg, end, valueIsAdjusting); }
|
public void setLeadSelectionIndex(int leadIndex) int oldLeadIndex = leadSelectionIndex; leadSelectionIndex = leadIndex; if (anchorSelectionIndex == -1) return; int R1 = Math.min(anchorSelectionIndex, oldLeadIndex); int R2 = Math.max(anchorSelectionIndex, oldLeadIndex); int S1 = Math.min(anchorSelectionIndex, leadIndex); int S2 = Math.max(anchorSelectionIndex, leadIndex); int lo = Math.min(R1, S1); int hi = Math.max(R2, S2); BitSet oldRange = sel.get(lo, hi+1); if (isSelectedIndex(anchorSelectionIndex)) sel.clear(R1, R2+1); sel.set(S1, S2+1); } else sel.set(R1, R2+1); sel.clear(S1, S2+1); } BitSet newRange = sel.get(lo, hi+1); newRange.xor(oldRange); int beg = sel.nextSetBit(0), end = -1; for(int i=beg; i >= 0; i=sel.nextSetBit(i+1)) end = i; } fireValueChanged(beg, end, valueIsAdjusting); }
| 9,924
|
public void setLeadSelectionIndex(int leadIndex) { int oldLeadIndex = leadSelectionIndex; leadSelectionIndex = leadIndex; if (anchorSelectionIndex == -1) return; int R1 = Math.min(anchorSelectionIndex, oldLeadIndex); int R2 = Math.max(anchorSelectionIndex, oldLeadIndex); int S1 = Math.min(anchorSelectionIndex, leadIndex); int S2 = Math.max(anchorSelectionIndex, leadIndex); int lo = Math.min(R1, S1); int hi = Math.max(R2, S2); BitSet oldRange = sel.get(lo, hi+1); if (isSelectedIndex(anchorSelectionIndex)) { sel.clear(R1, R2+1); sel.set(S1, S2+1); } else { sel.set(R1, R2+1); sel.clear(S1, S2+1); } BitSet newRange = sel.get(lo, hi+1); newRange.xor(oldRange); int beg = sel.nextSetBit(0), end = -1; for(int i=beg; i >= 0; i=sel.nextSetBit(i+1)) { end = i; } fireValueChanged(beg, end, valueIsAdjusting); }
|
public void setLeadSelectionIndex(int leadIndex) { int oldLeadIndex = leadSelectionIndex; leadSelectionIndex = leadIndex; if (anchorSelectionIndex == -1) return; int R1 = Math.min(anchorSelectionIndex, oldLeadIndex); int R2 = Math.max(anchorSelectionIndex, oldLeadIndex); int S1 = Math.min(anchorSelectionIndex, leadIndex); int S2 = Math.max(anchorSelectionIndex, leadIndex); int lo = Math.min(R1, S1); int hi = Math.max(R2, S2); BitSet oldRange = sel.get(lo, hi+1); if (isSelectedIndex(anchorSelectionIndex)) { sel.clear(R1, R2+1); sel.set(S1, S2+1); else { sel.set(R1, R2+1); sel.clear(S1, S2+1); BitSet newRange = sel.get(lo, hi+1); newRange.xor(oldRange); int beg = sel.nextSetBit(0), end = -1; for(int i=beg; i >= 0; i=sel.nextSetBit(i+1)) { end = i; fireValueChanged(beg, end, valueIsAdjusting);
| 9,925
|
public void set(int from, int to) { if (from < 0 || from > to) throw new IndexOutOfBoundsException(); if (from == to) return; int lo_offset = from >>> 6; int hi_offset = to >>> 6; ensure(hi_offset); if (lo_offset == hi_offset) { bits[hi_offset] |= (-1L << from) & ((1L << to) - 1); return; } bits[lo_offset] |= -1L << from; bits[hi_offset] |= (1L << to) - 1; for (int i = lo_offset + 1; i < hi_offset; i++) bits[i] = -1; }
|
public void set(int pos) { if (from < 0 || from > to) throw new IndexOutOfBoundsException(); if (from == to) return; int lo_offset = from >>> 6; int hi_offset = to >>> 6; ensure(hi_offset); if (lo_offset == hi_offset) { bits[hi_offset] |= (-1L << from) & ((1L << to) - 1); return; } bits[lo_offset] |= -1L << from; bits[hi_offset] |= (1L << to) - 1; for (int i = lo_offset + 1; i < hi_offset; i++) bits[i] = -1; }
| 9,927
|
public void set(int from, int to) { if (from < 0 || from > to) throw new IndexOutOfBoundsException(); if (from == to) return; int lo_offset = from >>> 6; int hi_offset = to >>> 6; ensure(hi_offset); if (lo_offset == hi_offset) { bits[hi_offset] |= (-1L << from) & ((1L << to) - 1); return; } bits[lo_offset] |= -1L << from; bits[hi_offset] |= (1L << to) - 1; for (int i = lo_offset + 1; i < hi_offset; i++) bits[i] = -1; }
|
public void set(int from, int to) { if (from < 0 || from > to) throw new IndexOutOfBoundsException(); if (from == to) return; int lo_offset = from >>> 6; int hi_offset = to >>> 6; ensure(hi_offset); if (lo_offset == hi_offset) { bits[hi_offset] |= (-1L << from) & ((1L << to) - 1); return; } bits[lo_offset] |= -1L << from; bits[hi_offset] |= (1L << to) - 1; for (int i = lo_offset + 1; i < hi_offset; i++) bits[i] = -1; }
| 9,928
|
public BitSet get(int from, int to) { if (from < 0 || from > to) throw new IndexOutOfBoundsException(); BitSet bs = new BitSet(to - from); int lo_offset = from >>> 6; if (lo_offset >= bits.length) return bs; int lo_bit = from & LONG_MASK; int hi_offset = to >>> 6; if (lo_bit == 0) { int len = Math.min(hi_offset - lo_offset + 1, bits.length - lo_offset); System.arraycopy(bits, lo_offset, bs.bits, 0, len); if (hi_offset < bits.length) bs.bits[hi_offset - lo_offset] &= (1L << to) - 1; return bs; } int len = Math.min(hi_offset, bits.length - 1); int reverse = 64 - lo_bit; int i; for (i = 0; lo_offset < len; lo_offset++, i++) bs.bits[i] = ((bits[lo_offset] >>> lo_bit) | (bits[lo_offset + 1] << reverse)); if ((to & LONG_MASK) > lo_bit) bs.bits[i++] = bits[lo_offset] >>> lo_bit; if (hi_offset < bits.length) bs.bits[i - 1] &= (1L << (to - from)) - 1; return bs; }
|
public boolean get(int pos) { if (from < 0 || from > to) throw new IndexOutOfBoundsException(); BitSet bs = new BitSet(to - from); int lo_offset = from >>> 6; if (lo_offset >= bits.length) return bs; int lo_bit = from & LONG_MASK; int hi_offset = to >>> 6; if (lo_bit == 0) { int len = Math.min(hi_offset - lo_offset + 1, bits.length - lo_offset); System.arraycopy(bits, lo_offset, bs.bits, 0, len); if (hi_offset < bits.length) bs.bits[hi_offset - lo_offset] &= (1L << to) - 1; return bs; } int len = Math.min(hi_offset, bits.length - 1); int reverse = 64 - lo_bit; int i; for (i = 0; lo_offset < len; lo_offset++, i++) bs.bits[i] = ((bits[lo_offset] >>> lo_bit) | (bits[lo_offset + 1] << reverse)); if ((to & LONG_MASK) > lo_bit) bs.bits[i++] = bits[lo_offset] >>> lo_bit; if (hi_offset < bits.length) bs.bits[i - 1] &= (1L << (to - from)) - 1; return bs; }
| 9,929
|
public BitSet get(int from, int to) { if (from < 0 || from > to) throw new IndexOutOfBoundsException(); BitSet bs = new BitSet(to - from); int lo_offset = from >>> 6; if (lo_offset >= bits.length) return bs; int lo_bit = from & LONG_MASK; int hi_offset = to >>> 6; if (lo_bit == 0) { int len = Math.min(hi_offset - lo_offset + 1, bits.length - lo_offset); System.arraycopy(bits, lo_offset, bs.bits, 0, len); if (hi_offset < bits.length) bs.bits[hi_offset - lo_offset] &= (1L << to) - 1; return bs; } int len = Math.min(hi_offset, bits.length - 1); int reverse = 64 - lo_bit; int i; for (i = 0; lo_offset < len; lo_offset++, i++) bs.bits[i] = ((bits[lo_offset] >>> lo_bit) | (bits[lo_offset + 1] << reverse)); if ((to & LONG_MASK) > lo_bit) bs.bits[i++] = bits[lo_offset] >>> lo_bit; if (hi_offset < bits.length) bs.bits[i - 1] &= (1L << (to - from)) - 1; return bs; }
|
public BitSet get(int from, int to) { if (from < 0 || from > to) throw new IndexOutOfBoundsException(); BitSet bs = new BitSet(to - from); int lo_offset = from >>> 6; if (lo_offset >= bits.length) return bs; int lo_bit = from & LONG_MASK; int hi_offset = to >>> 6; if (lo_bit == 0) { int len = Math.min(hi_offset - lo_offset + 1, bits.length - lo_offset); System.arraycopy(bits, lo_offset, bs.bits, 0, len); if (hi_offset < bits.length) bs.bits[hi_offset - lo_offset] &= (1L << to) - 1; return bs; } int len = Math.min(hi_offset, bits.length - 1); int reverse = 64 - lo_bit; int i; for (i = 0; lo_offset < len; lo_offset++, i++) bs.bits[i] = ((bits[lo_offset] >>> lo_bit) | (bits[lo_offset + 1] << reverse)); if ((to & LONG_MASK) > lo_bit) bs.bits[i++] = bits[lo_offset] >>> lo_bit; if (hi_offset < bits.length) bs.bits[i - 1] &= (1L << (to - from)) - 1; return bs; }
| 9,930
|
public static Registry getRegistry(int port) throws RemoteException { return (getRegistry("localhost", port));}
|
public static Registry getRegistry(int port) throws RemoteException { return (getRegistry("localhost", port));}
| 9,931
|
public ULongLongSeqHolder(long[] initial_value) { value = initial_value; typecode.setLength(value.length); }
|
public ULongLongSeqHolder() { value = initial_value; typecode.setLength(value.length); }
| 9,932
|
public ULongLongSeqHolder(long[] initial_value) { value = initial_value; typecode.setLength(value.length); }
|
public ULongLongSeqHolder(long[] initial_value) { value = initial_value; typecode.setLength(value.length); }
| 9,933
|
public void waitForIdle() { if (state == State.ACTIVE) throw new BAD_INV_ORDER("The state is active"); Iterator iter = POAs.iterator(); while (iter.hasNext()) { gnuPOA poa = (gnuPOA) iter.next(); poa.waitWhileRunning(); } }
|
public void waitForIdle() { if (state == State.ACTIVE) throw new BAD_INV_ORDER("The state is active"); Iterator iter = POAs.iterator(); while (iter.hasNext()) { poa = (gnuPOA) iter.next(); poa.waitWhileRunning(); } }
| 9,938
|
public double distance(Point2D p) { return distance(getX(), p.getX(), getY(), p.getY()); }
|
public static double distance(double x1, double y1, double x2, double y2) { return distance(getX(), p.getX(), getY(), p.getY()); }
| 9,939
|
public double distance(Point2D p) { return distance(getX(), p.getX(), getY(), p.getY()); }
|
public double distance(Point2D p) { return Math.sqrt(distanceSq(x1, y1, x2, y2)); }
| 9,940
|
boolean contains(Point2D p);
|
boolean contains(double x, double y);
| 9,941
|
public void layoutContainer(Container parent) { // The way to interpret this function is basically to ignore the names // of methods it calls, and focus on the variable names here. getViewRect // doesn't, for example, return the view; it returns the port bounds in // view space. Likwise setViewPosition doesn't reposition the view; it // positions the port, in view coordinates. JViewport port = (JViewport) parent; Component view = port.getView(); if (view == null) return; // These dimensions and positions are in *view space*. Do not mix // variables in here from port space (eg. parent.getBounds()). This // function should be entirely in view space, because the methods on // the viewport require inputs in view space. Rectangle portBounds = port.getViewRect(); Dimension viewPref = view.getPreferredSize(); Dimension viewMinimum = view.getMinimumSize(); Point portLowerRight = new Point(portBounds.x + portBounds.width, portBounds.y + portBounds.height); // vertical implementation of the above rules if ((! (view instanceof Scrollable) || ((Scrollable) view).getScrollableTracksViewportHeight()) && viewPref.height < portBounds.height) viewPref.height = portBounds.height; if (portBounds.height >= viewMinimum.height) portBounds.y = 0; else { int overextension = portLowerRight.y - viewPref.height; if (overextension > 0) portBounds.y -= overextension; } // horizontal implementation of the above rules if ((! (view instanceof Scrollable) || ((Scrollable) view).getScrollableTracksViewportWidth()) && viewPref.width < portBounds.width) viewPref.width = portBounds.width; if (portBounds.width >= viewMinimum.width) portBounds.x = 0; else { int overextension = portLowerRight.x - viewPref.width; if (overextension > 0) portBounds.x -= overextension; } port.setViewPosition(portBounds.getLocation()); port.setViewSize(viewPref); }
|
public void layoutContainer(Container parent) { // The way to interpret this function is basically to ignore the names // of methods it calls, and focus on the variable names here. getViewRect // doesn't, for example, return the view; it returns the port bounds in // view space. Likwise setViewPosition doesn't reposition the view; it // positions the port, in view coordinates. JViewport port = (JViewport) parent; Component view = port.getView(); if (view == null) return; // These dimensions and positions are in *view space*. Do not mix // variables in here from port space (eg. parent.getBounds()). This // function should be entirely in view space, because the methods on // the viewport require inputs in view space. Rectangle portBounds = port.getViewRect(); Dimension viewPref = view.getPreferredSize(); Dimension viewMinimum = view.getMinimumSize(); Point portLowerRight = new Point(portBounds.x + portBounds.width, portBounds.y + portBounds.height); // vertical implementation of the above rules if ((! (view instanceof Scrollable) || ((Scrollable) view).getScrollableTracksViewportHeight()) && viewPref.height < portBounds.height) viewPref.height = portBounds.height; if (portBounds.height >= viewMinimum.height) portBounds.y = 0; else { int overextension = portLowerRight.y - viewPref.height; if (overextension > 0) portBounds.y -= overextension; } // horizontal implementation of the above rules if ((! (view instanceof Scrollable) || ((Scrollable) view).getScrollableTracksViewportWidth()) && viewPref.width < portBounds.width) viewPref.width = portBounds.width; if (portBounds.width >= viewMinimum.width) portBounds.x = 0; else { int overextension = portLowerRight.x - viewPref.width; if (overextension > 0) portBounds.x -= overextension; } port.setViewPosition(portBounds.getLocation()); port.setViewSize(viewPref); }
| 9,942
|
public void layoutContainer(Container parent) { // The way to interpret this function is basically to ignore the names // of methods it calls, and focus on the variable names here. getViewRect // doesn't, for example, return the view; it returns the port bounds in // view space. Likwise setViewPosition doesn't reposition the view; it // positions the port, in view coordinates. JViewport port = (JViewport) parent; Component view = port.getView(); if (view == null) return; // These dimensions and positions are in *view space*. Do not mix // variables in here from port space (eg. parent.getBounds()). This // function should be entirely in view space, because the methods on // the viewport require inputs in view space. Rectangle portBounds = port.getViewRect(); Dimension viewPref = view.getPreferredSize(); Dimension viewMinimum = view.getMinimumSize(); Point portLowerRight = new Point(portBounds.x + portBounds.width, portBounds.y + portBounds.height); // vertical implementation of the above rules if ((! (view instanceof Scrollable) || ((Scrollable) view).getScrollableTracksViewportHeight()) && viewPref.height < portBounds.height) viewPref.height = portBounds.height; if (portBounds.height >= viewMinimum.height) portBounds.y = 0; else { int overextension = portLowerRight.y - viewPref.height; if (overextension > 0) portBounds.y -= overextension; } // horizontal implementation of the above rules if ((! (view instanceof Scrollable) || ((Scrollable) view).getScrollableTracksViewportWidth()) && viewPref.width < portBounds.width) viewPref.width = portBounds.width; if (portBounds.width >= viewMinimum.width) portBounds.x = 0; else { int overextension = portLowerRight.x - viewPref.width; if (overextension > 0) portBounds.x -= overextension; } port.setViewPosition(portBounds.getLocation()); port.setViewSize(viewPref); }
|
public void layoutContainer(Container parent) { // The way to interpret this function is basically to ignore the names // of methods it calls, and focus on the variable names here. getViewRect // doesn't, for example, return the view; it returns the port bounds in // view space. Likwise setViewPosition doesn't reposition the view; it // positions the port, in view coordinates. JViewport port = (JViewport) parent; Component view = port.getView(); if (view == null) return; // These dimensions and positions are in *view space*. Do not mix // variables in here from port space (eg. parent.getBounds()). This // function should be entirely in view space, because the methods on // the viewport require inputs in view space. Rectangle portBounds = port.getViewRect(); Dimension viewPref = view.getPreferredSize(); Dimension viewMinimum = view.getMinimumSize(); Point portLowerRight = new Point(portBounds.x + portBounds.width, portBounds.y + portBounds.height); // vertical implementation of the above rules if ((! (view instanceof Scrollable) || ((Scrollable) view).getScrollableTracksViewportHeight()) && viewPref.height < portBounds.height) viewPref.height = portBounds.height; if (portBounds.height >= viewMinimum.height) portBounds.y = 0; else { int overextension = portLowerRight.y - viewPref.height; if (overextension > 0) portBounds.y -= overextension; } // horizontal implementation of the above rules if ((! (view instanceof Scrollable) || ((Scrollable) view).getScrollableTracksViewportWidth()) && viewPref.width < portBounds.width) viewPref.width = portBounds.width; if (portBounds.width >= viewMinimum.width) portBounds.x = 0; else { int overextension = portLowerRight.x - viewPref.width; if (overextension > 0) portBounds.x -= overextension; } port.setViewPosition(portBounds.getLocation()); port.setViewSize(viewPref); }
| 9,943
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
| 9,944
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.container = container; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
| 9,945
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
| 9,946
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
| 9,947
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
|
public BoxLayout(JComponent p, int way) { int width = 0; int height = 0; this.way = way; if (way == X_AXIS) { width = 1; } else { height = 1; } gridbag = new GridLayout(width, height); }
| 9,948
|
public void addLayoutComponent(String name, Component comp) { if (way == X_AXIS) { gridbag.setColumns( gridbag.getColumns() + 1); } else { gridbag.setRows( gridbag.getRows() + 1); } }
|
public void addLayoutComponent(String name, Component comp) { if (way == X_AXIS) { gridbag.setColumns( gridbag.getColumns() + 1); } else { gridbag.setRows( gridbag.getRows() + 1); } }
| 9,949
|
public float getLayoutAlignmentX ( Container parent ) { return 0; }
|
public float getLayoutAlignmentX ( Container parent ) { return 0; }
| 9,950
|
public float getLayoutAlignmentY ( Container parent ) { return 0; }
|
public float getLayoutAlignmentY ( Container parent ) { return 0; }
| 9,951
|
public void invalidateLayout ( Container parent ) { }
|
public void invalidateLayout ( Container parent ) { }
| 9,952
|
public void layoutContainer(Container parent) { gridbag.layoutContainer(parent); }
|
public void layoutContainer(Container parent) { gridbag.layoutContainer(parent); }
| 9,953
|
public Dimension maximumLayoutSize ( Container parent ) { return preferredLayoutSize(parent); }
|
public Dimension maximumLayoutSize ( Container parent ) { return preferredLayoutSize(parent); }
| 9,954
|
public Dimension minimumLayoutSize(Container parent) { return gridbag.minimumLayoutSize(parent); }
|
public Dimension minimumLayoutSize(Container parent) { return gridbag.minimumLayoutSize(parent); }
| 9,955
|
public Dimension preferredLayoutSize(Container parent) { return gridbag.preferredLayoutSize(parent); }
|
public Dimension preferredLayoutSize(Container parent) { return gridbag.preferredLayoutSize(parent); }
| 9,956
|
public void removeLayoutComponent(Component comp) { gridbag.removeLayoutComponent(comp); if (way == X_AXIS) { gridbag.setColumns( gridbag.getColumns() - 1); } else { gridbag.setRows( gridbag.getRows() - 1); } }
|
public void removeLayoutComponent(Component comp) { gridbag.removeLayoutComponent(comp); if (way == X_AXIS) { gridbag.setColumns( gridbag.getColumns() - 1); } else { gridbag.setRows( gridbag.getRows() - 1); } }
| 9,957
|
public GridLayout (int rows, int cols) { this (rows, cols, 0, 0); }
|
public GridLayout () { this (rows, cols, 0, 0); }
| 9,958
|
public GridLayout (int rows, int cols) { this (rows, cols, 0, 0); }
|
public GridLayout (int rows, int cols) { this (1, 0, 0, 0); }
| 9,959
|
public Dimension preferredLayoutSize(Container parent) { if (parent != container) throw new AWTError("invalid parent"); Insets insets = parent.getInsets(); int x = insets.left + insets.right; int y = insets.bottom + insets.top; Component[] children = parent.getComponents(); if (isHorizontalIn(parent)) { // sum up preferred widths of components, find maximum of preferred // heights for (int index = 0; index < children.length; index++) { Component comp = children[index]; Dimension sz = comp.getPreferredSize(); x += sz.width; y = Math.max(y, sz.height); } } else { // sum up preferred heights of components, find maximum of // preferred widths for (int index = 0; index < children.length; index++) { Component comp = children[index]; Dimension sz = comp.getPreferredSize(); y += sz.height; x = Math.max(x, sz.width); } } return new Dimension(x, y); }
|
public Dimension preferredLayoutSize(Container parent) { if (parent != container) throw new AWTError("invalid parent"); Insets insets = parent.getInsets(); int x = insets.left + insets.right; int y = insets.bottom + insets.top; Component[] children = parent.getComponents(); if (isHorizontalIn(parent)) { // sum up preferred widths of components, find maximum of preferred // heights for (int index = 0; index < children.length; index++) { Component comp = children[index]; Dimension sz = comp.getPreferredSize(); x += sz.width; y = Math.max(y, sz.height); } } else { // sum up preferred heights of components, find maximum of // preferred widths for (int index = 0; index < children.length; index++) { Component comp = children[index]; Dimension sz = comp.getPreferredSize(); y += sz.height; x = Math.max(x, sz.width); } } return new Dimension(x, y); }
| 9,960
|
private static void makeModal(JDialog dialog) { try { synchronized (dialog) { while (dialog.isVisible()) dialog.wait(); } } catch (InterruptedException e) { } }
|
static void makeModal(JDialog dialog) { try { synchronized (dialog) { while (dialog.isVisible()) dialog.wait(); } } catch (InterruptedException e) { } }
| 9,962
|
JDialog(Frame owner, String s) { this(owner, s, true); }
|
JDialog(Frame owner, String s) { this(owner, s, true); }
| 9,963
|
public DefaultColorSelectionModel() { // TODO } // DefaultColorSelectionModel()
|
public DefaultColorSelectionModel() { // TODO } // DefaultColorSelectionModel()
| 9,964
|
public abstract Color getSelectedColor();
|
Color getSelectedColor();
| 9,965
|
public abstract void setSelectedColor(Color color);
|
void setSelectedColor(Color color);
| 9,966
|
Window() { setVisible(false); setLayout((LayoutManager) new BorderLayout()); }
|
Window() { setVisible(false); setLayout((LayoutManager) new BorderLayout()); }
| 9,967
|
public void applyResourceBundle(ResourceBundle rb) { // FIXME }
|
public void applyResourceBundle(ResourceBundle rb) { // FIXME }
| 9,968
|
void dispatchEventImpl(AWTEvent e) { // Make use of event id's in order to avoid multiple instanceof tests. if (e.id <= WindowEvent.WINDOW_LAST && e.id >= WindowEvent.WINDOW_FIRST && (windowListener != null || (eventMask & AWTEvent.WINDOW_EVENT_MASK) != 0)) processEvent(e); else super.dispatchEventImpl(e); }
|
void dispatchEventImpl(AWTEvent e) { // Make use of event id's in order to avoid multiple instanceof tests. if (e.id <= WindowEvent.WINDOW_LAST && e.id >= WindowEvent.WINDOW_FIRST && (windowListener != null || (eventMask & AWTEvent.WINDOW_EVENT_MASK) != 0)) processEvent(e); else super.dispatchEventImpl(e); }
| 9,969
|
public void dispose() { hide(); Window[] list = getOwnedWindows(); for (int i = 0; i < list.length; i++) list[i].dispose(); for (int i = 0; i < ncomponents; ++i) component[i].removeNotify(); this.removeNotify(); }
|
public void dispose() { hide(); Window[] list = getOwnedWindows(); for (int i = 0; i < list.length; i++) list[i].dispose(); for (int i = 0; i < ncomponents; ++i) component[i].removeNotify(); this.removeNotify(); }
| 9,970
|
public void dispose() { hide(); Window[] list = getOwnedWindows(); for (int i = 0; i < list.length; i++) list[i].dispose(); for (int i = 0; i < ncomponents; ++i) component[i].removeNotify(); this.removeNotify(); }
|
public void dispose() { hide(); Window[] list = getOwnedWindows(); for (int i = 0; i < list.length; i++) list[i].dispose(); for (int i = 0; i < ncomponents; ++i) component[i].removeNotify(); this.removeNotify(); }
| 9,971
|
public Window[] getOwnedWindows() { // FIXME: return array containing all the windows this window currently // owns. return new Window[0]; }
|
public Window[] getOwnedWindows() { // FIXME: return array containing all the windows this window currently // owns. return new Window[0]; }
| 9,972
|
public final String getWarningString() { boolean secure = true; /* boolean secure = SecurityManager.checkTopLevelWindow(...) */ if (!secure) { if (warningString != null) return warningString; else { String warning = System.getProperty("awt.appletWarning"); return warning; } } return null; }
|
public final String getWarningString() { boolean secure = true; /* boolean secure = SecurityManager.checkTopLevelWindow(...) */ if (!secure) { if (warningString != null) return warningString; else { String warning = System.getProperty("awt.appletWarning"); return warning; } } return null; }
| 9,973
|
public void hide() { // FIXME: call hide() on any "owned" children here. super.hide(); }
|
public void hide() { // FIXME: call hide() on any "owned" children here. super.hide(); }
| 9,974
|
protected void processWindowEvent(WindowEvent evt) { if (windowListener != null) { switch (evt.getID()) { case WindowEvent.WINDOW_ACTIVATED : windowListener.windowActivated(evt); break; case WindowEvent.WINDOW_CLOSED : windowListener.windowClosed(evt); break; case WindowEvent.WINDOW_CLOSING : windowListener.windowClosing(evt); break; case WindowEvent.WINDOW_DEACTIVATED : windowListener.windowDeactivated(evt); break; case WindowEvent.WINDOW_DEICONIFIED : windowListener.windowDeiconified(evt); break; case WindowEvent.WINDOW_ICONIFIED : windowListener.windowIconified(evt); break; case WindowEvent.WINDOW_OPENED : windowListener.windowOpened(evt); break; } } }
|
protected void processWindowEvent(WindowEvent evt) { if (windowListener != null) { switch (evt.getID()) { case WindowEvent.WINDOW_ACTIVATED : windowListener.windowActivated(evt); break; case WindowEvent.WINDOW_CLOSED : windowListener.windowClosed(evt); break; case WindowEvent.WINDOW_CLOSING : windowListener.windowClosing(evt); break; case WindowEvent.WINDOW_DEACTIVATED : windowListener.windowDeactivated(evt); break; case WindowEvent.WINDOW_DEICONIFIED : windowListener.windowDeiconified(evt); break; case WindowEvent.WINDOW_ICONIFIED : windowListener.windowIconified(evt); break; case WindowEvent.WINDOW_OPENED : windowListener.windowOpened(evt); break; } } }
| 9,975
|
public void show() { if (parent != null && !parent.isDisplayable()) parent.addNotify(); if (peer == null) addNotify(); validate(); super.show(); toFront(); }
|
public void show() { if (parent != null && !parent.isDisplayable()) parent.addNotify(); if (peer == null) addNotify(); validate(); super.show(); toFront(); }
| 9,976
|
void dispatchEventImpl(AWTEvent e) { // Give lightweight dispatcher a chance to handle it. if (dispatcher != null && dispatcher.handleEvent (e)) return; if ((e.id <= ContainerEvent.CONTAINER_LAST && e.id >= ContainerEvent.CONTAINER_FIRST) && (containerListener != null || (eventMask & AWTEvent.CONTAINER_EVENT_MASK) != 0)) processEvent(e); else super.dispatchEventImpl(e); }
|
void dispatchEventImpl(AWTEvent e) { // Give lightweight dispatcher a chance to handle it. if (dispatcher != null && dispatcher.handleEvent (e)) return; if ((e.id <= ContainerEvent.CONTAINER_LAST && e.id >= ContainerEvent.CONTAINER_FIRST) && (containerListener != null || (eventMask & AWTEvent.CONTAINER_EVENT_MASK) != 0)) processEvent(e); else super.dispatchEventImpl(e); }
| 9,977
|
public WindowEvent(Window source, int id) { this(source, id, null, 0, 0); }
|
public WindowEvent(Window source, int id, Window opposite, int oldState, int newState) { this(source, id, null, 0, 0); }
| 9,979
|
public WindowEvent(Window source, int id) { this(source, id, null, 0, 0); }
|
public WindowEvent(Window source, int id) { super(source, id); this.opposite = opposite; this.oldState = oldState; this.newState = newState; }
| 9,980
|
public static ComponentUI createUI(JComponent component) { if (instances == null) instances = new HashMap(); Object o = instances.get(component); MetalProgressBarUI instance; if (o == null) { instance = new MetalProgressBarUI(); instances.put(component, instance); } else instance = (MetalProgressBarUI) o; return instance; }
|
public static ComponentUI createUI(JComponent component) { if (instances == null) instances = new HashMap(); Object o = instances.get(component); MetalProgressBarUI instance; if (o == null) { instance = new MetalProgressBarUI(); instances.put(component, instance); } else instance = (MetalProgressBarUI) o; return instance; }
| 9,982
|
boolean addAll(Collection<? extends E> c);
|
boolean addAll(int index, Collection<? extends E> c);
| 9,983
|
private void setFields(Class cl) { SetAccessibleAction setAccessible = new SetAccessibleAction(); if (!isSerializable() || isExternalizable()) { fields = NO_FIELDS; return; } try { final Field f = cl.getDeclaredField("serialPersistentFields"); setAccessible.setMember(f); AccessController.doPrivileged(setAccessible); int modifiers = f.getModifiers(); if (Modifier.isStatic(modifiers) && Modifier.isFinal(modifiers) && Modifier.isPrivate(modifiers)) { fields = getSerialPersistentFields(cl); if (fields != null) { Arrays.sort (fields); // Retrieve field reference. for (int i=0; i < fields.length; i++) { try { fields[i].lookupField(cl); } catch (NoSuchFieldException _) { fields[i].setToSet(false); } } calculateOffsets(); return; } } } catch (NoSuchFieldException ignore) { } catch (IllegalAccessException ignore) { } int num_good_fields = 0; Field[] all_fields = cl.getDeclaredFields(); int modifiers; // set non-serializable fields to null in all_fields for (int i = 0; i < all_fields.length; i++) { modifiers = all_fields[i].getModifiers(); if (Modifier.isTransient(modifiers) || Modifier.isStatic(modifiers)) all_fields[i] = null; else num_good_fields++; } // make a copy of serializable (non-null) fields fields = new ObjectStreamField[ num_good_fields ]; for (int from = 0, to = 0; from < all_fields.length; from++) if (all_fields[from] != null) { final Field f = all_fields[from]; setAccessible.setMember(f); AccessController.doPrivileged(setAccessible); fields[to] = new ObjectStreamField(all_fields[from]); to++; } Arrays.sort(fields); // Make sure we don't have any duplicate field names // (Sun JDK 1.4.1. throws an Internal Error as well) for (int i = 1; i < fields.length; i++) { if(fields[i - 1].getName().equals(fields[i].getName())) throw new InternalError("Duplicate field " + fields[i].getName() + " in class " + cl.getName()); } calculateOffsets(); }
|
private void setFields(Class cl) { SetAccessibleAction setAccessible = new SetAccessibleAction(); if (!isSerializable() || isExternalizable() || isEnum()) { fields = NO_FIELDS; return; } try { final Field f = cl.getDeclaredField("serialPersistentFields"); setAccessible.setMember(f); AccessController.doPrivileged(setAccessible); int modifiers = f.getModifiers(); if (Modifier.isStatic(modifiers) && Modifier.isFinal(modifiers) && Modifier.isPrivate(modifiers)) { fields = getSerialPersistentFields(cl); if (fields != null) { Arrays.sort (fields); // Retrieve field reference. for (int i=0; i < fields.length; i++) { try { fields[i].lookupField(cl); } catch (NoSuchFieldException _) { fields[i].setToSet(false); } } calculateOffsets(); return; } } } catch (NoSuchFieldException ignore) { } catch (IllegalAccessException ignore) { } int num_good_fields = 0; Field[] all_fields = cl.getDeclaredFields(); int modifiers; // set non-serializable fields to null in all_fields for (int i = 0; i < all_fields.length; i++) { modifiers = all_fields[i].getModifiers(); if (Modifier.isTransient(modifiers) || Modifier.isStatic(modifiers)) all_fields[i] = null; else num_good_fields++; } // make a copy of serializable (non-null) fields fields = new ObjectStreamField[ num_good_fields ]; for (int from = 0, to = 0; from < all_fields.length; from++) if (all_fields[from] != null) { final Field f = all_fields[from]; setAccessible.setMember(f); AccessController.doPrivileged(setAccessible); fields[to] = new ObjectStreamField(all_fields[from]); to++; } Arrays.sort(fields); // Make sure we don't have any duplicate field names // (Sun JDK 1.4.1. throws an Internal Error as well) for (int i = 1; i < fields.length; i++) { if(fields[i - 1].getName().equals(fields[i].getName())) throw new InternalError("Duplicate field " + fields[i].getName() + " in class " + cl.getName()); } calculateOffsets(); }
| 9,984
|
public static <T> void sort(T[] a, Comparator<? super T> c) { sort(a, 0, a.length, c); }
|
public static void sort(byte[] a) { sort(a, 0, a.length, c); }
| 9,988
|
public static <T> void sort(T[] a, Comparator<? super T> c) { sort(a, 0, a.length, c); }
|
public static <T> void sort(T[] a, Comparator<? super T> c) { qsort(a, 0, a.length); }
| 9,989
|
public void setRolloverEnabled(boolean b) { getModel().setRollover(b); }
|
public void setRolloverEnabled(boolean b) { getModel().setRollover(b); }
| 9,990
|
public Raster getRaster(int x, int y, int width, int height) { if( cachedRaster == null || cachedRaster.getWidth() < width || cachedRaster.getHeight() < height) { cachedRaster = new ColorRaster(colorModel, 0, 0, width, height, color); } return cachedRaster.createChild(0 ,0 ,width ,height ,x ,y , null); }
|
public Raster getRaster(int x, int y, int width, int height) { if( cachedRaster == null || cachedRaster.getWidth() < width || cachedRaster.getHeight() < height) { cachedRaster = new ColorRaster(colorModel, 0, 0, width, height, color); } return cachedRaster.createChild(0 ,0 ,width ,height ,0 ,0 , null); }
| 9,991
|
public Statement(Object target, String methodName, Object[] arguments) { this.target = target; this.methodName = methodName; this.arguments = arguments; }
|
public Statement(Object target, String methodName, Object[] arguments) { this.target = target; this.methodName = methodName; this.arguments = (arguments != null) ? arguments : new Object[0]; storeTargetName(target); }
| 9,992
|
public Enumeration children() { return Collections.enumeration(tree_children); }
|
public Enumeration children() { return Collections.enumeration(tree_children); }
| 9,993
|
public boolean getAllowsChildren() { return true; }
|
public boolean getAllowsChildren() { return true; }
| 9,994
|
public Element getElement(int index) { return (Element) element_children.get(index); }
|
public Element getElement(int index) { return (Element) element_children.get(index); }
| 9,995
|
public Enumeration children() { return children.elements(); }
|
public Enumeration children() { if (children.length == 0) return null; Vector tmp = new Vector(); for (int index = 0; index < children.length; ++index) tmp.add(children[index]); return tmp.elements(); }
| 9,996
|
public Element getElement(int index) { if (index < 0 || index >= children.size()) return null; return (Element) children.get(index); }
|
public Element getElement(int index) { if (index < 0 || index >= children.length) return null; return (Element) children.get(index); }
| 9,997
|
public Element getElement(int index) { if (index < 0 || index >= children.size()) return null; return (Element) children.get(index); }
|
public Element getElement(int index) { if (index < 0 || index >= children.size()) return null; return children[index]; }
| 9,998
|
public int getElementCount() { return children.size(); }
|
public int getElementCount() { return children.length; }
| 9,999
|
public int getElementIndex(int offset) { if (children.size() == 0) return 0; Element element = positionToElement(offset); if (element == null) return 0; return children.indexOf(element); }
|
public int getElementIndex(int offset) { for (int index = 0; index < children.length; ++index) { Element elem = children[index]; if ((elem.getStartOffset() <= offset) && (offset < elem.getEndOffset())) return index; } return 0; Element element = positionToElement(offset); if (element == null) return 0; return children.indexOf(element); }
| 10,000
|
public int getElementIndex(int offset) { if (children.size() == 0) return 0; Element element = positionToElement(offset); if (element == null) return 0; return children.indexOf(element); }
|
public int getElementIndex(int offset) { if (children.size() == 0) return 0; Element element = positionToElement(offset); if (element == null) return 0; return children.indexOf(element); }
| 10,001
|
public int getEndOffset() { return ((Element) children.lastElement()).getEndOffset(); }
|
public int getEndOffset() { return children[children.length - 1].getEndOffset(); }
| 10,002
|
public String getName() { return "AbstractDocument.BranchElement"; }
|
public String getName() { return ParagraphElementName; }
| 10,003
|
public int getStartOffset() { return ((Element) children.firstElement()).getStartOffset(); }
|
public int getStartOffset() { return children[0].getStartOffset(); }
| 10,004
|
public Element positionToElement(int position) { // XXX: There is surely a better algorithm // as beginning from first element each time. for (int index = 0; index < children.size(); ++index) { Element elem = (Element) children.get(index); if ((elem.getStartOffset() <= position) && (position < elem.getEndOffset())) return elem; } return null; }
|
public Element positionToElement(int position) { // XXX: There is surely a better algorithm // as beginning from first element each time. for (int index = 0; index < children.length; ++index) { Element elem = (Element) children.get(index); if ((elem.getStartOffset() <= position) && (position < elem.getEndOffset())) return elem; } return null; }
| 10,005
|
public Element positionToElement(int position) { // XXX: There is surely a better algorithm // as beginning from first element each time. for (int index = 0; index < children.size(); ++index) { Element elem = (Element) children.get(index); if ((elem.getStartOffset() <= position) && (position < elem.getEndOffset())) return elem; } return null; }
|
public Element positionToElement(int position) { // XXX: There is surely a better algorithm // as beginning from first element each time. for (int index = 0; index < children.size(); ++index) { Element elem = children[index]; if ((elem.getStartOffset() <= position) && (position < elem.getEndOffset())) return elem; } return null; }
| 10,006
|
public void replace(int offset, int length, Element[] elems) { for (int index = 0; index < length; ++index) children.removeElementAt(offset); for (int index = 0; index < elems.length; ++index) children.add(offset + index, elems[index]); }
|
public void replace(int offset, int length, Element[] elements) { for (int index = 0; index < length; ++index) children.removeElementAt(offset); for (int index = 0; index < elems.length; ++index) children.add(offset + index, elems[index]); }
| 10,007
|
public void replace(int offset, int length, Element[] elems) { for (int index = 0; index < length; ++index) children.removeElementAt(offset); for (int index = 0; index < elems.length; ++index) children.add(offset + index, elems[index]); }
|
public void replace(int offset, int length, Element[] elems) { for (int index = 0; index < length; ++index) children.removeElementAt(offset); for (int index = 0; index < elems.length; ++index) children.add(offset + index, elems[index]); }
| 10,008
|
public String toString() { return getName() + ": " + "content"; }
|
public String toString() { return ("BranchElement(" + getName() + ") " + getStartOffset() + "," + getEndOffset() + "\n"); }
| 10,009
|
public Element getElement() { return null; }
|
public Element getElement(int index) { return null; }
| 10,010
|
public String getName() { return "AbstractDocument.LeafElement"; }
|
public String getName() { return ContentElementName; }
| 10,011
|
public String toString() { return getName() + ": " + "content"; }
|
public String toString() { return ("LeafElement(" + getName() + ") " + getStartOffset() + "," + getEndOffset() + "\n"); }
| 10,012
|
public int getLength() { return content.length(); }
|
public int getLength() { return content.length() - 1; }
| 10,013
|
public boolean endsWith (Name n) { if (! (n instanceof CompoundName)) return false; CompoundName cn = (CompoundName) n; if (cn.elts.size () > elts.size ()) return false; int delta = elts.size () - cn.elts.size (); for (int i = 0; i < cn.elts.size (); ++i) { String f = canonicalize ((String) elts.get (i)); if (! f.equals (canonicalize ((String) cn.elts.get (i)))) return false; } return true; }
|
public boolean endsWith (Name n) { if (! (n instanceof CompoundName)) return false; CompoundName cn = (CompoundName) n; if (cn.elts.size () > elts.size ()) return false; int delta = elts.size () - cn.elts.size (); for (int i = 0; i < cn.elts.size (); ++i) { String f = canonicalize ((String) elts.get (delta + i)); if (! f.equals (canonicalize ((String) cn.elts.get (i)))) return false; } return true; }
| 10,014
|
public static void main(String[] args) throws Exception { ParsedArguments cmdLine = HELP_INFO.parse(args); final File entry = ARG_DIR.getFile(cmdLine); if (entry.exists()) { entry.delete(); } else { System.err.println(entry + " does not exist"); } }
|
public static void main(String[] args) throws Exception { final ParsedArguments cmdLine = HELP_INFO.parse(args); final File entry = ARG_DIR.getFile(cmdLine); if (entry.exists()) { entry.delete(); } else { System.err.println(entry + " does not exist"); } }
| 10,015
|
public static void main(String[] args) throws Exception { ParsedArguments cmdLine = HELP_INFO.parse(args); final File entry = ARG_DIR.getFile(cmdLine); if (entry.exists()) { entry.delete(); } else { System.err.println(entry + " does not exist"); } }
|
public static void main(String[] args) throws Exception { ParsedArguments cmdLine = HELP_INFO.parse(args); final File entry = ARG_DIR.getFile(cmdLine); if (entry.exists()) { entry.delete(); } else { System.err.println(entry + " does not exist"); } }
| 10,016
|
public WritableRaster createCompatibleWritableRaster(int w, int h) { return createCompatibleWritableRaster(minX, minY, w, h); }
|
public WritableRaster createCompatibleWritableRaster() { return createCompatibleWritableRaster(minX, minY, w, h); }
| 10,018
|
public WritableRaster createCompatibleWritableRaster(int w, int h) { return createCompatibleWritableRaster(minX, minY, w, h); }
|
public WritableRaster createCompatibleWritableRaster(int w, int h) { return new WritableRaster(getSampleModel(), new Point(minX, minY)); }
| 10,019
|
public int getFirstVisibleIndex() { ComponentOrientation or = getComponentOrientation(); Rectangle r = getVisibleRect(); if (or == ComponentOrientation.RIGHT_TO_LEFT) r.translate((int) r.getWidth(), 0); return getUI().locationToIndex(this, r.getLocation()); }
|
public int getFirstVisibleIndex() { ComponentOrientation or = getComponentOrientation(); Rectangle r = getVisibleRect(); if (or == ComponentOrientation.RIGHT_TO_LEFT) r.translate((int) r.getWidth() - 1, 0); return getUI().locationToIndex(this, r.getLocation()); }
| 10,020
|
public void setPopupSize(int x, int y) { // TODO } // setPopupSize()
|
public void setPopupSize(Dimension size) { // TODO } // setPopupSize()
| 10,021
|
public Object get(int index) { if (elements == null) { throw new IndexOutOfBoundsException("list is empty"); } if (index < 0 || index >= elements.length) { throw new IndexOutOfBoundsException("index=" + index + ", size=" + size()); } return elements[index]; }
|
public Object get(int index) if (elements == null) throw new IndexOutOfBoundsException("list is empty"); } if (index < 0 || index >= elements.length) throw new IndexOutOfBoundsException("index=" + index + ", size=" + size()); } return elements[index]; }
| 10,022
|
public Object get(int index) { if (elements == null) { throw new IndexOutOfBoundsException("list is empty"); } if (index < 0 || index >= elements.length) { throw new IndexOutOfBoundsException("index=" + index + ", size=" + size()); } return elements[index]; }
|
public Object get(int index) { if (elements == null) { throw new IndexOutOfBoundsException("list is empty"); if (index < 0 || index >= elements.length) { throw new IndexOutOfBoundsException("index=" + index + ", size=" + size()); return elements[index];
| 10,023
|
public Object get(int index) { if (elements == null) { throw new IndexOutOfBoundsException("list is empty"); } if (index < 0 || index >= elements.length) { throw new IndexOutOfBoundsException("index=" + index + ", size=" + size()); } return elements[index]; }
|
public Object get(int index) { if (elements == null) { throw new IndexOutOfBoundsException("list is empty"); } if (index < 0 || index >= elements.length) { throw new IndexOutOfBoundsException("index=" + index + ", size=" + size()); } return elements[index]; }
| 10,024
|
public String[] _ids() { return ids; }
|
public final String[] _ids() { return ids; }
| 10,025
|
public OutputStream _invoke(String method, InputStream input, ResponseHandler rh ) { OutputStream output = null; if (method.equals("destroy")) { // The "destroy" has been invoked. destroy(); output = rh.createReply(); } else if (method.equals("copy")) { // The "copy" has been invoked. org.omg.CORBA.Object returns = copy(); output = rh.createReply(); output.write_Object(returns); } else if (method.equals("policy_type")) { // The "policy_type" has been invoked. int returns = policy_type(); output = rh.createReply(); output.write_long(returns); } else throw new BAD_OPERATION(method, 0, CompletionStatus.COMPLETED_MAYBE); return output; }
|
public final OutputStream _invoke(String method, InputStream input, ResponseHandler rh ) { OutputStream output = null; if (method.equals("destroy")) { // The "destroy" has been invoked. destroy(); output = rh.createReply(); } else if (method.equals("copy")) { // The "copy" has been invoked. org.omg.CORBA.Object returns = copy(); output = rh.createReply(); output.write_Object(returns); } else if (method.equals("policy_type")) { // The "policy_type" has been invoked. int returns = policy_type(); output = rh.createReply(); output.write_long(returns); } else throw new BAD_OPERATION(method, 0, CompletionStatus.COMPLETED_MAYBE); return output; }
| 10,026
|
public OutputStream _invoke(String method, InputStream input, ResponseHandler rh ) { OutputStream output = null; if (method.equals("destroy")) { // The "destroy" has been invoked. destroy(); output = rh.createReply(); } else if (method.equals("copy")) { // The "copy" has been invoked. org.omg.CORBA.Object returns = copy(); output = rh.createReply(); output.write_Object(returns); } else if (method.equals("policy_type")) { // The "policy_type" has been invoked. int returns = policy_type(); output = rh.createReply(); output.write_long(returns); } else throw new BAD_OPERATION(method, 0, CompletionStatus.COMPLETED_MAYBE); return output; }
|
public OutputStream _invoke(String method, InputStream input, ResponseHandler rh ) { OutputStream output = null; if (method.equals("destroy")) { // The "destroy" has been invoked. destroy(); output = rh.createReply(); } else if (method.equals("copy")) { // The "copy" has been invoked. org.omg.CORBA.Object returns = copy(); output = rh.createReply(); output.write_Object(this); } else if (method.equals("policy_type")) { // The "policy_type" has been invoked. int returns = policy_type(); output = rh.createReply(); output.write_long(returns); } else throw new BAD_OPERATION(method, 0, CompletionStatus.COMPLETED_MAYBE); return output; }
| 10,027
|
public abstract short getShort (int index);
|
public abstract short getShort ();
| 10,029
|
public final ByteBuffer order (ByteOrder endian) { this.endian = endian; return this; }
|
public final ByteOrder order () { this.endian = endian; return this; }
| 10,030
|
public final ByteBuffer order (ByteOrder endian) { this.endian = endian; return this; }
|
public final ByteBuffer order (ByteOrder endian) { this.endian = endian; return this; }
| 10,031
|
public Manifest(InputStream in) throws IOException { this(); read(in); }
|
public Manifest() { this(); read(in); }
| 10,032
|
public Manifest(InputStream in) throws IOException { this(); read(in); }
|
public Manifest(InputStream in) throws IOException { this(); read(in); }
| 10,033
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.