caiyu/LibreVNA
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
71699d1bd7
LibreVNA/Software/PC_Application/Traces/Math/parser/mpOprtNonCmplx.cpp
Jan Käberich 9614c9d850 Custom math expressions + bugfix harmonic mixing
2020-12-18 18:52:38 +01:00

424 lines
13 KiB
C++
Raw Blame History

/*
__________ ____ ___
_____ __ _\______ \_____ _______ ______ __________\ \/ /
/ \| | \ ___/\__ \\_ __ \/ ___// __ \_ __ \ /
| Y Y \ | / | / __ \| | \/\___ \\ ___/| | \/ \
|__|_| /____/|____| (____ /__| /____ >\___ >__| /___/\ \
\/ \/ \/ \/ \_/
Copyright (C) 2016 Ingo Berg
All rights reserved.
muParserX - A C++ math parser library with array and string support
Copyright (c) 2016, Ingo Berg
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#include "mpOprtNonCmplx.h"
MUP_NAMESPACE_START
//------------------------------------------------------------------------------
//
// Sign operator
//
//------------------------------------------------------------------------------
OprtSign::OprtSign()
:IOprtInfix( _T("-"), prINFIX)
{}
//------------------------------------------------------------------------------
void OprtSign::Eval(ptr_val_type &ret, const ptr_val_type *a_pArg, int a_iArgc)
{
MUP_VERIFY(a_iArgc == 1);
if (a_pArg[0]->IsScalar())
{
*ret = -a_pArg[0]->GetFloat();
}
else if (a_pArg[0]->GetType()=='m')
{
Value v(a_pArg[0]->GetRows(), 0);
for (int i=0; i<a_pArg[0]->GetRows(); ++i)
{
v.At(i) = -a_pArg[0]->At(i).GetFloat();
}
*ret = v;
}
else
{
ErrorContext err;
err.Errc = ecINVALID_TYPE;
err.Type1 = a_pArg[0]->GetType();
err.Type2 = 's';
throw ParserError(err);
}
}
//------------------------------------------------------------------------------
const char_type* OprtSign::GetDesc() const
{
return _T("-x - negative sign operator");
}
//------------------------------------------------------------------------------
IToken* OprtSign::Clone() const
{
return new OprtSign(*this);
}
//------------------------------------------------------------------------------
//
// Sign operator
//
//------------------------------------------------------------------------------
OprtSignPos::OprtSignPos()
:IOprtInfix( _T("+"), prINFIX)
{}
//------------------------------------------------------------------------------
void OprtSignPos::Eval(ptr_val_type &ret, const ptr_val_type *a_pArg, int a_iArgc)
{
MUP_VERIFY(a_iArgc == 1);
if (a_pArg[0]->IsScalar())
{
*ret = a_pArg[0]->GetFloat();
}
else if (a_pArg[0]->GetType()=='m')
{
Value v(a_pArg[0]->GetRows(), 0);
for (int i=0; i<a_pArg[0]->GetRows(); ++i)
{
v.At(i) = a_pArg[0]->At(i).GetFloat();
}
*ret = v;
}
else
{
ErrorContext err;
err.Errc = ecINVALID_TYPE;
err.Type1 = a_pArg[0]->GetType();
err.Type2 = 's';
throw ParserError(err);
}
}
//------------------------------------------------------------------------------
const char_type* OprtSignPos::GetDesc() const
{
return _T("+x - positive sign operator");
}
//------------------------------------------------------------------------------
IToken* OprtSignPos::Clone() const
{
return new OprtSignPos(*this);
}
//-----------------------------------------------------------
//
// class OprtAdd
//
//-----------------------------------------------------------
OprtAdd::OprtAdd()
:IOprtBin(_T("+"), (int)prADD_SUB, oaLEFT)
{}
//-----------------------------------------------------------
void OprtAdd::Eval(ptr_val_type& ret, const ptr_val_type *a_pArg, int num)
{
assert(num==2);
const IValue *arg1 = a_pArg[0].Get();
const IValue *arg2 = a_pArg[1].Get();
if (arg1->GetType()=='m' && arg2->GetType()=='m')
{
// Vector + Vector
const matrix_type &a1 = arg1->GetArray(),
&a2 = arg2->GetArray();
if (a1.GetRows()!=a2.GetRows())
throw ParserError(ErrorContext(ecARRAY_SIZE_MISMATCH, -1, GetIdent(), 'm', 'm', 2));
matrix_type rv(a1.GetRows());
for (int i=0; i<a1.GetRows(); ++i)
{
if (!a1.At(i).IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), a1.At(i).GetType(), 'f', 1));
if (!a2.At(i).IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), a2.At(i).GetType(), 'f', 1));
rv.At(i) = a1.At(i).GetFloat() + a2.At(i).GetFloat();
}
*ret = rv;
}
else
{
if (!arg1->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), arg1->GetType(), 'f', 1));
if (!arg2->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), arg2->GetType(), 'f', 2));
*ret = arg1->GetFloat() + arg2->GetFloat();
}
}
//-----------------------------------------------------------
const char_type* OprtAdd::GetDesc() const
{
return _T("x+y - Addition for noncomplex values");
}
//-----------------------------------------------------------
IToken* OprtAdd::Clone() const
{
return new OprtAdd(*this);
}
//-----------------------------------------------------------
//
// class OprtSub
//
//-----------------------------------------------------------
OprtSub::OprtSub()
:IOprtBin(_T("-"), (int)prADD_SUB, oaLEFT)
{}
//-----------------------------------------------------------
void OprtSub::Eval(ptr_val_type &ret, const ptr_val_type *a_pArg, int num)
{
assert(num==2);
if (a_pArg[0]->GetType()=='m' && a_pArg[1]->GetType()=='m')
{
const matrix_type &a1 = a_pArg[0]->GetArray(),
&a2 = a_pArg[1]->GetArray();
if (a1.GetRows()!=a2.GetRows())
throw ParserError(ErrorContext(ecARRAY_SIZE_MISMATCH, -1, GetIdent(), 'm', 'm', 2));
matrix_type rv(a1.GetRows());
for (int i=0; i<a1.GetRows(); ++i)
{
if (!a1.At(i).IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), a1.At(i).GetType(), 'f', 1));
if (!a2.At(i).IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), a2.At(i).GetType(), 'f', 1));
rv.At(i) = cmplx_type(a1.At(i).GetFloat() - a2.At(i).GetFloat(),
a1.At(i).GetImag() - a2.At(i).GetImag());
}
*ret = rv;
}
else
{
if (!a_pArg[0]->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), a_pArg[0]->GetType(), 'f', 1));
if (!a_pArg[1]->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), a_pArg[1]->GetType(), 'f', 2));
*ret = a_pArg[0]->GetFloat() - a_pArg[1]->GetFloat();
}
}
//-----------------------------------------------------------
const char_type* OprtSub::GetDesc() const
{
return _T("subtraction");
}
//-----------------------------------------------------------
IToken* OprtSub::Clone() const
{
return new OprtSub(*this);
}
//-----------------------------------------------------------
//
// class OprtMul
//
//-----------------------------------------------------------
OprtMul::OprtMul()
:IOprtBin(_T("*"), (int)prMUL_DIV, oaLEFT)
{}
//-----------------------------------------------------------
void OprtMul::Eval(ptr_val_type &ret, const ptr_val_type *a_pArg, int num)
{
assert(num==2);
IValue *arg1 = a_pArg[0].Get();
IValue *arg2 = a_pArg[1].Get();
if (arg1->GetType()=='m' && arg2->GetType()=='m')
{
// Scalar multiplication
matrix_type a1 = arg1->GetArray();
matrix_type a2 = arg2->GetArray();
if (a1.GetRows()!=a2.GetRows())
throw ParserError(ErrorContext(ecARRAY_SIZE_MISMATCH, -1, GetIdent(), 'm', 'm', 2));
float_type val(0);
for (int i=0; i<a1.GetRows(); ++i)
val += a1.At(i).GetFloat()*a2.At(i).GetFloat();
*ret = val;
}
else if (arg1->GetType()=='m' && arg2->IsNonComplexScalar())
{
// Skalar * Vector
matrix_type out(a_pArg[0]->GetArray());
for (int i=0; i<out.GetRows(); ++i)
out.At(i) = out.At(i).GetFloat() * arg2->GetFloat();
*ret = out;
}
else if (arg2->GetType()=='m' && arg1->IsNonComplexScalar())
{
// Vector * Skalar
matrix_type out(arg2->GetArray());
for (int i=0; i<out.GetRows(); ++i)
out.At(i) = out.At(i).GetFloat() * arg1->GetFloat();
*ret = out;
}
else
{
if (!arg1->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), arg1->GetType(), 'f', 1));
if (!arg2->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), arg2->GetType(), 'f', 2));
*ret = arg1->GetFloat() * arg2->GetFloat();
}
}
//-----------------------------------------------------------
const char_type* OprtMul::GetDesc() const
{
return _T("multiplication");
}
//-----------------------------------------------------------
IToken* OprtMul::Clone() const
{
return new OprtMul(*this);
}
//-----------------------------------------------------------
//
// class OprtDiv
//
//-----------------------------------------------------------
OprtDiv::OprtDiv()
:IOprtBin(_T("/"), (int)prMUL_DIV, oaLEFT)
{}
//-----------------------------------------------------------
/** \brief Implements the Division operator.
\throw ParserError in case one of the arguments if
nonnumeric or an array.
*/
void OprtDiv::Eval(ptr_val_type &ret, const ptr_val_type *a_pArg, int num)
{
assert(num==2);
if (!a_pArg[0]->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), a_pArg[0]->GetType(), 'f', 1));
if (!a_pArg[1]->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), a_pArg[1]->GetType(), 'f', 2));
*ret = a_pArg[0]->GetFloat() / a_pArg[1]->GetFloat();
}
//-----------------------------------------------------------
const char_type* OprtDiv::GetDesc() const
{
return _T("division");
}
//-----------------------------------------------------------
IToken* OprtDiv::Clone() const
{
return new OprtDiv(*this);
}
//-----------------------------------------------------------
//
// class OprtPow
//
//-----------------------------------------------------------
OprtPow::OprtPow()
:IOprtBin(_T("^"), (int)prPOW, oaRIGHT)
{}
//-----------------------------------------------------------
void OprtPow::Eval(ptr_val_type& ret, const ptr_val_type *arg, int argc)
{
assert(argc==2);
float_type a = arg[0]->GetFloat();
float_type b = arg[1]->GetFloat();
int ib = (int)b;
if (b-ib==0)
{
switch (ib)
{
case 1: *ret = a; return;
case 2: *ret = a*a; return;
case 3: *ret = a*a*a; return;
case 4: *ret = a*a*a*a; return;
case 5: *ret = a*a*a*a*a; return;
default: *ret = std::pow(a, ib); return;
}
}
else
*ret = std::pow(a, b);
}
//-----------------------------------------------------------
const char_type* OprtPow::GetDesc() const
{
return _T("x^y - Raises x to the power of y.");
}
//-----------------------------------------------------------
IToken* OprtPow::Clone() const
{
return new OprtPow(*this);
}
}
Reference in New Issue View Git Blame Copy Permalink