From c85f5e8854dc4fb456eb5957da1abd38dca608e1 Mon Sep 17 00:00:00 2001 From: "github-actions[bot]" Date: Wed, 22 Jul 2026 10:02:36 +0000 Subject: [PATCH] Version Packages --- .changeset/heavy-grapes-accept.md | 9 --------- .changeset/six-jobs-speak.md | 8 -------- CHANGELOG.md | 15 +++++++++++++++ package.json | 2 +- 4 files changed, 16 insertions(+), 18 deletions(-) delete mode 100644 .changeset/heavy-grapes-accept.md delete mode 100644 .changeset/six-jobs-speak.md diff --git a/.changeset/heavy-grapes-accept.md b/.changeset/heavy-grapes-accept.md deleted file mode 100644 index 59d90f9..0000000 --- a/.changeset/heavy-grapes-accept.md +++ /dev/null @@ -1,9 +0,0 @@ ---- -"unicode-segmenter": patch ---- - -Add `collectGraphemes(input)` API that collects grapheme clusters into an array directly. - -This is a fast version of `[...splitGraphemes(input)]`, which is acually the most used pattern in practice. - -It's 2-4x faster than the iterator-based approach. However, it collects all grapheme clusters at once, so it's not good for large text or streamed input. diff --git a/.changeset/six-jobs-speak.md b/.changeset/six-jobs-speak.md deleted file mode 100644 index 020fe62..0000000 --- a/.changeset/six-jobs-speak.md +++ /dev/null @@ -1,8 +0,0 @@ ---- -"unicode-segmenter": patch ---- - -Promote `countGraphemes()` API to be a fast path. - -It avoids generator overhead and only counts boundaries without allocating segments. -When only counting, it achieves ~10x faster runtime performance and no GC pressure. diff --git a/CHANGELOG.md b/CHANGELOG.md index 0abad14..51c1ba8 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,5 +1,20 @@ # unicode-segmenter +## 0.17.1 + +### Patch Changes + +- e94d203: Add `collectGraphemes(input)` API that collects grapheme clusters into an array directly. + + This is a fast version of `[...splitGraphemes(input)]`, which is acually the most used pattern in practice. + + It's 2-4x faster than the iterator-based approach. However, it collects all grapheme clusters at once, so it's not good for large text or streamed input. + +- 5fcaa4f: Promote `countGraphemes()` API to be a fast path. + + It avoids generator overhead and only counts boundaries without allocating segments. + When only counting, it achieves ~10x faster runtime performance and no GC pressure. + ## 0.17.0 ### Minor Changes diff --git a/package.json b/package.json index 13054e6..a14a665 100644 --- a/package.json +++ b/package.json @@ -1,6 +1,6 @@ { "name": "unicode-segmenter", - "version": "0.17.0", + "version": "0.17.1", "type": "module", "description": "A lightweight implementation of the Unicode Text Segmentation (UAX #29)", "license": "MIT",