Re:Practices for writing high-performance Go
by v_lisivka on Wednesday May 08, 2019 @05:21AM
(#19857179)
Look at the program:
fn find_replaced_sequence_length(sequence: String) -> usize {
// Replace the following patterns, one at a time:
let substs = vec![
("tHa[Nt]", "<4>"),
("aND|caN|Ha[DS]|WaS", "<3>"),
("a[NSt]|BY", "<2>"),
("<[^>]*>", "|"),
("\\|[^|][^|]*\\|", "-"),
];
// Perform the replacements in the sequence:
substs
.iter()
.fold(sequence, |s, (re, replacement)| {
regex(re)
.replace_all(&s, NoExpand(replacement)).into_owned()
}).len()
}
It measures performance of RE engine. I can switch from regex crate to PCRE2, and program performance will match C.
Re:Practices for writing high-performance Go
by igouy on Wednesday May 08, 2019 @11:12AM
(#19859555)
> I can switch from regex crate to PCRE2, and program performance will match C.
Perhaps it would; those measurements have not been made.
What does that have to do with re-writing libraries to make tiny toy programs run better?
What does that have to do with program performance being a proxy for programmer effort?
I somehow doubt pcre2 is being changed to make the tiny toy C programs run better.
> I spent two weekends on this.
So shouldn't we assume the program performance simply reflects all-those-hours you've spent working on it?