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
//! This crate provides type-level natural numbers, similar to [`typenum`](https://docs.rs/typenum/latest/typenum/).
//!
//! A type-level number is a type that represents a number. The [`Nat`] trait takes the role of the
//! "type-level number type", i.e. one accepts a type-level number using a generic parameter with
//! bound [`Nat`].
//!
//! The use cases are the same as those of generic consts.
//!
//! `gnat` differs from `typenum` in that its [`Nat`] trait is not a marker trait, but defines
//! enough (internal) structure to be able to define and use operations on it, generically.
//!
//! This crate is to the unstable `generic_const_expr` feature what `typenum` is to the already
//! stable `min_const_generics` feature. For example, consider the case of concatenating arrays
//! at compile time
//! ```
//! // Ideal function, requires #![feature(generic_const_expr)]
//! const fn concat_arrays_gce<T, const M: usize, const N: usize>(
//! a: [T; M],
//! b: [T; N],
//! ) -> [T; M + N] {
//! todo!()
//! }
//! // typenum + generic-array implementation
//! use generic_array::{GenericArray, ArrayLength};
//! const fn concat_arrays_gar<T, M: ArrayLength, N: ArrayLength>(
//! a: GenericArray<T, M>,
//! b: GenericArray<T, N>,
//! ) -> GenericArray<T, typenum::op!(M + N)>
//! where // ArrayLength is not enough, we also need to add a bound for `+`
//! M: std::ops::Add<N, Output: ArrayLength>,
//! {
//! todo!()
//! }
//! ```
//! ```
//! // gnat implementation
//! use gnat::{Nat, array::Arr};
//! const fn concat_arrays_nat<T, M: Nat, N: Nat>(
//! a: Arr<T, M>,
//! b: Arr<T, N>,
//! ) -> Arr<T, gnat::eval!(M + N)> {
//! a.concat_arr(b).retype()
//! }
//! ```
//!
//! It is also possible to implement custom operations without any extra bounds needed to use them.
//! See the [`mod@expr`] module.
extern crate alloc;
// Nat Implementation internals
// Macro implementation details
// internal utils
// Public API
pub use *;
/// Trait for type-level natural numbers.
///
/// See the [crate level documentation](crate).
///
/// It is guaranteed that there is a one-to-one correspondence between
/// the natural numbers including zero and the types that implement this trait.
/// Trait for deferred [`Nat`] expressions.
///
/// This is not only a conversion trait, but forms an important part in how most operations are
/// implemented. See the [`mod@expr`] module.
/// Turns an integer literal into a [`Nat`].
///
/// If you have a small constant value that is not a literal, use [`consts::Usize`].
///
/// # Examples
/// ```
/// #![recursion_limit = "1024"] // `lit!` doesn't recurse, the type is just long
///
/// assert_eq!(gnat::to_u128::<gnat::lit!(1)>(), Some(1));
/// assert_eq!(
/// gnat::to_u128::<gnat::lit!(100000000000000000000000000000)>(),
/// Some(100000000000000000000000000000),
/// )
/// ```
/// Converts expression syntax into [`NatExpr`] type expressions.
///
/// # Examples
/// ```
/// # macro_rules! chk_same_type {
/// # ($l:ty, $r:ty $(,)?) => { let _: $l = panic!() as $r; };
/// # }
/// fn with_exprs<A: gnat::NatExpr, B: gnat::NatExpr>() {
/// // Unsuffixed literals are translated to `Nat`s
/// chk_same_type!(
/// gnat::expr! { 2 },
/// gnat::lit!(2),
/// );
/// // Most operators map to their correspondingly named operation
/// chk_same_type!(
/// gnat::expr! { A + B },
/// gnat::expr::Add<A, B>,
/// );
/// chk_same_type!(
/// gnat::expr! { A == B },
/// gnat::expr::Eq<A, B>,
/// );
/// // Subtraction is saturating
/// chk_same_type!(
/// gnat::expr! { A - B },
/// gnat::expr::SatSub<A, B>,
/// );
/// // `!` uses logical negation
/// chk_same_type!(
/// gnat::expr! { !A },
/// gnat::expr::IsZero<A>,
/// );
/// // Function calls translate to type paths
/// chk_same_type!(
/// gnat::expr! { gnat::expr::AbsDiff(A, B) },
/// gnat::expr::AbsDiff<A, B>,
/// );
/// // Expression paths also translate to type paths
/// chk_same_type!(
/// gnat::expr! { gnat::expr::AbsDiff::<A, B> },
/// gnat::expr::AbsDiff<A, B>,
/// );
/// // Conditionals are also supported
/// chk_same_type!(
/// gnat::expr! { if A { B } else { 2 * B } },
/// gnat::expr::If<
/// A,
/// B,
/// gnat::expr::Mul<gnat::lit!(2), B>,
/// >,
/// );
/// }
/// ```
=> ;
}
/// Same as [`expr!`] wrapped in [`Eval`]. Useful for use with [`mod@array`].
///
/// # Examples
/// The [`mod@array`] uses [`Nat`] instead of [`NatExpr`] (for better type inference), so
/// this is more convenient than [`expr!`]+[`Eval`]:
/// ```
/// use gnat::{Nat, array::*};
/// fn concat<T, M: Nat, N: Nat>(a: Arr<T, M>, b: Arr<T, N>) -> Arr<T, gnat::eval! { M + N }> {
/// a.concat_arr(b).retype()
/// }
/// ```
=> ;
}
/// Converts type alias syntax into a [`NatExpr`] impl.
///
/// # Examples
/// ```
/// #[gnat::nat_expr]
/// type Factorial<N: gnat::NatExpr> = gnat::expr! {
/// if N {
/// Factorial(gnat::Eval(N - 1)) * N
/// } else {
/// 1
/// }
/// };
/// assert_eq!(
/// gnat::to_u128::<Factorial<gnat::lit!(5)>>(),
/// Some(120),
/// );
/// ```
/// Equivalent code without this attribute:
/// ```
/// struct Factorial<N>(N);
/// impl<N: gnat::NatExpr> gnat::NatExpr for Factorial<N> {
/// type Eval = gnat::eval! {
/// if N {
/// Factorial(gnat::Eval(N - 1)) * N
/// } else {
/// 1
/// }
/// };
/// }
/// ```
pub use nat_expr;