Jeremy Rifkin

Thank you, I will do so. I figured I'd post here in case there's any way to work around it in the library and in case it warrants updating the...

Understandable :) I'm seeing it compiling fine with `/std:c++20` at least!

Good to know, thanks so much for the quick reply!

@Toinane Thanks for the quick reply! Good to know the cause of the issue. I just tested two images, one RGB 8bit and one RGB 16bit. I am seeing the...

Hi @cra2801, I think I see what you're proposing. It'd be a cool enhancement, it will add a lot of complexity to the expression decomposer but I think it could...

Supporting this would involve further complicating an already intricate expression decomposition system and I'm concerned about possible impact on build times. Possibly the sort of thing that would make sense...

The problematic regex is `^((?:(?:u8|[UuL])?'(?:\\[0-7]{1,3}|\\x[\da-fA-F]+|\\.|[^\n'])*')|(?:(?:u8|[UuL])?R"([^ ()\\t\r\v\n]*)\((?:(?!\)\2\").)*\)\2")|(?:(?:u8|[UuL])?"(?:\\[0-7]{1,3}|\\x[\da-fA-F]+|\\.|[^\n"])*"))[^]*`

Minimal reproducible regex is `(x*)\s+(?!\1).+` https://godbolt.org/z/3h1hfrGeP

To add onto @alexislefebvre's suggestion with `ninetyten` I'd like to suggest the following so this codebase is prepared to handle Bilbo's eleventy first birthday: ```diff + const eleventyone: i64 =...

I noticed the note in BinaryTrees.h, maybe it'd be more clear to describe it as an augmented binary tree in the docs?