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 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182
|
/*
__________ ____ ___
_____ __ _\______ \_____ _______ ______ __________\ \/ /
/ \| | \ ___/\__ \\_ __ \/ ___// __ \_ __ \ /
| Y Y \ | / | / __ \| | \/\___ \\ ___/| | \/ \
|__|_| /____/|____| (____ /__| /____ >\___ >__| /___/\ \
\/ \/ \/ \/ \_/
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 "mpOprtMatrix.h"
MUP_NAMESPACE_START
//-------------------------------------------------------------------------------------------------
//
// class OprtTranspose
//
//-------------------------------------------------------------------------------------------------
OprtTranspose::OprtTranspose()
:IOprtPostfix(_T("'"))
{}
//-------------------------------------------------------------------------------------------------
void OprtTranspose::Eval(ptr_val_type &ret, const ptr_val_type *a_pArg, int /*a_iArgc*/)
{
if (a_pArg[0]->IsMatrix())
{
matrix_type matrix = a_pArg[0]->GetArray();
matrix.Transpose();
*ret = matrix;
}
else
*ret = *a_pArg[0];
}
//-------------------------------------------------------------------------------------------------
const char_type* OprtTranspose::GetDesc() const
{
return _T("foo' - An operator for transposing a matrix.");
}
//-------------------------------------------------------------------------------------------------
IToken* OprtTranspose::Clone() const
{
return new OprtTranspose(*this);
}
//-----------------------------------------------------------------------------------------------
//
// class OprtCreateArray
//
//-----------------------------------------------------------------------------------------------
OprtCreateArray::OprtCreateArray()
:ICallback(cmCBC, _T("Array constructor"), -1)
{}
//-----------------------------------------------------------------------------------------------
/** \brief Index operator implementation
\param ret A reference to the return value
\param a_pArg Pointer to an array with the indices as ptr_val_type
\param a_iArgc Number of indices (=dimension) actully used in the expression found. This must
be 1 or 2 since three dimensional data structures are not supported by muParserX.
*/
void OprtCreateArray::Eval(ptr_val_type &ret, const ptr_val_type *a_pArg, int a_iArgc)
{
try
{
// The index is -1.
if (a_iArgc <= 0)
{
throw ParserError(ErrorContext(ecINVALID_PARAMETER, -1, GetIdent()));
}
matrix_type m(a_iArgc, 1, 0.0);
for (int i = 0; i < a_iArgc; ++i)
{
if (a_pArg[i]->GetDim() != 0)
{
// Prevent people from using this constructor for matrix creation.
// This would not work as expected and i dont't want them
// to get used to awkward workarounds. It's just not working right now ok?
ErrorContext errc(ecINVALID_PARAMETER, -1, GetIdent());
errc.Arg = i+1;
throw ParserError(errc);
}
m.At(i) = *a_pArg[i];
}
m.Transpose();
*ret = m;
}
catch (ParserError &exc)
{
exc.GetContext().Pos = GetExprPos();
throw exc;
}
}
//-----------------------------------------------------------------------------------------------
const char_type* OprtCreateArray::GetDesc() const
{
return _T("{,} - Array construction operator.");
}
//-----------------------------------------------------------------------------------------------
IToken* OprtCreateArray::Clone() const
{
return new OprtCreateArray(*this);
}
//-----------------------------------------------------------
//
// class OprtColon
//
//-----------------------------------------------------------
OprtColon::OprtColon()
:IOprtBin(_T("~"), (int)prCOLON, oaLEFT)
{}
//-----------------------------------------------------------
void OprtColon::Eval(ptr_val_type& ret, const ptr_val_type *a_pArg, int num)
{
assert(num==2);
const IValue *argMin = a_pArg[0].Get();
const IValue *argMax = a_pArg[1].Get();
if (!argMin->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), argMin->GetType(), 'i', 1));
if (!argMax->IsNonComplexScalar())
throw ParserError( ErrorContext(ecTYPE_CONFLICT_FUN, -1, GetIdent(), argMax->GetType(), 'i', 1));
if (*argMax < *argMin)
throw ParserError(_T("Colon operator: Maximum value smaller than Minimum!"));
int n = (int)(argMax->GetFloat() - argMin->GetFloat()) + 1;
matrix_type arr(n);
for (int i=0; i<n; ++i)
arr.At(i) = argMin->GetFloat() + i;
*ret = arr;
}
//-----------------------------------------------------------
const char_type* OprtColon::GetDesc() const
{
return _T(": - Colon operator");
}
//-----------------------------------------------------------
IToken* OprtColon::Clone() const
{
return new OprtColon(*this);
}
MUP_NAMESPACE_END
|