diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..2ffcd97 --- /dev/null +++ b/.gitignore @@ -0,0 +1,2 @@ +.vscode +*.out \ No newline at end of file diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..4b9eb58 --- /dev/null +++ b/Makefile @@ -0,0 +1,19 @@ +#CC specifies which compiler we're using +CXX = g++ + +#OBJS specifies which files to compile as part of the project +OBJS = collision.cpp main.cpp MyTexture.cpp MyWindow.cpp Player.cpp Tile.cpp TileAtlas.cpp + +#COMPILER_FLAGS specifies the additional compilation options we're using +# -w suppresses all warnings +COMPILER_FLAGS = -g + +#LINKER_FLAGS specifies the libraries we're linking against +LINKER_FLAGS = -lSDL2 -lSDL2_image # -lSDL2_ttf -lSDL2_mixer + +#OBJ_NAME specifies the name of our exectuable +OBJ_NAME = experiment.out + +#This is the target that compiles our executable +all : $(OBJS) + $(CXX) -I/usr/include/SDL2 $(OBJS) $(COMPILER_FLAGS) $(LINKER_FLAGS) -o $(OBJ_NAME) \ No newline at end of file diff --git a/MyTexture.cpp b/MyTexture.cpp new file mode 100644 index 0000000..57d7d72 --- /dev/null +++ b/MyTexture.cpp @@ -0,0 +1,149 @@ +#include "MyTexture.h" +#include +#include +#include +#include + +LTexture::LTexture() +{ + // Initialize + mTexture = NULL; + mWidth = 0; + mHeight = 0; +} + +LTexture::~LTexture() +{ + // Deallocate + free(); +} + +bool LTexture::loadFromFile(SDL_Renderer *renderer, std::string path) +{ + // Get rid of preexisting texture + free(); + + // The final texture + SDL_Texture *newTexture = NULL; + + // Load image at specified path + SDL_Surface *loadedSurface = IMG_Load(path.c_str()); + if (loadedSurface == NULL) + { + printf("Unable to load image %s! SDL_image Error: %s\n", path.c_str(), IMG_GetError()); + } + else + { + // Color key image + SDL_SetColorKey(loadedSurface, SDL_TRUE, SDL_MapRGB(loadedSurface->format, 0, 0xFF, 0xFF)); + + // Create texture from surface pixels + newTexture = SDL_CreateTextureFromSurface(renderer, loadedSurface); + if (newTexture == NULL) + { + printf("Unable to create texture from %s! SDL Error: %s\n", path.c_str(), SDL_GetError()); + } + else + { + // Get image dimensions + mWidth = loadedSurface->w; + mHeight = loadedSurface->h; + } + + // Get rid of old loaded surface + SDL_FreeSurface(loadedSurface); + } + + // Return success + mTexture = newTexture; + return mTexture != NULL; +} + +#if defined(SDL_TTF_MAJOR_VERSION) +bool LTexture::loadFromRenderedText(std::string textureText, SDL_Color textColor) +{ + // Get rid of preexisting texture + free(); + + // Render text surface + SDL_Surface *textSurface = TTF_RenderText_Solid(gFont, textureText.c_str(), textColor); + if (textSurface != NULL) + { + // Create texture from surface pixels + mTexture = SDL_CreateTextureFromSurface(gRenderer, textSurface); + if (mTexture == NULL) + { + printf("Unable to create texture from rendered text! SDL Error: %s\n", SDL_GetError()); + } + else + { + // Get image dimensions + mWidth = textSurface->w; + mHeight = textSurface->h; + } + + // Get rid of old surface + SDL_FreeSurface(textSurface); + } + else + { + printf("Unable to render text surface! SDL_ttf Error: %s\n", TTF_GetError()); + } + + // Return success + return mTexture != NULL; +} +#endif + +void LTexture::free() +{ + // Free texture if it exists + if (mTexture != NULL) + { + SDL_DestroyTexture(mTexture); + mTexture = NULL; + mWidth = 0; + mHeight = 0; + } +} + +void LTexture::setColor(Uint8 red, Uint8 green, Uint8 blue) +{ + // Modulate texture rgb + SDL_SetTextureColorMod(mTexture, red, green, blue); +} + +void LTexture::setBlendMode(SDL_BlendMode blending) +{ + // Set blending function + SDL_SetTextureBlendMode(mTexture, blending); +} + +void LTexture::setAlpha(Uint8 alpha) +{ + // Modulate texture alpha + SDL_SetTextureAlphaMod(mTexture, alpha); +} + +void LTexture::render(SDL_Renderer *renderer, int x, int y, SDL_Rect *clip, double angle, SDL_Point *center, SDL_RendererFlip flip) +{ + // Set rendering space and render to screen + SDL_Rect renderQuad = {x, y, mWidth, mHeight}; + if (clip != NULL) + { + renderQuad.w = clip->w; + renderQuad.h = clip->h; + } + // Render to screen + SDL_RenderCopyEx(renderer, mTexture, clip, &renderQuad, angle, center, flip); +} + +int LTexture::getWidth() +{ + return mWidth; +} + +int LTexture::getHeight() +{ + return mHeight; +} \ No newline at end of file diff --git a/MyTexture.h b/MyTexture.h new file mode 100644 index 0000000..9bf78c7 --- /dev/null +++ b/MyTexture.h @@ -0,0 +1,53 @@ +#ifndef TEXTURE_H +#define TEXTURE_H + +#include +#include +#include + +class LTexture +{ +public: + // Initializes variables + LTexture(); + + // Deallocates memory + ~LTexture(); + + // Loads image at specified path + bool loadFromFile(SDL_Renderer *renderer, std::string path); + +#if defined(SDL_TTF_MAJOR_VERSION) + // Creates image from font string + bool loadFromRenderedText(std::string textureText, SDL_Color textColor); +#endif + + // Deallocates texture + void free(); + + // Set color modulation + void setColor(Uint8 red, Uint8 green, Uint8 blue); + + // Set blending + void setBlendMode(SDL_BlendMode blending); + + // Set alpha modulation + void setAlpha(Uint8 alpha); + + // Renders texture at given point + void render(SDL_Renderer *renderer, int x, int y, SDL_Rect *clip = NULL, double angle = 0.0, SDL_Point *center = NULL, SDL_RendererFlip flip = SDL_FLIP_NONE); + + // Gets image dimensions + int getWidth(); + int getHeight(); + +private: + // The actual hardware texture + SDL_Texture *mTexture; + + // Image dimensions + int mWidth; + int mHeight; +}; + +#endif \ No newline at end of file diff --git a/MyWindow.cpp b/MyWindow.cpp new file mode 100644 index 0000000..6b4548e --- /dev/null +++ b/MyWindow.cpp @@ -0,0 +1,223 @@ +#include +#include +#include +#include +#include + +#include "MyWindow.h" +#include "Renderable.h" + +LWindow::LWindow() +{ + // Initialize non-existant window + mWindow = NULL; + mMouseFocus = false; + mKeyboardFocus = false; + mFullScreen = false; + mMinimized = false; + mWidth = 0; + mHeight = 0; +} + +bool LWindow::init(int width, int height) +{ + // Create window + mWindow = SDL_CreateWindow("SDL Tutorial", SDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED, width, height, SDL_WINDOW_SHOWN | SDL_WINDOW_RESIZABLE); + if (mWindow != NULL) + { + mMouseFocus = true; + mKeyboardFocus = true; + mWidth = width; + mHeight = height; + mRenderer = SDL_CreateRenderer(mWindow, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC); + if (mRenderer == NULL) + { + printf("Renderer could not be created! SDL Error: %s\n", SDL_GetError()); + return false; + } + else + { + // Initialize renderer color + SDL_SetRenderDrawColor(mRenderer, 0xFF, 0xFF, 0xFF, 0xFF); + } + } + mTilesX = 0; + mTilesY = 0; + mTileWidth = 0; + mTileHeight = 0; + return mWindow != NULL; +} + +void LWindow::setParams(int tilesX, int tilesY, int tileWidth, int tileHeight) +{ + mTilesX = tilesX; + mTilesY = tilesY; + mTileWidth = tileWidth; + mTileHeight = tileHeight; +} + +int LWindow::render(std::vector objects, SDL_Rect &camera) +{ + SDL_SetRenderDrawColor(mRenderer, 0xFF, 0xFF, 0xFF, 0xFF); + SDL_RenderClear(mRenderer); + + for (size_t i = 0; i < objects.size(); i++) + { + int res = objects[i]->render(mRenderer, camera); + + if (res != 0) + { + return -1; + } + } + + SDL_RenderPresent(mRenderer); + + return 0; +} + +void LWindow::handleEvent(SDL_Event &e) +{ + // Window event occured + if (e.type == SDL_WINDOWEVENT) + { + // Caption update flag + bool updateCaption = false; + + switch (e.window.event) + { + // Get new dimensions and repaint on window size change + case SDL_WINDOWEVENT_SIZE_CHANGED: + mWidth = e.window.data1; + mHeight = e.window.data2; + SDL_RenderPresent(mRenderer); + break; + + // Repaint on exposure + case SDL_WINDOWEVENT_EXPOSED: + SDL_RenderPresent(mRenderer); + break; + + // Mouse entered window + case SDL_WINDOWEVENT_ENTER: + mMouseFocus = true; + updateCaption = true; + break; + + // Mouse left window + case SDL_WINDOWEVENT_LEAVE: + mMouseFocus = false; + updateCaption = true; + break; + + // Window has keyboard focus + case SDL_WINDOWEVENT_FOCUS_GAINED: + mKeyboardFocus = true; + updateCaption = true; + break; + + // Window lost keyboard focus + case SDL_WINDOWEVENT_FOCUS_LOST: + mKeyboardFocus = false; + updateCaption = true; + break; + + // Window minimized + case SDL_WINDOWEVENT_MINIMIZED: + mMinimized = true; + break; + + // Window maxized + case SDL_WINDOWEVENT_MAXIMIZED: + mMinimized = false; + break; + + // Window restored + case SDL_WINDOWEVENT_RESTORED: + mMinimized = false; + break; + } + + // Update window caption with new data + if (updateCaption) + { + std::stringstream caption; + caption << "SDL Tutorial - MouseFocus:" << ((mMouseFocus) ? "On" : "Off") << " KeyboardFocus:" << ((mKeyboardFocus) ? "On" : "Off"); + SDL_SetWindowTitle(mWindow, caption.str().c_str()); + } + } + // Enter exit full screen on return key + else if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_RETURN) + { + if (mFullScreen) + { + SDL_SetWindowFullscreen(mWindow, SDL_FALSE); + mFullScreen = false; + } + else + { + SDL_SetWindowFullscreen(mWindow, SDL_TRUE); + mFullScreen = true; + mMinimized = false; + } + } +} + +void LWindow::free() +{ + if (mWindow != NULL) + { + SDL_DestroyWindow(mWindow); + } + + mMouseFocus = false; + mKeyboardFocus = false; + mWidth = 0; + mHeight = 0; +} + +bool LWindow::loadTexture(LTexture &texture, std::string path) +{ + return texture.loadFromFile(mRenderer, path); +} + +int LWindow::getWidth() +{ + return mWidth; +} + +int LWindow::getHeight() +{ + return mHeight; +} + +int LWindow::getLevelWidth() +{ + return mTilesX * mTileWidth; +} + +int LWindow::getLevelHeight() +{ + return mTilesY * mTileHeight; +} + +bool LWindow::hasMouseFocus() +{ + return mMouseFocus; +} + +bool LWindow::hasKeyboardFocus() +{ + return mKeyboardFocus; +} + +bool LWindow::isMinimized() +{ + return mMinimized; +} + +void LWindow::cleanUp() +{ + SDL_DestroyRenderer(mRenderer); + SDL_DestroyWindow(mWindow); +} \ No newline at end of file diff --git a/MyWindow.h b/MyWindow.h new file mode 100644 index 0000000..f72dc27 --- /dev/null +++ b/MyWindow.h @@ -0,0 +1,70 @@ +#ifndef WINDOW_H +#define WINDOW_H + +#include +#include +#include +#include + +#include "MyTexture.h" +#include "Renderable.h" + +class LWindow +{ +public: + // Intializes internals + LWindow(); + + // Creates window + bool init(int width, int height); + bool loadTileset(std::string path); + bool initGameObjs(); + + // Creates renderer from internal window + int render(std::vector objects, SDL_Rect &camera); + + // Handles window events + void handleEvent(SDL_Event &e); + + // Deallocates internals + void free(); + + // Window dimensions + int getWidth(); + int getHeight(); + + int getLevelWidth(); + int getLevelHeight(); + + // Window focii + bool hasMouseFocus(); + bool hasKeyboardFocus(); + bool isMinimized(); + + bool loadTexture(LTexture &texture, std::string path); + + void cleanUp(); + void setParams(int tilesX, int tilesY, int tileWidth, int tileHeight); + +private: + // Window data + SDL_Window *mWindow; + SDL_Renderer *mRenderer; + + // Window dimensions + int mWidth; + int mHeight; + + // Window focus + bool mMouseFocus; + bool mKeyboardFocus; + bool mFullScreen; + bool mMinimized; + + int mTilesX; + int mTilesY; + int mTileWidth; + int mTileHeight; +}; + +#endif \ No newline at end of file diff --git a/Player.cpp b/Player.cpp new file mode 100644 index 0000000..192789e --- /dev/null +++ b/Player.cpp @@ -0,0 +1,147 @@ +#include +#include +#include "Player.h" +#include "Tile.h" +#include "MyTexture.h" + +#include + +Dot::Dot(LTexture &texture, LWindow &window) : mTexture(texture), mWindow(window) +{ + // Initialize the collision box + mBox.x = 0; + mBox.y = 0; + mBox.w = DOT_WIDTH; + mBox.h = DOT_HEIGHT; + + // Initialize the velocity + mVelX = 0; + mVelY = 0; +} + +// bool Dot::touchesWall(std::vector tiles) +// { +// // Go through the tiles +// for (int i = 0; i < tiles.size(); ++i) +// { +// // If the tile is a wall type tile +// if ((tiles[i].getType() >= TILE_CENTER) && (tiles[i]->getType() <= TILE_TOPLEFT)) +// { +// // If the collision box touches the wall tile +// if (checkCollision(box, tiles[i]->getBox())) +// { +// return true; +// } +// } +// } + +// // If no wall tiles were touched +// return false; +// } + +void Dot::handleEvent(SDL_Event &e) +{ + // If a key was pressed + if (e.type == SDL_KEYDOWN && e.key.repeat == 0) + { + // Adjust the velocity + switch (e.key.keysym.sym) + { + case SDLK_UP: + mVelY -= DOT_VEL; + break; + case SDLK_DOWN: + mVelY += DOT_VEL; + break; + case SDLK_LEFT: + mVelX -= DOT_VEL; + break; + case SDLK_RIGHT: + mVelX += DOT_VEL; + break; + } + } + // If a key was released + else if (e.type == SDL_KEYUP && e.key.repeat == 0) + { + // Adjust the velocity + switch (e.key.keysym.sym) + { + case SDLK_UP: + mVelY += DOT_VEL; + break; + case SDLK_DOWN: + mVelY -= DOT_VEL; + break; + case SDLK_LEFT: + mVelX += DOT_VEL; + break; + case SDLK_RIGHT: + mVelX -= DOT_VEL; + break; + } + } +} + +void Dot::move() +{ + // Move the dot left or right + mBox.x += mVelX; + + // If the dot went too far to the left or right or touched a wall + if ((mBox.x < 0) || (mBox.x + DOT_WIDTH > mWindow.getLevelWidth()) /* || touchesWall(mBox, tiles) */) + { + // move back + mBox.x -= mVelX; + } + + // Move the dot up or down + mBox.y += mVelY; + + // If the dot went too far up or down or touched a wall + if ((mBox.y < 0) || (mBox.y + DOT_HEIGHT > mWindow.getLevelHeight()) /* || touchesWall(mBox, tiles) */) + { + // move back + mBox.y -= mVelY; + } +} + +void Dot::setCamera(SDL_Rect &camera) +{ + // Center the camera over the dot + camera.x = (mBox.x + DOT_WIDTH / 2) - mWindow.getWidth() / 2; + camera.y = (mBox.y + DOT_HEIGHT / 2) - mWindow.getHeight() / 2; + + // std::cout << camera.x << std::endl; + // Keep the camera in bounds + if (camera.x < 0) + { + camera.x = 0; + } + else if (camera.x > mWindow.getLevelWidth() - camera.w) + { + camera.x = mWindow.getLevelWidth() - camera.w; + } + + if (camera.y < 0) + { + camera.y = 0; + } + else if (camera.y > mWindow.getLevelHeight() - camera.h) + { + camera.y = mWindow.getLevelHeight() - camera.h; + } +} + +int Dot::render(SDL_Renderer *renderer, SDL_Rect &camera) +{ + // Show the dot + // std::cout << camera.x << std::endl; + mTexture.render(renderer, mBox.x - camera.x, mBox.y - camera.y); + return 0; +} + +void Dot::cleanUp() +{ + mTexture.free(); +} \ No newline at end of file diff --git a/Player.h b/Player.h new file mode 100644 index 0000000..a2a2abc --- /dev/null +++ b/Player.h @@ -0,0 +1,52 @@ +#ifndef PLAYER_H +#define PLAYER_H + +#include +#include +#include "Tile.h" +#include "MyTexture.h" +#include "Renderable.h" +#include "MyWindow.h" + +class Dot : public Renderable +{ +public: + // The dimensions of the dot + static const int DOT_WIDTH = 20; + static const int DOT_HEIGHT = 20; + + // Maximum axis velocity of the dot + static const int DOT_VEL = 10; + + // Initializes the variables + Dot(LTexture &myTexture, LWindow &window); + + // Takes key presses and adjusts the dot's velocity + void handleEvent(SDL_Event &e); + + // Moves the dot and check collision against tiles + void move(); + + // Centers the camera over the dot + void setCamera(SDL_Rect &camera); + + // Shows the dot on the screen + int render(SDL_Renderer *renderer, SDL_Rect &camera); + + void cleanUp(); + + SDL_Rect mBox; + LTexture &mTexture; + +private: + // Collision box of the dot + + LWindow &mWindow; + + // bool touchesWall(std::vector tiles); + + // The velocity of the dot + int mVelX, mVelY; +}; + +#endif \ No newline at end of file diff --git a/Renderable.h b/Renderable.h new file mode 100644 index 0000000..6627f89 --- /dev/null +++ b/Renderable.h @@ -0,0 +1,13 @@ +#ifndef RENDERABLE_H +#define RENDERABLE_H + +#include +#include + +class Renderable +{ +public: + virtual int render(SDL_Renderer *renderer, SDL_Rect &camera) = 0; +}; + +#endif \ No newline at end of file diff --git a/Tile.cpp b/Tile.cpp new file mode 100644 index 0000000..e4ab0d5 --- /dev/null +++ b/Tile.cpp @@ -0,0 +1,45 @@ +#include +#include +#include "Tile.h" +#include "collision.h" +#include "TileAtlas.h" + +Tile::Tile(LTexture &texture, LWindow &window, int x, int y, int width, int height, int tileType) : mTexture(texture), mWindow(window) +{ + // Get the offsets + mBox.x = x; + mBox.y = y; + + // Set the collision box + mBox.w = width; + mBox.h = height; + + // Get the tile type + mType = tileType; +} + +int Tile::render(SDL_Renderer *renderer, SDL_Rect &camera) +{ + // If the tile is on screen + if (checkCollision(camera, mBox)) + { + // Show the tile + mTexture.render(renderer, mBox.x - camera.x, mBox.y - camera.y, &(TileAtlas::tileClips[mType - 1])); + } + return 0; +} + +int Tile::getType() +{ + return mType; +} + +SDL_Rect Tile::getBox() +{ + return mBox; +} + +void Tile::cleanUp() +{ + mTexture.free(); +} \ No newline at end of file diff --git a/Tile.h b/Tile.h new file mode 100644 index 0000000..ae1d580 --- /dev/null +++ b/Tile.h @@ -0,0 +1,41 @@ +#ifndef TILE_H +#define TILE_H + +#include +#include + +#include "MyTexture.h" +#include "MyWindow.h" +#include "Renderable.h" + +// The tile +class Tile : public Renderable +{ +public: + // Initializes position and type + Tile(LTexture &myTexture, LWindow &window, int x, int y, int width, int height, int tileType); + + // Shows the tile + int render(SDL_Renderer *renderer, SDL_Rect &camera); + + // Get the tile type + int getType(); + + // Get the collision box + SDL_Rect getBox(); + + void cleanUp(); + +private: + // The attributes of the tile + SDL_Rect mBox; + + LTexture &mTexture; + + LWindow &mWindow; + + // The tile type + int mType; +}; + +#endif \ No newline at end of file diff --git a/TileAtlas.cpp b/TileAtlas.cpp new file mode 100644 index 0000000..014162d --- /dev/null +++ b/TileAtlas.cpp @@ -0,0 +1,17 @@ +#include +#include + +#include "TileAtlas.h" + +std::vector TileAtlas::tileClips; + +void TileAtlas::init(int uniqueTilesX, int uniqueTilesY, int tileWidth, int tileHeight) +{ + for (int i = 0; i < uniqueTilesY; i++) + { + for (int j = 0; j < uniqueTilesX; j++) + { + tileClips.push_back({tileWidth * j, tileHeight * i, tileWidth, tileHeight}); + } + } +} \ No newline at end of file diff --git a/TileAtlas.h b/TileAtlas.h new file mode 100644 index 0000000..b408a98 --- /dev/null +++ b/TileAtlas.h @@ -0,0 +1,15 @@ +#ifndef TILE_ATLAS_H +#define TILE_ATLAS_H + +#include + +#include + +class TileAtlas +{ +public: + static std::vector tileClips; + static void init(int uniqueTilesX, int uniqueTilesY, int tileWidth, int tileHeight); +}; + +#endif \ No newline at end of file diff --git a/collision.cpp b/collision.cpp new file mode 100644 index 0000000..a655600 --- /dev/null +++ b/collision.cpp @@ -0,0 +1,46 @@ +#include + +bool checkCollision(SDL_Rect a, SDL_Rect b) +{ + // The sides of the rectangles + int leftA, leftB; + int rightA, rightB; + int topA, topB; + int bottomA, bottomB; + + // Calculate the sides of rect A + leftA = a.x; + rightA = a.x + a.w; + topA = a.y; + bottomA = a.y + a.h; + + // Calculate the sides of rect B + leftB = b.x; + rightB = b.x + b.w; + topB = b.y; + bottomB = b.y + b.h; + + // If any of the sides from A are outside of B + if (bottomA <= topB) + { + return false; + } + + if (topA >= bottomB) + { + return false; + } + + if (rightA <= leftB) + { + return false; + } + + if (leftA >= rightB) + { + return false; + } + + // If none of the sides from A are outside B + return true; +} diff --git a/collision.h b/collision.h new file mode 100644 index 0000000..9c8b506 --- /dev/null +++ b/collision.h @@ -0,0 +1,4 @@ +#include + +// Box collision detector +bool checkCollision(SDL_Rect a, SDL_Rect b); \ No newline at end of file diff --git a/dot.bmp b/dot.bmp new file mode 100644 index 0000000..16ed38d Binary files /dev/null and b/dot.bmp differ diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..10548ea --- /dev/null +++ b/main.cpp @@ -0,0 +1,231 @@ +#include +#include +#include +#include +#include +#include +#include + +#include "MyWindow.h" +#include "TileAtlas.h" +#include "rapidxml.hpp" +#include "Tile.h" +#include "Player.h" + +// Screen dimension constants +const int SCREEN_WIDTH = 720; +const int SCREEN_HEIGHT = 480; + +std::vector tiles; +std::vector dots; +SDL_Rect camera; + +LTexture dotTexture; +LTexture tilesTexture; + +bool initLibs(); +LWindow initWin(); +bool initObjs(LWindow &window); +bool setTiles(LTexture &tilesTexture, LWindow &window); +void cleanUpObjs(); + +bool initLibs() +{ + // Initialization flag + + // Initialize SDL + if (SDL_Init(SDL_INIT_VIDEO) < 0) + { + printf("SDL could not initialize! SDL Error: %s\n", SDL_GetError()); + return false; + } + + // Set texture filtering to linear + if (!SDL_SetHint(SDL_HINT_RENDER_SCALE_QUALITY, "1")) + { + printf("Warning: Linear texture filtering not enabled!"); + return false; + } + + int imgFlags = IMG_INIT_PNG; + if (!(IMG_Init(imgFlags) & imgFlags)) + { + printf("SDL_image could not initialize! SDL_image Error: %s\n", IMG_GetError()); + return false; + } + return true; +} + +LWindow initWin() +{ + // Create window + LWindow window; + if (!window.init(SCREEN_WIDTH, SCREEN_HEIGHT)) + { + printf("Window could not be created! SDL Error: %s\n", SDL_GetError()); + } + return window; +} + +bool initObjs(LWindow &window) +{ + if (!window.loadTexture(dotTexture, "dot.bmp")) + { + printf("Failed to load dot texture!\n"); + return false; + } + + Dot dot(dotTexture, window); + dots.push_back(dot); + + camera = {0, 0, SCREEN_WIDTH, SCREEN_HEIGHT}; + + if (!window.loadTexture(tilesTexture, "tiles2.png")) + { + printf("Failed to load tile set texture!\n"); + return false; + } + + // Load tile map + if (!setTiles(tilesTexture, window)) + { + printf("Failed to load tile set!\n"); + return false; + } + + int uniqueTilesX = tilesTexture.getWidth() / tiles[0].getBox().w; + int uniqueTilesY = tilesTexture.getHeight() / tiles[0].getBox().h; + + TileAtlas::init(uniqueTilesX, uniqueTilesY, tiles[0].getBox().w, tiles[0].getBox().h); + + return true; +} + +bool setTiles(LTexture &tilesTexture, LWindow &window) +{ + // Open the map + std::ifstream mapStream("map2.tmx"); + + // If the map couldn't be loaded + if (mapStream.fail()) + { + printf("Unable to load map file!\n"); + return false; + } + + std::stringstream buffer; + buffer << mapStream.rdbuf(); + + std::string xmlText = buffer.str(); + + rapidxml::xml_document<> doc; // character type defaults to char + doc.parse<0>(const_cast(xmlText.c_str())); + + rapidxml::xml_node<> *mapNode = doc.first_node("map"); + int tileWidth = std::stoi(mapNode->first_attribute("tilewidth")->value()); + int tileHeight = std::stoi(mapNode->first_attribute("tileheight")->value()); + + int numTilesX = std::stoi(mapNode->first_attribute("width")->value()); + int numTilesY = std::stoi(mapNode->first_attribute("height")->value()); + + std::string tilesData = mapNode->first_node("layer")->first_node("data")->value(); + int j = 0; + + // Initialize the tiles + for (int i = 0; i < numTilesX * numTilesY; ++i) + { + // Read tile from map file + std::string token; + while (j < tilesData.size() && tilesData[j] != ',') + { + token += tilesData[j]; + j++; + } + j++; + + int tileType = std::stoi(token); + + Tile myTile(tilesTexture, window, (i % numTilesX) * tileWidth, (i / numTilesX) * tileHeight, tileWidth, tileHeight, tileType); + tiles.push_back(myTile); + } + + // Close the file + mapStream.close(); + + window.setParams(numTilesX, numTilesY, tileWidth, tileHeight); + + // If the map was loaded fine + return true; +} + +void cleanUpObjs() +{ + // Free loaded images + dots[0].cleanUp(); + tiles[0].cleanUp(); +} + +int main(int argc, char *args[]) +{ + // Start up SDL and create window + initLibs(); + LWindow window = initWin(); + initObjs(window); + + std::vector renderables; + for (int i = 0; i < tiles.size(); i++) + { + renderables.push_back(&tiles[i]); + } + for (int i = 0; i < dots.size(); i++) + { + renderables.push_back(&dots[i]); + } + // Main loop flag + bool quit = false; + + // Event handler + SDL_Event e; + + // The dot that will be moving around on the screen + + // While application is running + while (!quit) + { + // Handle events on queue + while (SDL_PollEvent(&e) != 0) + { + // User requests quit + if (e.type == SDL_QUIT) + { + quit = true; + } + + window.handleEvent(e); + // Handle input for the dot + dots[0].handleEvent(e); + } + + // Move the dot + dots[0].move(); + dots[0].setCamera(camera); + + if (!window.isMinimized()) + { + // Dot *d = dynamic_cast(renderables[0]); + // std::cout << d->mTexture.getWidth() << std::endl; + + window.render(renderables, camera); + } + } + + // Free resources and close SDL + cleanUpObjs(); + window.cleanUp(); + + // Quit SDL subsystems + IMG_Quit(); + SDL_Quit(); + + return 0; +} \ No newline at end of file diff --git a/map.tmx b/map.tmx new file mode 100644 index 0000000..bfcc5a1 --- /dev/null +++ b/map.tmx @@ -0,0 +1,13 @@ + + + + + +3,4,3,4,1, +3,4,3,4,1, +3,4,3,4,1, +3,4,3,4,1, +3,4,3,4,1 + + + diff --git a/map2.tmx b/map2.tmx new file mode 100644 index 0000000..7291358 --- /dev/null +++ b/map2.tmx @@ -0,0 +1,108 @@ + + + + + +1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,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,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,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,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,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,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,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,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,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,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,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,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,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,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,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,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,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,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,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,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,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,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,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,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,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,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,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,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225, +1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,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,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,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,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,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,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,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,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,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,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,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,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,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,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,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,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,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,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,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,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,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,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,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,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,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,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,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,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225, +1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,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,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,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,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,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,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,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,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,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,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,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,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,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,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,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,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,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,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,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,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,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,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,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,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,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,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,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,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225, +1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,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,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,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,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,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,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,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,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,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,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,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,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,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,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,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,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,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,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,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,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,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,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,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,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,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,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,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,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225, +1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,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,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,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,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,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,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,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,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,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,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,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,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,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,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,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,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,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,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,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,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,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,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,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,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,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,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,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,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225, +1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,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,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,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,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,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,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,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,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,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,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,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,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,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,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,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,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,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,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,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,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,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,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,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,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,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,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,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,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225, +1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,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,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,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,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,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,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,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,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,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,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,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,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,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,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,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,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,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,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150 + + + diff --git a/newTileset.tsx b/newTileset.tsx new file mode 100644 index 0000000..a8b46ca --- /dev/null +++ b/newTileset.tsx @@ -0,0 +1,4 @@ + + + + diff --git a/rapidxml.hpp b/rapidxml.hpp new file mode 100644 index 0000000..ae91e08 --- /dev/null +++ b/rapidxml.hpp @@ -0,0 +1,2596 @@ +#ifndef RAPIDXML_HPP_INCLUDED +#define RAPIDXML_HPP_INCLUDED + +// Copyright (C) 2006, 2009 Marcin Kalicinski +// Version 1.13 +// Revision $DateTime: 2009/05/13 01:46:17 $ +//! \file rapidxml.hpp This file contains rapidxml parser and DOM implementation + +// If standard library is disabled, user must provide implementations of required functions and typedefs +#if !defined(RAPIDXML_NO_STDLIB) + #include // For std::size_t + #include // For assert + #include // For placement new +#endif + +// On MSVC, disable "conditional expression is constant" warning (level 4). +// This warning is almost impossible to avoid with certain types of templated code +#ifdef _MSC_VER + #pragma warning(push) + #pragma warning(disable:4127) // Conditional expression is constant +#endif + +/////////////////////////////////////////////////////////////////////////// +// RAPIDXML_PARSE_ERROR + +#if defined(RAPIDXML_NO_EXCEPTIONS) + +#define RAPIDXML_PARSE_ERROR(what, where) { parse_error_handler(what, where); assert(0); } + +namespace rapidxml +{ + //! When exceptions are disabled by defining RAPIDXML_NO_EXCEPTIONS, + //! this function is called to notify user about the error. + //! It must be defined by the user. + //!

