Detailed description
Add test with strings from the Big List of Naughty Strings, to test robustness of the library.
Context
The Big List of Naughty String is "an evolving list of strings which have a high probability of causing issues when used as user-input data." For example, a string with zero-width space (U+200B).
As a text processing library that has to deal with strings of all sorts, both from user-input and from data archive, it is expected that the library should be robust enough to handle variety of character combinations.
Possible implementation
- Run major functions through the string list
- First step, aim the lib not to break and return a correct output type in a reasonable time.
- Correctness is not the goal for now (as there's no definition of correctness yet).
Detailed description
Add test with strings from the Big List of Naughty Strings, to test robustness of the library.
Context
The Big List of Naughty String is "an evolving list of strings which have a high probability of causing issues when used as user-input data." For example, a string with zero-width space (U+200B).
As a text processing library that has to deal with strings of all sorts, both from user-input and from data archive, it is expected that the library should be robust enough to handle variety of character combinations.
Possible implementation