comparison Plugin/AssociativeArray.cpp @ 1:d5d3cb00556a

initial release
author Sebastien Jodogne <s.jodogne@gmail.com>
date Wed, 22 Mar 2017 16:13:52 +0100
parents
children c44013681a51
comparison
equal deleted inserted replaced
0:decac5df19c4 1:d5d3cb00556a
1 /**
2 * Advanced authorization plugin for Orthanc
3 * Copyright (C) 2017 Osimis, Belgium
4 *
5 * This program is free software: you can redistribute it and/or
6 * modify it under the terms of the GNU Affero General Public License
7 * as published by the Free Software Foundation, either version 3 of
8 * the License, or (at your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Affero General Public License for more details.
14 *
15 * You should have received a copy of the GNU Affero General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
17 **/
18
19 #include "AssociativeArray.h"
20
21 #include "../Resources/Orthanc/Core/Toolbox.h"
22
23 namespace OrthancPlugins
24 {
25 AssociativeArray::AssociativeArray(uint32_t headersCount,
26 const char *const *headersKeys,
27 const char *const *headersValues,
28 bool caseSensitive) :
29 caseSensitive_(caseSensitive)
30 {
31 for (uint32_t i = 0; i < headersCount; i++)
32 {
33 std::string value;
34
35 if (caseSensitive)
36 {
37 Orthanc::Toolbox::ToLowerCase(value, headersValues[i]);
38 }
39 else
40 {
41 value = headersValues[i];
42 }
43
44 map_[headersKeys[i]] = value;
45 }
46 }
47
48
49 bool AssociativeArray::GetValue(std::string& value,
50 const std::string& key) const
51 {
52 if (key.empty())
53 {
54 return false;
55 }
56
57 Map::const_iterator found;
58
59 if (caseSensitive_)
60 {
61 found = map_.find(key);
62 }
63 else
64 {
65 std::string lower;
66 Orthanc::Toolbox::ToLowerCase(lower, key);
67 found = map_.find(lower);
68 }
69
70 if (found == map_.end())
71 {
72 return false;
73 }
74 else
75 {
76 value = found->second;
77 return true;
78 }
79 }
80 }