Array partial match (version 1) - JavaScript benchmark at JSBench.me

Please login/register to save & publish tests

- by 10basetom 5/28/202400

Setup HTML - click to add setup HTML

Setup JavaScript

const ARR = [
  'grinning_face_with_smiling_eyes',
  'face',
  'happy',
  'joy',
  'funny',
  'haha',
  'laugh',
  'like',
  ':D',
  ':)',
  'smile'
];

const STR = 'grinning_face_with_smiling_eyes, face, happy, joy, funny, haha, laugh, like, :D, :), smile';

const KW = 'hah';

ready

const arr = [];
for (const str of ARR) {
  arr.push(str);
}
arr.filter((s) => s.includes(KW)).length > 0;

DEFER

ready

const arr = [];
for (const str of ARR) {
  arr.push(str);
}
arr.filter((s) => s.indexOf(KW) > -1).length > 0;

DEFER

ready

const arr = [];
for (const str of ARR) {
  arr.push(str);
}
!!arr.find((s) => s.indexOf(KW) > -1);

DEFER

ready

const arr = [];
for (const str of ARR) {
  arr.push(str);
}
arr.findIndex((s) => s.includes(KW)) > -1;

DEFER

ready

const arr = [];
for (const str of ARR) {
  arr.push(str);
}
arr.findIndex((s) => s.indexOf(KW) > -1) > -1

DEFER

ready

const arr = [];
for (const str of ARR) {
  arr.push(str);
}
let isFound = false;
for (let i = 0; i < arr.length; ++i) {
  if (arr[i].indexOf(KW) > -1) {
    isFound = true;
    break;
  }
}

DEFER

ready

const arr = [];
for (const str of ARR) {
  arr.push(str);
}
let isFound = false;
for (const s of arr) {
  if (s.indexOf(KW) > -1) {
    isFound = true;
    break;
  }
}

DEFER

ready

const arr = [];
for (const str of ARR) {
  arr.push(str);
}
arr.join(' ').indexOf(KW) > -1;

DEFER

ready

let haystack = '';
for (const str of ARR) {
  haystack += str + ' ';
}
haystack.indexOf(KW) > -1;

DEFER

ready

let haystack = '';
for (const str of ARR) {
  haystack += str + ' ';
}
haystack.includes(KW);

DEFER

Test Case - click to add another test case

Teardown JS - click to add teardown JavaScript

Output (DOM) - click to monitor output (DOM) while test is running

RUN