+ //! This function cannot return. If it does, the results are undefined. + //!

+ //! A very simple definition might look like that: + //! 
+    //! void %rapidxml::%parse_error_handler(const char *what, void *where)
+    //! {
+    //!     std::cout << "Parse error: " << what << "\n";
+    //!     std::abort();
+    //! }
+    //!
+ //! \param what Human readable description of the error. + //! \param where Pointer to character data where error was detected. + void parse_error_handler(const char *what, void *where); +} + +#else + +#include // For std::exception + +#define RAPIDXML_PARSE_ERROR(what, where) throw parse_error(what, where) + +namespace rapidxml +{ + + //! Parse error exception. + //! This exception is thrown by the parser when an error occurs. + //! Use what() function to get human-readable error message. + //! Use where() function to get a pointer to position within source text where error was detected. + //!

+ //! If throwing exceptions by the parser is undesirable, + //! it can be disabled by defining RAPIDXML_NO_EXCEPTIONS macro before rapidxml.hpp is included. + //! This will cause the parser to call rapidxml::parse_error_handler() function instead of throwing an exception. + //! This function must be defined by the user. + //!

+ //! This class derives from std::exception class. + class parse_error: public std::exception + { + + public: + + //! Constructs parse error + parse_error(const char *what, void *where) + : m_what(what) + , m_where(where) + { + } + + //! Gets human readable description of error. + //! \return Pointer to null terminated description of the error. + virtual const char *what() const throw() + { + return m_what; + } + + //! Gets pointer to character data where error happened. + //! Ch should be the same as char type of xml_document that produced the error. + //! \return Pointer to location within the parsed string where error occured. + template + Ch *where() const + { + return reinterpret_cast(m_where); + } + + private: + + const char *m_what; + void *m_where; + + }; +} + +#endif + +/////////////////////////////////////////////////////////////////////////// +// Pool sizes + +#ifndef RAPIDXML_STATIC_POOL_SIZE + // Size of static memory block of memory_pool. + // Define RAPIDXML_STATIC_POOL_SIZE before including rapidxml.hpp if you want to override the default value. + // No dynamic memory allocations are performed by memory_pool until static memory is exhausted. + #define RAPIDXML_STATIC_POOL_SIZE (64 * 1024) +#endif + +#ifndef RAPIDXML_DYNAMIC_POOL_SIZE + // Size of dynamic memory block of memory_pool. + // Define RAPIDXML_DYNAMIC_POOL_SIZE before including rapidxml.hpp if you want to override the default value. + // After the static block is exhausted, dynamic blocks with approximately this size are allocated by memory_pool. + #define RAPIDXML_DYNAMIC_POOL_SIZE (64 * 1024) +#endif + +#ifndef RAPIDXML_ALIGNMENT + // Memory allocation alignment. + // Define RAPIDXML_ALIGNMENT before including rapidxml.hpp if you want to override the default value, which is the size of pointer. + // All memory allocations for nodes, attributes and strings will be aligned to this value. + // This must be a power of 2 and at least 1, otherwise memory_pool will not work. + #define RAPIDXML_ALIGNMENT sizeof(void *) +#endif + +namespace rapidxml +{ + // Forward declarations + template class xml_node; + template class xml_attribute; + template class xml_document; + + //! Enumeration listing all node types produced by the parser. + //! Use xml_node::type() function to query node type. + enum node_type + { + node_document, //!< A document node. Name and value are empty. + node_element, //!< An element node. Name contains element name. Value contains text of first data node. + node_data, //!< A data node. Name is empty. Value contains data text. + node_cdata, //!< A CDATA node. Name is empty. Value contains data text. + node_comment, //!< A comment node. Name is empty. Value contains comment text. + node_declaration, //!< A declaration node. Name and value are empty. Declaration parameters (version, encoding and standalone) are in node attributes. + node_doctype, //!< A DOCTYPE node. Name is empty. Value contains DOCTYPE text. + node_pi //!< A PI node. Name contains target. Value contains instructions. + }; + + /////////////////////////////////////////////////////////////////////// + // Parsing flags + + //! Parse flag instructing the parser to not create data nodes. + //! Text of first data node will still be placed in value of parent element, unless rapidxml::parse_no_element_values flag is also specified. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_no_data_nodes = 0x1; + + //! Parse flag instructing the parser to not use text of first data node as a value of parent element. + //! Can be combined with other flags by use of | operator. + //! Note that child data nodes of element node take precendence over its value when printing. + //! That is, if element has one or more child data nodes and a value, the value will be ignored. + //! Use rapidxml::parse_no_data_nodes flag to prevent creation of data nodes if you want to manipulate data using values of elements. + //!

