File size: 2,602 Bytes
b1b3bae |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 |
/// ------------------------------------------------------
/// SwarmOps - Numeric and heuristic optimization for C#
/// Copyright (C) 2003-2011 Magnus Erik Hvass Pedersen.
/// Please see the file license.txt for license details.
/// SwarmOps on the internet: http://www.Hvass-Labs.org/
/// ------------------------------------------------------
using System.Diagnostics;
namespace SwarmOps
{
public static partial class Tools
{
/// <summary>
/// Bound a value between lower and upper boundaries.
/// </summary>
/// <param name="x">Parameter to be bounded.</param>
/// <param name="lower">Lower boundary.</param>
/// <param name="upper">Upper boundary.</param>
/// <returns>Bounded value.</returns>
public static double Bound(double x, double lower, double upper)
{
Debug.Assert(upper >= lower);
double y;
if (x < lower)
{
y = lower;
}
else if (x > upper)
{
y = upper;
}
else
{
y = x;
}
return y;
}
/// <summary>
/// Bound array of values between lower and upper boundaries.
/// </summary>
/// <param name="x">Array of values to be bounded.</param>
/// <param name="lower">Lower boundaries.</param>
/// <param name="upper">Upper boundaries.</param>
public static void Bound(ref double[] x, double[] lower, double[] upper)
{
Debug.Assert(x.Length == lower.Length && x.Length == upper.Length);
for (int i = 0; i < x.Length; i++)
{
x[i] = Bound(x[i], lower[i], upper[i]);
}
}
/// <summary>
/// Return whether array of values is between lower and upper boundaries.
/// </summary>
/// <param name="x">Array of values to be bounded.</param>
/// <param name="lower">Lower boundaries.</param>
/// <param name="upper">Upper boundaries.</param>
public static bool BetweenBounds(double[] x, double[] lower, double[] upper)
{
Debug.Assert(x.Length == lower.Length && x.Length == upper.Length);
bool retVal = true;
for (int i = 0; retVal && i < x.Length; i++)
{
retVal = retVal && x[i] >= lower[i] && x[i] <= upper[i];
}
return retVal;
}
}
}
|