1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374
|
////////////////////////////////////////////////////////////////////////////////////////
//
// Nestopia - NES/Famicom emulator written in C++
//
// Copyright (C) 2003-2008 Martin Freij
//
// This file is part of Nestopia.
//
// Nestopia 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 2 of the License, or
// (at your option) any later version.
//
// Nestopia 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.
//
// You should have received a copy of the GNU General Public License
// along with Nestopia; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
////////////////////////////////////////////////////////////////////////////////////////
#ifndef NST_XML_H
#define NST_XML_H
#include <cstring>
#include <iosfwd>
#ifdef NST_PRAGMA_ONCE
#pragma once
#endif
namespace Nes
{
namespace Core
{
class Xml
{
typedef word utfchar;
typedef const word* utfstring;
static inline int ToChar(idword);
static inline wchar_t ToWideChar(idword);
class BaseNode
{
public:
enum In {IN};
enum Out {OUT};
private:
static utfchar ParseReference(utfstring&,utfstring);
static wchar_t* SetType(wchar_t* NST_RESTRICT,utfstring,utfstring,In);
static wchar_t* SetType(wchar_t* NST_RESTRICT,wcstring,wcstring,Out);
static wchar_t* SetValue(wchar_t* NST_RESTRICT,utfstring,utfstring,In);
static wchar_t* SetValue(wchar_t* NST_RESTRICT,wcstring,wcstring,Out);
public:
struct Attribute
{
template<typename T,typename U>
Attribute(T,T,T,T,U);
~Attribute();
wcstring const type;
wcstring const value;
Attribute* next;
};
template<typename T,typename U>
BaseNode(T,T,U);
~BaseNode();
template<typename T,typename U>
void SetValue(T,T,U);
void AddAttribute(utfstring,utfstring,utfstring,utfstring);
wcstring const type;
wcstring value;
Attribute* attribute;
BaseNode* child;
BaseNode* sibling;
};
static bool IsEqual(wcstring,wcstring);
static bool IsEqualNonCase(wcstring,wcstring);
static long ToSigned(wcstring,uint,wcstring*);
static ulong ToUnsigned(wcstring,uint,wcstring*);
public:
Xml();
~Xml();
class Node;
class Attribute : public ImplicitBool<Attribute>
{
public:
long GetSignedValue(uint=0) const;
long GetSignedValue(wcstring&,uint=0) const;
ulong GetUnsignedValue(uint=0) const;
ulong GetUnsignedValue(wcstring&,uint=0) const;
private:
friend class Node;
BaseNode::Attribute* attribute;
Attribute(BaseNode::Attribute* a)
: attribute(a) {}
public:
bool operator ! () const
{
return !attribute;
}
wcstring GetType() const
{
return attribute ? attribute->type : L"";
}
wcstring GetValue() const
{
return attribute ? attribute->value : L"";
}
Attribute GetNext() const
{
return attribute ? attribute->next : NULL;
}
bool IsType(wcstring type) const
{
return IsEqual( GetType(), type ? type : L"" );
}
bool IsValue(wcstring value) const
{
return IsEqualNonCase( GetValue(), value ? value : L"" );
}
};
class Node : public ImplicitBool<Node>
{
friend class Xml;
public:
dword NumChildren(wcstring=NULL) const;
dword NumAttributes() const;
Attribute GetAttribute(dword) const;
Attribute GetAttribute(wcstring) const;
Node GetChild(dword) const;
Node GetChild(wcstring) const;
Node AddChild(wcstring,wcstring=NULL);
Node AddSibling(wcstring,wcstring=NULL);
Attribute AddAttribute(wcstring,wcstring);
long GetSignedValue(uint=0) const;
long GetSignedValue(wcstring&,uint=0) const;
ulong GetUnsignedValue(uint=0) const;
ulong GetUnsignedValue(wcstring&,uint=0) const;
private:
BaseNode* Add(wcstring,wcstring,BaseNode**) const;
BaseNode* node;
Node(BaseNode* n)
: node(n) {}
public:
Node()
: node(NULL) {}
bool operator ! () const
{
return !node;
}
bool HasChildren() const
{
return node && node->child;
}
bool HasNextSibling() const
{
return node && node->sibling;
}
bool HasAttributes() const
{
return node && node->attribute;
}
Attribute GetFirstAttribute() const
{
return node ? node->attribute : NULL;
}
Node GetFirstChild() const
{
return node ? node->child : NULL;
}
Node GetNextSibling() const
{
return node ? node->sibling : NULL;
}
wcstring GetType() const
{
return node ? node->type : L"";
}
wcstring GetValue() const
{
return node ? node->value : L"";
}
bool IsType(wcstring type) const
{
return IsEqual( GetType(), type ? type : L"" );
}
bool IsValue(wcstring value) const
{
return IsEqualNonCase( GetValue(), value ? value : L"" );
}
};
struct Format
{
Format();
cstring tab;
cstring newline;
cstring valueDelimiter;
bool xmlHeader;
bool byteOrderMark;
};
Node Create(wcstring);
Node Read(utfstring);
Node Read(std::istream&);
void Write(Node,std::ostream&,const Format& = Format()) const;
void Destroy();
private:
enum Tag
{
TAG_XML,
TAG_COMMENT,
TAG_INSTRUCTION,
TAG_OPEN,
TAG_OPEN_CLOSE,
TAG_CLOSE
};
class Input
{
static byte* Init(std::istream&,dword&);
const byte* const stream;
const dword size;
dword pos;
public:
Input(std::istream&,dword=0);
~Input();
inline dword Size() const;
inline uint ToByte(dword) const;
inline int ToChar(dword) const;
inline uint FromUTF16LE(dword) const;
inline uint FromUTF16BE(dword) const;
uint ReadUTF8();
inline void SetReadPointer(dword);
};
class Output
{
std::ostream& stream;
void Write(cstring,uint) const;
public:
const Format format;
Output(std::ostream&,const Format&);
class Type
{
friend class Output;
wcstring string;
public:
inline Type(wcstring);
};
class Value
{
friend class Output;
wcstring string;
public:
inline Value(wcstring);
};
const Output& operator << (char) const;
const Output& operator << (wchar_t) const;
const Output& operator << (byte) const;
const Output& operator << (Type) const;
const Output& operator << (Value) const;
inline const Output& operator << (cstring) const;
template<uint N>
inline const Output& operator << (const char (&)[N]) const;
};
static bool IsVoid(utfchar);
static bool IsCtrl(utfchar);
static Tag CheckTag(utfstring);
static utfstring SkipVoid(utfstring);
static utfstring RewindVoid(utfstring,utfstring=NULL);
static utfstring ReadTag(utfstring,BaseNode*&);
static utfstring ReadValue(utfstring,BaseNode&);
static utfstring ReadNode(utfstring,Tag,BaseNode*&);
static void WriteNode(Node,const Output&,uint);
BaseNode* root;
public:
Node GetRoot() const
{
return root;
}
};
}
}
#endif
|