xmelt 0.2.0

A serialization/deserialization framework for XML
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

// type DynRestriction<'a, T> = Box<dyn crate::AsRestriction<<<T as crate::Freeze<'a>>::Kind as crate::Restriction<'a>>::Kind>>;

use crate::DynRestriction;

pub trait Container<T>
	where T: for<'freeze> crate::Freeze<'freeze>
{

	/// Insert value into container. Return true is container can take one value at most and already contained a value
	// fn add<'a>(&mut self, value: T, restrictions: Vec<Box<dyn crate::AsRestriction<<<T as crate::Type<'a>>::Kind as crate::Restriction<'a>>::Kind>>>) -> bool;
	fn add<'freeze>(&mut self, value: T, restrictions: Vec<DynRestriction<'freeze, T>>) -> bool;
	// fn add<'a>(&mut self, value: T, restrictions: Vec<Box<impl crate::AsRestriction<<<T as crate::Type<'a>>::Kind as crate::Restriction<'a>>::Kind>>>) -> bool;
	// fn add<'a>(&mut self, value: T, restrictions: Vec<impl crate::AsRestriction<<<T as crate::Type<'a>>::Kind as crate::Restriction<'a>>::Kind>>) -> bool;

	/// Check if countainer is full
	fn is_ready(&self) -> bool {
		false
	}

	fn len(&self) -> usize;

	/// Initialise container
	fn init() -> Self where Self: Sized;
}

impl<T> Container<T> for Option<T>
	where T: for<'freeze> crate::Freeze<'freeze>
{
	fn add<'freeze>(&mut self, value: T, restrictions: Vec<DynRestriction<'freeze, T>>) -> bool {
		self.replace(value).is_some()
	}

	fn is_ready(&self) -> bool {
		self.is_some()
	}

	fn len(&self) -> usize {
		if self.is_none() {
			0
		} else {
			1
		}
	}

	fn init() -> Self
		where Self: Sized
	{
		None
	}
}

impl<T> Container<T> for Vec<T>
	where T: for<'freeze> crate::Freeze<'freeze>
{
	fn add<'freeze>(&mut self, value: T, restrictions: Vec<DynRestriction<'freeze, T>>) -> bool {
		self.push(value);
		return false
	}

	fn len(&self) -> usize {
		self.len()
	}

	fn init() -> Self
		where Self: Sized
	{
		Vec::new()
	}
}

/*impl Container<String> for String {
	fn add<'a>(&mut self, value: String, restrictions: Vec<DynRestriction<'a, String>>) -> bool {
		self.push_str(&value);
		return false
	}

	fn init() -> Self
		where Self: Sized
	{
		Self::new()
	}

	fn len(&self) -> usize {
		0
	}
}*/

pub trait Map<K, V>
	where V: for<'freeze> crate::Freeze<'freeze>
{

	/// Insert value into map. Return true is container can take one value at most and already contained a value
	// fn add<'a>(&mut self, value: T, restrictions: Vec<Box<dyn crate::AsRestriction<<<T as crate::Type<'a>>::Kind as crate::Restriction<'a>>::Kind>>>) -> bool;
	fn add<'freeze>(&mut self, key: K, value: V, restrictions: Vec<DynRestriction<'freeze, V>>) -> bool;

	/// Check if countainer is full
	fn is_ready(&self) -> bool {
		false
	}

	fn len(&self) -> usize;

	/// Initialise container
	fn init() -> Self where Self: Sized;
}

impl<K, V> Map<K, V> for std::collections::HashMap<K, V>
	where
		K: Eq + std::hash::Hash,
		V: for<'freeze> crate::Freeze<'freeze>
{
	fn add<'freeze>(&mut self, key: K, value: V, restrictions: Vec<DynRestriction<'freeze, V>>) -> bool {
		self.insert(key, value);
		return false
	}

	fn len(&self) -> usize {
		self.len()
	}

	fn init() -> Self
		where Self: Sized
	{
		Self::new()
	}
}