8410378618

Committed 24 Mar 2024 03:35PM UTC coverage: 99.985% (-0.01%) from 99.997%

Build # 8410378618

Build Type

push

github

Committed by

EFanZh

Commit Message

Add problem 2170: Minimum Operations to Make the Array Alternating

Run Details

20 of 20 branches covered (100.0%)

Branch coverage included in aggregate %.

49 of 49 new or added lines in 2 files covered. (100.0%)

3 existing lines in 1 file now uncovered.

20438 of 20441 relevant lines covered (99.99%)

55804.44 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

93.18

/src/problem_0374_guess_number_higher_or_lower/mod.rs

use std::cell::Cell;
use std::cmp::Ordering;

pub mod binary_search;

pub trait Solution {
    fn guess_number(n: i32) -> i32;
}

// static NUM: AtomicI32 = AtomicI32::new(0);

thread_local! {
    static NUM: Cell<i32> = const { Cell::new(0) };
}

fn internal_guess(num: i32) -> i32 {
    match NUM.with(Cell::get).cmp(&num) {
        Ordering::Less => -1,
        Ordering::Equal => 0,
        Ordering::Greater => 1,
    }
}

/// # Safety
///
/// The `unsafe` here is used to match official function signature, the function is actually safe to use.
#[allow(unsafe_code)] // Expected.
pub unsafe fn guess(num: i32) -> i32 {
    internal_guess(num)
}

#[cfg(test)]
mod tests {
    use super::Solution;

    pub fn run<S: Solution>() {
        let test_cases = [
            (1, 1),
            (2, 1),
            (2, 2),
            (3, 1),
            (3, 2),
            (3, 3),
            (4, 1),
            (4, 2),
            (4, 3),
            (4, 4),
            (5, 1),
            (5, 2),
            (5, 3),
            (5, 4),
            (5, 5),
            (6, 1),
            (6, 2),
            (6, 3),
            (6, 4),
            (6, 5),
            (6, 6),
        ];

        for (n, num) in test_cases {
            super::NUM.with(|num_cell| {
                num_cell.set(num);

                assert_eq!(S::guess_number(n), num);
            });
        }
    }
}

1	use std::cell::Cell;
2	use std::cmp::Ordering;
3
4	pub mod binary_search;
5
6	pub trait Solution {
7	fn guess_number(n: i32) -> i32;
8	}
9
10	// static NUM: AtomicI32 = AtomicI32::new(0);
11
UNCOV 12	thread_local! {	×
UNCOV 13	static NUM: Cell<i32> = const { Cell::new(0) };	×
UNCOV 14	}	×
15
16	fn internal_guess(num: i32) -> i32 {	42✔
17	match NUM.with(Cell::get).cmp(&num) {	42✔
18	Ordering::Less => -1,	7✔
19	Ordering::Equal => 0,	21✔
20	Ordering::Greater => 1,	14✔
21	}
22	}	42✔
23
24	/// # Safety
25	///
26	/// The `unsafe` here is used to match official function signature, the function is actually safe to use.
27	#[allow(unsafe_code)] // Expected.
28	pub unsafe fn guess(num: i32) -> i32 {	42✔
29	internal_guess(num)	42✔
30	}	42✔
31
32	#[cfg(test)]
33	mod tests {
34	use super::Solution;
35
36	pub fn run<S: Solution>() {	1✔
37	let test_cases = [	1✔
38	(1, 1),	1✔
39	(2, 1),	1✔
40	(2, 2),	1✔
41	(3, 1),	1✔
42	(3, 2),	1✔
43	(3, 3),	1✔
44	(4, 1),	1✔
45	(4, 2),	1✔
46	(4, 3),	1✔
47	(4, 4),	1✔
48	(5, 1),	1✔
49	(5, 2),	1✔
50	(5, 3),	1✔
51	(5, 4),	1✔
52	(5, 5),	1✔
53	(6, 1),	1✔
54	(6, 2),	1✔
55	(6, 3),	1✔
56	(6, 4),	1✔
57	(6, 5),	1✔
58	(6, 6),	1✔
59	];	1✔
60
61	for (n, num) in test_cases {	22✔
62	super::NUM.with(\|num_cell\| {	21✔
63	num_cell.set(num);	21✔
64		21✔
65	assert_eq!(S::guess_number(n), num);	21✔
66	});	21✔
67	}	21✔
68	}	1✔
69	}

EFanZh / LeetCode / 8410378618

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous