bugged stringlengths 6 599k | fixed stringlengths 6 40.8M | __index_level_0__ int64 0 3.24M |
|---|---|---|
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,235 |
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,236 |
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,237 |
public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | 27,238 |
public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | 27,239 |
public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | 27,240 |
public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | 27,241 |
public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | public static void growTree(DefaultMutableTreeNode root) { // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = new DefaultMutableTreeNode(St... | 27,242 |
public void insert(MutableTreeNode node, int index) { children.insertElementAt(node, index); } // insert() | public void insert(MutableTreeNode node, int index) { children.insertElementAt(node, index); } // insert() | 27,243 |
public void insert(MutableTreeNode node, int index) { children.insertElementAt(node, index); } // insert() | public void insert(MutableTreeNode node, int index) { children.insertElementAt(node, index); } // insert() | 27,244 |
public boolean isLeaf() { return (children.size() == 0); // TODO: check allowsChildren?? } // isLeaf() | public boolean isLeaf() { return (children.size() == 0); // TODO: check allowsChildren?? } // isLeaf() | 27,245 |
public boolean isNodeAncestor(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Ancestor current = this; while (current != null && current != node) { current = current.getParent(); } // while // Check for Ancestor if (current == node)... | public boolean isNodeAncestor(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Ancestor current = this; while (current != null && current != node) { current = current.getParent(); } // while // Check for Ancestor if (current == node)... | 27,246 |
public boolean isNodeAncestor(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Ancestor current = this; while (current != null && current != node) { current = current.getParent(); } // while // Check for Ancestor if (current == node)... | public boolean isNodeAncestor(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Ancestor current = this; while (current != null && current != node) { current = current.getParent(); } // while // Check for Ancestor if (current == node)... | 27,247 |
public boolean isNodeAncestor(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Ancestor current = this; while (current != null && current != node) { current = current.getParent(); } // while // Check for Ancestor if (current == node)... | public boolean isNodeAncestor(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Ancestor current = this; while (current != null && current != node) { current = current.getParent(); } // while // Check for Ancestor if (current == node)... | 27,248 |
public boolean isNodeAncestor(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Ancestor current = this; while (current != null && current != node) { current = current.getParent(); } // while // Check for Ancestor if (current == node)... | public boolean isNodeAncestor(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Ancestor current = this; while (current != null && current != node) { current = current.getParent(); } // while // Check for Ancestor if (current == node)... | 27,249 |
public boolean isNodeChild(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Process Path current = node; while (current != null) { if (current == this) { return true; } // if current = current.getParent(); } // while // Node not located i... | public boolean isNodeChild(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Process Path current = node; while (current != null) { if (current == this) { return true; } // if current = current.getParent(); } // while // Node not located i... | 27,250 |
public boolean isNodeChild(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Process Path current = node; while (current != null) { if (current == this) { return true; } // if current = current.getParent(); } // while // Node not located i... | public boolean isNodeChild(TreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; return node.getParent() == this; } // if // Process Path current = node; while (current != null) { if (current == this) { return true; return node.getParent() == this; } // if ... | 27,251 |
public boolean isNodeDescendant(DefaultMutableTreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // while // Check for Descendant ... | public boolean isNodeDescendant(DefaultMutableTreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // while // Check for Descendant ... | 27,252 |
public boolean isNodeDescendant(DefaultMutableTreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // while // Check for Descendant ... | public boolean isNodeDescendant(DefaultMutableTreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // while // Check for Descendant ... | 27,253 |
public boolean isNodeDescendant(DefaultMutableTreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // while // Check for Descendant ... | public boolean isNodeDescendant(DefaultMutableTreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // while // Check for Descendant ... | 27,254 |
public boolean isNodeDescendant(DefaultMutableTreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // while // Check for Descendant ... | public boolean isNodeDescendant(DefaultMutableTreeNode node) { // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // while // Check for Descendant ... | 27,255 |
public boolean isNodeRelated(DefaultMutableTreeNode node) { // Sanity Check if (node == null) { return false; } // if // Check for the same root if (node.getRoot() == getRoot()) { return true; } // if // Nodes are not related return false; } // isNodeRelated() | public boolean isNodeRelated(DefaultMutableTreeNode node) { // Sanity Check if (node == null) { return false; } // if // Check for the same root if (node.getRoot() == getRoot()) { return true; } // if // Nodes are not related return false; } // isNodeRelated() | 27,256 |
public boolean isNodeRelated(DefaultMutableTreeNode node) { // Sanity Check if (node == null) { return false; } // if // Check for the same root if (node.getRoot() == getRoot()) { return true; } // if // Nodes are not related return false; } // isNodeRelated() | public boolean isNodeRelated(DefaultMutableTreeNode node) { // Sanity Check if (node == null) { return false; } // if // Check for the same root if (node.getRoot() == getRoot()) { return true; } // if // Nodes are not related return false; } // isNodeRelated() | 27,257 |
public boolean isNodeSibling(TreeNode node) { // Check for null if (node == null) { return false; } // if // Check if nodes share a parent if (node.getParent() == getParent() && getParent() != null) { return true; } // if // Nodes are not siblings return false; } // isNodeSibling() | public boolean isNodeSibling(TreeNode node) { // Check for null if (node == null) { return false; } // if // Check if nodes share a parent if (node.getParent() == getParent() && getParent() != null) { return true; } // if // Nodes are not siblings return false; } // isNodeSibling() | 27,258 |
public boolean isNodeSibling(TreeNode node) { // Check for null if (node == null) { return false; } // if // Check if nodes share a parent if (node.getParent() == getParent() && getParent() != null) { return true; } // if // Nodes are not siblings return false; } // isNodeSibling() | public boolean isNodeSibling(TreeNode node) { // Check for null if (node == null) { return false; } // if // Check if nodes share a parent if (node.getParent() == getParent() && getParent() != null) { return true; } // if // Nodes are not siblings return false; } // isNodeSibling() | 27,259 |
public boolean isRoot() { return (parent == null); } // isRoot() | public boolean isRoot() { return (parent == null); } // isRoot() | 27,260 |
public boolean isRoot() { return (parent == null); } // isRoot() | public boolean isRoot() { return (parent == null); } // isRoot() | 27,261 |
public Enumeration pathFromAncestorEnumeration(TreeNode value0) { return null; // TODO } // pathFromAncestorEnumeration() | public Enumeration pathFromAncestorEnumeration(TreeNode value0) { return null; // TODO } // pathFromAncestorEnumeration() | 27,262 |
public Enumeration postorderEnumeration() { return null; // TODO } // postorderEnumeration() | public Enumeration postorderEnumeration() { return null; // TODO } // postorderEnumeration() | 27,263 |
public Enumeration preorderEnumeration() { return null; // TODO } // preorderEnumeration() | public Enumeration preorderEnumeration() { return null; // TODO } // preorderEnumeration() | 27,264 |
private void readObject(ObjectInputStream value0) throws IOException, ClassNotFoundException { // TODO } // readObject() | private void readObject(ObjectInputStream value0) throws IOException, ClassNotFoundException { // TODO } // readObject() | 27,265 |
public void remove(int index) { children.remove(index); } // remove() | public void remove(int index) { children.remove(index); } // remove() | 27,266 |
public void remove(int index) { children.remove(index); } // remove() | public void remove(int index) { children.remove(index); } // remove() | 27,267 |
public void removeAllChildren() { children.removeAllElements(); } // removeAllChildren() | public void removeAllChildren() { children.removeAllElements(); } // removeAllChildren() | 27,268 |
public void removeAllChildren() { children.removeAllElements(); } // removeAllChildren() | public void removeAllChildren() { children.removeAllElements(); } // removeAllChildren() | 27,269 |
public void removeFromParent() { parent = null; // TODO } // removeFromParent() | public void removeFromParent() { parent = null; // TODO } // removeFromParent() | 27,270 |
public void removeFromParent() { parent = null; // TODO } // removeFromParent() | public void removeFromParent() { parent = null; // TODO } // removeFromParent() | 27,271 |
public void setAllowsChildren(boolean allowsChildren) { this.allowsChildren = allowsChildren; } // setAllowsChildren() | public void setAllowsChildren(boolean allowsChildren) { this.allowsChildren = allowsChildren; } // setAllowsChildren() | 27,272 |
public void setAllowsChildren(boolean allowsChildren) { this.allowsChildren = allowsChildren; } // setAllowsChildren() | public void setAllowsChildren(boolean allowsChildren) { this.allowsChildren = allowsChildren; } // setAllowsChildren() | 27,273 |
public void setParent(MutableTreeNode node) { parent = node; } // setParent() | public void setParent(MutableTreeNode node) { parent = node; } // setParent() | 27,274 |
public void setParent(MutableTreeNode node) { parent = node; } // setParent() | public void setParent(MutableTreeNode node) { parent = node; } // setParent() | 27,275 |
public void setUserObject(Object userObject) { this.userObject = userObject; } // setUserObject() | public void setUserObject(Object userObject) { this.userObject = userObject; } // setUserObject() | 27,276 |
public void setUserObject(Object userObject) { this.userObject = userObject; } // setUserObject() | public void setUserObject(Object userObject) { this.userObject = userObject; } // setUserObject() | 27,277 |
public String toString() { if (userObject == null) { return null; } // if return userObject.toString(); } // toString() | public String toString() { if (userObject == null) { return null; } // if return userObject.toString(); } // toString() | 27,278 |
public String toString() { if (userObject == null) { return null; } // if return userObject.toString(); } // toString() | public String toString() { if (userObject == null) { return null; // if return userObject.toString(); // toString() | 27,279 |
public String toString() { if (userObject == null) { return null; } // if return userObject.toString(); } // toString() | public String toString() { if (userObject == null) { return null; } // if return userObject.toString(); } // toString() | 27,280 |
private void writeObject(ObjectOutputStream value0) throws IOException { // TODO } // writeObject() | private void writeObject(ObjectOutputStream value0) throws IOException { // TODO } // writeObject() | 27,281 |
public void setParent(MutableTreeNode parent); | public void setParent(MutableTreeNode parent); | 27,282 |
public void insert(MutableTreeNode child, int index); | public void insert(MutableTreeNode child, int index); | 27,283 |
public void remove(int index); | public void remove(int index); | 27,284 |
public void removeFromParent(); | public void removeFromParent(); | 27,285 |
public void setUserObject(Object object); | public void setUserObject(Object object); | 27,286 |
public InputMethod createInputMethod() throws Exception; | public InputMethod createInputMethod() throws Exception; | 27,287 |
public static TypeCode type() { if (typeCode == null) { String[] members = new String[] { "PARAM_IN", "PARAM_OUT", "PARAM_INOUT" }; typeCode = Restricted_ORB.Singleton.create_enum_tc(id(), "ParameterMode", members); } return typeCode; } | public static TypeCode type() { if (typeCode == null) { String[] members = new String[] { "PARAM_IN", "PARAM_OUT", "PARAM_INOUT" }; typeCode = OrbRestricted.Singleton.create_enum_tc(id(), "ParameterMode", members); } return typeCode; } | 27,289 |
public void writePUSH(int jvmType, Register reg) { final Item item; switch (jvmType) { case JvmType.INT: item = IntItem.createReg(reg); break; case JvmType.REFERENCE: item = RefItem.createRegister(reg); break... | public void writePUSH(int jvmType, Register reg) { final Item item; switch (jvmType) { case JvmType.INT: item = IntItem.createReg(reg); break; case JvmType.REFERENCE: item = RefItem.createRegister(reg); break... | 27,290 |
public void writePUSH64(int jvmType, Register lsbReg, Register msbReg) { final Item item; switch (jvmType) { case JvmType.LONG: item = LongItem.createReg(lsbReg, msbReg); break; case JvmType.DOUBLE: item = DoubleItem.create... | public void writePUSH64(int jvmType, Register lsbReg, Register msbReg) { final Item item; switch (jvmType) { case JvmType.LONG: item = LongItem.createReg(lsbReg, msbReg); break; case JvmType.DOUBLE: item = DoubleItem.create... | 27,291 |
int TOS() { return tos; } | int TOS() { return tos; } | 27,292 |
VirtualStack(AbstractX86Stream os) { this.operandStack = checkOperandStack ? new ItemStack(Item.Kind.STACK, Integer.MAX_VALUE) : null; reset(); } | VirtualStack(AbstractX86Stream os) { this.operandStack = checkOperandStack ? new ItemStack(Item.Kind.STACK, Integer.MAX_VALUE) : null; reset(); } | 27,293 |
TypeStack asTypeStack() { final TypeStack tstack = new TypeStack(); for (int i = 0; i < tos; i++) { tstack.push(stack[ i].getType()); } return tstack; } | TypeStack asTypeStack() { final TypeStack tstack = new TypeStack(); for (int i = 0; i < tos; i++) { tstack.push(stack[ i].getType()); } return tstack; } | 27,294 |
static Item createStack(int type) { Item res = null; switch (type) { case JvmType.INT: res = IntItem.createStack(); break; case JvmType.REFERENCE: res = RefItem.createStack(); break; case JvmType.LONG: res = LongItem.createSta... | static Item createStack(int type) { Item res = null; switch (type) { case JvmType.INT: res = IntItem.createStack(); break; case JvmType.REFERENCE: res = RefItem.createStack(); break; case JvmType.LONG: res = LongItem.createSta... | 27,295 |
final AbstractX86StackManager createStackMgr() { return new StackManagerImpl(); } | final AbstractX86StackManager createStackMgr() { return new StackManagerImpl(); } | 27,296 |
private void growStack() { Item[] tmp = new Item[ stack.length * 2]; System.arraycopy(stack, 0, tmp, 0, stack.length); stack = tmp; } | private void growStack() { Item[] tmp = new Item[ stack.length * 2]; System.arraycopy(stack, 0, tmp, 0, stack.length); stack = tmp; } | 27,297 |
boolean isEmpty() { return (tos == 0); } | boolean isEmpty() { return (tos == 0); } | 27,298 |
void loadLocal(EmitterContext ec, int offsetToFP) { for (int i = 0; i < tos; i++) { final Item item = stack[ i]; if ((item.getKind() == Item.Kind.LOCAL) && (item.getOffsetToFP() == offsetToFP)) item.load(ec); } } | void loadLocal(EmitterContext ec, int offsetToFP) { for (int i = 0; i < tos; i++) { final Item item = stack[ i]; if ((item.getKind() == Item.Kind.LOCAL) && (item.getOffsetToFP() == offsetToFP)) item.load(ec); } } | 27,299 |
void loadLocal(EmitterContext ec, int offsetToFP) { for (int i = 0; i < tos; i++) { final Item item = stack[ i]; if ((item.getKind() == Item.Kind.LOCAL) && (item.getOffsetToFP() == offsetToFP)) item.load(ec); } } | void loadLocal(EmitterContext ec, int offsetToFP) { for (int i = 0; i < tos; i++) { final Item item = stack[ i]; if ((item.getKind() == Item.Kind.LOCAL) && (item.getOffsetToFP() == offsetToFP)) item.load(ec); } } | 27,300 |
Item pop() { // do not autocreate item: if no type available, just fail; avoid this // case in the bytecode visitor // if (tos == 0) // //TODO: support items across basic blocks // pushStack(Item.UNKNOWN); tos--; Item i = stack[ tos]; stack[ tos] = null; ... | Item pop() { // do not autocreate item: if no type available, just fail; avoid this // case in the bytecode visitor // if (tos == 0) // //TODO: support items across basic blocks // pushStack(Item.UNKNOWN); tos--; Item i = stack[ tos]; stack[ tos] = null; ... | 27,301 |
final DoubleItem popDouble() { // testing in pop and casting here: test is just redundant return (DoubleItem) pop(JvmType.DOUBLE); } | final DoubleItem popDouble() { // testing in pop and casting here: test is just redundant return (DoubleItem) pop(JvmType.DOUBLE); } | 27,302 |
final FloatItem popFloat() { // testing in pop and casting here: test is just redundant return (FloatItem) pop(JvmType.FLOAT); } | final FloatItem popFloat() { // testing in pop and casting here: test is just redundant return (FloatItem) pop(JvmType.FLOAT); } | 27,303 |
final IntItem popInt() { // testing in pop and casting here: test is just redundant return (IntItem) pop(JvmType.INT); } | final IntItem popInt() { // testing in pop and casting here: test is just redundant return (IntItem) pop(JvmType.INT); } | 27,304 |
final LongItem popLong() { // testing in pop and casting here: test is just redundant return (LongItem) pop(JvmType.LONG); } | final LongItem popLong() { // testing in pop and casting here: test is just redundant return (LongItem) pop(JvmType.LONG); } | 27,305 |
final RefItem popRef() { // testing in pop and casting here: test is just redundant return (RefItem) pop(JvmType.REFERENCE); } | final RefItem popRef() { // testing in pop and casting here: test is just redundant return (RefItem) pop(JvmType.REFERENCE); } | 27,306 |
void push(Item item) { if ((item.getKind() == Item.Kind.STACK) && (tos > 0)) { Item.assertCondition(stack[ tos - 1].getKind() == Item.Kind.STACK, "stack[ tos - 1].getKind() == Item.Kind.STACK"); } if (tos == stack.length) { growStack(); } s... | void push(Item item) { if ((item.getKind() == Item.Kind.STACK) && (tos > 0)) { Item.assertCondition(stack[ tos - 1].getKind() == Item.Kind.STACK, "stack[ tos - 1].getKind() == Item.Kind.STACK"); } if (tos == stack.length) { growStack(); } s... | 27,307 |
void push(Item item) { if ((item.getKind() == Item.Kind.STACK) && (tos > 0)) { Item.assertCondition(stack[ tos - 1].getKind() == Item.Kind.STACK, "stack[ tos - 1].getKind() == Item.Kind.STACK"); } if (tos == stack.length) { growStack(); } s... | void push(Item item) { if ((item.getKind() == Item.Kind.STACK) && (tos > 0)) { Item.assertCondition(stack[ tos - 1].getKind() == Item.Kind.STACK, "stack[ tos - 1].getKind() == Item.Kind.STACK"); } if (tos == stack.length) { growStack(); } s... | 27,308 |
void push(Item item) { if ((item.getKind() == Item.Kind.STACK) && (tos > 0)) { Item.assertCondition(stack[ tos - 1].getKind() == Item.Kind.STACK, "stack[ tos - 1].getKind() == Item.Kind.STACK"); } if (tos == stack.length) { growStack(); } s... | void push(Item item) { if ((item.getKind() == Item.Kind.STACK) && (tos > 0)) { Item.assertCondition(stack[ tos - 1].getKind() == Item.Kind.STACK, "stack[ tos - 1].getKind() == Item.Kind.STACK"); } if (tos == stack.length) { growStack(); } s... | 27,309 |
void push1(Item item) { push(item); if (checkOperandStack && (item.getKind() == Item.Kind.STACK)) { operandStack.push(item); } } | void push1(Item item) { push(item); if (checkOperandStack && (item.getKind() == Item.Kind.STACK)) { operandStack.push(item); } } | 27,310 |
final void pushAll(TypeStack tstack) { if ((tstack != null) && !tstack.isEmpty()) { final int size = tstack.size(); for (int i = 0; i < size; i++) { final int type = tstack.getType(i); final Item item = VirtualStack.createStack(type); push(it... | final void pushAll(TypeStack tstack) { if ((tstack != null) && !tstack.isEmpty()) { final int size = tstack.size(); for (int i = 0; i < size; i++) { final int type = tstack.getType(i); final Item item = VirtualStack.createStack(type); push(it... | 27,311 |
void reset() { stack = new Item[ 8]; tos = 0; if (checkOperandStack) { operandStack.reset(); } } | void reset() { stack = new Item[ 8]; tos = 0; if (checkOperandStack) { operandStack.reset(); } } | 27,312 |
public String toString() { final StringBuffer buf = new StringBuffer(); for (int i = 0; i < tos; i++) { if (i != 0) { buf.append(','); } buf.append('('); buf.append(stack[ i].getType()); buf.append(','); buf.append(stack[... | public String toString() { final StringBuffer buf = new StringBuffer(); for (int i = 0; i < tos; i++) { if (i != 0) { buf.append(','); } buf.append('('); buf.append(stack[ i].getType()); buf.append(','); buf.append(stack[... | 27,313 |
boolean uses(Register reg) { for (int i = 0; i < tos; i++) { if (stack[ i].uses(reg)) { return true; } } return false; } | boolean uses(Register reg) { for (int i = 0; i < tos; i++) { if (stack[ i].uses(reg)) { return true; } } return false; } | 27,314 |
ItemStack(int expectedKind, int maxSize) { this.expectedKind = expectedKind; this.maxSize = maxSize; reset(); } | ItemStack(int expectedKind, int maxSize) { this.expectedKind = expectedKind; this.maxSize = maxSize; reset(); } | 27,315 |
final void push(Item item) { Item.assertCondition(item.getKind() == expectedKind, "item.getKind() == expectedKind"); if (tos == stack.length) grow(); stack[ tos++] = item; } | final void push(Item item) { Item.assertCondition(item.getKind() == expectedKind, "item.getKind() == expectedKind"); if (tos == stack.length) grow(); stack[ tos++] = item; } | 27,316 |
void reset() { stack = new Item[ Math.min(8, maxSize)]; tos = 0; } | void reset() { stack = new Item[ Math.min(8, maxSize)]; tos = 0; } | 27,317 |
public static CertPathValidator getInstance(String algorithm) throws NoSuchAlgorithmException { Provider[] p = Security.getProviders(); for (int i = 0; i < p.length; i++) { try { return getInstance(algorithm, p[i]); } catch (NoSuchAlgorithmException ignored) ... | public static CertPathValidator getInstance(String algorithm) throws NoSuchAlgorithmException { Provider[] p = Security.getProviders(); for (int i = 0; i < p.length; i++) { try { return getInstance(algorithm, p[i]); } catch (NoSuchAlgorithmException e) ... | 27,318 |
public EmptyStackException() { } | public EmptyStackException() { } | 27,320 |
public AbstractMethodError(String s) { super(s); } | public AbstractMethodError(String s) { super(s); } | 27,321 |
public SerialPortDriver(int basePort) { this.channelOwner = null; this.port = null; this.basePort = basePort; } | public SerialPortDriver(int basePort) { this.channelOwner = null; this.port = null; this.basePort = basePort; } | 27,322 |
public void close() { } | public void close() { } | 27,323 |
public void configure(int divisor, int bits, boolean longStop, boolean parity, boolean pEven) { if (divisor < 1 || divisor > 65535) throw new IllegalArgumentException("invalid baud rate divisor: " + divisor); int control; switch (bits) { case 5 : control = 0; break; case 6 : control = 1; break; ... | public void configure(int divisor, int bits, boolean longStop, boolean parity, boolean pEven) { if (divisor < 1 || divisor > 65535) throw new IllegalArgumentException("invalid baud rate divisor: " + divisor); int control; switch (bits) { case 5 : control = 0; break; case 6 : control = 1; break; ... | 27,324 |
public void configure(int divisor, int bits, boolean longStop, boolean parity, boolean pEven) { if (divisor < 1 || divisor > 65535) throw new IllegalArgumentException("invalid baud rate divisor: " + divisor); int control; switch (bits) { case 5 : control = 0; break; case 6 : control = 1; break; ... | public void configure(int divisor, int bits, boolean longStop, boolean parity, boolean pEven) { if (divisor < 1 || divisor > 65535) throw new IllegalArgumentException("invalid baud rate divisor: " + divisor); int control; switch (bits) { case 5 : control = 0; break; case 6 : control = 1; break; ... | 27,325 |
public void configure(int divisor, int bits, boolean longStop, boolean parity, boolean pEven) { if (divisor < 1 || divisor > 65535) throw new IllegalArgumentException("invalid baud rate divisor: " + divisor); int control; switch (bits) { case 5 : control = 0; break; case 6 : control = 1; break; ... | public void configure(int divisor, int bits, boolean longStop, boolean parity, boolean pEven) { if (divisor < 1 || divisor > 65535) throw new IllegalArgumentException("invalid baud rate divisor: " + divisor); int control; switch (bits) { case 5 : control = 0; break; case 6 : control = 1; break; ... | 27,326 |
public void configure(int divisor, int bits, boolean longStop, boolean parity, boolean pEven) { if (divisor < 1 || divisor > 65535) throw new IllegalArgumentException("invalid baud rate divisor: " + divisor); int control; switch (bits) { case 5 : control = 0; break; case 6 : control = 1; break; ... | public void configure(int divisor, int bits, boolean longStop, boolean parity, boolean pEven) { if (divisor < 1 || divisor > 65535) throw new IllegalArgumentException("invalid baud rate divisor: " + divisor); int control; switch (bits) { case 5 : control = 0; break; case 6 : control = 1; break; ... | 27,327 |
public void flush() { // FIXME: currently flushes only the hardware as input buffers are not // yet used. This is only relevant to non-blocking I/O. flushHardware(); } | public void flush() { // FIXME: currently flushes only the hardware as input buffers are not // yet used. This is only relevant to non-blocking I/O. flushHardware(); } | 27,328 |
private void flushHardware() { // FIXME: busy waiting for the holding and shift registers to be empty int b; do b = port.inPortByte(basePort + 5); while ((b & 96) != 96); } | private void flushHardware() { // FIXME: busy waiting for the holding and shift registers to be empty int b; do b = port.inPortByte(basePort + 5); while ((b & 96) != 96); } | 27,329 |
public ByteChannel getChannel(Device owner) throws ChannelAlreadyOwnedException { if (channelOwner != null) throw new ChannelAlreadyOwnedException (channelOwner); channelOwner = owner; return this; } | public ByteChannel getChannel(Device owner) throws ChannelAlreadyOwnedException { if (channelOwner != null) throw new ChannelAlreadyOwnedException (channelOwner); channelOwner = owner; return this; } | 27,330 |
public boolean isOpen() { return true; } | public boolean isOpen() { return true; } | 27,331 |
public int read (ByteBuffer dst) { int n = dst.remaining (); for (int i=0; i<n; i++) dst.put ((byte)readSingle ()); return n; } | public int read (ByteBuffer dst) { int n = dst.remaining (); for (int i=0; i<n; i++) dst.put ((byte)readSingle ()); return n; } | 27,332 |
public int readSingle() { // should detect overruns, maybe parity errors, framing errors, and // breaks. // FIXME: busy waiting for a bit block to arrive while ((port.inPortByte(basePort + 5) & 1) == 0); return port.inPortByte(basePort); } | public int readSingle() { // should detect overruns, maybe parity errors, framing errors, and // breaks. // FIXME: busy waiting for a bit block to arrive while ((port.inPortByte(basePort + 5) & 1) == 0); return port.inPortByte(basePort); } | 27,333 |
public int readSingle() { // should detect overruns, maybe parity errors, framing errors, and // breaks. // FIXME: busy waiting for a bit block to arrive while ((port.inPortByte(basePort + 5) & 1) == 0); return port.inPortByte(basePort); } | public int readSingle() { // should detect overruns, maybe parity errors, framing errors, and // breaks. // FIXME: busy waiting for a bit block to arrive while ((port.inPortByte(basePort + 5) & 1) == 0); return port.inPortByte(basePort); } | 27,334 |
protected void startDevice() throws DriverException { try { final ResourceManager rm = (ResourceManager) InitialNaming.lookup(ResourceManager.NAME); port = rm.claimIOResource(getDevice(), basePort, 8); configure(BAUD9600); getDevice().registerAPI(SerialPortAPI.class, this); } catch (NameNotFoundException nnf... | protected void startDevice() throws DriverException { try { final ResourceManager rm = (ResourceManager) InitialNaming.lookup(ResourceManager.NAME); port = rm.claimIOResource(getDevice(), basePort, 8); configure(BAUD9600); getDevice().registerAPI(SerialPortAPI.class, this); } catch (NameNotFoundException nnf... | 27,335 |
protected void stopDevice() { port.release(); } | protected void stopDevice() { port.release(); } | 27,336 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.