[go: up one dir, main page]

standback 0.3.3

New standard library, old compiler.
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

#[cfg(feature = "alloc")]
use alloc::collections::btree_map;
use core::cell::{RefCell, UnsafeCell};
#[cfg(feature = "std")]
use std::collections::hash_map;

use crate::traits::{Float, Sealed};

pub trait Bool_v1_50: Sealed<bool> {
    fn then<T, F: FnOnce() -> T>(self, f: F) -> Option<T>;
}

impl Bool_v1_50 for bool {
    fn then<T, F: FnOnce() -> T>(self, f: F) -> Option<T> {
        if self { Some(f()) } else { None }
    }
}

#[cfg(feature = "alloc")]
pub trait BTreeMapEntry_v1_50<'a, K: 'a, V: 'a>: Sealed<btree_map::Entry<'a, K, V>> {
    fn or_insert_with_key<F: FnOnce(&K) -> V>(self, default: F) -> &'a mut V;
}

#[cfg(feature = "alloc")]
impl<'a, K: Ord + 'a, V: 'a> BTreeMapEntry_v1_50<'a, K, V> for btree_map::Entry<'a, K, V> {
    fn or_insert_with_key<F: FnOnce(&K) -> V>(self, default: F) -> &'a mut V {
        match self {
            btree_map::Entry::Occupied(entry) => entry.into_mut(),
            btree_map::Entry::Vacant(entry) => {
                let value = default(entry.key());
                entry.insert(value)
            }
        }
    }
}

#[cfg(feature = "std")]
pub trait HashMapEntry_v1_50<'a, K: 'a, V: 'a>: Sealed<hash_map::Entry<'a, K, V>> {
    fn or_insert_with_key<F: FnOnce(&K) -> V>(self, default: F) -> &'a mut V;
}

#[cfg(feature = "std")]
impl<'a, K: 'a, V: 'a> HashMapEntry_v1_50<'a, K, V> for hash_map::Entry<'a, K, V> {
    fn or_insert_with_key<F: FnOnce(&K) -> V>(self, default: F) -> &'a mut V {
        match self {
            hash_map::Entry::Occupied(entry) => entry.into_mut(),
            hash_map::Entry::Vacant(entry) => {
                let value = default(entry.key());
                entry.insert(value)
            }
        }
    }
}

pub trait Float_v1_50: Float {
    fn clamp(self, min: Self, max: Self) -> Self;
}

impl Float_v1_50 for f32 {
    #[must_use = "method returns a new number and does not mutate the original value"]
    fn clamp(self, min: f32, max: f32) -> f32 {
        assert!(min <= max);
        let mut x = self;
        if x < min {
            x = min;
        }
        if x > max {
            x = max;
        }
        x
    }
}

impl Float_v1_50 for f64 {
    #[must_use = "method returns a new number and does not mutate the original value"]
    fn clamp(self, min: f64, max: f64) -> f64 {
        assert!(min <= max);
        let mut x = self;
        if x < min {
            x = min;
        }
        if x > max {
            x = max;
        }
        x
    }
}

pub trait Ord_v1_50<T: Ord>: Sealed<T> {
    fn clamp(self, min: Self, max: Self) -> Self;
}

impl<T: Ord> Ord_v1_50<T> for T {
    #[must_use]
    fn clamp(self, min: Self, max: Self) -> Self
    where
        Self: Sized,
    {
        assert!(min <= max);
        if self < min {
            min
        } else if self > max {
            max
        } else {
            self
        }
    }
}

pub trait RefCell_v1_50<T>: Sealed<RefCell<T>> {
    fn take(&self) -> T;
}

impl<T: Default> RefCell_v1_50<T> for RefCell<T> {
    fn take(&self) -> T {
        self.replace(Default::default())
    }
}

pub trait Slice_v1_50<T>: Sealed<[T]> {
    fn fill(&mut self, value: T)
    where
        T: Clone;
}

impl<T> Slice_v1_50<T> for [T] {
    fn fill(&mut self, value: T)
    where
        T: Clone,
    {
        if let Some((last, elems)) = self.split_last_mut() {
            for el in elems {
                el.clone_from(&value);
            }

            *last = value
        }
    }
}

pub trait UnsafeCell_v1_50<T>: Sealed<UnsafeCell<T>> {
    fn get_mut(&mut self) -> &mut T;
}

impl<T> UnsafeCell_v1_50<T> for UnsafeCell<T> {
    fn get_mut(&mut self) -> &mut T {
        unsafe { &mut *self.get() }
    }
}