Benchmark: Trimming leading/trailing characters Bounds Fix2

Script Preparation code:

var TestString = '+'.repeat(2) + '='.repeat(20) + '+'.repeat(1);

var regexTrim = function(str, ch) {
    if (ch === ']') ch = '\\]';
    else if (ch === '^') ch = '\\^';
    else if (ch === '\\') ch = '\\\\';
    return str.replace(new RegExp('^[' + ch + ']+|[' + ch + ']+$', 'g'), '');
};

function indexTrim(str, ch) {
    var start = 0, 
        end = str.length;

    while(start < end && str[start] === ch)
        ++start;

    while(end > start && str[end - 1] === ch)
        --end;

    return (start > 0 || end < str.length) ? str.substring(start, end) : str;
}

function indexTrimB(str, ch) {
    var start = 0, 
        end = str.length - 1;

    while(start <= end && str[start] === ch)
        ++start;

    while(end >= start && str[end] === ch)
        --end;

    return start > 0 || end + 1 < str.length ? str.substring(start, end + 1) : str;
}

function booleanTrim(str, ch) {
    return str.split(ch).filter(Boolean).join(ch);
}

function spreadTrim(str, ch) {
    const first = [...str].findIndex(char => char !== ch);
    const last = [...str].reverse().findIndex(char => char !== ch);
    return str.substring(first, str.length - last);
}

function substringTrim(str, ch) {
    while(str.charAt(0)==ch) {
        str = str.substring(1);
    }

    while(str.charAt(str.length-1)==ch) {
        str = str.substring(0,str.length-1);
    }

    return str;
}

​x
 
var TestString = '+'.repeat(2) + '='.repeat(20) + '+'.repeat(1);​var regexTrim = function(str, ch) {    if (ch === ']') ch = '\\]';    else if (ch === '^') ch = '\\^';    else if (ch === '\\') ch = '\\\\';    return str.replace(new RegExp('^[' + ch + ']+|[' + ch + ']+$', 'g'), '');};​function indexTrim(str, ch) {    var start = 0,         end = str.length;​    while(start < end && str[start] === ch)        ++start;​    while(end > start && str[end - 1] === ch)        --end;​    return (start > 0 || end < str.length) ? str.substring(start, end) : str;}​function indexTrimB(str, ch) {    var start = 0,         end = str.length - 1;​    while(start <= end && str[start] === ch)        ++start;​    while(end >= start && str[end] === ch)        --end;​    return start > 0 || end + 1 < str.length ? str.substring(start, end + 1) : str;}​function booleanTrim(str, ch) {    return str.split(ch).filter(Boolean).join(ch);}​function spreadTrim(str, ch) {    const first = [...str].findIndex(char => char !== ch);    const last = [...str].reverse().findIndex(char => char !== ch);    return str.substring(first, str.length - last);}​function substringTrim(str, ch) {    while(str.charAt(0)==ch) {        str = str.substring(1);    }​    while(str.charAt(str.length-1)==ch) {        str = str.substring(0,str.length-1);    }​    return str;}

Tests:

Index Version (Jason Larke)
indexTrim(TestString, '+');
indexTrim(TestString, '+');
Regex Version (leaf)
regexTrim(TestString, '+')
regexTrim(TestString, '+')
Boolean Filter Version (mbaer3000)
booleanTrim(TestString, '+')
booleanTrim(TestString, '+')
Spread Version (Robin F.)
spreadTrim(TestString, '+')
spreadTrim(TestString, '+')
Substring Version (Pho3niX83)
substringTrim(TestString, '+')
substringTrim(TestString, '+')
Index Version (Jason Larke) B
indexTrimB(TestString, '+');
indexTrimB(TestString, '+');

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Experimental features:

Memory measurements supported only in Chrome.
For precise memory measurements Chrome must be launched with --enable-precise-memory-info flag.
More information: Monitoring JavaScript Memory

Test case name	Result
Index Version (Jason Larke)
Regex Version (leaf)
Boolean Filter Version (mbaer3000)
Spread Version (Robin F.)
Substring Version (Pho3niX83)
Index Version (Jason Larke) B

Fastest: N/A

Slowest: N/A

Latest run results:

Run details: (Test run date: 3 years ago)

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/91.0.4472.114 Safari/537.36 Edg/91.0.864.59

Browser/OS: Chrome 91 on Windows

View result in a separate tab

Test name	Executions per second
Index Version (Jason Larke)	5892355.5 Ops/sec
Regex Version (leaf)	1718431.1 Ops/sec
Boolean Filter Version (mbaer3000)	1436345.2 Ops/sec
Spread Version (Robin F.)	1809522.8 Ops/sec
Substring Version (Pho3niX83)	5123789.0 Ops/sec
Index Version (Jason Larke) B	5859019.0 Ops/sec

