prefix_parser 0.2.0

A parser for numbers with binary prefixes on the end. EX: Turning 1KB into 1000.
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
//! # Prefix Parser
//!
//! `prefix_parser` is a library to help you parse bit and byte prefixes;
//! Helping you turn "12MiB" into 12582912i128
//!

#![no_std]
#![deny(clippy::all)]
#![deny(clippy::pedantic)]
#![deny(clippy::nursery)]
#![deny(clippy::cargo)]

extern crate alloc;

use alloc::{format, string::String, vec::Vec};

static PREFIXES: [char; 11] = ['b', 'k', 'm', 'g', 't', 'p', 'e', 'z', 'y', 'r', 'q'];

/// Parses an array of chars that is known to have a 1 char binary prefix on the end
///
/// # Arguments
///
/// `string_chars`: An array of chars with the last one being a binary prefix and the previous chars being digits
/// `si`: A boolean value specifying whether the chars should be interpreted as binary or SI notation
///
/// # Returns
///
/// An Option<i128> containing the parsed value upon successful parsing.
///
/// If parsing failed, None will be returned
///
/// # Panics
///
/// This function should only panic if the return value was successfully parsed but over or underflowed the i128
///
/// (The value was below -2^127 or above 2^127-1)
///
fn parse_one_letter_prefix(string_chars: &[char], si: bool) -> Option<i128> {
    let prefix = string_chars.last()?.to_ascii_lowercase();

    let number_length = string_chars.len() - 1;

    if let Some(prefix_value) = PREFIXES
        .iter()
        .position(|&c| c == prefix)
    {
        // We have to check that the beginning is actually a number

        // If anyone knows of a more efficient method of doing this, let me know...
        if let Ok(number) = String::from_iter(&string_chars[..number_length]).parse::<i128>() {
            let base: i128 = if si { 1000 } else { 1024 };

            // The prefix value can only be a maximum of 11
            #[allow(clippy::cast_possible_truncation)]
            return Some(number * base.pow(prefix_value as u32));
        }
        // Non-prefix is not a number
        // Fall through to the below error
    }
    // Not a valid prefix
    None
}

/// Parses an array of chars that is known to have a 2 char binary prefix on the end
///
/// # Arguments
///
/// `string_chars`: An array of chars with the last 2 being a binary prefix and the previous chars being digits
///
/// # Returns
///
/// An Option<i128> containing the parsed value upon successful parsing.
///
/// If parsing failed, None will be returned
///
/// # Panics
///
/// This function should only panic if the return value was successfully parsed but over or underflowed the i128
///
/// (The value was below -2^127 or above 2^127-1)
///
fn parse_two_letter_prefix(string_chars: &[char]) -> Option<i128> {
    let str_len = string_chars.len();
    if str_len < 2 {
        return None;
    }
    let number_length = str_len - 2;

    let prefix = &string_chars[number_length..];

    assert_eq!(prefix.len(), 2);

    let lchar = prefix[1].to_ascii_lowercase();

    // The first thing we check is if the last char is b or i as those are the only supported last chars if it is a two char prefix
    if !['b', 'i'].contains(&lchar) {
        return None;
    }

    // We use SI units if the second char of the prefix is b. EX: mb, kb, tb
    // This has the fun side effect of allowing bb as a prefix
    let si = lchar == 'b';

    // We have number_length + 1 here to strip off the end char and leave the number with a one char prefix.
    // This is fine as all the second char does is determine if the number is SI or binary
    parse_one_letter_prefix(&string_chars[..=number_length], si)
}

/// Parses an array of chars that is known to have a 3 char binary prefix on the end
///
/// # Arguments
///
/// `string_chars`: An array of chars with the last 3 being a binary prefix and the previous chars being digits
///
/// # Returns
///
/// An Option<i128> containing the parsed value upon successful parsing.
///
/// If parsing failed, None will be returned
///
/// # Panics
///
/// This function should only panic if the return value was successfully parsed but over or underflowed the i128
///
/// (The value was below -2^127 or above 2^127-1)
///
fn parse_three_letter_prefix(string_chars: &[char]) -> Option<i128> {
    let str_len = string_chars.len();
    if str_len < 3 {
        return None;
    }
    let number_length = str_len - 3;

    let prefix = &string_chars[number_length..];

    assert_eq!(prefix.len(), 3);

    // A valid three letter prefix would always be binary, but you know how things are... They're not always valid

    // A valid three letter prefix will ALWAYS have "i" as the middle letter and "b" as the last

    if !prefix[1].eq_ignore_ascii_case(&'i') || !prefix[2].eq_ignore_ascii_case(&'b') {
        return None;
    }

    parse_one_letter_prefix(&string_chars[..=number_length], false)
}

