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
|
%% The contents of this file are subject to the Mozilla Public License
%% Version 1.1 (the "License"); you may not use this file except in
%% compliance with the License. You may obtain a copy of the License
%% at http://www.mozilla.org/MPL/
%%
%% Software distributed under the License is distributed on an "AS IS"
%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
%% the License for the specific language governing rights and
%% limitations under the License.
%%
%% The Original Code is RabbitMQ.
%%
%% The Initial Developer of the Original Code is GoPivotal, Inc.
%% Copyright (c) 2007-2014 GoPivotal, Inc. All rights reserved.
%%
-module(rabbit_parameter_validation).
-export([number/2, binary/2, boolean/2, list/2, regex/2, proplist/3, enum/1]).
number(_Name, Term) when is_number(Term) ->
ok;
number(Name, Term) ->
{error, "~s should be number, actually was ~p", [Name, Term]}.
binary(_Name, Term) when is_binary(Term) ->
ok;
binary(Name, Term) ->
{error, "~s should be binary, actually was ~p", [Name, Term]}.
boolean(_Name, Term) when is_boolean(Term) ->
ok;
boolean(Name, Term) ->
{error, "~s should be boolean, actually was ~p", [Name, Term]}.
list(_Name, Term) when is_list(Term) ->
ok;
list(Name, Term) ->
{error, "~s should be list, actually was ~p", [Name, Term]}.
regex(Name, Term) when is_binary(Term) ->
case re:compile(Term) of
{ok, _} -> ok;
{error, Reason} -> {error, "~s should be regular expression "
"but is invalid: ~p", [Name, Reason]}
end;
regex(Name, Term) ->
{error, "~s should be a binary but was ~p", [Name, Term]}.
proplist(Name, Constraints, Term) when is_list(Term) ->
{Results, Remainder}
= lists:foldl(
fun ({Key, Fun, Needed}, {Results0, Term0}) ->
case {lists:keytake(Key, 1, Term0), Needed} of
{{value, {Key, Value}, Term1}, _} ->
{[Fun(Key, Value) | Results0],
Term1};
{false, mandatory} ->
{[{error, "Key \"~s\" not found in ~s",
[Key, Name]} | Results0], Term0};
{false, optional} ->
{Results0, Term0}
end
end, {[], Term}, Constraints),
case Remainder of
[] -> Results;
_ -> [{error, "Unrecognised terms ~p in ~s", [Remainder, Name]}
| Results]
end;
proplist(Name, _Constraints, Term) ->
{error, "~s not a list ~p", [Name, Term]}.
enum(OptionsA) ->
Options = [list_to_binary(atom_to_list(O)) || O <- OptionsA],
fun (Name, Term) when is_binary(Term) ->
case lists:member(Term, Options) of
true -> ok;
false -> {error, "~s should be one of ~p, actually was ~p",
[Name, Options, Term]}
end;
(Name, Term) ->
{error, "~s should be binary, actually was ~p", [Name, Term]}
end.
|
