1 + | // Code generated by software.amazon.smithy.rust.codegen.smithy-rs. DO NOT EDIT.
|
2 + |
|
3 + | pub(crate) mod map_of_enum_string_constrained {
|
4 + |
|
5 + | #[derive(Debug, Clone)]
|
6 + | pub(crate) struct MapOfEnumStringConstrained(
|
7 + | pub(crate) std::collections::HashMap<crate::model::EnumString, crate::model::EnumString>,
|
8 + | );
|
9 + |
|
10 + | impl crate::constrained::Constrained for MapOfEnumStringConstrained {
|
11 + | type Unconstrained =
|
12 + | crate::unconstrained::map_of_enum_string_unconstrained::MapOfEnumStringUnconstrained;
|
13 + | }
|
14 + | impl ::std::convert::From<MapOfEnumStringConstrained>
|
15 + | for ::std::collections::HashMap<crate::model::EnumString, crate::model::EnumString>
|
16 + | {
|
17 + | fn from(v: MapOfEnumStringConstrained) -> Self {
|
18 + | v.0
|
19 + | }
|
20 + | }
|
21 + | }
|
22 + | pub(crate) mod map_of_list_of_length_pattern_string_constrained {
|
23 + |
|
24 + | #[derive(Debug, Clone)]
|
25 + | pub(crate) struct MapOfListOfLengthPatternStringConstrained(pub(crate) std::collections::HashMap<crate::model::LengthPatternString, crate::constrained::list_of_length_pattern_string_constrained::ListOfLengthPatternStringConstrained>);
|
26 + |
|
27 + | impl crate::constrained::Constrained for MapOfListOfLengthPatternStringConstrained {
|
28 + | type Unconstrained = crate::unconstrained::map_of_list_of_length_pattern_string_unconstrained::MapOfListOfLengthPatternStringUnconstrained;
|
29 + | }
|
30 + | impl ::std::convert::From<MapOfListOfLengthPatternStringConstrained>
|
31 + | for ::std::collections::HashMap<
|
32 + | ::std::string::String,
|
33 + | ::std::vec::Vec<::std::string::String>,
|
34 + | >
|
35 + | {
|
36 + | fn from(v: MapOfListOfLengthPatternStringConstrained) -> Self {
|
37 + | v.0.into_iter()
|
38 + | .map(|(k, v)| {
|
39 + | let k = k.into();
|
40 + | let v = { v.into() };
|
41 + | (k, v)
|
42 + | })
|
43 + | .collect()
|
44 + | }
|
45 + | }
|
46 + | }
|
47 + | pub(crate) mod list_of_length_pattern_string_constrained {
|
48 + |
|
49 + | #[derive(Debug, Clone)]
|
50 + | pub(crate) struct ListOfLengthPatternStringConstrained(
|
51 + | pub(crate) std::vec::Vec<crate::model::LengthPatternString>,
|
52 + | );
|
53 + |
|
54 + | impl crate::constrained::Constrained for ListOfLengthPatternStringConstrained {
|
55 + | type Unconstrained = crate::unconstrained::list_of_length_pattern_string_unconstrained::ListOfLengthPatternStringUnconstrained;
|
56 + | }
|
57 + | impl ::std::convert::From<ListOfLengthPatternStringConstrained>
|
58 + | for ::std::vec::Vec<::std::string::String>
|
59 + | {
|
60 + | fn from(v: ListOfLengthPatternStringConstrained) -> Self {
|
61 + | v.0.into_iter().map(|item| item.into()).collect()
|
62 + | }
|
63 + | }
|
64 + | }
|
65 + | pub(crate) mod map_of_length_pattern_string_constrained {
|
66 + |
|
67 + | #[derive(Debug, Clone)]
|
68 + | pub(crate) struct MapOfLengthPatternStringConstrained(
|
69 + | pub(crate) std::collections::HashMap<
|
70 + | crate::model::LengthPatternString,
|
71 + | crate::model::LengthPatternString,
|
72 + | >,
|
73 + | );
|
74 + |
|
75 + | impl crate::constrained::Constrained for MapOfLengthPatternStringConstrained {
|
76 + | type Unconstrained = crate::unconstrained::map_of_length_pattern_string_unconstrained::MapOfLengthPatternStringUnconstrained;
|
77 + | }
|
78 + | impl ::std::convert::From<MapOfLengthPatternStringConstrained>
|
79 + | for ::std::collections::HashMap<::std::string::String, ::std::string::String>
|
80 + | {
|
81 + | fn from(v: MapOfLengthPatternStringConstrained) -> Self {
|
82 + | v.0.into_iter()
|
83 + | .map(|(k, v)| {
|
84 + | let k = k.into();
|
85 + | let v = { v.into() };
|
86 + | (k, v)
|
87 + | })
|
88 + | .collect()
|
89 + | }
|
90 + | }
|
91 + | }
|
92 + | pub(crate) mod map_of_list_of_pattern_string_constrained {
|
93 + |
|
94 + | #[derive(Debug, Clone)]
|
95 + | pub(crate) struct MapOfListOfPatternStringConstrained(
|
96 + | pub(crate) std::collections::HashMap<
|
97 + | crate::model::PatternString,
|
98 + | crate::constrained::list_of_pattern_string_constrained::ListOfPatternStringConstrained,
|
99 + | >,
|
100 + | );
|
101 + |
|
102 + | impl crate::constrained::Constrained for MapOfListOfPatternStringConstrained {
|
103 + | type Unconstrained = crate::unconstrained::map_of_list_of_pattern_string_unconstrained::MapOfListOfPatternStringUnconstrained;
|
104 + | }
|
105 + | impl ::std::convert::From<MapOfListOfPatternStringConstrained>
|
106 + | for ::std::collections::HashMap<
|
107 + | ::std::string::String,
|
108 + | ::std::vec::Vec<::std::string::String>,
|
109 + | >
|
110 + | {
|
111 + | fn from(v: MapOfListOfPatternStringConstrained) -> Self {
|
112 + | v.0.into_iter()
|
113 + | .map(|(k, v)| {
|
114 + | let k = k.into();
|
115 + | let v = { v.into() };
|
116 + | (k, v)
|
117 + | })
|
118 + | .collect()
|
119 + | }
|
120 + | }
|
121 + | }
|
122 + | pub(crate) mod list_of_pattern_string_constrained {
|
123 + |
|
124 + | #[derive(Debug, Clone)]
|
125 + | pub(crate) struct ListOfPatternStringConstrained(
|
126 + | pub(crate) std::vec::Vec<crate::model::PatternString>,
|
127 + | );
|
128 + |
|
129 + | impl crate::constrained::Constrained for ListOfPatternStringConstrained {
|
130 + | type Unconstrained = crate::unconstrained::list_of_pattern_string_unconstrained::ListOfPatternStringUnconstrained;
|
131 + | }
|
132 + | impl ::std::convert::From<ListOfPatternStringConstrained>
|
133 + | for ::std::vec::Vec<::std::string::String>
|
134 + | {
|
135 + | fn from(v: ListOfPatternStringConstrained) -> Self {
|
136 + | v.0.into_iter().map(|item| item.into()).collect()
|
137 + | }
|
138 + | }
|
139 + | }
|
140 + | pub(crate) mod map_of_pattern_string_constrained {
|
141 + |
|
142 + | #[derive(Debug, Clone)]
|
143 + | pub(crate) struct MapOfPatternStringConstrained(
|
144 + | pub(crate)
|
145 + | std::collections::HashMap<crate::model::PatternString, crate::model::PatternString>,
|
146 + | );
|
147 + |
|
148 + | impl crate::constrained::Constrained for MapOfPatternStringConstrained {
|
149 + | type Unconstrained = crate::unconstrained::map_of_pattern_string_unconstrained::MapOfPatternStringUnconstrained;
|
150 + | }
|
151 + | impl ::std::convert::From<MapOfPatternStringConstrained>
|
152 + | for ::std::collections::HashMap<::std::string::String, ::std::string::String>
|
153 + | {
|
154 + | fn from(v: MapOfPatternStringConstrained) -> Self {
|
155 + | v.0.into_iter()
|
156 + | .map(|(k, v)| {
|
157 + | let k = k.into();
|
158 + | let v = { v.into() };
|
159 + | (k, v)
|
160 + | })
|
161 + | .collect()
|
162 + | }
|
163 + | }
|
164 + | }
|
165 + | pub(crate) mod map_of_list_of_enum_string_constrained {
|
166 + |
|
167 + | #[derive(Debug, Clone)]
|
168 + | pub(crate) struct MapOfListOfEnumStringConstrained(
|
169 + | pub(crate) std::collections::HashMap<
|
170 + | crate::model::EnumString,
|
171 + | crate::constrained::list_of_enum_string_constrained::ListOfEnumStringConstrained,
|
172 + | >,
|
173 + | );
|
174 + |
|
175 + | impl crate::constrained::Constrained for MapOfListOfEnumStringConstrained {
|
176 + | type Unconstrained = crate::unconstrained::map_of_list_of_enum_string_unconstrained::MapOfListOfEnumStringUnconstrained;
|
177 + | }
|
178 + | impl ::std::convert::From<MapOfListOfEnumStringConstrained>
|
179 + | for ::std::collections::HashMap<
|
180 + | crate::model::EnumString,
|
181 + | ::std::vec::Vec<crate::model::EnumString>,
|
182 + | >
|
183 + | {
|
184 + | fn from(v: MapOfListOfEnumStringConstrained) -> Self {
|
185 + | v.0.into_iter()
|
186 + | .map(|(k, v)| {
|
187 + | let v = { v.into() };
|
188 + | (k, v)
|
189 + | })
|
190 + | .collect()
|
191 + | }
|
192 + | }
|
193 + | }
|
194 + | pub(crate) mod list_of_enum_string_constrained {
|
195 + |
|
196 + | #[derive(Debug, Clone)]
|
197 + | pub(crate) struct ListOfEnumStringConstrained(
|
198 + | pub(crate) std::vec::Vec<crate::model::EnumString>,
|
199 + | );
|
200 + |
|
201 + | impl crate::constrained::Constrained for ListOfEnumStringConstrained {
|
202 + | type Unconstrained =
|
203 + | crate::unconstrained::list_of_enum_string_unconstrained::ListOfEnumStringUnconstrained;
|
204 + | }
|
205 + | impl ::std::convert::From<ListOfEnumStringConstrained>
|
206 + | for ::std::vec::Vec<crate::model::EnumString>
|
207 + | {
|
208 + | fn from(v: ListOfEnumStringConstrained) -> Self {
|
209 + | v.0
|
210 + | }
|
211 + | }
|
212 + | }
|
213 + | pub(crate) mod map_of_length_list_of_pattern_string_constrained {
|
214 + |
|
215 + | #[derive(Debug, Clone)]
|
216 + | pub(crate) struct MapOfLengthListOfPatternStringConstrained(
|
217 + | pub(crate) std::collections::HashMap<
|
218 + | crate::model::PatternString,
|
219 + | crate::model::LengthListOfPatternString,
|
220 + | >,
|
221 + | );
|
222 + |
|
223 + | impl crate::constrained::Constrained for MapOfLengthListOfPatternStringConstrained {
|
224 + | type Unconstrained = crate::unconstrained::map_of_length_list_of_pattern_string_unconstrained::MapOfLengthListOfPatternStringUnconstrained;
|
225 + | }
|
226 + | impl ::std::convert::From<MapOfLengthListOfPatternStringConstrained>
|
227 + | for ::std::collections::HashMap<
|
228 + | ::std::string::String,
|
229 + | ::std::vec::Vec<::std::string::String>,
|
230 + | >
|
231 + | {
|
232 + | fn from(v: MapOfLengthListOfPatternStringConstrained) -> Self {
|
233 + | v.0.into_iter()
|
234 + | .map(|(k, v)| {
|
235 + | let k = k.into();
|
236 + | let v = { v.into() };
|
237 + | (k, v)
|
238 + | })
|
239 + | .collect()
|
240 + | }
|
241 + | }
|
242 + | }
|
243 + | pub(crate) mod map_of_set_of_length_string_constrained {
|
244 + |
|
245 + | #[derive(Debug, Clone)]
|
246 + | pub(crate) struct MapOfSetOfLengthStringConstrained(
|
247 + | pub(crate)
|
248 + | std::collections::HashMap<crate::model::LengthString, crate::model::SetOfLengthString>,
|
249 + | );
|
250 + |
|
251 + | impl crate::constrained::Constrained for MapOfSetOfLengthStringConstrained {
|
252 + | type Unconstrained = crate::unconstrained::map_of_set_of_length_string_unconstrained::MapOfSetOfLengthStringUnconstrained;
|
253 + | }
|
254 + | impl ::std::convert::From<MapOfSetOfLengthStringConstrained>
|
255 + | for ::std::collections::HashMap<
|
256 + | ::std::string::String,
|
257 + | ::std::vec::Vec<::std::string::String>,
|
258 + | >
|
259 + | {
|
260 + | fn from(v: MapOfSetOfLengthStringConstrained) -> Self {
|
261 + | v.0.into_iter()
|
262 + | .map(|(k, v)| {
|
263 + | let k = k.into();
|
264 + | let v = { v.into() };
|
265 + | (k, v)
|
266 + | })
|
267 + | .collect()
|
268 + | }
|
269 + | }
|
270 + | }
|
271 + | pub(crate) mod map_of_list_of_length_string_constrained {
|
272 + |
|
273 + | #[derive(Debug, Clone)]
|
274 + | pub(crate) struct MapOfListOfLengthStringConstrained(
|
275 + | pub(crate) std::collections::HashMap<
|
276 + | crate::model::LengthString,
|
277 + | crate::constrained::list_of_length_string_constrained::ListOfLengthStringConstrained,
|
278 + | >,
|
279 + | );
|
280 + |
|
281 + | impl crate::constrained::Constrained for MapOfListOfLengthStringConstrained {
|
282 + | type Unconstrained = crate::unconstrained::map_of_list_of_length_string_unconstrained::MapOfListOfLengthStringUnconstrained;
|
283 + | }
|
284 + | impl ::std::convert::From<MapOfListOfLengthStringConstrained>
|
285 + | for ::std::collections::HashMap<
|
286 + | ::std::string::String,
|
287 + | ::std::vec::Vec<::std::string::String>,
|
288 + | >
|
289 + | {
|
290 + | fn from(v: MapOfListOfLengthStringConstrained) -> Self {
|
291 + | v.0.into_iter()
|
292 + | .map(|(k, v)| {
|
293 + | let k = k.into();
|
294 + | let v = { v.into() };
|
295 + | (k, v)
|
296 + | })
|
297 + | .collect()
|
298 + | }
|
299 + | }
|
300 + | }
|
301 + | pub(crate) mod list_of_length_string_constrained {
|
302 + |
|
303 + | #[derive(Debug, Clone)]
|
304 + | pub(crate) struct ListOfLengthStringConstrained(
|
305 + | pub(crate) std::vec::Vec<crate::model::LengthString>,
|
306 + | );
|
307 + |
|
308 + | impl crate::constrained::Constrained for ListOfLengthStringConstrained {
|
309 + | type Unconstrained = crate::unconstrained::list_of_length_string_unconstrained::ListOfLengthStringUnconstrained;
|
310 + | }
|
311 + | impl ::std::convert::From<ListOfLengthStringConstrained>
|
312 + | for ::std::vec::Vec<::std::string::String>
|
313 + | {
|
314 + | fn from(v: ListOfLengthStringConstrained) -> Self {
|
315 + | v.0.into_iter().map(|item| item.into()).collect()
|
316 + | }
|
317 + | }
|
318 + | }
|
319 + | pub(crate) mod map_of_length_string_constrained {
|
320 + |
|
321 + | #[derive(Debug, Clone)]
|
322 + | pub(crate) struct MapOfLengthStringConstrained(
|
323 + | pub(crate) std::collections::HashMap<crate::model::LengthString, crate::model::LengthString>,
|
324 + | );
|
325 + |
|
326 + | impl crate::constrained::Constrained for MapOfLengthStringConstrained {
|
327 + | type Unconstrained = crate::unconstrained::map_of_length_string_unconstrained::MapOfLengthStringUnconstrained;
|
328 + | }
|
329 + | impl ::std::convert::From<MapOfLengthStringConstrained>
|
330 + | for ::std::collections::HashMap<::std::string::String, ::std::string::String>
|
331 + | {
|
332 + | fn from(v: MapOfLengthStringConstrained) -> Self {
|
333 + | v.0.into_iter()
|
334 + | .map(|(k, v)| {
|
335 + | let k = k.into();
|
336 + | let v = { v.into() };
|
337 + | (k, v)
|
338 + | })
|
339 + | .collect()
|
340 + | }
|
341 + | }
|
342 + | }
|
343 + | pub(crate) mod recursive_list_constrained {
|
344 + |
|
345 + | #[derive(Debug, Clone)]
|
346 + | pub(crate) struct RecursiveListConstrained(
|
347 + | pub(crate) std::vec::Vec<crate::model::RecursiveShapesInputOutputNested1>,
|
348 + | );
|
349 + |
|
350 + | impl crate::constrained::Constrained for RecursiveListConstrained {
|
351 + | type Unconstrained =
|
352 + | crate::unconstrained::recursive_list_unconstrained::RecursiveListUnconstrained;
|
353 + | }
|
354 + | impl ::std::convert::From<RecursiveListConstrained>
|
355 + | for ::std::vec::Vec<crate::model::RecursiveShapesInputOutputNested1>
|
356 + | {
|
357 + | fn from(v: RecursiveListConstrained) -> Self {
|
358 + | v.0
|
359 + | }
|
360 + | }
|
361 + | }
|
362 + | pub(crate) mod map_of_range_byte_constrained {
|
363 + |
|
364 + | #[derive(Debug, Clone)]
|
365 + | pub(crate) struct MapOfRangeByteConstrained(
|
366 + | pub(crate) std::collections::HashMap<::std::string::String, crate::model::RangeByte>,
|
367 + | );
|
368 + |
|
369 + | impl crate::constrained::Constrained for MapOfRangeByteConstrained {
|
370 + | type Unconstrained =
|
371 + | crate::unconstrained::map_of_range_byte_unconstrained::MapOfRangeByteUnconstrained;
|
372 + | }
|
373 + | impl ::std::convert::From<MapOfRangeByteConstrained>
|
374 + | for ::std::collections::HashMap<::std::string::String, i8>
|
375 + | {
|
376 + | fn from(v: MapOfRangeByteConstrained) -> Self {
|
377 + | v.0.into_iter()
|
378 + | .map(|(k, v)| {
|
379 + | let v = { v.into() };
|
380 + | (k, v)
|
381 + | })
|
382 + | .collect()
|
383 + | }
|
384 + | }
|
385 + | }
|
386 + | pub(crate) mod list_of_range_byte_constrained {
|
387 + |
|
388 + | #[derive(Debug, Clone)]
|
389 + | pub(crate) struct ListOfRangeByteConstrained(pub(crate) std::vec::Vec<crate::model::RangeByte>);
|
390 + |
|
391 + | impl crate::constrained::Constrained for ListOfRangeByteConstrained {
|
392 + | type Unconstrained =
|
393 + | crate::unconstrained::list_of_range_byte_unconstrained::ListOfRangeByteUnconstrained;
|
394 + | }
|
395 + | impl ::std::convert::From<ListOfRangeByteConstrained> for ::std::vec::Vec<i8> {
|
396 + | fn from(v: ListOfRangeByteConstrained) -> Self {
|
397 + | v.0.into_iter().map(|item| item.into()).collect()
|
398 + | }
|
399 + | }
|
400 + | }
|
401 + | pub(crate) mod map_of_range_long_constrained {
|
402 + |
|
403 + | #[derive(Debug, Clone)]
|
404 + | pub(crate) struct MapOfRangeLongConstrained(
|
405 + | pub(crate) std::collections::HashMap<::std::string::String, crate::model::RangeLong>,
|
406 + | );
|
407 + |
|
408 + | impl crate::constrained::Constrained for MapOfRangeLongConstrained {
|
409 + | type Unconstrained =
|
410 + | crate::unconstrained::map_of_range_long_unconstrained::MapOfRangeLongUnconstrained;
|
411 + | }
|
412 + | impl ::std::convert::From<MapOfRangeLongConstrained>
|
413 + | for ::std::collections::HashMap<::std::string::String, i64>
|
414 + | {
|
415 + | fn from(v: MapOfRangeLongConstrained) -> Self {
|
416 + | v.0.into_iter()
|
417 + | .map(|(k, v)| {
|
418 + | let v = { v.into() };
|
419 + | (k, v)
|
420 + | })
|
421 + | .collect()
|
422 + | }
|
423 + | }
|
424 + | }
|
425 + | pub(crate) mod list_of_range_long_constrained {
|
426 + |
|
427 + | #[derive(Debug, Clone)]
|
428 + | pub(crate) struct ListOfRangeLongConstrained(pub(crate) std::vec::Vec<crate::model::RangeLong>);
|
429 + |
|
430 + | impl crate::constrained::Constrained for ListOfRangeLongConstrained {
|
431 + | type Unconstrained =
|
432 + | crate::unconstrained::list_of_range_long_unconstrained::ListOfRangeLongUnconstrained;
|
433 + | }
|
434 + | impl ::std::convert::From<ListOfRangeLongConstrained> for ::std::vec::Vec<i64> {
|
435 + | fn from(v: ListOfRangeLongConstrained) -> Self {
|
436 + | v.0.into_iter().map(|item| item.into()).collect()
|
437 + | }
|
438 + | }
|
439 + | }
|
440 + | pub(crate) mod map_of_range_short_constrained {
|
441 + |
|
442 + | #[derive(Debug, Clone)]
|
443 + | pub(crate) struct MapOfRangeShortConstrained(
|
444 + | pub(crate) std::collections::HashMap<::std::string::String, crate::model::RangeShort>,
|
445 + | );
|
446 + |
|
447 + | impl crate::constrained::Constrained for MapOfRangeShortConstrained {
|
448 + | type Unconstrained =
|
449 + | crate::unconstrained::map_of_range_short_unconstrained::MapOfRangeShortUnconstrained;
|
450 + | }
|
451 + | impl ::std::convert::From<MapOfRangeShortConstrained>
|
452 + | for ::std::collections::HashMap<::std::string::String, i16>
|
453 + | {
|
454 + | fn from(v: MapOfRangeShortConstrained) -> Self {
|
455 + | v.0.into_iter()
|
456 + | .map(|(k, v)| {
|
457 + | let v = { v.into() };
|
458 + | (k, v)
|
459 + | })
|
460 + | .collect()
|
461 + | }
|
462 + | }
|
463 + | }
|
464 + | pub(crate) mod list_of_range_short_constrained {
|
465 + |
|
466 + | #[derive(Debug, Clone)]
|
467 + | pub(crate) struct ListOfRangeShortConstrained(
|
468 + | pub(crate) std::vec::Vec<crate::model::RangeShort>,
|
469 + | );
|
470 + |
|
471 + | impl crate::constrained::Constrained for ListOfRangeShortConstrained {
|
472 + | type Unconstrained =
|
473 + | crate::unconstrained::list_of_range_short_unconstrained::ListOfRangeShortUnconstrained;
|
474 + | }
|
475 + | impl ::std::convert::From<ListOfRangeShortConstrained> for ::std::vec::Vec<i16> {
|
476 + | fn from(v: ListOfRangeShortConstrained) -> Self {
|
477 + | v.0.into_iter().map(|item| item.into()).collect()
|
478 + | }
|
479 + | }
|
480 + | }
|
481 + | pub(crate) mod map_of_range_integer_constrained {
|
482 + |
|
483 + | #[derive(Debug, Clone)]
|
484 + | pub(crate) struct MapOfRangeIntegerConstrained(
|
485 + | pub(crate) std::collections::HashMap<::std::string::String, crate::model::RangeInteger>,
|
486 + | );
|
487 + |
|
488 + | impl crate::constrained::Constrained for MapOfRangeIntegerConstrained {
|
489 + | type Unconstrained = crate::unconstrained::map_of_range_integer_unconstrained::MapOfRangeIntegerUnconstrained;
|
490 + | }
|
491 + | impl ::std::convert::From<MapOfRangeIntegerConstrained>
|
492 + | for ::std::collections::HashMap<::std::string::String, i32>
|
493 + | {
|
494 + | fn from(v: MapOfRangeIntegerConstrained) -> Self {
|
495 + | v.0.into_iter()
|
496 + | .map(|(k, v)| {
|
497 + | let v = { v.into() };
|
498 + | (k, v)
|
499 + | })
|
500 + | .collect()
|
501 + | }
|
502 + | }
|
503 + | }
|
504 + | pub(crate) mod list_of_range_integer_constrained {
|
505 + |
|
506 + | #[derive(Debug, Clone)]
|
507 + | pub(crate) struct ListOfRangeIntegerConstrained(
|
508 + | pub(crate) std::vec::Vec<crate::model::RangeInteger>,
|
509 + | );
|
510 + |
|
511 + | impl crate::constrained::Constrained for ListOfRangeIntegerConstrained {
|
512 + | type Unconstrained = crate::unconstrained::list_of_range_integer_unconstrained::ListOfRangeIntegerUnconstrained;
|
513 + | }
|
514 + | impl ::std::convert::From<ListOfRangeIntegerConstrained> for ::std::vec::Vec<i32> {
|
515 + | fn from(v: ListOfRangeIntegerConstrained) -> Self {
|
516 + | v.0.into_iter().map(|item| item.into()).collect()
|
517 + | }
|
518 + | }
|
519 + | }
|
520 + | pub(crate) mod map_of_length_blob_constrained {
|
521 + |
|
522 + | #[derive(Debug, Clone)]
|
523 + | pub(crate) struct MapOfLengthBlobConstrained(
|
524 + | pub(crate) std::collections::HashMap<::std::string::String, crate::model::LengthBlob>,
|
525 + | );
|
526 + |
|
527 + | impl crate::constrained::Constrained for MapOfLengthBlobConstrained {
|
528 + | type Unconstrained =
|
529 + | crate::unconstrained::map_of_length_blob_unconstrained::MapOfLengthBlobUnconstrained;
|
530 + | }
|
531 + | impl ::std::convert::From<MapOfLengthBlobConstrained>
|
532 + | for ::std::collections::HashMap<::std::string::String, ::aws_smithy_types::Blob>
|
533 + | {
|
534 + | fn from(v: MapOfLengthBlobConstrained) -> Self {
|
535 + | v.0.into_iter()
|
536 + | .map(|(k, v)| {
|
537 + | let v = { v.into() };
|
538 + | (k, v)
|
539 + | })
|
540 + | .collect()
|
541 + | }
|
542 + | }
|
543 + | }
|
544 + | pub(crate) mod list_of_length_blob_constrained {
|
545 + |
|
546 + | #[derive(Debug, Clone)]
|
547 + | pub(crate) struct ListOfLengthBlobConstrained(
|
548 + | pub(crate) std::vec::Vec<crate::model::LengthBlob>,
|
549 + | );
|
550 + |
|
551 + | impl crate::constrained::Constrained for ListOfLengthBlobConstrained {
|
552 + | type Unconstrained =
|
553 + | crate::unconstrained::list_of_length_blob_unconstrained::ListOfLengthBlobUnconstrained;
|
554 + | }
|
555 + | impl ::std::convert::From<ListOfLengthBlobConstrained>
|
556 + | for ::std::vec::Vec<::aws_smithy_types::Blob>
|
557 + | {
|
558 + | fn from(v: ListOfLengthBlobConstrained) -> Self {
|
559 + | v.0.into_iter().map(|item| item.into()).collect()
|
560 + | }
|
561 + | }
|
562 + | }
|
563 + | pub(crate) mod con_b_list_constrained {
|
564 + |
|
565 + | #[derive(Debug, Clone)]
|
566 + | pub(crate) struct ConBListConstrained(
|
567 + | pub(crate) std::vec::Vec<
|
568 + | crate::constrained::con_b_list_inner_constrained::ConBListInnerConstrained,
|
569 + | >,
|
570 + | );
|
571 + |
|
572 + | impl crate::constrained::Constrained for ConBListConstrained {
|
573 + | type Unconstrained = crate::unconstrained::con_b_list_unconstrained::ConBListUnconstrained;
|
574 + | }
|
575 + | impl ::std::convert::From<ConBListConstrained>
|
576 + | for ::std::vec::Vec<::std::vec::Vec<crate::model::ConB>>
|
577 + | {
|
578 + | fn from(v: ConBListConstrained) -> Self {
|
579 + | v.0.into_iter().map(|item| item.into()).collect()
|
580 + | }
|
581 + | }
|
582 + | }
|
583 + | pub(crate) mod con_b_list_inner_constrained {
|
584 + |
|
585 + | #[derive(Debug, Clone)]
|
586 + | pub(crate) struct ConBListInnerConstrained(pub(crate) std::vec::Vec<crate::model::ConB>);
|
587 + |
|
588 + | impl crate::constrained::Constrained for ConBListInnerConstrained {
|
589 + | type Unconstrained =
|
590 + | crate::unconstrained::con_b_list_inner_unconstrained::ConBListInnerUnconstrained;
|
591 + | }
|
592 + | impl ::std::convert::From<ConBListInnerConstrained> for ::std::vec::Vec<crate::model::ConB> {
|
593 + | fn from(v: ConBListInnerConstrained) -> Self {
|
594 + | v.0
|
595 + | }
|
596 + | }
|
597 + | }
|
598 + | pub(crate) mod sparse_list_constrained {
|
599 + |
|
600 + | #[derive(Debug, Clone)]
|
601 + | pub(crate) struct SparseListConstrained(
|
602 + | pub(crate) std::vec::Vec<::std::option::Option<crate::model::LengthString>>,
|
603 + | );
|
604 + |
|
605 + | impl crate::constrained::Constrained for SparseListConstrained {
|
606 + | type Unconstrained =
|
607 + | crate::unconstrained::sparse_list_unconstrained::SparseListUnconstrained;
|
608 + | }
|
609 + | impl ::std::convert::From<SparseListConstrained>
|
610 + | for ::std::vec::Vec<::std::option::Option<::std::string::String>>
|
611 + | {
|
612 + | fn from(v: SparseListConstrained) -> Self {
|
613 + | v.0.into_iter()
|
614 + | .map(|item| item.map(|item| item.into()))
|
615 + | .collect()
|
616 + | }
|
617 + | }
|
618 + | }
|
619 + | pub(crate) mod sparse_map_constrained {
|
620 + |
|
621 + | #[derive(Debug, Clone)]
|
622 + | pub(crate) struct SparseMapConstrained(
|
623 + | pub(crate) std::collections::HashMap<
|
624 + | ::std::string::String,
|
625 + | ::std::option::Option<crate::model::UniqueItemsList>,
|
626 + | >,
|
627 + | );
|
628 + |
|
629 + | impl crate::constrained::Constrained for SparseMapConstrained {
|
630 + | type Unconstrained = crate::unconstrained::sparse_map_unconstrained::SparseMapUnconstrained;
|
631 + | }
|
632 + | impl ::std::convert::From<SparseMapConstrained>
|
633 + | for ::std::collections::HashMap<
|
634 + | ::std::string::String,
|
635 + | ::std::option::Option<::std::vec::Vec<::std::string::String>>,
|
636 + | >
|
637 + | {
|
638 + | fn from(v: SparseMapConstrained) -> Self {
|
639 + | v.0.into_iter()
|
640 + | .map(|(k, v)| {
|
641 + | let v = { v.map(|v| v.into()) };
|
642 + | (k, v)
|
643 + | })
|
644 + | .collect()
|
645 + | }
|
646 + | }
|
647 + | }
|
648 + | pub(crate) mod map_of_map_of_list_of_list_of_con_b_constrained {
|
649 + |
|
650 + | #[derive(Debug, Clone)]
|
651 + | pub(crate) struct MapOfMapOfListOfListOfConBConstrained(pub(crate) std::collections::HashMap<::std::string::String, crate::constrained::map_of_list_of_list_of_con_b_constrained::MapOfListOfListOfConBConstrained>);
|
652 + |
|
653 + | impl crate::constrained::Constrained for MapOfMapOfListOfListOfConBConstrained {
|
654 + | type Unconstrained = crate::unconstrained::map_of_map_of_list_of_list_of_con_b_unconstrained::MapOfMapOfListOfListOfConBUnconstrained;
|
655 + | }
|
656 + | impl ::std::convert::From<MapOfMapOfListOfListOfConBConstrained>
|
657 + | for ::std::collections::HashMap<
|
658 + | ::std::string::String,
|
659 + | ::std::collections::HashMap<
|
660 + | ::std::string::String,
|
661 + | ::std::vec::Vec<::std::vec::Vec<crate::model::ConB>>,
|
662 + | >,
|
663 + | >
|
664 + | {
|
665 + | fn from(v: MapOfMapOfListOfListOfConBConstrained) -> Self {
|
666 + | v.0.into_iter()
|
667 + | .map(|(k, v)| {
|
668 + | let v = { v.into() };
|
669 + | (k, v)
|
670 + | })
|
671 + | .collect()
|
672 + | }
|
673 + | }
|
674 + | }
|
675 + | pub(crate) mod map_of_list_of_list_of_con_b_constrained {
|
676 + |
|
677 + | #[derive(Debug, Clone)]
|
678 + | pub(crate) struct MapOfListOfListOfConBConstrained(
|
679 + | pub(crate) std::collections::HashMap<
|
680 + | ::std::string::String,
|
681 + | crate::constrained::con_b_list_constrained::ConBListConstrained,
|
682 + | >,
|
683 + | );
|
684 + |
|
685 + | impl crate::constrained::Constrained for MapOfListOfListOfConBConstrained {
|
686 + | type Unconstrained = crate::unconstrained::map_of_list_of_list_of_con_b_unconstrained::MapOfListOfListOfConBUnconstrained;
|
687 + | }
|
688 + | impl ::std::convert::From<MapOfListOfListOfConBConstrained>
|
689 + | for ::std::collections::HashMap<
|
690 + | ::std::string::String,
|
691 + | ::std::vec::Vec<::std::vec::Vec<crate::model::ConB>>,
|
692 + | >
|
693 + | {
|
694 + | fn from(v: MapOfListOfListOfConBConstrained) -> Self {
|
695 + | v.0.into_iter()
|
696 + | .map(|(k, v)| {
|
697 + | let v = { v.into() };
|
698 + | (k, v)
|
699 + | })
|
700 + | .collect()
|
701 + | }
|
702 + | }
|
703 + | }
|
704 + |
|
705 + | /*
|
706 + | * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
|
707 + | * SPDX-License-Identifier: Apache-2.0
|
708 + | */
|
709 + |
|
710 + | pub(crate) trait Constrained {
|
711 + | type Unconstrained;
|
712 + | }
|
713 + |
|
714 + | #[derive(Debug, Clone)]
|
715 + | #[allow(dead_code)]
|
716 + | pub(crate) enum MaybeConstrained<T: Constrained> {
|
717 + | Constrained(T),
|
718 + | Unconstrained(T::Unconstrained),
|
719 + | }
|