diff options
| author | Bruce Hill <bruce@bruce-hill.com> | 2024-09-13 13:34:04 -0400 |
|---|---|---|
| committer | Bruce Hill <bruce@bruce-hill.com> | 2024-09-13 13:34:04 -0400 |
| commit | 9447ba8c4aff985f9238b3f4e138afd4526799b0 (patch) | |
| tree | 1856175c4bf59aefae81a3b5823ad6eea09ffd70 /docs/text.md | |
| parent | ed55fc2c7ab8fb921a95a5c27d9c8dc43b9c6eb9 (diff) | |
Split pattern code into its own file
Diffstat (limited to 'docs/text.md')
| -rw-r--r-- | docs/text.md | 8 |
1 files changed, 5 insertions, 3 deletions
diff --git a/docs/text.md b/docs/text.md index 8a9f641e..18960b02 100644 --- a/docs/text.md +++ b/docs/text.md @@ -255,9 +255,11 @@ finding the value because the two texts are equivalent under normalization. # Patterns As an alternative to full regular expressions, Tomo provides a limited string -matching pattern syntax that is intended to solve 80% of use cases in 2% of the -code size (PCRE's codebase is roughly 150k lines of code, and Tomo's entire -Text codebase is around 1.8K lines of code). +matching pattern syntax that is intended to solve 80% of use cases in under 1% +of the code size (PCRE's codebase is roughly 150k lines of code, and Tomo's +pattern matching code is a bit under 1k lines of code). Tomo's pattern matching +syntax is highly readable and works well for matching literal text without +getting [leaning toothpick syndrome](https://en.wikipedia.org/wiki/Leaning_toothpick_syndrome). For more advanced use cases, consider linking against a C library for regular expressions or pattern matching. |