healpix 0.2.0

Rust implementation of the HEALPix tesselation.
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

use super::*;
use std::array::IntoIter;
use std::fmt::{self, Debug, Formatter};
use std::iter::{Enumerate, FilterMap};
use std::marker::PhantomData;
use std::slice::{Iter, IterMut};

/// A map of enum keys to values, with an API similar to the standard [`HashMap`](std::collections::HashMap).
#[derive(PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct EnumMap<K, V, const N: usize> {
    values: [Option<V>; N],
    _marker: PhantomData<[K; N]>,
}
impl<K, V, const N: usize> EnumMap<K, V, N> {
    pub const fn new() -> Self {
        Self {
            values: [const { None }; N],
            _marker: PhantomData,
        }
    }
}
impl<K: Enum, V, const N: usize> EnumMap<K, V, N> {
    pub fn iter(&self) -> MapIter<'_, K, V> {
        self.values
            .iter()
            .enumerate()
            .filter_map(|(n, v)| v.as_ref().map(|v| (K::from_enum_index(n), v)))
    }
    pub fn iter_mut(&mut self) -> MapIterMut<'_, K, V> {
        self.values
            .iter_mut()
            .enumerate()
            .filter_map(|(n, v)| v.as_mut().map(|v| (K::from_enum_index(n), v)))
    }
    pub fn insert(&mut self, key: K, value: V) -> Option<V> {
        self.values[key.into_enum_index()].replace(value)
    }
    pub fn remove(&mut self, key: K) -> Option<V> {
        self.values[key.into_enum_index()].take()
    }
    pub fn get(&self, key: K) -> Option<&V> {
        self.values[key.into_enum_index()].as_ref()
    }
    pub fn get_mut(&mut self, key: K) -> Option<&mut V> {
        self.values[key.into_enum_index()].as_mut()
    }
    pub fn values(&self) -> impl Iterator<Item = &V> {
        self.values.iter().flatten()
    }
    pub fn values_mut(&mut self) -> impl Iterator<Item = &mut V> {
        self.values.iter_mut().flatten()
    }
    pub fn into_values(self) -> impl Iterator<Item = V> {
        self.values.into_iter().flatten()
    }
}
impl<K, V, const N: usize> Default for EnumMap<K, V, N> {
    fn default() -> Self {
        Self::new()
    }
}
impl<K, V: Clone, const N: usize> Clone for EnumMap<K, V, N> {
    fn clone(&self) -> Self {
        Self {
            values: self.values.clone(),
            _marker: PhantomData,
        }
    }
    fn clone_from(&mut self, source: &Self) {
        self.values.clone_from(&source.values);
    }
}
impl<K, V: Copy, const N: usize> Copy for EnumMap<K, V, N> {}
impl<K: Debug + Enum, V: Debug, const N: usize> Debug for EnumMap<K, V, N> {
    fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
        f.debug_map().entries(self.iter()).finish()
    }
}
impl<K: Enum, V, const N: usize> IntoIterator for EnumMap<K, V, N> {
    type IntoIter = MapIntoIter<K, V, N>;
    type Item = (K, V);

    fn into_iter(self) -> Self::IntoIter {
        self.values
            .into_iter()
            .enumerate()
            .filter_map(|(n, v)| v.map(|v| (K::from_enum_index(n), v)))
    }
}
impl<'a, K: Enum, V, const N: usize> IntoIterator for &'a EnumMap<K, V, N> {
    type IntoIter = MapIter<'a, K, V>;
    type Item = (K, &'a V);

    fn into_iter(self) -> Self::IntoIter {
        self.iter()
    }
}
impl<'a, K: Enum, V, const N: usize> IntoIterator for &'a mut EnumMap<K, V, N> {
    type IntoIter = MapIterMut<'a, K, V>;
    type Item = (K, &'a mut V);

    fn into_iter(self) -> Self::IntoIter {
        self.iter_mut()
    }
}

pub type MapIntoIter<K, V, const N: usize> =
    FilterMap<Enumerate<IntoIter<Option<V>, N>>, fn((usize, Option<V>)) -> Option<(K, V)>>;
pub type MapIter<'a, K, V> =
    FilterMap<Enumerate<Iter<'a, Option<V>>>, fn((usize, &'a Option<V>)) -> Option<(K, &'a V)>>;
pub type MapIterMut<'a, K, V> = FilterMap<
    Enumerate<IterMut<'a, Option<V>>>,
    fn((usize, &'a mut Option<V>)) -> Option<(K, &'a mut V)>,
>;

pub type EnumMap4<K, V> = EnumMap<K, V, 4>;
pub type EnumMap8<K, V> = EnumMap<K, V, 8>;
pub type CardinalMap<V> = EnumMap4<Cardinal, V>;
pub type OrdinalMap<V> = EnumMap4<Ordinal, V>;
pub type DirectionMap<V> = EnumMap8<Direction, V>;

impl<T, K: Enum, V: PartialEq<T>, const N: usize> PartialEq<[T]> for EnumMap<K, V, N> {
    fn eq(&self, other: &[T]) -> bool {
        self.values().eq(other)
    }
}
impl<T, K: Enum, V: PartialOrd<T>, const N: usize> PartialOrd<[T]> for EnumMap<K, V, N> {
    fn partial_cmp(&self, other: &[T]) -> Option<std::cmp::Ordering> {
        self.values().partial_cmp(other)
    }
}
impl<T, K: Enum, V: PartialEq<T>, const N1: usize, const N2: usize> PartialEq<[T; N2]>
    for EnumMap<K, V, N1>
{
    fn eq(&self, other: &[T; N2]) -> bool {
        self.values().eq(other)
    }
}
impl<T, K: Enum, V: PartialOrd<T>, const N1: usize, const N2: usize> PartialOrd<[T; N2]>
    for EnumMap<K, V, N1>
{
    fn partial_cmp(&self, other: &[T; N2]) -> Option<std::cmp::Ordering> {
        self.values().partial_cmp(other)
    }
}