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 7f9b85dbe43937d887bf2b0b050e35a09cfb98f6 Author: CHRE <CHATELLIER@codelutin.com> Date: Tue Aug 9 17:49:10 2016 +0200 Fix javadoc --- .../src/main/java/cern/colt/GenericSorting.java | 6 +++-- .../main/java/cern/colt/list/AbstractByteList.java | 4 +-- .../java/cern/colt/list/AbstractCollection.java | 4 +-- .../java/cern/colt/list/AbstractDoubleList.java | 28 ++++++++++---------- .../java/cern/colt/list/AbstractFloatList.java | 30 +++++++++++----------- .../main/java/cern/colt/list/AbstractIntList.java | 30 +++++++++++----------- .../src/main/java/cern/colt/list/AbstractList.java | 14 +++++----- .../cern/jet/random/engine/MersenneTwister.java | 28 ++++++++++---------- .../main/java/org/nuiton/math/matrix/MatrixND.java | 2 +- 9 files changed, 74 insertions(+), 72 deletions(-) diff --git a/nuiton-matrix/src/main/java/cern/colt/GenericSorting.java b/nuiton-matrix/src/main/java/cern/colt/GenericSorting.java index f97500b..fdc54dc 100644 --- a/nuiton-matrix/src/main/java/cern/colt/GenericSorting.java +++ b/nuiton-matrix/src/main/java/cern/colt/GenericSorting.java @@ -20,7 +20,7 @@ import cern.colt.function.IntComparator; * <li><i>Sorting by multiple sorting criteria</i> (primary, secondary, * tertiary, ...) * </ul> - * <h4>Sorting multiple arrays in sync</h4> + * <b>Sorting multiple arrays in sync</b> * <p> * Assume we have three arrays X, Y and Z. We want to sort all three arrays by X * (or some arbitrary comparison function). For example, we have<br> @@ -63,7 +63,8 @@ import cern.colt.function.IntComparator; * data of these indexes. * <p> * The following snippet shows how to solve the problem. - * <table> + * <table summary=""> + * <tr> * <td class="PRE"> * * <pre> @@ -113,6 +114,7 @@ import cern.colt.function.IntComparator; * </pre> * * </td> + * </tr> * </table> * <h4>Sorting by multiple sorting criterias (primary, secondary, tertiary, ...) * </h4> 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 ded6fab..b47781b 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractByteList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractByteList.java @@ -123,7 +123,7 @@ public abstract class AbstractByteList extends AbstractList { * Inserts <tt>length</tt> dummy elements before the specified position into * the receiver. Shifts the element currently at that position (if any) and * any subsequent elements to the right. <b>This method must set the new - * size to be <tt>size()+length</tt>. + * size to be <tt>size()+length</tt></b>. * * @param index * index before which to insert dummy elements (must be in @@ -987,7 +987,7 @@ public abstract class AbstractByteList extends AbstractList { /** * Returns the number of elements contained in the receiver. * - * @returns the number of elements contained in the receiver. + * @return the number of elements contained in the receiver. */ public int size() { return size; diff --git a/nuiton-matrix/src/main/java/cern/colt/list/AbstractCollection.java b/nuiton-matrix/src/main/java/cern/colt/list/AbstractCollection.java index 6142771..2caa676 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractCollection.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractCollection.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; @@ -57,7 +57,7 @@ public abstract class AbstractCollection extends cern.colt.PersistentObject { /** * Returns the number of elements contained in the receiver. * - * @returns the number of elements contained in the receiver. + * @return the number of elements contained in the receiver. */ public abstract int size(); 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 7bdbf2a..b63c353 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractDoubleList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractDoubleList.java @@ -75,7 +75,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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(AbstractDoubleList other, int from, int to) { @@ -118,7 +118,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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 ( @@ -388,7 +388,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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 @@ -429,7 +429,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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(double element, int from, int to) { @@ -471,7 +471,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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(double element, int from, int to) { @@ -505,7 +505,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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) { @@ -552,7 +552,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * @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, DoubleComparator c) { @@ -576,7 +576,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * @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 AbstractDoubleList partFromTo(int from, int to) { @@ -609,7 +609,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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) { @@ -656,7 +656,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * @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, DoubleComparator c) { @@ -706,7 +706,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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) { @@ -942,7 +942,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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 @@ -982,7 +982,7 @@ public abstract class AbstractDoubleList extends AbstractList implements * 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) { @@ -1003,7 +1003,7 @@ public abstract class AbstractDoubleList extends AbstractList implements /** * Returns the number of elements contained in the receiver. * - * @returns the number of elements contained in the receiver. + * @return the number of elements contained in the receiver. */ public int size() { return size; 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 543646d..faa3875 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractFloatList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractFloatList.java @@ -63,7 +63,7 @@ public abstract class AbstractFloatList 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(AbstractFloatList other, int from, int to) { @@ -106,7 +106,7 @@ public abstract class AbstractFloatList 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 ( @@ -123,7 +123,7 @@ public abstract class AbstractFloatList extends AbstractList { * Inserts <tt>length</tt> dummy elements before the specified position into * the receiver. Shifts the element currently at that position (if any) and * any subsequent elements to the right. <b>This method must set the new - * size to be <tt>size()+length</tt>. + * size to be <tt>size()+length</tt></b>. * * @param index * index before which to insert dummy elements (must be in @@ -376,7 +376,7 @@ public abstract class AbstractFloatList 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 @@ -417,7 +417,7 @@ public abstract class AbstractFloatList 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(float element, int from, int to) { @@ -459,7 +459,7 @@ public abstract class AbstractFloatList 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(float element, int from, int to) { @@ -493,7 +493,7 @@ public abstract class AbstractFloatList 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) { @@ -540,7 +540,7 @@ public abstract class AbstractFloatList 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, FloatComparator c) { @@ -564,7 +564,7 @@ public abstract class AbstractFloatList 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 AbstractFloatList partFromTo(int from, int to) { @@ -597,7 +597,7 @@ public abstract class AbstractFloatList 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) { @@ -641,7 +641,7 @@ public abstract class AbstractFloatList 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, FloatComparator c) { @@ -691,7 +691,7 @@ public abstract class AbstractFloatList 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) { @@ -927,7 +927,7 @@ public abstract class AbstractFloatList 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 @@ -967,7 +967,7 @@ public abstract class AbstractFloatList 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) { @@ -988,7 +988,7 @@ public abstract class AbstractFloatList extends AbstractList { /** * Returns the number of elements contained in the receiver. * - * @returns the number of elements contained in the receiver. + * @return the number of elements contained in the receiver. */ public int size() { return size; 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 1c0b6ca..1e167ce 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractIntList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractIntList.java @@ -74,7 +74,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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(AbstractIntList other, int from, int to) { @@ -117,7 +117,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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 ( @@ -134,7 +134,7 @@ public abstract class AbstractIntList extends AbstractList implements * Inserts <tt>length</tt> dummy elements before the specified position into * the receiver. Shifts the element currently at that position (if any) and * any subsequent elements to the right. <b>This method must set the new - * size to be <tt>size()+length</tt>. + * size to be <tt>size()+length</tt></b>. * * @param index * index before which to insert dummy elements (must be in @@ -387,7 +387,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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 @@ -428,7 +428,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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(int element, int from, int to) { @@ -470,7 +470,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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(int element, int from, int to) { @@ -504,7 +504,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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) { @@ -551,7 +551,7 @@ public abstract class AbstractIntList extends AbstractList implements * @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, IntComparator c) { @@ -575,7 +575,7 @@ public abstract class AbstractIntList extends AbstractList implements * @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 AbstractIntList partFromTo(int from, int to) { @@ -608,7 +608,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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) { @@ -654,7 +654,7 @@ public abstract class AbstractIntList extends AbstractList implements * @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, IntComparator c) { @@ -704,7 +704,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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) { @@ -940,7 +940,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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 @@ -980,7 +980,7 @@ public abstract class AbstractIntList extends AbstractList implements * 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) { @@ -1001,7 +1001,7 @@ public abstract class AbstractIntList extends AbstractList implements /** * Returns the number of elements contained in the receiver. * - * @returns the number of elements contained in the receiver. + * @return the number of elements contained in the receiver. */ public int size() { return size; diff --git a/nuiton-matrix/src/main/java/cern/colt/list/AbstractList.java b/nuiton-matrix/src/main/java/cern/colt/list/AbstractList.java index d37a775..3257d07 100644 --- a/nuiton-matrix/src/main/java/cern/colt/list/AbstractList.java +++ b/nuiton-matrix/src/main/java/cern/colt/list/AbstractList.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; @@ -73,7 +73,7 @@ public abstract class AbstractList extends AbstractCollection { * Inserts <tt>length</tt> dummy elements before the specified position into * the receiver. Shifts the element currently at that position (if any) and * any subsequent elements to the right. <b>This method must set the new - * size to be <tt>size()+length</tt>. + * size to be <tt>size()+length</tt></b>. * * @param index * index before which to insert dummy elements (must be in @@ -164,7 +164,7 @@ public abstract class AbstractList extends AbstractCollection { * the index of the last element (inclusive) to be sorted. * @throws IndexOutOfBoundsException * if - * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> + * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> * . */ public abstract void mergeSortFromTo(int from, int to); @@ -209,7 +209,7 @@ public abstract class AbstractList extends AbstractCollection { * the index of the last element (inclusive) to be sorted. * @throws IndexOutOfBoundsException * if - * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> + * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> * . */ public abstract void quickSortFromTo(int from, int to); @@ -239,7 +239,7 @@ public abstract class AbstractList extends AbstractCollection { * index of last element to be removed. * @throws IndexOutOfBoundsException * if - * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> + * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> * . */ public abstract void removeFromTo(int fromIndex, int toIndex); @@ -310,7 +310,7 @@ public abstract class AbstractList extends AbstractCollection { * the end position (inclusive) * @throws IndexOutOfBoundsException * if - * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> + * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> * . */ public abstract void shuffleFromTo(int from, int to); @@ -343,7 +343,7 @@ public abstract class AbstractList extends AbstractCollection { * the index of the last element (inclusive) to be sorted. * @throws IndexOutOfBoundsException * if - * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> + * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> * . */ public void sortFromTo(int from, int to) { 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 8249739..c233106 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 @@ -84,20 +84,20 @@ If one looks at only the first <tt>n <= 16</tt> bits of each number, then the <td width="10%"> <div>17 .. 32</div> </td> </tr> <tr> - <td width="2%"> <div align="center">k</div> </td> - <td width="6%"> <div align="center">19937</div> </td> - <td width="5%"> <div align="center">9968</div> </td> - <td width="5%"> <div align="center">6240</div> </td> - <td width="5%"> <div align="center">4984</div> </td> - <td width="5%"> <div align="center">3738</div> </td> - <td width="5%"> <div align="center">3115</div> </td> - <td width="5%"> <div align="center">2493</div> </td> - <td width="5%"> <div align="center">2492</div> </td> - <td width="5%"> <div align="center">1869</div> </td> - <td width="5%"> <div align="center">1869</div> </td> - <td width="5%"> <div align="center">1248</div> </td> - <td width="10%"> <div align="center">1246</div> </td> - <td width="10%"> <div align="center">623</div> </td> + <td width="2%"> <div>k</div> </td> + <td width="6%"> <div>19937</div> </td> + <td width="5%"> <div>9968</div> </td> + <td width="5%"> <div>6240</div> </td> + <td width="5%"> <div>4984</div> </td> + <td width="5%"> <div>3738</div> </td> + <td width="5%"> <div>3115</div> </td> + <td width="5%"> <div>2493</div> </td> + <td width="5%"> <div>2492</div> </td> + <td width="5%"> <div>1869</div> </td> + <td width="5%"> <div>1869</div> </td> + <td width="5%"> <div>1248</div> </td> + <td width="10%"> <div>1246</div> </td> + <td width="10%"> <div>623</div> </td> </tr> </table> </div> 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 c2f793a..cc3ce38 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 @@ -713,7 +713,7 @@ public interface MatrixND extends Serializable, Cloneable { // MatrixND * * @param dim la dimension dans lequel on veut une sous matrice * @param start la position dans dim d'ou il faut partir pour prendre la - * sous matrice. 0 <= start < dim.size si start est négatif alors + * sous matrice. 0 <= start < dim.size si start est négatif alors * la position de départ est calculé par rapport à la fin de la * dimension, pour avoir le dernier élément il faut passer -1 * @param nb le nombre d'élément à prendre dans la dimension si nb est -- To stop receiving notification emails like this one, please contact nuiton.org SCM administrator <admin+scm@nuiton.org>.