Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
rational_approximation.h
Go to the documentation of this file.
1// Copyright 2010-2024 Google LLC
2// Licensed under the Apache License, Version 2.0 (the "License");
3// you may not use this file except in compliance with the License.
4// You may obtain a copy of the License at
5//
6// http://www.apache.org/licenses/LICENSE-2.0
7//
8// Unless required by applicable law or agreed to in writing, software
9// distributed under the License is distributed on an "AS IS" BASIS,
10// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
11// See the License for the specific language governing permissions and
12// limitations under the License.
13
14#ifndef OR_TOOLS_UTIL_RATIONAL_APPROXIMATION_H_
15#define OR_TOOLS_UTIL_RATIONAL_APPROXIMATION_H_
16
17#include <cstdint>
18#include <utility>
19
20namespace operations_research {
21
22// The type Fraction represents a number in the form of two integers: numerator
23// and denominator. This type is used to display the rational approximation
24// of a Fractional number.
25typedef std::pair<int64_t, int64_t> Fraction;
26
27// Computes a rational approximation numerator/denominator for value x
28// using a continued fraction algorithm. The absolute difference between the
29// output fraction and the input "x" will not exceed "precision".
30// TODO(user): make a parameterized template with integer and floating-point
31// type parameters.
32Fraction RationalApproximation(double x, double precision);
33
34} // namespace operations_research
35#endif // OR_TOOLS_UTIL_RATIONAL_APPROXIMATION_H_
In SWIG mode, we don't want anything besides these top-level includes.
Fraction RationalApproximation(const double x, const double precision)
std::pair< int64_t, int64_t > Fraction
const Variable x
Definition qp_tests.cc:127