01: /*
02: * Copyright 2006 Sun Microsystems, Inc. All Rights Reserved.
03: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
04: *
05: * This code is free software; you can redistribute it and/or modify it
06: * under the terms of the GNU General Public License version 2 only, as
07: * published by the Free Software Foundation. Sun designates this
08: * particular file as subject to the "Classpath" exception as provided
09: * by Sun in the LICENSE file that accompanied this code.
10: *
11: * This code is distributed in the hope that it will be useful, but WITHOUT
12: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14: * version 2 for more details (a copy is included in the LICENSE file that
15: * accompanied this code).
16: *
17: * You should have received a copy of the GNU General Public License version
18: * 2 along with this work; if not, write to the Free Software Foundation,
19: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20: *
21: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
22: * CA 95054 USA or visit www.sun.com if you need additional information or
23: * have any questions.
24: */
25:
26: package com.sun.xml.internal.rngom.binary;
27:
28: import com.sun.xml.internal.rngom.binary.visitor.PatternFunction;
29: import com.sun.xml.internal.rngom.binary.visitor.PatternVisitor;
30: import org.xml.sax.Locator;
31: import org.xml.sax.SAXException;
32:
33: public class ListPattern extends Pattern {
34: Pattern p;
35: Locator locator;
36:
37: ListPattern(Pattern p, Locator locator) {
38: super (false, DATA_CONTENT_TYPE, combineHashCode(LIST_HASH_CODE,
39: p.hashCode()));
40: this .p = p;
41: this .locator = locator;
42: }
43:
44: Pattern expand(SchemaPatternBuilder b) {
45: Pattern ep = p.expand(b);
46: if (ep != p)
47: return b.makeList(ep, locator);
48: else
49: return this ;
50: }
51:
52: void checkRecursion(int depth) throws SAXException {
53: p.checkRecursion(depth);
54: }
55:
56: boolean samePattern(Pattern other) {
57: return (other instanceof ListPattern && p == ((ListPattern) other).p);
58: }
59:
60: public void accept(PatternVisitor visitor) {
61: visitor.visitList(p);
62: }
63:
64: public Object apply(PatternFunction f) {
65: return f.caseList(this );
66: }
67:
68: void checkRestrictions(int context, DuplicateAttributeDetector dad,
69: Alphabet alpha) throws RestrictionViolationException {
70: switch (context) {
71: case DATA_EXCEPT_CONTEXT:
72: throw new RestrictionViolationException(
73: "data_except_contains_list");
74: case START_CONTEXT:
75: throw new RestrictionViolationException(
76: "start_contains_list");
77: case LIST_CONTEXT:
78: throw new RestrictionViolationException(
79: "list_contains_list");
80: }
81: try {
82: p.checkRestrictions(LIST_CONTEXT, dad, null);
83: } catch (RestrictionViolationException e) {
84: e.maybeSetLocator(locator);
85: throw e;
86: }
87: }
88:
89: Pattern getOperand() {
90: return p;
91: }
92: }
|