+ //! See xml_document::parse() function. + const int parse_no_element_values = 0x2; + + //! Parse flag instructing the parser to not place zero terminators after strings in the source text. + //! By default zero terminators are placed, modifying source text. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_no_string_terminators = 0x4; + + //! Parse flag instructing the parser to not translate entities in the source text. + //! By default entities are translated, modifying source text. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_no_entity_translation = 0x8; + + //! Parse flag instructing the parser to disable UTF-8 handling and assume plain 8 bit characters. + //! By default, UTF-8 handling is enabled. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_no_utf8 = 0x10; + + //! Parse flag instructing the parser to create XML declaration node. + //! By default, declaration node is not created. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_declaration_node = 0x20; + + //! Parse flag instructing the parser to create comments nodes. + //! By default, comment nodes are not created. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_comment_nodes = 0x40; + + //! Parse flag instructing the parser to create DOCTYPE node. + //! By default, doctype node is not created. + //! Although W3C specification allows at most one DOCTYPE node, RapidXml will silently accept documents with more than one. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_doctype_node = 0x80; + + //! Parse flag instructing the parser to create PI nodes. + //! By default, PI nodes are not created. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_pi_nodes = 0x100; + + //! Parse flag instructing the parser to validate closing tag names. + //! If not set, name inside closing tag is irrelevant to the parser. + //! By default, closing tags are not validated. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_validate_closing_tags = 0x200; + + //! Parse flag instructing the parser to trim all leading and trailing whitespace of data nodes. + //! By default, whitespace is not trimmed. + //! This flag does not cause the parser to modify source text. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_trim_whitespace = 0x400; + + //! Parse flag instructing the parser to condense all whitespace runs of data nodes to a single space character. + //! Trimming of leading and trailing whitespace of data is controlled by rapidxml::parse_trim_whitespace flag. + //! By default, whitespace is not normalized. + //! If this flag is specified, source text will be modified. + //! Can be combined with other flags by use of | operator. + //!

