This is an automated email from the git hooks/post-receive script. New commit to branch develop in repository nuiton-matrix. See https://gitlab.nuiton.org/nuiton/nuiton-matrix.git commit fec236a530920e30bddd2a51f0a960614c5e5677 Author: CHRE <CHATELLIER@codelutin.com> Date: Tue Aug 9 14:45:39 2016 +0200 Fix javadoc --- .../src/main/java/cern/colt/GenericSorting.java | 4 +- .../main/java/cern/colt/list/AbstractByteList.java | 66 +++++++++++----------- .../java/cern/colt/list/AbstractDoubleList.java | 40 ++++++------- .../java/cern/colt/list/AbstractFloatList.java | 40 ++++++------- .../main/java/cern/colt/list/AbstractIntList.java | 40 ++++++------- .../main/java/cern/colt/list/AbstractLongList.java | 40 ++++++------- .../main/java/cern/colt/list/ObjectArrayList.java | 38 ++++++------- .../java/cern/colt/map/AbstractDoubleIntMap.java | 16 +++--- .../java/cern/colt/map/AbstractIntDoubleMap.java | 16 +++--- .../main/java/cern/colt/map/AbstractIntIntMap.java | 16 +++--- .../java/cern/colt/map/AbstractIntObjectMap.java | 14 ++--- .../java/cern/colt/map/AbstractLongObjectMap.java | 10 ++-- .../java/cern/colt/map/OpenDoubleIntHashMap.java | 4 +- .../java/cern/colt/map/OpenIntDoubleHashMap.java | 4 +- .../main/java/cern/colt/map/OpenIntIntHashMap.java | 6 +- .../java/cern/colt/map/OpenIntObjectHashMap.java | 4 +- .../java/cern/colt/map/OpenLongObjectHashMap.java | 4 +- .../src/main/java/cern/jet/math/Arithmetic.java | 28 +++++---- .../src/main/java/cern/jet/random/Uniform.java | 2 +- .../cern/jet/random/engine/MersenneTwister.java | 48 ++++++++-------- .../math/matrix/DoubleSparseArrayVector.java | 2 +- .../nuiton/math/matrix/DoubleSparseHashVector.java | 2 +- .../java/org/nuiton/math/matrix/FloatVector.java | 2 +- .../main/java/org/nuiton/math/matrix/MatrixND.java | 2 +- 24 files changed, 227 insertions(+), 221 deletions(-) diff --git a/nuiton-matrix/src/main/java/cern/colt/GenericSorting.java b/nuiton-matrix/src/main/java/cern/colt/GenericSorting.java index 85c04e8..f97500b 100644 --- a/nuiton-matrix/src/main/java/cern/colt/GenericSorting.java +++ b/nuiton-matrix/src/main/java/cern/colt/GenericSorting.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt; @@ -157,7 +157,7 @@ import cern.colt.function.IntComparator; * Methods delegating to comparators cannot do this. They rely on the * comparator. Thus, if such boundary cases are an issue for the application at * hand, comparators explicitly need to implement -0.0 and NaN aware - * comparisons. Remember: <tt>-0.0 < 0.0 == false</tt>, + * comparisons. Remember: <tt>-0.0 < 0.0 == false</tt>, * <tt>(-0.0 == 0.0) == true</tt>, as well as * <tt>5.0 < Double.NaN == false</tt>, <tt>5.0 > Double.NaN == false</tt>. * Same for <tt>float</tt>. diff --git a/nuiton-matrix/src/main/java/cern/colt/list/AbstractByteList.java b/nuiton-matrix/src/main/java/cern/colt/list/AbstractByteList.java index c668c4c..ded6fab 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractByteList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractByteList.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.list; @@ -63,7 +63,7 @@ public abstract class AbstractByteList extends AbstractList { * the index of the last element to be appended (inclusive). * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>other.size()>0 && (from<0 || from>to || to>=other.size())</tt> + * <tt>other.size()>0 && (from<0 || from>to || to>=other.size())</tt> * ). */ public void addAllOfFromTo(AbstractByteList other, int from, int to) { @@ -106,7 +106,7 @@ public abstract class AbstractByteList extends AbstractList { * the index of the last element to be inserted (inclusive). * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>other.size()>0 && (from<0 || from>to || to>=other.size())</tt> + * <tt>other.size()>0 && (from<0 || from>to || to>=other.size())</tt> * ). * @exception IndexOutOfBoundsException * index is out of range ( @@ -375,7 +375,7 @@ public abstract class AbstractByteList extends AbstractList { * parameters this method may return invalid elements without throwing any * exception! <b>You should only use this method when you are absolutely * sure that the index is within bounds.</b> Precondition (unchecked): - * <tt>index >= 0 && index < size()</tt>. + * <tt>index >= 0 && index < size()</tt>. * * This method is normally only used internally in large loops where bounds * are explicitly checked before the loop and need no be rechecked within @@ -416,7 +416,7 @@ public abstract class AbstractByteList extends AbstractList { * returns <code>-1</code> if the element is not found. * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> + * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> * ). */ public int indexOfFromTo(byte element, int from, int to) { @@ -458,7 +458,7 @@ public abstract class AbstractByteList extends AbstractList { * returns <code>-1</code> if the element is not found. * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> + * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> * ). */ public int lastIndexOfFromTo(byte element, int from, int to) { @@ -492,7 +492,7 @@ public abstract class AbstractByteList extends AbstractList { * the index of the last element (inclusive) to be sorted. * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> + * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> * ). */ public void mergeSortFromTo(int from, int to) { @@ -539,7 +539,7 @@ public abstract class AbstractByteList extends AbstractList { * @see Comparator * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> + * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> * ). */ public void mergeSortFromTo(int from, int to, ByteComparator c) { @@ -563,7 +563,7 @@ public abstract class AbstractByteList extends AbstractList { * @return a new list * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> + * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> * ). */ public AbstractByteList partFromTo(int from, int to) { @@ -596,7 +596,7 @@ public abstract class AbstractByteList extends AbstractList { * the index of the last element (inclusive) to be sorted. * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> + * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> * ). */ public void quickSortFromTo(int from, int to) { @@ -640,7 +640,7 @@ public abstract class AbstractByteList extends AbstractList { * @see Comparator * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> + * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> * ). */ public void quickSortFromTo(int from, int to, ByteComparator c) { @@ -690,7 +690,7 @@ public abstract class AbstractByteList extends AbstractList { * index of last element to be removed. * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> + * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> * ). */ public void removeFromTo(int from, int to) { @@ -771,27 +771,27 @@ public abstract class AbstractByteList extends AbstractList { * b=[50, 60, 70, 80, 90] * a.R(...)=a.replaceFromToWithFromTo(...) * - * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] - * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] - * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] - * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] - * a.R(1,6,b,1,2)-->[0, 60, 70, 7] - * a.R(0,6,b,1,2)-->[60, 70, 7] - * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] - * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] + * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] + * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] + * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] + * a.R(1,6,b,1,2)-->[0, 60, 70, 7] + * a.R(0,6,b,1,2)-->[60, 70, 7] + * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] * * Extreme cases: - * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] - * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] - * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] - * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] - * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] - * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] + * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] + * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] + * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] + * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] + * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] + * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] * </pre> */ public void replaceFromToWithFromTo(int from, int to, @@ -926,7 +926,7 @@ public abstract class AbstractByteList extends AbstractList { * with invalid parameters this method may access invalid indexes without * throwing any exception! <b>You should only use this method when you are * absolutely sure that the index is within bounds.</b> Precondition - * (unchecked): <tt>index >= 0 && index < size()</tt>. + * (unchecked): <tt>index >= 0 && index < size()</tt>. * * This method is normally only used internally in large loops where bounds * are explicitly checked before the loop and need no be rechecked within @@ -966,7 +966,7 @@ public abstract class AbstractByteList extends AbstractList { * the index of the last element (inclusive) to be permuted. * @exception IndexOutOfBoundsException * index is out of range ( - * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> + * <tt>size()>0 && (from<0 || from>to || to>=size())</tt> * ). */ public void shuffleFromTo(int from, int to) { diff --git a/nuiton-matrix/src/main/java/cern/colt/list/AbstractDoubleList.java b/nuiton-matrix/src/main/java/cern/colt/list/AbstractDoubleList.java index 996ffb0..7bdbf2a 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractDoubleList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractDoubleList.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.list; @@ -787,27 +787,27 @@ public abstract class AbstractDoubleList extends AbstractList implements * b=[50, 60, 70, 80, 90] * a.R(...)=a.replaceFromToWithFromTo(...) * - * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] - * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] - * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] - * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] - * a.R(1,6,b,1,2)-->[0, 60, 70, 7] - * a.R(0,6,b,1,2)-->[60, 70, 7] - * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] - * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] + * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] + * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] + * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] + * a.R(1,6,b,1,2)-->[0, 60, 70, 7] + * a.R(0,6,b,1,2)-->[60, 70, 7] + * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] * * Extreme cases: - * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] - * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] - * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] - * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] - * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] - * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] + * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] + * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] + * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] + * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] + * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] + * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] * </pre> */ public void replaceFromToWithFromTo(int from, int to, diff --git a/nuiton-matrix/src/main/java/cern/colt/list/AbstractFloatList.java b/nuiton-matrix/src/main/java/cern/colt/list/AbstractFloatList.java index 2ac31ce..543646d 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractFloatList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractFloatList.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.list; @@ -772,27 +772,27 @@ public abstract class AbstractFloatList extends AbstractList { * b=[50, 60, 70, 80, 90] * a.R(...)=a.replaceFromToWithFromTo(...) * - * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] - * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] - * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] - * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] - * a.R(1,6,b,1,2)-->[0, 60, 70, 7] - * a.R(0,6,b,1,2)-->[60, 70, 7] - * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] - * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] + * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] + * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] + * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] + * a.R(1,6,b,1,2)-->[0, 60, 70, 7] + * a.R(0,6,b,1,2)-->[60, 70, 7] + * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] * * Extreme cases: - * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] - * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] - * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] - * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] - * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] - * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] + * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] + * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] + * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] + * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] + * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] + * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] * </pre> */ public void replaceFromToWithFromTo(int from, int to, diff --git a/nuiton-matrix/src/main/java/cern/colt/list/AbstractIntList.java b/nuiton-matrix/src/main/java/cern/colt/list/AbstractIntList.java index eca7fce..1c0b6ca 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractIntList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractIntList.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.list; @@ -785,27 +785,27 @@ public abstract class AbstractIntList extends AbstractList implements * b=[50, 60, 70, 80, 90] * a.R(...)=a.replaceFromToWithFromTo(...) * - * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] - * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] - * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] - * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] - * a.R(1,6,b,1,2)-->[0, 60, 70, 7] - * a.R(0,6,b,1,2)-->[60, 70, 7] - * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] - * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] + * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] + * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] + * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] + * a.R(1,6,b,1,2)-->[0, 60, 70, 7] + * a.R(0,6,b,1,2)-->[60, 70, 7] + * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] * * Extreme cases: - * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] - * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] - * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] - * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] - * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] - * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] + * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] + * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] + * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] + * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] + * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] + * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] * </pre> */ public void replaceFromToWithFromTo(int from, int to, diff --git a/nuiton-matrix/src/main/java/cern/colt/list/AbstractLongList.java b/nuiton-matrix/src/main/java/cern/colt/list/AbstractLongList.java index 1b4513c..9bb89f6 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractLongList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractLongList.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.list; @@ -770,27 +770,27 @@ public abstract class AbstractLongList extends AbstractList { * b=[50, 60, 70, 80, 90] * a.R(...)=a.replaceFromToWithFromTo(...) * - * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] - * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] - * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] - * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] - * a.R(1,6,b,1,2)-->[0, 60, 70, 7] - * a.R(0,6,b,1,2)-->[60, 70, 7] - * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] - * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] + * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] + * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] + * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] + * a.R(1,6,b,1,2)-->[0, 60, 70, 7] + * a.R(0,6,b,1,2)-->[60, 70, 7] + * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] * * Extreme cases: - * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] - * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] - * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] - * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] - * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] - * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] + * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] + * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] + * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] + * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] + * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] + * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] * </pre> */ public void replaceFromToWithFromTo(int from, int to, diff --git a/nuiton-matrix/src/main/java/cern/colt/list/ObjectArrayList.java b/nuiton-matrix/src/main/java/cern/colt/list/ObjectArrayList.java index dd3c479..d67939f 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/ObjectArrayList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/ObjectArrayList.java @@ -1014,27 +1014,27 @@ public class ObjectArrayList<T> extends AbstractList { * b=[50, 60, 70, 80, 90] * a.R(...)=a.replaceFromToWithFromTo(...) * - * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] - * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] - * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] - * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] - * a.R(1,6,b,1,2)-->[0, 60, 70, 7] - * a.R(0,6,b,1,2)-->[60, 70, 7] - * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] - * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] - * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(3,5,b,0,4)-->[0, 1, 2, 50, 60, 70, 80, 90, 6, 7] + * a.R(1,6,b,0,4)-->[0, 50, 60, 70, 80, 90, 7] + * a.R(0,6,b,0,4)-->[50, 60, 70, 80, 90, 7] + * a.R(3,5,b,1,2)-->[0, 1, 2, 60, 70, 6, 7] + * a.R(1,6,b,1,2)-->[0, 60, 70, 7] + * a.R(0,6,b,1,2)-->[60, 70, 7] + * a.R(5,3,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,0,b,0,4)-->[0, 1, 2, 3, 4, 50, 60, 70, 80, 90, 5, 6, 7] + * a.R(5,3,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] + * a.R(5,0,b,1,2)-->[0, 1, 2, 3, 4, 60, 70, 5, 6, 7] * * Extreme cases: - * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] - * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] - * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] - * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] - * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] - * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] - * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] + * a.R(5,3,b,0,0)-->[0, 1, 2, 3, 4, 50, 5, 6, 7] + * a.R(5,3,b,4,4)-->[0, 1, 2, 3, 4, 90, 5, 6, 7] + * a.R(3,5,a,0,1)-->[0, 1, 2, 0, 1, 6, 7] + * a.R(3,5,a,3,5)-->[0, 1, 2, 3, 4, 5, 6, 7] + * a.R(3,5,a,4,4)-->[0, 1, 2, 4, 6, 7] + * a.R(5,3,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,b,0,4)-->[50, 60, 70, 80, 90, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(0,-1,a,0,4)-->[0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 7] + * a.R(8,0,a,0,4)-->[0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4] * </pre> */ public void replaceFromToWithFromTo(int from, int to, diff --git a/nuiton-matrix/src/main/java/cern/colt/map/AbstractDoubleIntMap.java b/nuiton-matrix/src/main/java/cern/colt/map/AbstractDoubleIntMap.java index 624c499..541d3dd 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/AbstractDoubleIntMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/AbstractDoubleIntMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -16,7 +16,7 @@ import cern.colt.list.IntArrayList; /** * Abstract base class for hash maps holding (key,value) associations of type - * <tt>(double-->int)</tt>. First see the <a href="package-summary.html">package + * <tt>(double-->int)</tt>. First see the <a href="package-summary.html">package * summary</a> and javadoc <a href="package-tree.html">tree view</a> to get the * broad picture. * <p> @@ -90,7 +90,7 @@ public abstract class AbstractDoubleIntMap extends AbstractMap { * m1.forEachPair( * new DoubleIntProcedure() { * public boolean apply(double key, int value) { - * return m2.containsKey(key) && m2.get(key) == value; + * return m2.containsKey(key) && m2.get(key) == value; * } * } * ) @@ -98,7 +98,7 @@ public abstract class AbstractDoubleIntMap extends AbstractMap { * m2.forEachPair( * new DoubleIntProcedure() { * public boolean apply(double key, int value) { - * return m1.containsKey(key) && m1.get(key) == value; + * return m1.containsKey(key) && m1.get(key) == value; * } * } * ); @@ -260,7 +260,7 @@ public abstract class AbstractDoubleIntMap extends AbstractMap { * smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> * * @param keyList * the list to be filled, can have any size. @@ -282,7 +282,7 @@ public abstract class AbstractDoubleIntMap extends AbstractMap { * DoubleIntProcedure condition = new DoubleIntProcedure() { // match even values only * public boolean apply(double key, int value) { return value%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition @@ -316,7 +316,7 @@ public abstract class AbstractDoubleIntMap extends AbstractMap { * <tt>this.size()</tt>. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> * * @param keyList * the list to be filled with keys, can have any size. @@ -362,7 +362,7 @@ public abstract class AbstractDoubleIntMap extends AbstractMap { * smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> * * @param keyList * the list to be filled with keys, can have any size. diff --git a/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntDoubleMap.java b/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntDoubleMap.java index cde52f3..058b2e9 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntDoubleMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntDoubleMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -16,7 +16,7 @@ import cern.colt.list.IntArrayList; /** * Abstract base class for hash maps holding (key,value) associations of type - * <tt>(int-->double)</tt>. First see the <a href="package-summary.html">package + * <tt>(int-->double)</tt>. First see the <a href="package-summary.html">package * summary</a> and javadoc <a href="package-tree.html">tree view</a> to get the * broad picture. * <p> @@ -124,7 +124,7 @@ public abstract class AbstractIntDoubleMap extends AbstractMap { * m1.forEachPair( * new IntDoubleProcedure() { * public boolean apply(int key, double value) { - * return m2.containsKey(key) && m2.get(key) == value; + * return m2.containsKey(key) && m2.get(key) == value; * } * } * ) @@ -132,7 +132,7 @@ public abstract class AbstractIntDoubleMap extends AbstractMap { * m2.forEachPair( * new IntDoubleProcedure() { * public boolean apply(int key, double value) { - * return m1.containsKey(key) && m1.get(key) == value; + * return m1.containsKey(key) && m1.get(key) == value; * } * } * ); @@ -293,7 +293,7 @@ public abstract class AbstractIntDoubleMap extends AbstractMap { * smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> * * @param keyList * the list to be filled, can have any size. @@ -315,7 +315,7 @@ public abstract class AbstractIntDoubleMap extends AbstractMap { * IntDoubleProcedure condition = new IntDoubleProcedure() { // match even keys only * public boolean apply(int key, double value) { return key%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition @@ -349,7 +349,7 @@ public abstract class AbstractIntDoubleMap extends AbstractMap { * <tt>this.size()</tt>. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> * * @param keyList * the list to be filled with keys, can have any size. @@ -375,7 +375,7 @@ public abstract class AbstractIntDoubleMap extends AbstractMap { * smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> * * @param keyList * the list to be filled with keys, can have any size. diff --git a/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntIntMap.java b/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntIntMap.java index 421d904..7610d3e 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntIntMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntIntMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -15,7 +15,7 @@ import cern.colt.list.IntArrayList; /** * Abstract base class for hash maps holding (key,value) associations of type - * <tt>(int-->int)</tt>. First see the <a href="package-summary.html">package + * <tt>(int-->int)</tt>. First see the <a href="package-summary.html">package * summary</a> and javadoc <a href="package-tree.html">tree view</a> to get the * broad picture. * <p> @@ -89,7 +89,7 @@ public abstract class AbstractIntIntMap extends AbstractMap { * m1.forEachPair( * new IntIntProcedure() { * public boolean apply(int key, int value) { - * return m2.containsKey(key) && m2.get(key) == value; + * return m2.containsKey(key) && m2.get(key) == value; * } * } * ) @@ -97,7 +97,7 @@ public abstract class AbstractIntIntMap extends AbstractMap { * m2.forEachPair( * new IntIntProcedure() { * public boolean apply(int key, int value) { - * return m1.containsKey(key) && m1.get(key) == value; + * return m1.containsKey(key) && m1.get(key) == value; * } * } * ); @@ -258,7 +258,7 @@ public abstract class AbstractIntIntMap extends AbstractMap { * smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> * * @param keyList * the list to be filled, can have any size. @@ -280,7 +280,7 @@ public abstract class AbstractIntIntMap extends AbstractMap { * IntIntProcedure condition = new IntIntProcedure() { // match even keys only * public boolean apply(int key, int value) { return key%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition @@ -314,7 +314,7 @@ public abstract class AbstractIntIntMap extends AbstractMap { * <tt>this.size()</tt>. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> * * @param keyList * the list to be filled with keys, can have any size. @@ -340,7 +340,7 @@ public abstract class AbstractIntIntMap extends AbstractMap { * smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> * * @param keyList * the list to be filled with keys, can have any size. diff --git a/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntObjectMap.java b/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntObjectMap.java index 2a585c9..86b962e 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntObjectMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/AbstractIntObjectMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -91,7 +91,7 @@ public abstract class AbstractIntObjectMap<T> extends AbstractMap { * m1.forEachPair( * new IntObjectProcedure() { * public boolean apply(int key, Object value) { - * return m2.containsKey(key) && m2.get(key) == value; + * return m2.containsKey(key) && m2.get(key) == value; * } * } * ) @@ -99,7 +99,7 @@ public abstract class AbstractIntObjectMap<T> extends AbstractMap { * m2.forEachPair( * new IntObjectProcedure() { * public boolean apply(int key, Object value) { - * return m1.containsKey(key) && m1.get(key) == value; + * return m1.containsKey(key) && m1.get(key) == value; * } * } * ); @@ -260,7 +260,7 @@ public abstract class AbstractIntObjectMap<T> extends AbstractMap { * smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> * * @param keyList * the list to be filled, can have any size. @@ -282,7 +282,7 @@ public abstract class AbstractIntObjectMap<T> extends AbstractMap { * IntObjectProcedure condition = new IntObjectProcedure() { // match even keys only * public boolean apply(int key, Object value) { return key%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition @@ -316,7 +316,7 @@ public abstract class AbstractIntObjectMap<T> extends AbstractMap { * <tt>this.size()</tt>. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> * * @param keyList * the list to be filled with keys, can have any size. @@ -342,7 +342,7 @@ public abstract class AbstractIntObjectMap<T> extends AbstractMap { * values are equal, the smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> * * @param keyList * the list to be filled with keys, can have any size. diff --git a/nuiton-matrix/src/main/java/cern/colt/map/AbstractLongObjectMap.java b/nuiton-matrix/src/main/java/cern/colt/map/AbstractLongObjectMap.java index e89359c..775901c 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/AbstractLongObjectMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/AbstractLongObjectMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -260,7 +260,7 @@ public abstract class AbstractLongObjectMap<T> extends AbstractMap { * smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> * * @param keyList * the list to be filled, can have any size. @@ -282,7 +282,7 @@ public abstract class AbstractLongObjectMap<T> extends AbstractMap { * LongObjectProcedure condition = new LongObjectProcedure() { // match even keys only * public boolean apply(long key, Object value) { return key%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition @@ -316,7 +316,7 @@ public abstract class AbstractLongObjectMap<T> extends AbstractMap { * <tt>this.size()</tt>. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)</tt> * * @param keyList * the list to be filled with keys, can have any size. @@ -342,7 +342,7 @@ public abstract class AbstractLongObjectMap<T> extends AbstractMap { * values are equal, the smaller key comes first. * <p> * <b>Example:</b> <br> - * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> + * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7), valueList = (1,2,2)</tt> * * @param keyList * the list to be filled with keys, can have any size. diff --git a/nuiton-matrix/src/main/java/cern/colt/map/OpenDoubleIntHashMap.java b/nuiton-matrix/src/main/java/cern/colt/map/OpenDoubleIntHashMap.java index b2a7c5d..3446409 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/OpenDoubleIntHashMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/OpenDoubleIntHashMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -404,7 +404,7 @@ public class OpenDoubleIntHashMap extends AbstractDoubleIntMap { * DoubleIntProcedure condition = new DoubleIntProcedure() { // match even values only * public boolean apply(double key, int value) { return value%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition diff --git a/nuiton-matrix/src/main/java/cern/colt/map/OpenIntDoubleHashMap.java b/nuiton-matrix/src/main/java/cern/colt/map/OpenIntDoubleHashMap.java index 4cc231c..973925e 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/OpenIntDoubleHashMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/OpenIntDoubleHashMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -466,7 +466,7 @@ public class OpenIntDoubleHashMap extends AbstractIntDoubleMap { * IntDoubleProcedure condition = new IntDoubleProcedure() { // match even keys only * public boolean apply(int key, double value) { return key%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition diff --git a/nuiton-matrix/src/main/java/cern/colt/map/OpenIntIntHashMap.java b/nuiton-matrix/src/main/java/cern/colt/map/OpenIntIntHashMap.java index b67ad22..dd4bed3 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/OpenIntIntHashMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/OpenIntIntHashMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -15,7 +15,7 @@ import cern.colt.list.ByteArrayList; import cern.colt.list.IntArrayList; /** - * Hash map holding (key,value) associations of type <tt>(int-->int)</tt>; + * Hash map holding (key,value) associations of type <tt>(int-->int)</tt>; * Automatically grows and shrinks as needed; Implemented using open addressing * with double hashing. First see the <a href="package-summary.html">package * summary</a> and javadoc <a href="package-tree.html">tree view</a> to get the @@ -404,7 +404,7 @@ public class OpenIntIntHashMap extends AbstractIntIntMap { * IntIntProcedure condition = new IntIntProcedure() { // match even keys only * public boolean apply(int key, int value) { return key%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition diff --git a/nuiton-matrix/src/main/java/cern/colt/map/OpenIntObjectHashMap.java b/nuiton-matrix/src/main/java/cern/colt/map/OpenIntObjectHashMap.java index 084d4d9..5276def 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/OpenIntObjectHashMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/OpenIntObjectHashMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -370,7 +370,7 @@ public class OpenIntObjectHashMap<T> extends AbstractIntObjectMap<T> { * IntObjectProcedure condition = new IntObjectProcedure() { // match even keys only * public boolean apply(int key, Object value) { return key%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition diff --git a/nuiton-matrix/src/main/java/cern/colt/map/OpenLongObjectHashMap.java b/nuiton-matrix/src/main/java/cern/colt/map/OpenLongObjectHashMap.java index 848b719..8cf8820 100644 --- a/nuiton-matrix/src/main/java/cern/colt/map/OpenLongObjectHashMap.java +++ b/nuiton-matrix/src/main/java/cern/colt/map/OpenLongObjectHashMap.java @@ -4,7 +4,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ package cern.colt.map; @@ -403,7 +403,7 @@ public class OpenLongObjectHashMap<T> extends AbstractLongObjectMap<T> { * LongObjectProcedure condition = new LongObjectProcedure() { // match even keys only * public boolean apply(long key, Object value) { return key%2==0; } * } - * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> + * keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)</tt> * </pre> * * @param condition diff --git a/nuiton-matrix/src/main/java/cern/jet/math/Arithmetic.java b/nuiton-matrix/src/main/java/cern/jet/math/Arithmetic.java index f3dc305..df8880b 100644 --- a/nuiton-matrix/src/main/java/cern/jet/math/Arithmetic.java +++ b/nuiton-matrix/src/main/java/cern/jet/math/Arithmetic.java @@ -133,7 +133,7 @@ public class Arithmetic extends Constants { * "n over k" or "n choose k". The binomial coefficient is defined as * <tt>(n * n-1 * ... * n-k+1 ) / ( 1 * 2 * ... * k )</tt>. * <ul> - * <li>k<0<tt>: 0</tt>.</li> + * <li>k<0<tt>: 0</tt>.</li> * <li>k==0<tt>: 1</tt>.</li> * <li>k==1<tt>: n</tt>.</li> * <li>else: <tt>(n * n-1 * ... * n-k+1 ) / ( 1 * 2 * ... * k )</tt>.</li> @@ -163,7 +163,7 @@ public class Arithmetic extends Constants { * Efficiently returns the binomial coefficient, often also referred to as * "n over k" or "n choose k". The binomial coefficient is defined as * <ul> - * <li>k<0<tt>: 0</tt>.</li> + * <li>k<0<tt>: 0</tt>.</li> * <li>k==0 || k==n<tt>: 1</tt>.</li> * <li>k==1 || k==n-1<tt>: n</tt>.</li> * <li>else: <tt>(n * n-1 * ... * n-k+1 ) / ( 1 * 2 * ... * k )</tt>.</li> @@ -208,7 +208,9 @@ public class Arithmetic extends Constants { } /** - * Returns the smallest <code>long >= value</code>. <dt>Examples: + * Returns the smallest <code>long >= value</code>. + * + * Examples: * <code>1.0 -> 1, 1.2 -> 2, 1.9 -> 2</code>. This method is safer than * using (long) Math.ceil(value), because of possible rounding error. */ @@ -223,7 +225,7 @@ public class Arithmetic extends Constants { * <pre> * N-1 * - ' - * y = > coef[i] T (x/2) + * y = > coef[i] T (x/2) * - i * i=0 * </pre> @@ -332,9 +334,11 @@ public class Arithmetic extends Constants { } /** - * Returns the largest <code>long <= value</code>. <dt>Examples: <code> - * 1.0 -> 1, 1.2 -> 1, 1.9 -> 1 <dt> - * 2.0 -> 2, 2.2 -> 2, 2.9 -> 2 </code><dt> + * Returns the largest <code>long <= value</code>. + * + * Examples: <code> + * 1.0 -> 1, 1.2 -> 1, 1.9 -> 1 + * 2.0 -> 2, 2.2 -> 2, 2.9 -> 2 </code> * This method is safer than using (long) Math.floor(value), because of * possible rounding error. */ @@ -366,8 +370,8 @@ public class Arithmetic extends Constants { } /** - * Returns <tt>log(k!)</tt>. Tries to avoid overflows. For <tt>k<30</tt> - * simply looks up a table in O(1). For <tt>k>=30</tt> uses stirlings + * Returns <tt>log(k!)</tt>. Tries to avoid overflows. For <tt>k<30</tt> + * simply looks up a table in O(1). For <tt>k>=30</tt> uses stirlings * approximation. * * @param k @@ -394,7 +398,7 @@ public class Arithmetic extends Constants { * Instantly returns the factorial <tt>k!</tt>. * * @param k - * must hold <tt>k >= 0 && k < 21</tt>. + * must hold <tt>k >= 0 && k < 21</tt>. */ static public long longFactorial(int k) throws IllegalArgumentException { if (k < 0) @@ -413,9 +417,9 @@ public class Arithmetic extends Constants { * <p> * <tt> * log k! = (k + 1/2)log(k + 1) - (k + 1) + (1/2)log(2Pi) + - * stirlingCorrection(k + 1) + * stirlingCorrection(k + 1)</tt> * <p> - * log k! = (k + 1/2)log(k) - k + (1/2)log(2Pi) + + * <tt>log k! = (k + 1/2)log(k) - k + (1/2)log(2Pi) + * stirlingCorrection(k) * </tt> */ diff --git a/nuiton-matrix/src/main/java/cern/jet/random/Uniform.java b/nuiton-matrix/src/main/java/cern/jet/random/Uniform.java index 5dc67bd..72881ef 100644 --- a/nuiton-matrix/src/main/java/cern/jet/random/Uniform.java +++ b/nuiton-matrix/src/main/java/cern/jet/random/Uniform.java @@ -15,7 +15,7 @@ import cern.jet.random.engine.RandomEngine; * Uniform distribution; <A HREF= * "http://www.cern.ch/RD11/rkb/AN16pp/node292.html#SECTION000292000000000000000..." * > Math definition</A> and <A - * HREF="http://www.statsoft.com/textbook/glosu.html#Uniform Distribution"> + * HREF="http://www.statsoft.com/Textbook/Statistics-Glossary/U/button/u#Uniform%20Distribution"> * animated definition</A>. * <p> * Instance methods operate on a user supplied uniform random number generator; diff --git a/nuiton-matrix/src/main/java/cern/jet/random/engine/MersenneTwister.java b/nuiton-matrix/src/main/java/cern/jet/random/engine/MersenneTwister.java index 7b38f8c..8249739 100644 --- a/nuiton-matrix/src/main/java/cern/jet/random/engine/MersenneTwister.java +++ b/nuiton-matrix/src/main/java/cern/jet/random/engine/MersenneTwister.java @@ -6,7 +6,7 @@ Permission to use, copy, modify, distribute and sell this software and its docum is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. CERN makes no representations about the suitability of this software for any purpose. -It is provided "as is" without expressed or implied warranty. +It is provided "as is" without expressed or implied warranty. %%Ignore-License */ import java.util.Date; @@ -25,7 +25,7 @@ Be aware, however, that there is a non-negligible amount of overhead required to structures used by a MersenneTwister. Code like <pre> double sum = 0.0; - for (int i=0; i<100000; ++i) { + for (int i=0; i<100000; ++i) { RandomElement twister = new MersenneTwister(new java.util.Date()); sum += twister.raw(); } @@ -34,7 +34,7 @@ will be wildly inefficient. Consider using <pre> double sum = 0.0; RandomElement twister = new MersenneTwister(new java.util.Date()); - for (int i=0; i<100000; ++i) { + for (int i=0; i<100000; ++i) { sum += twister.raw(); } </pre> @@ -45,15 +45,17 @@ to be borne only once, rather than once for each iteration in the loop. "Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator", ACM Transactions on Modeling and Computer Simulation, Vol. 8, No. 1, January 1998, pp 3--30. -<dt>More info on <A HREF="http://www.math.keio.ac.jp/~matumoto/eindex.html"> Masumoto's homepage</A>. -<dt>More info on <A HREF="http://www.ncsa.uiuc.edu/Apps/CMP/RNG/www-rng.html"> Pseudo-random number generators is on the Web</A>. -<dt>Yet <A HREF="http://nhse.npac.syr.edu/random"> some more info</A>. +<dl> +<dt>More info on <A HREF="http://www.math.keio.ac.jp/~matumoto/eindex.html"> Masumoto's homepage</A>.</dt> +<dt>More info on <A HREF="http://www.ncsa.uiuc.edu/Apps/CMP/RNG/www-rng.html"> Pseudo-random number generators is on the Web</A>.</dt> +<dt>Yet <A HREF="http://nhse.npac.syr.edu/random"> some more info</A>.</dt> + </dl> <p> The correctness of this implementation has been verified against the published output sequence <a href="http://www.math.keio.ac.jp/~nisimura/random/real2/mt19937-2.out">mt19937-2.out</a> of the C-implementation <a href="http://www.math.keio.ac.jp/~nisimura/random/real2/mt19937-2.c">mt19937-2.c</a>. (Call <tt>test(1000)</tt> to print the sequence). -<dt> + Note that this implementation is <b>not synchronized</b>. <p> <b>Details:</b> MersenneTwister is designed with consideration of the flaws of various existing generators in mind. @@ -63,23 +65,23 @@ Such generators are very fast, have extremely long periods, and appear quite rob MersenneTwister produces 32-bit numbers, and every <tt>k</tt>-dimensional vector of such numbers appears the same number of times as <tt>k</tt> successive values over the period length, for each <tt>k <= 623</tt> (except for the zero vector, which appears one time less). If one looks at only the first <tt>n <= 16</tt> bits of each number, then the property holds for even larger <tt>k</tt>, as shown in the following table (taken from the publication cited above): -<div align="center"> -<table width="75%" border="1" cellspacing="0" cellpadding="0"> +<div> +<table width="75%" border="1" cellspacing="0" cellpadding="0" summary=""> <tr> - <td width="2%"> <div align="center">n</div> </td> - <td width="6%"> <div align="center">1</div> </td> - <td width="5%"> <div align="center">2</div> </td> - <td width="5%"> <div align="center">3</div> </td> - <td width="5%"> <div align="center">4</div> </td> - <td width="5%"> <div align="center">5</div> </td> - <td width="5%"> <div align="center">6</div> </td> - <td width="5%"> <div align="center">7</div> </td> - <td width="5%"> <div align="center">8</div> </td> - <td width="5%"> <div align="center">9</div> </td> - <td width="5%"> <div align="center">10</div> </td> - <td width="5%"> <div align="center">11</div> </td> - <td width="10%"> <div align="center">12 .. 16</div> </td> - <td width="10%"> <div align="center">17 .. 32</div> </td> + <td width="2%"> <div>n</div> </td> + <td width="6%"> <div>1</div> </td> + <td width="5%"> <div>2</div> </td> + <td width="5%"> <div>3</div> </td> + <td width="5%"> <div>4</div> </td> + <td width="5%"> <div>5</div> </td> + <td width="5%"> <div>6</div> </td> + <td width="5%"> <div>7</div> </td> + <td width="5%"> <div>8</div> </td> + <td width="5%"> <div>9</div> </td> + <td width="5%"> <div>10</div> </td> + <td width="5%"> <div>11</div> </td> + <td width="10%"> <div>12 .. 16</div> </td> + <td width="10%"> <div>17 .. 32</div> </td> </tr> <tr> <td width="2%"> <div align="center">k</div> </td> diff --git a/nuiton-matrix/src/main/java/org/nuiton/math/matrix/DoubleSparseArrayVector.java b/nuiton-matrix/src/main/java/org/nuiton/math/matrix/DoubleSparseArrayVector.java index 46f8c0e..8b4ad9b 100644 --- a/nuiton-matrix/src/main/java/org/nuiton/math/matrix/DoubleSparseArrayVector.java +++ b/nuiton-matrix/src/main/java/org/nuiton/math/matrix/DoubleSparseArrayVector.java @@ -237,7 +237,7 @@ public class DoubleSparseArrayVector implements SparseVector { // DoubleSparseAr * retourne la position dans le tableau position de la position lineaire * * @param pos - * @return la position ou < 0 donnant la position de l'element s'il etait + * @return la position ou < 0 donnant la position de l'element s'il etait * present */ protected int findIndex(int pos) { diff --git a/nuiton-matrix/src/main/java/org/nuiton/math/matrix/DoubleSparseHashVector.java b/nuiton-matrix/src/main/java/org/nuiton/math/matrix/DoubleSparseHashVector.java index ec75215..3843f3b 100644 --- a/nuiton-matrix/src/main/java/org/nuiton/math/matrix/DoubleSparseHashVector.java +++ b/nuiton-matrix/src/main/java/org/nuiton/math/matrix/DoubleSparseHashVector.java @@ -30,7 +30,7 @@ import java.util.Arrays; /** * Permet de stocker des données differente de la valeur par defaut (0.0) dans - * une Map<int, double>. L'implantation pcj ne supporte pas la modification + * une Map<int, double>. L'implantation pcj ne supporte pas la modification * de la valeur par defaut. * * Created: 05 septembre 2012 diff --git a/nuiton-matrix/src/main/java/org/nuiton/math/matrix/FloatVector.java b/nuiton-matrix/src/main/java/org/nuiton/math/matrix/FloatVector.java index 77846b8..53271d1 100644 --- a/nuiton-matrix/src/main/java/org/nuiton/math/matrix/FloatVector.java +++ b/nuiton-matrix/src/main/java/org/nuiton/math/matrix/FloatVector.java @@ -218,7 +218,7 @@ public class FloatVector implements Vector { // FloatVector * retourne la position dans le tableau position de la position lineaire * * @param pos - * @return la position ou < 0 donnant la position de l'element s'il etait + * @return la position ou < 0 donnant la position de l'element s'il etait * present */ protected int findIndex(int pos) { diff --git a/nuiton-matrix/src/main/java/org/nuiton/math/matrix/MatrixND.java b/nuiton-matrix/src/main/java/org/nuiton/math/matrix/MatrixND.java index c891abb..c2f793a 100644 --- a/nuiton-matrix/src/main/java/org/nuiton/math/matrix/MatrixND.java +++ b/nuiton-matrix/src/main/java/org/nuiton/math/matrix/MatrixND.java @@ -94,7 +94,7 @@ public interface MatrixND extends Serializable, Cloneable { // MatrixND * @param dim dimension to modify semantic * @param sem new semantic to set * - * @deprecated (since 1.0.3) use #setSemantic(int, List<E>) instead + * @deprecated (since 1.0.3) use #setSemantic(int, List) instead */ @Deprecated public <E> void setSemantics(int dim, List<E> sem); -- To stop receiving notification emails like this one, please contact nuiton.org SCM administrator <admin+scm@nuiton.org>.