2008-09-04 02:20:39 +04:00
|
|
|
#include "crt.h"
|
|
|
|
#include "node.h"
|
|
|
|
#include "token.h"
|
|
|
|
#include "scanner.h"
|
|
|
|
#include "content.h"
|
|
|
|
#include "parser.h"
|
|
|
|
#include "scalar.h"
|
|
|
|
#include "sequence.h"
|
|
|
|
#include "map.h"
|
|
|
|
#include "iterpriv.h"
|
|
|
|
|
|
|
|
namespace YAML
|
|
|
|
{
|
|
|
|
// the ordering!
|
|
|
|
bool ltnode::operator ()(const Node *pNode1, const Node *pNode2) const
|
|
|
|
{
|
|
|
|
return *pNode1 < *pNode2;
|
|
|
|
}
|
|
|
|
|
|
|
|
Node::Node(): m_pContent(0), m_alias(false)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
Node::~Node()
|
|
|
|
{
|
|
|
|
Clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::Clear()
|
|
|
|
{
|
|
|
|
delete m_pContent;
|
|
|
|
m_pContent = 0;
|
|
|
|
m_alias = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::Parse(Scanner *pScanner, const ParserState& state)
|
|
|
|
{
|
|
|
|
Clear();
|
|
|
|
|
2009-02-07 10:57:13 +03:00
|
|
|
// an empty node *is* a possibility
|
|
|
|
if(pScanner->empty())
|
|
|
|
return;
|
|
|
|
|
2008-11-18 07:20:07 +03:00
|
|
|
// save location
|
|
|
|
m_line = pScanner->peek().line;
|
|
|
|
m_column = pScanner->peek().column;
|
|
|
|
|
2008-09-04 02:20:39 +04:00
|
|
|
ParseHeader(pScanner, state);
|
|
|
|
|
|
|
|
// is this an alias? if so, it can have no content
|
|
|
|
if(m_alias)
|
|
|
|
return;
|
|
|
|
|
|
|
|
// now split based on what kind of node we should be
|
|
|
|
switch(pScanner->peek().type) {
|
|
|
|
case TT_SCALAR:
|
|
|
|
m_pContent = new Scalar;
|
|
|
|
m_pContent->Parse(pScanner, state);
|
|
|
|
break;
|
|
|
|
case TT_FLOW_SEQ_START:
|
|
|
|
case TT_BLOCK_SEQ_START:
|
|
|
|
case TT_BLOCK_ENTRY:
|
|
|
|
m_pContent = new Sequence;
|
|
|
|
m_pContent->Parse(pScanner, state);
|
|
|
|
break;
|
|
|
|
case TT_FLOW_MAP_START:
|
|
|
|
case TT_BLOCK_MAP_START:
|
|
|
|
m_pContent = new Map;
|
|
|
|
m_pContent->Parse(pScanner, state);
|
|
|
|
break;
|
2009-01-15 20:12:13 +03:00
|
|
|
default:
|
|
|
|
break;
|
2008-09-04 02:20:39 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// ParseHeader
|
|
|
|
// . Grabs any tag, alias, or anchor tokens and deals with them.
|
|
|
|
void Node::ParseHeader(Scanner *pScanner, const ParserState& state)
|
|
|
|
{
|
|
|
|
while(1) {
|
|
|
|
if(pScanner->empty())
|
|
|
|
return;
|
|
|
|
|
|
|
|
switch(pScanner->peek().type) {
|
|
|
|
case TT_TAG: ParseTag(pScanner, state); break;
|
|
|
|
case TT_ANCHOR: ParseAnchor(pScanner, state); break;
|
|
|
|
case TT_ALIAS: ParseAlias(pScanner, state); break;
|
|
|
|
default: return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::ParseTag(Scanner *pScanner, const ParserState& state)
|
|
|
|
{
|
|
|
|
Token& token = pScanner->peek();
|
|
|
|
if(m_tag != "")
|
|
|
|
throw ParserException(token.line, token.column, ErrorMsg::MULTIPLE_TAGS);
|
|
|
|
|
|
|
|
m_tag = state.TranslateTag(token.value);
|
|
|
|
|
|
|
|
for(unsigned i=0;i<token.params.size();i++)
|
|
|
|
m_tag += token.params[i];
|
|
|
|
pScanner->pop();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::ParseAnchor(Scanner *pScanner, const ParserState& state)
|
|
|
|
{
|
|
|
|
Token& token = pScanner->peek();
|
|
|
|
if(m_anchor != "")
|
|
|
|
throw ParserException(token.line, token.column, ErrorMsg::MULTIPLE_ANCHORS);
|
|
|
|
|
|
|
|
m_anchor = token.value;
|
|
|
|
m_alias = false;
|
|
|
|
pScanner->pop();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::ParseAlias(Scanner *pScanner, const ParserState& state)
|
|
|
|
{
|
|
|
|
Token& token = pScanner->peek();
|
|
|
|
if(m_anchor != "")
|
|
|
|
throw ParserException(token.line, token.column, ErrorMsg::MULTIPLE_ALIASES);
|
|
|
|
if(m_tag != "")
|
|
|
|
throw ParserException(token.line, token.column, ErrorMsg::ALIAS_CONTENT);
|
|
|
|
|
|
|
|
m_anchor = token.value;
|
|
|
|
m_alias = true;
|
|
|
|
pScanner->pop();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::Write(std::ostream& out, int indent, bool startedLine, bool onlyOneCharOnLine) const
|
|
|
|
{
|
|
|
|
// write anchor/alias
|
|
|
|
if(m_anchor != "") {
|
|
|
|
if(m_alias)
|
|
|
|
out << std::string("*");
|
|
|
|
else
|
|
|
|
out << std::string("&");
|
|
|
|
out << m_anchor << std::string(" ");
|
|
|
|
startedLine = true;
|
|
|
|
onlyOneCharOnLine = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// write tag
|
|
|
|
if(m_tag != "") {
|
2008-11-20 07:12:31 +03:00
|
|
|
// put the tag in the "proper" brackets
|
|
|
|
if(m_tag.substr(0, 2) == "!<" && m_tag.substr(m_tag.size() - 1) == ">")
|
|
|
|
out << m_tag;
|
|
|
|
else
|
|
|
|
out << std::string("!<") << m_tag << std::string("> ");
|
2008-09-04 02:20:39 +04:00
|
|
|
startedLine = true;
|
|
|
|
onlyOneCharOnLine = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(!m_pContent) {
|
|
|
|
out << std::string("\n");
|
|
|
|
} else {
|
|
|
|
m_pContent->Write(out, indent, startedLine, onlyOneCharOnLine);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
CONTENT_TYPE Node::GetType() const
|
|
|
|
{
|
|
|
|
if(!m_pContent)
|
|
|
|
return CT_NONE;
|
|
|
|
|
|
|
|
if(m_pContent->IsScalar())
|
|
|
|
return CT_SCALAR;
|
|
|
|
else if(m_pContent->IsSequence())
|
|
|
|
return CT_SEQUENCE;
|
|
|
|
else if(m_pContent->IsMap())
|
|
|
|
return CT_MAP;
|
|
|
|
|
|
|
|
return CT_NONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
// begin
|
|
|
|
// Returns an iterator to the beginning of this (sequence or map).
|
|
|
|
Iterator Node::begin() const
|
|
|
|
{
|
|
|
|
if(!m_pContent)
|
|
|
|
return Iterator();
|
|
|
|
|
|
|
|
std::vector <Node *>::const_iterator seqIter;
|
|
|
|
if(m_pContent->GetBegin(seqIter))
|
|
|
|
return Iterator(new IterPriv(seqIter));
|
|
|
|
|
|
|
|
std::map <Node *, Node *, ltnode>::const_iterator mapIter;
|
|
|
|
if(m_pContent->GetBegin(mapIter))
|
|
|
|
return Iterator(new IterPriv(mapIter));
|
|
|
|
|
|
|
|
return Iterator();
|
|
|
|
}
|
|
|
|
|
|
|
|
// end
|
|
|
|
// . Returns an iterator to the end of this (sequence or map).
|
|
|
|
Iterator Node::end() const
|
|
|
|
{
|
|
|
|
if(!m_pContent)
|
|
|
|
return Iterator();
|
|
|
|
|
|
|
|
std::vector <Node *>::const_iterator seqIter;
|
|
|
|
if(m_pContent->GetEnd(seqIter))
|
|
|
|
return Iterator(new IterPriv(seqIter));
|
|
|
|
|
|
|
|
std::map <Node *, Node *, ltnode>::const_iterator mapIter;
|
|
|
|
if(m_pContent->GetEnd(mapIter))
|
|
|
|
return Iterator(new IterPriv(mapIter));
|
|
|
|
|
|
|
|
return Iterator();
|
|
|
|
}
|
|
|
|
|
|
|
|
// size
|
|
|
|
// . Returns the size of this node, if it's a sequence node.
|
|
|
|
// . Otherwise, returns zero.
|
|
|
|
unsigned Node::size() const
|
|
|
|
{
|
|
|
|
if(!m_pContent)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return m_pContent->GetSize();
|
|
|
|
}
|
|
|
|
|
|
|
|
const Node& Node::operator [] (unsigned u) const
|
|
|
|
{
|
|
|
|
if(!m_pContent)
|
|
|
|
throw BadDereference();
|
|
|
|
|
|
|
|
Node *pNode = m_pContent->GetNode(u);
|
|
|
|
if(pNode)
|
|
|
|
return *pNode;
|
|
|
|
|
|
|
|
return GetValue(u);
|
|
|
|
}
|
|
|
|
|
|
|
|
const Node& Node::operator [] (int i) const
|
|
|
|
{
|
|
|
|
if(!m_pContent)
|
|
|
|
throw BadDereference();
|
|
|
|
|
|
|
|
Node *pNode = m_pContent->GetNode(i);
|
|
|
|
if(pNode)
|
|
|
|
return *pNode;
|
|
|
|
|
|
|
|
return GetValue(i);
|
|
|
|
}
|
|
|
|
|
|
|
|
///////////////////////////////////////////////////////
|
|
|
|
// Extraction
|
2008-09-25 03:29:00 +04:00
|
|
|
// Note: these Read() functions are identical, but
|
|
|
|
// they're not templated because they use a Content virtual
|
|
|
|
// function, so we'd have to #include that in node.h, and
|
|
|
|
// I don't want to.
|
2008-09-04 02:20:39 +04:00
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
bool Node::Read(std::string& s) const
|
2008-09-04 02:20:39 +04:00
|
|
|
{
|
2008-09-25 03:29:00 +04:00
|
|
|
if(!m_pContent)
|
|
|
|
return false;
|
2008-09-04 02:20:39 +04:00
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
return m_pContent->Read(s);
|
2008-09-04 02:20:39 +04:00
|
|
|
}
|
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
bool Node::Read(int& i) const
|
2008-09-04 02:20:39 +04:00
|
|
|
{
|
2008-09-25 03:29:00 +04:00
|
|
|
if(!m_pContent)
|
|
|
|
return false;
|
2008-09-04 02:20:39 +04:00
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
return m_pContent->Read(i);
|
2008-09-04 02:20:39 +04:00
|
|
|
}
|
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
bool Node::Read(unsigned& u) const
|
2008-09-04 02:20:39 +04:00
|
|
|
{
|
2008-09-25 03:29:00 +04:00
|
|
|
if(!m_pContent)
|
|
|
|
return false;
|
2008-09-04 02:20:39 +04:00
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
return m_pContent->Read(u);
|
2008-09-04 02:20:39 +04:00
|
|
|
}
|
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
bool Node::Read(long& l) const
|
2008-09-04 02:20:39 +04:00
|
|
|
{
|
2008-09-25 03:29:00 +04:00
|
|
|
if(!m_pContent)
|
|
|
|
return false;
|
2008-09-04 02:20:39 +04:00
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
return m_pContent->Read(l);
|
2008-09-04 02:20:39 +04:00
|
|
|
}
|
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
bool Node::Read(float& f) const
|
2008-09-04 02:20:39 +04:00
|
|
|
{
|
2008-09-25 03:29:00 +04:00
|
|
|
if(!m_pContent)
|
|
|
|
return false;
|
2008-09-04 02:20:39 +04:00
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
return m_pContent->Read(f);
|
2008-09-04 02:20:39 +04:00
|
|
|
}
|
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
bool Node::Read(double& d) const
|
2008-09-04 02:20:39 +04:00
|
|
|
{
|
2008-09-25 03:29:00 +04:00
|
|
|
if(!m_pContent)
|
|
|
|
return false;
|
2008-09-04 02:20:39 +04:00
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
return m_pContent->Read(d);
|
2008-09-04 02:20:39 +04:00
|
|
|
}
|
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
bool Node::Read(char& c) const
|
2008-09-04 02:20:39 +04:00
|
|
|
{
|
2008-09-25 03:29:00 +04:00
|
|
|
if(!m_pContent)
|
|
|
|
return false;
|
2008-09-04 02:20:39 +04:00
|
|
|
|
2008-09-25 03:29:00 +04:00
|
|
|
return m_pContent->Read(c);
|
2008-09-04 02:20:39 +04:00
|
|
|
}
|
|
|
|
|
2008-09-25 04:15:40 +04:00
|
|
|
bool Node::Read(bool& b) const
|
|
|
|
{
|
|
|
|
if(!m_pContent)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return m_pContent->Read(b);
|
|
|
|
}
|
|
|
|
|
2008-09-04 02:20:39 +04:00
|
|
|
std::ostream& operator << (std::ostream& out, const Node& node)
|
|
|
|
{
|
|
|
|
node.Write(out, 0, false, false);
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
|
|
|
int Node::Compare(const Node& rhs) const
|
|
|
|
{
|
|
|
|
// Step 1: no content is the smallest
|
|
|
|
if(!m_pContent) {
|
|
|
|
if(rhs.m_pContent)
|
|
|
|
return -1;
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if(!rhs.m_pContent)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
return m_pContent->Compare(rhs.m_pContent);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator < (const Node& n1, const Node& n2)
|
|
|
|
{
|
|
|
|
return n1.Compare(n2) < 0;
|
|
|
|
}
|
|
|
|
}
|