-
Notifications
You must be signed in to change notification settings - Fork 6
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
19 changed files
with
547 additions
and
178 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,35 @@ | ||
#pragma once | ||
|
||
#include "fintamath/functions/IFunction.hpp" | ||
#include "fintamath/numbers/INumber.hpp" | ||
|
||
namespace fintamath { | ||
|
||
class Integer; | ||
class Rational; | ||
class Real; | ||
|
||
class Root : public IFunctionCRTP<INumber, Root, INumber, INumber> { | ||
public: | ||
Root() = default; | ||
|
||
std::string toString() const override { | ||
return "root"; | ||
} | ||
|
||
protected: | ||
std::unique_ptr<IMathObject> call(const ArgumentsRefVector &argsVect) const override; | ||
|
||
private: | ||
static std::unique_ptr<IMathObject> rootSimpl(const Integer &lhs, const Integer &rhs); | ||
|
||
static std::unique_ptr<IMathObject> rootSimpl(const Rational &lhs, const Integer &rhs); | ||
|
||
static std::unique_ptr<IMathObject> rootSimpl(const Real &lhs, const Integer &rhs); | ||
|
||
static std::map<Integer, Integer> roots(const Integer &lhs, const Integer &rhs); | ||
|
||
static std::unique_ptr<IMathObject> perfectRoot(const Integer &lhs, const Integer &rhs); | ||
}; | ||
|
||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,145 @@ | ||
#include "fintamath/functions/powers/Root.hpp" | ||
|
||
#include "fintamath/functions/arithmetic/Add.hpp" | ||
#include "fintamath/functions/arithmetic/Div.hpp" | ||
#include "fintamath/functions/arithmetic/Mul.hpp" | ||
#include "fintamath/functions/powers/Pow.hpp" | ||
#include "fintamath/numbers/Integer.hpp" | ||
#include "fintamath/numbers/IntegerFunctions.hpp" | ||
#include "fintamath/numbers/Rational.hpp" | ||
#include "fintamath/numbers/Real.hpp" | ||
#include "fintamath/numbers/RealFunctions.hpp" | ||
|
||
namespace fintamath { | ||
|
||
std::unique_ptr<IMathObject> Root::call(const ArgumentsRefVector &argsVect) const { | ||
static const auto multiRoot = [] { | ||
static MultiMethod<std::unique_ptr<IMathObject>(const INumber &, const INumber &)> outMultiRoot; | ||
|
||
outMultiRoot.add<Integer, Integer>([](const Integer &lhs, const Integer &rhs) { | ||
return rootSimpl(lhs, rhs); | ||
}); | ||
|
||
outMultiRoot.add<Rational, Integer>([](const Rational &lhs, const Integer &rhs) { | ||
return rootSimpl(lhs, rhs); | ||
}); | ||
|
||
outMultiRoot.add<Real, Integer>([](const Real &lhs, const Integer &rhs) { | ||
return rootSimpl(lhs, rhs); | ||
}); | ||
|
||
return outMultiRoot; | ||
}(); | ||
|
||
const auto &lhs = cast<INumber>(argsVect.front().get()); | ||
const auto &rhs = cast<INumber>(argsVect.back().get()); | ||
|
||
if (lhs == Integer(1)) { | ||
return lhs.clone(); | ||
} | ||
|
||
if (const auto *rhsIntPtr = cast<Integer>(&rhs)) { | ||
const auto &rhsInt = *rhsIntPtr; | ||
|
||
if (rhsInt > Integer(1)) { | ||
// TODO: cast to Complex, when it is implemented | ||
if (lhs < Integer(0)) { | ||
throw UndefinedFunctionException(toString(), {lhs.toString(), rhs.toString()}); | ||
} | ||
|
||
return multiRoot(lhs, rhsInt); | ||
} | ||
} | ||
|
||
return Pow()(lhs, *(Rational(1) / rhs)); | ||
} | ||
|
||
std::unique_ptr<IMathObject> Root::rootSimpl(const Integer &lhs, const Integer &rhs) { | ||
if (auto res = perfectRoot(lhs, rhs)) { | ||
return res; | ||
} | ||
|
||
ArgumentsPtrVector mulChildren; | ||
|
||
std::map<Integer, Integer> rootFactors = roots(lhs, rhs); | ||
auto rootFactorIter = rootFactors.begin(); | ||
|
||
if (rootFactorIter->first == 1) { | ||
if (rootFactorIter->second != 1) { | ||
mulChildren.emplace_back(rootFactorIter->second.clone()); | ||
} | ||
|
||
rootFactorIter++; | ||
} | ||
|
||
for (; rootFactorIter != rootFactors.end(); rootFactorIter++) { | ||
Integer root = rootFactorIter->first; | ||
Integer factor = rootFactorIter->second; | ||
|
||
if (factor != 1) { | ||
mulChildren.emplace_back(makeExpr(Root(), factor, root)); | ||
} | ||
} | ||
|
||
if (mulChildren.size() == 1) { | ||
return mulChildren.front()->clone(); | ||
} | ||
|
||
return makeExpr(Mul(), mulChildren); | ||
} | ||
|
||
std::map<Integer, Integer> Root::roots(const Integer &lhs, const Integer &rhs) { | ||
static Integer factorLimit = pow(Integer(2), 15); | ||
|
||
std::map<Integer, Integer> rootFactors{{1, 1}}; | ||
std::map<Integer, Integer> factorRates = factors(lhs, factorLimit); | ||
|
||
for (const auto &factorRate : factorRates) { | ||
Rational power(factorRate.second, rhs); | ||
Integer factor = factorRate.first; | ||
|
||
if (power.denominator() == 1) { | ||
rootFactors[1] *= pow(factor, power.numerator()); | ||
continue; | ||
} | ||
|
||
if (power.numerator() > power.denominator()) { | ||
rootFactors[1] *= pow(factor, power.numerator() / power.denominator()); | ||
} | ||
|
||
factor = pow(factor, power.numerator() % power.denominator()); | ||
|
||
if (auto rootIter = rootFactors.find(power.denominator()); rootIter != rootFactors.end()) { | ||
rootIter->second *= factor; | ||
} | ||
else { | ||
rootFactors.insert({power.denominator(), factor}); | ||
} | ||
} | ||
|
||
return rootFactors; | ||
} | ||
|
||
std::unique_ptr<IMathObject> Root::perfectRoot(const Integer &lhs, const Integer &rhs) { | ||
if (rhs == 2) { // TODO: implement perfect nth-roots minimization | ||
Integer remainder; | ||
Integer lhsSqrt = sqrt(lhs, remainder); | ||
|
||
if (remainder == 0) { | ||
return lhsSqrt.clone(); | ||
} | ||
} | ||
|
||
return {}; | ||
} | ||
|
||
std::unique_ptr<IMathObject> Root::rootSimpl(const Rational &lhs, const Integer &rhs) { | ||
return makeExpr(Div(), makeExpr(Root(), lhs.numerator(), rhs), makeExpr(Root(), lhs.denominator(), rhs)) | ||
->toMinimalObject(); | ||
} | ||
|
||
std::unique_ptr<IMathObject> Root::rootSimpl(const Real &lhs, const Integer &rhs) { | ||
return Pow()(lhs, 1 / Rational(rhs)); | ||
} | ||
|
||
} |
Oops, something went wrong.