+ //! See xml_document::parse() function. + const int parse_normalize_whitespace = 0x800; + + // Compound flags + + //! Parse flags which represent default behaviour of the parser. + //! This is always equal to 0, so that all other flags can be simply ored together. + //! Normally there is no need to inconveniently disable flags by anding with their negated (~) values. + //! This also means that meaning of each flag is a negation of the default setting. + //! For example, if flag name is rapidxml::parse_no_utf8, it means that utf-8 is enabled by default, + //! and using the flag will disable it. + //!

+ //! See xml_document::parse() function. + const int parse_default = 0; + + //! A combination of parse flags that forbids any modifications of the source text. + //! This also results in faster parsing. However, note that the following will occur: + //!
    + //!
  • names and values of nodes will not be zero terminated, you have to use xml_base::name_size() and xml_base::value_size() functions to determine where name and value ends
    • + //!
  • entities will not be translated
    • + //!
  • whitespace will not be normalized
    • + //!
+ //! See xml_document::parse() function. + const int parse_non_destructive = parse_no_string_terminators | parse_no_entity_translation; + + //! A combination of parse flags resulting in fastest possible parsing, without sacrificing important data. + //!

+ //! See xml_document::parse() function. + const int parse_fastest = parse_non_destructive | parse_no_data_nodes; + + //! A combination of parse flags resulting in largest amount of data being extracted. + //! This usually results in slowest parsing. + //!

+ //! See xml_document::parse() function. + const int parse_full = parse_declaration_node | parse_comment_nodes | parse_doctype_node | parse_pi_nodes | parse_validate_closing_tags; + + /////////////////////////////////////////////////////////////////////// + // Internals + + //! \cond internal + namespace internal + { + + // Struct that contains lookup tables for the parser + // It must be a template to allow correct linking (because it has static data members, which are defined in a header file). + template + struct lookup_tables + { + static const unsigned char lookup_whitespace[256]; // Whitespace table + static const unsigned char lookup_node_name[256]; // Node name table + static const unsigned char lookup_text[256]; // Text table + static const unsigned char lookup_text_pure_no_ws[256]; // Text table + static const unsigned char lookup_text_pure_with_ws[256]; // Text table + static const unsigned char lookup_attribute_name[256]; // Attribute name table + static const unsigned char lookup_attribute_data_1[256]; // Attribute data table with single quote + static const unsigned char lookup_attribute_data_1_pure[256]; // Attribute data table with single quote + static const unsigned char lookup_attribute_data_2[256]; // Attribute data table with double quotes + static const unsigned char lookup_attribute_data_2_pure[256]; // Attribute data table with double quotes + static const unsigned char lookup_digits[256]; // Digits + static const unsigned char lookup_upcase[256]; // To uppercase conversion table for ASCII characters + }; + + // Find length of the string + template + inline std::size_t measure(const Ch *p) + { + const Ch *tmp = p; + while (*tmp) + ++tmp; + return tmp - p; + } + + // Compare strings for equality + template + inline bool compare(const Ch *p1, std::size_t size1, const Ch *p2, std::size_t size2, bool case_sensitive) + { + if (size1 != size2) + return false; + if (case_sensitive) + { + for (const Ch *end = p1 + size1; p1 < end; ++p1, ++p2) + if (*p1 != *p2) + return false; + } + else + { + for (const Ch *end = p1 + size1; p1 < end; ++p1, ++p2) + if (lookup_tables<0>::lookup_upcase[static_cast(*p1)] != lookup_tables<0>::lookup_upcase[static_cast(*p2)]) + return false; + } + return true; + } + } + //! \endcond + + /////////////////////////////////////////////////////////////////////// + // Memory pool + + //! This class is used by the parser to create new nodes and attributes, without overheads of dynamic memory allocation. + //! In most cases, you will not need to use this class directly. + //! However, if you need to create nodes manually or modify names/values of nodes, + //! you are encouraged to use memory_pool of relevant xml_document to allocate the memory. + //! Not only is this faster than allocating them by using new operator, + //! but also their lifetime will be tied to the lifetime of document, + //! possibly simplyfing memory management. + //!

+ //! Call allocate_node() or allocate_attribute() functions to obtain new nodes or attributes from the pool. + //! You can also call allocate_string() function to allocate strings. + //! Such strings can then be used as names or values of nodes without worrying about their lifetime. + //! Note that there is no free() function -- all allocations are freed at once when clear() function is called, + //! or when the pool is destroyed. + //!

+ //! It is also possible to create a standalone memory_pool, and use it + //! to allocate nodes, whose lifetime will not be tied to any document. + //!

+ //! Pool maintains RAPIDXML_STATIC_POOL_SIZE bytes of statically allocated memory. + //! Until static memory is exhausted, no dynamic memory allocations are done. + //! When static memory is exhausted, pool allocates additional blocks of memory of size RAPIDXML_DYNAMIC_POOL_SIZE each, + //! by using global new[] and delete[] operators. + //! This behaviour can be changed by setting custom allocation routines. + //! Use set_allocator() function to set them. + //!

+ //! Allocations for nodes, attributes and strings are aligned at RAPIDXML_ALIGNMENT bytes. + //! This value defaults to the size of pointer on target architecture. + //!

+ //! To obtain absolutely top performance from the parser, + //! it is important that all nodes are allocated from a single, contiguous block of memory. + //! Otherwise, cache misses when jumping between two (or more) disjoint blocks of memory can slow down parsing quite considerably. + //! If required, you can tweak RAPIDXML_STATIC_POOL_SIZE, RAPIDXML_DYNAMIC_POOL_SIZE and RAPIDXML_ALIGNMENT + //! to obtain best wasted memory to performance compromise. + //! To do it, define their values before rapidxml.hpp file is included. + //! \param Ch Character type of created nodes. + template + class memory_pool + { + + public: + + //! \cond internal + typedef void *(alloc_func)(std::size_t); // Type of user-defined function used to allocate memory + typedef void (free_func)(void *); // Type of user-defined function used to free memory + //! \endcond + + //! Constructs empty pool with default allocator functions. + memory_pool() + : m_alloc_func(0) + , m_free_func(0) + { + init(); + } + + //! Destroys pool and frees all the memory. + //! This causes memory occupied by nodes allocated by the pool to be freed. + //! Nodes allocated from the pool are no longer valid. + ~memory_pool() + { + clear(); + } + + //! Allocates a new node from the pool, and optionally assigns name and value to it. + //! If the allocation request cannot be accomodated, this function will throw std::bad_alloc. + //! If exceptions are disabled by defining RAPIDXML_NO_EXCEPTIONS, this function + //! will call rapidxml::parse_error_handler() function. + //! \param type Type of node to create. + //! \param name Name to assign to the node, or 0 to assign no name. + //! \param value Value to assign to the node, or 0 to assign no value. + //! \param name_size Size of name to assign, or 0 to automatically calculate size from name string. + //! \param value_size Size of value to assign, or 0 to automatically calculate size from value string. + //! \return Pointer to allocated node. This pointer will never be NULL. + xml_node *allocate_node(node_type type, + const Ch *name = 0, const Ch *value = 0, + std::size_t name_size = 0, std::size_t value_size = 0) + { + void *memory = allocate_aligned(sizeof(xml_node)); + xml_node *node = new(memory) xml_node(type); + if (name) + { + if (name_size > 0) + node->name(name, name_size); + else + node->name(name); + } + if (value) + { + if (value_size > 0) + node->value(value, value_size); + else + node->value(value); + } + return node; + } + + //! Allocates a new attribute from the pool, and optionally assigns name and value to it. + //! If the allocation request cannot be accomodated, this function will throw std::bad_alloc. + //! If exceptions are disabled by defining RAPIDXML_NO_EXCEPTIONS, this function + //! will call rapidxml::parse_error_handler() function. + //! \param name Name to assign to the attribute, or 0 to assign no name. + //! \param value Value to assign to the attribute, or 0 to assign no value. + //! \param name_size Size of name to assign, or 0 to automatically calculate size from name string. + //! \param value_size Size of value to assign, or 0 to automatically calculate size from value string. + //! \return Pointer to allocated attribute. This pointer will never be NULL. + xml_attribute *allocate_attribute(const Ch *name = 0, const Ch *value = 0, + std::size_t name_size = 0, std::size_t value_size = 0) + { + void *memory = allocate_aligned(sizeof(xml_attribute)); + xml_attribute *attribute = new(memory) xml_attribute; + if (name) + { + if (name_size > 0) + attribute->name(name, name_size); + else + attribute->name(name); + } + if (value) + { + if (value_size > 0) + attribute->value(value, value_size); + else + attribute->value(value); + } + return attribute; + } + + //! Allocates a char array of given size from the pool, and optionally copies a given string to it. + //! If the allocation request cannot be accomodated, this function will throw std::bad_alloc. + //! If exceptions are disabled by defining RAPIDXML_NO_EXCEPTIONS, this function + //! will call rapidxml::parse_error_handler() function. + //! \param source String to initialize the allocated memory with, or 0 to not initialize it. + //! \param size Number of characters to allocate, or zero to calculate it automatically from source string length; if size is 0, source string must be specified and null terminated. + //! \return Pointer to allocated char array. This pointer will never be NULL. + Ch *allocate_string(const Ch *source = 0, std::size_t size = 0) + { + assert(source || size); // Either source or size (or both) must be specified + if (size == 0) + size = internal::measure(source) + 1; + Ch *result = static_cast(allocate_aligned(size * sizeof(Ch))); + if (source) + for (std::size_t i = 0; i < size; ++i) + result[i] = source[i]; + return result; + } + + //! Clones an xml_node and its hierarchy of child nodes and attributes. + //! Nodes and attributes are allocated from this memory pool. + //! Names and values are not cloned, they are shared between the clone and the source. + //! Result node can be optionally specified as a second parameter, + //! in which case its contents will be replaced with cloned source node. + //! This is useful when you want to clone entire document. + //! \param source Node to clone. + //! \param result Node to put results in, or 0 to automatically allocate result node + //! \return Pointer to cloned node. This pointer will never be NULL. + xml_node *clone_node(const xml_node *source, xml_node *result = 0) + { + // Prepare result node + if (result) + { + result->remove_all_attributes(); + result->remove_all_nodes(); + result->type(source->type()); + } + else + result = allocate_node(source->type()); + + // Clone name and value + result->name(source->name(), source->name_size()); + result->value(source->value(), source->value_size()); + + // Clone child nodes and attributes + for (xml_node *child = source->first_node(); child; child = child->next_sibling()) + result->append_node(clone_node(child)); + for (xml_attribute *attr = source->first_attribute(); attr; attr = attr->next_attribute()) + result->append_attribute(allocate_attribute(attr->name(), attr->value(), attr->name_size(), attr->value_size())); + + return result; + } + + //! Clears the pool. + //! This causes memory occupied by nodes allocated by the pool to be freed. + //! Any nodes or strings allocated from the pool will no longer be valid. + void clear() + { + while (m_begin != m_static_memory) + { + char *previous_begin = reinterpret_cast
(align(m_begin))->previous_begin; + if (m_free_func) + m_free_func(m_begin); + else + delete[] m_begin; + m_begin = previous_begin; + } + init(); + } + + //! Sets or resets the user-defined memory allocation functions for the pool. + //! This can only be called when no memory is allocated from the pool yet, otherwise results are undefined. + //! Allocation function must not return invalid pointer on failure. It should either throw, + //! stop the program, or use longjmp() function to pass control to other place of program. + //! If it returns invalid pointer, results are undefined. + //!

