typestate-builder-macro 0.1.4

Derive-macro-based generator that combines `Typestate` and `Builder` patterns.
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
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
427
428
429
430
431
// Copyright (c) 2024 Andy Allison
//
// Licensed under either of
//
// * MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
// * Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
//
// at your option.
//
// Unless you explicitly state otherwise, any contribution intentionally submitted
// for inclusion in the work by you, as defined in the Apache-2.0 license, shall
// be dual licensed as above, without any additional terms or conditions.

use std::{borrow::Cow, rc::Rc};

use indexmap::IndexMap;
use petgraph::graph::{EdgeIndex, NodeIndex};
use proc_macro2::Span;
use quote::{format_ident, quote};

use crate::{
    graph::{
        mapkey, msg, traverse, traverse_mut, BuilderStateAdded, StructElement, StructGraph,
        StructRelation,
    },
    helper,
};

pub fn run(graph: &mut StructGraph, map: &mut IndexMap<String, NodeIndex>) {
    create_builder(graph, map);
    create_builder_states(graph, map);
}

fn create_builder(graph: &mut StructGraph, map: &mut IndexMap<String, NodeIndex>) {
    /* ✅ #TD10362896 Create builder. */
    let Some(ix) = map.get(mapkey::uniq::IDENT) else {
        panic!("{}", msg::ix::IDENT);
    };
    let StructElement::Ident(ident) = &graph[*ix] else {
        panic!("{}", msg::node::IDENT);
    };
    let ident = format_ident!("{}Builder", ident);
    let ix_builder = graph.add_node(StructElement::BuilderIdent(Rc::new(ident)));
    map.insert(mapkey::uniq::BUILDER_IDENT.to_string(), ix_builder);

    if let Some(ix) = map.get(mapkey::startp::FIELD) {
        /* ✅ #TD92175615 Traverse on field train. */
        let action = |graph: &StructGraph, _edge, field_node| {
            let StructElement::Field(field) = &graph[field_node] else {
                panic!("{}", msg::node::FIELD);
            };
            let ident_str = field
                .syn
                .ident
                .as_ref()
                .map(|f| f.to_string())
                .unwrap_or_else(|| format!("field{}", field.nth));
            let ident = syn::Ident::new(&ident_str, Span::call_site());
            let mut ident_tc_str = helper::string::to_titlecase(&ident_str);
            ident_tc_str.push_str("GenericParam");
            let ident_tc = syn::Ident::new(&ident_tc_str, Span::call_site());
            (field_node, ident, ident_tc)
        };
        let builder_data = traverse(
            graph,
            Some(&[&StructRelation::FieldTrain]),
            *ix,
            true,
            action,
        );

        /* ✅ #TD52440080 Create builder fields, generics and their relations. */
        let mut predecessor_ident = None;
        let mut predecessor_ident_tc = None;
        for (i, (field_node, ident, ident_tc)) in builder_data.into_iter().enumerate() {
            /* ✅ #TD72341053 Field */
            let successor_field = graph.add_node(StructElement::BuilderField(Rc::new(ident)));
            if let Some(predecessor) = predecessor_ident.take() {
                graph.add_edge(
                    predecessor,
                    successor_field,
                    StructRelation::BuilderFieldTrain,
                );
            }
            predecessor_ident.get_or_insert(successor_field);
            let node_string = stringify!(BuilderField);
            let key = format!("{}{}", node_string, i);
            map.insert(key, successor_field);
            graph.add_edge(
                field_node,
                successor_field,
                StructRelation::FieldToBuilderField,
            );

            /* ✅ #TD45099623 Generic */
            let successor_generic =
                graph.add_node(StructElement::BuilderGeneric(Rc::new(ident_tc)));
            if let Some(predecessor) = predecessor_ident_tc.take() {
                graph.add_edge(
                    predecessor,
                    successor_generic,
                    StructRelation::BuilderGenericTrain,
                );
            }
            predecessor_ident_tc.get_or_insert(successor_generic);
            let node_string = stringify!(BuilderGeneric);
            let key = format!("{}{}", node_string, i);
            map.insert(key, successor_generic);
            graph.add_edge(
                successor_field,
                successor_generic,
                StructRelation::BuilderFieldToBuilderGeneric,
            );
        }
    }
}

