libcruft-util/json/tree.cpp

504 lines
12 KiB
C++
Raw Normal View History

/*
* This file is part of libgim.
*
* libgim is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
2014-05-20 14:11:28 +10:00
*
* libgim is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details.
2014-05-20 14:11:28 +10:00
*
* You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2010-2015 Danny Robson <danny@nerdcruft.net>
*/
#include "json/tree.hpp"
#include "json/except.hpp"
#include "json/flat.hpp"
#include "debug.hpp"
2011-05-23 17:18:52 +10:00
#include "io.hpp"
#include "maths.hpp"
2011-05-23 17:18:52 +10:00
#include <algorithm>
#include <cstdlib>
#include <deque>
#include <iomanip>
2011-05-23 17:18:52 +10:00
#include <sstream>
#include <stdexcept>
2011-05-23 17:18:52 +10:00
#include <fcntl.h>
2011-05-23 17:18:52 +10:00
#include <string.h>
#include <sys/stat.h>
#include <sys/types.h>
2011-05-23 17:18:52 +10:00
using namespace std;
using namespace util;
2011-05-23 17:18:52 +10:00
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
// External support
template <>
bool
is_integer (const json::tree::number &node)
{
return is_integer (node.native ());
}
template <>
bool
is_integer (const json::tree::node &node)
{
return node.is_number () &&
is_integer (node.as_number ());
}
2011-05-23 17:18:52 +10:00
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
2012-04-19 16:41:10 +10:00
// Node
static std::vector<json::flat::item>::const_iterator
parse (std::vector<json::flat::item>::const_iterator first,
std::vector<json::flat::item>::const_iterator last,
std::unique_ptr<json::tree::node> &output);
2011-05-23 17:18:52 +10:00
//-----------------------------------------------------------------------------
static std::vector<json::flat::item>::const_iterator
parse (std::vector<json::flat::item>::const_iterator first,
std::vector<json::flat::item>::const_iterator last,
json::tree::array &parent)
{
for (auto cursor = first; cursor != last; ) {
if (cursor->tag == json::flat::type::ARRAY_END)
return cursor + 1;
std::unique_ptr<json::tree::node> value;
cursor = ::parse (cursor, last, value);
parent.insert (std::move (value));
}
unreachable ();
2012-04-26 18:18:09 +10:00
}
//-----------------------------------------------------------------------------
static std::vector<json::flat::item>::const_iterator
parse (std::vector<json::flat::item>::const_iterator first,
std::vector<json::flat::item>::const_iterator last,
json::tree::object &parent)
{
for (auto cursor = first; cursor != last; ) {
if (cursor->tag == json::flat::type::OBJECT_END)
return cursor + 1;
CHECK_EQ (cursor->tag, json::flat::type::STRING);
std::string key (cursor->first + 1, cursor->last - 1);
++cursor;
std::unique_ptr<json::tree::node> val;
cursor = ::parse (cursor, last, val);
parent.insert (key, std::move (val));
}
unreachable ();
}
//-----------------------------------------------------------------------------
static std::vector<json::flat::item>::const_iterator
parse (std::vector<json::flat::item>::const_iterator first,
std::vector<json::flat::item>::const_iterator last,
std::unique_ptr<json::tree::node> &output)
{
CHECK (first != last);
CHECK (output.get () == nullptr);
switch (first->tag) {
case json::flat::type::NUL:
output.reset (new json::tree::null ());
return first + 1;
case json::flat::type::BOOLEAN:
CHECK (*first->first == 't' || *first->first == 'f');
output.reset (new json::tree::boolean (*first->first == 't'));
return first + 1;
case json::flat::type::STRING:
CHECK_NEQ (first->first, first->last);
output.reset (new json::tree::string (first->first + 1, first->last - 1));
return first + 1;
case json::flat::type::INTEGER:
case json::flat::type::REAL:
output.reset (new json::tree::number (std::atof (first->first)));
return first + 1;
case json::flat::type::ARRAY_BEGIN: {
auto value = std::make_unique<json::tree::array> ();
auto cursor = ::parse (first + 1, last, *value);
output = std::move (value);
return cursor;
}
case json::flat::type::OBJECT_BEGIN: {
auto value = std::make_unique<json::tree::object> ();
auto cursor = ::parse (first + 1, last, *value);
output = std::move (value);
return cursor;
}
default:
unreachable ();
}
}
//-----------------------------------------------------------------------------
std::unique_ptr<json::tree::node>
json::tree::parse (const boost::filesystem::path &path)
{
util::mapped_file f (path);
return parse ((const char*)f.cbegin (), (const char*)f.cend ());
}
2011-05-23 17:18:52 +10:00
std::unique_ptr<json::tree::node>
json::tree::parse (const std::string &path)
{ return parse (path.c_str (), path.c_str () + path.size ()); }
std::unique_ptr<json::tree::node>
json::tree::parse (const char *start)
{ return parse (start, start + strlen (start)); }
2011-05-23 17:18:52 +10:00
void
json::tree::write (const json::tree::node &node, std::ostream &os)
{ node.write (os); }
std::unique_ptr<json::tree::node>
json::tree::parse (const char *first, const char *last)
{
std::unique_ptr<json::tree::node> output;
auto data = json::flat::parse (first, last);
auto end = ::parse (data.cbegin (), data.cend (), output);
CHECK (end == data.cend ());
(void)end;
return output;
}
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
2012-04-19 16:41:10 +10:00
// Type conversion
const json::tree::object&
json::tree::node::as_object (void) const
{ throw json::type_error ("node is not an object"); }
2011-05-23 17:18:52 +10:00
const json::tree::array&
json::tree::node::as_array (void) const
{ throw json::type_error ("node is not an array"); }
2011-05-23 17:18:52 +10:00
const json::tree::string&
json::tree::node::as_string (void) const
{ throw json::type_error ("node is not a string"); }
2011-05-23 17:18:52 +10:00
const json::tree::number&
json::tree::node::as_number (void) const
{ throw json::type_error ("node is not a number"); }
2011-05-23 17:18:52 +10:00
const json::tree::boolean&
json::tree::node::as_boolean (void) const
{ throw json::type_error ("node is not a boolean"); }
2011-05-23 17:18:52 +10:00
const json::tree::null&
json::tree::node::as_null (void) const
{ throw json::type_error ("node is not a null"); }
2012-04-13 11:15:08 +10:00
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
2012-04-19 16:41:10 +10:00
// Global operatoers
2011-05-23 17:18:52 +10:00
bool
json::tree::node::operator!= (const node &rhs) const
2011-05-23 17:18:52 +10:00
{ return !(*this == rhs); }
bool json::tree::node::operator==(const char *rhs) const {
try {
2012-04-20 18:07:42 +10:00
return as_string ().native () == rhs;
} catch (const json::type_error&) {
return false;
}
}
2012-01-04 17:05:40 +11:00
const json::tree::node&
json::tree::node::operator[] (const std::string &key) const
{ return as_object ()[key]; }
const json::tree::node&
json::tree::node::operator[] (unsigned int idx) const
{ return as_array()[idx]; }
2012-04-19 16:41:10 +10:00
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
2012-04-19 16:41:10 +10:00
// Object
2011-05-23 17:18:52 +10:00
json::tree::object::~object ()
{ ; }
2011-05-23 17:18:52 +10:00
bool
json::tree::object::operator ==(const json::tree::object &rhs) const {
2011-05-23 17:18:52 +10:00
for (auto i = rhs.m_values.begin (), j = m_values.begin ();
i != rhs.m_values.end () && j != m_values.end ();
++i, ++j)
{
if (i->first != j->first)
return false;
if ((*i->second) != (*j->second))
return false;
}
return true;
}
void
json::tree::object::insert (const std::string &_key, unique_ptr<json::tree::node> &&value)
{ m_values[_key] = move(value); }
2011-05-23 17:18:52 +10:00
const json::tree::node&
json::tree::object::operator[](const std::string &key) const {
2011-05-23 17:18:52 +10:00
auto value = m_values.find (key);
if (value == m_values.end ()) {
ostringstream ss;
ss << "no key: " << key;
throw json::error (ss.str());
2011-05-23 17:18:52 +10:00
}
return *value->second;
}
2012-04-20 18:09:23 +10:00
bool
json::tree::object::has (const std::string &key) const {
2012-04-20 18:09:23 +10:00
return m_values.find (key) != m_values.end ();
}
2012-04-19 16:44:35 +10:00
void
json::tree::object::clear (void)
2012-04-19 16:44:35 +10:00
{ m_values.clear (); }
void
json::tree::object::erase (const std::string &key) {
2012-04-19 16:44:35 +10:00
auto pos = m_values.find (key);
if (pos == m_values.end ())
throw json::error ("erasing invalid key");
2012-04-19 16:44:35 +10:00
m_values.erase (key);
}
json::tree::object::const_iterator
json::tree::object::begin (void) const
2012-04-19 16:44:35 +10:00
{ return m_values.begin (); }
json::tree::object::const_iterator
json::tree::object::end (void) const
2012-04-19 16:44:35 +10:00
{ return m_values.end (); }
2011-05-23 17:18:52 +10:00
std::ostream&
json::tree::object::write (std::ostream &os) const {
2012-04-12 14:09:33 +10:00
os << "{\n";
{
indenter raii(os);
2011-05-23 17:18:52 +10:00
2012-04-12 14:09:33 +10:00
for (auto i = m_values.begin (); i != m_values.end ();) {
os << '"' << i->first << "\" : " << *i->second;
2011-05-23 17:18:52 +10:00
2012-04-12 14:09:33 +10:00
if (++i != m_values.end ())
os << ",\n";
}
2011-05-23 17:18:52 +10:00
}
2012-04-12 14:09:33 +10:00
os << "\n}";
2011-05-23 17:18:52 +10:00
return os;
}
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
2012-04-19 16:41:10 +10:00
// Array
2011-05-23 17:18:52 +10:00
json::tree::array::~array()
{
m_values.clear ();
}
2011-05-23 17:18:52 +10:00
void
json::tree::array::insert (unique_ptr<json::tree::node> &&_value)
{
m_values.push_back (move (_value));
}
2011-05-23 17:18:52 +10:00
bool
json::tree::array::operator ==(const json::tree::array &rhs) const {
2011-05-23 17:18:52 +10:00
for (auto i = rhs.m_values.begin (), j = m_values.begin ();
i != rhs.m_values.end () && j != m_values.end ();
++i, ++j)
{ if ((**i) != (**j)) return false; }
return true;
}
std::ostream&
json::tree::array::write (std::ostream &os) const {
2014-05-20 14:11:28 +10:00
os << "[\n";
2012-04-12 14:09:33 +10:00
{
2014-05-20 14:11:28 +10:00
indenter raii(os);
2011-05-23 17:18:52 +10:00
2012-04-12 14:09:33 +10:00
for (auto i = m_values.begin (); i != m_values.end (); ++i) {
(*i)->write (os);
2011-05-23 17:18:52 +10:00
2012-04-12 14:09:33 +10:00
if (i != m_values.end () - 1)
os << ",\n";
}
2011-05-23 17:18:52 +10:00
}
2012-04-12 14:09:33 +10:00
os << "\n]";
2011-05-23 17:18:52 +10:00
return os;
}
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
2012-04-19 16:41:10 +10:00
// String
2011-05-23 17:18:52 +10:00
std::ostream&
json::tree::string::write (std::ostream &os) const {
2011-05-23 17:18:52 +10:00
os << '"' << m_value << '"';
return os;
}
bool
json::tree::string::operator ==(const json::tree::string &rhs) const
2011-05-23 17:18:52 +10:00
{ return rhs.m_value == m_value; }
2012-04-20 18:18:47 +10:00
bool
json::tree::string::operator ==(const char *rhs) const
2012-04-20 18:18:47 +10:00
{ return rhs == m_value; }
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
2012-04-19 16:41:10 +10:00
// Number
2011-05-23 17:18:52 +10:00
std::ostream&
json::tree::number::write (std::ostream &os) const {
os << setprecision (numeric_limits<double>::digits10) << m_value;
2011-05-23 17:18:52 +10:00
return os;
}
bool
json::tree::number::operator ==(const json::tree::number &rhs) const
2011-05-23 17:18:52 +10:00
{ return almost_equal (rhs.m_value, m_value); }
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
2012-04-19 16:41:10 +10:00
// Boolean
2011-05-23 17:18:52 +10:00
std::ostream&
json::tree::boolean::write (std::ostream &os) const {
2012-04-12 14:09:33 +10:00
os << (m_value ? "true" : "false");
2011-05-23 17:18:52 +10:00
return os;
}
bool
json::tree::boolean::operator ==(const json::tree::boolean &rhs) const
2011-05-23 17:18:52 +10:00
{ return rhs.m_value == m_value; }
2013-08-05 20:12:04 +10:00
//-----------------------------------------------------------------------------
2012-04-19 16:41:10 +10:00
// Null
2011-05-23 17:18:52 +10:00
std::ostream&
json::tree::null::write (std::ostream &os) const {
2011-05-23 17:18:52 +10:00
os << "null";
return os;
}
ostream&
json::tree::operator <<(ostream &os, const json::tree::node &n)
2012-04-12 14:09:33 +10:00
{ return n.write (os); }
2013-08-05 20:54:19 +10:00
//-----------------------------------------------------------------------------
// to_json
namespace json { namespace tree {
2013-08-05 20:54:19 +10:00
template <>
std::unique_ptr<node>
io<bool>::serialise (const bool &b) {
return std::unique_ptr<node> (new boolean (b));
}
template <>
std::unique_ptr<node>
io<nullptr_t>::serialise (const nullptr_t &) {
return std::unique_ptr<node> (new null ());
}
template <>
std::unique_ptr<node>
io<std::string>::serialise (const std::string &s) {
return std::unique_ptr<node> (new string (s));
}
2013-08-05 22:39:34 +10:00
template <>
std::unique_ptr<node>
io<int>::serialise (const int &i) {
return std::unique_ptr<node> (new number (i));
}
template <>
std::unique_ptr<node>
io<size_t>::serialise (const size_t &i) {
return std::unique_ptr<node> (new number (i));
}
2013-08-05 22:39:34 +10:00
template <>
std::unique_ptr<node>
io<float>::serialise (const float &f) {
return std::unique_ptr<node> (new number (f));
}
} }