+ //! User defined allocation functions must have the following forms: + //!
+ //!
void *allocate(std::size_t size); + //!
void free(void *pointer); + //!
+ //! \param af Allocation function, or 0 to restore default function + //! \param ff Free function, or 0 to restore default function + void set_allocator(alloc_func *af, free_func *ff) + { + assert(m_begin == m_static_memory && m_ptr == align(m_begin)); // Verify that no memory is allocated yet + m_alloc_func = af; + m_free_func = ff; + } + + private: + + struct header + { + char *previous_begin; + }; + + void init() + { + m_begin = m_static_memory; + m_ptr = align(m_begin); + m_end = m_static_memory + sizeof(m_static_memory); + } + + char *align(char *ptr) + { + std::size_t alignment = ((RAPIDXML_ALIGNMENT - (std::size_t(ptr) & (RAPIDXML_ALIGNMENT - 1))) & (RAPIDXML_ALIGNMENT - 1)); + return ptr + alignment; + } + + char *allocate_raw(std::size_t size) + { + // Allocate + void *memory; + if (m_alloc_func) // Allocate memory using either user-specified allocation function or global operator new[] + { + memory = m_alloc_func(size); + assert(memory); // Allocator is not allowed to return 0, on failure it must either throw, stop the program or use longjmp + } + else + { + memory = new char[size]; +#ifdef RAPIDXML_NO_EXCEPTIONS + if (!memory) // If exceptions are disabled, verify memory allocation, because new will not be able to throw bad_alloc + RAPIDXML_PARSE_ERROR("out of memory", 0); +#endif + } + return static_cast(memory); + } + + void *allocate_aligned(std::size_t size) + { + // Calculate aligned pointer + char *result = align(m_ptr); + + // If not enough memory left in current pool, allocate a new pool + if (result + size > m_end) + { + // Calculate required pool size (may be bigger than RAPIDXML_DYNAMIC_POOL_SIZE) + std::size_t pool_size = RAPIDXML_DYNAMIC_POOL_SIZE; + if (pool_size < size) + pool_size = size; + + // Allocate + std::size_t alloc_size = sizeof(header) + (2 * RAPIDXML_ALIGNMENT - 2) + pool_size; // 2 alignments required in worst case: one for header, one for actual allocation + char *raw_memory = allocate_raw(alloc_size); + + // Setup new pool in allocated memory + char *pool = align(raw_memory); + header *new_header = reinterpret_cast
(pool); + new_header->previous_begin = m_begin; + m_begin = raw_memory; + m_ptr = pool + sizeof(header); + m_end = raw_memory + alloc_size; + + // Calculate aligned pointer again using new pool + result = align(m_ptr); + } + + // Update pool and return aligned pointer + m_ptr = result + size; + return result; + } + + char *m_begin; // Start of raw memory making up current pool + char *m_ptr; // First free byte in current pool + char *m_end; // One past last available byte in current pool + char m_static_memory[RAPIDXML_STATIC_POOL_SIZE]; // Static raw memory + alloc_func *m_alloc_func; // Allocator function, or 0 if default is to be used + free_func *m_free_func; // Free function, or 0 if default is to be used + }; + + /////////////////////////////////////////////////////////////////////////// + // XML base + + //! Base class for xml_node and xml_attribute implementing common functions: + //! name(), name_size(), value(), value_size() and parent(). + //! \param Ch Character type to use + template + class xml_base + { + + public: + + /////////////////////////////////////////////////////////////////////////// + // Construction & destruction + + // Construct a base with empty name, value and parent + xml_base() + : m_name(0) + , m_value(0) + , m_parent(0) + { + } + + /////////////////////////////////////////////////////////////////////////// + // Node data access + + //! Gets name of the node. + //! Interpretation of name depends on type of node. + //! Note that name will not be zero-terminated if rapidxml::parse_no_string_terminators option was selected during parse. + //!

+ //! Use name_size() function to determine length of the name. + //! \return Name of node, or empty string if node has no name. + Ch *name() const + { + return m_name ? m_name : nullstr(); + } + + //! Gets size of node name, not including terminator character. + //! This function works correctly irrespective of whether name is or is not zero terminated. + //! \return Size of node name, in characters. + std::size_t name_size() const + { + return m_name ? m_name_size : 0; + } + + //! Gets value of node. + //! Interpretation of value depends on type of node. + //! Note that value will not be zero-terminated if rapidxml::parse_no_string_terminators option was selected during parse. + //!

+ //! Use value_size() function to determine length of the value. + //! \return Value of node, or empty string if node has no value. + Ch *value() const + { + return m_value ? m_value : nullstr(); + } + + //! Gets size of node value, not including terminator character. + //! This function works correctly irrespective of whether value is or is not zero terminated. + //! \return Size of node value, in characters. + std::size_t value_size() const + { + return m_value ? m_value_size : 0; + } + + /////////////////////////////////////////////////////////////////////////// + // Node modification + + //! Sets name of node to a non zero-terminated string. + //! See \ref ownership_of_strings. + //!

+ //! Note that node does not own its name or value, it only stores a pointer to it. + //! It will not delete or otherwise free the pointer on destruction. + //! It is reponsibility of the user to properly manage lifetime of the string. + //! The easiest way to achieve it is to use memory_pool of the document to allocate the string - + //! on destruction of the document the string will be automatically freed. + //!

+ //! Size of name must be specified separately, because name does not have to be zero terminated. + //! Use name(const Ch *) function to have the length automatically calculated (string must be zero terminated). + //! \param name Name of node to set. Does not have to be zero terminated. + //! \param size Size of name, in characters. This does not include zero terminator, if one is present. + void name(const Ch *name, std::size_t size) + { + m_name = const_cast(name); + m_name_size = size; + } + + //! Sets name of node to a zero-terminated string. + //! See also \ref ownership_of_strings and xml_node::name(const Ch *, std::size_t). + //! \param name Name of node to set. Must be zero terminated. + void name(const Ch *name) + { + this->name(name, internal::measure(name)); + } + + //! Sets value of node to a non zero-terminated string. + //! See \ref ownership_of_strings. + //!

+ //! Note that node does not own its name or value, it only stores a pointer to it. + //! It will not delete or otherwise free the pointer on destruction. + //! It is reponsibility of the user to properly manage lifetime of the string. + //! The easiest way to achieve it is to use memory_pool of the document to allocate the string - + //! on destruction of the document the string will be automatically freed. + //!

+ //! Size of value must be specified separately, because it does not have to be zero terminated. + //! Use value(const Ch *) function to have the length automatically calculated (string must be zero terminated). + //!

+ //! If an element has a child node of type node_data, it will take precedence over element value when printing. + //! If you want to manipulate data of elements using values, use parser flag rapidxml::parse_no_data_nodes to prevent creation of data nodes by the parser. + //! \param value value of node to set. Does not have to be zero terminated. + //! \param size Size of value, in characters. This does not include zero terminator, if one is present. + void value(const Ch *value, std::size_t size) + { + m_value = const_cast(value); + m_value_size = size; + } + + //! Sets value of node to a zero-terminated string. + //! See also \ref ownership_of_strings and xml_node::value(const Ch *, std::size_t). + //! \param value Vame of node to set. Must be zero terminated. + void value(const Ch *value) + { + this->value(value, internal::measure(value)); + } + + /////////////////////////////////////////////////////////////////////////// + // Related nodes access + + //! Gets node parent. + //! \return Pointer to parent node, or 0 if there is no parent. + xml_node *parent() const + { + return m_parent; + } + + protected: + + // Return empty string + static Ch *nullstr() + { + static Ch zero = Ch('\0'); + return &zero; + } + + Ch *m_name; // Name of node, or 0 if no name + Ch *m_value; // Value of node, or 0 if no value + std::size_t m_name_size; // Length of node name, or undefined of no name + std::size_t m_value_size; // Length of node value, or undefined if no value + xml_node *m_parent; // Pointer to parent node, or 0 if none + + }; + + //! Class representing attribute node of XML document. + //! Each attribute has name and value strings, which are available through name() and value() functions (inherited from xml_base). + //! Note that after parse, both name and value of attribute will point to interior of source text used for parsing. + //! Thus, this text must persist in memory for the lifetime of attribute. + //! \param Ch Character type to use. + template + class xml_attribute: public xml_base + { + + friend class xml_node; + + public: + + /////////////////////////////////////////////////////////////////////////// + // Construction & destruction + + //! Constructs an empty attribute with the specified type. + //! Consider using memory_pool of appropriate xml_document if allocating attributes manually. + xml_attribute() + { + } + + /////////////////////////////////////////////////////////////////////////// + // Related nodes access + + //! Gets document of which attribute is a child. + //! \return Pointer to document that contains this attribute, or 0 if there is no parent document. + xml_document *document() const + { + if (xml_node *node = this->parent()) + { + while (node->parent()) + node = node->parent(); + return node->type() == node_document ? static_cast *>(node) : 0; + } + else + return 0; + } + + //! Gets previous attribute, optionally matching attribute name. + //! \param name Name of attribute to find, or 0 to return previous attribute regardless of its name; this string doesn't have to be zero-terminated if name_size is non-zero + //! \param name_size Size of name, in characters, or 0 to have size calculated automatically from string + //! \param case_sensitive Should name comparison be case-sensitive; non case-sensitive comparison works properly only for ASCII characters + //! \return Pointer to found attribute, or 0 if not found. + xml_attribute *previous_attribute(const Ch *name = 0, std::size_t name_size = 0, bool case_sensitive = true) const + { + if (name) + { + if (name_size == 0) + name_size = internal::measure(name); + for (xml_attribute *attribute = m_prev_attribute; attribute; attribute = attribute->m_prev_attribute) + if (internal::compare(attribute->name(), attribute->name_size(), name, name_size, case_sensitive)) + return attribute; + return 0; + } + else + return this->m_parent ? m_prev_attribute : 0; + } + + //! Gets next attribute, optionally matching attribute name. + //! \param name Name of attribute to find, or 0 to return next attribute regardless of its name; this string doesn't have to be zero-terminated if name_size is non-zero + //! \param name_size Size of name, in characters, or 0 to have size calculated automatically from string + //! \param case_sensitive Should name comparison be case-sensitive; non case-sensitive comparison works properly only for ASCII characters + //! \return Pointer to found attribute, or 0 if not found. + xml_attribute *next_attribute(const Ch *name = 0, std::size_t name_size = 0, bool case_sensitive = true) const + { + if (name) + { + if (name_size == 0) + name_size = internal::measure(name); + for (xml_attribute *attribute = m_next_attribute; attribute; attribute = attribute->m_next_attribute) + if (internal::compare(attribute->name(), attribute->name_size(), name, name_size, case_sensitive)) + return attribute; + return 0; + } + else + return this->m_parent ? m_next_attribute : 0; + } + + private: + + xml_attribute *m_prev_attribute; // Pointer to previous sibling of attribute, or 0 if none; only valid if parent is non-zero + xml_attribute *m_next_attribute; // Pointer to next sibling of attribute, or 0 if none; only valid if parent is non-zero + + }; + + /////////////////////////////////////////////////////////////////////////// + // XML node + + //! Class representing a node of XML document. + //! Each node may have associated name and value strings, which are available through name() and value() functions. + //! Interpretation of name and value depends on type of the node. + //! Type of node can be determined by using type() function. + //!

