mirror of
https://github.com/jbeder/yaml-cpp.git
synced 2025-09-09 04:41:16 +00:00
e76521c0e9
It's better organized now, I think - nodes only offer a single main way of getting the fundamental scalar (as a string), and now we can specialize a single template to read specific types.
55 lines
969 B
C++
55 lines
969 B
C++
#include "crt.h"
|
|
#include "scalar.h"
|
|
#include "scanner.h"
|
|
#include "token.h"
|
|
#include "exceptions.h"
|
|
#include "node.h"
|
|
|
|
namespace YAML
|
|
{
|
|
Scalar::Scalar()
|
|
{
|
|
}
|
|
|
|
Scalar::~Scalar()
|
|
{
|
|
}
|
|
|
|
void Scalar::Parse(Scanner *pScanner, const ParserState& state)
|
|
{
|
|
Token& token = pScanner->peek();
|
|
m_data = token.value;
|
|
pScanner->pop();
|
|
}
|
|
|
|
void Scalar::Write(std::ostream& out, int indent, bool startedLine, bool onlyOneCharOnLine)
|
|
{
|
|
out << "\"";
|
|
for(unsigned i=0;i<m_data.size();i++) {
|
|
switch(m_data[i]) {
|
|
case '\\': out << "\\\\"; break;
|
|
case '\t': out << "\\t"; break;
|
|
case '\n': out << "\\n"; break;
|
|
case '\r': out << "\\r"; break;
|
|
default: out << m_data[i]; break;
|
|
}
|
|
}
|
|
out << "\"\n";
|
|
}
|
|
|
|
int Scalar::Compare(Content *pContent)
|
|
{
|
|
return -pContent->Compare(this);
|
|
}
|
|
|
|
int Scalar::Compare(Scalar *pScalar)
|
|
{
|
|
if(m_data < pScalar->m_data)
|
|
return -1;
|
|
else if(m_data > pScalar->m_data)
|
|
return 1;
|
|
else
|
|
return 0;
|
|
}
|
|
}
|