6f4fca7efb
* Replace int by size_t in for loops. * Various dtor missing and some other warning fixes. * fixed size_t vs int * fixed size_t vs int --------- Co-authored-by: Paddle <PaddleStroke@users.noreply.github.com> Co-authored-by: Aik-Siong Koh <askoh@askoh.com>
40 lines
1.2 KiB
C++
40 lines
1.2 KiB
C++
/***************************************************************************
|
|
* Copyright (c) 2023 Ondsel, Inc. *
|
|
* *
|
|
* This file is part of OndselSolver. *
|
|
* *
|
|
* See LICENSE file for details about copyright. *
|
|
***************************************************************************/
|
|
|
|
#pragma once
|
|
#include <vector>
|
|
|
|
#include "MbDMath.h"
|
|
|
|
namespace MbD {
|
|
class Numeric : public MbDMath
|
|
{
|
|
//
|
|
public:
|
|
static double arcTan0to2piYoverX(double y, double x);
|
|
static bool equaltol(double x, double xx, double tol);
|
|
template <typename T>
|
|
static bool isIncreasingVector(std::vector<T>* vec);
|
|
|
|
};
|
|
template<typename T>
|
|
inline bool Numeric::isIncreasingVector(std::vector<T>* vec)
|
|
{
|
|
T previous, next;
|
|
next = vec->at(0);
|
|
for (std::size_t i = 1; i < vec->size(); i++)
|
|
{
|
|
previous = next;
|
|
next = vec->at(i);
|
|
if (previous > next) return false;
|
|
}
|
|
return true;
|
|
}
|
|
}
|
|
|