/// Parses a string with a binary prefix on the end and converts it into a number of bytes
///
/// # Arguments
///
/// `prefixed_string`: a &str, such as "5KB" or "2TiB" that should be processed.
///
/// # Returns
///
/// The i128 value of `prefixed_string` interpreted as bytes
///
/// # Panics
///
/// This function will panic if the result is outside the range [-2^127, 2^127-1) bytes.
///
/// (-170141183460469231731687303715884105728 - 170141183460469231731687303715884105727)
///
/// # Errors
///
/// Will return Err if `prefixed_string` is not a valid prefixed string.
///
/// This includes fractional numbers.
///
///
/// # Example:
///
/// ```rust
/// # fn main() -> Result<(), String> {
/// use prefix_parser::parse_prefixes;
///
/// let to_parse = "2KiB";
/// let parsed = parse_prefixes(to_parse)?;
///
/// // 2048 is 2Kib
/// assert_eq!(parsed, 2048);
/// #     Ok(())
/// # }
/// ```
pub fn parse_prefixes(prefixed_string: &str) -> Result<i128, String> {
    if let Ok(parsed) = prefixed_string.parse::<i128>() {
        // If we can parse it without having to worry about a prefix, we should
        return Ok(parsed);
    }

    // We obviously must be working with a prefix or an invalid string

    let string_chars: Vec<char> = prefixed_string.chars().collect();

    let string_length = string_chars.len();
    if string_length < 2 {
        // This isn't possible as we need at least one digit and one letter for the prefix.

        return Err(format!("{prefixed_string} is not a prefixed string"));
    }

    // We need separate special case processing for strings of length 2, and 3. Then a general processing for 4 and up

    // Only one char available for the prefix
    if string_length == 2 {
        if let Some(parsed) = parse_one_letter_prefix(&string_chars, false) {
            return Ok(parsed);
        }
        return Err(format!("{prefixed_string} is not a prefixed string."));
    }

    // Two chars available

    if string_length == 3 {
        // Now the prefix could possibly be the second to last or the last char. Yay
        let prefix = string_chars[1];

        if prefix.is_ascii_digit() {
            // Prefix is only the last char
            if let Some(parsed) = parse_one_letter_prefix(&string_chars, false) {
                return Ok(parsed);
            }
            return Err(format!("{prefixed_string} is not a prefixed string."));
        }

        // Prefix is the second to last char
        if let Some(parsed) = parse_two_letter_prefix(&string_chars) {
            return Ok(parsed);
        }
        return Err(format!("{prefixed_string} is not a prefixed string."));
    }

    // Finally, we can implement the generic parser

    /*
     * Here we check if the 3rd from last char is a digit. If it is, then we cannot have a 3 char
     * prefix so we go on to check the second to last char. if it is also a digit, then there must
     * be a 1 char prefix. If it is not, then it must be a 2 char prefix.
     */
    let prefix = string_chars[string_length - 3];

    if prefix.is_ascii_digit() {
        let prefix = string_chars[string_length - 2];
        if prefix.is_ascii_digit() {
            // 1 char prefix
            if let Some(parsed) = parse_one_letter_prefix(&string_chars, false) {
                return Ok(parsed);
            }
            return Err(format!("{prefixed_string} is not a prefixed string."));
        }
        // 2 char prefix
        if let Some(parsed) = parse_two_letter_prefix(&string_chars) {
            return Ok(parsed);
        }
        return Err(format!("{prefixed_string} is not a prefixed string."));
    }
    // 3 char prefix
    if let Some(parsed) = parse_three_letter_prefix(&string_chars) {
        return Ok(parsed);
    }

    Err(format!("{prefixed_string} is not a prefixed string."))
}

#[cfg(test)]
mod pubapi_tests {
    use super::parse_prefixes;

    #[test]
    fn test_one_letter_prefix() {
        let result = parse_prefixes("4k").unwrap();
        assert_eq!(result, 4096);
    }

    #[test]
    fn test_two_letter_binary_prefix() {
        let result = parse_prefixes("4ki").unwrap();
        assert_eq!(result, 4096);
    }

