-
Notifications
You must be signed in to change notification settings - Fork 24
/
ext.rs
221 lines (200 loc) · 5.48 KB
/
ext.rs
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
#![allow(dead_code)]
pub mod serialize_as_regex_string {
use regex;
use serde::{Serialize, Serializer};
#[derive(PartialEq, Eq, Hash, Serialize, Debug)]
pub struct SerializeAsRegexString(#[serde(with = "self")] pub Vec<u8>);
pub fn serialize<S>(bytes: &[u8], serializer: S) -> Result<S::Ok, S::Error>
where
S: Serializer,
{
serializer.collect_str(®ex::escape(&String::from_utf8_lossy(bytes))) // TODO: escape rather than lose invalid chars
}
}
pub mod serde_regex {
// https://github.com/tailhook/serde-regex
use regex::bytes::{Regex, RegexBuilder};
use serde::{
de::{Error, Visitor}, Deserialize, Deserializer, Serialize, Serializer
};
use std::{fmt, hash};
#[derive(Clone, Serialize, Deserialize, Debug)]
pub struct SerdeRegex(#[serde(with = "self")] Regex);
impl SerdeRegex {
pub fn is_match(&self, text: &[u8]) -> bool {
self.0.is_match(text)
}
}
impl PartialEq for SerdeRegex {
fn eq(&self, other: &Self) -> bool {
self.0.as_str() == other.0.as_str()
}
}
impl Eq for SerdeRegex {}
impl hash::Hash for SerdeRegex {
fn hash<H>(&self, state: &mut H)
where
H: hash::Hasher,
{
self.0.as_str().hash(state);
}
}
struct RegexVisitor;
impl<'a> Visitor<'a> for RegexVisitor {
type Value = Regex;
fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
formatter.write_str("valid regular expression")
}
fn visit_str<E>(self, value: &str) -> Result<Self::Value, E>
where
E: Error,
{
RegexBuilder::new(&format!("^{}$", value))
.unicode(false)
.dot_matches_new_line(true)
.build()
.map_err(E::custom)
}
}
pub fn serialize<S>(value: &Regex, serializer: S) -> Result<S::Ok, S::Error>
where
S: Serializer,
{
let x = value.as_str();
assert_eq!(x.chars().next().unwrap(), '^');
assert_eq!(x.chars().rev().next().unwrap(), '$');
serializer.serialize_str(&x[1..x.len() - 1])
}
pub fn deserialize<'de, D>(deserializer: D) -> Result<Regex, D::Error>
where
D: Deserializer<'de>,
{
deserializer.deserialize_str(RegexVisitor)
}
}
pub mod string {
// Until there is an into_chars() in stdlib
use std::{mem, str};
pub struct Chars(String, str::Chars<'static>);
impl Chars {
pub fn new(s: String) -> Self {
let x = unsafe { mem::transmute::<&str, &str>(&*s) }.chars();
Self(s, x)
}
}
impl Iterator for Chars {
type Item = char;
fn next(&mut self) -> Option<char> {
self.1.next()
}
}
}
pub mod hashmap {
use std::{
collections::hash_map::{self, HashMap}, hash
};
pub fn intersection<'a, K: 'a + Eq + hash::Hash, V1: 'a, V2: 'a, S: 'a + hash::BuildHasher>(
self_: &'a HashMap<K, V1, S>, other: &'a HashMap<K, V2, S>,
) -> Intersection<'a, K, V1, V2, S> {
Intersection {
iter: self_.iter(),
other,
}
}
pub struct Intersection<'a, K: 'a, V1: 'a, V2: 'a, S: 'a> {
iter: hash_map::Iter<'a, K, V1>,
other: &'a HashMap<K, V2, S>,
}
impl<'a, K, V1, V2, S> Iterator for Intersection<'a, K, V1, V2, S>
where
K: Eq + hash::Hash,
S: hash::BuildHasher,
{
type Item = (&'a K, &'a V1, &'a V2);
fn next(&mut self) -> Option<(&'a K, &'a V1, &'a V2)> {
loop {
let elt = self.iter.next()?;
if let Some(elt2) = self.other.get(elt.0) {
return Some((elt.0, elt.1, elt2));
}
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
let (_, upper) = self.iter.size_hint();
(0, upper)
}
}
}
pub mod serde_multiset {
use multiset;
use serde::{de, ser::SerializeSeq, Deserialize, Deserializer, Serialize, Serializer};
use std::{fmt, hash, marker};
pub fn serialize<T: PartialEq + Eq + hash::Hash + Serialize, S: Serializer>(
self_: &multiset::HashMultiSet<T>, serializer: S,
) -> Result<S::Ok, S::Error> {
let mut seq = serializer.serialize_seq(Some(self_.len()))?;
for e in self_.iter() {
seq.serialize_element(e)?;
}
seq.end()
}
pub fn deserialize<
'de,
T: PartialEq + Eq + hash::Hash + Deserialize<'de>,
D: Deserializer<'de>,
>(
deserializer: D,
) -> Result<multiset::HashMultiSet<T>, D::Error> {
struct Visitor<'de, T: PartialEq + Eq + hash::Hash + Deserialize<'de>>(
marker::PhantomData<(&'de (), fn() -> T)>,
);
impl<'de, T: PartialEq + Eq + hash::Hash + Deserialize<'de>> de::Visitor<'de> for Visitor<'de, T> {
type Value = multiset::HashMultiSet<T>;
fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
formatter.write_str("an array of elements")
}
fn visit_seq<S: de::SeqAccess<'de>>(
self, mut seq: S,
) -> Result<multiset::HashMultiSet<T>, S::Error> {
let mut x = multiset::HashMultiSet::new();
while let Some(value) = seq.next_element()? {
x.insert(value);
}
Ok(x)
}
}
deserializer.deserialize_seq(Visitor(marker::PhantomData))
}
}
pub mod binary_string {
use serde::{Deserialize, Deserializer, Serialize, Serializer};
use std::{
char, convert::TryInto, fmt::{self, Write}
};
#[derive(PartialEq, Eq, Hash, Serialize, Debug)]
struct BinaryString(#[serde(with = "self")] Vec<u8>);
pub fn serialize<S>(bytes: &[u8], serializer: S) -> Result<S::Ok, S::Error>
where
S: Serializer,
{
serializer.collect_str(&Abc(bytes))
}
pub fn deserialize<'de, D>(deserializer: D) -> Result<Vec<u8>, D::Error>
where
D: Deserializer<'de>,
{
let s = <String>::deserialize(deserializer)?;
Ok(s.chars()
.map(|x: char| (x as u32).try_into().unwrap())
.collect())
}
struct Abc<'a>(&'a [u8]);
impl<'a> fmt::Display for Abc<'a> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
for &x in self.0 {
f.write_char(char::from_u32(x.into()).unwrap()).unwrap();
}
Ok(())
}
}
}