private static void processCompositorMax(ISchemaCompositor compositor, HashSet<ElementOccurrenceResult> elementSet, HashMap<String, Integer> siblings, int multiplicityTracker, Element element) { // Compositor can be null only in cases where we had a schema complex // type but that complex type was complex because it had attributes // rather than element children // All we care about is choices and sequences (Alls and groups not // supported) if (compositor == null) { return; } else if (compositor.getKind() == ISchemaCompositor.CHOICE) { processChoiceMax(compositor, elementSet, siblings, multiplicityTracker, element); } else if (compositor.getKind() == ISchemaCompositor.SEQUENCE) { processSequenceMax(compositor, elementSet, siblings, multiplicityTracker, element); } }
/** * @param compositor * @param proposalList * @param siblings * @param multiplicityTracker */ private static void processCompositorMax( ISchemaCompositor compositor, HashSet elementSet, HashMap siblings, int multiplicityTracker, Element element) { // Compositor can be null only in cases where we had a schema complex // type but that complex type was complex because it had attributes // rather than element children // All we care about is choices and sequences (Alls and groups not // supported) if (compositor == null) { return; } else if (compositor.getKind() == ISchemaCompositor.CHOICE) { processChoiceMax(compositor, elementSet, siblings, multiplicityTracker, element); } else if (compositor.getKind() == ISchemaCompositor.SEQUENCE) { processSequenceMax(compositor, elementSet, siblings, multiplicityTracker, element); } }