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

Clarified comments.

This commit is contained in:
Luc Maisonobe 2015-09-10 15:12:38 +02:00
parent f6b8dabda1
commit bfc2d49021
1 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
src/main/java/org/apache/commons/math3/ode/events/EventFilter.java
View File

@ -115,12 +115,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;
@ -154,12 +154,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;