bugged stringlengths 6 599k | fixed stringlengths 10 599k | __index_level_0__ int64 0 1.13M |
|---|---|---|
private void buildMethodHash(Class cls, boolean build) { Method[] meths = cls.getMethods(); for (int i = 0; i < meths.length; i++) { /* Don't need to include any java.xxx related stuff */ if (meths[i].getDeclaringClass().getName().startsWith("java.")) { continue; } long hash = RMIHashes.getMethodHash(meths[i]); ... | private void buildMethodHash(Class cls, boolean build) { Method[] meths = cls.getMethods(); for (int i = 0; i < meths.length; i++) { /* Don't need to include any java.xxx related stuff */ if (meths[i].getDeclaringClass().getName().startsWith("java.")) { continue; long hash = RMIHashes.getMethodHash(meths[i]); i... | 7,898 |
public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | 7,899 |
public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | 7,900 |
public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | 7,901 |
public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | 7,902 |
public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | public RemoteStub exportObject(Remote obj) throws RemoteException { if (myself == null) { myself = obj; // Save it to server manager, to let client calls in the same VM to issue // local call manager.serverobj = obj; // Find and install the stub Class cls = obj.getClass(); Class expCls; try { // where ist th... | 7,903 |
private Class findStubSkelClass(Class startCls) throws Exception { Class cls = startCls; while (true) { try { String stubClassname = cls.getName() + "_Stub"; ClassLoader cl = cls.getClassLoader(); Class scls = cl == null ? Class.forName(stubClassname) : cl.loadClass(stubClassname); return cls; // found it... | private Class findStubSkelClass(Class startCls) { Class cls = startCls; while (true) { try { String stubClassname = cls.getName() + "_Stub"; ClassLoader cl = cls.getClassLoader(); Class scls = cl == null ? Class.forName(stubClassname) : cl.loadClass(stubClassname); return cls; // found it } catch (ClassN... | 7,904 |
private Class findStubSkelClass(Class startCls) throws Exception { Class cls = startCls; while (true) { try { String stubClassname = cls.getName() + "_Stub"; ClassLoader cl = cls.getClassLoader(); Class scls = cl == null ? Class.forName(stubClassname) : cl.loadClass(stubClassname); return cls; // found it... | private Class findStubSkelClass(Class startCls) throws Exception { Class cls = startCls; while (true) { try { String stubClassname = cls.getName() + "_Stub"; ClassLoader cl = cls.getClassLoader(); Class scls = cl == null ? Class.forName(stubClassname) : cl.loadClass(stubClassname); return cls; // found it... | 7,905 |
public RemoteStub getStub(){ return stub;} | public Remote getStub() { return stub;} | 7,906 |
public Object incomingMessageCall(UnicastConnection conn, int method, long hash) throws Exception {//System.out.println("method = " + method + ", hash = " + hash); // If method is -1 then this is JDK 1.2 RMI - so use the hash // to locate the method if (method == -1) { Method meth = (Method)methods.get(new Long (hash)... | public Object incomingMessageCall(UnicastConnection conn, int method, long hash) throws Exception {//System.out.println("method = " + method + ", hash = " + hash); // If method is -1 then this is JDK 1.2 RMI - so use the hash // to locate the method if (method == -1) { Method meth = (Method)methods.get(new Long (hash)... | 7,907 |
public Object incomingMessageCall(UnicastConnection conn, int method, long hash) throws Exception {//System.out.println("method = " + method + ", hash = " + hash); // If method is -1 then this is JDK 1.2 RMI - so use the hash // to locate the method if (method == -1) { Method meth = (Method)methods.get(new Long (hash)... | public Object incomingMessageCall(UnicastConnection conn, int method, long hash) throws Exception {//System.out.println("method = " + method + ", hash = " + hash); // If method is -1 then this is JDK 1.2 RMI - so use the hash // to locate the method if (method == -1) { Method meth = (Method)methods.get(new Long (hash)... | 7,908 |
private void jbInit() throws Exception { try { setIconImage(GUIGraphicsUtils.getApplicationIcon().getImage()); // set title setTitle(LangTool.getString("xtfr.wizardTitle")); // Load the JDBC driver. Driver driver2 = (Driver)Class.forName("com.ibm.as400.access.AS400JDBCDri... | private void jbInit() throws Exception { try { setIconImage(GUIGraphicsUtils.getApplicationIcon().getImage()); // set title setTitle(LangTool.getString("xtfr.wizardTitle")); // Load the JDBC driver. Driver driver2 = (Driver)Class.forName("com.ibm.as400.access.AS400JDBCDri... | 7,909 |
public boolean equals (Object obj) { if (! (obj instanceof CollationKey)) return false; CollationKey ck = (CollationKey) obj; if (ck.collator != collator) return false; if (!ck.getSourceString ().equals (getSourceString ())) return false; if (!ck.toByteArray ().equals (toByteArray ())) ... | public boolean equals (Object obj) { if (! (obj instanceof CollationKey)) return false; CollationKey ck = (CollationKey) obj; if (ck.collator != collator) return false; if (!ck.getSourceString ().equals (getSourceString ())) return false; if (! Arrays.equals (ck.toByteArray (), toByteAr... | 7,910 |
public List getIOAxesOrder() { synchronized (axesIOList) { return axesIOList; } } | public List getIOAxesOrder() { if (axesIOList == null) return parentArray.getAxes(); else return axesIOList; } } | 7,911 |
public List getIOAxesOrder() { synchronized (axesIOList) { return axesIOList; } } | public List getIOAxesOrder() { synchronized (axesIOList) { return axesIOList; | 7,912 |
private void privateSetIOAxesOrder (List axisOrderList) { synchronized (axesIOList) { axesIOList = Collections.synchronizedList(new ArrayList()); for (int i = 0, size = axesIOList.size(); i < size; i++) { axesIOList.add(axisOrderList.get(i)); } } } | private void privateSetIOAxesOrder (List axisOrderList) { synchronized (axesIOList) { axesIOList = Collections.synchronizedList(new ArrayList()); for (int i = 0, size = axisOrderList.size(); i < size; i++) { axesIOList.add(axisOrderList.get(i)); } } ... | 7,913 |
public Locator(Array array) { Log.debug("in Locator(Array)"); parentArray = array; List axisList = parentArray.getAxisList(); /**now, since we KNOW _parentArray is defined * (has to be instanciated via Array ONLY) * we can proceed to initialize the axis, index positions * to the origin (ie ind... | public Locator(Array array) { parentArray = array; List axisList = parentArray.getAxisList(); /**now, since we KNOW _parentArray is defined * (has to be instanciated via Array ONLY) * we can proceed to initialize the axis, index positions * to the origin (ie index 0 for each axis). * We c... | 7,914 |
public AccessibleContext getAccessibleContext() { return null; } | public AccessibleContext getAccessibleContext() { if (accessibleContext == null) accessibleContext = new AccessibleJWindow(); return accessibleContext; } | 7,915 |
public PrinterThread (char[] sc, Font font, int cols, int rows, Color colorBg, boolean toDefaultPrinter, Session ses) { setPriority(1); session = ses; session.setCursor(Cursor.getPredefinedCursor(Cursor.WAIT_CURSOR)); config = ses.getConfiguration(); screen = new ch... | public PrinterThread (Screen5250 scr, Font font, int cols, int rows, Color colorBg, boolean toDefaultPrinter, Session ses) { setPriority(1); session = ses; session.setCursor(Cursor.getPredefinedCursor(Cursor.WAIT_CURSOR)); config = ses.getConfiguration(); screen = n... | 7,916 |
public PrinterThread (char[] sc, Font font, int cols, int rows, Color colorBg, boolean toDefaultPrinter, Session ses) { setPriority(1); session = ses; session.setCursor(Cursor.getPredefinedCursor(Cursor.WAIT_CURSOR)); config = ses.getConfiguration(); screen = new ch... | public PrinterThread (char[] sc, Font font, int cols, int rows, Color colorBg, boolean toDefaultPrinter, Session ses) { setPriority(1); session = ses; session.setCursor(Cursor.getPredefinedCursor(Cursor.WAIT_CURSOR)); config = ses.getConfiguration(); screen = new ch... | 7,917 |
public PrinterThread (char[] sc, Font font, int cols, int rows, Color colorBg, boolean toDefaultPrinter, Session ses) { setPriority(1); session = ses; session.setCursor(Cursor.getPredefinedCursor(Cursor.WAIT_CURSOR)); config = ses.getConfiguration(); screen = new ch... | public PrinterThread (char[] sc, Font font, int cols, int rows, Color colorBg, boolean toDefaultPrinter, Session ses) { setPriority(1); session = ses; session.setCursor(Cursor.getPredefinedCursor(Cursor.WAIT_CURSOR)); config = ses.getConfiguration(); screen = new ch... | 7,918 |
public int print (Graphics g, PageFormat pageFormat, int page) { Graphics2D g2; //--- Validate the page number, we only print the first page if (page == 0) { //--- Create a graphic2D object and set the default parameters g2 = (Graphics2D) g; g2.setColor (Color.black); /... | public int print (Graphics g, PageFormat pageFormat, int page) { Graphics2D g2; //--- Validate the page number, we only print the first page if (page == 0) { //--- Create a graphic2D object and set the default parameters g2 = (Graphics2D) g; g2.setColor (Color.black); /... | 7,919 |
protected PluginDescriptorModel readDescriptor(File descriptor) { final PluginDescriptorModel descr; try { final XMLElement root = new XMLElement(new Hashtable(), true, false); try { final FileReader r = new FileReader(descriptor); try { ... | protected PluginDescriptorModel readDescriptor(File descriptor) { final PluginDescriptorModel descr; try { final XMLElement root = new XMLElement(new Hashtable(), true, false); try { final FileReader r = new FileReader(descriptor); try { ... | 7,923 |
private void parseIncoming() { boolean controlChars = false; byte control0; byte control1; boolean done = false; boolean error = false; try { while (bk.hasNext() && !done) { byte b = bk.getNextByte(); switch (b) { case 0: case 1:... | private void parseIncoming() { boolean controlChars = false; byte control0; byte control1; boolean done = false; boolean error = false; try { while (bk.hasNext() && !done) { byte b = bk.getNextByte(); switch (b) { case 0: case 1:... | 7,925 |
public void run () { while (keepTrucking) { try { bk = (Stream5250)dsq.get(); } catch (InterruptedException ie) { System.out.println(" vt thread interrupted and stopping "); keepTrucking = false; continue; } // lets play nicel... | public void run () { while (keepTrucking) { try { bk = (Stream5250)dsq.get(); } catch (InterruptedException ie) { System.out.println(" vt thread interrupted and stopping "); keepTrucking = false; continue; } // lets play nicel... | 7,928 |
protected TextRenderer createTextRenderer(RenderCache renderCache, Font font) { final String renderer = (String)AccessController.doPrivileged(new GetPropertyAction("jnode.font.renderer", "simple")); TextRenderer r; if (false || renderer.equals("new")) { r = new TTFTextRenderer(renderCac... | protected TextRenderer createTextRenderer(RenderCache renderCache, Font font) { TextRenderer r; if (false || renderer.equals("new")) { r = new TTFTextRenderer(renderCache, getFontMetrics(font), getFontData(font)); } else { r = new TTFSimpleTextRenderer(getFontData(fon... | 7,932 |
protected TextRenderer createTextRenderer(RenderCache renderCache, Font font) { final String renderer = (String)AccessController.doPrivileged(new GetPropertyAction("jnode.font.renderer", "simple")); TextRenderer r; if (false || renderer.equals("new")) { r = new TTFTextRenderer(renderCac... | protected TextRenderer createTextRenderer(RenderCache renderCache, Font font) { final String renderer = (String)AccessController.doPrivileged(new GetPropertyAction("jnode.font.renderer", "simple")); TextRenderer r; r = new TTFTextRenderer(renderCache, getFontMetrics(font), getFontData(... | 7,933 |
protected TextRenderer createTextRenderer(RenderCache renderCache, Font font) { final String renderer = (String)AccessController.doPrivileged(new GetPropertyAction("jnode.font.renderer", "simple")); TextRenderer r; if (false || renderer.equals("new")) { r = new TTFTextRenderer(renderCac... | protected TextRenderer createTextRenderer(RenderCache renderCache, Font font) { final String renderer = (String)AccessController.doPrivileged(new GetPropertyAction("jnode.font.renderer", "simple")); TextRenderer r; if (false || renderer.equals("new")) { r = new TTFTextRenderer(renderCac... | 7,934 |
public GapContent() { this(10); } | public GapContent() { this(DEFAULT_BUFSIZE); } | 7,935 |
public void getChars(int where, int len, Segment txt) throws BadLocationException { txt.array = new char[len]; System.arraycopy(buf.toString().toCharArray(), where, txt.array, 0, len); txt.count = len; txt.offset = 0; } | public void getChars(int where, int len, Segment txt) throws BadLocationException { int length = length(); if (where >= length) throw new BadLocationException("the where argument cannot be greater" + " than the content length", where); if ((where + len) > length) throw new BadLocationException("len plus where c... | 7,936 |
public void getChars(int where, int len, Segment txt) throws BadLocationException { txt.array = new char[len]; System.arraycopy(buf.toString().toCharArray(), where, txt.array, 0, len); txt.count = len; txt.offset = 0; } | public void getChars(int where, int len, Segment txt) throws BadLocationException { txt.array = new char[len]; System.arraycopy(buf.toString().toCharArray(), where, txt.array, 0, len); txt.count = len; txt.offset = 0; } | 7,937 |
public void getChars(int where, int len, Segment txt) throws BadLocationException { txt.array = new char[len]; System.arraycopy(buf.toString().toCharArray(), where, txt.array, 0, len); txt.count = len; txt.offset = 0; } | public void getChars(int where, int len, Segment txt) throws BadLocationException { txt.array = new char[len]; System.arraycopy(buf.toString().toCharArray(), where, txt.array, 0, len); txt.count = len; txt.offset = 0; txt.count = len; } else { txt.array = buffer; if (where < gapStart) txt.offset = w... | 7,938 |
public String getString(int where, int len) throws BadLocationException { return buf.substring(where, where+len); } | public String getString(int where, int len) throws BadLocationException { Segment seg = new Segment(); getChars(where, len, seg); return new String(seg.array, seg.offset, seg.count); } | 7,939 |
public UndoableEdit insertString(int where, String str) throws BadLocationException { buf.insert(where, str); return null; } | public UndoableEdit insertString(int where, String str) throws BadLocationException { int length = length(); int strLen = str.length(); if (where >= length) throw new BadLocationException("the where argument cannot be greater" + " than the content length", where); if ((gapEnd - gapStart) < strLen) shiftEnd(... | 7,940 |
public int length() { return buf.length(); } | public int length() { return buffer.length - (gapEnd - gapStart); } | 7,941 |
public UndoableEdit remove(int where, int nitems) throws BadLocationException { buf.delete(where, where + nitems); return null; } | public UndoableEdit remove(int where, int nitems) throws BadLocationException { int length = length(); if (where >= length) throw new BadLocationException("the where argument cannot be greater" + " than the content length", where); if ((where + nitems) > length) throw new BadLocationException("where + nitems c... | 7,942 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); Object last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == KeyEv... | 7,944 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == KeyEvent.VK_DO... | 7,945 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | 7,946 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | 7,947 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | 7,948 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | 7,949 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | 7,950 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | 7,951 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | 7,952 |
public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | public void keyPressed(KeyEvent e) { TreePath start = BasicTreeUI.this.tree.getLeadSelectionPath(); TreeNode last = null; if (start != null) last = (TreeNode) start.getLastPathComponent(); if (last != null) { // DOWN, KP_DOWN if (e.getKeyCode() == Key... | 7,953 |
Point getCellLocation(int x, int y, JTree tree, TreeModel mod, Object node, Object startNode) { int rowHeight = getRowHeight(); if (startNode == null || startNode.equals(node)) { if (!tree.isRootVisible() && tree.isExpanded(new TreePath(mod.getRoot()))) return new Point(x + ((getL... | Point getCellLocation(int x, int y, JTree tree, TreeModel mod, Object node, Object startNode) { int rowHeight = getRowHeight(); if (startNode == null || startNode.equals(node)) { if (!tree.isRootVisible() && tree.isExpanded(new TreePath(mod.getRoot()))) return new Point(x + ((getL... | 7,956 |
Point getCellLocation(int x, int y, JTree tree, TreeModel mod, Object node, Object startNode) { int rowHeight = getRowHeight(); if (startNode == null || startNode.equals(node)) { if (!tree.isRootVisible() && tree.isExpanded(new TreePath(mod.getRoot()))) return new Point(x + ((getL... | Point getCellLocation(int x, int y, JTree tree, TreeModel mod, Object node, Object startNode) { int rowHeight = getRowHeight(); if (startNode == null || startNode.equals(node)) { if (!tree.isRootVisible() && tree.isExpanded(new TreePath(mod.getRoot()))) return new Point(x + ((getL... | 7,957 |
Point getCellLocation(int x, int y, JTree tree, TreeModel mod, Object node, Object startNode) { int rowHeight = getRowHeight(); if (startNode == null || startNode.equals(node)) { if (!tree.isRootVisible() && tree.isExpanded(new TreePath(mod.getRoot()))) return new Point(x + ((getL... | Point getCellLocation(int x, int y, JTree tree, TreeModel mod, Object node, Object startNode) { int rowHeight = getRowHeight(); if (startNode == null || startNode.equals(node)) { if (!tree.isRootVisible() && tree.isExpanded(new TreePath(mod.getRoot()))) return new Point(x + ((getL... | 7,958 |
Point getCellLocation(int x, int y, JTree tree, TreeModel mod, Object node, Object startNode) { int rowHeight = getRowHeight(); if (startNode == null || startNode.equals(node)) { if (!tree.isRootVisible() && tree.isExpanded(new TreePath(mod.getRoot()))) return new Point(x + ((getL... | Point getCellLocation(int x, int y, JTree tree, TreeModel mod, Object node, Object startNode) { int rowHeight = getRowHeight(); if (startNode == null || startNode.equals(node)) { if (!tree.isRootVisible() && tree.isExpanded(new TreePath(mod.getRoot()))) return new Point(x + ((getL... | 7,959 |
public int getLevel(TreeNode node) { int count = -1; TreeNode current = node; do { current = current.getParent(); count++; } while (current != null); return count; } | int getLevel(Object node) { int count = -1; TreeNode current = node; do { current = current.getParent(); count++; } while (current != null); return count; } | 7,960 |
public int getLevel(TreeNode node) { int count = -1; TreeNode current = node; do { current = current.getParent(); count++; } while (current != null); return count; } | public int getLevel(TreeNode node) { int count = -1; Object current = node; do { current = current.getParent(); count++; } while (current != null); return count; } | 7,961 |
public int getLevel(TreeNode node) { int count = -1; TreeNode current = node; do { current = current.getParent(); count++; } while (current != null); return count; } | public int getLevel(TreeNode node) { int count = -1; TreeNode current = node; do { current = getParent(tree.getModel().getRoot(), current); count++; } while (current != null); return count; } | 7,962 |
TreeNode getNextNode(TreeNode curr) { if (curr.getChildCount() != 0) return curr.getChildAt(0); TreeNode node = curr; TreeNode sibling; do { sibling = getNextSibling(node); node = node.getParent(); } while (sibling == null && node != null); return sibl... | Object getNextNode(Object curr) { if (curr.getChildCount() != 0) return curr.getChildAt(0); TreeNode node = curr; TreeNode sibling; do { sibling = getNextSibling(node); node = node.getParent(); } while (sibling == null && node != null); return sibling;... | 7,963 |
TreeNode getNextNode(TreeNode curr) { if (curr.getChildCount() != 0) return curr.getChildAt(0); TreeNode node = curr; TreeNode sibling; do { sibling = getNextSibling(node); node = node.getParent(); } while (sibling == null && node != null); return sibl... | TreeNode getNextNode(TreeNode curr) { if (curr.getChildCount() != 0) return curr.getChildAt(0); TreeNode node = curr; TreeNode sibling; do { sibling = getNextSibling(node); node = node.getParent(); } while (sibling == null && node != null); return sibl... | 7,964 |
TreeNode getNextNode(TreeNode curr) { if (curr.getChildCount() != 0) return curr.getChildAt(0); TreeNode node = curr; TreeNode sibling; do { sibling = getNextSibling(node); node = node.getParent(); } while (sibling == null && node != null); return sibl... | TreeNode getNextNode(TreeNode curr) { if (curr.getChildCount() != 0) return curr.getChildAt(0); TreeNode node = curr; TreeNode sibling; do { sibling = getNextSibling(node); node = node.getParent(); } while (sibling == null && node != null); return sibl... | 7,965 |
TreeNode getNextNode(TreeNode curr) { if (curr.getChildCount() != 0) return curr.getChildAt(0); TreeNode node = curr; TreeNode sibling; do { sibling = getNextSibling(node); node = node.getParent(); } while (sibling == null && node != null); return sibl... | TreeNode getNextNode(TreeNode curr) { if (curr.getChildCount() != 0) return curr.getChildAt(0); TreeNode node = curr; TreeNode sibling; do { sibling = getNextSibling(node); node = getParent(mod.getRoot(), node); } while (sibling == null && node != null); ... | 7,966 |
TreeNode getNextSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) + 1; if (index == parent.getChildCount()) return null; return parent.getChildAt(index); } | Object getNextSibling(Object node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) + 1; if (index == parent.getChildCount()) return null; return parent.getChildAt(index); } | 7,967 |
TreeNode getNextSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) + 1; if (index == parent.getChildCount()) return null; return parent.getChildAt(index); } | TreeNode getNextSibling(TreeNode node) { TreeModel mod = tree.getModel(); Object parent = getParent(mod.getRoot(), node); if (parent == null) return null; int index = parent.getIndex(node) + 1; if (index == parent.getChildCount()) return null; return parent.getChildAt(index); } | 7,968 |
TreeNode getNextSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) + 1; if (index == parent.getChildCount()) return null; return parent.getChildAt(index); } | TreeNode getNextSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = mod.getIndexOfChild(parent, node) + 1; if (index == parent.getChildCount()) return null; return parent.getChildAt(index); } | 7,969 |
TreeNode getNextSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) + 1; if (index == parent.getChildCount()) return null; return parent.getChildAt(index); } | TreeNode getNextSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) + 1; if (index == 0 || index >= mod.getChildCount(parent)) return null; return parent.getChildAt(index); } | 7,970 |
TreeNode getNextSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) + 1; if (index == parent.getChildCount()) return null; return parent.getChildAt(index); } | TreeNode getNextSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) + 1; if (index == parent.getChildCount()) return null; return mod.getChild(parent, index); } | 7,971 |
TreeNode getNextVisibleNode(TreeNode node) { TreeNode next = null; TreePath current = null; if (node != null) next = getNextNode(node); if (next != null) { current = new TreePath(getPathToRoot(next, 0)); if (tree.isVisible(current)) return next; while (n... | Object getNextVisibleNode(Object node) { TreeNode next = null; TreePath current = null; if (node != null) next = getNextNode(node); if (next != null) { current = new TreePath(getPathToRoot(next, 0)); if (tree.isVisible(current)) return next; while (next ... | 7,972 |
TreeNode getNextVisibleNode(TreeNode node) { TreeNode next = null; TreePath current = null; if (node != null) next = getNextNode(node); if (next != null) { current = new TreePath(getPathToRoot(next, 0)); if (tree.isVisible(current)) return next; while (n... | TreeNode getNextVisibleNode(TreeNode node) { Object next = null; TreePath current = null; if (node != null) next = getNextNode(node); if (next != null) { current = new TreePath(getPathToRoot(next, 0)); if (tree.isVisible(current)) return next; while (nex... | 7,973 |
public Rectangle getPathBounds(JTree tree, TreePath path) { if (path != null) { Object cell = path.getLastPathComponent(); TreeModel mod = tree.getModel(); TreeNode root = (TreeNode) mod.getRoot(); if (!tree.isRootVisible() && tree.isExpanded(new TreePath(root))) ... | public Rectangle getPathBounds(JTree tree, TreePath path) { if (path != null) { Object cell = path.getLastPathComponent(); TreeModel mod = tree.getModel(); TreeNode root = (TreeNode) mod.getRoot(); if (!tree.isRootVisible() && tree.isExpanded(new TreePath(root))) ... | 7,974 |
public TreePath getPathForRow(JTree tree, int row) { TreeNode node = ((TreeNode) (tree.getModel()).getRoot()); if (!tree.isRootVisible() && tree.isExpanded(new TreePath(getPathToRoot(node, 0)))) node = getNextNode(node); for (int i = 0; i < row; i++) node = getNextVisibleNode(node); /... | public TreePath getPathForRow(JTree tree, int row) { TreeModel mod = tree.getModel(); if (mod != null) { Object node = mod.getRoot(); if (!tree.isRootVisible() && tree.isExpanded(new TreePath(getPathToRoot(node, 0)))) node = getNextNode(node); for (int i = 0; i < row; i++) node = getNextVi... | 7,976 |
TreeNode[] getPathToRoot(TreeNode node, int depth) { if (node == null) { if (depth == 0) return null; return new TreeNode[depth]; } TreeNode[] path = getPathToRoot(node.getParent(), depth + 1); path[path.length - depth - 1] = node; return path; } | Object[] getPathToRoot(Object node, int depth) { if (node == null) { if (depth == 0) return null; return new TreeNode[depth]; } TreeNode[] path = getPathToRoot(node.getParent(), depth + 1); path[path.length - depth - 1] = node; return path; } | 7,978 |
TreeNode[] getPathToRoot(TreeNode node, int depth) { if (node == null) { if (depth == 0) return null; return new TreeNode[depth]; } TreeNode[] path = getPathToRoot(node.getParent(), depth + 1); path[path.length - depth - 1] = node; return path; } | TreeNode[] getPathToRoot(TreeNode node, int depth) { if (node == null) { if (depth == 0) return null; return new Object[depth]; } TreeNode[] path = getPathToRoot(node.getParent(), depth + 1); path[path.length - depth - 1] = node; return path; } | 7,979 |
TreeNode[] getPathToRoot(TreeNode node, int depth) { if (node == null) { if (depth == 0) return null; return new TreeNode[depth]; } TreeNode[] path = getPathToRoot(node.getParent(), depth + 1); path[path.length - depth - 1] = node; return path; } | TreeNode[] getPathToRoot(TreeNode node, int depth) { if (node == null) { if (depth == 0) return null; return new TreeNode[depth]; } Object[] path = getPathToRoot(getParent(mod.getRoot(), node), depth + 1); path[path.length - depth - 1] = node; return path; } | 7,980 |
TreeNode getPreviousNode(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; TreeNode sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = sibling.getChildCount(); while (size > 0) { sibling = sibling.getChildAt(s... | Object getPreviousNode(Object node) { TreeNode parent = node.getParent(); if (parent == null) return null; TreeNode sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = sibling.getChildCount(); while (size > 0) { sibling = sibling.getChildAt(size ... | 7,981 |
TreeNode getPreviousNode(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; TreeNode sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = sibling.getChildCount(); while (size > 0) { sibling = sibling.getChildAt(s... | TreeNode getPreviousNode(TreeNode node) { TreeModel mod = tree.getModel(); Object parent = getParent(mod.getRoot(), node); if (parent == null) return null; TreeNode sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = sibling.getChildCount(); while (size ... | 7,982 |
TreeNode getPreviousNode(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; TreeNode sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = sibling.getChildCount(); while (size > 0) { sibling = sibling.getChildAt(s... | TreeNode getPreviousNode(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; Object sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = sibling.getChildCount(); while (size > 0) { sibling = sibling.getChildAt(siz... | 7,983 |
TreeNode getPreviousNode(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; TreeNode sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = sibling.getChildCount(); while (size > 0) { sibling = sibling.getChildAt(s... | TreeNode getPreviousNode(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; TreeNode sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = mod.getChildCount(sibling); while (size > 0) { sibling = sibling.getChildA... | 7,984 |
TreeNode getPreviousNode(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; TreeNode sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = sibling.getChildCount(); while (size > 0) { sibling = sibling.getChildAt(s... | TreeNode getPreviousNode(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; TreeNode sibling = getPreviousSibling(node); if (sibling == null) return parent; int size = sibling.getChildCount(); while (size > 0) { sibling = sibling.getChildAt(s... | 7,985 |
TreeNode getPreviousSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) - 1; if (index < 0) return null; return parent.getChildAt(index); } | Object getPreviousSibling(Object node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) - 1; if (index < 0) return null; return parent.getChildAt(index); } | 7,986 |
TreeNode getPreviousSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) - 1; if (index < 0) return null; return parent.getChildAt(index); } | TreeNode getPreviousSibling(TreeNode node) { TreeModel mod = tree.getModel(); Object parent = getParent(mod.getRoot(), node); if (parent == null) return null; int index = parent.getIndex(node) - 1; if (index < 0) return null; return parent.getChildAt(index); } | 7,987 |
TreeNode getPreviousSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) - 1; if (index < 0) return null; return parent.getChildAt(index); } | TreeNode getPreviousSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = mod.getIndexOfChild(parent, node) - 1; if (index < 0) return null; return parent.getChildAt(index); } | 7,988 |
TreeNode getPreviousSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) - 1; if (index < 0) return null; return parent.getChildAt(index); } | TreeNode getPreviousSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) - 1; if (index < 0 || index >= mod.getChildCount(parent)) return null; return parent.getChildAt(index); } | 7,989 |
TreeNode getPreviousSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) - 1; if (index < 0) return null; return parent.getChildAt(index); } | TreeNode getPreviousSibling(TreeNode node) { TreeNode parent = node.getParent(); if (parent == null) return null; int index = parent.getIndex(node) - 1; if (index < 0) return null; return mod.getChild(parent, index); } | 7,990 |
TreeNode getPreviousVisibleNode(TreeNode node) { TreeNode prev = null; TreePath current = null; if (node != null) prev = getPreviousNode(node); if (prev != null) { current = new TreePath(getPathToRoot(prev, 0)); if (tree.isVisible(current)) return prev; ... | Object getPreviousVisibleNode(Object node) { TreeNode prev = null; TreePath current = null; if (node != null) prev = getPreviousNode(node); if (prev != null) { current = new TreePath(getPathToRoot(prev, 0)); if (tree.isVisible(current)) return prev; whil... | 7,991 |
TreeNode getPreviousVisibleNode(TreeNode node) { TreeNode prev = null; TreePath current = null; if (node != null) prev = getPreviousNode(node); if (prev != null) { current = new TreePath(getPathToRoot(prev, 0)); if (tree.isVisible(current)) return prev; ... | TreeNode getPreviousVisibleNode(TreeNode node) { Object prev = null; TreePath current = null; if (node != null) prev = getPreviousNode(node); if (prev != null) { current = new TreePath(getPathToRoot(prev, 0)); if (tree.isVisible(current)) return prev; wh... | 7,992 |
public int getRowCount(JTree tree) { TreeNode node = ((TreeNode) (tree.getModel()) .getRoot()); if (!tree.isRootVisible() && tree.isExpanded(new TreePath((getPathToRoot(node, 0))))) node = getNextNode(node); int count = 0; while (node != null) { count++... | public int getRowCount(JTree tree) { TreeNode node = ((TreeNode) (tree.getModel()) .getRoot()); if (!tree.isRootVisible() && tree.isExpanded(new TreePath((getPathToRoot(node, 0))))) node = getNextNode(node); int count = 0; while (node != null) { count++... | 7,993 |
public int getRowCount(JTree tree) { TreeNode node = ((TreeNode) (tree.getModel()) .getRoot()); if (!tree.isRootVisible() && tree.isExpanded(new TreePath((getPathToRoot(node, 0))))) node = getNextNode(node); int count = 0; while (node != null) { count++... | public int getRowCount(JTree tree) { TreeNode node = ((TreeNode) (tree.getModel()) .getRoot()); if (!tree.isRootVisible() && tree.isExpanded(new TreePath((getPathToRoot(node, 0))))) node = getNextNode(node); while (node != null) { count++; node... | 7,994 |
public void installUI(JComponent c) { super.installUI(c); installDefaults((JTree) c); tree = (JTree) c; setModel(tree.getModel()); tree.setRootVisible(true); tree.expandPath(new TreePath(tree.getModel().getRoot())); treeSelectionModel = tree.getSelectionModel(); installListeners(); installKeyboardAction... | public void installUI(JComponent c) { super.installUI(c); installDefaults((JTree) c); tree = (JTree) c; TreeModel mod = tree.getModel(); setModel(mod); tree.setRootVisible(true); tree.expandPath(new TreePath(tree.getModel().getRoot())); treeSelectionModel = tree.getSelectionModel(); installListeners(); ... | 7,997 |
public void installUI(JComponent c) { super.installUI(c); installDefaults((JTree) c); tree = (JTree) c; setModel(tree.getModel()); tree.setRootVisible(true); tree.expandPath(new TreePath(tree.getModel().getRoot())); treeSelectionModel = tree.getSelectionModel(); installListeners(); installKeyboardAction... | public void installUI(JComponent c) { super.installUI(c); installDefaults((JTree) c); tree = (JTree) c; setModel(tree.getModel()); tree.setRootVisible(true); if (mod != null) tree.expandPath(new TreePath(mod.getRoot())); treeSelectionModel = tree.getSelectionModel(); installListeners(); installKeyboardA... | 7,998 |
protected boolean isLeaf(int row) { TreePath pathForRow = getPathForRow(tree, row); if (pathForRow == null) return true; Object node = pathForRow.getLastPathComponent(); if (node instanceof TreeNode) return ((TreeNode) node).isLeaf(); else return true; } | protected boolean isLeaf(int row) { TreePath pathForRow = getPathForRow(tree, row); if (pathForRow == null) return true; Object node = pathForRow.getLastPathComponent(); if (node instanceof TreeNode) return ((TreeNode) node).isLeaf(); else return true; } | 7,999 |
int paintControlIcons(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object node) { int h = descent; int rowHeight = getRowHeight(); Icon ei = UIManager.getLookAndFeelDefaults() .getIcon("Tree.expandedIcon"); Icon ci = UIManager.... | int paintControlIcons(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object node) { int h = descent; int rowHeight = getRowHeight(); Icon ei = UIManager.getLookAndFeelDefaults() .getIcon("Tree.expandedIcon"); Icon ci = UIManager.... | 8,001 |
int paintControlIcons(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object node) { int h = descent; int rowHeight = getRowHeight(); Icon ei = UIManager.getLookAndFeelDefaults() .getIcon("Tree.expandedIcon"); Icon ci = UIManager.... | int paintControlIcons(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object node) { int h = descent; int rowHeight = getRowHeight(); Icon ei = UIManager.getLookAndFeelDefaults() .getIcon("Tree.expandedIcon"); Icon ci = UIManager.... | 8,002 |
int paintControlIcons(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object node) { int h = descent; int rowHeight = getRowHeight(); Icon ei = UIManager.getLookAndFeelDefaults() .getIcon("Tree.expandedIcon"); Icon ci = UIManager.... | int paintControlIcons(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object node) { int h = descent; int rowHeight = getRowHeight(); Icon ei = UIManager.getLookAndFeelDefaults() .getIcon("Tree.expandedIcon"); Icon ci = UIManager.... | 8,003 |
int paintControlIcons(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object node) { int h = descent; int rowHeight = getRowHeight(); Icon ei = UIManager.getLookAndFeelDefaults() .getIcon("Tree.expandedIcon"); Icon ci = UIManager.... | int paintControlIcons(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object node) { int h = descent; int rowHeight = getRowHeight(); Icon ei = UIManager.getLookAndFeelDefaults() .getIcon("Tree.expandedIcon"); Icon ci = UIManager.... | 8,004 |
void paintNode(Graphics g, int x, int y, JTree tree, Object node, boolean isLeaf) { TreePath curr = new TreePath(getPathToRoot(((TreeNode) node), 0)); boolean selected = tree.isPathSelected(curr); boolean expanded = false; boolean hasIcons = false; if (tree.isVisible(curr)) { ... | void paintNode(Graphics g, int x, int y, JTree tree, Object node, boolean isLeaf) { TreePath curr = new TreePath(getPathToRoot(node, 0)); boolean selected = tree.isPathSelected(curr); boolean expanded = false; boolean hasIcons = false; if (tree.isVisible(curr)) { DefaultTreeC... | 8,005 |
void paintNode(Graphics g, int x, int y, JTree tree, Object node, boolean isLeaf) { TreePath curr = new TreePath(getPathToRoot(((TreeNode) node), 0)); boolean selected = tree.isPathSelected(curr); boolean expanded = false; boolean hasIcons = false; if (tree.isVisible(curr)) { ... | void paintNode(Graphics g, int x, int y, JTree tree, Object node, boolean isLeaf) { TreePath curr = new TreePath(getPathToRoot(((TreeNode) node), 0)); boolean selected = tree.isPathSelected(curr); boolean expanded = false; boolean hasIcons = false; if (tree.isVisible(curr)) { ... | 8,006 |
void paintNode(Graphics g, int x, int y, JTree tree, Object node, boolean isLeaf) { TreePath curr = new TreePath(getPathToRoot(((TreeNode) node), 0)); boolean selected = tree.isPathSelected(curr); boolean expanded = false; boolean hasIcons = false; if (tree.isVisible(curr)) { ... | void paintNode(Graphics g, int x, int y, JTree tree, Object node, boolean isLeaf) { TreePath curr = new TreePath(getPathToRoot(((TreeNode) node), 0)); boolean selected = tree.isPathSelected(curr); boolean expanded = false; boolean hasIcons = false; if (tree.isVisible(curr)) { ... | 8,007 |
void paintNode(Graphics g, int x, int y, JTree tree, Object node, boolean isLeaf) { TreePath curr = new TreePath(getPathToRoot(((TreeNode) node), 0)); boolean selected = tree.isPathSelected(curr); boolean expanded = false; boolean hasIcons = false; if (tree.isVisible(curr)) { ... | void paintNode(Graphics g, int x, int y, JTree tree, Object node, boolean isLeaf) { TreePath curr = new TreePath(getPathToRoot(((TreeNode) node), 0)); boolean selected = tree.isPathSelected(curr); boolean expanded = false; boolean hasIcons = false; if (tree.isVisible(curr)) { ... | 8,008 |
int paintRecursive(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object curr) { Rectangle clip = g.getClipBounds(); if (indentation > clip.x + clip.width + rightChildIndent || descent > clip.y + clip.height + getRowHeight()) return descent; int halfH... | int paintRecursive(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object curr) { Rectangle clip = g.getClipBounds(); if (indentation > clip.x + clip.width + rightChildIndent || descent > clip.y + clip.height + getRowHeight()) return descent; int halfH... | 8,009 |
int paintRecursive(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object curr) { Rectangle clip = g.getClipBounds(); if (indentation > clip.x + clip.width + rightChildIndent || descent > clip.y + clip.height + getRowHeight()) return descent; int halfH... | int paintRecursive(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object curr) { Rectangle clip = g.getClipBounds(); if (indentation > clip.x + clip.width + rightChildIndent || descent > clip.y + clip.height + getRowHeight()) return descent; int halfH... | 8,010 |
int paintRecursive(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object curr) { Rectangle clip = g.getClipBounds(); if (indentation > clip.x + clip.width + rightChildIndent || descent > clip.y + clip.height + getRowHeight()) return descent; int halfH... | int paintRecursive(Graphics g, int indentation, int descent, int childNumber, int depth, JTree tree, TreeModel mod, Object curr) { Rectangle clip = g.getClipBounds(); if (indentation > clip.x + clip.width + rightChildIndent || descent > clip.y + clip.height + getRowHeight()) return descent; int halfH... | 8,011 |
protected void setModel(TreeModel model) { tree.setModel(model); treeModel = model; } | protected void setModel(TreeModel model) { tree.setModel(model); treeModel = tree.getModel(); } | 8,013 |
protected void uninstallDefaults(JTree tree) { UIDefaults defaults = UIManager.getLookAndFeelDefaults(); tree.setFont(null); tree.setForeground(null); tree.setBackground(null); tree.setCellRenderer(null); } | protected void uninstallDefaults(JTree tree) { tree.setFont(null); tree.setForeground(null); tree.setBackground(null); tree.setCellRenderer(null); } | 8,014 |
protected void uninstallDefaults(JTree tree) { UIDefaults defaults = UIManager.getLookAndFeelDefaults(); tree.setFont(null); tree.setForeground(null); tree.setBackground(null); tree.setCellRenderer(null); } | protected void uninstallDefaults(JTree tree) { UIDefaults defaults = UIManager.getLookAndFeelDefaults(); tree.setFont(null); tree.setForeground(null); tree.setBackground(null); } | 8,015 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.