#[derive(Debug)]
pub struct ListNode {
pub val: i32,
pub next: Option<Box<ListNode>>,
enum Choose {
Rock,
Paper,
Scissor,
}
trait CalculateScore {
fn main() {
let mut result = 0;
let mut buffer = 0;
DATA.lines().for_each(|line| {
if line.is_empty() {
if buffer > result {
result = buffer;
Summary:
Total: 30.0199 secs
Slowest: 0.0995 secs
Fastest: 0.0212 secs
Average: 0.0551 secs
Requests/sec: 1813.5947
ezcon@ez500:~/ezmonitor$ hey -z 30s -c 100 http://localhost:1234/api/get
Summary:
Total: 30.1203 secs
Slowest: 0.2984 secs
Fastest: 0.0801 secs
Average: 0.1514 secs
Requests/sec: 659.1560
const fileExisted = await Result.safe(fsPromises.stat(targetDir));
if (fileExisted.isOk()) {
fs.rmSync(targetDir, { recursive: true });
}
const mkdir = await Result.safe(
fsPromises.mkdir(targetDir, { recursive: true }),
);
if (mkdir.isErr()) {