+ //! Note that after parse, both name and value of node, if any, will point interior of source text used for parsing. + //! Thus, this text must persist in the memory for the lifetime of node. + //! \param Ch Character type to use. + template + class xml_node: public xml_base + { + + public: + + /////////////////////////////////////////////////////////////////////////// + // Construction & destruction + + //! Constructs an empty node with the specified type. + //! Consider using memory_pool of appropriate document to allocate nodes manually. + //! \param type Type of node to construct. + xml_node(node_type type) + : m_type(type) + , m_first_node(0) + , m_first_attribute(0) + { + } + + /////////////////////////////////////////////////////////////////////////// + // Node data access + + //! Gets type of node. + //! \return Type of node. + node_type type() const + { + return m_type; + } + + /////////////////////////////////////////////////////////////////////////// + // Related nodes access + + //! Gets document of which node is a child. + //! \return Pointer to document that contains this node, or 0 if there is no parent document. + xml_document *document() const + { + xml_node *node = const_cast *>(this); + while (node->parent()) + node = node->parent(); + return node->type() == node_document ? static_cast *>(node) : 0; + } + + //! Gets first child node, optionally matching node name. + //! \param name Name of child to find, or 0 to return first child regardless of its name; this string doesn't have to be zero-terminated if name_size is non-zero + //! \param name_size Size of name, in characters, or 0 to have size calculated automatically from string + //! \param case_sensitive Should name comparison be case-sensitive; non case-sensitive comparison works properly only for ASCII characters + //! \return Pointer to found child, or 0 if not found. + xml_node *first_node(const Ch *name = 0, std::size_t name_size = 0, bool case_sensitive = true) const + { + if (name) + { + if (name_size == 0) + name_size = internal::measure(name); + for (xml_node *child = m_first_node; child; child = child->next_sibling()) + if (internal::compare(child->name(), child->name_size(), name, name_size, case_sensitive)) + return child; + return 0; + } + else + return m_first_node; + } + + //! Gets last child node, optionally matching node name. + //! Behaviour is undefined if node has no children. + //! Use first_node() to test if node has children. + //! \param name Name of child to find, or 0 to return last child regardless of its name; this string doesn't have to be zero-terminated if name_size is non-zero + //! \param name_size Size of name, in characters, or 0 to have size calculated automatically from string + //! \param case_sensitive Should name comparison be case-sensitive; non case-sensitive comparison works properly only for ASCII characters + //! \return Pointer to found child, or 0 if not found. + xml_node *last_node(const Ch *name = 0, std::size_t name_size = 0, bool case_sensitive = true) const + { + assert(m_first_node); // Cannot query for last child if node has no children + if (name) + { + if (name_size == 0) + name_size = internal::measure(name); + for (xml_node *child = m_last_node; child; child = child->previous_sibling()) + if (internal::compare(child->name(), child->name_size(), name, name_size, case_sensitive)) + return child; + return 0; + } + else + return m_last_node; + } + + //! Gets previous sibling node, optionally matching node name. + //! Behaviour is undefined if node has no parent. + //! Use parent() to test if node has a parent. + //! \param name Name of sibling to find, or 0 to return previous sibling regardless of its name; this string doesn't have to be zero-terminated if name_size is non-zero + //! \param name_size Size of name, in characters, or 0 to have size calculated automatically from string + //! \param case_sensitive Should name comparison be case-sensitive; non case-sensitive comparison works properly only for ASCII characters + //! \return Pointer to found sibling, or 0 if not found. + xml_node *previous_sibling(const Ch *name = 0, std::size_t name_size = 0, bool case_sensitive = true) const + { + assert(this->m_parent); // Cannot query for siblings if node has no parent + if (name) + { + if (name_size == 0) + name_size = internal::measure(name); + for (xml_node *sibling = m_prev_sibling; sibling; sibling = sibling->m_prev_sibling) + if (internal::compare(sibling->name(), sibling->name_size(), name, name_size, case_sensitive)) + return sibling; + return 0; + } + else + return m_prev_sibling; + } + + //! Gets next sibling node, optionally matching node name. + //! Behaviour is undefined if node has no parent. + //! Use parent() to test if node has a parent. + //! \param name Name of sibling to find, or 0 to return next sibling regardless of its name; this string doesn't have to be zero-terminated if name_size is non-zero + //! \param name_size Size of name, in characters, or 0 to have size calculated automatically from string + //! \param case_sensitive Should name comparison be case-sensitive; non case-sensitive comparison works properly only for ASCII characters + //! \return Pointer to found sibling, or 0 if not found. + xml_node *next_sibling(const Ch *name = 0, std::size_t name_size = 0, bool case_sensitive = true) const + { + assert(this->m_parent); // Cannot query for siblings if node has no parent + if (name) + { + if (name_size == 0) + name_size = internal::measure(name); + for (xml_node *sibling = m_next_sibling; sibling; sibling = sibling->m_next_sibling) + if (internal::compare(sibling->name(), sibling->name_size(), name, name_size, case_sensitive)) + return sibling; + return 0; + } + else + return m_next_sibling; + } + + //! Gets first attribute of node, optionally matching attribute name. + //! \param name Name of attribute to find, or 0 to return first attribute regardless of its name; this string doesn't have to be zero-terminated if name_size is non-zero + //! \param name_size Size of name, in characters, or 0 to have size calculated automatically from string + //! \param case_sensitive Should name comparison be case-sensitive; non case-sensitive comparison works properly only for ASCII characters + //! \return Pointer to found attribute, or 0 if not found. + xml_attribute *first_attribute(const Ch *name = 0, std::size_t name_size = 0, bool case_sensitive = true) const + { + if (name) + { + if (name_size == 0) + name_size = internal::measure(name); + for (xml_attribute *attribute = m_first_attribute; attribute; attribute = attribute->m_next_attribute) + if (internal::compare(attribute->name(), attribute->name_size(), name, name_size, case_sensitive)) + return attribute; + return 0; + } + else + return m_first_attribute; + } + + //! Gets last attribute of node, optionally matching attribute name. + //! \param name Name of attribute to find, or 0 to return last attribute regardless of its name; this string doesn't have to be zero-terminated if name_size is non-zero + //! \param name_size Size of name, in characters, or 0 to have size calculated automatically from string + //! \param case_sensitive Should name comparison be case-sensitive; non case-sensitive comparison works properly only for ASCII characters + //! \return Pointer to found attribute, or 0 if not found. + xml_attribute *last_attribute(const Ch *name = 0, std::size_t name_size = 0, bool case_sensitive = true) const + { + if (name) + { + if (name_size == 0) + name_size = internal::measure(name); + for (xml_attribute *attribute = m_last_attribute; attribute; attribute = attribute->m_prev_attribute) + if (internal::compare(attribute->name(), attribute->name_size(), name, name_size, case_sensitive)) + return attribute; + return 0; + } + else + return m_first_attribute ? m_last_attribute : 0; + } + + /////////////////////////////////////////////////////////////////////////// + // Node modification + + //! Sets type of node. + //! \param type Type of node to set. + void type(node_type type) + { + m_type = type; + } + + /////////////////////////////////////////////////////////////////////////// + // Node manipulation + + //! Prepends a new child node. + //! The prepended child becomes the first child, and all existing children are moved one position back. + //! \param child Node to prepend. + void prepend_node(xml_node *child) + { + assert(child && !child->parent() && child->type() != node_document); + if (first_node()) + { + child->m_next_sibling = m_first_node; + m_first_node->m_prev_sibling = child; + } + else + { + child->m_next_sibling = 0; + m_last_node = child; + } + m_first_node = child; + child->m_parent = this; + child->m_prev_sibling = 0; + } + + //! Appends a new child node. + //! The appended child becomes the last child. + //! \param child Node to append. + void append_node(xml_node *child) + { + assert(child && !child->parent() && child->type() != node_document); + if (first_node()) + { + child->m_prev_sibling = m_last_node; + m_last_node->m_next_sibling = child; + } + else + { + child->m_prev_sibling = 0; + m_first_node = child; + } + m_last_node = child; + child->m_parent = this; + child->m_next_sibling = 0; + } + + //! Inserts a new child node at specified place inside the node. + //! All children after and including the specified node are moved one position back. + //! \param where Place where to insert the child, or 0 to insert at the back. + //! \param child Node to insert. + void insert_node(xml_node *where, xml_node *child) + { + assert(!where || where->parent() == this); + assert(child && !child->parent() && child->type() != node_document); + if (where == m_first_node) + prepend_node(child); + else if (where == 0) + append_node(child); + else + { + child->m_prev_sibling = where->m_prev_sibling; + child->m_next_sibling = where; + where->m_prev_sibling->m_next_sibling = child; + where->m_prev_sibling = child; + child->m_parent = this; + } + } + + //! Removes first child node. + //! If node has no children, behaviour is undefined. + //! Use first_node() to test if node has children. + void remove_first_node() + { + assert(first_node()); + xml_node *child = m_first_node; + m_first_node = child->m_next_sibling; + if (child->m_next_sibling) + child->m_next_sibling->m_prev_sibling = 0; + else + m_last_node = 0; + child->m_parent = 0; + } + + //! Removes last child of the node. + //! If node has no children, behaviour is undefined. + //! Use first_node() to test if node has children. + void remove_last_node() + { + assert(first_node()); + xml_node *child = m_last_node; + if (child->m_prev_sibling) + { + m_last_node = child->m_prev_sibling; + child->m_prev_sibling->m_next_sibling = 0; + } + else + m_first_node = 0; + child->m_parent = 0; + } + + //! Removes specified child from the node + // \param where Pointer to child to be removed. + void remove_node(xml_node *where) + { + assert(where && where->parent() == this); + assert(first_node()); + if (where == m_first_node) + remove_first_node(); + else if (where == m_last_node) + remove_last_node(); + else + { + where->m_prev_sibling->m_next_sibling = where->m_next_sibling; + where->m_next_sibling->m_prev_sibling = where->m_prev_sibling; + where->m_parent = 0; + } + } + + //! Removes all child nodes (but not attributes). + void remove_all_nodes() + { + for (xml_node *node = first_node(); node; node = node->m_next_sibling) + node->m_parent = 0; + m_first_node = 0; + } + + //! Prepends a new attribute to the node. + //! \param attribute Attribute to prepend. + void prepend_attribute(xml_attribute *attribute) + { + assert(attribute && !attribute->parent()); + if (first_attribute()) + { + attribute->m_next_attribute = m_first_attribute; + m_first_attribute->m_prev_attribute = attribute; + } + else + { + attribute->m_next_attribute = 0; + m_last_attribute = attribute; + } + m_first_attribute = attribute; + attribute->m_parent = this; + attribute->m_prev_attribute = 0; + } + + //! Appends a new attribute to the node. + //! \param attribute Attribute to append. + void append_attribute(xml_attribute *attribute) + { + assert(attribute && !attribute->parent()); + if (first_attribute()) + { + attribute->m_prev_attribute = m_last_attribute; + m_last_attribute->m_next_attribute = attribute; + } + else + { + attribute->m_prev_attribute = 0; + m_first_attribute = attribute; + } + m_last_attribute = attribute; + attribute->m_parent = this; + attribute->m_next_attribute = 0; + } + + //! Inserts a new attribute at specified place inside the node. + //! All attributes after and including the specified attribute are moved one position back. + //! \param where Place where to insert the attribute, or 0 to insert at the back. + //! \param attribute Attribute to insert. + void insert_attribute(xml_attribute *where, xml_attribute *attribute) + { + assert(!where || where->parent() == this); + assert(attribute && !attribute->parent()); + if (where == m_first_attribute) + prepend_attribute(attribute); + else if (where == 0) + append_attribute(attribute); + else + { + attribute->m_prev_attribute = where->m_prev_attribute; + attribute->m_next_attribute = where; + where->m_prev_attribute->m_next_attribute = attribute; + where->m_prev_attribute = attribute; + attribute->m_parent = this; + } + } + + //! Removes first attribute of the node. + //! If node has no attributes, behaviour is undefined. + //! Use first_attribute() to test if node has attributes. + void remove_first_attribute() + { + assert(first_attribute()); + xml_attribute *attribute = m_first_attribute; + if (attribute->m_next_attribute) + { + attribute->m_next_attribute->m_prev_attribute = 0; + } + else + m_last_attribute = 0; + attribute->m_parent = 0; + m_first_attribute = attribute->m_next_attribute; + } + + //! Removes last attribute of the node. + //! If node has no attributes, behaviour is undefined. + //! Use first_attribute() to test if node has attributes. + void remove_last_attribute() + { + assert(first_attribute()); + xml_attribute *attribute = m_last_attribute; + if (attribute->m_prev_attribute) + { + attribute->m_prev_attribute->m_next_attribute = 0; + m_last_attribute = attribute->m_prev_attribute; + } + else + m_first_attribute = 0; + attribute->m_parent = 0; + } + + //! Removes specified attribute from node. + //! \param where Pointer to attribute to be removed. + void remove_attribute(xml_attribute *where) + { + assert(first_attribute() && where->parent() == this); + if (where == m_first_attribute) + remove_first_attribute(); + else if (where == m_last_attribute) + remove_last_attribute(); + else + { + where->m_prev_attribute->m_next_attribute = where->m_next_attribute; + where->m_next_attribute->m_prev_attribute = where->m_prev_attribute; + where->m_parent = 0; + } + } + + //! Removes all attributes of node. + void remove_all_attributes() + { + for (xml_attribute *attribute = first_attribute(); attribute; attribute = attribute->m_next_attribute) + attribute->m_parent = 0; + m_first_attribute = 0; + } + + private: + + /////////////////////////////////////////////////////////////////////////// + // Restrictions + + // No copying + xml_node(const xml_node &); + void operator =(const xml_node &); + + /////////////////////////////////////////////////////////////////////////// + // Data members + + // Note that some of the pointers below have UNDEFINED values if certain other pointers are 0. + // This is required for maximum performance, as it allows the parser to omit initialization of + // unneded/redundant values. + // + // The rules are as follows: + // 1. first_node and first_attribute contain valid pointers, or 0 if node has no children/attributes respectively + // 2. last_node and last_attribute are valid only if node has at least one child/attribute respectively, otherwise they contain garbage + // 3. prev_sibling and next_sibling are valid only if node has a parent, otherwise they contain garbage + + node_type m_type; // Type of node; always valid + xml_node *m_first_node; // Pointer to first child node, or 0 if none; always valid + xml_node *m_last_node; // Pointer to last child node, or 0 if none; this value is only valid if m_first_node is non-zero + xml_attribute *m_first_attribute; // Pointer to first attribute of node, or 0 if none; always valid + xml_attribute *m_last_attribute; // Pointer to last attribute of node, or 0 if none; this value is only valid if m_first_attribute is non-zero + xml_node *m_prev_sibling; // Pointer to previous sibling of node, or 0 if none; this value is only valid if m_parent is non-zero + xml_node *m_next_sibling; // Pointer to next sibling of node, or 0 if none; this value is only valid if m_parent is non-zero + + }; + + /////////////////////////////////////////////////////////////////////////// + // XML document + + //! This class represents root of the DOM hierarchy. + //! It is also an xml_node and a memory_pool through public inheritance. + //! Use parse() function to build a DOM tree from a zero-terminated XML text string. + //! parse() function allocates memory for nodes and attributes by using functions of xml_document, + //! which are inherited from memory_pool. + //! To access root node of the document, use the document itself, as if it was an xml_node. + //! \param Ch Character type to use. + template + class xml_document: public xml_node, public memory_pool + { + + public: + + //! Constructs empty XML document + xml_document() + : xml_node(node_document) + { + } + + //! Parses zero-terminated XML string according to given flags. + //! Passed string will be modified by the parser, unless rapidxml::parse_non_destructive flag is used. + //! The string must persist for the lifetime of the document. + //! In case of error, rapidxml::parse_error exception will be thrown. + //!

