.NET Standard 2.0 implementation of the Unicode grapheme cluster breaking algorithm

There is no point saying the same shit. You can read this article written by my friend DebugST for our previous grapheme cluster breaking project STGraphemeSplitter

• This project is its new version. Faster and lighter with minimal code and two different variants where you can chose or extend from.

See GraphemeSplitterNET_Test or the project STGRaphemeSplitter (same behaviour approach .Split .Each) for usage.

Benchmark Results

Performance

• GraphemeSplitter: 17,000,000 clusters in 5141ms
• GraphemeSplitterBuffered: 15,000,000 clusters in 3618ms
• STGraphemeSplitter: 15,000,000 clusters in 14885ms

Input length: 102,000,000

---

INPUT = Z͑ͫ̓ͪ̂ͫ̽͏̴̙̤̞͉͚̯̞̠͍A̴̵̜̰͔ͫ͗͢L̠ͨͧͩ͘G̴̻͈͍͔̹̑͗̎̅͛́Ǫ̵̹̻̝̳͂̌̌͘!͖̬̰̙̗̿̋ͥͥ̂ͣ̐́́͜͞'汉字👩‍🦰👩‍👩‍👦‍👦Abc * 1 000 000

OUTPUT = First 20 Grapheme Clusters

GraphemeSplitter:

'Z͑ͫ̓ͪ̂ͫ̽͏̴̙̤̞͉͚̯̞̠͍' 'A̴̵̜̰͔ͫ͗͢' 'L̠ͨͧͩ͘' 'G̴̻͈͍͔̹̑͗̎̅͛́' 'Ǫ̵̹̻̝̳͂̌̌͘' '!͖̬̰̙̗̿̋ͥͥ̂ͣ̐́́͜͞' ''' '汉' '字' '👩‍🦰' '👩‍👩‍👦‍👦' '️‍' 'A' 'b' 'c' 'Z͑ͫ̓ͪ̂ͫ̽͏̴̙̤̞͉͚̯̞̠͍' 'A̴̵̜̰͔ͫ͗͢' 'L̠ͨͧͩ͘' 'G̴̻͈͍͔̹̑͗̎̅͛́' 'Ǫ̵̹̻̝̳͂̌̌͘'

GraphemeSplitterBuffered:

'Z͑ͫ̓ͪ̂ͫ̽͏̴̙̤̞͉͚̯̞̠͍' 'A̴̵̜̰͔ͫ͗͢' 'L̠ͨͧͩ͘' 'G̴̻͈͍͔̹̑͗̎̅͛́' 'Ǫ̵̹̻̝̳͂̌̌͘' '!͖̬̰̙̗̿̋ͥͥ̂ͣ̐́́͜͞' ''' '汉' '字' '👩‍🦰' '👩‍👩‍👦‍👦️‍' 'A' 'b' 'c' 'Z͑ͫ̓ͪ̂ͫ̽͏̴̙̤̞͉͚̯̞̠͍' 'A̴̵̜̰͔ͫ͗͢' 'L̠ͨͧͩ͘' 'G̴̻͈͍͔̹̑͗̎̅͛́' 'Ǫ̵̹̻̝̳͂̌̌͘' '!͖̬̰̙̗̿̋ͥͥ̂ͣ̐́́͜͞'

STGraphemeSplitter (no cache):

'Z͑ͫ̓ͪ̂ͫ̽͏̴̙̤̞͉͚̯̞̠͍' 'A̴̵̜̰͔ͫ͗͢' 'L̠ͨͧͩ͘' 'G̴̻͈͍͔̹̑͗̎̅͛́' 'Ǫ̵̹̻̝̳͂̌̌͘' '!͖̬̰̙̗̿̋ͥͥ̂ͣ̐́́͜͞' ''' '汉' '字' '👩‍🦰' '👩‍👩‍👦‍👦️‍' 'A' 'b' 'c' 'Z͑ͫ̓ͪ̂ͫ̽͏̴̙̤̞͉͚̯̞̠͍' 'A̴̵̜̰͔ͫ͗͢' 'L̠ͨͧͩ͘' 'G̴̻͈͍͔̹̑͗̎̅͛́' 'Ǫ̵̹̻̝̳͂̌̌͘' '!͖̬̰̙̗̿̋ͥͥ̂ͣ̐́́͜͞'