    #[test]
    fn test_two_letter_si_prefix() {
        let result = parse_prefixes("4kb").unwrap();
        assert_eq!(result, 4000);
    }

    #[test]
    fn test_three_letter_prefix() {
        let result = parse_prefixes("4kib").unwrap();
        assert_eq!(result, 4096);
    }

    #[test]
    fn test_long_numbers() {
        let result = parse_prefixes("1000m").unwrap();
        assert_eq!(result, 1048576000);
        let result = parse_prefixes("4212ki").unwrap();
        assert_eq!(result, 4313088);
        let result = parse_prefixes("2231MB").unwrap();
        assert_eq!(result, 2231000000);
        let result = parse_prefixes("12412MiB").unwrap();
        assert_eq!(result, 13014925312);
    }

    #[test]
    fn test_correct_prefixes() {
        let result = parse_prefixes("1b").unwrap();
        assert_eq!(result, 1);
        let result = parse_prefixes("1k").unwrap();
        assert_eq!(result, 1024);
        let result = parse_prefixes("1m").unwrap();
        assert_eq!(result, 1048576);
        let result = parse_prefixes("1g").unwrap();
        assert_eq!(result, 1073741824);
        let result = parse_prefixes("1t").unwrap();
        assert_eq!(result, 1099511627776);
        let result = parse_prefixes("1p").unwrap();
        assert_eq!(result, 1125899906842624);
        let result = parse_prefixes("1e").unwrap();
        assert_eq!(result, 1152921504606846976);
        let result = parse_prefixes("1z").unwrap();
        assert_eq!(result, 1180591620717411303424);
        let result = parse_prefixes("1y").unwrap();
        assert_eq!(result, 1208925819614629174706176);
        let result = parse_prefixes("1r").unwrap();
        assert_eq!(result, 1237940039285380274899124224);
        let result = parse_prefixes("1q").unwrap();
        assert_eq!(result, 1267650600228229401496703205376);

        let result = parse_prefixes("1bi").unwrap();
        assert_eq!(result, 1);
        let result = parse_prefixes("1ki").unwrap();
        assert_eq!(result, 1024);
        let result = parse_prefixes("1mi").unwrap();
        assert_eq!(result, 1048576);
        let result = parse_prefixes("1gi").unwrap();
        assert_eq!(result, 1073741824);
        let result = parse_prefixes("1ti").unwrap();
        assert_eq!(result, 1099511627776);
        let result = parse_prefixes("1pi").unwrap();
        assert_eq!(result, 1125899906842624);
        let result = parse_prefixes("1ei").unwrap();
        assert_eq!(result, 1152921504606846976);
        let result = parse_prefixes("1zi").unwrap();
        assert_eq!(result, 1180591620717411303424);
        let result = parse_prefixes("1yi").unwrap();
        assert_eq!(result, 1208925819614629174706176);
        let result = parse_prefixes("1ri").unwrap();
        assert_eq!(result, 1237940039285380274899124224);
        let result = parse_prefixes("1qi").unwrap();
        assert_eq!(result, 1267650600228229401496703205376);

        let result = parse_prefixes("1bib").unwrap();
        assert_eq!(result, 1);
        let result = parse_prefixes("1kib").unwrap();
        assert_eq!(result, 1024);
        let result = parse_prefixes("1mib").unwrap();
        assert_eq!(result, 1048576);
        let result = parse_prefixes("1gib").unwrap();
        assert_eq!(result, 1073741824);
        let result = parse_prefixes("1tib").unwrap();
        assert_eq!(result, 1099511627776);
        let result = parse_prefixes("1pib").unwrap();
        assert_eq!(result, 1125899906842624);
        let result = parse_prefixes("1eib").unwrap();
        assert_eq!(result, 1152921504606846976);
        let result = parse_prefixes("1zib").unwrap();
        assert_eq!(result, 1180591620717411303424);
        let result = parse_prefixes("1yib").unwrap();
        assert_eq!(result, 1208925819614629174706176);
        let result = parse_prefixes("1rib").unwrap();
        assert_eq!(result, 1237940039285380274899124224);
        let result = parse_prefixes("1qib").unwrap();
        assert_eq!(result, 1267650600228229401496703205376);

        let result = parse_prefixes("1bb").unwrap();
        assert_eq!(result, 1);
        let result = parse_prefixes("1kb").unwrap();
        assert_eq!(result, 1000);
        let result = parse_prefixes("1mb").unwrap();
        assert_eq!(result, 1000000);
        let result = parse_prefixes("1gb").unwrap();
        assert_eq!(result, 1000000000);
        let result = parse_prefixes("1tb").unwrap();
        assert_eq!(result, 1000000000000);
        let result = parse_prefixes("1pb").unwrap();
        assert_eq!(result, 1000000000000000);
        let result = parse_prefixes("1eb").unwrap();
        assert_eq!(result, 1000000000000000000);
        let result = parse_prefixes("1zb").unwrap();
        assert_eq!(result, 1000000000000000000000);
        let result = parse_prefixes("1yb").unwrap();
        assert_eq!(result, 1000000000000000000000000);
        let result = parse_prefixes("1rb").unwrap();
        assert_eq!(result, 1000000000000000000000000000);
        let result = parse_prefixes("1qb").unwrap();
        assert_eq!(result, 1000000000000000000000000000000);
    }

