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
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
//! Types that can be mapped over two type arguments simultaneously.
//!
//! ### Examples
//!
//! ```
//! use fp_library::{
//! brands::*,
//! functions::explicit::*,
//! };
//!
//! let x = Result::<i32, i32>::Ok(5);
//! let y = bimap::<ResultBrand, _, _, _, _, _, _>((|e| e + 1, |s| s * 2), x);
//! assert_eq!(y, Ok(10));
//! ```
#[fp_macros::document_module]
mod inner {
use {
crate::{
brands::*,
classes::*,
kinds::*,
},
fp_macros::*,
};
/// A type class for types that can be mapped over two type arguments.
///
/// A `Bifunctor` represents a context or container with two type parameters,
/// allowing functions to be applied to values of both types.
///
/// ### Hierarchy Unification
///
/// This trait inherits from [`Kind!(type Of<'a, A: 'a, B: 'a>: 'a;)`](crate::kinds::Kind_266801a817966495), ensuring that all bifunctor
/// contexts satisfy the strict lifetime requirements where both type arguments must
/// outlive the context's application lifetime.
///
/// By explicitly requiring that both type parameters outlive the application lifetime `'a`,
/// we provide the compiler with the necessary guarantees to handle trait objects
/// (like `dyn Fn`) commonly used in bifunctor implementations. This resolves potential
/// E0310 errors where the compiler cannot otherwise prove that captured variables in
/// closures satisfy the required lifetime bounds.
///
/// ### Laws
///
/// `Bifunctor` instances must satisfy the following laws:
/// * Identity: `bimap(identity, identity, p) = p`.
/// * Composition: `bimap(compose(f, g), compose(h, i), p) = bimap(f, h, bimap(g, i, p))`.
#[document_examples]
///
/// Bifunctor laws for [`Result`]:
///
/// ```
/// use fp_library::{
/// brands::*,
/// functions::{
/// explicit::bimap,
/// *,
/// },
/// };
///
/// let ok: Result<i32, i32> = Ok(5);
/// let err: Result<i32, i32> = Err(3);
///
/// // Identity: bimap((identity, identity), p) = p
/// assert_eq!(bimap::<ResultBrand, _, _, _, _, _, _>((identity, identity), ok), ok);
/// assert_eq!(bimap::<ResultBrand, _, _, _, _, _, _>((identity, identity), err), err);
///
/// // Composition: bimap((compose(f, g), compose(h, i)), p)
/// // = bimap((f, h), bimap((g, i), p))
/// let f = |x: i32| x + 1;
/// let g = |x: i32| x * 2;
/// let h = |x: i32| x + 10;
/// let i = |x: i32| x * 3;
/// assert_eq!(
/// bimap::<ResultBrand, _, _, _, _, _, _>((compose(f, g), compose(h, i)), ok),
/// bimap::<ResultBrand, _, _, _, _, _, _>(
/// (f, h),
/// bimap::<ResultBrand, _, _, _, _, _, _>((g, i), ok)
/// ),
/// );
/// assert_eq!(
/// bimap::<ResultBrand, _, _, _, _, _, _>((compose(f, g), compose(h, i)), err),
/// bimap::<ResultBrand, _, _, _, _, _, _>(
/// (f, h),
/// bimap::<ResultBrand, _, _, _, _, _, _>((g, i), err)
/// ),
/// );
/// ```
#[kind(type Of<'a, A: 'a, B: 'a>: 'a;)]
pub trait Bifunctor {
/// Maps functions over the values in the bifunctor context.
///
/// This method applies two functions to the values inside the bifunctor context, producing a new bifunctor context with the transformed values.
#[document_signature]
///
#[document_type_parameters(
"The lifetime of the values.",
"The type of the first value.",
"The type of the first result.",
"The type of the second value.",
"The type of the second result."
)]
///
#[document_parameters(
"The function to apply to the first value.",
"The function to apply to the second value.",
"The bifunctor instance."
)]
///
#[document_returns(
"A new bifunctor instance containing the results of applying the functions."
)]
#[document_examples]
///
/// ```
/// use fp_library::{
/// brands::*,
/// functions::explicit::*,
/// };
///
/// let x = Result::<i32, i32>::Ok(5);
/// let y = bimap::<ResultBrand, _, _, _, _, _, _>((|e| e + 1, |s| s * 2), x);
/// assert_eq!(y, Ok(10));
/// ```
fn bimap<'a, A: 'a, B: 'a, C: 'a, D: 'a>(
f: impl Fn(A) -> B + 'a,
g: impl Fn(C) -> D + 'a,
p: Apply!(<Self as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, A, C>),
) -> Apply!(<Self as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, B, D>);
/// Maps a function over the first type argument of the bifunctor.
///
/// This is a convenience method that maps only over the first (left) type argument,
/// leaving the second unchanged.
/// Corresponds to `lmap` in both Haskell and PureScript.
#[document_signature]
///
#[document_type_parameters(
"The lifetime of the values.",
"The type of the first value.",
"The type of the first result.",
"The type of the second value."
)]
///
#[document_parameters(
"The function to apply to the first value.",
"The bifunctor instance."
)]
///
#[document_returns("A new bifunctor instance with the first value transformed.")]
#[document_examples]
///
/// ```
/// use fp_library::{
/// brands::*,
/// functions::explicit::*,
/// };
///
/// let x = Result::<i32, i32>::Err(5);
/// let y = map_first::<ResultBrand, _, _, _, _, _>(|e| e * 2, x);
/// assert_eq!(y, Err(10));
///
/// let x = Result::<i32, i32>::Ok(5);
/// let y = map_first::<ResultBrand, _, _, _, _, _>(|e| e * 2, x);
/// assert_eq!(y, Ok(5));
/// ```
fn map_first<'a, A: 'a, B: 'a, C: 'a>(
f: impl Fn(A) -> B + 'a,
p: Apply!(<Self as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, A, C>),
) -> Apply!(<Self as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, B, C>) {
Self::bimap(f, crate::functions::identity, p)
}
/// Maps a function over the second type argument of the bifunctor.
///
/// This is a convenience method that maps only over the second (right) type argument,
/// leaving the first unchanged.
/// Corresponds to `rmap` in both Haskell and PureScript.
#[document_signature]
///
#[document_type_parameters(
"The lifetime of the values.",
"The type of the first value.",
"The type of the second value.",
"The type of the second result."
)]
///
#[document_parameters(
"The function to apply to the second value.",
"The bifunctor instance."
)]
///
#[document_returns("A new bifunctor instance with the second value transformed.")]
#[document_examples]
///
/// ```
/// use fp_library::{
/// brands::*,
/// functions::explicit::*,
/// };
///
/// let x = Result::<i32, i32>::Ok(5);
/// let y = map_second::<ResultBrand, _, _, _, _, _>(|s| s * 2, x);
/// assert_eq!(y, Ok(10));
///
/// let x = Result::<i32, i32>::Err(5);
/// let y = map_second::<ResultBrand, _, _, _, _, _>(|s| s * 2, x);
/// assert_eq!(y, Err(5));
/// ```
fn map_second<'a, A: 'a, B: 'a, C: 'a>(
g: impl Fn(B) -> C + 'a,
p: Apply!(<Self as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, A, B>),
) -> Apply!(<Self as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, A, C>) {
Self::bimap(crate::functions::identity, g, p)
}
}
/// Maps functions over the values in the bifunctor context.
///
/// Free function version that dispatches to [the type class' associated function][`Bifunctor::bimap`].
#[document_signature]
///
#[document_type_parameters(
"The lifetime of the values.",
"The brand of the bifunctor.",
"The type of the first value.",
"The type of the first result.",
"The type of the second value.",
"The type of the second result."
)]
///
#[document_parameters(
"The function to apply to the first value.",
"The function to apply to the second value.",
"The bifunctor instance."
)]
///
#[document_returns(
"A new bifunctor instance containing the results of applying the functions."
)]
#[document_examples]
///
/// ```
/// use fp_library::{
/// brands::*,
/// functions::explicit::*,
/// };
///
/// let x = Result::<i32, i32>::Ok(5);
/// let y = bimap::<ResultBrand, _, _, _, _, _, _>((|e| e + 1, |s| s * 2), x);
/// assert_eq!(y, Ok(10));
/// ```
pub fn bimap<'a, Brand: Bifunctor, A: 'a, B: 'a, C: 'a, D: 'a>(
f: impl Fn(A) -> B + 'a,
g: impl Fn(C) -> D + 'a,
p: Apply!(<Brand as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, A, C>),
) -> Apply!(<Brand as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, B, D>) {
Brand::bimap(f, g, p)
}
/// Maps a function over the first type argument of the bifunctor.
///
/// Corresponds to `lmap` in both Haskell and PureScript.
///
/// Free function version that dispatches to [the type class' associated function][`Bifunctor::map_first`].
#[document_signature]
///
#[document_type_parameters(
"The lifetime of the values.",
"The brand of the bifunctor.",
"The type of the first value.",
"The type of the first result.",
"The type of the second value."
)]
///
#[document_parameters("The function to apply to the first value.", "The bifunctor instance.")]
///
#[document_returns("A new bifunctor instance with the first value transformed.")]
#[document_examples]
///
/// ```
/// use fp_library::{
/// brands::*,
/// functions::explicit::*,
/// };
///
/// let x = Result::<i32, i32>::Err(5);
/// let y = map_first::<ResultBrand, _, _, _, _, _>(|e| e * 2, x);
/// assert_eq!(y, Err(10));
///
/// let x = Result::<i32, i32>::Ok(5);
/// let y = map_first::<ResultBrand, _, _, _, _, _>(|e| e * 2, x);
/// assert_eq!(y, Ok(5));
/// ```
pub fn map_first<'a, Brand: Bifunctor, A: 'a, B: 'a, C: 'a>(
f: impl Fn(A) -> B + 'a,
p: Apply!(<Brand as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, A, C>),
) -> Apply!(<Brand as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, B, C>) {
Brand::map_first(f, p)
}
/// Maps a function over the second type argument of the bifunctor.
///
/// Corresponds to `rmap` in both Haskell and PureScript.
///
/// Free function version that dispatches to [the type class' associated function][`Bifunctor::map_second`].
#[document_signature]
///
#[document_type_parameters(
"The lifetime of the values.",
"The brand of the bifunctor.",
"The type of the first value.",
"The type of the second value.",
"The type of the second result."
)]
///
#[document_parameters("The function to apply to the second value.", "The bifunctor instance.")]
///
#[document_returns("A new bifunctor instance with the second value transformed.")]
#[document_examples]
///
/// ```
/// use fp_library::{
/// brands::*,
/// functions::explicit::*,
/// };
///
/// let x = Result::<i32, i32>::Ok(5);
/// let y = map_second::<ResultBrand, _, _, _, _, _>(|s| s * 2, x);
/// assert_eq!(y, Ok(10));
///
/// let x = Result::<i32, i32>::Err(5);
/// let y = map_second::<ResultBrand, _, _, _, _, _>(|s| s * 2, x);
/// assert_eq!(y, Err(5));
/// ```
pub fn map_second<'a, Brand: Bifunctor, A: 'a, B: 'a, C: 'a>(
g: impl Fn(B) -> C + 'a,
p: Apply!(<Brand as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, A, B>),
) -> Apply!(<Brand as Kind!( type Of<'a, A: 'a, B: 'a>: 'a; )>::Of<'a, A, C>) {
Brand::map_second(g, p)
}
impl_kind! {
impl<Brand: Bifunctor, A: 'static> for BifunctorFirstAppliedBrand<Brand, A> {
type Of<'a, B: 'a>: 'a = Apply!(<Brand as Kind!(type Of<'a, T: 'a, U: 'a>: 'a;)>::Of<'a, A, B>);
}
}
/// [`Functor`] instance for [`BifunctorFirstAppliedBrand`].
///
/// Maps over the first type parameter of a bifunctor by delegating to [`Bifunctor::bimap`]
/// with [`identity`](crate::functions::identity) for the second argument.
#[document_type_parameters("The bifunctor brand.", "The fixed second type parameter.")]
impl<Brand: Bifunctor, A: 'static> Functor for BifunctorFirstAppliedBrand<Brand, A> {
/// Map a function over the first type parameter.
#[document_signature]
#[document_type_parameters(
"The lifetime of the values.",
"The input type.",
"The output type."
)]
#[document_parameters("The function to apply.", "The bifunctor value to map over.")]
#[document_returns("The mapped bifunctor value.")]
#[document_examples]
///
/// ```
/// use fp_library::{
/// brands::*,
/// functions::explicit::*,
/// };
///
/// let x = Result::<i32, i32>::Ok(5);
/// let y = map::<BifunctorFirstAppliedBrand<ResultBrand, i32>, _, _, _, _>(|s| s * 2, x);
/// assert_eq!(y, Ok(10));
/// ```
fn map<'a, B: 'a, C: 'a>(
f: impl Fn(B) -> C + 'a,
fa: Apply!(<Self as Kind!( type Of<'a, T: 'a>: 'a; )>::Of<'a, B>),
) -> Apply!(<Self as Kind!( type Of<'a, T: 'a>: 'a; )>::Of<'a, C>) {
Brand::bimap(crate::functions::identity, f, fa)
}
}
impl_kind! {
impl<Brand: Bifunctor, B: 'static> for BifunctorSecondAppliedBrand<Brand, B> {
type Of<'a, A: 'a>: 'a = Apply!(<Brand as Kind!(type Of<'a, T: 'a, U: 'a>: 'a;)>::Of<'a, A, B>);
}
}
/// [`Functor`] instance for [`BifunctorSecondAppliedBrand`].
///
/// Maps over the second type parameter of a bifunctor by delegating to [`Bifunctor::bimap`]
/// with [`identity`](crate::functions::identity) for the first argument.
#[document_type_parameters("The bifunctor brand.", "The fixed first type parameter.")]
impl<Brand: Bifunctor, B: 'static> Functor for BifunctorSecondAppliedBrand<Brand, B> {
/// Map a function over the second type parameter.
#[document_signature]
#[document_type_parameters(
"The lifetime of the values.",
"The input type.",
"The output type."
)]
#[document_parameters("The function to apply.", "The bifunctor value to map over.")]
#[document_returns("The mapped bifunctor value.")]
#[document_examples]
///
/// ```
/// use fp_library::{
/// brands::*,
/// functions::explicit::*,
/// };
///
/// let x = Result::<i32, i32>::Err(5);
/// let y = map::<BifunctorSecondAppliedBrand<ResultBrand, i32>, _, _, _, _>(|e| e * 2, x);
/// assert_eq!(y, Err(10));
/// ```
fn map<'a, A: 'a, C: 'a>(
f: impl Fn(A) -> C + 'a,
fa: Apply!(<Self as Kind!( type Of<'a, T: 'a>: 'a; )>::Of<'a, A>),
) -> Apply!(<Self as Kind!( type Of<'a, T: 'a>: 'a; )>::Of<'a, C>) {
Brand::bimap(f, crate::functions::identity, fa)
}
}
}
pub use inner::*;