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) 1997, 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 |
package com.sun.tools.internal.xjc.reader.gbind; |
|
27 |
||
28 |
import java.util.LinkedHashSet; |
|
29 |
||
30 |
/** |
|
31 |
* Factory methods for {@link ElementSet}. |
|
32 |
* |
|
33 |
* @author Kohsuke Kawaguchi |
|
34 |
*/ |
|
35 |
public final class ElementSets { |
|
36 |
/** |
|
37 |
* Returns an union of two {@link ElementSet}s. |
|
38 |
* |
|
39 |
* This method performs better if lhs is bigger than rhs |
|
40 |
*/ |
|
41 |
public static ElementSet union(ElementSet lhs, ElementSet rhs) { |
|
42 |
if(lhs.contains(rhs)) |
|
43 |
return lhs; |
|
44 |
if(lhs==ElementSet.EMPTY_SET) |
|
45 |
return rhs; |
|
46 |
if(rhs==ElementSet.EMPTY_SET) |
|
47 |
return lhs; |
|
48 |
return new MultiValueSet(lhs,rhs); |
|
49 |
} |
|
50 |
||
51 |
/** |
|
52 |
* {@link ElementSet} that has multiple {@link Element}s in it. |
|
53 |
* |
|
54 |
* This isn't particularly efficient or anything, but it will do for now. |
|
55 |
*/ |
|
56 |
private static final class MultiValueSet extends LinkedHashSet<Element> implements ElementSet { |
|
57 |
public MultiValueSet(ElementSet lhs, ElementSet rhs) { |
|
58 |
addAll(lhs); |
|
59 |
addAll(rhs); |
|
60 |
// not that anything will break with size==1 MultiValueSet, |
|
61 |
// but it does suggest that we are missing an easy optimization |
|
62 |
assert size()>1; |
|
63 |
} |
|
64 |
||
65 |
private void addAll(ElementSet lhs) { |
|
66 |
if(lhs instanceof MultiValueSet) { |
|
67 |
super.addAll((MultiValueSet)lhs); |
|
68 |
} else { |
|
69 |
for (Element e : lhs) |
|
70 |
add(e); |
|
71 |
} |
|
72 |
} |
|
73 |
||
74 |
public boolean contains(ElementSet rhs) { |
|
75 |
// this isn't complete but sound |
|
76 |
return super.contains(rhs) || rhs==ElementSet.EMPTY_SET; |
|
77 |
} |
|
78 |
||
79 |
public void addNext(Element element) { |
|
80 |
for (Element e : this) |
|
81 |
e.addNext(element); |
|
82 |
} |
|
83 |
} |
|
84 |
} |