Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
IdentitySet |
|
| 1.0;1 | ||||
IdentitySet$IdentityWrapper |
|
| 1.0;1 |
1 | /* | |
2 | $Id$ | |
3 | ||
4 | Copyright 2005 Elliotte Rusty Harold. All Rights Reserved. | |
5 | | |
6 | Redistribution and use in source and binary forms, with or without | |
7 | modification, are permitted provided that the following conditions are | |
8 | met: | |
9 | ||
10 | * Redistributions of source code must retain the above copyright | |
11 | notice, this list of conditions and the following disclaimer. | |
12 | ||
13 | * Redistributions in binary form must reproduce the above copyright | |
14 | notice, this list of conditions and the following disclaimer in the | |
15 | documentation and/or other materials provided with the distribution. | |
16 | ||
17 | * Neither the name of the Jaxen Project nor the names of its | |
18 | contributors may be used to endorse or promote products derived | |
19 | from this software without specific prior written permission. | |
20 | ||
21 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS | |
22 | IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED | |
23 | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A | |
24 | PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER | |
25 | OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | |
26 | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | |
27 | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | |
28 | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF | |
29 | LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING | |
30 | NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | |
31 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
32 | ||
33 | */ | |
34 | package org.jaxen.expr; | |
35 | ||
36 | import java.util.HashSet; | |
37 | ||
38 | ||
39 | /** | |
40 | * <p> | |
41 | * This is a set that uses identity rather than equality semantics. | |
42 | * </p> | |
43 | * | |
44 | * @author Elliotte Rusty Harold | |
45 | * | |
46 | */ | |
47 | final class IdentitySet { | |
48 | ||
49 | 1542 | private HashSet contents = new HashSet(); |
50 | ||
51 | IdentitySet() { | |
52 | 1542 | super(); |
53 | 1542 | } |
54 | ||
55 | void add(Object object) { | |
56 | 40960 | IdentityWrapper wrapper = new IdentityWrapper(object); |
57 | 40960 | contents.add(wrapper); |
58 | 40960 | } |
59 | ||
60 | public boolean contains(Object object) { | |
61 | 42690 | IdentityWrapper wrapper = new IdentityWrapper(object); |
62 | 42690 | return contents.contains(wrapper); |
63 | } | |
64 | ||
65 | private static class IdentityWrapper { | |
66 | ||
67 | private Object object; | |
68 | ||
69 | 83650 | IdentityWrapper(Object object) { |
70 | 83650 | this.object = object; |
71 | 83650 | } |
72 | ||
73 | public boolean equals(Object o) { | |
74 | 34 | IdentityWrapper w = (IdentityWrapper) o; |
75 | 34 | return object == w.object; |
76 | } | |
77 | ||
78 | public int hashCode() { | |
79 | 83650 | return System.identityHashCode(object); |
80 | } | |
81 | ||
82 | } | |
83 | ||
84 | ||
85 | } |