former 2.44.0

A flexible implementation of the Builder pattern supporting nested builders and collection-specific subformers. Simplify the construction of complex objects.
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

#![allow(clippy::used_underscore_binding, clippy::all, warnings, missing_docs)]
#![allow(dead_code)]

#[ allow( unused_imports ) ]
use super::*;
#[ allow( unused_imports ) ]
use test_tools::a_id;
#[ allow( unused_imports ) ]
use collection_tools::BinaryHeap;
use the_module::BinaryHeapExt;

#[ test ]
fn add() {
  // explicit with CollectionFormer

  let got: BinaryHeap<String> = the_module::CollectionFormer::<
    String,
    former::BinaryHeapDefinition<String, (), BinaryHeap<String>, the_module::ReturnStorage>,
  >::new(former::ReturnStorage)
  .add("a")
  .add("b")
  .form();
  let exp = collection_tools::heap!["a".to_string(), "b".to_string(),];
  a_id!(got.into_sorted_vec(), exp.into_sorted_vec());

  // explicit with BinaryHeapFormer

  let got: BinaryHeap<String> =
    the_module::BinaryHeapFormer::<String, (), BinaryHeap<String>, the_module::ReturnStorage>::new(former::ReturnStorage)
      .add("a")
      .add("b")
      .form();
  let exp = collection_tools::heap!["a".to_string(), "b".to_string(),];
  a_id!(got.into_sorted_vec(), exp.into_sorted_vec());

  // compact with BinaryHeapFormer

  let got: BinaryHeap<String> = the_module::BinaryHeapFormer::new(former::ReturnStorage)
    .add("a")
    .add("b")
    .form();
  let exp = collection_tools::heap!["a".to_string(), "b".to_string(),];
  a_id!(got.into_sorted_vec(), exp.into_sorted_vec());

  // with begin_coercing

  let got: BinaryHeap<String> = the_module::BinaryHeapFormer::begin(
    Some(collection_tools::heap!["a".to_string()]),
    Some(()),
    former::ReturnStorage,
  )
  .add("b")
  .form();
  let exp = collection_tools::heap!["a".to_string(), "b".to_string(),];
  a_id!(got.into_sorted_vec(), exp.into_sorted_vec());

  // with help of ext

  let got: BinaryHeap<String> = BinaryHeap::former().add("a").add("b").form();
  let exp = collection_tools::heap!["a".to_string(), "b".to_string(),];
  a_id!(got.into_sorted_vec(), exp.into_sorted_vec());

  //
}

// qqq : zzz : remove #[ cfg( not( feature = "use_alloc" ) ) ] -- done
// #[ cfg( not( feature = "use_alloc" ) ) ]
#[ test ]
fn replace() {
  let got: BinaryHeap<String> = the_module::BinaryHeapFormer::new(former::ReturnStorage)
    .add("x")
    .replace(collection_tools::heap!["a".to_string(), "b".to_string()])
    .form();
  let exp = collection_tools::heap!["a".to_string(), "b".to_string(),];
  a_id!(got.into_sorted_vec(), exp.into_sorted_vec());
}

#[ test ]
fn entity_to() {
  let got = <BinaryHeap<i32> as former::EntityToFormer<
    former::BinaryHeapDefinition<i32, (), BinaryHeap<i32>, former::ReturnStorage>,
  >>::Former::new(former::ReturnStorage)
  .add(13)
  .form();
  let exp = collection_tools::heap![13];
  a_id!(got.into_sorted_vec(), exp.into_sorted_vec());

  let got = <BinaryHeap<i32> as former::EntityToStorage>::Storage::default();
  let exp = <BinaryHeap<i32> as former::EntityToFormer<
    former::BinaryHeapDefinition<i32, (), BinaryHeap<i32>, former::ReturnStorage>,
  >>::Former::new(former::ReturnStorage)
  .form();
  a_id!(got.into_sorted_vec(), exp.into_sorted_vec());

  let got = <BinaryHeap<i32> as former::EntityToStorage>::Storage::default();
  let exp = <BinaryHeap<i32> as former::EntityToFormer<
    <BinaryHeap<i32> as former::EntityToDefinition<(), BinaryHeap<i32>, former::ReturnPreformed>>::Definition,
  >>::Former::new(former::ReturnPreformed)
  .form();
  a_id!(got.into_sorted_vec(), exp.into_sorted_vec());
}

#[ test ]
fn entry_to_val() {
  let got = former::EntryToVal::<BinaryHeap<i32>>::entry_to_val(13i32);
  let exp = 13i32;
  a_id!(got, exp);
}

#[ test ]
fn val_to_entry() {
  let got = former::ValToEntry::<BinaryHeap<i32>>::val_to_entry(13i32);
  let exp = 13i32;
  a_id!(got, exp);
}

#[ test ]
fn subformer() {
  /// Parameter description.
  #[ derive( Clone, Debug, Default, PartialEq, Eq, PartialOrd, Ord, the_module::Former ) ]
  pub struct Child {
    name: String,
    data: bool,
  }

  /// Parent required for the template.
  #[ derive( Debug, Default, the_module::Former ) ]
  pub struct Parent {
    #[ subform_collection( definition = former::BinaryHeapDefinition ) ]
    children: BinaryHeap<Child>,
  }

  impl PartialEq<Parent> for Parent {
    fn eq(&self, other: &Parent) -> bool {
      self.children.clone().into_sorted_vec() == other.children.clone().into_sorted_vec()
    }
  }

  let got = Parent::former()
    .children()
    .add(Child::former().name("a").form())
    .add(Child::former().name("b").form())
    .end()
    .form();

  let children = collection_tools::heap![
    Child {
      name: "a".to_string(),
      data: false
    },
    Child {
      name: "b".to_string(),
      data: false
    },
  ];
  let exp = Parent { children };
  a_id!(got, exp);
}