Count strictly increasing subarrays

#[test]
fn test_all_same() {
    let start = std::time::Instant::now();
    let val = Solution::count_subarrays(vec![3, 3, 3]);
    let expected = 3;
    log_result!(val == expected, "test_all_same", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_decreasing() {
    let start = std::time::Instant::now();
    let val = Solution::count_subarrays(vec![5, 4, 3, 2, 1]);
    let expected = 5;
    log_result!(val == expected, "test_decreasing", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_example1() {
    let start = std::time::Instant::now();
    let val = Solution::count_subarrays(vec![1, 3, 5, 4, 4, 6]);
    let expected = 10;
    log_result!(val == expected, "test_example1", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_example2() {
    let start = std::time::Instant::now();
    let val = Solution::count_subarrays(vec![1, 2, 3, 4, 5]);
    let expected = 15;
    log_result!(val == expected, "test_example2", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_single() {
    let start = std::time::Instant::now();
    let val = Solution::count_subarrays(vec![5]);
    let expected = 1;
    log_result!(val == expected, "test_single", start, &expected, &val);
    assert_eq!(val, expected);
}