Apache
/
commons-collections
mirror of https://github.com/apache/commons-collections.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Explicit boxing 

This documents that the boxing is actually intended, rather than an error due to the accidental use of the wrong type.

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/collections/trunk@1476781 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Sebastian Bazley 2013-04-28 14:20:56 +00:00
parent 842e39bef6
commit ce86f3f8aa
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/main/java/org/apache/commons/collections4/iterators/PermutationIterator.java
View File

@ -84,7 +84,7 @@ public class PermutationIterator<E> implements Iterator<List<E>> {
int value = 1; int value = 1;
objectMap = new HashMap<Integer, E>(); objectMap = new HashMap<Integer, E>();
for (E e : coll) { for (E e : coll) {
objectMap.put(value, e); objectMap.put(Integer.valueOf(value), e);
keys[value - 1] = value; keys[value - 1] = value;
value++; value++;
} }
@ -142,7 +142,7 @@ public class PermutationIterator<E> implements Iterator<List<E>> {
if (keys[i] > largestKey) { if (keys[i] > largestKey) {
direction[i] = !direction[i]; direction[i] = !direction[i];
} }
nextP.add(objectMap.get(keys[i])); nextP.add(objectMap.get(Integer.valueOf(keys[i])));
} }
final List<E> result = nextPermutation; final List<E> result = nextPermutation;
nextPermutation = nextP; nextPermutation = nextP;

2
src/main/java/org/apache/commons/collections4/queue/CircularFifoQueue.java
View File

@ -256,7 +256,7 @@ public class CircularFifoQueue<E> extends AbstractCollection<E>
if (index < 0 || index >= sz) { if (index < 0 || index >= sz) {
throw new NoSuchElementException( throw new NoSuchElementException(
String.format("The specified index (%1$d) is outside the available range [0, %2$d)", String.format("The specified index (%1$d) is outside the available range [0, %2$d)",
index, sz)); Integer.valueOf(index), Integer.valueOf(sz)));
} }
final int idx = (start + index) % maxElements; final int idx = (start + index) % maxElements;