protected void flattenMapping(MappingNode node) { // perform merging only on nodes containing merge node(s) processDuplicateKeys(node); if (node.isMerged()) { node.setValue(mergeNode(node, true, new HashMap<Object, Integer>(), new ArrayList<NodeTuple>())); } }
protected void flattenMapping(MappingNode node) { // perform merging only on nodes containing merge node(s) if (node.isMerged()) { node.setValue(mergeNode(node, true, new HashMap<Object, Integer>(), new ArrayList<NodeTuple>())); } }
protected void flattenMapping(MappingNode node) { // perform merging only on nodes containing merge node(s) if (node.isMerged()) { node.setValue(mergeNode(node, true, new HashMap<Object, Integer>(), new ArrayList<NodeTuple>())); } }
protected void flattenMapping(MappingNode node) { // perform merging only on nodes containing merge node(s) processDuplicateKeys(node); if (node.isMerged()) { node.setValue(mergeNode(node, true, new HashMap<Object, Integer>(), new ArrayList<NodeTuple>())); } }