Skip to content

Commit 8b66588

Browse files
committed
fix compile issues
1 parent 6def4cc commit 8b66588

File tree

6 files changed

+9
-9
lines changed

6 files changed

+9
-9
lines changed

math/q_rsqrt.jule

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -7,8 +7,8 @@ fn QRsqrt(mut f: f64): f64 {
77
const Magic = 0x5FE6EB50C7B537A9
88

99
let n2 = f * 0.5
10-
let b = Magic - (math::F64Bits(f) >> 1)
11-
f = math::F64FromBits(b)
10+
let b = Magic - (math::F64bits(f) >> 1)
11+
f = math::F64frombits(b)
1212
f *= ThreeHalfs - (n2 * f * f)
1313
ret f
1414
}

math/q_rsqrt_test.jule

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
use "std/testing"
44

5-
static casesQRsqrt: [][]f64 = [
5+
let casesQRsqrt: [][]f64 = [
66
[90, 0.10530667845276515],
77
[987743, 0.001004453602645671],
88
[2, 0.706929650795464],

search/testcases_test.jule

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ struct searchTest {
1010

1111
// Note that these are immutable therefore they are shared among all the search tests.
1212
// If your algorithm is mutating these then it is advisable to create separate test cases.
13-
static searchTests: []searchTest = [
13+
let searchTests: []searchTest = [
1414
//Sanity
1515
{[1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10, 9, Error.NA, "Sanity"},
1616
{[1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 9, 8, Error.NA, "Sanity"},
@@ -29,7 +29,7 @@ static searchTests: []searchTest = [
2929
{[], 2, -1, Error.NotFound, "Empty"},
3030
]
3131

32-
static lowerBoundTests: []searchTest = [
32+
let lowerBoundTests: []searchTest = [
3333
//Sanity
3434
{[1, 2, 3, 4, 5, 6, 7, 8, 9, 10], -25, 0, Error.NA, "Sanity"},
3535
{[1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 1, 0, Error.NA, "Sanity"},
@@ -43,7 +43,7 @@ static lowerBoundTests: []searchTest = [
4343
{[], 2, -1, Error.NotFound, "Empty"},
4444
]
4545

46-
static upperBoundTests: []searchTest = [
46+
let upperBoundTests: []searchTest = [
4747
//Sanity
4848
{[1, 2, 3, 4, 5, 6, 7, 8, 9, 10], -25, 0, Error.NA, "Sanity"},
4949
{[1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 1, 1, Error.NA, "Sanity"},

sort/testcases_test.jule

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ struct sortTest {
99
name: str
1010
}
1111

12-
static sortTests: []sortTest = [
12+
let sortTests: []sortTest = [
1313
//Sorted slice
1414
{
1515
input: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10],

strings/issubsequence_test.jule

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ struct subsequenceTest {
99
expected: bool
1010
}
1111

12-
static subsequenceTests: []subsequenceTest = [
12+
let subsequenceTests: []subsequenceTest = [
1313
{
1414
"Valid case 1 ",
1515
"ace",

strings/reverse_test.jule

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ struct reverseTest {
88
expected: str
99
}
1010

11-
static reverseTests: []reverseTest = [
11+
let reverseTests: []reverseTest = [
1212
{
1313
"Simple case 1",
1414
"hello",

0 commit comments

Comments
 (0)