fn create_builder_states(graph: &mut StructGraph, map: &mut IndexMap<String, NodeIndex>) {
    /* ✅ #TD44491595 Traverse on field train. */
    if let Some(start) = map.get(mapkey::startp::FIELD) {
        let action = |graph: &mut StructGraph, _edge, field_node| {
            /* ✅ #TD78515467 All data to create two-legged state structs. */
            let BuilderStatePair {
                main_ident,
                ident,
                ty,
                field_to_main_lifetimes,
                field_to_main_consts,
                field_to_main_types,
                field_to_where_predicates,
            } = BuilderStatePair::new(graph, field_node, map);

            /* ✅ #TD93602268 Idents of pair. */
            let ident_empty = format_ident!(
                "{}{}Empty",
                main_ident,
                helper::string::to_titlecase(&ident.to_string())
            );
            let ident_added = format_ident!(
                "{}{}Added",
                main_ident,
                helper::string::to_titlecase(&ident.to_string())
            );

            /* ✅ #TD39331204 Create field generics. */
            let len_additions = field_to_where_predicates.len() * 2;
            let len_generics = field_to_main_lifetimes.len()
                + field_to_main_consts.len()
                + field_to_main_types.len()
                + len_additions;
            let mut generics = Vec::with_capacity(len_generics);
            let mut generics_additions = Vec::with_capacity(len_generics);

            /* ✅ #TD13775189 Phantoms init */
            let mut phantoms = Vec::with_capacity(field_to_where_predicates.len());

            /* ✅ #TD15379408 Orphans init. */
            let mut orphans = Vec::new();

            /* ✅ #TD18715806 Determining where predicates related to the field. */
            let mut where_predicates = Vec::with_capacity(field_to_where_predicates.len());
            for field_to_where_predicate in field_to_where_predicates {
                let mut predicate = (*field_to_where_predicate.wp).clone();

                /* 🌀 COMPLEXITY #CP60692702 Orphan wp right lifetimes. Add Higher-ranked trait bounds for them (ForLifetimes). */
                /* ✅ DEBUGGED #BG46782643 Register Higher-ranked trait bound when it's used. */
                {
                    let orphan_lts = field_to_where_predicate
                        .right_lifetimes_in_generics
                        .into_iter()
                        .filter(|p0| {
                            !field_to_main_lifetimes
                                .iter()
                                .any(|p1| compare_generic_params(p0, p1))
                        })
                        .map(|f| (*f).clone())
                        .collect::<Vec<_>>();

                    match &mut predicate {
                        syn::WherePredicate::Lifetime(_predicate_lifetime) => unimplemented!(),
                        syn::WherePredicate::Type(predicate_type) => {
                            if let Some(blts) = &mut predicate_type.lifetimes {
                                blts.lifetimes.extend(orphan_lts.clone());
                                orphans.extend(orphan_lts);
                            } else if !orphan_lts.is_empty() {
                                let mut new_hrtb = syn::BoundLifetimes::default();
                                new_hrtb.lifetimes.extend(orphan_lts.clone());
                                orphans.extend(orphan_lts);
                                predicate_type.lifetimes = Some(new_hrtb);
                            }
                        }
                        _ => unimplemented!(),
                    }
                }

                /* 🌀 COMPLEXITY #CP64472417 Orphan wp right types. Add type parameters in the main generics. */
                {
                    let filter = field_to_where_predicate
                        .right_types_in_generics
                        .into_iter()
                        .filter(|p0| {
                            !field_to_main_types
                                .iter()
                                .any(|p1| compare_generic_params(p0, p1))
                        })
                        .collect::<Vec<_>>();
                    generics_additions.extend(filter);
                }

                /* 🌀 COMPLEXITY #CP34264506 Using phantoms is needed some sub generic parameters. Add type parameters in the main generics and in the tuple as phantom data. */
                {
                    let filter = field_to_where_predicate
                        .right_types_phantoms_in_generics
                        .into_iter()
                        .filter(|p0| {
                            !field_to_main_types
                                .iter()
                                .any(|p1| compare_generic_params(p0, p1))
                        })
                        .collect::<Vec<_>>();
                    for phantom in filter.iter() {
                        phantoms.push(quote! { std::marker::PhantomData<#phantom> });
                    }
                    generics_additions.extend(filter);
                }

                /* ✅ #TD60868169 Finally push produced predicate. */
                where_predicates.push(Rc::new(predicate));
            }

            /* ✅ #TD76108810 Determining main generics related to the field. */
            generics.extend(field_to_main_lifetimes);
            generics.extend(field_to_main_consts);
            generics.extend(field_to_main_types);
            generics.extend(generics_additions);

            /* ✅ #TD51147690 Add nodes and the pair edge. */
            let ty = ty.clone();
            let ix_state_empty =
                graph.add_node(StructElement::BuilderStateEmpty(Rc::new(ident_empty)));
            let ix_state_added = graph.add_node(StructElement::BuilderStateAdded(Rc::new(
                BuilderStateAdded {
                    ident: ident_added,
                    generics,
                    ty,
                    where_predicates,
                    phantoms,
                    orphans,
                },
            )));
            graph.add_edge(
                ix_state_empty,
                ix_state_added,
                StructRelation::BuilderStatePair,
            );

            /* ✅ #TD64139852 Traverse to builder field to connect to the state pair. */
            let action = |graph: &mut StructGraph, _edge, builder_field_node| {
                graph.add_edge(
                    builder_field_node,
                    ix_state_empty,
                    StructRelation::BuilderFieldToBuilderState,
                );
            };
            traverse_mut(
                graph,
                Some(&[&StructRelation::FieldToBuilderField]),
                field_node,
                false,
                action,
            );
        };
        traverse_mut(
            graph,
            Some(&[&StructRelation::FieldTrain]),
            *start,
            true,
            action,
        );
    }
}

fn compare_generic_params(p0: &Rc<syn::GenericParam>, p1: &Rc<syn::GenericParam>) -> bool {
    match (p0.as_ref(), p1.as_ref()) {
        (
            syn::GenericParam::Lifetime(lifetime_param0),
            syn::GenericParam::Lifetime(lifetime_param1),
        ) => lifetime_param0.lifetime == lifetime_param1.lifetime,
        (syn::GenericParam::Type(type_param0), syn::GenericParam::Type(type_param1)) => {
            type_param0.ident == type_param1.ident
        }
        _ => false,
    }
}

struct FieldToWherePredicate {
    wp: Rc<syn::WherePredicate>,
    right_lifetimes_in_generics: Vec<Rc<syn::GenericParam>>,
    right_types_in_generics: Vec<Rc<syn::GenericParam>>,
    right_types_phantoms_in_generics: Vec<Rc<syn::GenericParam>>,
}

struct BuilderStatePair<'a> {
    main_ident: syn::Ident,
    ident: Cow<'a, syn::Ident>,
    ty: &'a syn::Type,
    field_to_main_lifetimes: Vec<Rc<syn::GenericParam>>,
    field_to_main_consts: Vec<Rc<syn::GenericParam>>,
    field_to_main_types: Vec<Rc<syn::GenericParam>>,
    field_to_where_predicates: Vec<FieldToWherePredicate>,
}

impl<'a> BuilderStatePair<'a> {
    fn new(
        graph: &'a mut StructGraph,
        field_node: NodeIndex,
        map: &'a IndexMap<String, NodeIndex>,
    ) -> Self {
        let StructElement::Field(field) = &graph[field_node] else {
            panic!("{}", msg::node::FIELD);
        };
        let Some(StructElement::Ident(main_ident)) = map.get("Ident").map(|f| &graph[*f]) else {
            panic!("Struct must have an ident.");
        };
        let main_ident = format_ident!("{}Builder", main_ident);
        let ident = if let Some(ident) = &field.syn.ident {
            Cow::Borrowed(ident)
        } else {
            Cow::Owned(syn::Ident::new(
                &format!("field{}", field.nth),
                Span::call_site(),
            ))
        };
        let field_to_main_lifetimes = traverse(
            graph,
            Some(&[&StructRelation::FieldGenericInMainLifetime]),
            field_node,
            false,
            Self::traverse_field_to_main_generics,
        );
        let field_to_main_consts = traverse(
            graph,
            Some(&[&StructRelation::FieldGenericInMainConst]),
            field_node,
            false,
            Self::traverse_field_to_main_generics,
        );
        let field_to_main_types = traverse(
            graph,
            Some(&[&StructRelation::FieldGenericInMainType]),
            field_node,
            false,
            Self::traverse_field_to_main_generics,
        );
        let field_to_where_predicates = traverse(
            graph,
            Some(&[&StructRelation::FieldGenericInWhereClause]),
            field_node,
            false,
            Self::traverse_field_to_where_predicate,
        );
        Self {
            main_ident,
            ident,
            ty: &field.syn.ty,
            field_to_main_lifetimes,
            field_to_main_consts,
            field_to_main_types,
            field_to_where_predicates,
        }
    }

    fn traverse_field_to_main_generics(
        graph: &StructGraph,
        _edge: Option<EdgeIndex>,
        generic_node: NodeIndex,
    ) -> Rc<syn::GenericParam> {
        let StructElement::Generic(generic) = &graph[generic_node] else {
            panic!("{}", msg::node::GENERIC);
        };
        Rc::clone(&generic.syn)
    }

    fn traverse_field_to_where_predicate(
        graph: &StructGraph,
        _edge: Option<EdgeIndex>,
        wp_node: NodeIndex,
    ) -> FieldToWherePredicate {
        let StructElement::WherePredicate(wp) = &graph[wp_node] else {
            panic!("{}", msg::node::WP);
        };
        let right_lifetimes_in_generics = traverse(
            graph,
            Some(&[&StructRelation::WPRightBoundingLifetimeInMain]),
            wp_node,
            false,
            Self::traverse_wp_to_main_generics,
        );
        let right_types_in_generics = traverse(
            graph,
            Some(&[&StructRelation::WPRightBoundingTypeInMain]),
            wp_node,
            false,
            Self::traverse_wp_to_main_generics,
        );
        let right_types_phantoms_in_generics = traverse(
            graph,
            Some(&[&StructRelation::WPRightBoundingTypePhantomInMain]),
            wp_node,
            false,
            Self::traverse_wp_to_main_generics,
        );
        FieldToWherePredicate {
            wp: Rc::clone(&wp.syn),
            right_lifetimes_in_generics,
            right_types_in_generics,
            right_types_phantoms_in_generics,
        }
    }

    fn traverse_wp_to_main_generics(
        graph: &StructGraph,
        _edge: Option<EdgeIndex>,
        generic_node: NodeIndex,
    ) -> Rc<syn::GenericParam> {
        let StructElement::Generic(generic) = &graph[generic_node] else {
            panic!("{}", msg::node::GENERIC);
        };
        Rc::clone(&generic.syn)
    }
}