Hello; In the PR: https://github.com/OPM/opm-parser/pull/249 Andreas has implemented support for regex matching of keywords in the deck. We need this functionality, and modulo minor fixes I intend to merge this PR. However, the PR uses Boost::regex; so going with it as it is now will introduce a Boost::regex dependeny through the whole stack. As I see it there are two possibilities:
1. Take the PR as is and accept the Boost::regex dependency - that might be perfectly OK? 2. Use C/Posix regex.h. Any opinions? Whatever choice we make we should preferably switch to std::regex when we switch to a sufficiently new g++ compiler. Joakim ------------------------------------------------------------------- The information contained in this message may be CONFIDENTIAL and is intended for the addressee only. Any unauthorised use, dissemination of the information or copying of this message is prohibited. If you are not the addressee, please notify the sender immediately by return e-mail and delete this message. Thank you
_______________________________________________ Opm mailing list [email protected] http://www.opm-project.org/mailman/listinfo/opm
