About stdlib...
We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.
The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.
When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.
To join us in bringing numerical computing to the web, get started by checking us out on GitHub, and please consider financially supporting stdlib. We greatly appreciate your continued support!
Return the next extended grapheme cluster break in a string after a specified position.
npm install @stdlib/string-next-grapheme-cluster-breakAlternatively,
- To load the package in a website via a
scripttag without installation and bundlers, use the ES Module available on theesmbranch (see README). - If you are using Deno, visit the
denobranch (see README for usage intructions). - For use in Observable, or in browser/node environments, use the Universal Module Definition (UMD) build available on the
umdbranch (see README). - To use as a general utility for the command line, install the corresponding CLI package globally.
The branches.md file summarizes the available branches and displays a diagram illustrating their relationships.
To view installation and usage instructions specific to each branch build, be sure to explicitly navigate to the respective README files on each branch, as linked to above.
var nextGraphemeClusterBreak = require( '@stdlib/string-next-grapheme-cluster-break' );Returns the next extended grapheme cluster break in a string after a specified position.
var out = nextGraphemeClusterBreak( 'last man standing' );
// returns 1By default, the function searches for a grapheme cluster break starting from the first index. To specify an alternative starting search index, provide a fromIndex argument.
var out = nextGraphemeClusterBreak( 'last man standing', 4 );
// returns 5- If
stringis an empty string, the function returns-1irrespective offromIndex. - If an extended grapheme cluster break does not exist after
fromIndex, the function returns-1. - Note that
fromIndexdoes not refer to a visual character position, but to an index in the ordered sequence of UTF-16 code units.
var nextGraphemeClusterBreak = require( '@stdlib/string-next-grapheme-cluster-break' );
var out = nextGraphemeClusterBreak( 'last man standing', 4 );
// returns 5
out = nextGraphemeClusterBreak( 'presidential election', 8 );
// returns 9
out = nextGraphemeClusterBreak( 'अनुच्छेद', 1 );
// returns 3
out = nextGraphemeClusterBreak( '🌷', 0 );
// returns -1To use as a general utility, install the CLI package globally
npm install -g @stdlib/string-next-grapheme-cluster-break-cliUsage: next-grapheme-cluster-break [options] [<string>]
Options:
-h, --help Print this message.
-V, --version Print the package version.
--from index Starting search position in string. Default: 0.
$ next-grapheme-cluster-break --from=1 अनुच्छेद
3To use as a standard stream,
$ echo -n 'अनुच्छेद' | next-grapheme-cluster-break --from=1
3@stdlib/string-num-grapheme-clusters: return the number of grapheme clusters in a string.@stdlib/string-prev-grapheme-cluster-break: return the previous extended grapheme cluster break in a string before a specified position.
This package is part of stdlib, a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.
For more information on the project, filing bug reports and feature requests, and guidance on how to develop stdlib, see the main project repository.
See LICENSE.
Copyright © 2016-2024. The Stdlib Authors.
