bugged stringlengths 6 599k | fixed stringlengths 6 40.8M | __index_level_0__ int64 0 3.24M |
|---|---|---|
public abstract double get (); | public abstract double get (); | 27,135 |
public static double getDouble (ByteBuffer buffer, int index, ByteOrder order) { return Double.longBitsToDouble (getLong (buffer, index, order)); } | public static double getDouble (ByteBuffer buffer, ByteOrder order) { return Double.longBitsToDouble (getLong (buffer, index, order)); } | 27,136 |
public static double getDouble (ByteBuffer buffer, int index, ByteOrder order) { return Double.longBitsToDouble (getLong (buffer, index, order)); } | public static double getDouble (ByteBuffer buffer, int index, ByteOrder order) { return Double.longBitsToDouble (getLong (buffer, order)); } | 27,137 |
public abstract DoubleBuffer put (double b); | public abstract DoubleBuffer put (double b); | 27,138 |
public static void putDouble (ByteBuffer buffer, int index, double value, ByteOrder order) { putLong (buffer, index, Double.doubleToRawLongBits (value), order); } | public static void putDouble (ByteBuffer buffer, int index, double value, ByteOrder order) { putLong (buffer, index, Double.doubleToRawLongBits (value), order); } | 27,139 |
public static void putDouble (ByteBuffer buffer, int index, double value, ByteOrder order) { putLong (buffer, index, Double.doubleToRawLongBits (value), order); } | public static void putDouble (ByteBuffer buffer, int index, double value, ByteOrder order) { putLong (buffer, Double.doubleToRawLongBits (value), order); } | 27,140 |
public DefaultMutableTreeNode() { // TODO } // DefaultMutableTreeNode() | public DefaultMutableTreeNode() { // TODO } // DefaultMutableTreeNode() | 27,141 |
public void add(MutableTreeNode child) { children.add(child); child.setParent(this); } // add() | public void add(MutableTreeNode child) { children.add(child); child.setParent(this); } // add() | 27,142 |
public void add(MutableTreeNode child) { children.add(child); child.setParent(this); } // add() | public void add(MutableTreeNode child) { children.add(child); child.setParent(this); } // add() | 27,143 |
public Enumeration breadthFirstEnumeration() { return null; // TODO } // breadthFirstEnumeration() | public Enumeration breadthFirstEnumeration() { return null; // TODO } // breadthFirstEnumeration() | 27,144 |
public Enumeration children() { return children.elements(); } // children() | public Enumeration children() { return children.elements(); } // children() | 27,145 |
public Enumeration children() { return children.elements(); } // children() | public Enumeration children() { return children.elements(); } // children() | 27,146 |
public Object clone() { return null; // TODO } // clone() | public Object clone() { return null; // TODO } // clone() | 27,147 |
public Enumeration depthFirstEnumeration() { return null; // TODO } // depthFirstEnumeration() | public Enumeration depthFirstEnumeration() { return null; // TODO } // depthFirstEnumeration() | 27,148 |
public boolean getAllowsChildren() { return allowsChildren; } // getAllowsChildren() | public boolean getAllowsChildren() { return allowsChildren; } // getAllowsChildren() | 27,149 |
public boolean getAllowsChildren() { return allowsChildren; } // getAllowsChildren() | public boolean getAllowsChildren() { return allowsChildren; } // getAllowsChildren() | 27,150 |
public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | 27,151 |
public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | 27,152 |
public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | 27,153 |
public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | 27,154 |
public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | public TreeNode getChildAfter(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child after index++; if (index == getChildCount()) { return n... | 27,155 |
public TreeNode getChildAt(int index) { return (TreeNode) children.elementAt(index); } // getChildAt() | public TreeNode getChildAt(int index) { return (TreeNode) children.elementAt(index); } // getChildAt() | 27,156 |
public TreeNode getChildAt(int index) { return (TreeNode) children.elementAt(index); } // getChildAt() | public TreeNode getChildAt(int index) { return (TreeNode) children.elementAt(index); } // getChildAt() | 27,157 |
public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | 27,158 |
public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | 27,159 |
public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | 27,160 |
public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | 27,161 |
public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | public TreeNode getChildBefore(TreeNode node) { // Variables int index; // Check node if (node == null || node.getParent() != this) { throw new IllegalArgumentException(); } // if // Get index of child node index = getIndex(node); // Check for child before index--; if (index < 0) { return null; } // if... | 27,162 |
public int getChildCount() { return children.size(); } // getChildCount() | public int getChildCount() { return children.size(); } // getChildCount() | 27,163 |
public int getChildCount() { return children.size(); } // getChildCount() | public int getChildCount() { return children.size(); } // getChildCount() | 27,164 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | 27,165 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | 27,166 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | 27,167 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public} else { if (current > depth) depth = current; int} else { if (current > depth) depth = current; getDepth()} else { if (current > depth) depth = current; { //} else { if (current > depth) depth = current; Variables TreeNode node; int depth; int current; int size; Stack stack; int index; //... | 27,168 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | 27,169 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | 27,170 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | 27,171 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | 27,172 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | 27,173 |
public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | public int getDepth() { // Variables TreeNode node; int depth; int current; int size; Stack stack; int index; // Check for children if (allowsChildren == false || children.size() == 0) { return 0; } // if // Process Depths stack = new Stack(); stack.push(new Integer(0)); node = getChildA... | 27,174 |
public TreeNode getFirstChild() { return (TreeNode) children.firstElement(); } // getFirstChild() | public TreeNode getFirstChild() { return (TreeNode) children.firstElement(); } // getFirstChild() | 27,175 |
public TreeNode getFirstChild() { return (TreeNode) children.firstElement(); } // getFirstChild() | public TreeNode getFirstChild() { return (TreeNode) children.firstElement(); } // getFirstChild() | 27,176 |
public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf() | public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf() | 27,177 |
public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf() | public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf() | 27,178 |
public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf() | public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); // while return (DefaultMutableTreeNode) current; // getFirstLeaf() | 27,179 |
public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf() | public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf() | 27,180 |
public int getIndex(TreeNode node) { return children.indexOf(node); } // getIndex() | public int getIndex(TreeNode node) { return children.indexOf(node); } // getIndex() | 27,181 |
public int getIndex(TreeNode node) { return children.indexOf(node); } // getIndex() | public int getIndex(TreeNode node) { return children.indexOf(node); } // getIndex() | 27,182 |
public TreeNode getLastChild() { return (TreeNode) children.lastElement(); } // getLastChild() | public TreeNode getLastChild() { return (TreeNode) children.lastElement(); } // getLastChild() | 27,183 |
public TreeNode getLastChild() { return (TreeNode) children.lastElement(); } // getLastChild() | public TreeNode getLastChild() { return (TreeNode) children.lastElement(); } // getLastChild() | 27,184 |
public DefaultMutableTreeNode getLastLeaf() { // Variables TreeNode current; int size; current = this; size = current.getChildCount(); while (size > 0) { current = current.getChildAt(size - 1); size = current.getChildCount(); } // while return (DefaultMutableTreeNode) current; } // getLastLeaf() | public DefaultMutableTreeNode getLastLeaf() { // Variables TreeNode current; int size; current = this; size = current.getChildCount(); while (size > 0) { current = current.getChildAt(size - 1); size = current.getChildCount(); } // while return (DefaultMutableTreeNode) current; } // getLastLeaf() | 27,185 |
public DefaultMutableTreeNode getLastLeaf() { // Variables TreeNode current; int size; current = this; size = current.getChildCount(); while (size > 0) { current = current.getChildAt(size - 1); size = current.getChildCount(); } // while return (DefaultMutableTreeNode) current; } // getLastLeaf() | public DefaultMutableTreeNode getLastLeaf() { // Variables TreeNode current; int size; current = this; size = current.getChildCount(); while (size > 0) { current = current.getChildAt(size - 1); size = current.getChildCount(); } // while return (DefaultMutableTreeNode) current; } // getLastLeaf() | 27,186 |
public DefaultMutableTreeNode getLastLeaf() { // Variables TreeNode current; int size; current = this; size = current.getChildCount(); while (size > 0) { current = current.getChildAt(size - 1); size = current.getChildCount(); } // while return (DefaultMutableTreeNode) current; } // getLastLeaf() | public DefaultMutableTreeNode getLastLeaf() { // Variables TreeNode current; int size; current = this; size = current.getChildCount(); while (size > 0) { current = current.getChildAt(size - 1); size = current.getChildCount(); } // while return (DefaultMutableTreeNode) current; } // getLastLeaf() | 27,187 |
public DefaultMutableTreeNode getLastLeaf() { // Variables TreeNode current; int size; current = this; size = current.getChildCount(); while (size > 0) { current = current.getChildAt(size - 1); size = current.getChildCount(); } // while return (DefaultMutableTreeNode) current; } // getLastLeaf() | public DefaultMutableTreeNode getLastLeaf() { // Variables TreeNode current; int size; current = this; size = current.getChildCount(); while (size > 0) { current = current.getChildAt(size - 1); size = current.getChildCount(); } // while return (DefaultMutableTreeNode) current; } // getLastLeaf() | 27,188 |
public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | 27,189 |
public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | 27,190 |
public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | 27,191 |
public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | 27,192 |
public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | public int getLeafCount() { // Variables Enumeration e; int count; TreeNode current; // Get Enumeration of all descendants e = depthFirstEnumeration(); // Process Nodes count = 0; while (e.hasMoreElements() == true) { current = (TreeNode) e.nextElement(); if (current.isLeaf() == true) { count++; } ... | 27,193 |
public int getLevel() { // Variables TreeNode current; int count; // Lookup Parent count = -1; current = this; do { current = current.getParent(); count++; } while (current != null); return count; } // getLevel() | public int getLevel() { // Variables TreeNode current; int count; // Lookup Parent count = -1; current = this; do { current = current.getParent(); count++; } while (current != null); return count; } // getLevel() | 27,194 |
public int getLevel() { // Variables TreeNode current; int count; // Lookup Parent count = -1; current = this; do { current = current.getParent(); count++; } while (current != null); return count; } // getLevel() | public int getLevel() { // Variables TreeNode current; int count; // Lookup Parent count = -1; current = this; do { current = current.getParent(); count++; } while (current != null); return count; } // getLevel() | 27,195 |
public int getLevel() { // Variables TreeNode current; int count; // Lookup Parent count = -1; current = this; do { current = current.getParent(); count++; } while (current != null); return count; } // getLevel() | public int getLevel() { // Variables TreeNode current; int count; // Lookup Parent count = -1; current = this; do { current = current.getParent(); count++; } while (current != null); return count; } // getLevel() | 27,196 |
public int getLevel() { // Variables TreeNode current; int count; // Lookup Parent count = -1; current = this; do { current = current.getParent(); count++; } while (current != null); return count; } // getLevel() | public int getLevel() { // Variables TreeNode current; int count; // Lookup Parent count = -1; current = this; do { current = current.getParent(); count++; } while (current != null); return count; } // getLevel() | 27,197 |
public DefaultMutableTreeNode getNextLeaf() { return null; // TODO } // getNextLeaf() | public DefaultMutableTreeNode getNextLeaf() { return null; // TODO } // getNextLeaf() | 27,198 |
public DefaultMutableTreeNode getNextNode() { return null; // TODO } // getNextNode() | public DefaultMutableTreeNode getNextNode() { return null; // TODO } // getNextNode() | 27,199 |
public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | 27,200 |
public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | 27,201 |
public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | 27,202 |
public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | 27,203 |
public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | public DefaultMutableTreeNode getNextSibling() { // Variables int index; int size; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) { return null... | 27,204 |
public TreeNode getParent() { return parent; } // getParent() | public TreeNode getParent() { return parent; } // getParent() | 27,205 |
public TreeNode getParent() { return parent; } // getParent() | public TreeNode getParent() { return parent; } // getParent() | 27,206 |
public TreeNode[] getPath() { // Variables TreeNode[] path; int size; int index; TreeNode current; // Determine length of Path size = getLevel() + 1; // Create Path path = new TreeNode[size]; current = this; for (index = size - 1; index >= 0; index--) { path[index] = current; current = current.getPa... | public TreeNode[] getPath() { // Variables TreeNode[] path; int size; int index; TreeNode current; // Determine length of Path size = getLevel() + 1; // Create Path path = new TreeNode[size]; current = this; for (index = size - 1; index >= 0; index--) { path[index] = current; current = current.getPa... | 27,207 |
protected TreeNode[] getPathToRoot(TreeNode value0, int value1) { return null; // TODO } // getPathToRoot() | protected TreeNode[] getPathToRoot(TreeNode value0, int value1) { return null; // TODO } // getPathToRoot() | 27,208 |
public DefaultMutableTreeNode getPreviousLeaf() { return null; // TODO } // getPreviousLeaf() | public DefaultMutableTreeNode getPreviousLeaf() { return null; // TODO } // getPreviousLeaf() | 27,209 |
public DefaultMutableTreeNode getPreviousNode() { return null; // TODO } // getPreviousNode() | public DefaultMutableTreeNode getPreviousNode() { return null; // TODO } // getPreviousNode() | 27,210 |
public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | 27,211 |
public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | 27,212 |
public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | 27,213 |
public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | 27,214 |
public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | public DefaultMutableTreeNode getPreviousSibling() { // Variables int index; // Check for Parent if (parent == null) { return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNo... | 27,215 |
public TreeNode getRoot() { // Variables TreeNode current; TreeNode check; // Lookup Parent current = this; check = current.getParent(); while (check != null) { current = check; check = current.getParent(); } // while return current; } // getRoot() | public TreeNode getRoot() { // Variables TreeNode current; TreeNode check; // Lookup Parent current = this; check = current.getParent(); while (check != null) { current = check; check = current.getParent(); } // while return current; } // getRoot() | 27,216 |
public TreeNode getRoot() { // Variables TreeNode current; TreeNode check; // Lookup Parent current = this; check = current.getParent(); while (check != null) { current = check; check = current.getParent(); } // while return current; } // getRoot() | public TreeNode getRoot() { // Variables TreeNode current; TreeNode check; // Lookup Parent current = this; check = current.getParent(); while (check != null) { current = check; check = current.getParent(); } // while return current; } // getRoot() | 27,217 |
public TreeNode getRoot() { // Variables TreeNode current; TreeNode check; // Lookup Parent current = this; check = current.getParent(); while (check != null) { current = check; check = current.getParent(); } // while return current; } // getRoot() | public TreeNode getRoot() { // Variables TreeNode current; TreeNode check; // Lookup Parent current = this; check = current.getParent(); while (check != null) { current = check; check = current.getParent(); } // while return current; } // getRoot() | 27,218 |
public TreeNode getRoot() { // Variables TreeNode current; TreeNode check; // Lookup Parent current = this; check = current.getParent(); while (check != null) { current = check; check = current.getParent(); } // while return current; } // getRoot() | public TreeNode getRoot() { // Variables TreeNode current; TreeNode check; // Lookup Parent current = this; check = current.getParent(); while (check != null) { current = check; check = current.getParent(); } // while return current; } // getRoot() | 27,219 |
public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | 27,220 |
public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | 27,221 |
public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | 27,222 |
public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | publicTreeNodegetSharedAncestor(DefaultMutableTreeNodenode){ //Variables ArrayList list; TreeNode current; //GetListofPathElementsforthisnode current=this; list=newArrayList(); while(current!=null){ list.add(current); current=current.getParent(); }//while //Checkifanypathelementofnodeareinlist current=no... | 27,223 |
public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | 27,224 |
public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); // while // Check if any path elem... | 27,225 |
public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | 27,226 |
public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | publicTreeNodegetSharedAncestor(DefaultMutableTreeNodenode){ //Variables ArrayList list; TreeNode current; //GetListofPathElementsforthisnode current=this; list=newArrayList(); while(current!=null){ list.add(current); current=current.getParent(); }//while //Checkifanypathelementofnodeareinlist current=no... | 27,227 |
public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | public TreeNode getSharedAncestor(DefaultMutableTreeNode node) { // Variables ArrayList list; TreeNode current; // Get List of Path Elements for this node current = this; list = new ArrayList(); while (current != null) { list.add(current); current = current.getParent(); } // while // Check if any path ele... | 27,228 |
public int getSiblingCount() { // Variables // Check for no parent if (parent == null) { return 1; } // if // Calculate sibling count from parent's child count return parent.getChildCount(); } // getSiblingCount() | public int getSiblingCount() { // Variables // Check for no parent if (parent == null) { return 1; } // if // Calculate sibling count from parent's child count return parent.getChildCount(); } // getSiblingCount() | 27,229 |
public int getSiblingCount() { // Variables // Check for no parent if (parent == null) { return 1; } // if // Calculate sibling count from parent's child count return parent.getChildCount(); } // getSiblingCount() | public int getSiblingCount() { // Variables // Check for no parent if (parent == null) { return 1; } // if // Calculate sibling count from parent's child count return parent.getChildCount(); } // getSiblingCount() | 27,230 |
public int getSiblingCount() { // Variables // Check for no parent if (parent == null) { return 1; } // if // Calculate sibling count from parent's child count return parent.getChildCount(); } // getSiblingCount() | public int getSiblingCount() { // Variables // Check for no parent if (parent == null) { return 1; } // if // Calculate sibling count from parent's child count return parent.getChildCount(); } // getSiblingCount() | 27,231 |
public Object getUserObject() { return userObject; } // getUserObject() | public Object getUserObject() { return userObject; } // getUserObject() | 27,232 |
public Object getUserObject() { return userObject; } // getUserObject() | public Object getUserObject() { return userObject; } // getUserObject() | 27,233 |
public Object[] getUserObjectPath() { // Variables TreeNode[] path; Object[] object; int index; // Get Path for Tree Nodes path = getPath(); // Construct Object Path object = new Object[path.length]; for (index = 0; index < path.length; index++) { object[index] = ((DefaultMutableTreeNode) path[index]).get... | public Object[] getUserObjectPath() { // Variables TreeNode[] path; Object[] object; int index; // Get Path for Tree Nodes path = getPath(); // Construct Object Path object = new Object[path.length]; for (index = 0; index < path.length; index++) { object[index] = ((DefaultMutableTreeNode) path[index]).get... | 27,234 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.