arraypp 0.1.0

A `no_std` and no `alloc` library for more efficient array processing.
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

# arraypp

[![Rust](https://github.com/Joker2770/arraypp/actions/workflows/rust.yml/badge.svg)](https://github.com/Joker2770/arraypp/actions/workflows/rust.yml)

A `no_std` and no `alloc` library for more efficient array processing.

## Usage
Compare elements: 

```Rust
use arraypp::compare::ArrayExtrema;

// Find both the minimum and maximum values and their indices at the same time
let arr = [1.5, 3.2, 2.8, 4.7, 2.8];
let result = ArrayExtrema::min_max_with_indices(&arr).unwrap();

println!("Min: {} at index {}", result.min.value, result.min.index);
println!("Max: {} at index {}", result.max.value, result.max.index);

// Find the minimum value and its index only
let min = ArrayExtrema::min_with_index(&arr).unwrap();
println!("Min: {} at index {}", min.value, min.index);

// Find the maximum value and its index only
let max = ArrayExtrema::max_with_index(&arr).unwrap();
println!("Max: {} at index {}", max.value, max.index);
```

Queue options: 

```Rust
use arraypp::queue::ArrayQueue;

let mut queue: ArrayQueue<i32, 3> = ArrayQueue::new();

assert!(queue.is_empty());
assert_eq!(queue.len(), 0);

assert_eq!(queue.enqueue(1), Ok(()));
assert_eq!(queue.enqueue(2), Ok(()));
assert_eq!(queue.enqueue(3), Ok(()));

assert!(queue.is_full());
assert_eq!(queue.len(), 3);

assert_eq!(queue.enqueue(4), Err(4)); // Queue is full

assert_eq!(queue.peek(), Some(&1));
assert_eq!(queue.dequeue(), Some(1));

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

assert_eq!(queue.enqueue(4), Ok(())); // Now there is space

assert_eq!(queue.dequeue(), Some(2));
assert_eq!(queue.dequeue(), Some(3));
assert_eq!(queue.dequeue(), Some(4));

assert!(queue.is_empty());
assert_eq!(queue.dequeue(), None);
```