1 #ifndef _FMATVEC_AST_H_ 2 #define _FMATVEC_AST_H_ 4 #include "fmatvec/function.h" 8 #include <boost/uuid/uuid.hpp> 9 #include <boost/uuid/uuid_generators.hpp> 10 #include <boost/container/small_vector.hpp> 12 #include <fmatvec/stream.h> 18 class IndependentVariable;
29 template<
class... Arg>
class Eval;
38 template<
class... Arg>
friend class Eval;
39 friend class EvalHelper;
50 static const struct ConstructSymbol{} constructSymbol;
72 static void garbageCollect();
99 #if defined(FMATVEC_DEBUG) && !defined(SWIG) 100 static signed long evalOperationsCount;
209 static constexpr
size_t N { 12 };
216 using Arg = boost::container::small_vector<double*,N>;
217 std::function<void(
double*,
const Arg&)> func;
223 template<
class Func,
class ArgS>
244 template<
class Func,
class Arg1S,
class Arg2S>
248 const Arg1S &arg1,
const Arg2S &arg2);
272 template<
class Type1,
class Type2>
290 inline virtual bool isConstantInt()
const;
298 virtual std::vector<ByteCode>::iterator dumpByteCode(std::vector<ByteCode> &byteCode,
299 std::map<
const Vertex*, std::vector<AST::ByteCode>::iterator> &existingVertex)
const=0;
318 return a.std::shared_ptr<const AST::Vertex>::get() < b.std::shared_ptr<const AST::Vertex>::get();
321 using MapIVSE = std::map<IndependentVariable, SymbolicExpression, LessIV>;
333 class FMATVEC_EXPORT
Constant :
public Vertex,
public std::enable_shared_from_this<Constant<T>> {
339 inline bool isConstantInt()
const override;
341 inline const T& getValue()
const;
342 std::vector<ByteCode>::iterator dumpByteCode(std::vector<ByteCode> &byteCode,
343 std::map<
const Vertex*, std::vector<AST::ByteCode>::iterator> &existingVertex)
const override;
353 static std::map<CacheKey, std::weak_ptr<const Constant>> cache;
374 class FMATVEC_EXPORT
Symbol :
public Vertex,
public std::enable_shared_from_this<Symbol> {
379 static IndependentVariable create(
const boost::uuids::uuid& uuid_=boost::uuids::random_generator()());
383 inline void setValue(
double x_)
const;
385 std::string getUUIDStr()
const;
387 std::vector<ByteCode>::iterator dumpByteCode(std::vector<ByteCode> &byteCode,
388 std::map<
const Vertex*, std::vector<AST::ByteCode>::iterator> &existingVertex)
const override;
394 Symbol(
const boost::uuids::uuid& uuid_);
396 mutable double x = 0.0;
397 boost::uuids::uuid uuid;
398 using CacheKey = boost::uuids::uuid;
399 static std::map<CacheKey, std::weak_ptr<const Symbol>> cache;
410 virtual double operator()(
const ByteCode::Arg &arg) = 0;
411 virtual double dirDer(
const ByteCode::Arg &arg) = 0;
412 virtual double dirDerDirDer(
const ByteCode::Arg &arg) = 0;
418 double operator()(
const ByteCode::Arg &arg)
override {
419 return (*func)(*arg[0]);
421 double dirDer(
const ByteCode::Arg &arg)
override {
422 return func->dirDer(*arg[1], *arg[0]);
424 double dirDerDirDer(
const ByteCode::Arg &arg)
override {
425 return func->dirDerDirDer(*arg[1], *arg[2], *arg[0]);
435 argV.resize(argSize);
436 dir1V.resize(argSize);
437 dir2V.resize(argSize);
439 double operator()(
const ByteCode::Arg &arg)
override {
440 for(
size_t i=0; i<argV.size(); ++i)
442 return (*func)(argV);
444 double dirDer(
const ByteCode::Arg &arg)
override {
445 size_t argVsize=argV.size();
446 for(
size_t i=0; i<argVsize; ++i)
448 for(
size_t i=0; i<argVsize; ++i)
449 dir1V(i) = *arg[i+argVsize];
450 return func->dirDer(dir1V, argV);
452 double dirDerDirDer(
const ByteCode::Arg &arg)
override {
453 size_t argVsize=argV.size();
454 for(
size_t i=0; i<argVsize; ++i)
456 for(
size_t i=0; i<argVsize; ++i)
457 dir1V(i) = *arg[i+argVsize];
458 for(
size_t i=0; i<argVsize; ++i)
459 dir2V(i) = *arg[i+2*argVsize];
460 return func->dirDerDirDer(dir1V, dir2V, argV);
472 double operator()(
const ByteCode::Arg &arg)
override {
473 return (*func)(*arg[0], *arg[1]);
475 double dirDer(
const ByteCode::Arg &arg)
override {
476 return func->dirDer1(*arg[2], *arg[0], *arg[1]) +
477 func->dirDer2(*arg[3], *arg[0], *arg[1]);
479 double dirDerDirDer(
const ByteCode::Arg &arg)
override {
480 return func->dirDer1DirDer1(*arg[2], *arg[4], *arg[0], *arg[1]) +
481 func->dirDer2DirDer1(*arg[5], *arg[2], *arg[0], *arg[1]) +
482 func->dirDer2DirDer1(*arg[3], *arg[4], *arg[0], *arg[1]) +
483 func->dirDer2DirDer2(*arg[3], *arg[5], *arg[0], *arg[1]);
493 argV.resize(argSize);
494 dir1V.resize(argSize);
495 dir2V.resize(argSize);
497 double operator()(
const ByteCode::Arg &arg)
override {
498 for(
size_t i=0; i<argV.size(); ++i)
500 return (*func)(argV, *arg[argV.size()]);
502 double dirDer(
const ByteCode::Arg &arg)
override {
503 auto argVsize=argV.size();
504 for(
size_t i=0; i<argVsize; ++i)
506 for(
size_t i=0; i<argVsize; ++i)
507 dir1V(i) = *arg[i+1+argVsize];
508 return func->dirDer1(dir1V , argV, *arg[argVsize]) +
509 func->dirDer2(*arg[2*argVsize+1], argV, *arg[argVsize]);
511 double dirDerDirDer(
const ByteCode::Arg &arg)
override {
512 auto argVsize=argV.size();
513 for(
size_t i=0; i<argVsize; ++i)
515 for(
size_t i=0; i<argVsize; ++i)
516 dir1V(i) = *arg[i+1+argVsize];
517 for(
size_t i=0; i<argVsize; ++i)
518 dir2V(i) = *arg[i+2+2*argVsize];
519 return func->dirDer1DirDer1(dir1V, dir2V, argV, *arg[argVsize]) +
520 func->dirDer2DirDer1(*arg[1+2*argVsize], dir2V , argV, *arg[argVsize]) +
521 func->dirDer2DirDer1(*arg[2+3*argVsize], dir1V , argV, *arg[argVsize]) +
522 func->dirDer2DirDer2(*arg[1+2*argVsize], *arg[2+3*argVsize], argV, *arg[argVsize]);
535 argV.resize(argSize);
536 dir1V.resize(argSize);
537 dir2V.resize(argSize);
539 double operator()(
const ByteCode::Arg &arg)
override {
540 for(
size_t i=0; i<argV.size(); ++i)
542 return (*func)(*arg[0], argV);
544 double dirDer(
const ByteCode::Arg &arg)
override {
545 auto argVsize=argV.size();
546 for(
size_t i=0; i<argVsize; ++i)
548 for(
size_t i=0; i<argVsize; ++i)
549 dir1V(i) = *arg[i+2+argVsize];
550 return func->dirDer1(*arg[argVsize+1], *arg[0], argV) +
551 func->dirDer2(dir1V , *arg[0], argV);
553 double dirDerDirDer(
const ByteCode::Arg &arg)
override {
554 auto argVsize=argV.size();
555 for(
size_t i=0; i<argVsize; ++i)
557 for(
size_t i=0; i<argVsize; ++i)
558 dir1V(i) = *arg[i+2+argVsize];
559 for(
size_t i=0; i<argVsize; ++i)
560 dir2V(i) = *arg[i+3+2*argVsize];
561 return func->dirDer1DirDer1(*arg[argVsize+1], *arg[2*argVsize+2], *arg[0], argV) +
562 func->dirDer2DirDer1(dir2V , *arg[argVsize+1] , *arg[0], argV) +
563 func->dirDer2DirDer1(dir1V , *arg[2*argVsize+2], *arg[0], argV) +
564 func->dirDer2DirDer2(dir1V , dir2V , *arg[0], argV);
573 template<
class Type1,
class Type2>
577 int argaSize,
int argbSize) : func(func_) {
578 argV1.resize(argaSize);
579 argV2.resize(argbSize);
580 dir1V1.resize(argaSize);
581 dir1V2.resize(argbSize);
582 dir2V1.resize(argaSize);
583 dir2V2.resize(argbSize);
585 double operator()(
const ByteCode::Arg &arg)
override {
586 auto argV1size = argV1.size();
587 auto argV2size = argV2.size();
588 for(
int i=0; i<argV1size; ++i)
590 for(
int i=0; i<argV2size; ++i)
591 argV2(i)=*arg[argV1size+i];
592 return (*func)(argV1, argV2);
594 double dirDer(
const ByteCode::Arg &arg)
override {
595 auto argV1size = argV1.size();
596 auto argV2size = argV2.size();
597 for(
int i=0; i<argV1size; ++i)
599 for(
int i=0; i<argV2size; ++i)
600 argV2(i)=*arg[argV1size+i];
601 for(
size_t i=0; i<argV1size; ++i)
602 dir1V1(i) = *arg[argV1size+argV2size+i];
603 for(
size_t i=0; i<argV2size; ++i)
604 dir1V2(i) = *arg[2*argV1size+argV2size+i];
605 return func->dirDer1(dir1V1, argV1, argV2) +
606 func->dirDer2(dir1V2, argV1, argV2);
608 double dirDerDirDer(
const ByteCode::Arg &arg)
override {
609 auto argV1size = argV1.size();
610 auto argV2size = argV2.size();
611 for(
int i=0; i<argV1size; ++i)
613 for(
int i=0; i<argV2size; ++i)
614 argV2(i)=*arg[argV1size+i];
615 for(
size_t i=0; i<argV1size; ++i)
616 dir1V1(i) = *arg[argV1size+argV2size+i];
617 for(
size_t i=0; i<argV2size; ++i)
618 dir1V2(i) = *arg[2*argV1size+argV2size+i];
619 for(
size_t i=0; i<argV1size; ++i)
620 dir2V1(i) = *arg[2*argV1size+2*argV2size+i];
621 for(
size_t i=0; i<argV2size; ++i)
622 dir2V2(i) = *arg[3*argV1size+2*argV2size+i];
623 return func->dirDer1DirDer1(dir1V1, dir2V1, argV1, argV2) +
624 func->dirDer2DirDer1(dir2V2, dir1V1, argV1, argV2) +
625 func->dirDer2DirDer1(dir1V2, dir2V1, argV1, argV2) +
626 func->dirDer2DirDer2(dir1V2, dir2V2, argV1, argV2);
644 const std::vector<SymbolicExpression> &argS,
645 const std::vector<SymbolicExpression> &dir1S={},
646 const std::vector<SymbolicExpression> &dir2S={});
649 std::vector<ByteCode>::iterator dumpByteCode(std::vector<ByteCode> &byteCode,
651 std::vector<AST::ByteCode>::iterator> &existingVertex)
const override;
657 const std::vector<SymbolicExpression> &argS,
658 const std::vector<SymbolicExpression> &dir1S,
659 const std::vector<SymbolicExpression> &dir2S);
663 const std::vector<SymbolicExpression> argS;
664 const std::vector<SymbolicExpression> dir1S;
665 const std::vector<SymbolicExpression> dir2S;
667 using CacheKey = std::tuple<std::weak_ptr<ScalarFunctionWrapArg>,
668 std::vector<std::weak_ptr<const Vertex>>,
669 std::vector<std::weak_ptr<const Vertex>>,
670 std::vector<std::weak_ptr<const Vertex>> >;
672 bool operator()(
const CacheKey& l,
const CacheKey& r)
const;
674 std::owner_less<std::weak_ptr<const Vertex>> ol;
675 std::owner_less<std::weak_ptr<const ScalarFunctionWrapArg>> olf;
677 static std::map<CacheKey, std::weak_ptr<const NativeFunction>,
CacheKeyComp> cache;
683 class FMATVEC_EXPORT
Operation :
public Vertex,
public std::enable_shared_from_this<Operation> {
688 fmatvec::getBoostSpiritQiRule<SymbolicExpression>();
690 fmatvec::getBoostSpiritKarmaRule<SymbolicExpression>();
694 enum Operator { Plus, Minus, Mult, Div, Pow, Log, Sqrt, Neg, Sin, Cos, Tan, Sinh, Cosh, Tanh, ASin, ACos, ATan, ATan2, ASinh, ACosh, ATanh, Exp, Sign, Heaviside, Abs, Min, Max, Condition };
695 static SymbolicExpression create(Operator op_,
const std::vector<SymbolicExpression> &child_);
698 Operator getOp()
const {
return op; }
699 const std::vector<SymbolicExpression>& getChilds()
const {
return child; }
700 std::vector<ByteCode>::iterator dumpByteCode(std::vector<ByteCode> &byteCode,
701 std::map<
const Vertex*, std::vector<AST::ByteCode>::iterator> &existingVertex)
const override;
707 Operation(Operator op_,
const std::vector<SymbolicExpression> &child_);
708 bool equal(
const SymbolicExpression &b, MapIVSE &m)
const override;
710 std::vector<SymbolicExpression> child;
711 using CacheKey = std::pair<Operator, std::vector<std::weak_ptr<const Vertex>>>;
713 bool operator()(
const CacheKey& l,
const CacheKey& r)
const;
715 std::owner_less<std::weak_ptr<const Vertex>> ol;
717 static std::map<CacheKey, std::weak_ptr<const Operation>,
CacheKeyComp> cache;
720 std::string funcName;
722 std::function<void(
double*,
const ByteCode::Arg&)> func;
725 static const std::map<Operator, OpMap> opMap;
731 return AST::NativeFunction::create(std::make_shared<AST::ScalarFunctionWrapArgS>(func), std::vector<SymbolicExpression>{arg});
735 SymbolicExpression SymbolicFuncWrapArg1<double(Vector<Type, double>), Vector<Type, SymbolicExpression>>::call(
737 const Vector<Type, SymbolicExpression> &arg) {
738 std::vector<SymbolicExpression> argV(arg.size());
739 for(
int i=0; i<arg.size(); ++i)
741 return AST::NativeFunction::create(std::make_shared<AST::ScalarFunctionWrapArgV<Type>>(func, arg.size()), argV);
744 inline SymbolicExpression SymbolicFuncWrapArg2<double(
double,
double), SymbolicExpression, SymbolicExpression>::call(
746 const SymbolicExpression &arg1,
const SymbolicExpression &arg2) {
747 return AST::NativeFunction::create(std::make_shared<AST::ScalarFunctionWrapArgSS>(func), std::vector<SymbolicExpression>{arg1,arg2});
751 SymbolicExpression SymbolicFuncWrapArg2<double(Vector<Type,double>,
double), Vector<Type, SymbolicExpression>, SymbolicExpression>::call(
752 const std::shared_ptr<Function<
double(Vector<Type,double>,
double)>> &func,
753 const Vector<Type, SymbolicExpression> &arg1,
const SymbolicExpression &arg2) {
754 std::vector<SymbolicExpression> arg(arg1.size()+1);
755 for(
int i=0; i<arg1.size(); ++i)
757 arg[arg1.size()]=arg2;
758 return AST::NativeFunction::create(std::make_shared<AST::ScalarFunctionWrapArgVS<Type>>(func, arg1.size()), arg);
762 SymbolicExpression SymbolicFuncWrapArg2<double(
double,Vector<Type,double>), SymbolicExpression, Vector<Type, SymbolicExpression>>::call(
763 const std::shared_ptr<Function<
double(
double,Vector<Type,double>)>> &func,
764 const SymbolicExpression &arg1,
const Vector<Type, SymbolicExpression> &arg2) {
765 std::vector<SymbolicExpression> arg(1+arg2.size());
767 for(
int i=0; i<arg2.size(); ++i)
769 return AST::NativeFunction::create(std::make_shared<AST::ScalarFunctionWrapArgSV<Type>>(func, arg2.size()), arg);
772 template<
class Type1,
class Type2>
773 SymbolicExpression SymbolicFuncWrapArg2<double(Vector<Type1,double>,Vector<Type2,double>), Vector<Type1, SymbolicExpression>, Vector<Type2, SymbolicExpression>>::call(
774 const std::shared_ptr<Function<
double(Vector<Type1,double>,Vector<Type2,double>)>> &func,
775 const Vector<Type1, SymbolicExpression> &arg1,
const Vector<Type2, SymbolicExpression> &arg2) {
776 std::vector<SymbolicExpression> arg(arg1.size()+arg2.size());
777 for(
int i=0; i<arg1.size(); ++i)
779 for(
int i=0; i<arg2.size(); ++i)
780 arg[arg1.size()+i]=arg2(i);
781 return AST::NativeFunction::create(std::make_shared<AST::ScalarFunctionWrapArgVV<Type1,Type2>>(func, arg1.size(), arg2.size()), arg);
789 std::cerr<<
"ABORT: See LessIV: have you called std::min/max instead of fmatvev::min/max with type SymbolicExpression?"<<std::endl;
790 assert(((
void)
"See LessIV: have you called std::min/max instead of fmatvev::min/max with type SymbolicExpression?",
false));
795 static_cast<const AST::Symbol*>(get())->setValue(x);
802 template<> boost::spirit::karma::rule<std::ostream_iterator<char>,
IndependentVariable()>& getBoostSpiritKarmaRule<IndependentVariable>();
803 template<> boost::spirit::karma::rule<std::ostream_iterator<char>,
SymbolicExpression()>& getBoostSpiritKarmaRule<SymbolicExpression>();
void setValue(double x_) const
Definition: ast.h:402
IndependentVariable & operator^=(double x)
Set the double value of the independent value.
Definition: ast.h:794
A vertex of the AST representing a constant (long or double)
Definition: ast.h:25
const T & getValue() const
Get the constant value of the vertex.
Definition: ast.h:367
bool isConstantInt() const override
Rreturn true if this Vertex is a constant integer.
virtual bool isConstantInt() const
Rreturn true if this Vertex is a constant integer.
Definition: ast.h:325
Definition: function.h:202
A vertex of the AST representing an arbitary function.
Definition: ast.h:641
A vertex of the AST representing a independent variable.
Definition: ast.h:374
A vertex of the AST representing an operation.
Definition: ast.h:683
Namespace fmatvec.
Definition: _memory.cc:28
A abstract class for a Vertex of the AST (abstract syntax tree).
Definition: ast.h:282
Operator
Defined operations.
Definition: ast.h:694
ostream & operator<<(ostream &s, const SymbolicExpression &se)
Write a SymbolicExpression to a stream using serialization.
Definition: ast.cc:190
SymbolicExpression parDer(const SymbolicExpression &dep, const IndependentVariable &indep)
Definition: ast.cc:299