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
use std::collections::BTreeMap;
use std::convert::TryFrom;
use std::sync::Arc;
use crate::environment::Environment;
use crate::error::{Error, ErrorKind};
use crate::utils::HtmlEscape;
use crate::value::{Value, ValueArgs};
type FilterFunc =
dyn Fn(&Environment, Value, Vec<Value>) -> Result<Value, Error> + Sync + Send + 'static;
pub(crate) struct BoxedFilter(Arc<FilterFunc>);
pub trait Filter<V = Value, Rv = Value, Args = Vec<Value>>: Send + Sync + 'static {
fn apply_to(&self, env: &Environment, value: V, args: Args) -> Result<Rv, Error>;
}
macro_rules! tuple_impls {
( $( $name:ident )* ) => {
impl<Func, V, Rv, $($name),*> Filter<V, Rv, ($($name,)*)> for Func
where
Func: Fn(&Environment, V, $($name),*) -> Result<Rv, Error> + Send + Sync + 'static
{
fn apply_to(&self, env: &Environment, value: V, args: ($($name,)*)) -> Result<Rv, Error> {
#[allow(non_snake_case)]
let ($($name,)*) = args;
(self)(env, value, $($name,)*)
}
}
};
}
tuple_impls! {}
tuple_impls! { A }
tuple_impls! { A B }
tuple_impls! { A B C }
tuple_impls! { A B C D }
impl BoxedFilter {
pub fn new<F, V, Rv, Args>(f: F) -> BoxedFilter
where
F: Filter<V, Rv, Args>,
V: TryFrom<Value>,
Rv: Into<Value>,
Args: ValueArgs,
{
BoxedFilter(Arc::new(move |env, value, args| -> Result<Value, Error> {
f.apply_to(
env,
TryFrom::try_from(value).map_err(|_| {
Error::new(
ErrorKind::ImpossibleOperation,
"imcompatible value for filter",
)
})?,
ValueArgs::from_values(args)?,
)
.map(Into::into)
}))
}
pub fn apply_to(
&self,
env: &Environment,
value: Value,
args: Vec<Value>,
) -> Result<Value, Error> {
(self.0)(env, value, args)
}
}
pub fn upper(_env: &Environment, v: String) -> Result<String, Error> {
Ok(v.to_uppercase())
}
pub fn lower(_env: &Environment, v: String) -> Result<String, Error> {
Ok(v.to_lowercase())
}
pub fn replace(_env: &Environment, v: String, from: String, to: String) -> Result<String, Error> {
Ok(v.replace(&from, &to))
}
pub fn length(_env: &Environment, v: Value) -> Result<Value, Error> {
v.len().map(Value::from).ok_or_else(|| {
Error::new(
ErrorKind::ImpossibleOperation,
"cannot calculate length of this value",
)
})
}
pub fn safe(_env: &Environment, v: String) -> Result<Value, Error> {
Ok(Value::from_safe_string(v))
}
pub fn escape(_env: &Environment, v: Value) -> Result<Value, Error> {
if v.is_safe() {
Ok(v)
} else {
Ok(Value::from_safe_string(
HtmlEscape(&v.to_string()).to_string(),
))
}
}
pub(crate) fn get_default_filters() -> BTreeMap<&'static str, BoxedFilter> {
let mut rv = BTreeMap::new();
rv.insert("lower", BoxedFilter::new(lower));
rv.insert("upper", BoxedFilter::new(upper));
rv.insert("replace", BoxedFilter::new(replace));
rv.insert("safe", BoxedFilter::new(safe));
rv.insert("escape", BoxedFilter::new(escape));
rv.insert("length", BoxedFilter::new(length));
rv
}
#[test]
fn test_basics() {
fn test(_: &Environment, a: u32, b: u32) -> Result<u32, Error> {
Ok(a + b)
}
let env = Environment::new();
let bx = BoxedFilter::new(test);
assert_eq!(
bx.apply_to(&env, Value::from(23), vec![Value::from(42)])
.unwrap(),
Value::from(65)
);
}