author | mkos |
Sun, 30 Dec 2012 00:00:00 +0100 | |
changeset 22678 | ac1ea46be942 |
parent 12009 | 4abb694f273a |
permissions | -rw-r--r-- |
12009 | 1 |
/* |
22678
ac1ea46be942
8029237: Update copyright year to match last edit in jaxws repository for 2012
mkos
parents:
12009
diff
changeset
|
2 |
* Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved. |
12009 | 3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
* |
|
5 |
* This code is free software; you can redistribute it and/or modify it |
|
6 |
* under the terms of the GNU General Public License version 2 only, as |
|
7 |
* published by the Free Software Foundation. Oracle designates this |
|
8 |
* particular file as subject to the "Classpath" exception as provided |
|
9 |
* by Oracle 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
22 |
* or visit www.oracle.com if you need additional information or have any |
|
23 |
* questions. |
|
24 |
*/ |
|
25 |
/* |
|
26 |
* Copyright (C) 2004-2011 |
|
27 |
* |
|
28 |
* Permission is hereby granted, free of charge, to any person obtaining a copy |
|
29 |
* of this software and associated documentation files (the "Software"), to deal |
|
30 |
* in the Software without restriction, including without limitation the rights |
|
31 |
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
|
32 |
* copies of the Software, and to permit persons to whom the Software is |
|
33 |
* furnished to do so, subject to the following conditions: |
|
34 |
* |
|
35 |
* The above copyright notice and this permission notice shall be included in |
|
36 |
* all copies or substantial portions of the Software. |
|
37 |
* |
|
38 |
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|
39 |
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|
40 |
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|
41 |
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|
42 |
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
|
43 |
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
|
44 |
* THE SOFTWARE. |
|
45 |
*/ |
|
46 |
package com.sun.xml.internal.rngom.binary; |
|
47 |
||
48 |
import java.util.ArrayList; |
|
49 |
import java.util.List; |
|
50 |
||
51 |
import com.sun.xml.internal.rngom.nc.NameClass; |
|
52 |
||
53 |
class DuplicateAttributeDetector { |
|
54 |
private List nameClasses = new ArrayList(); |
|
55 |
private Alternative alternatives = null; |
|
56 |
||
57 |
private static class Alternative { |
|
58 |
private int startIndex; |
|
59 |
private int endIndex; |
|
60 |
private Alternative parent; |
|
61 |
||
62 |
private Alternative(int startIndex, Alternative parent) { |
|
63 |
this.startIndex = startIndex; |
|
64 |
this.endIndex = startIndex; |
|
65 |
this.parent = parent; |
|
66 |
} |
|
67 |
} |
|
68 |
||
69 |
boolean addAttribute(NameClass nc) { |
|
70 |
int lim = nameClasses.size(); |
|
71 |
for (Alternative a = alternatives; a != null; a = a.parent) { |
|
72 |
for (int i = a.endIndex; i < lim; i++) |
|
73 |
if (nc.hasOverlapWith((NameClass) nameClasses.get(i))) |
|
74 |
return false; |
|
75 |
lim = a.startIndex; |
|
76 |
} |
|
77 |
for (int i = 0; i < lim; i++) |
|
78 |
if (nc.hasOverlapWith((NameClass) nameClasses.get(i))) |
|
79 |
return false; |
|
80 |
nameClasses.add(nc); |
|
81 |
return true; |
|
82 |
} |
|
83 |
||
84 |
void startChoice() { |
|
85 |
alternatives = new Alternative(nameClasses.size(), alternatives); |
|
86 |
} |
|
87 |
||
88 |
void alternative() { |
|
89 |
alternatives.endIndex = nameClasses.size(); |
|
90 |
} |
|
91 |
||
92 |
void endChoice() { |
|
93 |
alternatives = alternatives.parent; |
|
94 |
} |
|
95 |
||
96 |
} |