private static void processSequenceMin(ISchemaCompositor compositor, HashSet<ElementOccurrenceResult> elementSet, HashMap<String, Integer> siblings, int multiplicityTracker) { ISchemaObject[] schemaObject = compositor.getChildren(); // Unbounded min occurs are represented by the maximum integer value if (multiplicityTracker < Integer.MAX_VALUE) { // Multiply the min occurs amount to the overall multiplicity multiplicityTracker = compositor.getMinOccurs() * multiplicityTracker; } // Process the compositors children for (int i = 0; i < compositor.getChildCount(); i++) { processObjectMin(schemaObject[i], elementSet, siblings, multiplicityTracker); } }
/** * @param compositor * @param elementSet * @param siblings * @param multiplicityTracker */ private static void processSequenceMin( ISchemaCompositor compositor, HashSet elementSet, HashMap siblings, int multiplicityTracker) { ISchemaObject[] schemaObject = compositor.getChildren(); // Unbounded min occurs are represented by the maximum integer value if (multiplicityTracker < Integer.MAX_VALUE) { // Multiply the min occurs amount to the overall multiplicity multiplicityTracker = compositor.getMinOccurs() * multiplicityTracker; } // Process the compositors children for (int i = 0; i < compositor.getChildCount(); i++) { processObjectMin(schemaObject[i], elementSet, siblings, multiplicityTracker); } }
private static void processChoiceMin(ISchemaCompositor compositor, HashSet<ElementOccurrenceResult> elementSet, HashMap<String, Integer> siblings, int multiplicityTracker) { // Unbounded min occurs are represented by the maximum integer value if (multiplicityTracker < Integer.MAX_VALUE) { // Multiply the min occurs amount to the overall multiplicity multiplicityTracker = compositor.getMinOccurs() * multiplicityTracker; } adjustChoiceMinSiblings(compositor, siblings); ISchemaObject[] schemaObject = compositor.getChildren(); // Process the compositors children for (int i = 0; i < compositor.getChildCount(); i++) { processObjectMin(schemaObject[i], elementSet, siblings, multiplicityTracker); } }
/** * @param compositor * @param elementSet * @param siblings * @param multiplicityTracker */ private static void processChoiceMin( ISchemaCompositor compositor, HashSet elementSet, HashMap siblings, int multiplicityTracker) { // Unbounded min occurs are represented by the maximum integer value if (multiplicityTracker < Integer.MAX_VALUE) { // Multiply the min occurs amount to the overall multiplicity multiplicityTracker = compositor.getMinOccurs() * multiplicityTracker; } adjustChoiceMinSiblings(compositor, siblings); ISchemaObject[] schemaObject = compositor.getChildren(); // Process the compositors children for (int i = 0; i < compositor.getChildCount(); i++) { processObjectMin(schemaObject[i], elementSet, siblings, multiplicityTracker); } }