-
Notifications
You must be signed in to change notification settings - Fork 2
/
solve.h
88 lines (69 loc) · 2.2 KB
/
solve.h
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
81
82
83
84
85
86
87
88
/**
*
* Copyright (c) 2010-2015 Voidware Ltd. All Rights Reserved.
*
* This file contains Original Code and/or Modifications of Original Code as
* defined in and that are subject to the Voidware Public Source Licence version
* 1.0 (the 'Licence'). You may not use this file except in compliance with the
* Licence or with expressly written permission from Voidware. Please obtain a
* copy of the Licence at http://www.voidware.com/legal/vpsl1.txt and read it
* before using this file.
*
* The Original Code and all software distributed under the Licence are
* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS
* OR IMPLIED, AND VOIDWARE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING
* WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
* PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
*
* Please see the Licence for the specific language governing rights and
* limitations under the Licence.
*
*/
#ifndef __solve_h__
#define __solve_h__
#include "types.h"
#include "eeval.h"
// external interface
extern bool SolveN(TermRef& res, Term* t, const BCD& xmin, const BCD& xmax);
struct Solver: public ExprEvaluator
{
Solver()
{
// default
_eps = BCD::epsilon(18);
}
void setMinMax(const BCD& xmin, const BCD& xmax)
{
if (xmin <= xmax)
{
_x0 = xmin;
_x1 = xmax;
}
else
{
_x1 = xmin;
_x0 = xmax;
}
}
const BCD& root() const { return _root; }
void eps(const BCD& e) { _eps = e; }
bool ridderSolve() { return _searchOut() && _ridderRoot(); }
bool ridderSolveOnly();
bool _ridderRoot();
bool _searchOut();
BCD _eval(const BCD& x)
{
BCD v;
return eval(x, v) ? v : 0;
}
static bool derivAdapter(const BCD& x, BCD& val, ExprEvaluator& eeval);
protected:
BCD _x0;
BCD _x1;
BCD _root;
BCD _eps;
BCD _f0;
BCD _f1;
};
#endif // __solve_h__