Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
LinkedIdentityHashSet	35	12	9	0.00%	Show methods
LinkedIdentityHashSet.IdentityWrapper	39	4	3	0.00%	Show methods

Class LinkedIdentityHashSet

Class LinkedIdentityHashSet	Line # 35	Total Statements 12	Complexity 9	TOTAL Coverage 0.00%
add(E) : boolean   add(E) : boolean	6464	2.02	1.01	0.0 0.00%
putIfAbsent(IdentityWrapper,IdentityWrapper) : IdentityWrapper   putIfAbsent(IdentityWrapper,IdentityWrapper) : IdentityWrapper	8787	4.04	2.02	0.0 0.00%
hasNext() : boolean   hasNext() : boolean	105105	1.01	1.01	0.0 0.00%
next() : E   next() : E	111111	1.01	1.01	0.0 0.00%
remove() : void   remove() : void	118118	1.01	1.01	0.0 0.00%
iterator() : Iterator<E>   iterator() : Iterator<E>	9898	1.01	1.01	0.0 0.00%
size() : int   size() : int	127127	1.01	1.01	0.0 0.00%
indexOf(E) : int   indexOf(E) : int	139139	1.01	1.01	0.0 0.00%

 

Class LinkedIdentityHashSet.IdentityWrapper

Class LinkedIdentityHashSet.IdentityWrapper	Line # 39	Total Statements 4	Complexity 3	TOTAL Coverage 0.00%
IdentityWrapper(Object,int)   IdentityWrapper(Object,int)	4545	2.02	1.01	0.0 0.00%
equals(Object) : boolean   equals(Object) : boolean	5151	1.01	1.01	0.0 0.00%
hashCode() : int   hashCode() : int	5757	1.01	1.01	0.0 0.00%

 

Contributing tests

Source view

1		/*
2		* Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3		* Copyright (C) $$Year-Rel$$ The Jalview Authors
4		*
5		* This file is part of Jalview.
6		*
7		* Jalview is free software: you can redistribute it and/or
8		* modify it under the terms of the GNU General Public License
9		* as published by the Free Software Foundation, either version 3
10		* of the License, or (at your option) any later version.
11		*
12		* Jalview is distributed in the hope that it will be useful, but
13		* WITHOUT ANY WARRANTY; without even the implied warranty
14		* of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15		* PURPOSE. See the GNU General Public License for more details.
16		*
17		* You should have received a copy of the GNU General Public License
18		* along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19		* The Jalview Authors are detailed in the 'AUTHORS' file.
20		*/
21		package jalview.util;
22
23		import java.util.AbstractSet;
24		import java.util.Iterator;
25		import java.util.LinkedHashMap;
26
27		/**
28		* Order preserving Set based on System.identityHashCode() for an object, which
29		* also supports Object->index lookup.
30		*
31		* @author Jim Procter (2016) based on Evgeniy Dorofeev's response: via
32		* https://stackoverflow.com/questions/17276658/linkedidentityhashset
33		*
34		*/
		0% Uncovered Elements: 22 (22) Complexity: 9 Complexity Density: 0.75
35		public class LinkedIdentityHashSet<E> extends AbstractSet<E>
36		{
37		LinkedHashMap<IdentityWrapper, IdentityWrapper> set = new LinkedHashMap<>();
38
		0% Uncovered Elements: 7 (7) Complexity: 3 Complexity Density: 0.75
39		static class IdentityWrapper
40		{
41		Object obj;
42
43		public int p;
44
		0% Uncovered Elements: 2 (2) Complexity: 1 Complexity Density: 0.5
45	0	IdentityWrapper(Object obj, int p)...
46		{
47	0	this.obj = obj;
48	0	this.p = p;
49		}
50
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
51	0	@Override...
52		public boolean equals(Object obj)
53		{
54	0	return this.obj == ((IdentityWrapper) obj).obj;
55		}
56
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
57	0	@Override...
58		public int hashCode()
59		{
60	0	return System.identityHashCode(obj);
61		}
62		}
63
		0% Uncovered Elements: 2 (2) Complexity: 1 Complexity Density: 0.5
64	0	@Override...
65		public boolean add(E e)
66		{
67	0	IdentityWrapper el = (new IdentityWrapper(e, set.size()));
68		// Map.putIfAbsent() from Java 8
69		// return set.putIfAbsent(el, el) == null;
70	0	return putIfAbsent(el, el) == null;
71		}
72
73		/**
74		* If the specified key is not already associated with a value (or is mapped
75		* to null) associates it with the given value and returns null, else returns
76		* the current value.
77		*
78		* Method added for Java 7 (can remove for Java 8)
79		*
80		* @param key
81		* @param value
82		* @return
83		* @see https
84		* ://docs.oracle.com/javase/8/docs/api/java/util/Map.html#putIfAbsent
85		* -K-V-
86		*/
		0% Uncovered Elements: 6 (6) Complexity: 2 Complexity Density: 0.5
87	0	private IdentityWrapper putIfAbsent(IdentityWrapper key,...
88		IdentityWrapper value)
89		{
90	0	IdentityWrapper v = set.get(key);
91	0	if (v == null)
92		{
93	0	v = set.put(key, value);
94		}
95	0	return v;
96		}
97
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
98	0	@Override...
99		public Iterator<E> iterator()
100		{
101	0	return new Iterator<E>()
102		{
103		final Iterator<IdentityWrapper> se = set.keySet().iterator();
104
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
105	0	@Override...
106		public boolean hasNext()
107		{
108	0	return se.hasNext();
109		}
110
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
111	0	@SuppressWarnings("unchecked")...
112		@Override
113		public E next()
114		{
115	0	return (E) se.next().obj;
116		}
117
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
118	0	@Override...
119		public void remove()
120		{
121		// Java 8 default behaviour
122	0	throw new UnsupportedOperationException();
123		}
124		};
125		}
126
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
127	0	@Override...
128		public int size()
129		{
130	0	return set.size();
131		}
132
133		/**
134		* Lookup the index for e in the set
135		*
136		* @param e
137		* @return position of e in the set when it was added.
138		*/
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
139	0	public int indexOf(E e)...
140		{
141	0	return set.get(e).p;
142		}
143		}