I've got a bunch of strings like:
"Hello, here's a test colon:. Here's a test semi-colon;"
I would like to replace that with
"Hello, here's a test colon:. Here's a test semi-colon;"
And so on for all printable ASCII values.
At present I'm using boost::regex_search
to match &#(\d+);
, building up a string as I process each match in turn (including appending the substring containing no matches since the last match I found).
Can anyone think of a better way of doing it? I'm open to non-regex methods, but regex seemed a reasonably sensible approach in this case.
Thanks,
Dom
Ya know, as long as we're off topic here, perl substitution has an 'e' option. As in evaluate expression. E.g.
Pretty-printing that:
Though perl being perl, I'm sure there's a much better way to write that...
Back to C code:
You could also roll your own finite state machine. But that gets messy and troublesome to maintain later on.
This is one of those cases where the original problem statement apparently isn't very complete, it seems, but if you really want to only trigger on cases which produce characters between 32 and 126, that's a trivial change to the solution I posted earlier. Note that my solution also handles the multiple-patterns case (although this first version wouldn't handle cases where some of the adjacent patterns are in-range and others are not).
It would not be particularly difficult to handle that case (e.g. ;#131;#58; produces ";#131;:" as well:
The big advantage of using a regex is to deal with the tricky cases like
&
Entity replacement isn't iterative, it's a single step. The regex is also going to be fairly efficient: the two lead characters are fixed, so it will quickly skip anything not starting with&#
. Finally, the regex solution is one without a lot of surprises for future maintainers.I'd say a regex was the right choice.
Is it the best regex, though? You know you need two digits and if you have 3 digits, the first one will be a 1. Printable ASCII is after all
 -~
. For that reason, you could consider?\d\d;
.As for replacing the content, I'd use the basic algorithm described for boost::regex::replace :
Here's another Perl's one-liner (see @mrree's answer):
I did think I was pretty good at regex but I have never seen lambdas been used in regex, please enlighten me!
I'm currently using python and would have solved it with this oneliner:
Does that make any sense?