/*
Modified BSD License

This file is a part of Statistical package and originates from:
http://sf.net/p/enjomitchsorbit

Copyright (c) 2014, Szymon "Enjo" Ender
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
    * Redistributions of source code must retain the above copyright
      notice, this list of conditions and the following disclaimer.
    * Redistributions in binary form must reproduce the above copyright
      notice, this list of conditions and the following disclaimer in the
      documentation and/or other materials provided with the distribution.
    * Neither the name of the <organization> nor the
      names of its contributors may be used to endorse or promote products
      derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

#include "BoundSearch.hpp"
//#include "GeneralMath.hpp"
#include <cmath>


using namespace EnjoLib;

BoundSearch::BoundSearch()
{
}

BoundSearch::~BoundSearch()
{
}

Result<double> BoundSearch::FindUpper(BinSearchOptiSubject & subj, double start, double minIncrement, double maxIncrement)
{
    return Find(subj, start, true, minIncrement, maxIncrement);
}
Result<double> BoundSearch::FindLower(BinSearchOptiSubject & subj, double start, double minIncrement, double maxIncrement)
{
    return Find(subj, start, false, minIncrement, maxIncrement);
}

Result<double> BoundSearch::Find(BinSearchOptiSubject & subj, double start, bool upper, double minIncrement, double maxIncrement)
{
    // Input data preprocessing - determine search direction and adjust increments
    int sign = upper ? 1 : -1;
    minIncrement = sign * fabs(minIncrement);
    maxIncrement = sign * fabs(maxIncrement);
    // Initial conditions
    double testArg = start;
    double value = subj.UpdateGetValue(testArg);
    double valuePrev;
    double incr = minIncrement;
    bool incrExceeded = false;
    do
    {
        if (incrExceeded == false)
        {
            incr = incr * 2;
            if (maxIncrement != 0 && fabs(incr) > fabs(maxIncrement))
            {
                incrExceeded = true;
                incr = maxIncrement; // Don't increase the increment anymore
            }
        }
        testArg += incr;
        valuePrev = value; // Store previous value before updating it
        value = subj.UpdateGetValue(testArg); // Test new argument

    } while(value < valuePrev);

    return Result<double>(testArg, true);
}
