private void processDatasetsInternal(Node n) { HashMap ss = new HashMap(); Node n2 = n.getFirstChild(); while (n2 != null) { if (n2.getNodeType() == Node.ELEMENT_NODE) { String s = escapeSom(n2.getLocalName()); Integer i = (Integer)ss.get(s); if (i == null) i = new Integer(0); else i = new Integer(i.intValue() + 1); ss.put(s, i); if (hasChildren(n2)) { stack.push(s + "[" + i.toString() + "]"); processDatasetsInternal(n2); stack.pop(); } else { stack.push(s + "[" + i.toString() + "]"); String unstack = printStack(); order.add(unstack); inverseSearchAdd(unstack); name2Node.put(unstack, n2); stack.pop(); } } n2 = n2.getNextSibling(); } } }
private void processDatasetsInternal(Node n) { HashMap ss = new HashMap(); Node n2 = n.getFirstChild(); while (n2 != null) { if (n2.getNodeType() == Node.ELEMENT_NODE) { String s = escapeSom(n2.getLocalName()); Integer i = (Integer)ss.get(s); if (i == null) i = new Integer(0); else i = new Integer(i.intValue() + 1); ss.put(s, i); if (hasChildren(n2)) { stack.push(s + "[" + i.toString() + "]"); processDatasetsInternal(n2); stack.pop(); } else { stack.push(s + "[" + i.toString() + "]"); String unstack = printStack(); order.add(unstack); inverseSearchAdd(unstack); name2Node.put(unstack, n2); stack.pop(); } } n2 = n2.getNextSibling(); } } }
private void processDatasetsInternal(Node n) { HashMap ss = new HashMap(); Node n2 = n.getFirstChild(); while (n2 != null) { if (n2.getNodeType() == Node.ELEMENT_NODE) { String s = escapeSom(n2.getLocalName()); Integer i = (Integer)ss.get(s); if (i == null) i = new Integer(0); else i = new Integer(i.intValue() + 1); ss.put(s, i); if (hasChildren(n2)) { stack.push(s + "[" + i.toString() + "]"); processDatasetsInternal(n2); stack.pop(); } else { stack.push(s + "[" + i.toString() + "]"); String unstack = printStack(); order.add(unstack); inverseSearchAdd(unstack); name2Node.put(unstack, n2); stack.pop(); } } n2 = n2.getNextSibling(); } } }