Timeline for Symbolic algebra using a generic smart pointer class
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27, 2019 at 19:48 | comment | added | Adam |
The concepts are something I haven't played with yet, but I've read a few articles and seen some of the videos you linked to. I will definitely look into implementing that. The big reason for the abstract base class was to allow these to be used in a std::vector within a Matrix<sym> class that I define elsewhere. Mostly, I'm looking for compile-time expression trees, but I want to enable these to be used from a shared library, which will require some amount of run-time code.
|
|
| Jan 27, 2019 at 19:42 | comment | added | Adam |
This is an amazing, well thought out, and comprehensive answer that addresses nearly every one of my concerns and problems. Bullets 1-3, 5, 6, 8-11 are great advice. For point 4, I'm hashing the string to avoid ambiguity in comparing the numbers and expressions. For point 7, I need the BaseSymbolic version in some other functions that do comparisons, etc.
|
|
| Jan 27, 2019 at 19:30 | vote | accept | Adam | ||
| Jan 26, 2019 at 18:04 | history | answered | user673679 | CC BY-SA 4.0 |