+ //! If you want to parse contents of a file, you must first load the file into the memory, and pass pointer to its beginning. + //! Make sure that data is zero-terminated. + //!

+ //! Document can be parsed into multiple times. + //! Each new call to parse removes previous nodes and attributes (if any), but does not clear memory pool. + //! \param text XML data to parse; pointer is non-const to denote fact that this data may be modified by the parser. + template + void parse(Ch *text) + { + assert(text); + + // Remove current contents + this->remove_all_nodes(); + this->remove_all_attributes(); + + // Parse BOM, if any + parse_bom(text); + + // Parse children + while (1) + { + // Skip whitespace before node + skip(text); + if (*text == 0) + break; + + // Parse and append new child + if (*text == Ch('<')) + { + ++text; // Skip '<' + if (xml_node *node = parse_node(text)) + this->append_node(node); + } + else + RAPIDXML_PARSE_ERROR("expected <", text); + } + + } + + //! Clears the document by deleting all nodes and clearing the memory pool. + //! All nodes owned by document pool are destroyed. + void clear() + { + this->remove_all_nodes(); + this->remove_all_attributes(); + memory_pool::clear(); + } + + private: + + /////////////////////////////////////////////////////////////////////// + // Internal character utility functions + + // Detect whitespace character + struct whitespace_pred + { + static unsigned char test(Ch ch) + { + return internal::lookup_tables<0>::lookup_whitespace[static_cast(ch)]; + } + }; + + // Detect node name character + struct node_name_pred + { + static unsigned char test(Ch ch) + { + return internal::lookup_tables<0>::lookup_node_name[static_cast(ch)]; + } + }; + + // Detect attribute name character + struct attribute_name_pred + { + static unsigned char test(Ch ch) + { + return internal::lookup_tables<0>::lookup_attribute_name[static_cast(ch)]; + } + }; + + // Detect text character (PCDATA) + struct text_pred + { + static unsigned char test(Ch ch) + { + return internal::lookup_tables<0>::lookup_text[static_cast(ch)]; + } + }; + + // Detect text character (PCDATA) that does not require processing + struct text_pure_no_ws_pred + { + static unsigned char test(Ch ch) + { + return internal::lookup_tables<0>::lookup_text_pure_no_ws[static_cast(ch)]; + } + }; + + // Detect text character (PCDATA) that does not require processing + struct text_pure_with_ws_pred + { + static unsigned char test(Ch ch) + { + return internal::lookup_tables<0>::lookup_text_pure_with_ws[static_cast(ch)]; + } + }; + + // Detect attribute value character + template + struct attribute_value_pred + { + static unsigned char test(Ch ch) + { + if (Quote == Ch('\'')) + return internal::lookup_tables<0>::lookup_attribute_data_1[static_cast(ch)]; + if (Quote == Ch('\"')) + return internal::lookup_tables<0>::lookup_attribute_data_2[static_cast(ch)]; + return 0; // Should never be executed, to avoid warnings on Comeau + } + }; + + // Detect attribute value character + template + struct attribute_value_pure_pred + { + static unsigned char test(Ch ch) + { + if (Quote == Ch('\'')) + return internal::lookup_tables<0>::lookup_attribute_data_1_pure[static_cast(ch)]; + if (Quote == Ch('\"')) + return internal::lookup_tables<0>::lookup_attribute_data_2_pure[static_cast(ch)]; + return 0; // Should never be executed, to avoid warnings on Comeau + } + }; + + // Insert coded character, using UTF8 or 8-bit ASCII + template + static void insert_coded_character(Ch *&text, unsigned long code) + { + if (Flags & parse_no_utf8) + { + // Insert 8-bit ASCII character + // Todo: possibly verify that code is less than 256 and use replacement char otherwise? + text[0] = static_cast(code); + text += 1; + } + else + { + // Insert UTF8 sequence + if (code < 0x80) // 1 byte sequence + { + text[0] = static_cast(code); + text += 1; + } + else if (code < 0x800) // 2 byte sequence + { + text[1] = static_cast((code | 0x80) & 0xBF); code >>= 6; + text[0] = static_cast(code | 0xC0); + text += 2; + } + else if (code < 0x10000) // 3 byte sequence + { + text[2] = static_cast((code | 0x80) & 0xBF); code >>= 6; + text[1] = static_cast((code | 0x80) & 0xBF); code >>= 6; + text[0] = static_cast(code | 0xE0); + text += 3; + } + else if (code < 0x110000) // 4 byte sequence + { + text[3] = static_cast((code | 0x80) & 0xBF); code >>= 6; + text[2] = static_cast((code | 0x80) & 0xBF); code >>= 6; + text[1] = static_cast((code | 0x80) & 0xBF); code >>= 6; + text[0] = static_cast(code | 0xF0); + text += 4; + } + else // Invalid, only codes up to 0x10FFFF are allowed in Unicode + { + RAPIDXML_PARSE_ERROR("invalid numeric character entity", text); + } + } + } + + // Skip characters until predicate evaluates to true + template + static void skip(Ch *&text) + { + Ch *tmp = text; + while (StopPred::test(*tmp)) + ++tmp; + text = tmp; + } + + // Skip characters until predicate evaluates to true while doing the following: + // - replacing XML character entity references with proper characters (' & " < > &#...;) + // - condensing whitespace sequences to single space character + template + static Ch *skip_and_expand_character_refs(Ch *&text) + { + // If entity translation, whitespace condense and whitespace trimming is disabled, use plain skip + if (Flags & parse_no_entity_translation && + !(Flags & parse_normalize_whitespace) && + !(Flags & parse_trim_whitespace)) + { + skip(text); + return text; + } + + // Use simple skip until first modification is detected + skip(text); + + // Use translation skip + Ch *src = text; + Ch *dest = src; + while (StopPred::test(*src)) + { + // If entity translation is enabled + if (!(Flags & parse_no_entity_translation)) + { + // Test if replacement is needed + if (src[0] == Ch('&')) + { + switch (src[1]) + { + + // & ' + case Ch('a'): + if (src[2] == Ch('m') && src[3] == Ch('p') && src[4] == Ch(';')) + { + *dest = Ch('&'); + ++dest; + src += 5; + continue; + } + if (src[2] == Ch('p') && src[3] == Ch('o') && src[4] == Ch('s') && src[5] == Ch(';')) + { + *dest = Ch('\''); + ++dest; + src += 6; + continue; + } + break; + + // " + case Ch('q'): + if (src[2] == Ch('u') && src[3] == Ch('o') && src[4] == Ch('t') && src[5] == Ch(';')) + { + *dest = Ch('"'); + ++dest; + src += 6; + continue; + } + break; + + // > + case Ch('g'): + if (src[2] == Ch('t') && src[3] == Ch(';')) + { + *dest = Ch('>'); + ++dest; + src += 4; + continue; + } + break; + + // < + case Ch('l'): + if (src[2] == Ch('t') && src[3] == Ch(';')) + { + *dest = Ch('<'); + ++dest; + src += 4; + continue; + } + break; + + // &#...; - assumes ASCII + case Ch('#'): + if (src[2] == Ch('x')) + { + unsigned long code = 0; + src += 3; // Skip &#x + while (1) + { + unsigned char digit = internal::lookup_tables<0>::lookup_digits[static_cast(*src)]; + if (digit == 0xFF) + break; + code = code * 16 + digit; + ++src; + } + insert_coded_character(dest, code); // Put character in output + } + else + { + unsigned long code = 0; + src += 2; // Skip &# + while (1) + { + unsigned char digit = internal::lookup_tables<0>::lookup_digits[static_cast(*src)]; + if (digit == 0xFF) + break; + code = code * 10 + digit; + ++src; + } + insert_coded_character(dest, code); // Put character in output + } + if (*src == Ch(';')) + ++src; + else + RAPIDXML_PARSE_ERROR("expected ;", src); + continue; + + // Something else + default: + // Ignore, just copy '&' verbatim + break; + + } + } + } + + // If whitespace condensing is enabled + if (Flags & parse_normalize_whitespace) + { + // Test if condensing is needed + if (whitespace_pred::test(*src)) + { + *dest = Ch(' '); ++dest; // Put single space in dest + ++src; // Skip first whitespace char + // Skip remaining whitespace chars + while (whitespace_pred::test(*src)) + ++src; + continue; + } + } + + // No replacement, only copy character + *dest++ = *src++; + + } + + // Return new end + text = src; + return dest; + + } + + /////////////////////////////////////////////////////////////////////// + // Internal parsing functions + + // Parse BOM, if any + template + void parse_bom(Ch *&text) + { + // UTF-8? + if (static_cast(text[0]) == 0xEF && + static_cast(text[1]) == 0xBB && + static_cast(text[2]) == 0xBF) + { + text += 3; // Skup utf-8 bom + } + } + + // Parse XML declaration ( + xml_node *parse_xml_declaration(Ch *&text) + { + // If parsing of declaration is disabled + if (!(Flags & parse_declaration_node)) + { + // Skip until end of declaration + while (text[0] != Ch('?') || text[1] != Ch('>')) + { + if (!text[0]) + RAPIDXML_PARSE_ERROR("unexpected end of data", text); + ++text; + } + text += 2; // Skip '?>' + return 0; + } + + // Create declaration + xml_node *declaration = this->allocate_node(node_declaration); + + // Skip whitespace before attributes or ?> + skip(text); + + // Parse declaration attributes + parse_node_attributes(text, declaration); + + // Skip ?> + if (text[0] != Ch('?') || text[1] != Ch('>')) + RAPIDXML_PARSE_ERROR("expected ?>", text); + text += 2; + + return declaration; + } + + // Parse XML comment (' + return 0; // Do not produce comment node + } + + // Remember value start + Ch *value = text; + + // Skip until end of comment + while (text[0] != Ch('-') || text[1] != Ch('-') || text[2] != Ch('>')) + { + if (!text[0]) + RAPIDXML_PARSE_ERROR("unexpected end of data", text); + ++text; + } + + // Create comment node + xml_node *comment = this->allocate_node(node_comment); + comment->value(value, text - value); + + // Place zero terminator after comment value + if (!(Flags & parse_no_string_terminators)) + *text = Ch('\0'); + + text += 3; // Skip '-->' + return comment; + } + + // Parse DOCTYPE + template + xml_node *parse_doctype(Ch *&text) + { + // Remember value start + Ch *value = text; + + // Skip to > + while (*text != Ch('>')) + { + // Determine character type + switch (*text) + { + + // If '[' encountered, scan for matching ending ']' using naive algorithm with depth + // This works for all W3C test files except for 2 most wicked + case Ch('['): + { + ++text; // Skip '[' + int depth = 1; + while (depth > 0) + { + switch (*text) + { + case Ch('['): ++depth; break; + case Ch(']'): --depth; break; + case 0: RAPIDXML_PARSE_ERROR("unexpected end of data", text); + } + ++text; + } + break; + } + + // Error on end of text + case Ch('\0'): + RAPIDXML_PARSE_ERROR("unexpected end of data", text); + + // Other character, skip it + default: + ++text; + + } + } + + // If DOCTYPE nodes enabled + if (Flags & parse_doctype_node) + { + // Create a new doctype node + xml_node *doctype = this->allocate_node(node_doctype); + doctype->value(value, text - value); + + // Place zero terminator after value + if (!(Flags & parse_no_string_terminators)) + *text = Ch('\0'); + + text += 1; // skip '>' + return doctype; + } + else + { + text += 1; // skip '>' + return 0; + } + + } + + // Parse PI + template + xml_node *parse_pi(Ch *&text) + { + // If creation of PI nodes is enabled + if (Flags & parse_pi_nodes) + { + // Create pi node + xml_node *pi = this->allocate_node(node_pi); + + // Extract PI target name + Ch *name = text; + skip(text); + if (text == name) + RAPIDXML_PARSE_ERROR("expected PI target", text); + pi->name(name, text - name); + + // Skip whitespace between pi target and pi + skip(text); + + // Remember start of pi + Ch *value = text; + + // Skip to '?>' + while (text[0] != Ch('?') || text[1] != Ch('>')) + { + if (*text == Ch('\0')) + RAPIDXML_PARSE_ERROR("unexpected end of data", text); + ++text; + } + + // Set pi value (verbatim, no entity expansion or whitespace normalization) + pi->value(value, text - value); + + // Place zero terminator after name and value + if (!(Flags & parse_no_string_terminators)) + { + pi->name()[pi->name_size()] = Ch('\0'); + pi->value()[pi->value_size()] = Ch('\0'); + } + + text += 2; // Skip '?>' + return pi; + } + else + { + // Skip to '?>' + while (text[0] != Ch('?') || text[1] != Ch('>')) + { + if (*text == Ch('\0')) + RAPIDXML_PARSE_ERROR("unexpected end of data", text); + ++text; + } + text += 2; // Skip '?>' + return 0; + } + } + + // Parse and append data + // Return character that ends data. + // This is necessary because this character might have been overwritten by a terminating 0 + template + Ch parse_and_append_data(xml_node *node, Ch *&text, Ch *contents_start) + { + // Backup to contents start if whitespace trimming is disabled + if (!(Flags & parse_trim_whitespace)) + text = contents_start; + + // Skip until end of data + Ch *value = text, *end; + if (Flags & parse_normalize_whitespace) + end = skip_and_expand_character_refs(text); + else + end = skip_and_expand_character_refs(text); + + // Trim trailing whitespace if flag is set; leading was already trimmed by whitespace skip after > + if (Flags & parse_trim_whitespace) + { + if (Flags & parse_normalize_whitespace) + { + // Whitespace is already condensed to single space characters by skipping function, so just trim 1 char off the end + if (*(end - 1) == Ch(' ')) + --end; + } + else + { + // Backup until non-whitespace character is found + while (whitespace_pred::test(*(end - 1))) + --end; + } + } + + // If characters are still left between end and value (this test is only necessary if normalization is enabled) + // Create new data node + if (!(Flags & parse_no_data_nodes)) + { + xml_node *data = this->allocate_node(node_data); + data->value(value, end - value); + node->append_node(data); + } + + // Add data to parent node if no data exists yet + if (!(Flags & parse_no_element_values)) + if (*node->value() == Ch('\0')) + node->value(value, end - value); + + // Place zero terminator after value + if (!(Flags & parse_no_string_terminators)) + { + Ch ch = *text; + *end = Ch('\0'); + return ch; // Return character that ends data; this is required because zero terminator overwritten it + } + + // Return character that ends data + return *text; + } + + // Parse CDATA + template + xml_node *parse_cdata(Ch *&text) + { + // If CDATA is disabled + if (Flags & parse_no_data_nodes) + { + // Skip until end of cdata + while (text[0] != Ch(']') || text[1] != Ch(']') || text[2] != Ch('>')) + { + if (!text[0]) + RAPIDXML_PARSE_ERROR("unexpected end of data", text); + ++text; + } + text += 3; // Skip ]]> + return 0; // Do not produce CDATA node + } + + // Skip until end of cdata + Ch *value = text; + while (text[0] != Ch(']') || text[1] != Ch(']') || text[2] != Ch('>')) + { + if (!text[0]) + RAPIDXML_PARSE_ERROR("unexpected end of data", text); + ++text; + } + + // Create new cdata node + xml_node *cdata = this->allocate_node(node_cdata); + cdata->value(value, text - value); + + // Place zero terminator after value + if (!(Flags & parse_no_string_terminators)) + *text = Ch('\0'); + + text += 3; // Skip ]]> + return cdata; + } + + // Parse element node + template + xml_node *parse_element(Ch *&text) + { + // Create element node + xml_node *element = this->allocate_node(node_element); + + // Extract element name + Ch *name = text; + skip(text); + if (text == name) + RAPIDXML_PARSE_ERROR("expected element name", text); + element->name(name, text - name); + + // Skip whitespace between element name and attributes or > + skip(text); + + // Parse attributes, if any + parse_node_attributes(text, element); + + // Determine ending type + if (*text == Ch('>')) + { + ++text; + parse_node_contents(text, element); + } + else if (*text == Ch('/')) + { + ++text; + if (*text != Ch('>')) + RAPIDXML_PARSE_ERROR("expected >", text); + ++text; + } + else + RAPIDXML_PARSE_ERROR("expected >", text); + + // Place zero terminator after name + if (!(Flags & parse_no_string_terminators)) + element->name()[element->name_size()] = Ch('\0'); + + // Return parsed element + return element; + } + + // Determine node type, and parse it + template + xml_node *parse_node(Ch *&text) + { + // Parse proper node type + switch (text[0]) + { + + // <... + default: + // Parse and append element node + return parse_element(text); + + // (text); + } + else + { + // Parse PI + return parse_pi(text); + } + + // (text); + } + break; + + // (text); + } + break; + + // (text); + } + + } // switch + + // Attempt to skip other, unrecognized node types starting with ')) + { + if (*text == 0) + RAPIDXML_PARSE_ERROR("unexpected end of data", text); + ++text; + } + ++text; // Skip '>' + return 0; // No node recognized + + } + } + + // Parse contents of the node - children, data etc. + template + void parse_node_contents(Ch *&text, xml_node *node) + { + // For all children and text + while (1) + { + // Skip whitespace between > and node contents + Ch *contents_start = text; // Store start of node contents before whitespace is skipped + skip(text); + Ch next_char = *text; + + // After data nodes, instead of continuing the loop, control jumps here. + // This is because zero termination inside parse_and_append_data() function + // would wreak havoc with the above code. + // Also, skipping whitespace after data nodes is unnecessary. + after_data_node: + + // Determine what comes next: node closing, child node, data node, or 0? + switch (next_char) + { + + // Node closing or child node + case Ch('<'): + if (text[1] == Ch('/')) + { + // Node closing + text += 2; // Skip '(text); + if (!internal::compare(node->name(), node->name_size(), closing_name, text - closing_name, true)) + RAPIDXML_PARSE_ERROR("invalid closing tag name", text); + } + else + { + // No validation, just skip name + skip(text); + } + // Skip remaining whitespace after node name + skip(text); + if (*text != Ch('>')) + RAPIDXML_PARSE_ERROR("expected >", text); + ++text; // Skip '>' + return; // Node closed, finished parsing contents + } + else + { + // Child node + ++text; // Skip '<' + if (xml_node *child = parse_node(text)) + node->append_node(child); + } + break; + + // End of data - error + case Ch('\0'): + RAPIDXML_PARSE_ERROR("unexpected end of data", text); + + // Data node + default: + next_char = parse_and_append_data(node, text, contents_start); + goto after_data_node; // Bypass regular processing after data nodes + + } + } + } + + // Parse XML attributes of the node + template + void parse_node_attributes(Ch *&text, xml_node *node) + { + // For all attributes + while (attribute_name_pred::test(*text)) + { + // Extract attribute name + Ch *name = text; + ++text; // Skip first character of attribute name + skip(text); + if (text == name) + RAPIDXML_PARSE_ERROR("expected attribute name", name); + + // Create new attribute + xml_attribute *attribute = this->allocate_attribute(); + attribute->name(name, text - name); + node->append_attribute(attribute); + + // Skip whitespace after attribute name + skip(text); + + // Skip = + if (*text != Ch('=')) + RAPIDXML_PARSE_ERROR("expected =", text); + ++text; + + // Add terminating zero after name + if (!(Flags & parse_no_string_terminators)) + attribute->name()[attribute->name_size()] = 0; + + // Skip whitespace after = + skip(text); + + // Skip quote and remember if it was ' or " + Ch quote = *text; + if (quote != Ch('\'') && quote != Ch('"')) + RAPIDXML_PARSE_ERROR("expected ' or \"", text); + ++text; + + // Extract attribute value and expand char refs in it + Ch *value = text, *end; + const int AttFlags = Flags & ~parse_normalize_whitespace; // No whitespace normalization in attributes + if (quote == Ch('\'')) + end = skip_and_expand_character_refs, attribute_value_pure_pred, AttFlags>(text); + else + end = skip_and_expand_character_refs, attribute_value_pure_pred, AttFlags>(text); + + // Set attribute value + attribute->value(value, end - value); + + // Make sure that end quote is present + if (*text != quote) + RAPIDXML_PARSE_ERROR("expected ' or \"", text); + ++text; // Skip quote + + // Add terminating zero after value + if (!(Flags & parse_no_string_terminators)) + attribute->value()[attribute->value_size()] = 0; + + // Skip whitespace after attribute value + skip(text); + } + } + + }; + + //! \cond internal + namespace internal + { + + // Whitespace (space \n \r \t) + template + const unsigned char lookup_tables::lookup_whitespace[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, // 0 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 1 + 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 2 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 3 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 4 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 5 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 6 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 7 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 8 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 9 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // A + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // B + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // C + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // D + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // E + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 // F + }; + + // Node name (anything but space \n \r \t / > ? \0) + template + const unsigned char lookup_tables::lookup_node_name[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, // 0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 1 + 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, // 2 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, // 3 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 4 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 5 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 6 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 8 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 9 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // A + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // B + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // C + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // D + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // E + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // F + }; + + // Text (i.e. PCDATA) (anything but < \0) + template + const unsigned char lookup_tables::lookup_text[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 1 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 2 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, // 3 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 4 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 5 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 6 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 8 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 9 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // A + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // B + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // C + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // D + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // E + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // F + }; + + // Text (i.e. PCDATA) that does not require processing when ws normalization is disabled + // (anything but < \0 &) + template + const unsigned char lookup_tables::lookup_text_pure_no_ws[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 1 + 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 2 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, // 3 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 4 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 5 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 6 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 8 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 9 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // A + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // B + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // C + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // D + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // E + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // F + }; + + // Text (i.e. PCDATA) that does not require processing when ws normalizationis is enabled + // (anything but < \0 & space \n \r \t) + template + const unsigned char lookup_tables::lookup_text_pure_with_ws[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, // 0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 1 + 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 2 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, // 3 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 4 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 5 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 6 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 8 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 9 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // A + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // B + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // C + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // D + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // E + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // F + }; + + // Attribute name (anything but space \n \r \t / < > = ? ! \0) + template + const unsigned char lookup_tables::lookup_attribute_name[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, // 0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 1 + 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, // 2 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, // 3 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 4 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 5 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 6 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 8 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 9 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // A + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // B + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // C + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // D + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // E + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // F + }; + + // Attribute data with single quote (anything but ' \0) + template + const unsigned char lookup_tables::lookup_attribute_data_1[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 1 + 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, // 2 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 3 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 4 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 5 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 6 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 8 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 9 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // A + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // B + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // C + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // D + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // E + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // F + }; + + // Attribute data with single quote that does not require processing (anything but ' \0 &) + template + const unsigned char lookup_tables::lookup_attribute_data_1_pure[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 1 + 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, // 2 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 3 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 4 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 5 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 6 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 8 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 9 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // A + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // B + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // C + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // D + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // E + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // F + }; + + // Attribute data with double quote (anything but " \0) + template + const unsigned char lookup_tables::lookup_attribute_data_2[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 1 + 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 2 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 3 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 4 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 5 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 6 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 8 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 9 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // A + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // B + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // C + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // D + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // E + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // F + }; + + // Attribute data with double quote that does not require processing (anything but " \0 &) + template + const unsigned char lookup_tables::lookup_attribute_data_2_pure[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 0 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 1 + 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 2 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 3 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 4 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 5 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 6 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 8 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // 9 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // A + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // B + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // C + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // D + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, // E + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // F + }; + + // Digits (dec and hex, 255 denotes end of numeric character reference) + template + const unsigned char lookup_tables::lookup_digits[256] = + { + // 0 1 2 3 4 5 6 7 8 9 A B C D E F + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // 0 + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // 1 + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // 2 + 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,255,255,255,255,255,255, // 3 + 255, 10, 11, 12, 13, 14, 15,255,255,255,255,255,255,255,255,255, // 4 + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // 5 + 255, 10, 11, 12, 13, 14, 15,255,255,255,255,255,255,255,255,255, // 6 + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // 7 + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // 8 + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // 9 + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // A + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // B + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // C + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // D + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, // E + 255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255 // F + }; + + // Upper case conversion + template + const unsigned char lookup_tables::lookup_upcase[256] = + { + // 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A B C D E F + 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, // 0 + 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, // 1 + 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, // 2 + 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, // 3 + 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, // 4 + 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, // 5 + 96, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, // 6 + 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 123,124,125,126,127, // 7 + 128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143, // 8 + 144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159, // 9 + 160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175, // A + 176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191, // B + 192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207, // C + 208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223, // D + 224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239, // E + 240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255 // F + }; + } + //! \endcond + +} + +// Undefine internal macros +#undef RAPIDXML_PARSE_ERROR + +// On MSVC, restore warnings state +#ifdef _MSC_VER + #pragma warning(pop) +#endif + +#endif diff --git a/test.png b/test.png new file mode 100644 index 0000000..fbec303 Binary files /dev/null and b/test.png differ diff --git a/test.tsx b/test.tsx new file mode 100644 index 0000000..2b652a1 --- /dev/null +++ b/test.tsx @@ -0,0 +1,4 @@ + + + + diff --git a/tiles.png b/tiles.png new file mode 100644 index 0000000..27fc902 Binary files /dev/null and b/tiles.png differ diff --git a/tiles2.png b/tiles2.png new file mode 100644 index 0000000..c8285dd Binary files /dev/null and b/tiles2.png differ diff --git a/tileset2.tsx b/tileset2.tsx new file mode 100644 index 0000000..7069f52 --- /dev/null +++ b/tileset2.tsx @@ -0,0 +1,4 @@ + + + +