summaryrefslogtreecommitdiffstats
path: root/js/src/jit-test/tests/warp/string-tolowercase-latin1.js
blob: ff01d349c19ef568bb9bd6f679254c06fd5a3e0d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
// Test inline lower case conversion of ASCII / Latin-1 strings.

function* characters(...ranges) {
  for (let [start, end] of ranges) {
    for (let i = start; i <= end; ++i) {
      yield i;
    }
  }
}

const ascii_upper = [...characters(
  [0x41, 0x5A], // A..Z
  [0x30, 0x39], // 0..9
)];

const ascii_lower = [...characters(
  [0x61, 0x7A], // a..z
  [0x30, 0x39], // 0..9
)];

const latin1_upper = [...characters(
  [0xC0, 0xDE], // À..Þ
  [0x30, 0x39], // 0..9
)];

const latin1_lower = [...characters(
  [0xDF, 0xFF], // ß..ÿ
)];

for (let upper of [ascii_upper, latin1_upper]) {
  let s = String.fromCodePoint(...upper);
  assertEq(isLatin1(s), true);
  assertEq(s, s.toUpperCase());
}

for (let lower of [ascii_lower, latin1_lower]) {
  let s = String.fromCodePoint(...lower);
  assertEq(isLatin1(s), true);
  assertEq(s, s.toLowerCase());
}

function toRope(s) {
  // Ropes have at least two characters.
  if (s.length < 2) {
    return s;
  }
  if (s.length === 2) {
    return newRope(s[0], s[1]);
  }
  return newRope(s[0], s.substring(1));
}

for (let i = 0; i <= 32; ++i) {
  let strings = [ascii_upper, ascii_lower, latin1_upper, latin1_lower].flatMap(codePoints => [
    String.fromCodePoint(...codePoints.slice(0, i)),

    // Trailing ASCII upper case character.
    String.fromCodePoint(...codePoints.slice(0, i)) + "A",

    // Trailing ASCII lower case character.
    String.fromCodePoint(...codePoints.slice(0, i)) + "a",

    // Trailing Latin-1 upper case character.
    String.fromCodePoint(...codePoints.slice(0, i)) + "À",

    // Trailing Latin-1 lower case character.
    String.fromCodePoint(...codePoints.slice(0, i)) + "ß",
  ]).flatMap(x => [
    x,
    toRope(x),
    newString(x, {twoByte: true}),
  ]);

  const expected = strings.map(x => {
    // Prevent Warp compilation when computing the expected results.
    with ({}) ;
    return x.toLowerCase();
  });

  for (let i = 0; i < 1000; ++i) {
    let idx = i % strings.length;
    let str = strings[idx];

    let actual = str.toLowerCase();
    if (actual !== expected[idx]) throw new Error();
  }
}