Skip to content
Permalink
Branch: master
Find file Copy path
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
157 lines (134 sloc) 4.87 KB
/*
Copyright (C) 2001 - 2013 Evan Teran
evan.teran@gmail.com
Copyright (C) 1996 - 2000 Bernd Johannes Wuebben
wuebben@kde.org
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of
the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef KCALC_CORE_H_
#define KCALC_CORE_H_
#include <QStack>
#include "stats.h"
#include "knumber.h"
class CalcEngine {
public:
// operations that can be stored in calculation stack
enum Operation {
FUNC_EQUAL,
FUNC_PERCENT,
FUNC_BRACKET,
FUNC_OR,
FUNC_XOR,
FUNC_AND,
FUNC_LSH,
FUNC_RSH,
FUNC_ADD,
FUNC_SUBTRACT,
FUNC_MULTIPLY,
FUNC_DIVIDE,
FUNC_MOD,
FUNC_INTDIV,
FUNC_BINOM,
FUNC_POWER,
FUNC_PWR_ROOT
};
CalcEngine();
KNumber lastOutput(bool &error) const;
void enterOperation(const KNumber &num, Operation func);
void ArcCosDeg(const KNumber &input);
void ArcCosRad(const KNumber &input);
void ArcCosGrad(const KNumber &input);
void ArcSinDeg(const KNumber &input);
void ArcSinRad(const KNumber &input);
void ArcSinGrad(const KNumber &input);
void ArcTangensDeg(const KNumber &input);
void ArcTangensRad(const KNumber &input);
void ArcTangensGrad(const KNumber &input);
void AreaCosHyp(const KNumber &input);
void AreaSinHyp(const KNumber &input);
void AreaTangensHyp(const KNumber &input);
void Complement(const KNumber &input);
void CosDeg(const KNumber &input);
void CosRad(const KNumber &input);
void CosGrad(const KNumber &input);
void CosHyp(const KNumber &input);
void Cube(const KNumber &input);
void CubeRoot(const KNumber &input);
void Exp(const KNumber &input);
void Exp10(const KNumber &input);
void Factorial(const KNumber &input);
void Gamma(const KNumber &input);
void InvertSign(const KNumber &input);
void Ln(const KNumber &input);
void Log10(const KNumber &input);
void ParenClose(KNumber input);
void ParenOpen(const KNumber &input);
void Reciprocal(const KNumber &input);
void SinDeg(const KNumber &input);
void SinGrad(const KNumber &input);
void SinRad(const KNumber &input);
void SinHyp(const KNumber &input);
void Square(const KNumber &input);
void SquareRoot(const KNumber &input);
void StatClearAll(const KNumber &input);
void StatCount(const KNumber &input);
void StatDataNew(const KNumber &input);
void StatDataDel(const KNumber &input);
void StatMean(const KNumber &input);
void StatMedian(const KNumber &input);
void StatStdDeviation(const KNumber &input);
void StatStdSample(const KNumber &input);
void StatSum(const KNumber &input);
void StatSumSquares(const KNumber &input);
void TangensDeg(const KNumber &input);
void TangensRad(const KNumber &input);
void TangensGrad(const KNumber &input);
void TangensHyp(const KNumber &input);
void Reset();
void setOnlyUpdateOperation(bool update);
bool getOnlyUpdateOperation() const;
private:
KStats stats;
struct Node {
KNumber number;
Operation operation;
};
// Stack holds all operations and numbers that have not yet been
// processed, e.g. user types "2+3*", the calculation can not be
// executed, because "*" has a higher precedence than "+", so we
// need to wait for the next number.
//
// In the stack this would be stored as ((2,+),(3,*),...)
//
// "enterOperation": If the introduced Operation has lower priority
// than the preceding operations in the stack, then we can start to
// evaluate the stack (with "evalStack"). Otherwise we append the new
// Operation and number to the stack.
//
// E.g. "2*3+" evaluates to "6+", but "2+3*" can not be evaluated
// yet.
//
// We also take care of brackets, by writing a marker "FUNC_BRACKET"
// into the stack, each time the user opens one. When a bracket is
// closed, everything in the stack is evaluated until the first
// marker "FUNC_BRACKET" found.
QStack<Node> stack_;
KNumber last_number_;
Operation last_operation_;
KNumber last_repeat_number_;
bool only_update_operation_;
bool percent_mode_;
bool repeat_mode_;
bool evalStack();
KNumber evalOperation(const KNumber &arg1, Operation operation, const KNumber &arg2);
};
#endif
You can’t perform that action at this time.