Skip to content

Add an example to search for multi-byte pattern in an array #39479

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 24 commits into
base: main
Choose a base branch
from
+140 −0
Open

Add an example to search for multi-byte pattern in an array #39479

Changes from 1 commit
Commits
Show all changes
24 commits
Select commit Hold shift + click to select a range
29f071f
Add an example to search for multi-byte pattern in an array
def00111 May 11, 2025
163c953
Update index.md
def00111 May 11, 2025
3f50141
Update index.md
def00111 May 11, 2025
234d195
Update example
def00111 May 15, 2025
171cfe2
Update example
def00111 May 15, 2025
7610ab6
Update example
def00111 May 15, 2025
1a987e4
Update example
def00111 May 17, 2025
d376839
Update example
def00111 May 17, 2025
d1941c2
Update example
def00111 May 17, 2025
58c9c75
Update example
def00111 May 25, 2025
221205a
Update example
def00111 May 25, 2025
0f18979
Update example
def00111 May 25, 2025
a3861f4
Update example
def00111 May 25, 2025
ec57ec4
Update example
def00111 May 25, 2025
733a893
Update example
def00111 May 25, 2025
c090a53
Update example
def00111 May 28, 2025
cc8beca
Update example
def00111 May 28, 2025
55d6078
Apply suggestions from code review
def00111 May 28, 2025
a57ebc9
Update example
def00111 May 29, 2025
2f78c3a
Update example
def00111 May 30, 2025
66e0312
Apply suggestions from code review
def00111 May 30, 2025
9756534
Update example
def00111 May 30, 2025
1fc53ce
Update example
def00111 Jun 1, 2025
eef7882
Update example
def00111 Jun 1, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update example
  • Loading branch information
@def00111
def00111 authored May 25, 2025
commit 221205aea562bf6469e5fb58372928c6f3897d9c
16 changes: 8 additions & 8 deletions ...en-us/mozilla/add-ons/webextensions/api/webrequest/streamfilter/ondata/index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -318,11 +318,11 @@ browser.webRequest.onBeforeRequest.addListener(
This example demonstrates, how to search for multi-byte pattern in an array:
Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This example is very large now. Should it be on https://github.com/mdn/webextensions-examples?

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@def00111 yes, I think this is now getting to the point where we need to move it out of the documentation into a web extensions example.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I opened mdn/webextensions-examples#586


```js
// JavaScript program to search the pattern in given array
// JavaScript program to search the pattern in given array
// using KMP Algorithm

function constructLps(pat, lps) {
Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Taken from https://www.geeksforgeeks.org/kmp-algorithm-for-pattern-searching/

// len stores the length of longest prefix which
// len stores the length of longest prefix which
// is also a suffix for the previous index
let len = 0;

Expand All @@ -340,7 +340,7 @@ function constructLps(pat, lps) {
// If there is a mismatch
else {
if (len !== 0) {
// Update len to the previous lps value
// Update len to the previous lps value
// to avoid redundant comparisons
len = lps[len - 1];
} else {
Expand All @@ -361,7 +361,7 @@ function search(pat, arr) {

constructLps(pat, lps);

// Pointers i and j, for traversing
// Pointers i and j, for traversing
// the array and pattern
let i = 0;
let j = 0;
Expand All @@ -372,11 +372,11 @@ function search(pat, arr) {
i++;
j++;

// If the entire pattern is matched
// If the entire pattern is matched
// store the start index in result
if (j === m) {
res.push(i - j);
// Use LPS of previous index to
// Use LPS of previous index to
// skip unnecessary comparisons
j = lps[j - 1];
}
Expand All @@ -392,7 +392,7 @@ function search(pat, arr) {
}
}
}
return res;
return res;
}

const encoder = new TextEncoder();
Expand All @@ -404,7 +404,7 @@ function listener(details) {
const filter = browser.webRequest.filterResponseData(details.requestId);

const oldData = [];
filter.ondata = event => {
filter.ondata = (event) => {
const buffer = new Uint8Array(event.data);
let data = Array.from(buffer);
if (oldData.length) {
Expand Down