JoaoJunior/formatted-java-preprocessed-code-APR

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...

17,073

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() { if ((! allowsChildren) || children.size() == 0) return 0; // 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 = n...

17,074

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...

17,075

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...

17,076

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...

17,078

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...

17,079

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...

17,080

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...

17,081

public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf()

public DefaultMutableTreeNode getFirstLeaf() { TreeNode current = this; // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf()

17,082

public DefaultMutableTreeNode getFirstLeaf() { // Variables TreeNode current; current = this; while (current.getChildCount() > 0) { current = current.getChildAt(0); } // while return (DefaultMutableTreeNode) current; } // getFirstLeaf()

17,083

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()

17,084

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() { TreeNode current = this; int size = current.getChildCount(); // Variables TreeNode current; int size; current = this; size = current.getChildCount(); while (size > 0) { current = current.getChildAt(size - 1); size = current.getChildCount(); } // while return ...

17,085

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()

17,086

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() { int count = 0; Enumeration e = depthFirstEnumeration(); // 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.nextEleme...

17,087

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++; } ...

17,088

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++; } ...

17,089

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++; } ...

17,090

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() { int count = -1; TreeNode current = this; // Variables TreeNode current; int count; // Lookup Parent count = -1; current = this; do { current = current.getParent(); count++; } while (current != null); return count; } // getLevel()

17,091

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()

17,092

public DefaultMutableTreeNode getNextLeaf() { return null; // TODO } // getNextLeaf()

17,093

public DefaultMutableTreeNode getNextNode() { return null; // TODO } // getNextNode()

17,094

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() { if (parent == null) return null; // 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++; i...

17,095

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...

17,096

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 (index == parent.getChildCount()) return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Next Sibling size = parent.getChildCount(); index++; if (index == size) ...

17,097

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...

17,098

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...

17,099

protected TreeNode[] getPathToRoot(TreeNode value0, int value1) { return null; // TODO } // getPathToRoot()

17,100

public DefaultMutableTreeNode getPreviousLeaf() { return null; // TODO } // getPreviousLeaf()

17,101

public DefaultMutableTreeNode getPreviousNode() { return null; // TODO } // getPreviousNode()

17,102

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() { if (parent == null) return null; // 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; } //...

17,103

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 = parent.getIndex(this) - 1; // 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 r...

17,104

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 (index < 0) return null; } // if // Get Index of this node index = parent.getIndex(this); // Check for Previous Sibling index--; if (index < 0) { return null; } // if return (DefaultMutableTreeNode) par...

17,105

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...

17,106

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() { TreeNode current = this; TreeNode check = current.getParent(); // Variables TreeNode current; TreeNode check; // Lookup Parent current = this; check = current.getParent(); while (check != null) { current = check; check = current.getParent(); } // while return current; } // getR...

17,107

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()

17,108

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) { TreeNode current = this; ArrayList list = new ArrayList(); // 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 =...

17,109

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...

17,110

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...

17,111

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...

17,112

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() { if (parent == null) return 1; // Variables // Check for no parent if (parent == null) { return 1; } // if // Calculate sibling count from parent's child count return parent.getChildCount(); } // getSiblingCount()

17,113

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()

17,114

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() { TreeNode[] path = getPathToRoot(this, 0); Object[] object = new Object[path.length]; // 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 <...

17,115

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...

17,116

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...

17,117

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) { DefaultMutableTreeNode node; // Variables int index; DefaultMutableTreeNode node; DefaultMutableTreeNode current; current = root; index = 0;// while (current != root) { do {// if (random.nextInt(3) < 2) { if (random.nextBoolean()) { node = ...

17,118

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...

17,119

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...

17,120

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...

17,121

public boolean isLeaf() { return (children.size() == 0); // TODO: check allowsChildren?? } // isLeaf()

17,122

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) { if (node == null) return false; // 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 fo...

17,123

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 = this; // 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 =...

17,124

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)...

17,125

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)...

17,126

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...

17,127

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 ...

17,128

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) { if (node == null) return false; // Variables TreeNode current; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // ...

17,129

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 = node; // Sanity Check if (node == null) { return false; } // if // Search For Descendant current = node; while (current != null && current != this) { current = current.getParent(); } // while // Check for Desce...

17,130

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 ...

17,131

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 ...

17,132

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) { if (node == null) return false; // 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()

17,133

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()

17,134

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) { if (node == null) return false; // 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; } // isNodeSi...

17,135

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()

17,136

public Enumeration pathFromAncestorEnumeration(TreeNode value0) { return null; // TODO } // pathFromAncestorEnumeration()

17,137

private void readObject(ObjectInputStream value0) throws IOException, ClassNotFoundException { // TODO } // readObject()

17,138

public String toString() { if (userObject == null) { return null; } // if return userObject.toString(); } // toString()

17,139

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()

17,140

private void writeObject(ObjectOutputStream value0) throws IOException { // TODO } // writeObject()

17,141

public void setParent(MutableTreeNode parent);

void setParent(MutableTreeNode parent);

17,142

public void insert(MutableTreeNode child, int index);

void insert(MutableTreeNode child, int index);

17,143

public void remove(int index);

void remove(int index);

17,144

public void removeFromParent();

void removeFromParent();

17,145

public void setUserObject(Object object);

void setUserObject(Object object);

17,146

public InputMethod createInputMethod() throws Exception;

InputMethod createInputMethod() throws Exception;

17,147

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; }

17,149

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...

17,150

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...

17,151

final AbstractX86StackManager createStackMgr() { return new StackManagerImpl(); }

17,152

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); } }

17,153

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...

17,154

final void push(Item item) { Item.assertCondition(item.getKind() == expectedKind, "item.getKind() == expectedKind"); if (tos == stack.length) grow(); stack[ tos++] = item; }

17,155

void reset() { stack = new Item[ Math.min(8, maxSize)]; tos = 0; }

17,156

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) ...

17,157

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...

17,158

public void from_any(Any an_any) throws TypeMismatch, InvalidValue { checkType(official_type, an_any.type()); try { if (!an_any.type().content_type().equal(content)) throw new InvalidValue(CONTENT); } catch (BadKind e) { TypeMismatch t = new TypeMismatch(...

17,159

public void writeCData(String data) throws XMLStreamException { try { endStartElement(); if (data.indexOf("]]") != -1) throw new IllegalArgumentException(data); writer.write("<![CDATA["); writer.write(data); writer.write("]]>"); } catch (IOException e) ...

17,163

public void writeCharacters(String text) throws XMLStreamException { try { endStartElement(); if (text != null) writeEncoded(text, false); } catch (IOException e) { XMLStreamException e2 = new XMLStreamException(e); e2.initCause(e); throw e2; }...

public void writeCharacters(String text) throws XMLStreamException { try { endStartElement(); if (hasXML11RestrictedChars) writeEncodedWithRestrictedChars(text, false); else writeEncoded(text, false); } catch (IOException e) { XMLStreamException e2 = new XMLStrea...

17,164

public void writeComment(String data) throws XMLStreamException { try { endStartElement(); if (data != null && data.indexOf("--") != -1) throw new IllegalArgumentException(data); writer.write("<!--"); if (data != null) writer.write(data); ...

17,165

public void writeComment(String data) throws XMLStreamException { try { endStartElement(); if (data != null && data.indexOf("--") != -1) throw new IllegalArgumentException(data); writer.write("<!--"); if (data != null) writer.write(data); ...

public void writeComment(String data) throws XMLStreamException { try { endStartElement(); if (data != null && data.indexOf("--") != -1) throw new IllegalArgumentException(data); writer.write("<!--"); if (hasXML11RestrictedChars) { int[] seq = UnicodeRe...

17,166

public void writeDefaultNamespace(String namespaceURI) throws XMLStreamException { writeNamespace(XMLConstants.DEFAULT_NS_PREFIX, namespaceURI); }

public void writeDefaultNamespace(String namespaceURI) throws XMLStreamException { if (!inStartElement) throw new IllegalStateException(); if (!isURI(namespaceURI)) throw new IllegalArgumentException("illegal URI: " + namespaceURI); writeNamespaceImpl(XMLConstants.DEFAULT_NS_PREFIX, namespaceURI); }

17,168

public void writeNamespace(String prefix, String namespaceURI) throws XMLStreamException { if (!inStartElement) throw new IllegalStateException(); try { if (prefix == null) prefix = XMLConstants.DEFAULT_NS_PREFIX; setPrefix(prefix, namespaceURI); writer.write(...

17,170

public final Class getCategory() { return JobOriginatingUserName.class; }

public Class getCategory() { return JobOriginatingUserName.class; }

17,173

public final String getName() { return "job-originating-user-name"; }

public String getName() { return "job-originating-user-name"; }

17,174

public String getName() { return (String) getAttribute(StyleConstants.NameAttribute); }

public String getName() { Object tag = getAttribute(StyleConstants.NameAttribute); String name = null; if (tag != null) name = tag.toString(); return name; }

17,175

public void end(HTML.Tag t) { // FIXME: Implement. print ("ParagraphAction.end not implemented"); }

public void end(HTML.Tag t) { // FIXME: Implement. blockClose(t); }

17,176

public void start(HTML.Tag t, MutableAttributeSet a) { // FIXME: Implement. print ("ParagraphAction.start not implemented"); }

public void start(HTML.Tag t, MutableAttributeSet a) { // FIXME: Implement. blockOpen(t, a); }

17,177

protected void blockOpen(HTML.Tag t, MutableAttributeSet attr) { printBuffer(); DefaultStyledDocument.ElementSpec element; element = new DefaultStyledDocument.ElementSpec(attr.copyAttributes(), DefaultStyledDocument.ElementSpec.StartTagType); parseBuffer.addElement(element); printBuffe...

protected void blockOpen(HTML.Tag t, MutableAttributeSet attr) { printBuffer(); DefaultStyledDocument.ElementSpec element; attr.addAttribute(StyleConstants.NameAttribute, t); element = new DefaultStyledDocument.ElementSpec(attr, DefaultStyledDocument.ElementSpec.StartTagType); parseBuffer.a...

17,178

protected void create(DefaultStyledDocument.ElementSpec[] data) { // FIXME: Not implemented System.out.println("create not implemented"); super.create(data); }

protected void create(ElementSpec[] data) { // FIXME: Not implemented System.out.println("create not implemented"); super.create(data); }

17,179

protected void create(DefaultStyledDocument.ElementSpec[] data) { // FIXME: Not implemented System.out.println("create not implemented"); super.create(data); }

protected void create(DefaultStyledDocument.ElementSpec[] data) { // FIXME: Not implemented super.create(data); }

17,180

protected Element createBranchElement(Element parent, AttributeSet a) { // FIXME: Not implemented System.out.println("createBranchElement not implemented"); return super.createBranchElement(parent, a); }

17,181