Skip to content

Commit aa2ac4c

Browse files
committed
NotFound -> Unknown
1 parent e76fb73 commit aa2ac4c

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

50 files changed

+2155
-2155
lines changed

jscomp/core/lam_compile.ml

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -521,11 +521,11 @@ and compile_cases ~is_tag cxt switch_exp table default names =
521521
if names.Lam.consts = [| "Constant" |] then None else
522522
match (if is_tag then names.Lam.blocks.(i) else names.consts.(i)) with
523523
| s -> Some s
524-
| exception Invalid_argument _ -> Some "NotFound")
524+
| exception Invalid_argument _ -> Some "Unknown")
525525
(fun i ->
526526
let comment = match (if is_tag then names.Lam.blocks.(i) else names.consts.(i)) with
527527
| s -> Some s
528-
| exception Invalid_argument _ -> Some "NotFound" in
528+
| exception Invalid_argument _ -> Some "Unknown" in
529529
{(E.small_int i) with comment})
530530
E.int_equal
531531
cxt

jscomp/test/arith_lexer.js

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -25,26 +25,26 @@ function __ocaml_lex_lexeme_rec(lexbuf, ___ocaml_lex_state) {
2525
var __ocaml_lex_state = ___ocaml_lex_state;
2626
var __ocaml_lex_state$1 = Lexing.engine(__ocaml_lex_tables, __ocaml_lex_state, lexbuf);
2727
switch (__ocaml_lex_state$1) {
28-
case /* NotFound */0 :
28+
case /* Unknown */0 :
2929
___ocaml_lex_state = 0;
3030
continue ;
31-
case /* NotFound */1 :
31+
case /* Unknown */1 :
3232
return /* NUMERAL */Block.__(0, [Caml_format.caml_int_of_string(Lexing.lexeme(lexbuf))]);
33-
case /* NotFound */2 :
33+
case /* Unknown */2 :
3434
return /* IDENT */Block.__(1, [Lexing.lexeme(lexbuf)]);
35-
case /* NotFound */3 :
35+
case /* Unknown */3 :
3636
return /* PLUS */0;
37-
case /* NotFound */4 :
37+
case /* Unknown */4 :
3838
return /* MINUS */1;
39-
case /* NotFound */5 :
39+
case /* Unknown */5 :
4040
return /* TIMES */2;
41-
case /* NotFound */6 :
41+
case /* Unknown */6 :
4242
return /* DIVIDE */3;
43-
case /* NotFound */7 :
43+
case /* Unknown */7 :
4444
return /* LPAREN */5;
45-
case /* NotFound */8 :
45+
case /* Unknown */8 :
4646
return /* RPAREN */6;
47-
case /* NotFound */9 :
47+
case /* Unknown */9 :
4848
return /* EOF */7;
4949
default:
5050
Curry._1(lexbuf[/* refill_buff */0], lexbuf);

jscomp/test/arity_infer.js

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -23,22 +23,22 @@ function f1(x) {
2323
function f3(x) {
2424
var tmp;
2525
switch (x) {
26-
case /* NotFound */0 :
26+
case /* Unknown */0 :
2727
tmp = (function (x) {
2828
return x + 1 | 0;
2929
});
3030
break;
31-
case /* NotFound */1 :
31+
case /* Unknown */1 :
3232
tmp = (function (x) {
3333
return x + 2 | 0;
3434
});
3535
break;
36-
case /* NotFound */2 :
36+
case /* Unknown */2 :
3737
tmp = (function (x) {
3838
return x + 3 | 0;
3939
});
4040
break;
41-
case /* NotFound */3 :
41+
case /* Unknown */3 :
4242
tmp = (function (x) {
4343
return x + 4 | 0;
4444
});

jscomp/test/complex_if_test.js

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -62,34 +62,34 @@ function escaped(s) {
6262
exit = 1;
6363
} else {
6464
switch (c) {
65-
case /* NotFound */8 :
65+
case /* Unknown */8 :
6666
s$prime[n] = /* "\\" */92;
6767
n = n + 1 | 0;
6868
s$prime[n] = /* "b" */98;
6969
break;
70-
case /* NotFound */9 :
70+
case /* Unknown */9 :
7171
s$prime[n] = /* "\\" */92;
7272
n = n + 1 | 0;
7373
s$prime[n] = /* "t" */116;
7474
break;
75-
case /* NotFound */10 :
75+
case /* Unknown */10 :
7676
s$prime[n] = /* "\\" */92;
7777
n = n + 1 | 0;
7878
s$prime[n] = /* "n" */110;
7979
break;
80-
case /* NotFound */0 :
81-
case /* NotFound */1 :
82-
case /* NotFound */2 :
83-
case /* NotFound */3 :
84-
case /* NotFound */4 :
85-
case /* NotFound */5 :
86-
case /* NotFound */6 :
87-
case /* NotFound */7 :
88-
case /* NotFound */11 :
89-
case /* NotFound */12 :
80+
case /* Unknown */0 :
81+
case /* Unknown */1 :
82+
case /* Unknown */2 :
83+
case /* Unknown */3 :
84+
case /* Unknown */4 :
85+
case /* Unknown */5 :
86+
case /* Unknown */6 :
87+
case /* Unknown */7 :
88+
case /* Unknown */11 :
89+
case /* Unknown */12 :
9090
exit = 1;
9191
break;
92-
case /* NotFound */13 :
92+
case /* Unknown */13 :
9393
s$prime[n] = /* "\\" */92;
9494
n = n + 1 | 0;
9595
s$prime[n] = /* "r" */114;

jscomp/test/exception_rebound_err_test.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -49,7 +49,7 @@ function test_js_error4(param) {
4949
} else {
5050
exit = 2;
5151
}
52-
if (exit === /* NotFound */2 && e[0] === A && e[1] === 2) {
52+
if (exit === /* Unknown */2 && e[0] === A && e[1] === 2) {
5353
return 4;
5454
}
5555
if (e === B) {

jscomp/test/ext_bytes_test.js

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -64,34 +64,34 @@ function escaped(s) {
6464
exit = 1;
6565
} else {
6666
switch (c) {
67-
case /* NotFound */8 :
67+
case /* Unknown */8 :
6868
s$prime[n] = /* "\\" */92;
6969
n = n + 1 | 0;
7070
s$prime[n] = /* "b" */98;
7171
break;
72-
case /* NotFound */9 :
72+
case /* Unknown */9 :
7373
s$prime[n] = /* "\\" */92;
7474
n = n + 1 | 0;
7575
s$prime[n] = /* "t" */116;
7676
break;
77-
case /* NotFound */10 :
77+
case /* Unknown */10 :
7878
s$prime[n] = /* "\\" */92;
7979
n = n + 1 | 0;
8080
s$prime[n] = /* "n" */110;
8181
break;
82-
case /* NotFound */0 :
83-
case /* NotFound */1 :
84-
case /* NotFound */2 :
85-
case /* NotFound */3 :
86-
case /* NotFound */4 :
87-
case /* NotFound */5 :
88-
case /* NotFound */6 :
89-
case /* NotFound */7 :
90-
case /* NotFound */11 :
91-
case /* NotFound */12 :
82+
case /* Unknown */0 :
83+
case /* Unknown */1 :
84+
case /* Unknown */2 :
85+
case /* Unknown */3 :
86+
case /* Unknown */4 :
87+
case /* Unknown */5 :
88+
case /* Unknown */6 :
89+
case /* Unknown */7 :
90+
case /* Unknown */11 :
91+
case /* Unknown */12 :
9292
exit = 1;
9393
break;
94-
case /* NotFound */13 :
94+
case /* Unknown */13 :
9595
s$prime[n] = /* "\\" */92;
9696
n = n + 1 | 0;
9797
s$prime[n] = /* "r" */114;

0 commit comments

Comments
 (0)