forked from jsdom/jsdom
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
See jsdom#1129.
- Loading branch information
Showing
9 changed files
with
317 additions
and
258 deletions.
There are no files selected for viewing
This file was deleted.
Oops, something went wrong.
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,104 @@ | ||
"use strict"; | ||
|
||
// https://infra.spec.whatwg.org/#sets | ||
// | ||
// Only use this class if a Set cannot be used, e.g. when "replace" operation is needed, since there's no way to replace | ||
// an element while keep the relative order using a Set, only remove and then add something at the end. | ||
|
||
module.exports = class OrderedSet { | ||
constructor() { | ||
this._items = []; | ||
} | ||
|
||
append(item) { | ||
if (!this.contains(item)) { | ||
this._items.push(item); | ||
} | ||
} | ||
|
||
prepend(item) { | ||
if (!this.contains(item)) { | ||
this._items.unshift(item); | ||
} | ||
} | ||
|
||
replace(item, replacement) { | ||
let seen = false; | ||
for (let i = 0; i < this._items.length;) { | ||
const isInstance = this._items[i] === item || this._items[i] === replacement; | ||
if (seen && isInstance) { | ||
this._items.splice(i, 1); | ||
} else { | ||
if (isInstance) { | ||
this._items[i] = replacement; | ||
seen = true; | ||
} | ||
i++; | ||
} | ||
} | ||
} | ||
|
||
remove(...items) { | ||
this.removePredicate(item => items.includes(item)); | ||
} | ||
|
||
removePredicate(predicate) { | ||
for (let i = 0; i < this._items.length;) { | ||
if (predicate(this._items[i])) { | ||
this._items.splice(i, 1); | ||
} else { | ||
i++; | ||
} | ||
} | ||
} | ||
|
||
empty() { | ||
this._items.length = 0; | ||
} | ||
|
||
contains(item) { | ||
return this._items.includes(item); | ||
} | ||
|
||
get size() { | ||
return this._items.length; | ||
} | ||
|
||
isEmpty() { | ||
return this._items.length === 0; | ||
} | ||
|
||
// Useful for other parts of jsdom | ||
|
||
[Symbol.iterator]() { | ||
return this._items[Symbol.iterator](); | ||
} | ||
|
||
keys() { | ||
return this._items.keys(); | ||
} | ||
|
||
get(index) { | ||
return this._items[index]; | ||
} | ||
|
||
some(func) { | ||
return this._items.some(func); | ||
} | ||
|
||
// https://dom.spec.whatwg.org/#concept-ordered-set-parser | ||
static parse(input) { | ||
const tokens = new OrderedSet(); | ||
for (const token of input.split(/[\t\n\f\r ]+/)) { | ||
if (token) { | ||
tokens.append(token); | ||
} | ||
} | ||
return tokens; | ||
} | ||
|
||
// https://dom.spec.whatwg.org/#concept-ordered-set-serializer | ||
serialize() { | ||
return this._items.join(" "); | ||
} | ||
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.