boa_engine 0.21.1

Boa is a Javascript lexer, parser and compiler written in Rust. Currently, it has support for some of the language.
Documentation 
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173

use crate::vm::source_info::find_entry;

use super::Entry;

#[test]
fn find_empty() {
    let entries = &[];

    assert_eq!(find_entry(entries, 0), None);
}

#[test]
fn find_unit_ranges() {
    let entries = &[
        Entry {
            pc: 0,
            position: Some((1, 1).into()),
        },
        Entry {
            pc: 1,
            position: Some((2, 1).into()),
        },
        Entry {
            pc: 2,
            position: Some((3, 1).into()),
        },
        Entry {
            pc: 3,
            position: Some((4, 1).into()),
        },
    ];

    assert_eq!(find_entry(entries, 0), Some((1, 1).into()));
    assert_eq!(find_entry(entries, 1), Some((2, 1).into()));
    assert_eq!(find_entry(entries, 2), Some((3, 1).into()));
    assert_eq!(find_entry(entries, 3), Some((4, 1).into()));

    assert_eq!(find_entry(entries, 4), Some((4, 1).into()));
    assert_eq!(find_entry(entries, u32::MAX), Some((4, 1).into()));
}

#[test]
fn find_before_first_entry() {
    let entries = &[Entry {
        pc: 10,
        position: Some((1, 1).into()),
    }];

    assert_eq!(find_entry(entries, 0), None);
    assert_eq!(find_entry(entries, 5), None);
    assert_eq!(find_entry(entries, 10), Some((1, 1).into()));
}

#[test]
fn find_past_last_entry() {
    let entries = &[Entry {
        pc: 0,
        position: Some((1, 1).into()),
    }];

    assert_eq!(find_entry(entries, 0), Some((1, 1).into()));
    assert_eq!(find_entry(entries, 10), Some((1, 1).into()));
    assert_eq!(find_entry(entries, u32::MAX), Some((1, 1).into()));
}

#[test]
fn find_wide_spaced_ranges_odd() {
    let entries = &[
        Entry {
            pc: 0,
            position: Some((1, 1).into()),
        },
        Entry {
            pc: 10,
            position: Some((2, 1).into()),
        },
        Entry {
            pc: 20,
            position: Some((3, 1).into()),
        },
        Entry {
            pc: 30,
            position: Some((4, 1).into()),
        },
    ];

    assert_eq!(find_entry(entries, 0), Some((1, 1).into()));
    assert_eq!(find_entry(entries, 5), Some((1, 1).into()));
    assert_eq!(find_entry(entries, 9), Some((1, 1).into()));

    assert_eq!(find_entry(entries, 10), Some((2, 1).into()));
    assert_eq!(find_entry(entries, 15), Some((2, 1).into()));
    assert_eq!(find_entry(entries, 19), Some((2, 1).into()));

    assert_eq!(find_entry(entries, 20), Some((3, 1).into()));
    assert_eq!(find_entry(entries, 25), Some((3, 1).into()));
    assert_eq!(find_entry(entries, 29), Some((3, 1).into()));

    assert_eq!(find_entry(entries, 30), Some((4, 1).into()));
    assert_eq!(find_entry(entries, 35), Some((4, 1).into()));
    assert_eq!(find_entry(entries, 39), Some((4, 1).into()));
}

#[test]
fn find_wide_spaced_ranges_even() {
    let entries = &[
        Entry {
            pc: 0,
            position: Some((1, 1).into()),
        },
        Entry {
            pc: 10,
            position: Some((2, 1).into()),
        },
        Entry {
            pc: 20,
            position: Some((3, 1).into()),
        },
        Entry {
            pc: 30,
            position: Some((4, 1).into()),
        },
        Entry {
            pc: 40,
            position: Some((5, 1).into()),
        },
    ];

    assert_eq!(find_entry(entries, 0), Some((1, 1).into()));
    assert_eq!(find_entry(entries, 5), Some((1, 1).into()));
    assert_eq!(find_entry(entries, 9), Some((1, 1).into()));

    assert_eq!(find_entry(entries, 10), Some((2, 1).into()));
    assert_eq!(find_entry(entries, 15), Some((2, 1).into()));
    assert_eq!(find_entry(entries, 19), Some((2, 1).into()));

    assert_eq!(find_entry(entries, 20), Some((3, 1).into()));
    assert_eq!(find_entry(entries, 25), Some((3, 1).into()));
    assert_eq!(find_entry(entries, 29), Some((3, 1).into()));

    assert_eq!(find_entry(entries, 30), Some((4, 1).into()));
    assert_eq!(find_entry(entries, 35), Some((4, 1).into()));
    assert_eq!(find_entry(entries, 39), Some((4, 1).into()));

    assert_eq!(find_entry(entries, 40), Some((5, 1).into()));
    assert_eq!(find_entry(entries, 45), Some((5, 1).into()));
    assert_eq!(find_entry(entries, 49), Some((5, 1).into()));
}

#[test]
fn find_with_single_entry() {
    let entries = &[
        Entry {
            pc: 22,
            position: Some((1, 1).into()),
        },
        Entry {
            pc: 33,
            position: None,
        },
    ];

    assert_eq!(find_entry(entries, 0), None);
    assert_eq!(find_entry(entries, 10), None);
    assert_eq!(find_entry(entries, 21), None);

    assert_eq!(find_entry(entries, 22), Some((1, 1).into()));
    assert_eq!(find_entry(entries, 30), Some((1, 1).into()));
    assert_eq!(find_entry(entries, 32), Some((1, 1).into()));

    assert_eq!(find_entry(entries, 33), None);
    assert_eq!(find_entry(entries, u32::MAX), None);
}