You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Would you be willing to accept a PR that replaces the use of regexp2 with a simple parser or similar? Right now it is used for checking for repeated strings and for rough date matching, both of which seem reasonable to implement as a simple parser.
The text was updated successfully, but these errors were encountered:
Yes, as long as the behaviour is unchanged this looks like a worthwhile
change. Thanks !
Le jeu. 16 mai 2019 à 22:33, Daniel Theophanes <[email protected]> a
écrit :
Would you be willing to accept a PR that replaces the use of regexp2 with
a simple parser or similar? Right now it is used for checking for repeated
strings and for rough date matching, both of which seem reasonable to
implement as a simple parser.
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#7?email_source=notifications&email_token=AAGDO6H4H3SJA3XU4WVDCU3PVXAJ7A5CNFSM4HNP6OL2YY3PNVWWK3TUL52HS4DFUVEXG43VMWVGG33NNVSW45C7NFSM4GUINALQ>,
or mute the thread
<https://github.com/notifications/unsubscribe-auth/AAGDO6CODD2Y3MNIHXJVUXTPVXAJ7ANCNFSM4HNP6OLQ>
.
Would you be willing to accept a PR that replaces the use of regexp2 with a simple parser or similar? Right now it is used for checking for repeated strings and for rough date matching, both of which seem reasonable to implement as a simple parser.
The text was updated successfully, but these errors were encountered: