| 03:53 | <Bakkot> | devsnek: my personal Most Jank Algorithm Step is still |
| 03:53 | <Bakkot> | > If replacing the FunctionDeclaration f with a VariableStatement that has F as a BindingIdentifier would not produce any Early Errors for func and F is not an element of parameterNames, then |
| 03:54 | <devsnek> | i found another step that just says "for each character c" |
| 03:55 | <devsnek> | as in all of the unicode characters |
| 03:56 | <Bakkot> | ... solid |
| 03:56 | <Bakkot> | I guess that's probably clearer than expecting readers to know what "preimage" means |
| 03:56 | <devsnek> | lol |
| 03:56 | <Bakkot> | (for other people, the step is "For each character c not in set A where Canonicalize(c) is in A, add c to U.") |
| 03:57 | <devsnek> | and that step is hit twice for every occurrence of a \b or \B |
| 03:57 | <devsnek> | gotta be careful not to implement as written |
| 03:59 | <rkirsling> | Bakkot: preimage seems fair game if a definition is provided :) |
| 03:59 | <Bakkot> | rkirsling yeah but if you are going to define a word and then use it exactly once you should just not define that word, as a rule |
| 03:59 | <rkirsling> | touché |
| 03:59 | <devsnek> | on the plus side |
| 03:59 | <devsnek> | regex is mostly working now |
| 04:00 | <devsnek> | and i'm seriously considering making a big editorial pr to refactor regex |
| 04:02 | <Bakkot> | don't forget about annex B |
| 04:02 | <devsnek> | :( |
| 04:02 | <Bakkot> | i.e. the place regexes are actually defined |
| 04:05 | <devsnek> | it doesn't exist if i don't think about it |