You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

79 lines
2.3 KiB

/*
* Copyright (c) 2010-2012 OTClient <https://github.com/edubart/otclient>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
#ifndef BINARYTREE_H
#define BINARYTREE_H
#include "declarations.h"
#include <framework/util/databuffer.h>
#include <otclient/position.h>
enum {
BINARYTREE_ESCAPE_CHAR = 0xFD,
BINARYTREE_NODE_START = 0xFE,
BINARYTREE_NODE_END = 0xFF
};
class BinaryTree
{
public:
BinaryTree(const FileStreamPtr& fin);
~BinaryTree();
void seek(uint pos);
void skip(uint len) { seek(tell() + len); }
uint tell() { return m_pos; }
uint size() { unserialize(); return m_buffer.size(); }
uint8 getU8();
uint16 getU16();
uint32 getU32();
uint64 getU64();
std::string getString();
Position getPosition();
Point getPoint();
void setType(uint8 type);
void writeU8(uint8 u8);
void writeU16(uint16 u16);
void writeU32(uint32 u32);
void writeString(const std::string& s);
void writePos(const Position& p);
void writePoint(const Point& p);
BinaryTreePtr makeChild(uint8 type);
void writeToFile();
BinaryTreeVec getChildren();
bool canRead() { unserialize(); return m_pos < m_buffer.size(); }
private:
void unserialize();
void skipNodes();
FileStreamPtr m_fin;
DataBuffer<uint8> m_buffer;
uint m_pos;
uint m_startPos;
};
#endif