You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by lu...@apache.org on 2015/09/10 15:09:46 UTC

[math] Clarified comments.

Repository: commons-math
Updated Branches:
  refs/heads/master 9ee68c2ff -> 9856f285e


Clarified comments.

Project: http://git-wip-us.apache.org/repos/asf/commons-math/repo
Commit: http://git-wip-us.apache.org/repos/asf/commons-math/commit/9856f285
Tree: http://git-wip-us.apache.org/repos/asf/commons-math/tree/9856f285
Diff: http://git-wip-us.apache.org/repos/asf/commons-math/diff/9856f285

Branch: refs/heads/master
Commit: 9856f285e40dabe5fa94fc442dc0e2515a49f4e5
Parents: 9ee68c2
Author: Luc Maisonobe <lu...@apache.org>
Authored: Thu Sep 10 15:09:20 2015 +0200
Committer: Luc Maisonobe <lu...@apache.org>
Committed: Thu Sep 10 15:09:20 2015 +0200

----------------------------------------------------------------------
 .../commons/math4/ode/events/EventFilter.java   | 24 ++++++++++----------
 1 file changed, 12 insertions(+), 12 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/commons-math/blob/9856f285/src/main/java/org/apache/commons/math4/ode/events/EventFilter.java
----------------------------------------------------------------------
diff --git a/src/main/java/org/apache/commons/math4/ode/events/EventFilter.java b/src/main/java/org/apache/commons/math4/ode/events/EventFilter.java
index c1aa39f..7becb89 100644
--- a/src/main/java/org/apache/commons/math4/ode/events/EventFilter.java
+++ b/src/main/java/org/apache/commons/math4/ode/events/EventFilter.java
@@ -117,12 +117,12 @@ public class EventFilter implements EventHandler {
                 final Transformer previous = transformers[last];
                 final Transformer next     = filter.selectTransformer(previous, rawG, forward);
                 if (next != previous) {
-                    // there is a root somewhere between extremeT end t
-                    // the new transformer, which is valid on both sides of the root,
-                    // so it is valid for t (this is how we have just computed it above),
-                    // but it was already valid before, so we store the switch at extremeT
-                    // for safety, to ensure the previous transformer is not applied too
-                    // close of the root
+                    // there is a root somewhere between extremeT and t.
+                    // the new transformer is valid for t (this is how we have just computed
+                    // it above), but it is in fact valid on both sides of the root, so
+                    // it was already valid before t and even up to previous time. We store
+                    // the switch at extremeT for safety, to ensure the previous transformer
+                    // is not applied too close of the root
                     System.arraycopy(updates,      1, updates,      0, last);
                     System.arraycopy(transformers, 1, transformers, 0, last);
                     updates[last]      = extremeT;
@@ -156,12 +156,12 @@ public class EventFilter implements EventHandler {
                 final Transformer previous = transformers[0];
                 final Transformer next     = filter.selectTransformer(previous, rawG, forward);
                 if (next != previous) {
-                    // there is a root somewhere between extremeT end t
-                    // the new transformer, which is valid on both sides of the root,
-                    // so it is valid for t (this is how we have just computed it above),
-                    // but it was already valid before, so we store the switch at extremeT
-                    // for safety, to ensure the previous transformer is not applied too
-                    // close of the root
+                    // there is a root somewhere between extremeT and t.
+                    // the new transformer is valid for t (this is how we have just computed
+                    // it above), but it is in fact valid on both sides of the root, so
+                    // it was already valid before t and even up to previous time. We store
+                    // the switch at extremeT for safety, to ensure the previous transformer
+                    // is not applied too close of the root
                     System.arraycopy(updates,      0, updates,      1, updates.length - 1);
                     System.arraycopy(transformers, 0, transformers, 1, transformers.length - 1);
                     updates[0]      = extremeT;