mirl 9.2.0

Miners Rust Lib - A massive collection of ever growing and changing functions, structs, and enums. Check the description for compatibility and toggleable features! (Most of the lib is controlled by flags/features so the lib can continue to be lightweight despite its size)
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

use crate::{
    math::{ConstZero, NumberWithMonotoneOps},
    prelude::TryIntoPatch,
};

/// Add item to list without exceeding the specified maximal size
pub fn add_item_to_max_sized_list<T>(
    list: &mut Vec<T>,
    max_size: usize,
    item: T,
) {
    list.push(item);
    if core::intrinsics::unlikely(list.len() < max_size) {
        return;
    }
    let to_remove = list.len() - max_size;
    for _ in 0..to_remove {
        list.remove(0);
    }
}
/// Get a 1d cut out from a 1d color list (1d internally, 2d textures)
#[must_use]
pub fn get_sub_vec_of_vec<T: Copy>(
    vec: &[T],
    width: usize,
    cutout_x: usize,
    cutout_y: usize,
    cutout_width: usize,
    cutout_height: usize,
) -> Vec<T> {
    let mut sub_vec: Vec<T> = Vec::new();

    for y in cutout_y..cutout_y + cutout_height {
        for x in cutout_x..cutout_x + cutout_width {
            sub_vec.push(vec[y * width + x]);
        }
    }
    sub_vec
}
/// Returns what it would be if T was pushed onto [`Vec<T>`]
pub fn combined<T: Clone + Sized>(vec: &[T], other: T) -> Vec<T> {
    let mut new_vec = vec.to_vec();
    new_vec.push(other);
    new_vec
}
/// Returns what it would be if T was pushed onto [`Vec<T>`]
pub fn combined_list<T: Clone + Sized>(vec: &[T], other: &[T]) -> Vec<T> {
    let mut new_vec = vec.to_vec();
    new_vec.extend_from_slice(other);
    new_vec
}
#[must_use]
/// Returns what it would be if T was pushed onto [`Vec<T>`]
pub fn combined_contents<T: Clone + Sized>(
    vec: Vec<T>,
    other: Vec<T>,
) -> Vec<T> {
    let mut new = vec;
    for i in other {
        new.push(i);
    }
    new
}
/// Get the average value of a list
///
/// Returns None if the length of the input is 0
#[must_use]
pub fn average<T: ConstZero + Copy + PartialEq + NumberWithMonotoneOps>(
    vec: &[T],
) -> Option<T>
where
    usize: TryIntoPatch<T>,
{
    let len = (vec.len()).try_into_value()?;
    if core::intrinsics::unlikely(len == T::ZERO) {
        return None;
    }
    let sum: T = vec.iter().copied().fold(T::ZERO, |a, b| a + b);

    Some(sum / len)
}
#[must_use]
/// Get additions to a list
pub fn get_difference_new<'a, T: core::cmp::PartialEq>(
    old: &'a [T],
    new: &'a [T],
) -> Vec<&'a T> {
    let mut result = Vec::new();
    for i in new {
        if !old.contains(i) {
            result.push(i);
        }
    }
    result
}
#[must_use]
/// Get additions to a list
pub fn get_difference_new_cloned<T: core::cmp::PartialEq + Clone>(
    old: &[T],
    new: &[T],
) -> Vec<T> {
    let mut result = Vec::new();
    for i in new {
        if !old.contains(i) {
            result.push(i.clone());
        }
    }
    result
}
/// Returns if the list has duplicate values
#[must_use]
pub fn has_duplicates<T: core::hash::Hash + Eq>(vec: &Vec<T>) -> bool {
    let mut seen = std::collections::HashSet::new();
    for item in vec {
        if !seen.insert(item) {
            return true;
        }
    }
    false
}
/// Find an item in a list
pub fn find_in_list<T: core::cmp::PartialEq>(
    vec: &[T],
    item: &T,
) -> Option<usize> {
    vec.iter().position(|x| *x == *item)
}
#[must_use]
/// Turn `Vec<Option<T>>` into `Option<Vec<T>>`
pub fn collect_options<T>(vec: Vec<Option<T>>) -> Option<Vec<T>> {
    vec.into_iter().collect()
}