
Security News
Official Go SDK for MCP in Development, Stable Release Expected in August
The official Go SDK for the Model Context Protocol is in development, with a stable, production-ready release expected by August 2025.
es-string-algorithm
Advanced tools
C++ STL provide find_first_of
/ find_first_not_of
/ find_last_of
/ find_last_not_of
member function.
However, JavaScript String
class does not provide such method. So, this package provide these functions.
(When you want find
/ rfind
that C++ STL provide, please use indexOf
/ lastIndexOf
)
Every function manipulate a string as if that is UTF-32 encoded.
To describe simply, we use two function like below:
size(s: string) => number
: Returns the length of s
.at(s: string, n: number) => string
: Returns n
th charactor.export declare const findFirstOf: (target: string, key: string, pos?: number, n?: number | undefined) => number;
Determines the lowest position xpos
, if possible, such that both of the following conditions hold:
pos <= xpos
and xpos < size(target)
k.includes(at(target, xpos))
(When n
is undefined
(omitted), k
is equal to key
. Otherwise, k
is equal to key.substring(0, n)
)target
: search target stringkey
: string identifying characters to search forpos = 0
: position at which to begin searchingn
(opt): length of character string identifying characters to search forxpos
if the function can determine such a value for xpos
. Otherwise, returns -1
.
const std = require('es-string-algorithm');
const s = 'Hello, world. Welcome to C++ world.';
const str = 'world';
console.log(std.findFirstOf(s, str, 14));// => 16
console.log(std.findFirstOf(s, ',.+', 14));// => 26
console.log(std.findFirstOf('arikitari na sekai', 'a', 1));// => 6
console.log(std.findFirstOf('🍣🍺', '🍺'));// => 1
export declare const findLastof: (target: string, key: string, pos?: number, n?: number | undefined) => number;
Determines the highest position xpos
, if possible, such that both of the following conditions hold:
pos <= xpos
and xpos < size(target)
k.includes(at(target, xpos))
(When n
is undefined
(omitted), k
is equal to key
. Otherwise, k
is equal to key.substring(0, n)
)target
: search target stringkey
: string identifying characters to search forpos = -1
: position at which the search is to finish. -1
is equal to the length of search target stringn
(opt): length of character string identifying characters to search forxpos
if the function can determine such a value for xpos
. Otherwise, returns -1
.
const std = require('es-string-algorithm');
const s = 'Hello, world. Welcome to C++ world.';
const str = 'world';
console.log(std.findLastof(s, str, 25));// => 23
console.log(std.findLastof(s, ',.+', 5));// => 5
console.log(std.findLastof('arikitari na sekai', 'a', 1));// => 0
console.log(std.findLastof('🍣🍺', '🍺'));// => 1
export declare const findFirstNotOf: (target: string, key: string, pos?: number, n?: number | undefined) => number;
Determines the lowest position xpos
, if possible, such that both of the following conditions hold:
pos <= xpos
and xpos < size(target)
!k.includes(at(target, xpos))
(When n
is undefined
(omitted), k
is equal to key
. Otherwise, k
is equal to key.substring(0, n)
)target
: search target stringkey
: string identifying characters to search forpos = 0
: position at which to begin searchingn
(opt): length of character string identifying characters to search forxpos
if the function can determine such a value for xpos
. Otherwise, returns -1
.
const std = require('es-string-algorithm');
const s = 'Hello, world. Welcome to C++ world.';
const str = 'world';
console.log(std.findFirstNotOf(s, str, 2));// => 5
console.log(std.findFirstNotOf(s, 'worlde,. ', 1));// => 14
console.log(std.findFirstNotOf('arikitari na sekai datta', 't', 21));// => 23
console.log(std.findFirstNotOf('🍣🍺', '🍣'));// => 1
export declare const findLastNotof: (target: string, key: string, pos?: number, n?: number | undefined) => number;
Determines the highest position xpos
, if possible, such that both of the following conditions hold:
pos <= xpos
and xpos < size(target)
k.includes(at(target, xpos))
(When n
is undefined
(omitted), k
is equal to key
. Otherwise, k
is equal to key.substring(0, n)
)target
: search target stringkey
: string identifying characters to search forpos = -1
: position at which the search is to finish. -1
is equal to the length of search target stringn
(opt): length of character string identifying characters to search forxpos
if the function can determine such a value for xpos
. Otherwise, returns -1
.
const std = require('es-string-algorithm');
const s = 'Hello, world. Welcome to C++ world.';
const str = 'world';
console.log(std.findLastNotof(s, str, 11));// => 6
console.log(std.findLastNotof(s, 'Welcome to C++ world.', 1));// => 5
console.log(std.findLastNotof('arikitari na sekai', 'a', 0));// => -1
console.log(std.findLastNotof('🍣🍺', '🍺'));// => 0
FAQs
port from C++STL std::basic_string
The npm package es-string-algorithm receives a total of 14 weekly downloads. As such, es-string-algorithm popularity was classified as not popular.
We found that es-string-algorithm demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
The official Go SDK for the Model Context Protocol is in development, with a stable, production-ready release expected by August 2025.
Security News
New research reveals that LLMs often fake understanding, passing benchmarks but failing to apply concepts or stay internally consistent.
Security News
Django has updated its security policies to reject AI-generated vulnerability reports that include fabricated or unverifiable content.