    #[test]
    fn test_negatives() {
        let result = parse_prefixes("-1b").unwrap();
        assert_eq!(result, -1);
        let result = parse_prefixes("-1bi").unwrap();
        assert_eq!(result, -1);
        let result = parse_prefixes("-1000m").unwrap();
        assert_eq!(result, -1048576000);
        let result = parse_prefixes("-4212ki").unwrap();
        assert_eq!(result, -4313088);
        let result = parse_prefixes("-2231MB").unwrap();
        assert_eq!(result, -2231000000);
        let result = parse_prefixes("-12412MiB").unwrap();
        assert_eq!(result, -13014925312);
    }

    #[test]
    fn test_no_prefix() {
        let result = parse_prefixes("8675309").unwrap();
        assert_eq!(result, 8675309);
    }

    #[test]
    #[should_panic(expected = "attempt to multiply with overflow")]
    fn test_overflow() {
        // This equals 2^127 bytes
        let _result = parse_prefixes("134217728q");
    }

    #[test]
    #[should_panic(expected = "attempt to multiply with overflow")]
    fn test_underflow() {
        let _result = parse_prefixes("-134217729q");
    }

    #[test]
    fn test_just_below_overflow() {
        // Overflow
        
        let result = parse_prefixes("134217727q").unwrap();

        assert_eq!(result, 170141182192818631503457902219180900352);
        assert_eq!(result, (2u128.pow(127) - 1024u128.pow(10)) as i128);

        let result = parse_prefixes("170141183460469231731687303715884105727BIB").unwrap();

        assert_eq!(result, (2u128.pow(127) - 1) as i128);
        assert_eq!(result, 170141183460469231731687303715884105727);
        assert_eq!(result, i128::MAX);

        // Underflow
        let result = parse_prefixes("-134217728q").unwrap();
        
        let result2 = parse_prefixes("-170141183460469231731687303715884105728bi").unwrap();

        assert_eq!(result2, result);
        assert_eq!(result, i128::MIN);
        assert_eq!(result, -170141183460469231731687303715884105728);
    }

    #[test]
    fn test_edge_cases() {
        let result = parse_prefixes("1b").unwrap();
        assert_eq!(result, 1);
        let result = parse_prefixes("1bib").unwrap();
        assert_eq!(result, 1);
        let result = parse_prefixes("1bb").unwrap();
        assert_eq!(result, 1);

        let result = parse_prefixes("100000b").unwrap();
        assert_eq!(result, 100000);
        let result = parse_prefixes("100000bib").unwrap();
        assert_eq!(result, 100000);
        let result = parse_prefixes("100000bb").unwrap();
        assert_eq!(result, 100000);
    }

    #[test]
    #[should_panic(expected = "Test Passed")]
    fn test_invalid_one_letter_prefix() {
        let _result = parse_prefixes("1j").expect("Test Passed");
    }

    #[test]
    #[should_panic(expected = "Test Passed")]
    fn test_invalid_input_1() {
        let _result = parse_prefixes("7KBI").expect("Test Passed");
    }

    #[test]
    #[should_panic(expected = "Test Passed")]
    fn test_invalid_input_2() {
        let _result = parse_prefixes("5mn").expect("Test Passed");
    }

    #[test]
    #[should_panic(expected = "Test Passed")]
    fn test_invalid_input_3() {
        let _result = parse_prefixes("1b23434b").expect("Test Passed");
    }

