Author: erans
Date: Fri Jun 24 12:29:09 2011
New Revision: 1139270
URL: http://svn.apache.org/viewvc?rev=1139270&view=rev
Log:
Javadoc (real) fix.
Modified:
commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/solvers/AllowedSolutions.java
Modified:
commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/solvers/AllowedSolutions.java
URL:
http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/solvers/AllowedSolutions.java?rev=1139270&r1=1139269&r2=1139270&view=diff
==============================================================================
---
commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/solvers/AllowedSolutions.java
(original)
+++
commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/solvers/AllowedSolutions.java
Fri Jun 24 12:29:09 2011
@@ -28,8 +28,8 @@ package org.apache.commons.math.analysis
* or slightly larger than the actual root. Root-finding algorithms generally
* only guarantee that the returned solution is within the requested
* tolerances. In certain cases however, in particular for
- * {@link org.apache.commons.math.ode.eventsEventHandler state events} of
- * {@link org.apache.commons.math.odeODEIntegrator ODE solvers}, it
+ * {@link org.apache.commons.math.ode.events.EventHandler state events} of
+ * {@link org.apache.commons.math.ode.ODEIntegrator ODE solvers}, it
* may be necessary to guarantee that a solution is returned that does not
* under-approximate the solution.</p>
*
