1*11be35a1SLionel Sambuc // Copyright 2012 Google Inc.
2*11be35a1SLionel Sambuc // All rights reserved.
3*11be35a1SLionel Sambuc //
4*11be35a1SLionel Sambuc // Redistribution and use in source and binary forms, with or without
5*11be35a1SLionel Sambuc // modification, are permitted provided that the following conditions are
6*11be35a1SLionel Sambuc // met:
7*11be35a1SLionel Sambuc //
8*11be35a1SLionel Sambuc // * Redistributions of source code must retain the above copyright
9*11be35a1SLionel Sambuc // notice, this list of conditions and the following disclaimer.
10*11be35a1SLionel Sambuc // * Redistributions in binary form must reproduce the above copyright
11*11be35a1SLionel Sambuc // notice, this list of conditions and the following disclaimer in the
12*11be35a1SLionel Sambuc // documentation and/or other materials provided with the distribution.
13*11be35a1SLionel Sambuc // * Neither the name of Google Inc. nor the names of its contributors
14*11be35a1SLionel Sambuc // may be used to endorse or promote products derived from this software
15*11be35a1SLionel Sambuc // without specific prior written permission.
16*11be35a1SLionel Sambuc //
17*11be35a1SLionel Sambuc // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18*11be35a1SLionel Sambuc // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19*11be35a1SLionel Sambuc // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20*11be35a1SLionel Sambuc // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21*11be35a1SLionel Sambuc // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22*11be35a1SLionel Sambuc // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23*11be35a1SLionel Sambuc // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24*11be35a1SLionel Sambuc // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25*11be35a1SLionel Sambuc // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26*11be35a1SLionel Sambuc // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27*11be35a1SLionel Sambuc // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*11be35a1SLionel Sambuc
29*11be35a1SLionel Sambuc #include "utils/config/tree.ipp"
30*11be35a1SLionel Sambuc
31*11be35a1SLionel Sambuc #include "utils/config/exceptions.hpp"
32*11be35a1SLionel Sambuc #include "utils/format/macros.hpp"
33*11be35a1SLionel Sambuc #include "utils/text/operations.hpp"
34*11be35a1SLionel Sambuc
35*11be35a1SLionel Sambuc namespace config = utils::config;
36*11be35a1SLionel Sambuc namespace text = utils::text;
37*11be35a1SLionel Sambuc
38*11be35a1SLionel Sambuc
39*11be35a1SLionel Sambuc /// Converts a key to its textual representation.
40*11be35a1SLionel Sambuc ///
41*11be35a1SLionel Sambuc /// \param key The key to convert.
42*11be35a1SLionel Sambuc std::string
flatten_key(const tree_key & key)43*11be35a1SLionel Sambuc utils::config::detail::flatten_key(const tree_key& key)
44*11be35a1SLionel Sambuc {
45*11be35a1SLionel Sambuc PRE(!key.empty());
46*11be35a1SLionel Sambuc return text::join(key, ".");
47*11be35a1SLionel Sambuc }
48*11be35a1SLionel Sambuc
49*11be35a1SLionel Sambuc
50*11be35a1SLionel Sambuc /// Parses and validates a textual key.
51*11be35a1SLionel Sambuc ///
52*11be35a1SLionel Sambuc /// \param str The key to process in dotted notation.
53*11be35a1SLionel Sambuc ///
54*11be35a1SLionel Sambuc /// \return The tokenized key if valid.
55*11be35a1SLionel Sambuc ///
56*11be35a1SLionel Sambuc /// \throw invalid_key_error If the input key is empty or invalid for any other
57*11be35a1SLionel Sambuc /// reason. Invalid does NOT mean unknown though.
58*11be35a1SLionel Sambuc utils::config::detail::tree_key
parse_key(const std::string & str)59*11be35a1SLionel Sambuc utils::config::detail::parse_key(const std::string& str)
60*11be35a1SLionel Sambuc {
61*11be35a1SLionel Sambuc const tree_key key = text::split(str, '.');
62*11be35a1SLionel Sambuc if (key.empty())
63*11be35a1SLionel Sambuc throw invalid_key_error("Empty key");
64*11be35a1SLionel Sambuc for (tree_key::const_iterator iter = key.begin(); iter != key.end(); iter++)
65*11be35a1SLionel Sambuc if ((*iter).empty())
66*11be35a1SLionel Sambuc throw invalid_key_error(F("Empty component in key '%s'") % str);
67*11be35a1SLionel Sambuc return key;
68*11be35a1SLionel Sambuc }
69