diff options
| author | Andrea Gelmini <andrea.gelmini@gelma.net> | 2015-10-01 13:34:59 +0200 |
|---|---|---|
| committer | Samuel Mehrbrodt <Samuel.Mehrbrodt@cib.de> | 2015-10-01 11:37:50 +0000 |
| commit | ecf5384f754c2140bf14579d97585e634e1a14a9 (patch) | |
| tree | 97f38629ed654e9d73ee0733906e77756cbe33e9 /nlpsolver/ThirdParty/EvolutionarySolver/src/net | |
| parent | a0649f316ec53e878b5c9ffef67adb712fe9935f (diff) | |
Fix typos
Change-Id: I04d1bc3a9f38ff7871d3192563cd1f649fdc6cea
Reviewed-on: https://gerrit.libreoffice.org/18960
Reviewed-by: Samuel Mehrbrodt <Samuel.Mehrbrodt@cib.de>
Tested-by: Samuel Mehrbrodt <Samuel.Mehrbrodt@cib.de>
Diffstat (limited to 'nlpsolver/ThirdParty/EvolutionarySolver/src/net')
3 files changed, 3 insertions, 3 deletions
diff --git a/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/ACRComparator.java b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/ACRComparator.java index a21e912cf129..e529d33ba9c0 100644 --- a/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/ACRComparator.java +++ b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/ACRComparator.java @@ -3,7 +3,7 @@ * which varied adaptively according to the social information. * * Applied domain: efficiently for ridge class feasible space (SF), such as - * the problem with eqaulity constraints + * the problem with equality constraints * * Author Create/Modi Note * Xiaofeng Xie Jun 24, 2003 Created diff --git a/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/BCHComparator.java b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/BCHComparator.java index bc251b5e8031..66c25ed0b73d 100644 --- a/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/BCHComparator.java +++ b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/BCHComparator.java @@ -28,7 +28,7 @@ package net.adaptivebox.goodness; public class BCHComparator implements IGoodnessCompareEngine { -/* check the magnitude of two array, the frontial is more important +/* check the magnitude of two array, the frontal is more important **/ private static int compareArray(double[] fit1, double[] fit2) { for (int i=0; i<fit1.length; i++) { diff --git a/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/sco/SCAgent.java b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/sco/SCAgent.java index 882613d2e8c3..e922ba1d40ad 100644 --- a/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/sco/SCAgent.java +++ b/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/sco/SCAgent.java @@ -76,7 +76,7 @@ public class SCAgent { public SearchPoint generatePoint() { //generate a new point generatePoint(trailPoint); - //evalute the generated point + //evaluete the generated point problemEncoder.evaluate(trailPoint); return trailPoint; } |