Files
solver/GNN/OndselSolver/Numeric.h
forbes-0023 98051ba0c9 feat: add Phase 1 constraint solver addon, move prior content to GNN/
- Move existing OndselSolver, GNN ML layer, and tooling into GNN/
  directory for integration in later phases
- Add Create addon scaffold: package.xml, Init.py
- Add expression DAG with eval, symbolic diff, simplification
- Add parameter table with fixed/free variable tracking
- Add quaternion rotation as polynomial Expr trees
- Add RigidBody entity (7 DOF: position + unit quaternion)
- Add constraint classes: Coincident, DistancePointPoint, Fixed
- Add Newton-Raphson solver with symbolic Jacobian + numpy lstsq
- Add pre-solve passes: substitution + single-equation
- Add DOF counting via Jacobian SVD rank
- Add KindredSolver IKCSolver bridge for kcsolve integration
- Add 82 unit tests covering all modules

Registers as 'kindred' solver via kcsolve.register_solver() when
loaded by Create's addon_loader.
2026-02-20 20:35:47 -06:00

48 lines
1.5 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 <cstddef>
#include <limits>
// For Windows platforms only, cstddef includes size_t but not ssize_t
#if defined(WIN32) || defined(_WIN32) || defined(__WIN32__) || defined(__NT__)
#include <BaseTsd.h>
typedef SSIZE_T ssize_t;
#endif
#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 (size_t i = 1; i < vec->size(); i++)
{
previous = next;
next = vec->at(i);
if (previous > next) return false;
}
return true;
}
}