File tree Expand file tree Collapse file tree 2 files changed +6
-6
lines changed Expand file tree Collapse file tree 2 files changed +6
-6
lines changed Original file line number Diff line number Diff line change @@ -45,7 +45,7 @@ function* candidatePermutations(candidate) {
45
45
let bracketIdx = candidate . indexOf ( '[' )
46
46
47
47
// If character before `[` isn't a dash or a slash, this isn't a dynamic class
48
- // eg . string[]
48
+ // e.g . string[]
49
49
if ( candidate [ bracketIdx - 1 ] === '-' ) {
50
50
dashIdx = bracketIdx - 1
51
51
} else if ( candidate [ bracketIdx - 1 ] === '/' ) {
@@ -455,9 +455,9 @@ function isParsableNode(node) {
455
455
}
456
456
457
457
function isParsableCssValue ( property , value ) {
458
- // We don't want to to treat [https://example.com] as a custom property
458
+ // We don't want to treat [https://example.com] as a custom property
459
459
// Even though, according to the CSS grammar, it's a totally valid CSS declaration
460
- // So we short-circuit here by checking if the custom property looks like a url
460
+ // So we short-circuit here by checking if the custom property looks like a URL
461
461
if ( looksLikeUri ( `${ property } :${ value } ` ) ) {
462
462
return false
463
463
}
Original file line number Diff line number Diff line change @@ -23,7 +23,7 @@ import { remapBitfield } from './remap-bitfield.js'
23
23
* @property {bigint } arbitrary 0n if false, 1n if true
24
24
* @property {bigint } variants Dynamic size. 1 bit per registered variant. 0n means no variants
25
25
* @property {bigint } parallelIndex Rule index for the parallel variant. 0 if not applicable.
26
- * @property {bigint } index Index of the rule / utility in it's given *parent* layer. Monotonically increasing.
26
+ * @property {bigint } index Index of the rule / utility in its given *parent* layer. Monotonically increasing.
27
27
* @property {VariantOption[] } options Some information on how we can sort arbitrary variants
28
28
*/
29
29
@@ -302,7 +302,7 @@ export class Offsets {
302
302
let mapping = this . recalculateVariantOffsets ( )
303
303
304
304
// No arbitrary variants? Nothing to do.
305
- // Everyhing already in order? Nothing to do.
305
+ // Everything already in order? Nothing to do.
306
306
if ( mapping . length === 0 ) {
307
307
return list
308
308
}
@@ -354,7 +354,7 @@ function max(nums) {
354
354
* Using `.sort()` without a custom compare function is faster
355
355
* But you can only use that if you're sorting an array of
356
356
* only strings. If you're sorting strings inside objects
357
- * or arrays, you need must use a custom compare function.
357
+ * or arrays, you need to use a custom compare function.
358
358
*
359
359
* @param {string } a
360
360
* @param {string } b
You can’t perform that action at this time.
0 commit comments