    #[test]
    #[should_panic(expected = "Test Passed")]
    fn test_invalid_input_4() {
        let _result = parse_prefixes("231m4b").expect("Test Passed");
    }
}

#[cfg(test)]
mod privapi_tests {
    use super::{parse_one_letter_prefix,parse_two_letter_prefix,parse_three_letter_prefix};
    use alloc::vec::Vec;
    
    #[test]
    fn test_invalid_1s() {
        assert_eq!(parse_one_letter_prefix(&"".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"b".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"mb".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"mib".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"sierbv".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"283974".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"032sc".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"39ki".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"12mi".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"12mib".chars().collect::<Vec<char>>(), false), None);
        assert_eq!(parse_one_letter_prefix(&"12kib".chars().collect::<Vec<char>>(), false), None);
    }

    #[test]
    fn test_invalid_2s() {
        assert_eq!(parse_two_letter_prefix(&"".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"b".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"mb".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"mib".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"sierbv".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"283974".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"032sc".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"03b".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"03m".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"03mib".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"03ji".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_two_letter_prefix(&"03gib".chars().collect::<Vec<char>>()), None);
        
    }

    #[test]
    fn test_invalid_3s() {
        assert_eq!(parse_three_letter_prefix(&"".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_three_letter_prefix(&"b".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_three_letter_prefix(&"mb".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_three_letter_prefix(&"mib".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_three_letter_prefix(&"sierbv".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_three_letter_prefix(&"283974".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_three_letter_prefix(&"032sc".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_three_letter_prefix(&"39ki".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_three_letter_prefix(&"12mi".chars().collect::<Vec<char>>()), None);
        assert_eq!(parse_three_letter_prefix(&"12k".chars().collect::<Vec<char>>()), None);
    }

    #[test]
    fn test_valid_1s() {
        assert_eq!(parse_one_letter_prefix(&"1b".chars().collect::<Vec<char>>(), false), Some(1));
        assert_eq!(parse_one_letter_prefix(&"1b".chars().collect::<Vec<char>>(), true), Some(1));
        assert_eq!(parse_one_letter_prefix(&"100k".chars().collect::<Vec<char>>(), false), Some(102400));
        assert_eq!(parse_one_letter_prefix(&"100k".chars().collect::<Vec<char>>(), true), Some(100000));
        assert_eq!(parse_one_letter_prefix(&"-1b".chars().collect::<Vec<char>>(), false), Some(-1));
        assert_eq!(parse_one_letter_prefix(&"-1b".chars().collect::<Vec<char>>(), true), Some(-1));
        assert_eq!(parse_one_letter_prefix(&"-100k".chars().collect::<Vec<char>>(), false), Some(-102400));
        assert_eq!(parse_one_letter_prefix(&"-100k".chars().collect::<Vec<char>>(), true), Some(-100000));
    }

    #[test]
    fn test_valid_2s() {
        assert_eq!(parse_two_letter_prefix(&"1bi".chars().collect::<Vec<char>>()), Some(1));
        assert_eq!(parse_two_letter_prefix(&"1bb".chars().collect::<Vec<char>>()), Some(1));
        assert_eq!(parse_two_letter_prefix(&"100ki".chars().collect::<Vec<char>>()), Some(102400));
        assert_eq!(parse_two_letter_prefix(&"100kb".chars().collect::<Vec<char>>()), Some(100000));
        assert_eq!(parse_two_letter_prefix(&"-1bi".chars().collect::<Vec<char>>()), Some(-1));
        assert_eq!(parse_two_letter_prefix(&"-1bb".chars().collect::<Vec<char>>()), Some(-1));
        assert_eq!(parse_two_letter_prefix(&"-100ki".chars().collect::<Vec<char>>()), Some(-102400));
        assert_eq!(parse_two_letter_prefix(&"-100kb".chars().collect::<Vec<char>>()), Some(-100000));
    }

    #[test]
    fn test_valid_3s() {
        assert_eq!(parse_three_letter_prefix(&"1bib".chars().collect::<Vec<char>>()), Some(1));
        assert_eq!(parse_three_letter_prefix(&"100kib".chars().collect::<Vec<char>>()), Some(102400));
        assert_eq!(parse_three_letter_prefix(&"-1bib".chars().collect::<Vec<char>>()), Some(-1));
        assert_eq!(parse_three_letter_prefix(&"-100kib".chars().collect::<Vec<char>>()), Some(-102400));
    }
}