-
Eduardo Sanz García authored
`Set` is a better data structure because it has a faster search: `Set.has` has a O(1) while `Array.includes` has a O(n).
91c4b724
`Set` is a better data structure because it has a faster search: `Set.has` has a O(1) while `Array.includes` has a O(n).
Name |
Last commit
|
Last update |
---|---|---|
.. | ||
integration | Loading commit data... | |
adder-test.js | Loading commit data... | |
annotation-counts-test.js | Loading commit data... | |
annotation-sync-test.js | Loading commit data... | |
bucket-bar-test.js | Loading commit data... | |
cross-frame-test.js | Loading commit data... | |
empty.html | Loading commit data... | |
features-test.js | Loading commit data... | |
frame-observer-test.js | Loading commit data... | |
guest-test.js | Loading commit data... | |
highlighter-test.js | Loading commit data... | |
notebook-test.js | Loading commit data... | |
range-util-test.js | Loading commit data... | |
selection-observer-test.js | Loading commit data... | |
sidebar-test.js | Loading commit data... | |
sidebar-trigger-test.js | Loading commit data... | |
toolbar-test.js | Loading commit data... |