Autogenerated LLM Summary (model llama3.2:3b, generated 4 months ago):

I'll break down the benchmark and its test cases to explain what's being tested.

Benchmark Definition

The benchmark definition is a JSON object that describes how to run a JavaScript script on MeasureThat.net. It contains three main parts:

Script Preparation Code: This code defines a function regexTrim that takes two arguments: str and ch. The function uses a regular expression to trim the leading and trailing characters of the input string str, specified by character ch.
Html Preparation Code: This field is empty, which means no HTML-specific preparation is required for this benchmark.
Benchmark Definition: This field specifies the actual JavaScript code that will be executed as part of the benchmark.

Individual Test Cases

There are six test cases, each representing a different implementation of string trimming:

Index Version (Jason Larke): Uses two while loops to find and remove leading and trailing occurrences of the specified character ch from the input string str.
Regex Version (leaf): Employs a regular expression to trim the leading and trailing characters of the input string str, specified by character ch.
Boolean Filter Version (mbaer3000): Utilizes the split() method, filtering out empty strings created when removing leading or trailing occurrences of ch.
Spread Version (Robin F.): Employes two methods: one to find the index of the first occurrence of ch from the start of the string, and another to find the index of the last occurrence of ch from the end of the string. Then it uses spread operator to trim.
Substring Version (Pho3niX83): Uses two while loops to remove leading and trailing occurrences of ch from the input string str, which modifies the original string.
Index Version (Jason Larke) B: Similar to the first Index Version, but with slightly different variable names.

Test Results

The benchmark results show the number of executions per second for each test case on a specific browser and device platform (Chrome 91 on Windows).

Key Observations

The Index Versions (A and B) have relatively similar performance.
The Regex Version has a lower execution rate compared to the other implementations.
The Boolean Filter Version and Spread Version have higher execution rates than the Regex Version, but are slightly slower than the Index Versions.
The Substring Version is the slowest of all.

Overall, this benchmark highlights the differences in implementation details and their impact on performance.

LLMs can make mistakes. Check important info.

I'll break down the benchmark and its test cases to explain what's being tested.

**Benchmark Definition**

The benchmark definition is a JSON object that describes how to run a JavaScript script on MeasureThat.net. It contains three main parts:

1. **Script Preparation Code**: This code defines a function `regexTrim` that takes two arguments: `str` and `ch`. The function uses a regular expression to trim the leading and trailing characters of the input string `str`, specified by character `ch`.
2. **Html Preparation Code**: This field is empty, which means no HTML-specific preparation is required for this benchmark.
3. **Benchmark Definition**: This field specifies the actual JavaScript code that will be executed as part of the benchmark.

**Individual Test Cases**

There are six test cases, each representing a different implementation of string trimming:

1. **Index Version (Jason Larke)**: Uses two while loops to find and remove leading and trailing occurrences of the specified character `ch` from the input string `str`.
2. **Regex Version (leaf)**: Employs a regular expression to trim the leading and trailing characters of the input string `str`, specified by character `ch`.
3. **Boolean Filter Version (mbaer3000)**: Utilizes the `split()` method, filtering out empty strings created when removing leading or trailing occurrences of `ch`.
4. **Spread Version (Robin F.)**: Employes two methods: one to find the index of the first occurrence of `ch` from the start of the string, and another to find the index of the last occurrence of `ch` from the end of the string. Then it uses spread operator to trim.
5. **Substring Version (Pho3niX83)**: Uses two while loops to remove leading and trailing occurrences of `ch` from the input string `str`, which modifies the original string.
6. **Index Version (Jason Larke) B**: Similar to the first Index Version, but with slightly different variable names.

**Test Results**

The benchmark results show the number of executions per second for each test case on a specific browser and device platform (Chrome 91 on Windows).

**Key Observations**

* The Index Versions (A and B) have relatively similar performance.
* The Regex Version has a lower execution rate compared to the other implementations.
* The Boolean Filter Version and Spread Version have higher execution rates than the Regex Version, but are slightly slower than the Index Versions.
* The Substring Version is the slowest of all.

Overall, this benchmark highlights the differences in implementation details and their impact on performance.

Related benchmarks:

Trimming leading/trailing characters Bounds Fix2 (version: 0)

Comparing performance of: Index Version (Jason Larke) vs Regex Version (leaf) vs Boolean Filter Version (mbaer3000) vs Spread Version (Robin F.) vs Substring Version (Pho3niX83) vs Index Version (Jason Larke) B

Created: 3 years ago by: Guest

Jump to the latest result

Index Version (Jason Larke)

Regex Version (leaf)

Boolean Filter Version (mbaer3000)

Spread Version (Robin F.)

Substring Version (Pho3niX83)

Index Version (Jason Larke) B

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

Autogenerated LLM Summary (model llama3.2:3b, generated 4 months ago):