Compare commits
49 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
| d2e42c33a0 | |||
| 8bddbce07a | |||
| add62fb24a | |||
| 68b389f938 | |||
| f3adb639c3 | |||
| 88a9020da7 | |||
| 0a814233a4 | |||
| b4836847f5 | |||
| f941862637 | |||
| 36f37b6548 | |||
| 1dde1dbf1e | |||
| f5012f770c | |||
| e7b9a57723 | |||
| 02b4aa3c91 | |||
| f184982bc1 | |||
| 1cdc738839 | |||
| 368bc450ce | |||
| 148b5f397a | |||
| f62322752d | |||
| fb9e125f16 | |||
| b70e8f7790 | |||
| 39bdd0a11e | |||
| c95c8b7fde | |||
| e984ed9085 | |||
| 92035d7b9e | |||
| 48841fa4e9 | |||
| 83ab8c70f0 | |||
| ccdcdac7c6 | |||
| a2b5424888 | |||
| a4fb56b549 | |||
| 22e62df04d | |||
| faf544f997 | |||
| b72f4a7673 | |||
| 19c03010cb | |||
| 41f8c152eb | |||
| 051c9d8744 | |||
| 193e4db651 | |||
| cb5f5a4cf8 | |||
| bc7e5914ce | |||
| 0365902971 | |||
| f2fcc348d7 | |||
| 95c92ec6c9 | |||
| 721f15b601 | |||
| 3970103b01 | |||
| 4e866c1032 | |||
| ca268781fd | |||
| a2d8984199 | |||
| e7f9ca2b6c | |||
| deb0075aac |
@@ -1,7 +1,11 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
|
#include <cstdint>
|
||||||
|
|
||||||
namespace td {
|
namespace td {
|
||||||
|
|
||||||
|
static constexpr float PI = 3.141592653f;
|
||||||
|
|
||||||
template<typename T>
|
template<typename T>
|
||||||
struct Vec2 {
|
struct Vec2 {
|
||||||
union {
|
union {
|
||||||
@@ -15,7 +19,6 @@ struct Vec2 {
|
|||||||
};
|
};
|
||||||
|
|
||||||
constexpr Vec2(T X = 0, T Y = 0) : x(X), y(Y) {}
|
constexpr Vec2(T X = 0, T Y = 0) : x(X), y(Y) {}
|
||||||
|
|
||||||
};
|
};
|
||||||
|
|
||||||
template<typename T>
|
template<typename T>
|
||||||
@@ -48,6 +51,37 @@ inline bool operator==(const Vec3<T>& vec3, const Vec3<T>& other) {
|
|||||||
return vec3.x == other.x && vec3.y == other.y && vec3.z == other.z;
|
return vec3.x == other.x && vec3.y == other.y && vec3.z == other.z;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
struct Vec4 {
|
||||||
|
union {
|
||||||
|
T x;
|
||||||
|
T r;
|
||||||
|
};
|
||||||
|
|
||||||
|
union {
|
||||||
|
T y;
|
||||||
|
T g;
|
||||||
|
};
|
||||||
|
|
||||||
|
union {
|
||||||
|
T z;
|
||||||
|
T b;
|
||||||
|
};
|
||||||
|
|
||||||
|
union {
|
||||||
|
T w;
|
||||||
|
T a;
|
||||||
|
};
|
||||||
|
|
||||||
|
constexpr Vec4(Vec3<T> vec, T W = 1) : x(vec.x), y(vec.y), z(vec.z), w(W) {}
|
||||||
|
constexpr Vec4(T X = 0, T Y = 0, T Z = 0, T W = 0) : x(X), y(Y), z(Z), w(W) {}
|
||||||
|
};
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
inline bool operator==(const Vec4<T>& vec4, const Vec4<T>& other) {
|
||||||
|
return vec4.x == other.x && vec4.y == other.y && vec4.z == other.z && vec4.w = other.w;
|
||||||
|
}
|
||||||
|
|
||||||
using Vec2i = Vec2<int>;
|
using Vec2i = Vec2<int>;
|
||||||
using Vec2u = Vec2<unsigned int>;
|
using Vec2u = Vec2<unsigned int>;
|
||||||
using Vec2f = Vec2<float>;
|
using Vec2f = Vec2<float>;
|
||||||
@@ -58,6 +92,57 @@ using Vec3u = Vec3<unsigned int>;
|
|||||||
using Vec3f = Vec3<float>;
|
using Vec3f = Vec3<float>;
|
||||||
using Vec3d = Vec3<double>;
|
using Vec3d = Vec3<double>;
|
||||||
|
|
||||||
|
using Vec4i = Vec4<int>;
|
||||||
|
using Vec4u = Vec4<unsigned int>;
|
||||||
|
using Vec4f = Vec4<float>;
|
||||||
|
using Vec4d = Vec4<double>;
|
||||||
|
|
||||||
using Color = Vec3<unsigned char>;
|
using Color = Vec3<unsigned char>;
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
struct Mat4 {
|
||||||
|
static const std::size_t MATRIX_SIZE = 4;
|
||||||
|
|
||||||
|
T x0, x1, x2, x3;
|
||||||
|
T y0, y1, y2, y3;
|
||||||
|
T z0, z1, z2, z3;
|
||||||
|
T w0, w1, w2, w3;
|
||||||
|
|
||||||
|
T operator[] (std::size_t offset) const {
|
||||||
|
return reinterpret_cast<const T*>(this)[offset];
|
||||||
|
}
|
||||||
|
|
||||||
|
T& operator[] (std::size_t offset) {
|
||||||
|
return reinterpret_cast<T*>(this)[offset];
|
||||||
|
}
|
||||||
|
|
||||||
|
T* data() {
|
||||||
|
return reinterpret_cast<T*>(this);
|
||||||
|
}
|
||||||
|
|
||||||
|
const T* data() const{
|
||||||
|
return reinterpret_cast<const T*>(this);
|
||||||
|
}
|
||||||
|
|
||||||
|
T at(std::size_t row, std::size_t column) const {
|
||||||
|
return operator[](row * MATRIX_SIZE + column);
|
||||||
|
}
|
||||||
|
|
||||||
|
T& at(std::size_t row, std::size_t column) {
|
||||||
|
return operator[](row * MATRIX_SIZE + column);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
typedef Mat4<float> Mat4f;
|
||||||
|
typedef Mat4<int> Mat4i;
|
||||||
|
typedef Mat4<double> Mat4d;
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
inline bool operator==(const Mat4<T>& mat, const Mat4<T>& other) {
|
||||||
|
return mat.x0 == other.x0 && mat.y0 == other.y0 && mat.z0 == other.z0 && mat.w0 == other.w0 &&
|
||||||
|
mat.x1 == other.x1 && mat.y1 == other.y1 && mat.z1 == other.z1 && mat.w1 == other.w1 &&
|
||||||
|
mat.x2 == other.x2 && mat.y2 == other.y2 && mat.z2 == other.z2 && mat.w2 == other.w2 &&
|
||||||
|
mat.x3 == other.x3 && mat.y3 == other.y3 && mat.z3 == other.z3 && mat.w3 == other.w3;
|
||||||
|
}
|
||||||
|
|
||||||
} // namespace td
|
} // namespace td
|
||||||
|
|||||||
@@ -36,6 +36,8 @@ protected:
|
|||||||
TeamList m_Teams = { Team{TeamColor::Red}, Team{TeamColor::Blue} };
|
TeamList m_Teams = { Team{TeamColor::Red}, Team{TeamColor::Blue} };
|
||||||
GameState m_GameState = GameState::Lobby;
|
GameState m_GameState = GameState::Lobby;
|
||||||
PlayerList m_Players;
|
PlayerList m_Players;
|
||||||
|
|
||||||
|
std::uint64_t m_GameStartTime = 0;
|
||||||
public:
|
public:
|
||||||
Game(World* world);
|
Game(World* world);
|
||||||
virtual ~Game();
|
virtual ~Game();
|
||||||
@@ -52,7 +54,7 @@ public:
|
|||||||
const Team& GetTeam(TeamColor team) const { return m_Teams[static_cast<std::uint8_t>(team)]; }
|
const Team& GetTeam(TeamColor team) const { return m_Teams[static_cast<std::uint8_t>(team)]; }
|
||||||
|
|
||||||
GameState GetGameState() const { return m_GameState; }
|
GameState GetGameState() const { return m_GameState; }
|
||||||
virtual void SetGameState(GameState gameState) { m_GameState = gameState; };
|
void SetGameState(GameState gameState) { m_GameState = gameState; };
|
||||||
|
|
||||||
const World* GetWorld() const { return m_World; }
|
const World* GetWorld() const { return m_World; }
|
||||||
World* GetWorld() { return m_World; }
|
World* GetWorld() { return m_World; }
|
||||||
@@ -65,6 +67,8 @@ public:
|
|||||||
|
|
||||||
const TeamList& GetTeams() const { return m_Teams; }
|
const TeamList& GetTeams() const { return m_Teams; }
|
||||||
|
|
||||||
|
std::uint64_t GetGameStartTime() const { return m_GameStartTime; }
|
||||||
|
|
||||||
};
|
};
|
||||||
|
|
||||||
} // namespace game
|
} // namespace game
|
||||||
|
|||||||
@@ -7,6 +7,7 @@
|
|||||||
#include "game/Player.h"
|
#include "game/Player.h"
|
||||||
|
|
||||||
#include "protocol/Protocol.h"
|
#include "protocol/Protocol.h"
|
||||||
|
#include "protocol/packets/SendMobsPacket.h"
|
||||||
|
|
||||||
#include "render/Renderer.h"
|
#include "render/Renderer.h"
|
||||||
|
|
||||||
|
|||||||
@@ -18,7 +18,7 @@ class ClientGame : public protocol::PacketHandler, public game::Game {
|
|||||||
private:
|
private:
|
||||||
Client* m_Client;
|
Client* m_Client;
|
||||||
std::uint8_t m_ConnexionID;
|
std::uint8_t m_ConnexionID;
|
||||||
std::uint32_t m_LobbyTime = 0;
|
std::uint64_t m_LobbyStartTime = 0;
|
||||||
game::Player* m_Player = nullptr;
|
game::Player* m_Player = nullptr;
|
||||||
render::Renderer* m_Renderer;
|
render::Renderer* m_Renderer;
|
||||||
client::WorldClient m_WorldClient;
|
client::WorldClient m_WorldClient;
|
||||||
@@ -31,7 +31,7 @@ public:
|
|||||||
|
|
||||||
void RenderWorld();
|
void RenderWorld();
|
||||||
|
|
||||||
std::uint32_t GetLobbyTime() const { return m_LobbyTime; }
|
std::uint64_t GetLobbyStartTime() const { return m_LobbyStartTime; }
|
||||||
const game::Player* GetPlayer() const { return m_Player; }
|
const game::Player* GetPlayer() const { return m_Player; }
|
||||||
const WorldClient& GetWorld() const { return m_WorldClient; }
|
const WorldClient& GetWorld() const { return m_WorldClient; }
|
||||||
Client* GetClient() const { return m_Client; }
|
Client* GetClient() const { return m_Client; }
|
||||||
@@ -39,8 +39,6 @@ public:
|
|||||||
render::Renderer* GetRenderer() const { return m_Renderer; }
|
render::Renderer* GetRenderer() const { return m_Renderer; }
|
||||||
WorldClient& GetWorldClient() { return m_WorldClient; }
|
WorldClient& GetWorldClient() { return m_WorldClient; }
|
||||||
|
|
||||||
void SetGameState(game::GameState gameState) override;
|
|
||||||
|
|
||||||
virtual void HandlePacket(const protocol::ConnexionInfoPacket* packet) override;
|
virtual void HandlePacket(const protocol::ConnexionInfoPacket* packet) override;
|
||||||
virtual void HandlePacket(const protocol::PlayerJoinPacket* packet) override;
|
virtual void HandlePacket(const protocol::PlayerJoinPacket* packet) override;
|
||||||
virtual void HandlePacket(const protocol::PlayerLeavePacket* packet) override;
|
virtual void HandlePacket(const protocol::PlayerLeavePacket* packet) override;
|
||||||
|
|||||||
@@ -13,7 +13,7 @@ class Lobby {
|
|||||||
private:
|
private:
|
||||||
Server* m_Server;
|
Server* m_Server;
|
||||||
bool m_GameStarted = false;
|
bool m_GameStarted = false;
|
||||||
std::uint64_t m_StartTimerTime = 0;
|
std::uint64_t m_StartTime = 0;
|
||||||
std::vector<std::uint8_t> m_Players;
|
std::vector<std::uint8_t> m_Players;
|
||||||
utils::AutoTimer m_Timer;
|
utils::AutoTimer m_Timer;
|
||||||
public:
|
public:
|
||||||
|
|||||||
@@ -1,15 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include <string>
|
|
||||||
|
|
||||||
namespace td {
|
|
||||||
namespace utils {
|
|
||||||
|
|
||||||
void InitDiscordRPC();
|
|
||||||
void UpdateDiscordRPC();
|
|
||||||
void ShutdownDiscordRPC();
|
|
||||||
|
|
||||||
void UpdateDiscordPresence(const std::string& state, const std::string& details, bool resetTimer = false);
|
|
||||||
|
|
||||||
} // namespace utils
|
|
||||||
} // namespace td
|
|
||||||
177
include/misc/Maths.h
Normal file
177
include/misc/Maths.h
Normal file
@@ -0,0 +1,177 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "Defines.h"
|
||||||
|
#include <cmath>
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
|
||||||
|
//////////////////////////////////////////////////////////////////
|
||||||
|
// Operators //
|
||||||
|
//////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec2<T> operator+(const Vec2<T>& vect, const Vec2<T>& other) {
|
||||||
|
return {vect.x + other.x, vect.y + other.y};
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec2<T> operator- (const Vec2<T>& vect) {
|
||||||
|
return { -vect.x, -vect.y };
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec2<T> operator- (const Vec2<T>& vect, const Vec2<T>& other) {
|
||||||
|
return vect + (-other);
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec3<T> operator- (const Vec3<T>& vect) {
|
||||||
|
return { -vect.x, -vect.y, -vect.z };
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec3<T> operator+ (const Vec3<T>& vect, const Vec3<T>& other) {
|
||||||
|
return { vect.x + other.x, vect.y + other.y, vect.z + other.y };
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec3<T> operator- (const Vec3<T>& vect, const Vec3<T>& other) {
|
||||||
|
return vect + (-other);
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec4<T> operator- (const Vec4<T>& vect) {
|
||||||
|
return { -vect.x, -vect.y, -vect.z, -vect.w };
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec4<T> operator+ (const Vec4<T>& vect, const Vec4<T>& other) {
|
||||||
|
return { vect.x + other.x, vect.y + other.y, vect.z + other.y, vect.w + other.w };
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec4<T> operator- (const Vec4<T>& vect, const Vec4<T>& other) {
|
||||||
|
return vect + (-other);
|
||||||
|
}
|
||||||
|
|
||||||
|
//////////////////////////////////////////////////////////////////
|
||||||
|
// Vectors //
|
||||||
|
//////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
namespace maths {
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
T Length(const Vec3<T>& vect) {
|
||||||
|
return std::sqrt(vect.x * vect.x + vect.y * vect.y + vect.z * vect.z);
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec3<T> Normalize(const Vec3<T>& vect) {
|
||||||
|
T length = Length(vect);
|
||||||
|
|
||||||
|
return { vect.x / length, vect.y / length, vect.z / length };
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec4<T> Normalize(const Vec4<T>& vect) {
|
||||||
|
T length = std::sqrt(vect.x * vect.x + vect.y * vect.y + vect.z * vect.z + vect.w * vect.w);
|
||||||
|
|
||||||
|
return { vect.x / length, vect.y / length, vect.z / length, vect.w / length };
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
T Dot(const Vec3<T>& vect, const Vec3<T>& other) {
|
||||||
|
return vect.x * other.x + vect.y * other.y + vect.z * other.z;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec3<T> Cross(const Vec3<T>& vect, const Vec3<T>& other) {
|
||||||
|
return {
|
||||||
|
vect.y * other.z - vect.z * other.y,
|
||||||
|
vect.z * other.x - vect.x * other.z,
|
||||||
|
vect.x * other.y - vect.y * other.x,
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
T Dot(const Vec4<T>& vect, const Vec4<T>& other) {
|
||||||
|
return vect.x * other.x + vect.y * other.y + vect.z * other.z + vect.w * other.w;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
T Distance(const Vec3<T>& vect, const Vec3<T>& other) {
|
||||||
|
return Length(vect - other);
|
||||||
|
}
|
||||||
|
|
||||||
|
//////////////////////////////////////////////////////////////////
|
||||||
|
// Matricies //
|
||||||
|
//////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Vec4<T> Dot(const Mat4<T>& mat, const Vec4<T>& vect) {
|
||||||
|
return {
|
||||||
|
mat.x0 * vect.x + mat.x1 * vect.y + mat.x2 * vect.z + mat.x3 * vect.w,
|
||||||
|
mat.y0 * vect.x + mat.y1 * vect.y + mat.y2 * vect.z + mat.y3 * vect.w,
|
||||||
|
mat.z0 * vect.x + mat.z1 * vect.y + mat.z2 * vect.z + mat.z3 * vect.w,
|
||||||
|
mat.w0 * vect.x + mat.w1 * vect.y + mat.w2 * vect.z + mat.w3 * vect.w
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Mat4<T> Dot(const Mat4<T>& mat, const Mat4<T>& other) {
|
||||||
|
Mat4<T> result {};
|
||||||
|
|
||||||
|
for (std::size_t i = 0; i < Mat4<T>::MATRIX_SIZE; i++) {
|
||||||
|
for (std::size_t j = 0; j < Mat4<T>::MATRIX_SIZE; j++) {
|
||||||
|
for (std::size_t k = 0; k < Mat4<T>::MATRIX_SIZE; k++) {
|
||||||
|
result.at(i, j) += mat.at(i, k) * other.at(k, j);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Mat4<T> Identity() {
|
||||||
|
Mat4<T> result{};
|
||||||
|
|
||||||
|
result.x0 = static_cast<T>(1);
|
||||||
|
result.y1 = static_cast<T>(1);
|
||||||
|
result.z2 = static_cast<T>(1);
|
||||||
|
result.w3 = static_cast<T>(1);
|
||||||
|
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
Mat4<T> Transpose(const Mat4<T>& mat) {
|
||||||
|
Mat4<T> result;
|
||||||
|
|
||||||
|
result.x1 = mat.y0;
|
||||||
|
result.x2 = mat.z0;
|
||||||
|
result.x3 = mat.w0;
|
||||||
|
result.y0 = mat.x1;
|
||||||
|
result.y2 = mat.z1;
|
||||||
|
result.y3 = mat.w1;
|
||||||
|
result.z0 = mat.x2;
|
||||||
|
result.z1 = mat.y2;
|
||||||
|
result.z3 = mat.w2;
|
||||||
|
result.w0 = mat.x3;
|
||||||
|
result.w1 = mat.y3;
|
||||||
|
result.w2 = mat.z3;
|
||||||
|
result.x0 = mat.x0;
|
||||||
|
result.y1 = mat.y1;
|
||||||
|
result.z2 = mat.z2;
|
||||||
|
result.w3 = mat.w3;
|
||||||
|
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
Mat4f Perspective(float fovY, float aspectRatio, float zNear, float zFar);
|
||||||
|
Mat4f Look(const Vec3f& eye, const Vec3f& center, const Vec3f& up);
|
||||||
|
|
||||||
|
Mat4f Inverse(const Mat4f& mat);
|
||||||
|
|
||||||
|
} // namespace maths
|
||||||
|
} // namespace td
|
||||||
@@ -1,6 +1,7 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
#include "protocol/Protocol.h"
|
#include "protocol/Protocol.h"
|
||||||
|
#include "protocol/PacketsForward.h"
|
||||||
|
|
||||||
namespace td {
|
namespace td {
|
||||||
namespace protocol {
|
namespace protocol {
|
||||||
|
|||||||
27
include/protocol/Packets.h
Normal file
27
include/protocol/Packets.h
Normal file
@@ -0,0 +1,27 @@
|
|||||||
|
#include "packets/ConnectionInfoPacket.h"
|
||||||
|
#include "packets/DisconnectPacket.h"
|
||||||
|
#include "packets/KeepAlivePacket.h"
|
||||||
|
#include "packets/PlaceTowerPacket.h"
|
||||||
|
#include "packets/PlayerBuyItemPacket.h"
|
||||||
|
#include "packets/PlayerBuyMobUpgradePacket.h"
|
||||||
|
#include "packets/PlayerJoinPacket.h"
|
||||||
|
#include "packets/PlayerLeavePacket.h"
|
||||||
|
#include "packets/PlayerListPacket.h"
|
||||||
|
#include "packets/PlayerLoginPacket.h"
|
||||||
|
#include "packets/RemoveTowerPacket.h"
|
||||||
|
#include "packets/SelectTeamPacket.h"
|
||||||
|
#include "packets/SendMobsPacket.h"
|
||||||
|
#include "packets/ServerTpsPacket.h"
|
||||||
|
#include "packets/SpawnMobPacket.h"
|
||||||
|
#include "packets/UpdateCastleLifePacket.h"
|
||||||
|
#include "packets/UpdateExpPacket.h"
|
||||||
|
#include "packets/UpdateGameStatePacket.h"
|
||||||
|
#include "packets/UpdateLobbyTimePacket.h"
|
||||||
|
#include "packets/UpdateMobStatesPacket.h"
|
||||||
|
#include "packets/UpdateMoneyPacket.h"
|
||||||
|
#include "packets/UpdatePlayerTeamPacket.h"
|
||||||
|
#include "packets/UpgradeTowerPacket.h"
|
||||||
|
#include "packets/WorldAddTowerPacket.h"
|
||||||
|
#include "packets/WorldAddTowerPacket.h"
|
||||||
|
#include "packets/WorldBeginDataPacket.h"
|
||||||
|
#include "packets/WorldDataPacket.h"
|
||||||
34
include/protocol/PacketsForward.h
Normal file
34
include/protocol/PacketsForward.h
Normal file
@@ -0,0 +1,34 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class PlayerLoginPacket;
|
||||||
|
class WorldBeginDataPacket;
|
||||||
|
class WorldDataPacket;
|
||||||
|
class KeepAlivePacket;
|
||||||
|
class UpdateExpPacket;
|
||||||
|
class UpdateMoneyPacket;
|
||||||
|
class UpdateLobbyTimePacket;
|
||||||
|
class UpdateGameStatePacket;
|
||||||
|
class PlayerListPacket;
|
||||||
|
class PlayerJoinPacket;
|
||||||
|
class PlayerLeavePacket;
|
||||||
|
class ConnexionInfoPacket;
|
||||||
|
class SelectTeamPacket;
|
||||||
|
class UpdatePlayerTeamPacket;
|
||||||
|
class DisconnectPacket;
|
||||||
|
class ServerTpsPacket;
|
||||||
|
class SpawnMobPacket;
|
||||||
|
class PlaceTowerPacket;
|
||||||
|
class WorldAddTowerPacket;
|
||||||
|
class RemoveTowerPacket;
|
||||||
|
class SendMobsPacket;
|
||||||
|
class UpgradeTowerPacket;
|
||||||
|
class UpdateCastleLifePacket;
|
||||||
|
class UpdateMobStatesPacket;
|
||||||
|
class PlayerBuyItemPacket;
|
||||||
|
class PlayerBuyMobUpgradePacket;
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
@@ -1,8 +1,6 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
#include "misc/DataBuffer.h"
|
#include "misc/DataBuffer.h"
|
||||||
#include "game/World.h"
|
|
||||||
#include "game/BaseGame.h"
|
|
||||||
|
|
||||||
#include <memory>
|
#include <memory>
|
||||||
|
|
||||||
@@ -47,26 +45,6 @@ enum class PacketType : std::uint8_t {
|
|||||||
PACKET_COUNT
|
PACKET_COUNT
|
||||||
};
|
};
|
||||||
|
|
||||||
struct WorldHeader {
|
|
||||||
game::TowerTileColorPalette m_TowerPlacePalette;
|
|
||||||
Color m_WalkablePalette;
|
|
||||||
std::vector<Color> m_DecorationPalette;
|
|
||||||
Color m_Background;
|
|
||||||
|
|
||||||
game::SpawnColorPalette m_SpawnColorPalette;
|
|
||||||
|
|
||||||
game::TilePalette m_TilePalette;
|
|
||||||
|
|
||||||
game::Spawn m_RedSpawn, m_BlueSpawn;
|
|
||||||
game::TeamCastle m_RedCastle, m_BlueCastle;
|
|
||||||
|
|
||||||
const game::World* m_World;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct WorldData {
|
|
||||||
std::unordered_map<game::ChunkCoord, game::ChunkPtr> m_Chunks;
|
|
||||||
};
|
|
||||||
|
|
||||||
class Packet {
|
class Packet {
|
||||||
public:
|
public:
|
||||||
Packet() {}
|
Packet() {}
|
||||||
@@ -76,564 +54,37 @@ public:
|
|||||||
virtual void Deserialize(DataBuffer& data) = 0;
|
virtual void Deserialize(DataBuffer& data) = 0;
|
||||||
virtual void Dispatch(PacketHandler* handler) const = 0;
|
virtual void Dispatch(PacketHandler* handler) const = 0;
|
||||||
|
|
||||||
void WritePacketID(DataBuffer& data, bool packetID) const;
|
virtual void WritePacketID(DataBuffer& data, bool packetID) const;
|
||||||
|
|
||||||
virtual PacketType GetType() const = 0;
|
virtual PacketType GetType() const = 0;
|
||||||
std::uint8_t GetID() const { return static_cast<std::uint8_t>(GetType()); }
|
std::uint8_t GetID() const { return static_cast<std::uint8_t>(GetType()); }
|
||||||
|
|
||||||
|
virtual bool IsTimed() const { return false; }
|
||||||
|
};
|
||||||
|
|
||||||
|
class DelayedPacket : public Packet {
|
||||||
|
protected:
|
||||||
|
std::uint64_t m_PacketTime = 69;
|
||||||
|
|
||||||
|
public:
|
||||||
|
DelayedPacket() {}
|
||||||
|
virtual ~DelayedPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const = 0;
|
||||||
|
virtual void Deserialize(DataBuffer& data) = 0;
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const = 0;
|
||||||
|
|
||||||
|
virtual void WritePacketID(DataBuffer& data, bool packetID) const override;
|
||||||
|
|
||||||
|
virtual PacketType GetType() const = 0;
|
||||||
|
|
||||||
|
virtual bool IsTimed() const override { return true; }
|
||||||
|
|
||||||
|
void SetPacketTime(std::uint64_t packetTime) { m_PacketTime = packetTime; }
|
||||||
};
|
};
|
||||||
|
|
||||||
typedef std::unique_ptr<Packet> PacketPtr;
|
typedef std::unique_ptr<Packet> PacketPtr;
|
||||||
|
typedef std::unique_ptr<DelayedPacket> DelayedPacketPtr;
|
||||||
class KeepAlivePacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::uint64_t m_AliveID;
|
|
||||||
public:
|
|
||||||
KeepAlivePacket() {}
|
|
||||||
KeepAlivePacket(std::uint64_t aliveID) : m_AliveID(aliveID) {}
|
|
||||||
virtual ~KeepAlivePacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
std::uint64_t GetAliveID() const { return m_AliveID; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::KeepAlive; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class PlayerLoginPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::string m_PlayerName;
|
|
||||||
public:
|
|
||||||
PlayerLoginPacket() {}
|
|
||||||
PlayerLoginPacket(std::string playerName) : m_PlayerName(playerName) {}
|
|
||||||
virtual ~PlayerLoginPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::PlayerLogin; }
|
|
||||||
|
|
||||||
const std::string& GetPlayerName() const { return m_PlayerName; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class WorldBeginDataPacket : public Packet {
|
|
||||||
private:
|
|
||||||
WorldHeader m_Header;
|
|
||||||
public:
|
|
||||||
WorldBeginDataPacket() {}
|
|
||||||
WorldBeginDataPacket(const game::World* world) {
|
|
||||||
m_Header.m_World = world;
|
|
||||||
}
|
|
||||||
virtual ~WorldBeginDataPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::WorldBeginData; }
|
|
||||||
|
|
||||||
const game::TowerTileColorPalette& GetTowerTilePalette() const { return m_Header.m_TowerPlacePalette; }
|
|
||||||
const Color& GetWalkableTileColor() const { return m_Header.m_WalkablePalette; }
|
|
||||||
const std::vector<Color>& GetDecorationPalette() const { return m_Header.m_DecorationPalette; }
|
|
||||||
const Color& GetBackgroundColor() const { return m_Header.m_Background; }
|
|
||||||
|
|
||||||
const game::Spawn& GetRedSpawn() const { return m_Header.m_RedSpawn; }
|
|
||||||
const game::Spawn& GetBlueSpawn() const { return m_Header.m_BlueSpawn; }
|
|
||||||
|
|
||||||
const game::SpawnColorPalette& GetSpawnPalette() const { return m_Header.m_SpawnColorPalette; }
|
|
||||||
|
|
||||||
const game::TeamCastle& GetRedCastle() const { return m_Header.m_RedCastle; }
|
|
||||||
const game::TeamCastle& GetBlueCastle() const { return m_Header.m_BlueCastle; }
|
|
||||||
|
|
||||||
const game::TilePalette GetTilePalette() const { return m_Header.m_TilePalette; }
|
|
||||||
|
|
||||||
void setWorldHeader(const WorldHeader& header) { m_Header = header; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class WorldDataPacket : public Packet {
|
|
||||||
private:
|
|
||||||
WorldData m_WorldData;
|
|
||||||
|
|
||||||
const game::World* m_World;
|
|
||||||
public:
|
|
||||||
WorldDataPacket() {}
|
|
||||||
WorldDataPacket(const game::World* world) : m_World(world) {}
|
|
||||||
virtual ~WorldDataPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::WorldData; }
|
|
||||||
|
|
||||||
const std::unordered_map<game::ChunkCoord, game::ChunkPtr>& GetChunks() const { return m_WorldData.m_Chunks; }
|
|
||||||
|
|
||||||
DataBuffer SerializeCustom() const; // allow serialisation with invalid World member
|
|
||||||
void SetWorldData(const WorldData& worldData) { m_WorldData = worldData; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class UpdateMoneyPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::uint32_t m_NewAmount;
|
|
||||||
public:
|
|
||||||
UpdateMoneyPacket() {}
|
|
||||||
UpdateMoneyPacket(std::uint32_t newAmount) : m_NewAmount(newAmount) {}
|
|
||||||
virtual ~UpdateMoneyPacket() {}
|
|
||||||
|
|
||||||
std::uint32_t GetGold() const { return m_NewAmount; }
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::UpdateMoney; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class UpdateExpPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::uint32_t m_NewAmount;
|
|
||||||
public:
|
|
||||||
UpdateExpPacket() {}
|
|
||||||
UpdateExpPacket(std::uint32_t newAmount) : m_NewAmount(newAmount) {}
|
|
||||||
virtual ~UpdateExpPacket() {}
|
|
||||||
|
|
||||||
std::uint32_t GetExp() const { return m_NewAmount; }
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::UpdateEXP; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class UpdateLobbyTimePacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::uint32_t m_RemainingTime;
|
|
||||||
public:
|
|
||||||
UpdateLobbyTimePacket() {}
|
|
||||||
UpdateLobbyTimePacket(std::uint32_t remainingTime) : m_RemainingTime(remainingTime) {}
|
|
||||||
virtual ~UpdateLobbyTimePacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
std::uint32_t GetRemainingTime() const { return m_RemainingTime; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::UpdateLobbyTime; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class UpdateGameStatePacket : public Packet {
|
|
||||||
private:
|
|
||||||
game::GameState m_GameState;
|
|
||||||
public:
|
|
||||||
UpdateGameStatePacket() {}
|
|
||||||
UpdateGameStatePacket(game::GameState gameState) : m_GameState(gameState) {}
|
|
||||||
virtual ~UpdateGameStatePacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
game::GameState GetGameState() const { return m_GameState; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::UpdateGameState; }
|
|
||||||
};
|
|
||||||
|
|
||||||
struct PlayerInfo {
|
|
||||||
std::string name;
|
|
||||||
game::TeamColor team;
|
|
||||||
};
|
|
||||||
|
|
||||||
class PlayerListPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::map<std::uint8_t, PlayerInfo> m_Players;
|
|
||||||
public:
|
|
||||||
PlayerListPacket() {}
|
|
||||||
PlayerListPacket(std::map<std::uint8_t, PlayerInfo> players) : m_Players(players) {}
|
|
||||||
virtual ~PlayerListPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
const std::map<std::uint8_t, PlayerInfo>& GetPlayers() const { return m_Players; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::PlayerList; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class PlayerJoinPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::uint8_t m_PlayerID;
|
|
||||||
std::string m_PlayerName;
|
|
||||||
public:
|
|
||||||
PlayerJoinPacket() {}
|
|
||||||
PlayerJoinPacket(std::uint8_t playerID, const std::string& playerName) : m_PlayerID(playerID), m_PlayerName(playerName) {}
|
|
||||||
virtual ~PlayerJoinPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
std::uint8_t GetPlayerID() const { return m_PlayerID; }
|
|
||||||
const std::string& GetPlayerName() const { return m_PlayerName; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::PlayerJoin; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class PlayerLeavePacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::uint8_t m_PlayerID;
|
|
||||||
public:
|
|
||||||
PlayerLeavePacket() {}
|
|
||||||
PlayerLeavePacket(std::uint8_t playerID) : m_PlayerID(playerID) {}
|
|
||||||
virtual ~PlayerLeavePacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
std::uint8_t GetPlayerID() const { return m_PlayerID; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::PlayerLeave; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class ConnexionInfoPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::uint8_t m_ConnectionID;
|
|
||||||
public:
|
|
||||||
ConnexionInfoPacket() {}
|
|
||||||
ConnexionInfoPacket(std::uint8_t connectionID) : m_ConnectionID(connectionID) {}
|
|
||||||
virtual ~ConnexionInfoPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
std::uint8_t GetConnectionID() const { return m_ConnectionID; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::ConnectionInfo; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class SelectTeamPacket : public Packet {
|
|
||||||
private:
|
|
||||||
game::TeamColor m_SelectedTeam;
|
|
||||||
public:
|
|
||||||
SelectTeamPacket() {}
|
|
||||||
SelectTeamPacket(game::TeamColor selectedTeam) : m_SelectedTeam(selectedTeam) {}
|
|
||||||
virtual ~SelectTeamPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
game::TeamColor GetSelectedTeam() const { return m_SelectedTeam; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::SelectTeam; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class UpdatePlayerTeamPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::uint8_t m_PlayerID;
|
|
||||||
game::TeamColor m_SelectedTeam;
|
|
||||||
public:
|
|
||||||
UpdatePlayerTeamPacket() {}
|
|
||||||
UpdatePlayerTeamPacket(std::uint8_t playerID, game::TeamColor selectedTeam) : m_PlayerID(playerID), m_SelectedTeam(selectedTeam) {}
|
|
||||||
virtual ~UpdatePlayerTeamPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
game::TeamColor GetSelectedTeam() const { return m_SelectedTeam; }
|
|
||||||
std::uint8_t GetPlayerID() const { return m_PlayerID; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::UpdatePlayerTeam; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class DisconnectPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::string m_Reason; // only when sent from server
|
|
||||||
public:
|
|
||||||
DisconnectPacket() {}
|
|
||||||
DisconnectPacket(std::string reason) : m_Reason(reason) {}
|
|
||||||
virtual ~DisconnectPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
const std::string& GetReason() const { return m_Reason; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::Disconnect; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class ServerTpsPacket : public Packet {
|
|
||||||
private:
|
|
||||||
float m_TPS;
|
|
||||||
float m_MSPT;
|
|
||||||
std::uint64_t m_PacketSendTime; // used to calculate ping
|
|
||||||
public:
|
|
||||||
ServerTpsPacket() {}
|
|
||||||
ServerTpsPacket(float tps, float mspt, std::uint64_t sendTime) : m_TPS(tps), m_MSPT(mspt), m_PacketSendTime(sendTime) {}
|
|
||||||
virtual ~ServerTpsPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
float GetTPS() const { return m_TPS; }
|
|
||||||
float GetMSPT() const { return m_MSPT; }
|
|
||||||
std::uint64_t GetPacketSendTime() const { return m_PacketSendTime; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::ServerTps; }
|
|
||||||
};
|
|
||||||
|
|
||||||
struct MobSend { // represents a mob send
|
|
||||||
game::MobType mobType : 4;
|
|
||||||
game::MobLevel mobLevel : 4;
|
|
||||||
std::uint8_t mobCount; // the max is 12
|
|
||||||
};
|
|
||||||
|
|
||||||
class SendMobsPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::vector<MobSend> m_MobSends;
|
|
||||||
public:
|
|
||||||
SendMobsPacket() {}
|
|
||||||
SendMobsPacket(const std::vector<MobSend>& mobSends) : m_MobSends(mobSends) {}
|
|
||||||
virtual ~SendMobsPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
const std::vector<MobSend>& GetMobSends() const { return m_MobSends; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::SendMobs; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class SpawnMobPacket : public Packet {
|
|
||||||
private:
|
|
||||||
game::MobID m_MobID;
|
|
||||||
game::MobType m_MobType;
|
|
||||||
game::MobLevel m_MobLevel;
|
|
||||||
game::Direction m_MobDirection;
|
|
||||||
game::PlayerID m_Sender;
|
|
||||||
float m_MobX, m_MobY;
|
|
||||||
public:
|
|
||||||
SpawnMobPacket() {}
|
|
||||||
SpawnMobPacket(game::MobID id, game::MobType type, std::uint8_t level, game::PlayerID sender,
|
|
||||||
float x, float y, game::Direction dir) : m_MobID(id), m_MobType(type), m_MobLevel(level),
|
|
||||||
m_MobDirection(dir), m_Sender(sender), m_MobX(x), m_MobY(y) {
|
|
||||||
}
|
|
||||||
virtual ~SpawnMobPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
game::MobID GetMobID() const { return m_MobID; }
|
|
||||||
game::MobType GetMobType() const { return m_MobType; }
|
|
||||||
game::MobLevel GetMobLevel() const { return m_MobLevel; }
|
|
||||||
game::Direction GetMobDirection() const { return m_MobDirection; }
|
|
||||||
game::PlayerID GetSender() const { return m_Sender; }
|
|
||||||
float GetMobX() const { return m_MobX; }
|
|
||||||
float GetMobY() const { return m_MobY; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::SpawnMob; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class PlaceTowerPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::int32_t m_TowerX, m_TowerY;
|
|
||||||
game::TowerType m_TowerType;
|
|
||||||
public:
|
|
||||||
PlaceTowerPacket() {}
|
|
||||||
PlaceTowerPacket(std::int32_t x, std::int32_t y, game::TowerType type) :
|
|
||||||
m_TowerX(x), m_TowerY(y), m_TowerType(type) {
|
|
||||||
}
|
|
||||||
virtual ~PlaceTowerPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
std::int32_t GetTowerX() const { return m_TowerX; }
|
|
||||||
std::int32_t GetTowerY() const { return m_TowerY; }
|
|
||||||
game::TowerType GetTowerType() const { return m_TowerType; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::PlaceTower; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class WorldAddTowerPacket : public Packet {
|
|
||||||
private:
|
|
||||||
game::TowerID m_TowerID;
|
|
||||||
std::int32_t m_TowerX, m_TowerY;
|
|
||||||
game::TowerType m_TowerType;
|
|
||||||
game::PlayerID m_Builder;
|
|
||||||
public:
|
|
||||||
WorldAddTowerPacket() {}
|
|
||||||
WorldAddTowerPacket(game::TowerID id, std::int32_t x, std::int32_t y, game::TowerType type, game::PlayerID player) :
|
|
||||||
m_TowerID(id), m_TowerX(x), m_TowerY(y), m_TowerType(type), m_Builder(player) {
|
|
||||||
}
|
|
||||||
virtual ~WorldAddTowerPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
game::TowerID GetTowerID() const { return m_TowerID; }
|
|
||||||
std::int32_t GetTowerX() const { return m_TowerX; }
|
|
||||||
std::int32_t GetTowerY() const { return m_TowerY; }
|
|
||||||
game::TowerType GetTowerType() const { return m_TowerType; }
|
|
||||||
game::PlayerID GetBuilder() const { return m_Builder; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::WorldAddTower; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class RemoveTowerPacket : public Packet {
|
|
||||||
private:
|
|
||||||
game::TowerID m_TowerID;
|
|
||||||
public:
|
|
||||||
RemoveTowerPacket() {}
|
|
||||||
RemoveTowerPacket(game::TowerID id) : m_TowerID(id) {}
|
|
||||||
virtual ~RemoveTowerPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
game::TowerID GetTowerID() const { return m_TowerID; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::RemoveTower; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class UpgradeTowerPacket : public Packet {
|
|
||||||
private:
|
|
||||||
game::TowerID m_TowerID;
|
|
||||||
game::TowerLevel m_TowerLevel;
|
|
||||||
public:
|
|
||||||
UpgradeTowerPacket() {}
|
|
||||||
UpgradeTowerPacket(game::TowerID tower, game::TowerLevel level) : m_TowerID(tower), m_TowerLevel(level) {}
|
|
||||||
virtual ~UpgradeTowerPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
game::TowerID GetTowerID() const { return m_TowerID; }
|
|
||||||
game::TowerLevel GetTowerLevel() const { return m_TowerLevel; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::UpgradeTower; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class MobState {
|
|
||||||
using Point = utils::shape::Point;
|
|
||||||
private:
|
|
||||||
game::MobID m_MobID;
|
|
||||||
Point m_MobPosition;
|
|
||||||
float m_MobLife;
|
|
||||||
game::Direction m_MobDirection;
|
|
||||||
public:
|
|
||||||
MobState() {}
|
|
||||||
MobState(game::MobID id, const Point& position, float life, game::Direction direction) :
|
|
||||||
m_MobID(id), m_MobPosition(position), m_MobLife(life), m_MobDirection(direction) {
|
|
||||||
}
|
|
||||||
|
|
||||||
game::MobID GetMobId() const { return m_MobID; }
|
|
||||||
Point GetMobPosition() const { return m_MobPosition; }
|
|
||||||
float GetMobLife() const { return m_MobLife; }
|
|
||||||
game::Direction GetMobDirection() const { return m_MobDirection; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class UpdateMobStatesPacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::vector<MobState> m_MobStates;
|
|
||||||
public:
|
|
||||||
UpdateMobStatesPacket() {}
|
|
||||||
virtual ~UpdateMobStatesPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
void addMobState(MobState mobState) { m_MobStates.push_back(mobState); }
|
|
||||||
|
|
||||||
const std::vector<MobState>& GetMobStates() const { return m_MobStates; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::UpdateMobStates; }
|
|
||||||
};
|
|
||||||
|
|
||||||
class UpdateCastleLifePacket : public Packet {
|
|
||||||
private:
|
|
||||||
std::uint16_t m_CastleLife;
|
|
||||||
game::TeamColor m_Team;
|
|
||||||
public:
|
|
||||||
UpdateCastleLifePacket() {}
|
|
||||||
UpdateCastleLifePacket(std::uint16_t life, game::TeamColor team) : m_CastleLife(life), m_Team(team) {}
|
|
||||||
virtual ~UpdateCastleLifePacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
std::uint16_t GetCastleLife() const { return m_CastleLife; }
|
|
||||||
game::TeamColor GetTeamColor() const { return m_Team; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::UpdateCastleLife; }
|
|
||||||
};
|
|
||||||
|
|
||||||
enum class ItemType : std::uint8_t {
|
|
||||||
// Upgrades
|
|
||||||
ClickerUpgrade,
|
|
||||||
GoldPerSecUpgrade,
|
|
||||||
|
|
||||||
// Items
|
|
||||||
};
|
|
||||||
|
|
||||||
/** Packet used by the client to buy items or upgrades
|
|
||||||
Packet used by the server to confirm transaction */
|
|
||||||
class PlayerBuyItemPacket : public Packet {
|
|
||||||
private:
|
|
||||||
ItemType m_ItemType;
|
|
||||||
std::uint8_t m_Count;
|
|
||||||
public:
|
|
||||||
PlayerBuyItemPacket() {}
|
|
||||||
PlayerBuyItemPacket(ItemType itemType, std::uint8_t count) : m_ItemType(itemType), m_Count(count) {}
|
|
||||||
virtual ~PlayerBuyItemPacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
ItemType GetItemType() const { return m_ItemType; }
|
|
||||||
std::uint8_t GetCount() const { return m_Count; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::PlayerBuyItem; }
|
|
||||||
};
|
|
||||||
|
|
||||||
/** Packet used by the client to buy mob upgrades
|
|
||||||
Packet used by the server to confirm transaction */
|
|
||||||
class PlayerBuyMobUpgradePacket : public Packet {
|
|
||||||
private:
|
|
||||||
game::MobType m_MobType;
|
|
||||||
std::uint8_t m_MobLevel;
|
|
||||||
public:
|
|
||||||
PlayerBuyMobUpgradePacket() {}
|
|
||||||
PlayerBuyMobUpgradePacket(game::MobType mobType, std::uint8_t level) : m_MobType(mobType), m_MobLevel(level) {}
|
|
||||||
virtual ~PlayerBuyMobUpgradePacket() {}
|
|
||||||
|
|
||||||
virtual DataBuffer Serialize(bool packetID = true) const;
|
|
||||||
virtual void Deserialize(DataBuffer& data);
|
|
||||||
virtual void Dispatch(PacketHandler* handler) const;
|
|
||||||
|
|
||||||
game::MobType GetMobType() const { return m_MobType; }
|
|
||||||
std::uint8_t GetLevel() const { return m_MobLevel; }
|
|
||||||
|
|
||||||
virtual PacketType GetType() const { return PacketType::PlayerBuyMobUpgrade; }
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace protocol
|
} // namespace protocol
|
||||||
} // namespace td
|
} // namespace td
|
||||||
26
include/protocol/packets/ConnectionInfoPacket.h
Normal file
26
include/protocol/packets/ConnectionInfoPacket.h
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class ConnexionInfoPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::uint8_t m_ConnectionID;
|
||||||
|
public:
|
||||||
|
ConnexionInfoPacket() {}
|
||||||
|
ConnexionInfoPacket(std::uint8_t connectionID) : m_ConnectionID(connectionID) {}
|
||||||
|
virtual ~ConnexionInfoPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
std::uint8_t GetConnectionID() const { return m_ConnectionID; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::ConnectionInfo; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
26
include/protocol/packets/DisconnectPacket.h
Normal file
26
include/protocol/packets/DisconnectPacket.h
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class DisconnectPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::string m_Reason; // only when sent from server
|
||||||
|
public:
|
||||||
|
DisconnectPacket() {}
|
||||||
|
DisconnectPacket(std::string reason) : m_Reason(reason) {}
|
||||||
|
virtual ~DisconnectPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
const std::string& GetReason() const { return m_Reason; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::Disconnect; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
26
include/protocol/packets/KeepAlivePacket.h
Normal file
26
include/protocol/packets/KeepAlivePacket.h
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class KeepAlivePacket : public Packet{
|
||||||
|
private:
|
||||||
|
std::uint64_t m_AliveID;
|
||||||
|
public:
|
||||||
|
KeepAlivePacket() {}
|
||||||
|
KeepAlivePacket(std::uint64_t aliveID) : m_AliveID(aliveID) {}
|
||||||
|
virtual ~KeepAlivePacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
std::uint64_t GetAliveID() const { return m_AliveID; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::KeepAlive; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
32
include/protocol/packets/PlaceTowerPacket.h
Normal file
32
include/protocol/packets/PlaceTowerPacket.h
Normal file
@@ -0,0 +1,32 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class PlaceTowerPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::int32_t m_TowerX, m_TowerY;
|
||||||
|
game::TowerType m_TowerType;
|
||||||
|
public:
|
||||||
|
PlaceTowerPacket() {}
|
||||||
|
PlaceTowerPacket(std::int32_t x, std::int32_t y, game::TowerType type) :
|
||||||
|
m_TowerX(x), m_TowerY(y), m_TowerType(type) {
|
||||||
|
}
|
||||||
|
virtual ~PlaceTowerPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
std::int32_t GetTowerX() const { return m_TowerX; }
|
||||||
|
std::int32_t GetTowerY() const { return m_TowerY; }
|
||||||
|
game::TowerType GetTowerType() const { return m_TowerType; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::PlaceTower; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
38
include/protocol/packets/PlayerBuyItemPacket.h
Normal file
38
include/protocol/packets/PlayerBuyItemPacket.h
Normal file
@@ -0,0 +1,38 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
enum class ItemType : std::uint8_t {
|
||||||
|
// Upgrades
|
||||||
|
ClickerUpgrade,
|
||||||
|
GoldPerSecUpgrade,
|
||||||
|
|
||||||
|
// Items
|
||||||
|
};
|
||||||
|
|
||||||
|
/** Packet used by the client to buy items or upgrades
|
||||||
|
Packet used by the server to confirm transaction */
|
||||||
|
class PlayerBuyItemPacket : public Packet {
|
||||||
|
private:
|
||||||
|
ItemType m_ItemType;
|
||||||
|
std::uint8_t m_Count;
|
||||||
|
public:
|
||||||
|
PlayerBuyItemPacket() {}
|
||||||
|
PlayerBuyItemPacket(ItemType itemType, std::uint8_t count) : m_ItemType(itemType), m_Count(count) {}
|
||||||
|
virtual ~PlayerBuyItemPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
ItemType GetItemType() const { return m_ItemType; }
|
||||||
|
std::uint8_t GetCount() const { return m_Count; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::PlayerBuyItem; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
31
include/protocol/packets/PlayerBuyMobUpgradePacket.h
Normal file
31
include/protocol/packets/PlayerBuyMobUpgradePacket.h
Normal file
@@ -0,0 +1,31 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
/** Packet used by the client to buy mob upgrades
|
||||||
|
Packet used by the server to confirm transaction */
|
||||||
|
class PlayerBuyMobUpgradePacket : public Packet {
|
||||||
|
private:
|
||||||
|
game::MobType m_MobType;
|
||||||
|
std::uint8_t m_MobLevel;
|
||||||
|
public:
|
||||||
|
PlayerBuyMobUpgradePacket() {}
|
||||||
|
PlayerBuyMobUpgradePacket(game::MobType mobType, std::uint8_t level) : m_MobType(mobType), m_MobLevel(level) {}
|
||||||
|
virtual ~PlayerBuyMobUpgradePacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
game::MobType GetMobType() const { return m_MobType; }
|
||||||
|
std::uint8_t GetLevel() const { return m_MobLevel; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::PlayerBuyMobUpgrade; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
28
include/protocol/packets/PlayerJoinPacket.h
Normal file
28
include/protocol/packets/PlayerJoinPacket.h
Normal file
@@ -0,0 +1,28 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class PlayerJoinPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::uint8_t m_PlayerID;
|
||||||
|
std::string m_PlayerName;
|
||||||
|
public:
|
||||||
|
PlayerJoinPacket() {}
|
||||||
|
PlayerJoinPacket(std::uint8_t playerID, const std::string& playerName) : m_PlayerID(playerID), m_PlayerName(playerName) {}
|
||||||
|
virtual ~PlayerJoinPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
std::uint8_t GetPlayerID() const { return m_PlayerID; }
|
||||||
|
const std::string& GetPlayerName() const { return m_PlayerName; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::PlayerJoin; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
26
include/protocol/packets/PlayerLeavePacket.h
Normal file
26
include/protocol/packets/PlayerLeavePacket.h
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class PlayerLeavePacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::uint8_t m_PlayerID;
|
||||||
|
public:
|
||||||
|
PlayerLeavePacket() {}
|
||||||
|
PlayerLeavePacket(std::uint8_t playerID) : m_PlayerID(playerID) {}
|
||||||
|
virtual ~PlayerLeavePacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
std::uint8_t GetPlayerID() const { return m_PlayerID; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::PlayerLeave; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
32
include/protocol/packets/PlayerListPacket.h
Normal file
32
include/protocol/packets/PlayerListPacket.h
Normal file
@@ -0,0 +1,32 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
struct PlayerInfo {
|
||||||
|
std::string name;
|
||||||
|
game::TeamColor team;
|
||||||
|
};
|
||||||
|
|
||||||
|
class PlayerListPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::map<std::uint8_t, PlayerInfo> m_Players;
|
||||||
|
public:
|
||||||
|
PlayerListPacket() {}
|
||||||
|
PlayerListPacket(std::map<std::uint8_t, PlayerInfo> players) : m_Players(players) {}
|
||||||
|
virtual ~PlayerListPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
const std::map<std::uint8_t, PlayerInfo>& GetPlayers() const { return m_Players; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::PlayerList; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
26
include/protocol/packets/PlayerLoginPacket.h
Normal file
26
include/protocol/packets/PlayerLoginPacket.h
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class PlayerLoginPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::string m_PlayerName;
|
||||||
|
public:
|
||||||
|
PlayerLoginPacket() {}
|
||||||
|
PlayerLoginPacket(std::string playerName) : m_PlayerName(playerName) {}
|
||||||
|
virtual ~PlayerLoginPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::PlayerLogin; }
|
||||||
|
|
||||||
|
const std::string& GetPlayerName() const { return m_PlayerName; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
27
include/protocol/packets/RemoveTowerPacket.h
Normal file
27
include/protocol/packets/RemoveTowerPacket.h
Normal file
@@ -0,0 +1,27 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class RemoveTowerPacket : public DelayedPacket {
|
||||||
|
private:
|
||||||
|
game::TowerID m_TowerID;
|
||||||
|
public:
|
||||||
|
RemoveTowerPacket() {}
|
||||||
|
RemoveTowerPacket(game::TowerID id) : m_TowerID(id) {}
|
||||||
|
virtual ~RemoveTowerPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
game::TowerID GetTowerID() const { return m_TowerID; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::RemoveTower; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
27
include/protocol/packets/SelectTeamPacket.h
Normal file
27
include/protocol/packets/SelectTeamPacket.h
Normal file
@@ -0,0 +1,27 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class SelectTeamPacket : public Packet {
|
||||||
|
private:
|
||||||
|
game::TeamColor m_SelectedTeam;
|
||||||
|
public:
|
||||||
|
SelectTeamPacket() {}
|
||||||
|
SelectTeamPacket(game::TeamColor selectedTeam) : m_SelectedTeam(selectedTeam) {}
|
||||||
|
virtual ~SelectTeamPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
game::TeamColor GetSelectedTeam() const { return m_SelectedTeam; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::SelectTeam; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
33
include/protocol/packets/SendMobsPacket.h
Normal file
33
include/protocol/packets/SendMobsPacket.h
Normal file
@@ -0,0 +1,33 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
struct MobSend { // represents a mob send
|
||||||
|
game::MobType mobType : 4;
|
||||||
|
game::MobLevel mobLevel : 4;
|
||||||
|
std::uint8_t mobCount; // the max is 12
|
||||||
|
};
|
||||||
|
|
||||||
|
class SendMobsPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::vector<MobSend> m_MobSends;
|
||||||
|
public:
|
||||||
|
SendMobsPacket() {}
|
||||||
|
SendMobsPacket(const std::vector<MobSend>& mobSends) : m_MobSends(mobSends) {}
|
||||||
|
virtual ~SendMobsPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
const std::vector<MobSend>& GetMobSends() const { return m_MobSends; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::SendMobs; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
30
include/protocol/packets/ServerTpsPacket.h
Normal file
30
include/protocol/packets/ServerTpsPacket.h
Normal file
@@ -0,0 +1,30 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class ServerTpsPacket : public Packet {
|
||||||
|
private:
|
||||||
|
float m_TPS;
|
||||||
|
float m_MSPT;
|
||||||
|
std::uint64_t m_PacketSendTime; // used to calculate ping
|
||||||
|
public:
|
||||||
|
ServerTpsPacket() {}
|
||||||
|
ServerTpsPacket(float tps, float mspt, std::uint64_t sendTime) : m_TPS(tps), m_MSPT(mspt), m_PacketSendTime(sendTime) {}
|
||||||
|
virtual ~ServerTpsPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
float GetTPS() const { return m_TPS; }
|
||||||
|
float GetMSPT() const { return m_MSPT; }
|
||||||
|
std::uint64_t GetPacketSendTime() const { return m_PacketSendTime; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::ServerTps; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
41
include/protocol/packets/SpawnMobPacket.h
Normal file
41
include/protocol/packets/SpawnMobPacket.h
Normal file
@@ -0,0 +1,41 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class SpawnMobPacket : public Packet {
|
||||||
|
private:
|
||||||
|
game::MobID m_MobID;
|
||||||
|
game::MobType m_MobType;
|
||||||
|
game::MobLevel m_MobLevel;
|
||||||
|
game::Direction m_MobDirection;
|
||||||
|
game::PlayerID m_Sender;
|
||||||
|
float m_MobX, m_MobY;
|
||||||
|
public:
|
||||||
|
SpawnMobPacket() {}
|
||||||
|
SpawnMobPacket(game::MobID id, game::MobType type, std::uint8_t level, game::PlayerID sender,
|
||||||
|
float x, float y, game::Direction dir) : m_MobID(id), m_MobType(type), m_MobLevel(level),
|
||||||
|
m_MobDirection(dir), m_Sender(sender), m_MobX(x), m_MobY(y) {
|
||||||
|
}
|
||||||
|
virtual ~SpawnMobPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
game::MobID GetMobID() const { return m_MobID; }
|
||||||
|
game::MobType GetMobType() const { return m_MobType; }
|
||||||
|
game::MobLevel GetMobLevel() const { return m_MobLevel; }
|
||||||
|
game::Direction GetMobDirection() const { return m_MobDirection; }
|
||||||
|
game::PlayerID GetSender() const { return m_Sender; }
|
||||||
|
float GetMobX() const { return m_MobX; }
|
||||||
|
float GetMobY() const { return m_MobY; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::SpawnMob; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
29
include/protocol/packets/UpdateCastleLifePacket.h
Normal file
29
include/protocol/packets/UpdateCastleLifePacket.h
Normal file
@@ -0,0 +1,29 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class UpdateCastleLifePacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::uint16_t m_CastleLife;
|
||||||
|
game::TeamColor m_Team;
|
||||||
|
public:
|
||||||
|
UpdateCastleLifePacket() {}
|
||||||
|
UpdateCastleLifePacket(std::uint16_t life, game::TeamColor team) : m_CastleLife(life), m_Team(team) {}
|
||||||
|
virtual ~UpdateCastleLifePacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
std::uint16_t GetCastleLife() const { return m_CastleLife; }
|
||||||
|
game::TeamColor GetTeamColor() const { return m_Team; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::UpdateCastleLife; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
26
include/protocol/packets/UpdateExpPacket.h
Normal file
26
include/protocol/packets/UpdateExpPacket.h
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class UpdateExpPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::uint32_t m_NewAmount;
|
||||||
|
public:
|
||||||
|
UpdateExpPacket() {}
|
||||||
|
UpdateExpPacket(std::uint32_t newAmount) : m_NewAmount(newAmount) {}
|
||||||
|
virtual ~UpdateExpPacket() {}
|
||||||
|
|
||||||
|
std::uint32_t GetExp() const { return m_NewAmount; }
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::UpdateEXP; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
27
include/protocol/packets/UpdateGameStatePacket.h
Normal file
27
include/protocol/packets/UpdateGameStatePacket.h
Normal file
@@ -0,0 +1,27 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class UpdateGameStatePacket : public Packet {
|
||||||
|
private:
|
||||||
|
game::GameState m_GameState;
|
||||||
|
public:
|
||||||
|
UpdateGameStatePacket() {}
|
||||||
|
UpdateGameStatePacket(game::GameState gameState) : m_GameState(gameState) {}
|
||||||
|
virtual ~UpdateGameStatePacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
game::GameState GetGameState() const { return m_GameState; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::UpdateGameState; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
26
include/protocol/packets/UpdateLobbyTimePacket.h
Normal file
26
include/protocol/packets/UpdateLobbyTimePacket.h
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class UpdateLobbyTimePacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::uint64_t m_StartTime; // unix millis
|
||||||
|
public:
|
||||||
|
UpdateLobbyTimePacket() {}
|
||||||
|
UpdateLobbyTimePacket(std::uint64_t startTime) : m_StartTime(startTime) {}
|
||||||
|
virtual ~UpdateLobbyTimePacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
std::uint64_t GetStartTime() const { return m_StartTime; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::UpdateLobbyTime; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
47
include/protocol/packets/UpdateMobStatesPacket.h
Normal file
47
include/protocol/packets/UpdateMobStatesPacket.h
Normal file
@@ -0,0 +1,47 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class MobState {
|
||||||
|
using Point = utils::shape::Point;
|
||||||
|
private:
|
||||||
|
game::MobID m_MobID;
|
||||||
|
Point m_MobPosition;
|
||||||
|
float m_MobLife;
|
||||||
|
game::Direction m_MobDirection;
|
||||||
|
public:
|
||||||
|
MobState() {}
|
||||||
|
MobState(game::MobID id, const Point& position, float life, game::Direction direction) :
|
||||||
|
m_MobID(id), m_MobPosition(position), m_MobLife(life), m_MobDirection(direction) {
|
||||||
|
}
|
||||||
|
|
||||||
|
game::MobID GetMobId() const { return m_MobID; }
|
||||||
|
Point GetMobPosition() const { return m_MobPosition; }
|
||||||
|
float GetMobLife() const { return m_MobLife; }
|
||||||
|
game::Direction GetMobDirection() const { return m_MobDirection; }
|
||||||
|
};
|
||||||
|
|
||||||
|
class UpdateMobStatesPacket : public DelayedPacket {
|
||||||
|
private:
|
||||||
|
std::vector<MobState> m_MobStates;
|
||||||
|
public:
|
||||||
|
UpdateMobStatesPacket() {}
|
||||||
|
virtual ~UpdateMobStatesPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
void addMobState(MobState mobState) { m_MobStates.push_back(mobState); }
|
||||||
|
|
||||||
|
const std::vector<MobState>& GetMobStates() const { return m_MobStates; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::UpdateMobStates; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
26
include/protocol/packets/UpdateMoneyPacket.h
Normal file
26
include/protocol/packets/UpdateMoneyPacket.h
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class UpdateMoneyPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::uint32_t m_NewAmount;
|
||||||
|
public:
|
||||||
|
UpdateMoneyPacket() {}
|
||||||
|
UpdateMoneyPacket(std::uint32_t newAmount) : m_NewAmount(newAmount) {}
|
||||||
|
virtual ~UpdateMoneyPacket() {}
|
||||||
|
|
||||||
|
std::uint32_t GetGold() const { return m_NewAmount; }
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::UpdateMoney; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
29
include/protocol/packets/UpdatePlayerTeamPacket.h
Normal file
29
include/protocol/packets/UpdatePlayerTeamPacket.h
Normal file
@@ -0,0 +1,29 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class UpdatePlayerTeamPacket : public Packet {
|
||||||
|
private:
|
||||||
|
std::uint8_t m_PlayerID;
|
||||||
|
game::TeamColor m_SelectedTeam;
|
||||||
|
public:
|
||||||
|
UpdatePlayerTeamPacket() {}
|
||||||
|
UpdatePlayerTeamPacket(std::uint8_t playerID, game::TeamColor selectedTeam) : m_PlayerID(playerID), m_SelectedTeam(selectedTeam) {}
|
||||||
|
virtual ~UpdatePlayerTeamPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
game::TeamColor GetSelectedTeam() const { return m_SelectedTeam; }
|
||||||
|
std::uint8_t GetPlayerID() const { return m_PlayerID; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::UpdatePlayerTeam; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
29
include/protocol/packets/UpgradeTowerPacket.h
Normal file
29
include/protocol/packets/UpgradeTowerPacket.h
Normal file
@@ -0,0 +1,29 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class UpgradeTowerPacket : public DelayedPacket {
|
||||||
|
private:
|
||||||
|
game::TowerID m_TowerID;
|
||||||
|
game::TowerLevel m_TowerLevel;
|
||||||
|
public:
|
||||||
|
UpgradeTowerPacket() {}
|
||||||
|
UpgradeTowerPacket(game::TowerID tower, game::TowerLevel level) : m_TowerID(tower), m_TowerLevel(level) {}
|
||||||
|
virtual ~UpgradeTowerPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
game::TowerID GetTowerID() const { return m_TowerID; }
|
||||||
|
game::TowerLevel GetTowerLevel() const { return m_TowerLevel; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::UpgradeTower; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
36
include/protocol/packets/WorldAddTowerPacket.h
Normal file
36
include/protocol/packets/WorldAddTowerPacket.h
Normal file
@@ -0,0 +1,36 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
class WorldAddTowerPacket : public DelayedPacket {
|
||||||
|
private:
|
||||||
|
game::TowerID m_TowerID;
|
||||||
|
std::int32_t m_TowerX, m_TowerY;
|
||||||
|
game::TowerType m_TowerType;
|
||||||
|
game::PlayerID m_Builder;
|
||||||
|
public:
|
||||||
|
WorldAddTowerPacket() {}
|
||||||
|
WorldAddTowerPacket(game::TowerID id, std::int32_t x, std::int32_t y, game::TowerType type, game::PlayerID player) :
|
||||||
|
m_TowerID(id), m_TowerX(x), m_TowerY(y), m_TowerType(type), m_Builder(player) {
|
||||||
|
}
|
||||||
|
virtual ~WorldAddTowerPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
game::TowerID GetTowerID() const { return m_TowerID; }
|
||||||
|
std::int32_t GetTowerX() const { return m_TowerX; }
|
||||||
|
std::int32_t GetTowerY() const { return m_TowerY; }
|
||||||
|
game::TowerType GetTowerType() const { return m_TowerType; }
|
||||||
|
game::PlayerID GetBuilder() const { return m_Builder; }
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::WorldAddTower; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
60
include/protocol/packets/WorldBeginDataPacket.h
Normal file
60
include/protocol/packets/WorldBeginDataPacket.h
Normal file
@@ -0,0 +1,60 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
struct WorldHeader {
|
||||||
|
game::TowerTileColorPalette m_TowerPlacePalette;
|
||||||
|
Color m_WalkablePalette;
|
||||||
|
std::vector<Color> m_DecorationPalette;
|
||||||
|
Color m_Background;
|
||||||
|
|
||||||
|
game::SpawnColorPalette m_SpawnColorPalette;
|
||||||
|
|
||||||
|
game::TilePalette m_TilePalette;
|
||||||
|
|
||||||
|
game::Spawn m_RedSpawn, m_BlueSpawn;
|
||||||
|
game::TeamCastle m_RedCastle, m_BlueCastle;
|
||||||
|
|
||||||
|
const game::World* m_World;
|
||||||
|
};
|
||||||
|
|
||||||
|
class WorldBeginDataPacket : public Packet {
|
||||||
|
private:
|
||||||
|
WorldHeader m_Header;
|
||||||
|
public:
|
||||||
|
WorldBeginDataPacket() {}
|
||||||
|
WorldBeginDataPacket(const game::World* world) {
|
||||||
|
m_Header.m_World = world;
|
||||||
|
}
|
||||||
|
virtual ~WorldBeginDataPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::WorldBeginData; }
|
||||||
|
|
||||||
|
const game::TowerTileColorPalette& GetTowerTilePalette() const { return m_Header.m_TowerPlacePalette; }
|
||||||
|
const Color& GetWalkableTileColor() const { return m_Header.m_WalkablePalette; }
|
||||||
|
const std::vector<Color>& GetDecorationPalette() const { return m_Header.m_DecorationPalette; }
|
||||||
|
const Color& GetBackgroundColor() const { return m_Header.m_Background; }
|
||||||
|
|
||||||
|
const game::Spawn& GetRedSpawn() const { return m_Header.m_RedSpawn; }
|
||||||
|
const game::Spawn& GetBlueSpawn() const { return m_Header.m_BlueSpawn; }
|
||||||
|
|
||||||
|
const game::SpawnColorPalette& GetSpawnPalette() const { return m_Header.m_SpawnColorPalette; }
|
||||||
|
|
||||||
|
const game::TeamCastle& GetRedCastle() const { return m_Header.m_RedCastle; }
|
||||||
|
const game::TeamCastle& GetBlueCastle() const { return m_Header.m_BlueCastle; }
|
||||||
|
|
||||||
|
const game::TilePalette GetTilePalette() const { return m_Header.m_TilePalette; }
|
||||||
|
|
||||||
|
void setWorldHeader(const WorldHeader& header) { m_Header = header; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
36
include/protocol/packets/WorldDataPacket.h
Normal file
36
include/protocol/packets/WorldDataPacket.h
Normal file
@@ -0,0 +1,36 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "protocol/Protocol.h"
|
||||||
|
#include "game/BaseGame.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace protocol {
|
||||||
|
|
||||||
|
struct WorldData {
|
||||||
|
std::unordered_map<game::ChunkCoord, game::ChunkPtr> m_Chunks;
|
||||||
|
};
|
||||||
|
|
||||||
|
class WorldDataPacket : public Packet {
|
||||||
|
private:
|
||||||
|
WorldData m_WorldData;
|
||||||
|
|
||||||
|
const game::World* m_World;
|
||||||
|
public:
|
||||||
|
WorldDataPacket() {}
|
||||||
|
WorldDataPacket(const game::World* world) : m_World(world) {}
|
||||||
|
virtual ~WorldDataPacket() {}
|
||||||
|
|
||||||
|
virtual DataBuffer Serialize(bool packetID = true) const;
|
||||||
|
virtual void Deserialize(DataBuffer& data);
|
||||||
|
virtual void Dispatch(PacketHandler* handler) const;
|
||||||
|
|
||||||
|
virtual PacketType GetType() const { return PacketType::WorldData; }
|
||||||
|
|
||||||
|
const std::unordered_map<game::ChunkCoord, game::ChunkPtr>& GetChunks() const { return m_WorldData.m_Chunks; }
|
||||||
|
|
||||||
|
DataBuffer SerializeCustom() const; // allow serialisation with invalid World member
|
||||||
|
void SetWorldData(const WorldData& worldData) { m_WorldData = worldData; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace protocol
|
||||||
|
} // namespace td
|
||||||
@@ -9,24 +9,39 @@
|
|||||||
namespace td {
|
namespace td {
|
||||||
namespace render {
|
namespace render {
|
||||||
|
|
||||||
|
struct Camera {
|
||||||
|
Mat4f viewMatrix;
|
||||||
|
Mat4f projectionMatrix;
|
||||||
|
Mat4f InvViewMatrix;
|
||||||
|
Mat4f InvProjectionMatrix;
|
||||||
|
|
||||||
|
float CamDistance = 25.0f;
|
||||||
|
Vec3f CamPos {0, CamDistance, 0};
|
||||||
|
Vec2f CamLook {};
|
||||||
|
|
||||||
|
float m_Yaw = -PI / 2.0f;
|
||||||
|
float m_Pitch = -PI / 2.0f + 0.0000001f;
|
||||||
|
};
|
||||||
|
|
||||||
class Renderer {
|
class Renderer {
|
||||||
public:
|
public:
|
||||||
static constexpr float m_AnimationSpeed = 2.0f;
|
static constexpr float m_AnimationSpeed = 2.0f;
|
||||||
|
static constexpr float m_MouseSensitivity = 200.0f;
|
||||||
|
|
||||||
struct Model {
|
struct Model {
|
||||||
GL::VertexArray* vao;
|
GL::VertexArray* vao;
|
||||||
Vec2f positon;
|
Vec3f positon;
|
||||||
Vec3f color = { 1, 1, 1 };
|
Vec3f color = { 1, 1, 1 };
|
||||||
};
|
};
|
||||||
private:
|
private:
|
||||||
std::unique_ptr<shader::WorldShader> m_WorldShader;
|
std::unique_ptr<shader::WorldShader> m_WorldShader;
|
||||||
std::unique_ptr<shader::EntityShader> m_EntityShader;
|
std::unique_ptr<shader::EntityShader> m_EntityShader;
|
||||||
|
|
||||||
|
Vec2i m_WindowSize;
|
||||||
|
|
||||||
Vec3f m_BackgroundColor;
|
Vec3f m_BackgroundColor;
|
||||||
|
|
||||||
bool m_IsometricView = true;
|
Camera m_Camera {};
|
||||||
float m_IsometricShade = m_IsometricView;
|
|
||||||
Vec2f m_CamPos{};
|
|
||||||
public:
|
public:
|
||||||
Renderer();
|
Renderer();
|
||||||
~Renderer();
|
~Renderer();
|
||||||
@@ -39,18 +54,17 @@ public:
|
|||||||
void RenderVAO(const GL::VertexArray& vao);
|
void RenderVAO(const GL::VertexArray& vao);
|
||||||
void RenderModel(const Model& model);
|
void RenderModel(const Model& model);
|
||||||
|
|
||||||
void SetZoom(float zoom);
|
void AddZoom(float zoom);
|
||||||
void SetCamMovement(const Vec2f& mov);
|
void SetCamAngularMovement(const Vec2f& mov);
|
||||||
void SetCamPos(const Vec2f& newPos);
|
void SetCamMovement(const Vec2f& lastCursorPos, const Vec2f& currentCursorPos);
|
||||||
void SetIsometricView(bool isometric); // false = 2D true = Isometric
|
void SetCamLook(const Vec2f& worldPos);
|
||||||
|
|
||||||
void SetBackgroundColor(const Vec3f& color) { m_BackgroundColor = color; }
|
void SetBackgroundColor(const Vec3f& color) { m_BackgroundColor = color; }
|
||||||
|
|
||||||
Vec2f GetCursorWorldPos(const Vec2f& cursorPos, float aspectRatio, float zoom, float windowWidth, float windowHeight);
|
Vec2f GetCursorWorldPos(const Vec2f& cursorPos, float windowWidth, float windowHeight);
|
||||||
private:
|
private:
|
||||||
void UpdateIsometricView();
|
|
||||||
void UpdateIsometricFade();
|
|
||||||
void InitShaders();
|
void InitShaders();
|
||||||
|
void SetCamPos(const Vec3f& newPos);
|
||||||
};
|
};
|
||||||
|
|
||||||
} // namespace render
|
} // namespace render
|
||||||
|
|||||||
@@ -10,8 +10,6 @@
|
|||||||
#include "render/gui/MobTooltip.h"
|
#include "render/gui/MobTooltip.h"
|
||||||
#include "render/gui/CastleTooltip.h"
|
#include "render/gui/CastleTooltip.h"
|
||||||
|
|
||||||
#include "render/gui/imgui/imgui.h"
|
|
||||||
|
|
||||||
namespace td {
|
namespace td {
|
||||||
|
|
||||||
namespace client {
|
namespace client {
|
||||||
@@ -20,7 +18,6 @@ class ClientGame;
|
|||||||
|
|
||||||
} // namespace client
|
} // namespace client
|
||||||
|
|
||||||
|
|
||||||
namespace render {
|
namespace render {
|
||||||
|
|
||||||
class WorldRenderer : public game::WorldListener {
|
class WorldRenderer : public game::WorldListener {
|
||||||
@@ -48,14 +45,12 @@ public:
|
|||||||
|
|
||||||
void LoadModels();
|
void LoadModels();
|
||||||
|
|
||||||
static ImVec4 GetImGuiTeamColor(game::TeamColor color);
|
|
||||||
|
|
||||||
void Update();
|
void Update();
|
||||||
void Render();
|
void Render();
|
||||||
|
|
||||||
void SetCamPos(float camX, float camY);
|
void SetCamPos(float camX, float camY);
|
||||||
|
|
||||||
void MoveCam(float relativeX, float relativeY, float aspectRatio);
|
void MoveCam(float relativeX, float relativeY);
|
||||||
void ChangeZoom(float zoom);
|
void ChangeZoom(float zoom);
|
||||||
|
|
||||||
// WorldListener
|
// WorldListener
|
||||||
|
|||||||
13
include/render/gui/ImGuiTeamColor.h
Normal file
13
include/render/gui/ImGuiTeamColor.h
Normal file
@@ -0,0 +1,13 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "render/gui/imgui/imgui.h"
|
||||||
|
#include "game/Team.h"
|
||||||
|
|
||||||
|
namespace td {
|
||||||
|
namespace render {
|
||||||
|
|
||||||
|
ImVec4 GetImGuiTeamColor(game::TeamColor color);
|
||||||
|
|
||||||
|
} // namespace render
|
||||||
|
} // namespace td
|
||||||
|
|
||||||
@@ -6,13 +6,10 @@ namespace td {
|
|||||||
namespace shader {
|
namespace shader {
|
||||||
|
|
||||||
class EntityShader : public ShaderProgram {
|
class EntityShader : public ShaderProgram {
|
||||||
|
|
||||||
private:
|
private:
|
||||||
unsigned int m_LocationCam = 0;
|
unsigned int m_LocationProjectionMatrix = 0;
|
||||||
unsigned int m_LocationZoom = 0;
|
unsigned int m_LocationViewMatrix = 0;
|
||||||
unsigned int m_LocationAspectRatio = 0;
|
unsigned int m_LocationPosition = 0;
|
||||||
unsigned int m_LocationTranslation = 0;
|
|
||||||
unsigned int m_LocationViewtype = 0;
|
|
||||||
unsigned int m_LocationColorEffect = 0;
|
unsigned int m_LocationColorEffect = 0;
|
||||||
protected:
|
protected:
|
||||||
virtual void GetAllUniformLocation();
|
virtual void GetAllUniformLocation();
|
||||||
@@ -20,12 +17,11 @@ public:
|
|||||||
EntityShader();
|
EntityShader();
|
||||||
|
|
||||||
void LoadShader();
|
void LoadShader();
|
||||||
void SetCamPos(const Vec2f& camPos);
|
|
||||||
void SetZoom(float zoom);
|
|
||||||
void SetAspectRatio(float aspectRatio);
|
|
||||||
void SetModelPos(const Vec2f& modelPos);
|
|
||||||
void SetIsometricView(float isometric);
|
|
||||||
void SetColorEffect(const Vec3f& color);
|
void SetColorEffect(const Vec3f& color);
|
||||||
|
void SetProjectionMatrix(const Mat4f& proj) const;
|
||||||
|
void SetViewMatrix(const Mat4f& view) const;
|
||||||
|
void SetModelPos(const Vec3f& pos) const;
|
||||||
};
|
};
|
||||||
|
|
||||||
} // namespace shader
|
} // namespace shader
|
||||||
|
|||||||
@@ -27,6 +27,7 @@ protected:
|
|||||||
void LoadVector(unsigned int location, const Vec2f& vector) const;
|
void LoadVector(unsigned int location, const Vec2f& vector) const;
|
||||||
void LoadVector(unsigned int location, const Vec3f& vector) const;
|
void LoadVector(unsigned int location, const Vec3f& vector) const;
|
||||||
void LoadBoolean(unsigned int location, bool value) const;
|
void LoadBoolean(unsigned int location, bool value) const;
|
||||||
|
void LoadMat4(unsigned int location, const Mat4f& mat) const;
|
||||||
void CleanUp() const;
|
void CleanUp() const;
|
||||||
|
|
||||||
private:
|
private:
|
||||||
|
|||||||
@@ -7,16 +7,15 @@ namespace shader {
|
|||||||
|
|
||||||
class WorldShader : public ShaderProgram {
|
class WorldShader : public ShaderProgram {
|
||||||
private:
|
private:
|
||||||
unsigned int m_LocationCam = 0, m_LocationZoom = 0, m_LocationAspectRatio = 0, m_LocationViewtype = 0;
|
unsigned int m_LocationProjection = 0, m_LocationView = 0;
|
||||||
protected:
|
protected:
|
||||||
void GetAllUniformLocation();
|
void GetAllUniformLocation();
|
||||||
public:
|
public:
|
||||||
WorldShader();
|
WorldShader();
|
||||||
void LoadShader();
|
void LoadShader();
|
||||||
void SetCamPos(const Vec2f& camPos);
|
|
||||||
void SetZoom(float zoom);
|
void SetProjectionMatrix(const Mat4f& proj) const;
|
||||||
void SetAspectRatio(float aspectRatio);
|
void SetViewMatrix(const Mat4f& view) const;
|
||||||
void SetIsometricView(float isometric);
|
|
||||||
};
|
};
|
||||||
|
|
||||||
} // namespace shader
|
} // namespace shader
|
||||||
|
|||||||
@@ -1,40 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include <algorithm>
|
|
||||||
#include <random>
|
|
||||||
#include <stdint.h>
|
|
||||||
#include <time.h>
|
|
||||||
|
|
||||||
struct Backoff {
|
|
||||||
int64_t minAmount;
|
|
||||||
int64_t maxAmount;
|
|
||||||
int64_t current;
|
|
||||||
int fails;
|
|
||||||
std::mt19937_64 randGenerator;
|
|
||||||
std::uniform_real_distribution<> randDistribution;
|
|
||||||
|
|
||||||
double rand01() { return randDistribution(randGenerator); }
|
|
||||||
|
|
||||||
Backoff(int64_t min, int64_t max)
|
|
||||||
: minAmount(min)
|
|
||||||
, maxAmount(max)
|
|
||||||
, current(min)
|
|
||||||
, fails(0)
|
|
||||||
, randGenerator((uint64_t)time(0))
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void reset()
|
|
||||||
{
|
|
||||||
fails = 0;
|
|
||||||
current = minAmount;
|
|
||||||
}
|
|
||||||
|
|
||||||
int64_t nextDelay()
|
|
||||||
{
|
|
||||||
++fails;
|
|
||||||
int64_t delay = (int64_t)((double)current * 2.0 * rand01());
|
|
||||||
current = std::min(current + delay, maxAmount);
|
|
||||||
return current;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
@@ -1,19 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
// This is to wrap the platform specific kinds of connect/read/write.
|
|
||||||
|
|
||||||
#include <stdint.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
|
|
||||||
// not really connectiony, but need per-platform
|
|
||||||
int GetProcessId();
|
|
||||||
|
|
||||||
struct BaseConnection {
|
|
||||||
static BaseConnection* Create();
|
|
||||||
static void Destroy(BaseConnection*&);
|
|
||||||
bool isOpen{false};
|
|
||||||
bool Open();
|
|
||||||
bool Close();
|
|
||||||
bool Write(const void* data, size_t length);
|
|
||||||
bool Read(void* data, size_t length);
|
|
||||||
};
|
|
||||||
@@ -1,129 +0,0 @@
|
|||||||
#ifdef __unix__
|
|
||||||
|
|
||||||
#include "connection.h"
|
|
||||||
|
|
||||||
#include <errno.h>
|
|
||||||
#include <fcntl.h>
|
|
||||||
#include <stdio.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include <sys/socket.h>
|
|
||||||
#include <sys/types.h>
|
|
||||||
#include <sys/un.h>
|
|
||||||
#include <unistd.h>
|
|
||||||
|
|
||||||
int GetProcessId()
|
|
||||||
{
|
|
||||||
return ::getpid();
|
|
||||||
}
|
|
||||||
|
|
||||||
struct BaseConnectionUnix : public BaseConnection {
|
|
||||||
int sock{-1};
|
|
||||||
};
|
|
||||||
|
|
||||||
static BaseConnectionUnix Connection;
|
|
||||||
static sockaddr_un PipeAddr{};
|
|
||||||
#ifdef MSG_NOSIGNAL
|
|
||||||
static int MsgFlags = MSG_NOSIGNAL;
|
|
||||||
#else
|
|
||||||
static int MsgFlags = 0;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
static const char* GetTempPath()
|
|
||||||
{
|
|
||||||
const char* temp = getenv("XDG_RUNTIME_DIR");
|
|
||||||
temp = temp ? temp : getenv("TMPDIR");
|
|
||||||
temp = temp ? temp : getenv("TMP");
|
|
||||||
temp = temp ? temp : getenv("TEMP");
|
|
||||||
temp = temp ? temp : "/tmp";
|
|
||||||
return temp;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*static*/ BaseConnection* BaseConnection::Create()
|
|
||||||
{
|
|
||||||
PipeAddr.sun_family = AF_UNIX;
|
|
||||||
return &Connection;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*static*/ void BaseConnection::Destroy(BaseConnection*& c)
|
|
||||||
{
|
|
||||||
auto self = reinterpret_cast<BaseConnectionUnix*>(c);
|
|
||||||
self->Close();
|
|
||||||
c = nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool BaseConnection::Open()
|
|
||||||
{
|
|
||||||
const char* tempPath = GetTempPath();
|
|
||||||
auto self = reinterpret_cast<BaseConnectionUnix*>(this);
|
|
||||||
self->sock = socket(AF_UNIX, SOCK_STREAM, 0);
|
|
||||||
if (self->sock == -1) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
fcntl(self->sock, F_SETFL, O_NONBLOCK);
|
|
||||||
#ifdef SO_NOSIGPIPE
|
|
||||||
int optval = 1;
|
|
||||||
setsockopt(self->sock, SOL_SOCKET, SO_NOSIGPIPE, &optval, sizeof(optval));
|
|
||||||
#endif
|
|
||||||
|
|
||||||
for (int pipeNum = 0; pipeNum < 10; ++pipeNum) {
|
|
||||||
snprintf(
|
|
||||||
PipeAddr.sun_path, sizeof(PipeAddr.sun_path), "%s/discord-ipc-%d", tempPath, pipeNum);
|
|
||||||
int err = connect(self->sock, (const sockaddr*)&PipeAddr, sizeof(PipeAddr));
|
|
||||||
if (err == 0) {
|
|
||||||
self->isOpen = true;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
self->Close();
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool BaseConnection::Close()
|
|
||||||
{
|
|
||||||
auto self = reinterpret_cast<BaseConnectionUnix*>(this);
|
|
||||||
if (self->sock == -1) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
close(self->sock);
|
|
||||||
self->sock = -1;
|
|
||||||
self->isOpen = false;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool BaseConnection::Write(const void* data, size_t length)
|
|
||||||
{
|
|
||||||
auto self = reinterpret_cast<BaseConnectionUnix*>(this);
|
|
||||||
|
|
||||||
if (self->sock == -1) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
ssize_t sentBytes = send(self->sock, data, length, MsgFlags);
|
|
||||||
if (sentBytes < 0) {
|
|
||||||
Close();
|
|
||||||
}
|
|
||||||
return sentBytes == (ssize_t)length;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool BaseConnection::Read(void* data, size_t length)
|
|
||||||
{
|
|
||||||
auto self = reinterpret_cast<BaseConnectionUnix*>(this);
|
|
||||||
|
|
||||||
if (self->sock == -1) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
int res = (int)recv(self->sock, data, length, MsgFlags);
|
|
||||||
if (res < 0) {
|
|
||||||
if (errno == EAGAIN) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
Close();
|
|
||||||
}
|
|
||||||
else if (res == 0) {
|
|
||||||
Close();
|
|
||||||
}
|
|
||||||
return res == (int)length;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,132 +0,0 @@
|
|||||||
#if defined(_WIN32) || defined(_WIN64)
|
|
||||||
|
|
||||||
#include "connection.h"
|
|
||||||
|
|
||||||
#define WIN32_LEAN_AND_MEAN
|
|
||||||
#define NOMCX
|
|
||||||
#define NOSERVICE
|
|
||||||
#define NOIME
|
|
||||||
#include <assert.h>
|
|
||||||
#include <windows.h>
|
|
||||||
|
|
||||||
int GetProcessId()
|
|
||||||
{
|
|
||||||
return (int)::GetCurrentProcessId();
|
|
||||||
}
|
|
||||||
|
|
||||||
struct BaseConnectionWin : public BaseConnection {
|
|
||||||
HANDLE pipe{INVALID_HANDLE_VALUE};
|
|
||||||
};
|
|
||||||
|
|
||||||
static BaseConnectionWin Connection;
|
|
||||||
|
|
||||||
/*static*/ BaseConnection* BaseConnection::Create()
|
|
||||||
{
|
|
||||||
return &Connection;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*static*/ void BaseConnection::Destroy(BaseConnection*& c)
|
|
||||||
{
|
|
||||||
auto self = reinterpret_cast<BaseConnectionWin*>(c);
|
|
||||||
self->Close();
|
|
||||||
c = nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool BaseConnection::Open()
|
|
||||||
{
|
|
||||||
wchar_t pipeName[]{L"\\\\?\\pipe\\discord-ipc-0"};
|
|
||||||
const size_t pipeDigit = sizeof(pipeName) / sizeof(wchar_t) - 2;
|
|
||||||
pipeName[pipeDigit] = L'0';
|
|
||||||
auto self = reinterpret_cast<BaseConnectionWin*>(this);
|
|
||||||
for (;;) {
|
|
||||||
self->pipe = ::CreateFileW(
|
|
||||||
pipeName, GENERIC_READ | GENERIC_WRITE, 0, nullptr, OPEN_EXISTING, 0, nullptr);
|
|
||||||
if (self->pipe != INVALID_HANDLE_VALUE) {
|
|
||||||
self->isOpen = true;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
auto lastError = GetLastError();
|
|
||||||
if (lastError == ERROR_FILE_NOT_FOUND) {
|
|
||||||
if (pipeName[pipeDigit] < L'9') {
|
|
||||||
pipeName[pipeDigit]++;
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (lastError == ERROR_PIPE_BUSY) {
|
|
||||||
if (!WaitNamedPipeW(pipeName, 10000)) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
bool BaseConnection::Close()
|
|
||||||
{
|
|
||||||
auto self = reinterpret_cast<BaseConnectionWin*>(this);
|
|
||||||
::CloseHandle(self->pipe);
|
|
||||||
self->pipe = INVALID_HANDLE_VALUE;
|
|
||||||
self->isOpen = false;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool BaseConnection::Write(const void* data, size_t length)
|
|
||||||
{
|
|
||||||
if (length == 0) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
auto self = reinterpret_cast<BaseConnectionWin*>(this);
|
|
||||||
assert(self);
|
|
||||||
if (!self) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
if (self->pipe == INVALID_HANDLE_VALUE) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
assert(data);
|
|
||||||
if (!data) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
const DWORD bytesLength = (DWORD)length;
|
|
||||||
DWORD bytesWritten = 0;
|
|
||||||
return ::WriteFile(self->pipe, data, bytesLength, &bytesWritten, nullptr) == TRUE &&
|
|
||||||
bytesWritten == bytesLength;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool BaseConnection::Read(void* data, size_t length)
|
|
||||||
{
|
|
||||||
assert(data);
|
|
||||||
if (!data) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
auto self = reinterpret_cast<BaseConnectionWin*>(this);
|
|
||||||
assert(self);
|
|
||||||
if (!self) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
if (self->pipe == INVALID_HANDLE_VALUE) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
DWORD bytesAvailable = 0;
|
|
||||||
if (::PeekNamedPipe(self->pipe, nullptr, 0, nullptr, &bytesAvailable, nullptr)) {
|
|
||||||
if (bytesAvailable >= length) {
|
|
||||||
DWORD bytesToRead = (DWORD)length;
|
|
||||||
DWORD bytesRead = 0;
|
|
||||||
if (::ReadFile(self->pipe, data, bytesToRead, &bytesRead, nullptr) == TRUE) {
|
|
||||||
assert(bytesToRead == bytesRead);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
Close();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
Close();
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,26 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#if defined(DISCORD_DYNAMIC_LIB)
|
|
||||||
#if defined(_WIN32)
|
|
||||||
#if defined(DISCORD_BUILDING_SDK)
|
|
||||||
#define DISCORD_EXPORT __declspec(dllexport)
|
|
||||||
#else
|
|
||||||
#define DISCORD_EXPORT __declspec(dllimport)
|
|
||||||
#endif
|
|
||||||
#else
|
|
||||||
#define DISCORD_EXPORT __attribute__((visibility("default")))
|
|
||||||
#endif
|
|
||||||
#else
|
|
||||||
#define DISCORD_EXPORT
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __cplusplus
|
|
||||||
extern "C" {
|
|
||||||
#endif
|
|
||||||
|
|
||||||
DISCORD_EXPORT void Discord_Register(const char* applicationId, const char* command);
|
|
||||||
DISCORD_EXPORT void Discord_RegisterSteamGame(const char* applicationId, const char* steamId);
|
|
||||||
|
|
||||||
#ifdef __cplusplus
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
@@ -1,106 +0,0 @@
|
|||||||
#ifdef __unix__
|
|
||||||
|
|
||||||
#include "discord_rpc.h"
|
|
||||||
#include "discord_register.h"
|
|
||||||
#include <stdio.h>
|
|
||||||
|
|
||||||
#include <errno.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include <sys/stat.h>
|
|
||||||
#include <sys/types.h>
|
|
||||||
#include <unistd.h>
|
|
||||||
|
|
||||||
static bool Mkdir(const char* path)
|
|
||||||
{
|
|
||||||
int result = mkdir(path, 0755);
|
|
||||||
if (result == 0) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (errno == EEXIST) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
// we want to register games so we can run them from Discord client as discord-<appid>://
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_Register(const char* applicationId, const char* command)
|
|
||||||
{
|
|
||||||
// Add a desktop file and update some mime handlers so that xdg-open does the right thing.
|
|
||||||
|
|
||||||
const char* home = getenv("HOME");
|
|
||||||
if (!home) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
char exePath[1024];
|
|
||||||
if (!command || !command[0]) {
|
|
||||||
ssize_t size = readlink("/proc/self/exe", exePath, sizeof(exePath));
|
|
||||||
if (size <= 0 || size >= (ssize_t)sizeof(exePath)) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
exePath[size] = '\0';
|
|
||||||
command = exePath;
|
|
||||||
}
|
|
||||||
|
|
||||||
const char* desktopFileFormat = "[Desktop Entry]\n"
|
|
||||||
"Name=Game %s\n"
|
|
||||||
"Exec=%s %%u\n" // note: it really wants that %u in there
|
|
||||||
"Type=Application\n"
|
|
||||||
"NoDisplay=true\n"
|
|
||||||
"Categories=Discord;Games;\n"
|
|
||||||
"MimeType=x-scheme-handler/discord-%s;\n";
|
|
||||||
char desktopFile[2048];
|
|
||||||
int fileLen = snprintf(
|
|
||||||
desktopFile, sizeof(desktopFile), desktopFileFormat, applicationId, command, applicationId);
|
|
||||||
if (fileLen <= 0) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
char desktopFilename[256];
|
|
||||||
snprintf(desktopFilename, sizeof(desktopFilename), "/discord-%s.desktop", applicationId);
|
|
||||||
|
|
||||||
char desktopFilePath[1024];
|
|
||||||
snprintf(desktopFilePath, sizeof(desktopFilePath), "%s/.local", home);
|
|
||||||
if (!Mkdir(desktopFilePath)) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
strcat(desktopFilePath, "/share");
|
|
||||||
if (!Mkdir(desktopFilePath)) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
strcat(desktopFilePath, "/applications");
|
|
||||||
if (!Mkdir(desktopFilePath)) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
strcat(desktopFilePath, desktopFilename);
|
|
||||||
|
|
||||||
FILE* fp = fopen(desktopFilePath, "w");
|
|
||||||
if (fp) {
|
|
||||||
fwrite(desktopFile, 1, fileLen, fp);
|
|
||||||
fclose(fp);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
char xdgMimeCommand[1024];
|
|
||||||
snprintf(xdgMimeCommand,
|
|
||||||
sizeof(xdgMimeCommand),
|
|
||||||
"xdg-mime default discord-%s.desktop x-scheme-handler/discord-%s",
|
|
||||||
applicationId,
|
|
||||||
applicationId);
|
|
||||||
if (system(xdgMimeCommand) < 0) {
|
|
||||||
fprintf(stderr, "Failed to register mime handler\n");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_RegisterSteamGame(const char* applicationId,
|
|
||||||
const char* steamId)
|
|
||||||
{
|
|
||||||
char command[256];
|
|
||||||
sprintf(command, "xdg-open steam://rungameid/%s", steamId);
|
|
||||||
Discord_Register(applicationId, command);
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,190 +0,0 @@
|
|||||||
#if defined(_WIN32) || defined(_WIN64)
|
|
||||||
|
|
||||||
#include "discord_rpc.h"
|
|
||||||
#include "discord_register.h"
|
|
||||||
|
|
||||||
#define WIN32_LEAN_AND_MEAN
|
|
||||||
#define NOMCX
|
|
||||||
#define NOSERVICE
|
|
||||||
#define NOIME
|
|
||||||
#include <windows.h>
|
|
||||||
#include <psapi.h>
|
|
||||||
#include <cstdio>
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Updated fixes for MinGW and WinXP
|
|
||||||
* This block is written the way it does not involve changing the rest of the code
|
|
||||||
* Checked to be compiling
|
|
||||||
* 1) strsafe.h belongs to Windows SDK and cannot be added to MinGW
|
|
||||||
* #include guarded, functions redirected to <string.h> substitutes
|
|
||||||
* 2) RegSetKeyValueW and LSTATUS are not declared in <winreg.h>
|
|
||||||
* The entire function is rewritten
|
|
||||||
*/
|
|
||||||
#ifdef __MINGW32__
|
|
||||||
#include <wchar.h>
|
|
||||||
/// strsafe.h fixes
|
|
||||||
static HRESULT StringCbPrintfW(LPWSTR pszDest, size_t cbDest, LPCWSTR pszFormat, ...)
|
|
||||||
{
|
|
||||||
HRESULT ret;
|
|
||||||
va_list va;
|
|
||||||
va_start(va, pszFormat);
|
|
||||||
cbDest /= 2; // Size is divided by 2 to convert from bytes to wide characters - causes segfault
|
|
||||||
// othervise
|
|
||||||
ret = vsnwprintf(pszDest, cbDest, pszFormat, va);
|
|
||||||
pszDest[cbDest - 1] = 0; // Terminate the string in case a buffer overflow; -1 will be returned
|
|
||||||
va_end(va);
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
#include <cwchar>
|
|
||||||
#include <strsafe.h>
|
|
||||||
#endif // __MINGW32__
|
|
||||||
|
|
||||||
/// winreg.h fixes
|
|
||||||
#ifndef LSTATUS
|
|
||||||
#define LSTATUS LONG
|
|
||||||
#endif
|
|
||||||
#ifdef RegSetKeyValueW
|
|
||||||
#undefine RegSetKeyValueW
|
|
||||||
#endif
|
|
||||||
#define RegSetKeyValueW regset
|
|
||||||
static LSTATUS regset(HKEY hkey,
|
|
||||||
LPCWSTR subkey,
|
|
||||||
LPCWSTR name,
|
|
||||||
DWORD type,
|
|
||||||
const void* data,
|
|
||||||
DWORD len)
|
|
||||||
{
|
|
||||||
HKEY htkey = hkey, hsubkey = nullptr;
|
|
||||||
LSTATUS ret;
|
|
||||||
if (subkey && subkey[0]) {
|
|
||||||
if ((ret = RegCreateKeyExW(hkey, subkey, 0, 0, 0, KEY_ALL_ACCESS, 0, &hsubkey, 0)) !=
|
|
||||||
ERROR_SUCCESS)
|
|
||||||
return ret;
|
|
||||||
htkey = hsubkey;
|
|
||||||
}
|
|
||||||
ret = RegSetValueExW(htkey, name, 0, type, (const BYTE*)data, len);
|
|
||||||
if (hsubkey && hsubkey != hkey)
|
|
||||||
RegCloseKey(hsubkey);
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void Discord_RegisterW(const wchar_t* applicationId, const wchar_t* command)
|
|
||||||
{
|
|
||||||
// https://msdn.microsoft.com/en-us/library/aa767914(v=vs.85).aspx
|
|
||||||
// we want to register games so we can run them as discord-<appid>://
|
|
||||||
// Update the HKEY_CURRENT_USER, because it doesn't seem to require special permissions.
|
|
||||||
|
|
||||||
wchar_t exeFilePath[MAX_PATH];
|
|
||||||
DWORD exeLen = GetModuleFileNameW(nullptr, exeFilePath, MAX_PATH);
|
|
||||||
wchar_t openCommand[1024];
|
|
||||||
|
|
||||||
if (command && command[0]) {
|
|
||||||
StringCbPrintfW(openCommand, sizeof(openCommand), L"%s", command);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
// StringCbCopyW(openCommand, sizeof(openCommand), exeFilePath);
|
|
||||||
StringCbPrintfW(openCommand, sizeof(openCommand), L"%s", exeFilePath);
|
|
||||||
}
|
|
||||||
|
|
||||||
wchar_t protocolName[64];
|
|
||||||
StringCbPrintfW(protocolName, sizeof(protocolName), L"discord-%s", applicationId);
|
|
||||||
wchar_t protocolDescription[128];
|
|
||||||
StringCbPrintfW(
|
|
||||||
protocolDescription, sizeof(protocolDescription), L"URL:Run game %s protocol", applicationId);
|
|
||||||
wchar_t urlProtocol = 0;
|
|
||||||
|
|
||||||
wchar_t keyName[256];
|
|
||||||
StringCbPrintfW(keyName, sizeof(keyName), L"Software\\Classes\\%s", protocolName);
|
|
||||||
HKEY key;
|
|
||||||
auto status =
|
|
||||||
RegCreateKeyExW(HKEY_CURRENT_USER, keyName, 0, nullptr, 0, KEY_WRITE, nullptr, &key, nullptr);
|
|
||||||
if (status != ERROR_SUCCESS) {
|
|
||||||
fprintf(stderr, "Error creating key\n");
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
DWORD len;
|
|
||||||
LSTATUS result;
|
|
||||||
len = (DWORD)lstrlenW(protocolDescription) + 1;
|
|
||||||
result =
|
|
||||||
RegSetKeyValueW(key, nullptr, nullptr, REG_SZ, protocolDescription, len * sizeof(wchar_t));
|
|
||||||
if (FAILED(result)) {
|
|
||||||
fprintf(stderr, "Error writing description\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
len = (DWORD)lstrlenW(protocolDescription) + 1;
|
|
||||||
result = RegSetKeyValueW(key, nullptr, L"URL Protocol", REG_SZ, &urlProtocol, sizeof(wchar_t));
|
|
||||||
if (FAILED(result)) {
|
|
||||||
fprintf(stderr, "Error writing description\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
result = RegSetKeyValueW(
|
|
||||||
key, L"DefaultIcon", nullptr, REG_SZ, exeFilePath, (exeLen + 1) * sizeof(wchar_t));
|
|
||||||
if (FAILED(result)) {
|
|
||||||
fprintf(stderr, "Error writing icon\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
len = (DWORD)lstrlenW(openCommand) + 1;
|
|
||||||
result = RegSetKeyValueW(
|
|
||||||
key, L"shell\\open\\command", nullptr, REG_SZ, openCommand, len * sizeof(wchar_t));
|
|
||||||
if (FAILED(result)) {
|
|
||||||
fprintf(stderr, "Error writing command\n");
|
|
||||||
}
|
|
||||||
RegCloseKey(key);
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_Register(const char* applicationId, const char* command)
|
|
||||||
{
|
|
||||||
wchar_t appId[32];
|
|
||||||
MultiByteToWideChar(CP_UTF8, 0, applicationId, -1, appId, 32);
|
|
||||||
|
|
||||||
wchar_t openCommand[1024];
|
|
||||||
const wchar_t* wcommand = nullptr;
|
|
||||||
if (command && command[0]) {
|
|
||||||
const auto commandBufferLen = sizeof(openCommand) / sizeof(*openCommand);
|
|
||||||
MultiByteToWideChar(CP_UTF8, 0, command, -1, openCommand, commandBufferLen);
|
|
||||||
wcommand = openCommand;
|
|
||||||
}
|
|
||||||
|
|
||||||
Discord_RegisterW(appId, wcommand);
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_RegisterSteamGame(const char* applicationId,
|
|
||||||
const char* steamId)
|
|
||||||
{
|
|
||||||
wchar_t appId[32];
|
|
||||||
MultiByteToWideChar(CP_UTF8, 0, applicationId, -1, appId, 32);
|
|
||||||
|
|
||||||
wchar_t wSteamId[32];
|
|
||||||
MultiByteToWideChar(CP_UTF8, 0, steamId, -1, wSteamId, 32);
|
|
||||||
|
|
||||||
HKEY key;
|
|
||||||
auto status = RegOpenKeyExW(HKEY_CURRENT_USER, L"Software\\Valve\\Steam", 0, KEY_READ, &key);
|
|
||||||
if (status != ERROR_SUCCESS) {
|
|
||||||
fprintf(stderr, "Error opening Steam key\n");
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
wchar_t steamPath[MAX_PATH];
|
|
||||||
DWORD pathBytes = sizeof(steamPath);
|
|
||||||
status = RegQueryValueExW(key, L"SteamExe", nullptr, nullptr, (BYTE*)steamPath, &pathBytes);
|
|
||||||
RegCloseKey(key);
|
|
||||||
if (status != ERROR_SUCCESS || pathBytes < 1) {
|
|
||||||
fprintf(stderr, "Error reading SteamExe key\n");
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
DWORD pathChars = pathBytes / sizeof(wchar_t);
|
|
||||||
for (DWORD i = 0; i < pathChars; ++i) {
|
|
||||||
if (steamPath[i] == L'/') {
|
|
||||||
steamPath[i] = L'\\';
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
wchar_t command[1024];
|
|
||||||
StringCbPrintfW(command, sizeof(command), L"\"%s\" steam://rungameid/%s", steamPath, wSteamId);
|
|
||||||
|
|
||||||
Discord_RegisterW(appId, command);
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,504 +0,0 @@
|
|||||||
#include "discord_rpc.h"
|
|
||||||
|
|
||||||
#include "backoff.h"
|
|
||||||
#include "discord_register.h"
|
|
||||||
#include "msg_queue.h"
|
|
||||||
#include "rpc_connection.h"
|
|
||||||
#include "serialization.h"
|
|
||||||
|
|
||||||
#include <atomic>
|
|
||||||
#include <chrono>
|
|
||||||
#include <mutex>
|
|
||||||
|
|
||||||
#ifndef DISCORD_DISABLE_IO_THREAD
|
|
||||||
#include <condition_variable>
|
|
||||||
#include <thread>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
constexpr size_t MaxMessageSize{16 * 1024};
|
|
||||||
constexpr size_t MessageQueueSize{8};
|
|
||||||
constexpr size_t JoinQueueSize{8};
|
|
||||||
|
|
||||||
struct QueuedMessage {
|
|
||||||
size_t length;
|
|
||||||
char buffer[MaxMessageSize];
|
|
||||||
|
|
||||||
void Copy(const QueuedMessage& other)
|
|
||||||
{
|
|
||||||
length = other.length;
|
|
||||||
if (length) {
|
|
||||||
memcpy(buffer, other.buffer, length);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct User {
|
|
||||||
// snowflake (64bit int), turned into a ascii decimal string, at most 20 chars +1 null
|
|
||||||
// terminator = 21
|
|
||||||
char userId[32];
|
|
||||||
// 32 unicode glyphs is max name size => 4 bytes per glyph in the worst case, +1 for null
|
|
||||||
// terminator = 129
|
|
||||||
char username[344];
|
|
||||||
// 4 decimal digits + 1 null terminator = 5
|
|
||||||
char discriminator[8];
|
|
||||||
// optional 'a_' + md5 hex digest (32 bytes) + null terminator = 35
|
|
||||||
char avatar[128];
|
|
||||||
// Rounded way up because I'm paranoid about games breaking from future changes in these sizes
|
|
||||||
};
|
|
||||||
|
|
||||||
static RpcConnection* Connection{nullptr};
|
|
||||||
static DiscordEventHandlers QueuedHandlers{};
|
|
||||||
static DiscordEventHandlers Handlers{};
|
|
||||||
static std::atomic_bool WasJustConnected{false};
|
|
||||||
static std::atomic_bool WasJustDisconnected{false};
|
|
||||||
static std::atomic_bool GotErrorMessage{false};
|
|
||||||
static std::atomic_bool WasJoinGame{false};
|
|
||||||
static std::atomic_bool WasSpectateGame{false};
|
|
||||||
static std::atomic_bool UpdatePresence{false};
|
|
||||||
static char JoinGameSecret[256];
|
|
||||||
static char SpectateGameSecret[256];
|
|
||||||
static int LastErrorCode{0};
|
|
||||||
static char LastErrorMessage[256];
|
|
||||||
static int LastDisconnectErrorCode{0};
|
|
||||||
static char LastDisconnectErrorMessage[256];
|
|
||||||
static std::mutex PresenceMutex;
|
|
||||||
static std::mutex HandlerMutex;
|
|
||||||
static QueuedMessage QueuedPresence{};
|
|
||||||
static MsgQueue<QueuedMessage, MessageQueueSize> SendQueue;
|
|
||||||
static MsgQueue<User, JoinQueueSize> JoinAskQueue;
|
|
||||||
static User connectedUser;
|
|
||||||
|
|
||||||
// We want to auto connect, and retry on failure, but not as fast as possible. This does expoential
|
|
||||||
// backoff from 0.5 seconds to 1 minute
|
|
||||||
static Backoff ReconnectTimeMs(500, 60 * 1000);
|
|
||||||
static auto NextConnect = std::chrono::system_clock::now();
|
|
||||||
static int Pid{0};
|
|
||||||
static int Nonce{1};
|
|
||||||
|
|
||||||
#ifndef DISCORD_DISABLE_IO_THREAD
|
|
||||||
static void Discord_UpdateConnection(void);
|
|
||||||
class IoThreadHolder {
|
|
||||||
private:
|
|
||||||
std::atomic_bool keepRunning{true};
|
|
||||||
std::mutex waitForIOMutex;
|
|
||||||
std::condition_variable waitForIOActivity;
|
|
||||||
std::thread ioThread;
|
|
||||||
|
|
||||||
public:
|
|
||||||
void Start()
|
|
||||||
{
|
|
||||||
keepRunning.store(true);
|
|
||||||
ioThread = std::thread([&]() {
|
|
||||||
const std::chrono::duration<int64_t, std::milli> maxWait{500LL};
|
|
||||||
Discord_UpdateConnection();
|
|
||||||
while (keepRunning.load()) {
|
|
||||||
std::unique_lock<std::mutex> lock(waitForIOMutex);
|
|
||||||
waitForIOActivity.wait_for(lock, maxWait);
|
|
||||||
Discord_UpdateConnection();
|
|
||||||
}
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
void Notify() { waitForIOActivity.notify_all(); }
|
|
||||||
|
|
||||||
void Stop()
|
|
||||||
{
|
|
||||||
keepRunning.exchange(false);
|
|
||||||
Notify();
|
|
||||||
if (ioThread.joinable()) {
|
|
||||||
ioThread.join();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
~IoThreadHolder() { Stop(); }
|
|
||||||
};
|
|
||||||
#else
|
|
||||||
class IoThreadHolder {
|
|
||||||
public:
|
|
||||||
void Start() {}
|
|
||||||
void Stop() {}
|
|
||||||
void Notify() {}
|
|
||||||
};
|
|
||||||
#endif // DISCORD_DISABLE_IO_THREAD
|
|
||||||
static IoThreadHolder* IoThread{nullptr};
|
|
||||||
|
|
||||||
static void UpdateReconnectTime()
|
|
||||||
{
|
|
||||||
NextConnect = std::chrono::system_clock::now() +
|
|
||||||
std::chrono::duration<int64_t, std::milli>{ReconnectTimeMs.nextDelay()};
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef DISCORD_DISABLE_IO_THREAD
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_UpdateConnection(void)
|
|
||||||
#else
|
|
||||||
static void Discord_UpdateConnection(void)
|
|
||||||
#endif
|
|
||||||
{
|
|
||||||
if (!Connection) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!Connection->IsOpen()) {
|
|
||||||
if (std::chrono::system_clock::now() >= NextConnect) {
|
|
||||||
UpdateReconnectTime();
|
|
||||||
Connection->Open();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
// reads
|
|
||||||
|
|
||||||
for (;;) {
|
|
||||||
JsonDocument message;
|
|
||||||
|
|
||||||
if (!Connection->Read(message)) {
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
|
|
||||||
const char* evtName = GetStrMember(&message, "evt");
|
|
||||||
const char* nonce = GetStrMember(&message, "nonce");
|
|
||||||
|
|
||||||
if (nonce) {
|
|
||||||
// in responses only -- should use to match up response when needed.
|
|
||||||
|
|
||||||
if (evtName && strcmp(evtName, "ERROR") == 0) {
|
|
||||||
auto data = GetObjMember(&message, "data");
|
|
||||||
LastErrorCode = GetIntMember(data, "code");
|
|
||||||
StringCopy(LastErrorMessage, GetStrMember(data, "message", ""));
|
|
||||||
GotErrorMessage.store(true);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
// should have evt == name of event, optional data
|
|
||||||
if (evtName == nullptr) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
auto data = GetObjMember(&message, "data");
|
|
||||||
|
|
||||||
if (strcmp(evtName, "ACTIVITY_JOIN") == 0) {
|
|
||||||
auto secret = GetStrMember(data, "secret");
|
|
||||||
if (secret) {
|
|
||||||
StringCopy(JoinGameSecret, secret);
|
|
||||||
WasJoinGame.store(true);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (strcmp(evtName, "ACTIVITY_SPECTATE") == 0) {
|
|
||||||
auto secret = GetStrMember(data, "secret");
|
|
||||||
if (secret) {
|
|
||||||
StringCopy(SpectateGameSecret, secret);
|
|
||||||
WasSpectateGame.store(true);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (strcmp(evtName, "ACTIVITY_JOIN_REQUEST") == 0) {
|
|
||||||
auto user = GetObjMember(data, "user");
|
|
||||||
auto userId = GetStrMember(user, "id");
|
|
||||||
auto username = GetStrMember(user, "username");
|
|
||||||
auto avatar = GetStrMember(user, "avatar");
|
|
||||||
auto joinReq = JoinAskQueue.GetNextAddMessage();
|
|
||||||
if (userId && username && joinReq) {
|
|
||||||
StringCopy(joinReq->userId, userId);
|
|
||||||
StringCopy(joinReq->username, username);
|
|
||||||
auto discriminator = GetStrMember(user, "discriminator");
|
|
||||||
if (discriminator) {
|
|
||||||
StringCopy(joinReq->discriminator, discriminator);
|
|
||||||
}
|
|
||||||
if (avatar) {
|
|
||||||
StringCopy(joinReq->avatar, avatar);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
joinReq->avatar[0] = 0;
|
|
||||||
}
|
|
||||||
JoinAskQueue.CommitAdd();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// writes
|
|
||||||
if (UpdatePresence.exchange(false) && QueuedPresence.length) {
|
|
||||||
QueuedMessage local;
|
|
||||||
{
|
|
||||||
std::lock_guard<std::mutex> guard(PresenceMutex);
|
|
||||||
local.Copy(QueuedPresence);
|
|
||||||
}
|
|
||||||
if (!Connection->Write(local.buffer, local.length)) {
|
|
||||||
// if we fail to send, requeue
|
|
||||||
std::lock_guard<std::mutex> guard(PresenceMutex);
|
|
||||||
QueuedPresence.Copy(local);
|
|
||||||
UpdatePresence.exchange(true);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
while (SendQueue.HavePendingSends()) {
|
|
||||||
auto qmessage = SendQueue.GetNextSendMessage();
|
|
||||||
Connection->Write(qmessage->buffer, qmessage->length);
|
|
||||||
SendQueue.CommitSend();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static void SignalIOActivity()
|
|
||||||
{
|
|
||||||
if (IoThread != nullptr) {
|
|
||||||
IoThread->Notify();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static bool RegisterForEvent(const char* evtName)
|
|
||||||
{
|
|
||||||
auto qmessage = SendQueue.GetNextAddMessage();
|
|
||||||
if (qmessage) {
|
|
||||||
qmessage->length =
|
|
||||||
JsonWriteSubscribeCommand(qmessage->buffer, sizeof(qmessage->buffer), Nonce++, evtName);
|
|
||||||
SendQueue.CommitAdd();
|
|
||||||
SignalIOActivity();
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
static bool DeregisterForEvent(const char* evtName)
|
|
||||||
{
|
|
||||||
auto qmessage = SendQueue.GetNextAddMessage();
|
|
||||||
if (qmessage) {
|
|
||||||
qmessage->length =
|
|
||||||
JsonWriteUnsubscribeCommand(qmessage->buffer, sizeof(qmessage->buffer), Nonce++, evtName);
|
|
||||||
SendQueue.CommitAdd();
|
|
||||||
SignalIOActivity();
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_Initialize(const char* applicationId,
|
|
||||||
DiscordEventHandlers* handlers,
|
|
||||||
int autoRegister,
|
|
||||||
const char* optionalSteamId)
|
|
||||||
{
|
|
||||||
IoThread = new (std::nothrow) IoThreadHolder();
|
|
||||||
if (IoThread == nullptr) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (autoRegister) {
|
|
||||||
if (optionalSteamId && optionalSteamId[0]) {
|
|
||||||
Discord_RegisterSteamGame(applicationId, optionalSteamId);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
Discord_Register(applicationId, nullptr);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
Pid = GetProcessId();
|
|
||||||
|
|
||||||
{
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
|
|
||||||
if (handlers) {
|
|
||||||
QueuedHandlers = *handlers;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
QueuedHandlers = {};
|
|
||||||
}
|
|
||||||
|
|
||||||
Handlers = {};
|
|
||||||
}
|
|
||||||
|
|
||||||
if (Connection) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
Connection = RpcConnection::Create(applicationId);
|
|
||||||
Connection->onConnect = [](JsonDocument& readyMessage) {
|
|
||||||
Discord_UpdateHandlers(&QueuedHandlers);
|
|
||||||
if (QueuedPresence.length > 0) {
|
|
||||||
UpdatePresence.exchange(true);
|
|
||||||
SignalIOActivity();
|
|
||||||
}
|
|
||||||
auto data = GetObjMember(&readyMessage, "data");
|
|
||||||
auto user = GetObjMember(data, "user");
|
|
||||||
auto userId = GetStrMember(user, "id");
|
|
||||||
auto username = GetStrMember(user, "username");
|
|
||||||
auto avatar = GetStrMember(user, "avatar");
|
|
||||||
if (userId && username) {
|
|
||||||
StringCopy(connectedUser.userId, userId);
|
|
||||||
StringCopy(connectedUser.username, username);
|
|
||||||
auto discriminator = GetStrMember(user, "discriminator");
|
|
||||||
if (discriminator) {
|
|
||||||
StringCopy(connectedUser.discriminator, discriminator);
|
|
||||||
}
|
|
||||||
if (avatar) {
|
|
||||||
StringCopy(connectedUser.avatar, avatar);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
connectedUser.avatar[0] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
WasJustConnected.exchange(true);
|
|
||||||
ReconnectTimeMs.reset();
|
|
||||||
};
|
|
||||||
Connection->onDisconnect = [](int err, const char* message) {
|
|
||||||
LastDisconnectErrorCode = err;
|
|
||||||
StringCopy(LastDisconnectErrorMessage, message);
|
|
||||||
WasJustDisconnected.exchange(true);
|
|
||||||
UpdateReconnectTime();
|
|
||||||
};
|
|
||||||
|
|
||||||
IoThread->Start();
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_Shutdown(void)
|
|
||||||
{
|
|
||||||
if (!Connection) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
Connection->onConnect = nullptr;
|
|
||||||
Connection->onDisconnect = nullptr;
|
|
||||||
Handlers = {};
|
|
||||||
QueuedPresence.length = 0;
|
|
||||||
UpdatePresence.exchange(false);
|
|
||||||
if (IoThread != nullptr) {
|
|
||||||
IoThread->Stop();
|
|
||||||
delete IoThread;
|
|
||||||
IoThread = nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
RpcConnection::Destroy(Connection);
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_UpdatePresence(const DiscordRichPresence* presence)
|
|
||||||
{
|
|
||||||
{
|
|
||||||
std::lock_guard<std::mutex> guard(PresenceMutex);
|
|
||||||
QueuedPresence.length = JsonWriteRichPresenceObj(
|
|
||||||
QueuedPresence.buffer, sizeof(QueuedPresence.buffer), Nonce++, Pid, presence);
|
|
||||||
UpdatePresence.exchange(true);
|
|
||||||
}
|
|
||||||
SignalIOActivity();
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_ClearPresence(void)
|
|
||||||
{
|
|
||||||
Discord_UpdatePresence(nullptr);
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_Respond(const char* userId, /* DISCORD_REPLY_ */ int reply)
|
|
||||||
{
|
|
||||||
// if we are not connected, let's not batch up stale messages for later
|
|
||||||
if (!Connection || !Connection->IsOpen()) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
auto qmessage = SendQueue.GetNextAddMessage();
|
|
||||||
if (qmessage) {
|
|
||||||
qmessage->length =
|
|
||||||
JsonWriteJoinReply(qmessage->buffer, sizeof(qmessage->buffer), userId, reply, Nonce++);
|
|
||||||
SendQueue.CommitAdd();
|
|
||||||
SignalIOActivity();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_RunCallbacks(void)
|
|
||||||
{
|
|
||||||
// Note on some weirdness: internally we might connect, get other signals, disconnect any number
|
|
||||||
// of times inbetween calls here. Externally, we want the sequence to seem sane, so any other
|
|
||||||
// signals are book-ended by calls to ready and disconnect.
|
|
||||||
|
|
||||||
if (!Connection) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool wasDisconnected = WasJustDisconnected.exchange(false);
|
|
||||||
bool isConnected = Connection->IsOpen();
|
|
||||||
|
|
||||||
if (isConnected) {
|
|
||||||
// if we are connected, disconnect cb first
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
if (wasDisconnected && Handlers.disconnected) {
|
|
||||||
Handlers.disconnected(LastDisconnectErrorCode, LastDisconnectErrorMessage);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (WasJustConnected.exchange(false)) {
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
if (Handlers.ready) {
|
|
||||||
DiscordUser du{connectedUser.userId,
|
|
||||||
connectedUser.username,
|
|
||||||
connectedUser.discriminator,
|
|
||||||
connectedUser.avatar};
|
|
||||||
Handlers.ready(&du);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (GotErrorMessage.exchange(false)) {
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
if (Handlers.errored) {
|
|
||||||
Handlers.errored(LastErrorCode, LastErrorMessage);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (WasJoinGame.exchange(false)) {
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
if (Handlers.joinGame) {
|
|
||||||
Handlers.joinGame(JoinGameSecret);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (WasSpectateGame.exchange(false)) {
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
if (Handlers.spectateGame) {
|
|
||||||
Handlers.spectateGame(SpectateGameSecret);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Right now this batches up any requests and sends them all in a burst; I could imagine a world
|
|
||||||
// where the implementer would rather sequentially accept/reject each one before the next invite
|
|
||||||
// is sent. I left it this way because I could also imagine wanting to process these all and
|
|
||||||
// maybe show them in one common dialog and/or start fetching the avatars in parallel, and if
|
|
||||||
// not it should be trivial for the implementer to make a queue themselves.
|
|
||||||
while (JoinAskQueue.HavePendingSends()) {
|
|
||||||
auto req = JoinAskQueue.GetNextSendMessage();
|
|
||||||
{
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
if (Handlers.joinRequest) {
|
|
||||||
DiscordUser du{req->userId, req->username, req->discriminator, req->avatar};
|
|
||||||
Handlers.joinRequest(&du);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
JoinAskQueue.CommitSend();
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!isConnected) {
|
|
||||||
// if we are not connected, disconnect message last
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
if (wasDisconnected && Handlers.disconnected) {
|
|
||||||
Handlers.disconnected(LastDisconnectErrorCode, LastDisconnectErrorMessage);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" DISCORD_EXPORT void Discord_UpdateHandlers(DiscordEventHandlers* newHandlers)
|
|
||||||
{
|
|
||||||
if (newHandlers) {
|
|
||||||
#define HANDLE_EVENT_REGISTRATION(handler_name, event) \
|
|
||||||
if (!Handlers.handler_name && newHandlers->handler_name) { \
|
|
||||||
RegisterForEvent(event); \
|
|
||||||
} \
|
|
||||||
else if (Handlers.handler_name && !newHandlers->handler_name) { \
|
|
||||||
DeregisterForEvent(event); \
|
|
||||||
}
|
|
||||||
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
HANDLE_EVENT_REGISTRATION(joinGame, "ACTIVITY_JOIN")
|
|
||||||
HANDLE_EVENT_REGISTRATION(spectateGame, "ACTIVITY_SPECTATE")
|
|
||||||
HANDLE_EVENT_REGISTRATION(joinRequest, "ACTIVITY_JOIN_REQUEST")
|
|
||||||
|
|
||||||
#undef HANDLE_EVENT_REGISTRATION
|
|
||||||
|
|
||||||
Handlers = *newHandlers;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
std::lock_guard<std::mutex> guard(HandlerMutex);
|
|
||||||
Handlers = {};
|
|
||||||
}
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
@@ -1,90 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
#include <stdint.h>
|
|
||||||
|
|
||||||
// clang-format off
|
|
||||||
|
|
||||||
#if defined(DISCORD_DYNAMIC_LIB)
|
|
||||||
# if defined(_WIN32)
|
|
||||||
# if defined(DISCORD_BUILDING_SDK)
|
|
||||||
# define DISCORD_EXPORT __declspec(dllexport)
|
|
||||||
# else
|
|
||||||
# define DISCORD_EXPORT __declspec(dllimport)
|
|
||||||
# endif
|
|
||||||
# else
|
|
||||||
# define DISCORD_EXPORT __attribute__((visibility("default")))
|
|
||||||
# endif
|
|
||||||
#else
|
|
||||||
# define DISCORD_EXPORT
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// clang-format on
|
|
||||||
|
|
||||||
#ifdef __cplusplus
|
|
||||||
extern "C" {
|
|
||||||
#endif
|
|
||||||
|
|
||||||
typedef struct DiscordRichPresence {
|
|
||||||
const char* state; /* max 128 bytes */
|
|
||||||
const char* details; /* max 128 bytes */
|
|
||||||
int64_t startTimestamp;
|
|
||||||
int64_t endTimestamp;
|
|
||||||
const char* largeImageKey; /* max 32 bytes */
|
|
||||||
const char* largeImageText; /* max 128 bytes */
|
|
||||||
const char* smallImageKey; /* max 32 bytes */
|
|
||||||
const char* smallImageText; /* max 128 bytes */
|
|
||||||
const char* partyId; /* max 128 bytes */
|
|
||||||
int partySize;
|
|
||||||
int partyMax;
|
|
||||||
int partyPrivacy;
|
|
||||||
const char* matchSecret; /* max 128 bytes */
|
|
||||||
const char* joinSecret; /* max 128 bytes */
|
|
||||||
const char* spectateSecret; /* max 128 bytes */
|
|
||||||
int8_t instance;
|
|
||||||
} DiscordRichPresence;
|
|
||||||
|
|
||||||
typedef struct DiscordUser {
|
|
||||||
const char* userId;
|
|
||||||
const char* username;
|
|
||||||
const char* discriminator;
|
|
||||||
const char* avatar;
|
|
||||||
} DiscordUser;
|
|
||||||
|
|
||||||
typedef struct DiscordEventHandlers {
|
|
||||||
void (*ready)(const DiscordUser* request);
|
|
||||||
void (*disconnected)(int errorCode, const char* message);
|
|
||||||
void (*errored)(int errorCode, const char* message);
|
|
||||||
void (*joinGame)(const char* joinSecret);
|
|
||||||
void (*spectateGame)(const char* spectateSecret);
|
|
||||||
void (*joinRequest)(const DiscordUser* request);
|
|
||||||
} DiscordEventHandlers;
|
|
||||||
|
|
||||||
#define DISCORD_REPLY_NO 0
|
|
||||||
#define DISCORD_REPLY_YES 1
|
|
||||||
#define DISCORD_REPLY_IGNORE 2
|
|
||||||
#define DISCORD_PARTY_PRIVATE 0
|
|
||||||
#define DISCORD_PARTY_PUBLIC 1
|
|
||||||
|
|
||||||
DISCORD_EXPORT void Discord_Initialize(const char* applicationId,
|
|
||||||
DiscordEventHandlers* handlers,
|
|
||||||
int autoRegister,
|
|
||||||
const char* optionalSteamId);
|
|
||||||
DISCORD_EXPORT void Discord_Shutdown(void);
|
|
||||||
|
|
||||||
/* checks for incoming messages, dispatches callbacks */
|
|
||||||
DISCORD_EXPORT void Discord_RunCallbacks(void);
|
|
||||||
|
|
||||||
/* If you disable the lib starting its own io thread, you'll need to call this from your own */
|
|
||||||
#ifdef DISCORD_DISABLE_IO_THREAD
|
|
||||||
DISCORD_EXPORT void Discord_UpdateConnection(void);
|
|
||||||
#endif
|
|
||||||
|
|
||||||
DISCORD_EXPORT void Discord_UpdatePresence(const DiscordRichPresence* presence);
|
|
||||||
DISCORD_EXPORT void Discord_ClearPresence(void);
|
|
||||||
|
|
||||||
DISCORD_EXPORT void Discord_Respond(const char* userid, /* DISCORD_REPLY_ */ int reply);
|
|
||||||
|
|
||||||
DISCORD_EXPORT void Discord_UpdateHandlers(DiscordEventHandlers* handlers);
|
|
||||||
|
|
||||||
#ifdef __cplusplus
|
|
||||||
} /* extern "C" */
|
|
||||||
#endif
|
|
||||||
@@ -1,12 +0,0 @@
|
|||||||
#if defined(_WIN32) || defined(_WIN64)
|
|
||||||
|
|
||||||
#include <windows.h>
|
|
||||||
|
|
||||||
// outsmart GCC's missing-declarations warning
|
|
||||||
BOOL WINAPI DllMain(HMODULE, DWORD, LPVOID);
|
|
||||||
BOOL WINAPI DllMain(HMODULE, DWORD, LPVOID)
|
|
||||||
{
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@@ -1,36 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include <atomic>
|
|
||||||
|
|
||||||
// A simple queue. No locks, but only works with a single thread as producer and a single thread as
|
|
||||||
// a consumer. Mutex up as needed.
|
|
||||||
|
|
||||||
template <typename ElementType, size_t QueueSize>
|
|
||||||
class MsgQueue {
|
|
||||||
ElementType queue_[QueueSize];
|
|
||||||
std::atomic_uint nextAdd_{0};
|
|
||||||
std::atomic_uint nextSend_{0};
|
|
||||||
std::atomic_uint pendingSends_{0};
|
|
||||||
|
|
||||||
public:
|
|
||||||
MsgQueue() {}
|
|
||||||
|
|
||||||
ElementType* GetNextAddMessage()
|
|
||||||
{
|
|
||||||
// if we are falling behind, bail
|
|
||||||
if (pendingSends_.load() >= QueueSize) {
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
auto index = (nextAdd_++) % QueueSize;
|
|
||||||
return &queue_[index];
|
|
||||||
}
|
|
||||||
void CommitAdd() { ++pendingSends_; }
|
|
||||||
|
|
||||||
bool HavePendingSends() const { return pendingSends_.load() != 0; }
|
|
||||||
ElementType* GetNextSendMessage()
|
|
||||||
{
|
|
||||||
auto index = (nextSend_++) % QueueSize;
|
|
||||||
return &queue_[index];
|
|
||||||
}
|
|
||||||
void CommitSend() { --pendingSends_; }
|
|
||||||
};
|
|
||||||
@@ -1,271 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_ALLOCATORS_H_
|
|
||||||
#define RAPIDJSON_ALLOCATORS_H_
|
|
||||||
|
|
||||||
#include "rapidjson.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// Allocator
|
|
||||||
|
|
||||||
/*! \class rapidjson::Allocator
|
|
||||||
\brief Concept for allocating, resizing and freeing memory block.
|
|
||||||
|
|
||||||
Note that Malloc() and Realloc() are non-static but Free() is static.
|
|
||||||
|
|
||||||
So if an allocator need to support Free(), it needs to put its pointer in
|
|
||||||
the header of memory block.
|
|
||||||
|
|
||||||
\code
|
|
||||||
concept Allocator {
|
|
||||||
static const bool kNeedFree; //!< Whether this allocator needs to call Free().
|
|
||||||
|
|
||||||
// Allocate a memory block.
|
|
||||||
// \param size of the memory block in bytes.
|
|
||||||
// \returns pointer to the memory block.
|
|
||||||
void* Malloc(size_t size);
|
|
||||||
|
|
||||||
// Resize a memory block.
|
|
||||||
// \param originalPtr The pointer to current memory block. Null pointer is permitted.
|
|
||||||
// \param originalSize The current size in bytes. (Design issue: since some allocator may not book-keep this, explicitly pass to it can save memory.)
|
|
||||||
// \param newSize the new size in bytes.
|
|
||||||
void* Realloc(void* originalPtr, size_t originalSize, size_t newSize);
|
|
||||||
|
|
||||||
// Free a memory block.
|
|
||||||
// \param pointer to the memory block. Null pointer is permitted.
|
|
||||||
static void Free(void *ptr);
|
|
||||||
};
|
|
||||||
\endcode
|
|
||||||
*/
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// CrtAllocator
|
|
||||||
|
|
||||||
//! C-runtime library allocator.
|
|
||||||
/*! This class is just wrapper for standard C library memory routines.
|
|
||||||
\note implements Allocator concept
|
|
||||||
*/
|
|
||||||
class CrtAllocator {
|
|
||||||
public:
|
|
||||||
static const bool kNeedFree = true;
|
|
||||||
void* Malloc(size_t size) {
|
|
||||||
if (size) // behavior of malloc(0) is implementation defined.
|
|
||||||
return std::malloc(size);
|
|
||||||
else
|
|
||||||
return NULL; // standardize to returning NULL.
|
|
||||||
}
|
|
||||||
void* Realloc(void* originalPtr, size_t originalSize, size_t newSize) {
|
|
||||||
(void)originalSize;
|
|
||||||
if (newSize == 0) {
|
|
||||||
std::free(originalPtr);
|
|
||||||
return NULL;
|
|
||||||
}
|
|
||||||
return std::realloc(originalPtr, newSize);
|
|
||||||
}
|
|
||||||
static void Free(void *ptr) { std::free(ptr); }
|
|
||||||
};
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// MemoryPoolAllocator
|
|
||||||
|
|
||||||
//! Default memory allocator used by the parser and DOM.
|
|
||||||
/*! This allocator allocate memory blocks from pre-allocated memory chunks.
|
|
||||||
|
|
||||||
It does not free memory blocks. And Realloc() only allocate new memory.
|
|
||||||
|
|
||||||
The memory chunks are allocated by BaseAllocator, which is CrtAllocator by default.
|
|
||||||
|
|
||||||
User may also supply a buffer as the first chunk.
|
|
||||||
|
|
||||||
If the user-buffer is full then additional chunks are allocated by BaseAllocator.
|
|
||||||
|
|
||||||
The user-buffer is not deallocated by this allocator.
|
|
||||||
|
|
||||||
\tparam BaseAllocator the allocator type for allocating memory chunks. Default is CrtAllocator.
|
|
||||||
\note implements Allocator concept
|
|
||||||
*/
|
|
||||||
template <typename BaseAllocator = CrtAllocator>
|
|
||||||
class MemoryPoolAllocator {
|
|
||||||
public:
|
|
||||||
static const bool kNeedFree = false; //!< Tell users that no need to call Free() with this allocator. (concept Allocator)
|
|
||||||
|
|
||||||
//! Constructor with chunkSize.
|
|
||||||
/*! \param chunkSize The size of memory chunk. The default is kDefaultChunkSize.
|
|
||||||
\param baseAllocator The allocator for allocating memory chunks.
|
|
||||||
*/
|
|
||||||
MemoryPoolAllocator(size_t chunkSize = kDefaultChunkCapacity, BaseAllocator* baseAllocator = 0) :
|
|
||||||
chunkHead_(0), chunk_capacity_(chunkSize), userBuffer_(0), baseAllocator_(baseAllocator), ownBaseAllocator_(0)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Constructor with user-supplied buffer.
|
|
||||||
/*! The user buffer will be used firstly. When it is full, memory pool allocates new chunk with chunk size.
|
|
||||||
|
|
||||||
The user buffer will not be deallocated when this allocator is destructed.
|
|
||||||
|
|
||||||
\param buffer User supplied buffer.
|
|
||||||
\param size Size of the buffer in bytes. It must at least larger than sizeof(ChunkHeader).
|
|
||||||
\param chunkSize The size of memory chunk. The default is kDefaultChunkSize.
|
|
||||||
\param baseAllocator The allocator for allocating memory chunks.
|
|
||||||
*/
|
|
||||||
MemoryPoolAllocator(void *buffer, size_t size, size_t chunkSize = kDefaultChunkCapacity, BaseAllocator* baseAllocator = 0) :
|
|
||||||
chunkHead_(0), chunk_capacity_(chunkSize), userBuffer_(buffer), baseAllocator_(baseAllocator), ownBaseAllocator_(0)
|
|
||||||
{
|
|
||||||
RAPIDJSON_ASSERT(buffer != 0);
|
|
||||||
RAPIDJSON_ASSERT(size > sizeof(ChunkHeader));
|
|
||||||
chunkHead_ = reinterpret_cast<ChunkHeader*>(buffer);
|
|
||||||
chunkHead_->capacity = size - sizeof(ChunkHeader);
|
|
||||||
chunkHead_->size = 0;
|
|
||||||
chunkHead_->next = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Destructor.
|
|
||||||
/*! This deallocates all memory chunks, excluding the user-supplied buffer.
|
|
||||||
*/
|
|
||||||
~MemoryPoolAllocator() {
|
|
||||||
Clear();
|
|
||||||
RAPIDJSON_DELETE(ownBaseAllocator_);
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Deallocates all memory chunks, excluding the user-supplied buffer.
|
|
||||||
void Clear() {
|
|
||||||
while (chunkHead_ && chunkHead_ != userBuffer_) {
|
|
||||||
ChunkHeader* next = chunkHead_->next;
|
|
||||||
baseAllocator_->Free(chunkHead_);
|
|
||||||
chunkHead_ = next;
|
|
||||||
}
|
|
||||||
if (chunkHead_ && chunkHead_ == userBuffer_)
|
|
||||||
chunkHead_->size = 0; // Clear user buffer
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Computes the total capacity of allocated memory chunks.
|
|
||||||
/*! \return total capacity in bytes.
|
|
||||||
*/
|
|
||||||
size_t Capacity() const {
|
|
||||||
size_t capacity = 0;
|
|
||||||
for (ChunkHeader* c = chunkHead_; c != 0; c = c->next)
|
|
||||||
capacity += c->capacity;
|
|
||||||
return capacity;
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Computes the memory blocks allocated.
|
|
||||||
/*! \return total used bytes.
|
|
||||||
*/
|
|
||||||
size_t Size() const {
|
|
||||||
size_t size = 0;
|
|
||||||
for (ChunkHeader* c = chunkHead_; c != 0; c = c->next)
|
|
||||||
size += c->size;
|
|
||||||
return size;
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Allocates a memory block. (concept Allocator)
|
|
||||||
void* Malloc(size_t size) {
|
|
||||||
if (!size)
|
|
||||||
return NULL;
|
|
||||||
|
|
||||||
size = RAPIDJSON_ALIGN(size);
|
|
||||||
if (chunkHead_ == 0 || chunkHead_->size + size > chunkHead_->capacity)
|
|
||||||
if (!AddChunk(chunk_capacity_ > size ? chunk_capacity_ : size))
|
|
||||||
return NULL;
|
|
||||||
|
|
||||||
void *buffer = reinterpret_cast<char *>(chunkHead_) + RAPIDJSON_ALIGN(sizeof(ChunkHeader)) + chunkHead_->size;
|
|
||||||
chunkHead_->size += size;
|
|
||||||
return buffer;
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Resizes a memory block (concept Allocator)
|
|
||||||
void* Realloc(void* originalPtr, size_t originalSize, size_t newSize) {
|
|
||||||
if (originalPtr == 0)
|
|
||||||
return Malloc(newSize);
|
|
||||||
|
|
||||||
if (newSize == 0)
|
|
||||||
return NULL;
|
|
||||||
|
|
||||||
originalSize = RAPIDJSON_ALIGN(originalSize);
|
|
||||||
newSize = RAPIDJSON_ALIGN(newSize);
|
|
||||||
|
|
||||||
// Do not shrink if new size is smaller than original
|
|
||||||
if (originalSize >= newSize)
|
|
||||||
return originalPtr;
|
|
||||||
|
|
||||||
// Simply expand it if it is the last allocation and there is sufficient space
|
|
||||||
if (originalPtr == reinterpret_cast<char *>(chunkHead_) + RAPIDJSON_ALIGN(sizeof(ChunkHeader)) + chunkHead_->size - originalSize) {
|
|
||||||
size_t increment = static_cast<size_t>(newSize - originalSize);
|
|
||||||
if (chunkHead_->size + increment <= chunkHead_->capacity) {
|
|
||||||
chunkHead_->size += increment;
|
|
||||||
return originalPtr;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Realloc process: allocate and copy memory, do not free original buffer.
|
|
||||||
if (void* newBuffer = Malloc(newSize)) {
|
|
||||||
if (originalSize)
|
|
||||||
std::memcpy(newBuffer, originalPtr, originalSize);
|
|
||||||
return newBuffer;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
return NULL;
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Frees a memory block (concept Allocator)
|
|
||||||
static void Free(void *ptr) { (void)ptr; } // Do nothing
|
|
||||||
|
|
||||||
private:
|
|
||||||
//! Copy constructor is not permitted.
|
|
||||||
MemoryPoolAllocator(const MemoryPoolAllocator& rhs) /* = delete */;
|
|
||||||
//! Copy assignment operator is not permitted.
|
|
||||||
MemoryPoolAllocator& operator=(const MemoryPoolAllocator& rhs) /* = delete */;
|
|
||||||
|
|
||||||
//! Creates a new chunk.
|
|
||||||
/*! \param capacity Capacity of the chunk in bytes.
|
|
||||||
\return true if success.
|
|
||||||
*/
|
|
||||||
bool AddChunk(size_t capacity) {
|
|
||||||
if (!baseAllocator_)
|
|
||||||
ownBaseAllocator_ = baseAllocator_ = RAPIDJSON_NEW(BaseAllocator());
|
|
||||||
if (ChunkHeader* chunk = reinterpret_cast<ChunkHeader*>(baseAllocator_->Malloc(RAPIDJSON_ALIGN(sizeof(ChunkHeader)) + capacity))) {
|
|
||||||
chunk->capacity = capacity;
|
|
||||||
chunk->size = 0;
|
|
||||||
chunk->next = chunkHead_;
|
|
||||||
chunkHead_ = chunk;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
static const int kDefaultChunkCapacity = 64 * 1024; //!< Default chunk capacity.
|
|
||||||
|
|
||||||
//! Chunk header for perpending to each chunk.
|
|
||||||
/*! Chunks are stored as a singly linked list.
|
|
||||||
*/
|
|
||||||
struct ChunkHeader {
|
|
||||||
size_t capacity; //!< Capacity of the chunk in bytes (excluding the header itself).
|
|
||||||
size_t size; //!< Current size of allocated memory in bytes.
|
|
||||||
ChunkHeader *next; //!< Next chunk in the linked list.
|
|
||||||
};
|
|
||||||
|
|
||||||
ChunkHeader *chunkHead_; //!< Head of the chunk linked-list. Only the head chunk serves allocation.
|
|
||||||
size_t chunk_capacity_; //!< The minimum capacity of chunk when they are allocated.
|
|
||||||
void *userBuffer_; //!< User supplied buffer.
|
|
||||||
BaseAllocator* baseAllocator_; //!< base allocator for allocating memory chunks.
|
|
||||||
BaseAllocator* ownBaseAllocator_; //!< base allocator created by this object.
|
|
||||||
};
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_ENCODINGS_H_
|
|
||||||
File diff suppressed because it is too large
Load Diff
@@ -1,299 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_ENCODEDSTREAM_H_
|
|
||||||
#define RAPIDJSON_ENCODEDSTREAM_H_
|
|
||||||
|
|
||||||
#include "stream.h"
|
|
||||||
#include "memorystream.h"
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(effc++)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(padded)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Input byte stream wrapper with a statically bound encoding.
|
|
||||||
/*!
|
|
||||||
\tparam Encoding The interpretation of encoding of the stream. Either UTF8, UTF16LE, UTF16BE, UTF32LE, UTF32BE.
|
|
||||||
\tparam InputByteStream Type of input byte stream. For example, FileReadStream.
|
|
||||||
*/
|
|
||||||
template <typename Encoding, typename InputByteStream>
|
|
||||||
class EncodedInputStream {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
public:
|
|
||||||
typedef typename Encoding::Ch Ch;
|
|
||||||
|
|
||||||
EncodedInputStream(InputByteStream& is) : is_(is) {
|
|
||||||
current_ = Encoding::TakeBOM(is_);
|
|
||||||
}
|
|
||||||
|
|
||||||
Ch Peek() const { return current_; }
|
|
||||||
Ch Take() { Ch c = current_; current_ = Encoding::Take(is_); return c; }
|
|
||||||
size_t Tell() const { return is_.Tell(); }
|
|
||||||
|
|
||||||
// Not implemented
|
|
||||||
void Put(Ch) { RAPIDJSON_ASSERT(false); }
|
|
||||||
void Flush() { RAPIDJSON_ASSERT(false); }
|
|
||||||
Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
EncodedInputStream(const EncodedInputStream&);
|
|
||||||
EncodedInputStream& operator=(const EncodedInputStream&);
|
|
||||||
|
|
||||||
InputByteStream& is_;
|
|
||||||
Ch current_;
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Specialized for UTF8 MemoryStream.
|
|
||||||
template <>
|
|
||||||
class EncodedInputStream<UTF8<>, MemoryStream> {
|
|
||||||
public:
|
|
||||||
typedef UTF8<>::Ch Ch;
|
|
||||||
|
|
||||||
EncodedInputStream(MemoryStream& is) : is_(is) {
|
|
||||||
if (static_cast<unsigned char>(is_.Peek()) == 0xEFu) is_.Take();
|
|
||||||
if (static_cast<unsigned char>(is_.Peek()) == 0xBBu) is_.Take();
|
|
||||||
if (static_cast<unsigned char>(is_.Peek()) == 0xBFu) is_.Take();
|
|
||||||
}
|
|
||||||
Ch Peek() const { return is_.Peek(); }
|
|
||||||
Ch Take() { return is_.Take(); }
|
|
||||||
size_t Tell() const { return is_.Tell(); }
|
|
||||||
|
|
||||||
// Not implemented
|
|
||||||
void Put(Ch) {}
|
|
||||||
void Flush() {}
|
|
||||||
Ch* PutBegin() { return 0; }
|
|
||||||
size_t PutEnd(Ch*) { return 0; }
|
|
||||||
|
|
||||||
MemoryStream& is_;
|
|
||||||
|
|
||||||
private:
|
|
||||||
EncodedInputStream(const EncodedInputStream&);
|
|
||||||
EncodedInputStream& operator=(const EncodedInputStream&);
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Output byte stream wrapper with statically bound encoding.
|
|
||||||
/*!
|
|
||||||
\tparam Encoding The interpretation of encoding of the stream. Either UTF8, UTF16LE, UTF16BE, UTF32LE, UTF32BE.
|
|
||||||
\tparam OutputByteStream Type of input byte stream. For example, FileWriteStream.
|
|
||||||
*/
|
|
||||||
template <typename Encoding, typename OutputByteStream>
|
|
||||||
class EncodedOutputStream {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
public:
|
|
||||||
typedef typename Encoding::Ch Ch;
|
|
||||||
|
|
||||||
EncodedOutputStream(OutputByteStream& os, bool putBOM = true) : os_(os) {
|
|
||||||
if (putBOM)
|
|
||||||
Encoding::PutBOM(os_);
|
|
||||||
}
|
|
||||||
|
|
||||||
void Put(Ch c) { Encoding::Put(os_, c); }
|
|
||||||
void Flush() { os_.Flush(); }
|
|
||||||
|
|
||||||
// Not implemented
|
|
||||||
Ch Peek() const { RAPIDJSON_ASSERT(false); return 0;}
|
|
||||||
Ch Take() { RAPIDJSON_ASSERT(false); return 0;}
|
|
||||||
size_t Tell() const { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
EncodedOutputStream(const EncodedOutputStream&);
|
|
||||||
EncodedOutputStream& operator=(const EncodedOutputStream&);
|
|
||||||
|
|
||||||
OutputByteStream& os_;
|
|
||||||
};
|
|
||||||
|
|
||||||
#define RAPIDJSON_ENCODINGS_FUNC(x) UTF8<Ch>::x, UTF16LE<Ch>::x, UTF16BE<Ch>::x, UTF32LE<Ch>::x, UTF32BE<Ch>::x
|
|
||||||
|
|
||||||
//! Input stream wrapper with dynamically bound encoding and automatic encoding detection.
|
|
||||||
/*!
|
|
||||||
\tparam CharType Type of character for reading.
|
|
||||||
\tparam InputByteStream type of input byte stream to be wrapped.
|
|
||||||
*/
|
|
||||||
template <typename CharType, typename InputByteStream>
|
|
||||||
class AutoUTFInputStream {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
public:
|
|
||||||
typedef CharType Ch;
|
|
||||||
|
|
||||||
//! Constructor.
|
|
||||||
/*!
|
|
||||||
\param is input stream to be wrapped.
|
|
||||||
\param type UTF encoding type if it is not detected from the stream.
|
|
||||||
*/
|
|
||||||
AutoUTFInputStream(InputByteStream& is, UTFType type = kUTF8) : is_(&is), type_(type), hasBOM_(false) {
|
|
||||||
RAPIDJSON_ASSERT(type >= kUTF8 && type <= kUTF32BE);
|
|
||||||
DetectType();
|
|
||||||
static const TakeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Take) };
|
|
||||||
takeFunc_ = f[type_];
|
|
||||||
current_ = takeFunc_(*is_);
|
|
||||||
}
|
|
||||||
|
|
||||||
UTFType GetType() const { return type_; }
|
|
||||||
bool HasBOM() const { return hasBOM_; }
|
|
||||||
|
|
||||||
Ch Peek() const { return current_; }
|
|
||||||
Ch Take() { Ch c = current_; current_ = takeFunc_(*is_); return c; }
|
|
||||||
size_t Tell() const { return is_->Tell(); }
|
|
||||||
|
|
||||||
// Not implemented
|
|
||||||
void Put(Ch) { RAPIDJSON_ASSERT(false); }
|
|
||||||
void Flush() { RAPIDJSON_ASSERT(false); }
|
|
||||||
Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
AutoUTFInputStream(const AutoUTFInputStream&);
|
|
||||||
AutoUTFInputStream& operator=(const AutoUTFInputStream&);
|
|
||||||
|
|
||||||
// Detect encoding type with BOM or RFC 4627
|
|
||||||
void DetectType() {
|
|
||||||
// BOM (Byte Order Mark):
|
|
||||||
// 00 00 FE FF UTF-32BE
|
|
||||||
// FF FE 00 00 UTF-32LE
|
|
||||||
// FE FF UTF-16BE
|
|
||||||
// FF FE UTF-16LE
|
|
||||||
// EF BB BF UTF-8
|
|
||||||
|
|
||||||
const unsigned char* c = reinterpret_cast<const unsigned char *>(is_->Peek4());
|
|
||||||
if (!c)
|
|
||||||
return;
|
|
||||||
|
|
||||||
unsigned bom = static_cast<unsigned>(c[0] | (c[1] << 8) | (c[2] << 16) | (c[3] << 24));
|
|
||||||
hasBOM_ = false;
|
|
||||||
if (bom == 0xFFFE0000) { type_ = kUTF32BE; hasBOM_ = true; is_->Take(); is_->Take(); is_->Take(); is_->Take(); }
|
|
||||||
else if (bom == 0x0000FEFF) { type_ = kUTF32LE; hasBOM_ = true; is_->Take(); is_->Take(); is_->Take(); is_->Take(); }
|
|
||||||
else if ((bom & 0xFFFF) == 0xFFFE) { type_ = kUTF16BE; hasBOM_ = true; is_->Take(); is_->Take(); }
|
|
||||||
else if ((bom & 0xFFFF) == 0xFEFF) { type_ = kUTF16LE; hasBOM_ = true; is_->Take(); is_->Take(); }
|
|
||||||
else if ((bom & 0xFFFFFF) == 0xBFBBEF) { type_ = kUTF8; hasBOM_ = true; is_->Take(); is_->Take(); is_->Take(); }
|
|
||||||
|
|
||||||
// RFC 4627: Section 3
|
|
||||||
// "Since the first two characters of a JSON text will always be ASCII
|
|
||||||
// characters [RFC0020], it is possible to determine whether an octet
|
|
||||||
// stream is UTF-8, UTF-16 (BE or LE), or UTF-32 (BE or LE) by looking
|
|
||||||
// at the pattern of nulls in the first four octets."
|
|
||||||
// 00 00 00 xx UTF-32BE
|
|
||||||
// 00 xx 00 xx UTF-16BE
|
|
||||||
// xx 00 00 00 UTF-32LE
|
|
||||||
// xx 00 xx 00 UTF-16LE
|
|
||||||
// xx xx xx xx UTF-8
|
|
||||||
|
|
||||||
if (!hasBOM_) {
|
|
||||||
unsigned pattern = (c[0] ? 1 : 0) | (c[1] ? 2 : 0) | (c[2] ? 4 : 0) | (c[3] ? 8 : 0);
|
|
||||||
switch (pattern) {
|
|
||||||
case 0x08: type_ = kUTF32BE; break;
|
|
||||||
case 0x0A: type_ = kUTF16BE; break;
|
|
||||||
case 0x01: type_ = kUTF32LE; break;
|
|
||||||
case 0x05: type_ = kUTF16LE; break;
|
|
||||||
case 0x0F: type_ = kUTF8; break;
|
|
||||||
default: break; // Use type defined by user.
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Runtime check whether the size of character type is sufficient. It only perform checks with assertion.
|
|
||||||
if (type_ == kUTF16LE || type_ == kUTF16BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 2);
|
|
||||||
if (type_ == kUTF32LE || type_ == kUTF32BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 4);
|
|
||||||
}
|
|
||||||
|
|
||||||
typedef Ch (*TakeFunc)(InputByteStream& is);
|
|
||||||
InputByteStream* is_;
|
|
||||||
UTFType type_;
|
|
||||||
Ch current_;
|
|
||||||
TakeFunc takeFunc_;
|
|
||||||
bool hasBOM_;
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Output stream wrapper with dynamically bound encoding and automatic encoding detection.
|
|
||||||
/*!
|
|
||||||
\tparam CharType Type of character for writing.
|
|
||||||
\tparam OutputByteStream type of output byte stream to be wrapped.
|
|
||||||
*/
|
|
||||||
template <typename CharType, typename OutputByteStream>
|
|
||||||
class AutoUTFOutputStream {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
public:
|
|
||||||
typedef CharType Ch;
|
|
||||||
|
|
||||||
//! Constructor.
|
|
||||||
/*!
|
|
||||||
\param os output stream to be wrapped.
|
|
||||||
\param type UTF encoding type.
|
|
||||||
\param putBOM Whether to write BOM at the beginning of the stream.
|
|
||||||
*/
|
|
||||||
AutoUTFOutputStream(OutputByteStream& os, UTFType type, bool putBOM) : os_(&os), type_(type) {
|
|
||||||
RAPIDJSON_ASSERT(type >= kUTF8 && type <= kUTF32BE);
|
|
||||||
|
|
||||||
// Runtime check whether the size of character type is sufficient. It only perform checks with assertion.
|
|
||||||
if (type_ == kUTF16LE || type_ == kUTF16BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 2);
|
|
||||||
if (type_ == kUTF32LE || type_ == kUTF32BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 4);
|
|
||||||
|
|
||||||
static const PutFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Put) };
|
|
||||||
putFunc_ = f[type_];
|
|
||||||
|
|
||||||
if (putBOM)
|
|
||||||
PutBOM();
|
|
||||||
}
|
|
||||||
|
|
||||||
UTFType GetType() const { return type_; }
|
|
||||||
|
|
||||||
void Put(Ch c) { putFunc_(*os_, c); }
|
|
||||||
void Flush() { os_->Flush(); }
|
|
||||||
|
|
||||||
// Not implemented
|
|
||||||
Ch Peek() const { RAPIDJSON_ASSERT(false); return 0;}
|
|
||||||
Ch Take() { RAPIDJSON_ASSERT(false); return 0;}
|
|
||||||
size_t Tell() const { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
AutoUTFOutputStream(const AutoUTFOutputStream&);
|
|
||||||
AutoUTFOutputStream& operator=(const AutoUTFOutputStream&);
|
|
||||||
|
|
||||||
void PutBOM() {
|
|
||||||
typedef void (*PutBOMFunc)(OutputByteStream&);
|
|
||||||
static const PutBOMFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(PutBOM) };
|
|
||||||
f[type_](*os_);
|
|
||||||
}
|
|
||||||
|
|
||||||
typedef void (*PutFunc)(OutputByteStream&, Ch);
|
|
||||||
|
|
||||||
OutputByteStream* os_;
|
|
||||||
UTFType type_;
|
|
||||||
PutFunc putFunc_;
|
|
||||||
};
|
|
||||||
|
|
||||||
#undef RAPIDJSON_ENCODINGS_FUNC
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_FILESTREAM_H_
|
|
||||||
@@ -1,716 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_ENCODINGS_H_
|
|
||||||
#define RAPIDJSON_ENCODINGS_H_
|
|
||||||
|
|
||||||
#include "rapidjson.h"
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(4244) // conversion from 'type1' to 'type2', possible loss of data
|
|
||||||
RAPIDJSON_DIAG_OFF(4702) // unreachable code
|
|
||||||
#elif defined(__GNUC__)
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(effc++)
|
|
||||||
RAPIDJSON_DIAG_OFF(overflow)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// Encoding
|
|
||||||
|
|
||||||
/*! \class rapidjson::Encoding
|
|
||||||
\brief Concept for encoding of Unicode characters.
|
|
||||||
|
|
||||||
\code
|
|
||||||
concept Encoding {
|
|
||||||
typename Ch; //! Type of character. A "character" is actually a code unit in unicode's definition.
|
|
||||||
|
|
||||||
enum { supportUnicode = 1 }; // or 0 if not supporting unicode
|
|
||||||
|
|
||||||
//! \brief Encode a Unicode codepoint to an output stream.
|
|
||||||
//! \param os Output stream.
|
|
||||||
//! \param codepoint An unicode codepoint, ranging from 0x0 to 0x10FFFF inclusively.
|
|
||||||
template<typename OutputStream>
|
|
||||||
static void Encode(OutputStream& os, unsigned codepoint);
|
|
||||||
|
|
||||||
//! \brief Decode a Unicode codepoint from an input stream.
|
|
||||||
//! \param is Input stream.
|
|
||||||
//! \param codepoint Output of the unicode codepoint.
|
|
||||||
//! \return true if a valid codepoint can be decoded from the stream.
|
|
||||||
template <typename InputStream>
|
|
||||||
static bool Decode(InputStream& is, unsigned* codepoint);
|
|
||||||
|
|
||||||
//! \brief Validate one Unicode codepoint from an encoded stream.
|
|
||||||
//! \param is Input stream to obtain codepoint.
|
|
||||||
//! \param os Output for copying one codepoint.
|
|
||||||
//! \return true if it is valid.
|
|
||||||
//! \note This function just validating and copying the codepoint without actually decode it.
|
|
||||||
template <typename InputStream, typename OutputStream>
|
|
||||||
static bool Validate(InputStream& is, OutputStream& os);
|
|
||||||
|
|
||||||
// The following functions are deal with byte streams.
|
|
||||||
|
|
||||||
//! Take a character from input byte stream, skip BOM if exist.
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType TakeBOM(InputByteStream& is);
|
|
||||||
|
|
||||||
//! Take a character from input byte stream.
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static Ch Take(InputByteStream& is);
|
|
||||||
|
|
||||||
//! Put BOM to output byte stream.
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void PutBOM(OutputByteStream& os);
|
|
||||||
|
|
||||||
//! Put a character to output byte stream.
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void Put(OutputByteStream& os, Ch c);
|
|
||||||
};
|
|
||||||
\endcode
|
|
||||||
*/
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// UTF8
|
|
||||||
|
|
||||||
//! UTF-8 encoding.
|
|
||||||
/*! http://en.wikipedia.org/wiki/UTF-8
|
|
||||||
http://tools.ietf.org/html/rfc3629
|
|
||||||
\tparam CharType Code unit for storing 8-bit UTF-8 data. Default is char.
|
|
||||||
\note implements Encoding concept
|
|
||||||
*/
|
|
||||||
template<typename CharType = char>
|
|
||||||
struct UTF8 {
|
|
||||||
typedef CharType Ch;
|
|
||||||
|
|
||||||
enum { supportUnicode = 1 };
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
static void Encode(OutputStream& os, unsigned codepoint) {
|
|
||||||
if (codepoint <= 0x7F)
|
|
||||||
os.Put(static_cast<Ch>(codepoint & 0xFF));
|
|
||||||
else if (codepoint <= 0x7FF) {
|
|
||||||
os.Put(static_cast<Ch>(0xC0 | ((codepoint >> 6) & 0xFF)));
|
|
||||||
os.Put(static_cast<Ch>(0x80 | ((codepoint & 0x3F))));
|
|
||||||
}
|
|
||||||
else if (codepoint <= 0xFFFF) {
|
|
||||||
os.Put(static_cast<Ch>(0xE0 | ((codepoint >> 12) & 0xFF)));
|
|
||||||
os.Put(static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));
|
|
||||||
os.Put(static_cast<Ch>(0x80 | (codepoint & 0x3F)));
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
|
|
||||||
os.Put(static_cast<Ch>(0xF0 | ((codepoint >> 18) & 0xFF)));
|
|
||||||
os.Put(static_cast<Ch>(0x80 | ((codepoint >> 12) & 0x3F)));
|
|
||||||
os.Put(static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));
|
|
||||||
os.Put(static_cast<Ch>(0x80 | (codepoint & 0x3F)));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
static void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
|
|
||||||
if (codepoint <= 0x7F)
|
|
||||||
PutUnsafe(os, static_cast<Ch>(codepoint & 0xFF));
|
|
||||||
else if (codepoint <= 0x7FF) {
|
|
||||||
PutUnsafe(os, static_cast<Ch>(0xC0 | ((codepoint >> 6) & 0xFF)));
|
|
||||||
PutUnsafe(os, static_cast<Ch>(0x80 | ((codepoint & 0x3F))));
|
|
||||||
}
|
|
||||||
else if (codepoint <= 0xFFFF) {
|
|
||||||
PutUnsafe(os, static_cast<Ch>(0xE0 | ((codepoint >> 12) & 0xFF)));
|
|
||||||
PutUnsafe(os, static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));
|
|
||||||
PutUnsafe(os, static_cast<Ch>(0x80 | (codepoint & 0x3F)));
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
|
|
||||||
PutUnsafe(os, static_cast<Ch>(0xF0 | ((codepoint >> 18) & 0xFF)));
|
|
||||||
PutUnsafe(os, static_cast<Ch>(0x80 | ((codepoint >> 12) & 0x3F)));
|
|
||||||
PutUnsafe(os, static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));
|
|
||||||
PutUnsafe(os, static_cast<Ch>(0x80 | (codepoint & 0x3F)));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
static bool Decode(InputStream& is, unsigned* codepoint) {
|
|
||||||
#define COPY() c = is.Take(); *codepoint = (*codepoint << 6) | (static_cast<unsigned char>(c) & 0x3Fu)
|
|
||||||
#define TRANS(mask) result &= ((GetRange(static_cast<unsigned char>(c)) & mask) != 0)
|
|
||||||
#define TAIL() COPY(); TRANS(0x70)
|
|
||||||
typename InputStream::Ch c = is.Take();
|
|
||||||
if (!(c & 0x80)) {
|
|
||||||
*codepoint = static_cast<unsigned char>(c);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
unsigned char type = GetRange(static_cast<unsigned char>(c));
|
|
||||||
if (type >= 32) {
|
|
||||||
*codepoint = 0;
|
|
||||||
} else {
|
|
||||||
*codepoint = (0xFF >> type) & static_cast<unsigned char>(c);
|
|
||||||
}
|
|
||||||
bool result = true;
|
|
||||||
switch (type) {
|
|
||||||
case 2: TAIL(); return result;
|
|
||||||
case 3: TAIL(); TAIL(); return result;
|
|
||||||
case 4: COPY(); TRANS(0x50); TAIL(); return result;
|
|
||||||
case 5: COPY(); TRANS(0x10); TAIL(); TAIL(); return result;
|
|
||||||
case 6: TAIL(); TAIL(); TAIL(); return result;
|
|
||||||
case 10: COPY(); TRANS(0x20); TAIL(); return result;
|
|
||||||
case 11: COPY(); TRANS(0x60); TAIL(); TAIL(); return result;
|
|
||||||
default: return false;
|
|
||||||
}
|
|
||||||
#undef COPY
|
|
||||||
#undef TRANS
|
|
||||||
#undef TAIL
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream, typename OutputStream>
|
|
||||||
static bool Validate(InputStream& is, OutputStream& os) {
|
|
||||||
#define COPY() os.Put(c = is.Take())
|
|
||||||
#define TRANS(mask) result &= ((GetRange(static_cast<unsigned char>(c)) & mask) != 0)
|
|
||||||
#define TAIL() COPY(); TRANS(0x70)
|
|
||||||
Ch c;
|
|
||||||
COPY();
|
|
||||||
if (!(c & 0x80))
|
|
||||||
return true;
|
|
||||||
|
|
||||||
bool result = true;
|
|
||||||
switch (GetRange(static_cast<unsigned char>(c))) {
|
|
||||||
case 2: TAIL(); return result;
|
|
||||||
case 3: TAIL(); TAIL(); return result;
|
|
||||||
case 4: COPY(); TRANS(0x50); TAIL(); return result;
|
|
||||||
case 5: COPY(); TRANS(0x10); TAIL(); TAIL(); return result;
|
|
||||||
case 6: TAIL(); TAIL(); TAIL(); return result;
|
|
||||||
case 10: COPY(); TRANS(0x20); TAIL(); return result;
|
|
||||||
case 11: COPY(); TRANS(0x60); TAIL(); TAIL(); return result;
|
|
||||||
default: return false;
|
|
||||||
}
|
|
||||||
#undef COPY
|
|
||||||
#undef TRANS
|
|
||||||
#undef TAIL
|
|
||||||
}
|
|
||||||
|
|
||||||
static unsigned char GetRange(unsigned char c) {
|
|
||||||
// Referring to DFA of http://bjoern.hoehrmann.de/utf-8/decoder/dfa/
|
|
||||||
// With new mapping 1 -> 0x10, 7 -> 0x20, 9 -> 0x40, such that AND operation can test multiple types.
|
|
||||||
static const unsigned char type[] = {
|
|
||||||
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
||||||
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
||||||
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
||||||
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
|
|
||||||
0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,
|
|
||||||
0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,
|
|
||||||
0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,
|
|
||||||
0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,
|
|
||||||
8,8,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
|
|
||||||
10,3,3,3,3,3,3,3,3,3,3,3,3,4,3,3, 11,6,6,6,5,8,8,8,8,8,8,8,8,8,8,8,
|
|
||||||
};
|
|
||||||
return type[c];
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType TakeBOM(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
typename InputByteStream::Ch c = Take(is);
|
|
||||||
if (static_cast<unsigned char>(c) != 0xEFu) return c;
|
|
||||||
c = is.Take();
|
|
||||||
if (static_cast<unsigned char>(c) != 0xBBu) return c;
|
|
||||||
c = is.Take();
|
|
||||||
if (static_cast<unsigned char>(c) != 0xBFu) return c;
|
|
||||||
c = is.Take();
|
|
||||||
return c;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static Ch Take(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
return static_cast<Ch>(is.Take());
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void PutBOM(OutputByteStream& os) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xEFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xBBu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xBFu));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void Put(OutputByteStream& os, Ch c) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(c));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// UTF16
|
|
||||||
|
|
||||||
//! UTF-16 encoding.
|
|
||||||
/*! http://en.wikipedia.org/wiki/UTF-16
|
|
||||||
http://tools.ietf.org/html/rfc2781
|
|
||||||
\tparam CharType Type for storing 16-bit UTF-16 data. Default is wchar_t. C++11 may use char16_t instead.
|
|
||||||
\note implements Encoding concept
|
|
||||||
|
|
||||||
\note For in-memory access, no need to concern endianness. The code units and code points are represented by CPU's endianness.
|
|
||||||
For streaming, use UTF16LE and UTF16BE, which handle endianness.
|
|
||||||
*/
|
|
||||||
template<typename CharType = wchar_t>
|
|
||||||
struct UTF16 {
|
|
||||||
typedef CharType Ch;
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(Ch) >= 2);
|
|
||||||
|
|
||||||
enum { supportUnicode = 1 };
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
static void Encode(OutputStream& os, unsigned codepoint) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 2);
|
|
||||||
if (codepoint <= 0xFFFF) {
|
|
||||||
RAPIDJSON_ASSERT(codepoint < 0xD800 || codepoint > 0xDFFF); // Code point itself cannot be surrogate pair
|
|
||||||
os.Put(static_cast<typename OutputStream::Ch>(codepoint));
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
|
|
||||||
unsigned v = codepoint - 0x10000;
|
|
||||||
os.Put(static_cast<typename OutputStream::Ch>((v >> 10) | 0xD800));
|
|
||||||
os.Put((v & 0x3FF) | 0xDC00);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
static void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 2);
|
|
||||||
if (codepoint <= 0xFFFF) {
|
|
||||||
RAPIDJSON_ASSERT(codepoint < 0xD800 || codepoint > 0xDFFF); // Code point itself cannot be surrogate pair
|
|
||||||
PutUnsafe(os, static_cast<typename OutputStream::Ch>(codepoint));
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
|
|
||||||
unsigned v = codepoint - 0x10000;
|
|
||||||
PutUnsafe(os, static_cast<typename OutputStream::Ch>((v >> 10) | 0xD800));
|
|
||||||
PutUnsafe(os, (v & 0x3FF) | 0xDC00);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
static bool Decode(InputStream& is, unsigned* codepoint) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputStream::Ch) >= 2);
|
|
||||||
typename InputStream::Ch c = is.Take();
|
|
||||||
if (c < 0xD800 || c > 0xDFFF) {
|
|
||||||
*codepoint = static_cast<unsigned>(c);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
else if (c <= 0xDBFF) {
|
|
||||||
*codepoint = (static_cast<unsigned>(c) & 0x3FF) << 10;
|
|
||||||
c = is.Take();
|
|
||||||
*codepoint |= (static_cast<unsigned>(c) & 0x3FF);
|
|
||||||
*codepoint += 0x10000;
|
|
||||||
return c >= 0xDC00 && c <= 0xDFFF;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream, typename OutputStream>
|
|
||||||
static bool Validate(InputStream& is, OutputStream& os) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputStream::Ch) >= 2);
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 2);
|
|
||||||
typename InputStream::Ch c;
|
|
||||||
os.Put(static_cast<typename OutputStream::Ch>(c = is.Take()));
|
|
||||||
if (c < 0xD800 || c > 0xDFFF)
|
|
||||||
return true;
|
|
||||||
else if (c <= 0xDBFF) {
|
|
||||||
os.Put(c = is.Take());
|
|
||||||
return c >= 0xDC00 && c <= 0xDFFF;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
//! UTF-16 little endian encoding.
|
|
||||||
template<typename CharType = wchar_t>
|
|
||||||
struct UTF16LE : UTF16<CharType> {
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType TakeBOM(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
CharType c = Take(is);
|
|
||||||
return static_cast<uint16_t>(c) == 0xFEFFu ? Take(is) : c;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType Take(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
unsigned c = static_cast<uint8_t>(is.Take());
|
|
||||||
c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 8;
|
|
||||||
return static_cast<CharType>(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void PutBOM(OutputByteStream& os) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xFEu));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void Put(OutputByteStream& os, CharType c) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(static_cast<unsigned>(c) & 0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>((static_cast<unsigned>(c) >> 8) & 0xFFu));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
//! UTF-16 big endian encoding.
|
|
||||||
template<typename CharType = wchar_t>
|
|
||||||
struct UTF16BE : UTF16<CharType> {
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType TakeBOM(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
CharType c = Take(is);
|
|
||||||
return static_cast<uint16_t>(c) == 0xFEFFu ? Take(is) : c;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType Take(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
unsigned c = static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 8;
|
|
||||||
c |= static_cast<uint8_t>(is.Take());
|
|
||||||
return static_cast<CharType>(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void PutBOM(OutputByteStream& os) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xFEu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xFFu));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void Put(OutputByteStream& os, CharType c) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>((static_cast<unsigned>(c) >> 8) & 0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(static_cast<unsigned>(c) & 0xFFu));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// UTF32
|
|
||||||
|
|
||||||
//! UTF-32 encoding.
|
|
||||||
/*! http://en.wikipedia.org/wiki/UTF-32
|
|
||||||
\tparam CharType Type for storing 32-bit UTF-32 data. Default is unsigned. C++11 may use char32_t instead.
|
|
||||||
\note implements Encoding concept
|
|
||||||
|
|
||||||
\note For in-memory access, no need to concern endianness. The code units and code points are represented by CPU's endianness.
|
|
||||||
For streaming, use UTF32LE and UTF32BE, which handle endianness.
|
|
||||||
*/
|
|
||||||
template<typename CharType = unsigned>
|
|
||||||
struct UTF32 {
|
|
||||||
typedef CharType Ch;
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(Ch) >= 4);
|
|
||||||
|
|
||||||
enum { supportUnicode = 1 };
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
static void Encode(OutputStream& os, unsigned codepoint) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 4);
|
|
||||||
RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
|
|
||||||
os.Put(codepoint);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
static void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 4);
|
|
||||||
RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
|
|
||||||
PutUnsafe(os, codepoint);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
static bool Decode(InputStream& is, unsigned* codepoint) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputStream::Ch) >= 4);
|
|
||||||
Ch c = is.Take();
|
|
||||||
*codepoint = c;
|
|
||||||
return c <= 0x10FFFF;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream, typename OutputStream>
|
|
||||||
static bool Validate(InputStream& is, OutputStream& os) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputStream::Ch) >= 4);
|
|
||||||
Ch c;
|
|
||||||
os.Put(c = is.Take());
|
|
||||||
return c <= 0x10FFFF;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
//! UTF-32 little endian enocoding.
|
|
||||||
template<typename CharType = unsigned>
|
|
||||||
struct UTF32LE : UTF32<CharType> {
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType TakeBOM(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
CharType c = Take(is);
|
|
||||||
return static_cast<uint32_t>(c) == 0x0000FEFFu ? Take(is) : c;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType Take(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
unsigned c = static_cast<uint8_t>(is.Take());
|
|
||||||
c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 8;
|
|
||||||
c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 16;
|
|
||||||
c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 24;
|
|
||||||
return static_cast<CharType>(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void PutBOM(OutputByteStream& os) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xFEu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0x00u));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0x00u));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void Put(OutputByteStream& os, CharType c) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(c & 0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>((c >> 8) & 0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>((c >> 16) & 0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>((c >> 24) & 0xFFu));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
//! UTF-32 big endian encoding.
|
|
||||||
template<typename CharType = unsigned>
|
|
||||||
struct UTF32BE : UTF32<CharType> {
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType TakeBOM(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
CharType c = Take(is);
|
|
||||||
return static_cast<uint32_t>(c) == 0x0000FEFFu ? Take(is) : c;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType Take(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
unsigned c = static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 24;
|
|
||||||
c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 16;
|
|
||||||
c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 8;
|
|
||||||
c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take()));
|
|
||||||
return static_cast<CharType>(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void PutBOM(OutputByteStream& os) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0x00u));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0x00u));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xFEu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(0xFFu));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void Put(OutputByteStream& os, CharType c) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>((c >> 24) & 0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>((c >> 16) & 0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>((c >> 8) & 0xFFu));
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(c & 0xFFu));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// ASCII
|
|
||||||
|
|
||||||
//! ASCII encoding.
|
|
||||||
/*! http://en.wikipedia.org/wiki/ASCII
|
|
||||||
\tparam CharType Code unit for storing 7-bit ASCII data. Default is char.
|
|
||||||
\note implements Encoding concept
|
|
||||||
*/
|
|
||||||
template<typename CharType = char>
|
|
||||||
struct ASCII {
|
|
||||||
typedef CharType Ch;
|
|
||||||
|
|
||||||
enum { supportUnicode = 0 };
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
static void Encode(OutputStream& os, unsigned codepoint) {
|
|
||||||
RAPIDJSON_ASSERT(codepoint <= 0x7F);
|
|
||||||
os.Put(static_cast<Ch>(codepoint & 0xFF));
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
static void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
|
|
||||||
RAPIDJSON_ASSERT(codepoint <= 0x7F);
|
|
||||||
PutUnsafe(os, static_cast<Ch>(codepoint & 0xFF));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
static bool Decode(InputStream& is, unsigned* codepoint) {
|
|
||||||
uint8_t c = static_cast<uint8_t>(is.Take());
|
|
||||||
*codepoint = c;
|
|
||||||
return c <= 0X7F;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream, typename OutputStream>
|
|
||||||
static bool Validate(InputStream& is, OutputStream& os) {
|
|
||||||
uint8_t c = static_cast<uint8_t>(is.Take());
|
|
||||||
os.Put(static_cast<typename OutputStream::Ch>(c));
|
|
||||||
return c <= 0x7F;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static CharType TakeBOM(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
uint8_t c = static_cast<uint8_t>(Take(is));
|
|
||||||
return static_cast<Ch>(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputByteStream>
|
|
||||||
static Ch Take(InputByteStream& is) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
|
|
||||||
return static_cast<Ch>(is.Take());
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void PutBOM(OutputByteStream& os) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
(void)os;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename OutputByteStream>
|
|
||||||
static void Put(OutputByteStream& os, Ch c) {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
|
|
||||||
os.Put(static_cast<typename OutputByteStream::Ch>(c));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// AutoUTF
|
|
||||||
|
|
||||||
//! Runtime-specified UTF encoding type of a stream.
|
|
||||||
enum UTFType {
|
|
||||||
kUTF8 = 0, //!< UTF-8.
|
|
||||||
kUTF16LE = 1, //!< UTF-16 little endian.
|
|
||||||
kUTF16BE = 2, //!< UTF-16 big endian.
|
|
||||||
kUTF32LE = 3, //!< UTF-32 little endian.
|
|
||||||
kUTF32BE = 4 //!< UTF-32 big endian.
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Dynamically select encoding according to stream's runtime-specified UTF encoding type.
|
|
||||||
/*! \note This class can be used with AutoUTFInputtStream and AutoUTFOutputStream, which provides GetType().
|
|
||||||
*/
|
|
||||||
template<typename CharType>
|
|
||||||
struct AutoUTF {
|
|
||||||
typedef CharType Ch;
|
|
||||||
|
|
||||||
enum { supportUnicode = 1 };
|
|
||||||
|
|
||||||
#define RAPIDJSON_ENCODINGS_FUNC(x) UTF8<Ch>::x, UTF16LE<Ch>::x, UTF16BE<Ch>::x, UTF32LE<Ch>::x, UTF32BE<Ch>::x
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static void Encode(OutputStream& os, unsigned codepoint) {
|
|
||||||
typedef void (*EncodeFunc)(OutputStream&, unsigned);
|
|
||||||
static const EncodeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Encode) };
|
|
||||||
(*f[os.GetType()])(os, codepoint);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename OutputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
|
|
||||||
typedef void (*EncodeFunc)(OutputStream&, unsigned);
|
|
||||||
static const EncodeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(EncodeUnsafe) };
|
|
||||||
(*f[os.GetType()])(os, codepoint);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static bool Decode(InputStream& is, unsigned* codepoint) {
|
|
||||||
typedef bool (*DecodeFunc)(InputStream&, unsigned*);
|
|
||||||
static const DecodeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Decode) };
|
|
||||||
return (*f[is.GetType()])(is, codepoint);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream, typename OutputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static bool Validate(InputStream& is, OutputStream& os) {
|
|
||||||
typedef bool (*ValidateFunc)(InputStream&, OutputStream&);
|
|
||||||
static const ValidateFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Validate) };
|
|
||||||
return (*f[is.GetType()])(is, os);
|
|
||||||
}
|
|
||||||
|
|
||||||
#undef RAPIDJSON_ENCODINGS_FUNC
|
|
||||||
};
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// Transcoder
|
|
||||||
|
|
||||||
//! Encoding conversion.
|
|
||||||
template<typename SourceEncoding, typename TargetEncoding>
|
|
||||||
struct Transcoder {
|
|
||||||
//! Take one Unicode codepoint from source encoding, convert it to target encoding and put it to the output stream.
|
|
||||||
template<typename InputStream, typename OutputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static bool Transcode(InputStream& is, OutputStream& os) {
|
|
||||||
unsigned codepoint;
|
|
||||||
if (!SourceEncoding::Decode(is, &codepoint))
|
|
||||||
return false;
|
|
||||||
TargetEncoding::Encode(os, codepoint);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename InputStream, typename OutputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static bool TranscodeUnsafe(InputStream& is, OutputStream& os) {
|
|
||||||
unsigned codepoint;
|
|
||||||
if (!SourceEncoding::Decode(is, &codepoint))
|
|
||||||
return false;
|
|
||||||
TargetEncoding::EncodeUnsafe(os, codepoint);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Validate one Unicode codepoint from an encoded stream.
|
|
||||||
template<typename InputStream, typename OutputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static bool Validate(InputStream& is, OutputStream& os) {
|
|
||||||
return Transcode(is, os); // Since source/target encoding is different, must transcode.
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// Forward declaration.
|
|
||||||
template<typename Stream>
|
|
||||||
inline void PutUnsafe(Stream& stream, typename Stream::Ch c);
|
|
||||||
|
|
||||||
//! Specialization of Transcoder with same source and target encoding.
|
|
||||||
template<typename Encoding>
|
|
||||||
struct Transcoder<Encoding, Encoding> {
|
|
||||||
template<typename InputStream, typename OutputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static bool Transcode(InputStream& is, OutputStream& os) {
|
|
||||||
os.Put(is.Take()); // Just copy one code unit. This semantic is different from primary template class.
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename InputStream, typename OutputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static bool TranscodeUnsafe(InputStream& is, OutputStream& os) {
|
|
||||||
PutUnsafe(os, is.Take()); // Just copy one code unit. This semantic is different from primary template class.
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename InputStream, typename OutputStream>
|
|
||||||
RAPIDJSON_FORCEINLINE static bool Validate(InputStream& is, OutputStream& os) {
|
|
||||||
return Encoding::Validate(is, os); // source/target encoding are the same
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#if defined(__GNUC__) || defined(_MSC_VER)
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_ENCODINGS_H_
|
|
||||||
@@ -1,74 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_ERROR_EN_H_
|
|
||||||
#define RAPIDJSON_ERROR_EN_H_
|
|
||||||
|
|
||||||
#include "error.h"
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(switch-enum)
|
|
||||||
RAPIDJSON_DIAG_OFF(covered-switch-default)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Maps error code of parsing into error message.
|
|
||||||
/*!
|
|
||||||
\ingroup RAPIDJSON_ERRORS
|
|
||||||
\param parseErrorCode Error code obtained in parsing.
|
|
||||||
\return the error message.
|
|
||||||
\note User can make a copy of this function for localization.
|
|
||||||
Using switch-case is safer for future modification of error codes.
|
|
||||||
*/
|
|
||||||
inline const RAPIDJSON_ERROR_CHARTYPE* GetParseError_En(ParseErrorCode parseErrorCode) {
|
|
||||||
switch (parseErrorCode) {
|
|
||||||
case kParseErrorNone: return RAPIDJSON_ERROR_STRING("No error.");
|
|
||||||
|
|
||||||
case kParseErrorDocumentEmpty: return RAPIDJSON_ERROR_STRING("The document is empty.");
|
|
||||||
case kParseErrorDocumentRootNotSingular: return RAPIDJSON_ERROR_STRING("The document root must not be followed by other values.");
|
|
||||||
|
|
||||||
case kParseErrorValueInvalid: return RAPIDJSON_ERROR_STRING("Invalid value.");
|
|
||||||
|
|
||||||
case kParseErrorObjectMissName: return RAPIDJSON_ERROR_STRING("Missing a name for object member.");
|
|
||||||
case kParseErrorObjectMissColon: return RAPIDJSON_ERROR_STRING("Missing a colon after a name of object member.");
|
|
||||||
case kParseErrorObjectMissCommaOrCurlyBracket: return RAPIDJSON_ERROR_STRING("Missing a comma or '}' after an object member.");
|
|
||||||
|
|
||||||
case kParseErrorArrayMissCommaOrSquareBracket: return RAPIDJSON_ERROR_STRING("Missing a comma or ']' after an array element.");
|
|
||||||
|
|
||||||
case kParseErrorStringUnicodeEscapeInvalidHex: return RAPIDJSON_ERROR_STRING("Incorrect hex digit after \\u escape in string.");
|
|
||||||
case kParseErrorStringUnicodeSurrogateInvalid: return RAPIDJSON_ERROR_STRING("The surrogate pair in string is invalid.");
|
|
||||||
case kParseErrorStringEscapeInvalid: return RAPIDJSON_ERROR_STRING("Invalid escape character in string.");
|
|
||||||
case kParseErrorStringMissQuotationMark: return RAPIDJSON_ERROR_STRING("Missing a closing quotation mark in string.");
|
|
||||||
case kParseErrorStringInvalidEncoding: return RAPIDJSON_ERROR_STRING("Invalid encoding in string.");
|
|
||||||
|
|
||||||
case kParseErrorNumberTooBig: return RAPIDJSON_ERROR_STRING("Number too big to be stored in double.");
|
|
||||||
case kParseErrorNumberMissFraction: return RAPIDJSON_ERROR_STRING("Miss fraction part in number.");
|
|
||||||
case kParseErrorNumberMissExponent: return RAPIDJSON_ERROR_STRING("Miss exponent in number.");
|
|
||||||
|
|
||||||
case kParseErrorTermination: return RAPIDJSON_ERROR_STRING("Terminate parsing due to Handler error.");
|
|
||||||
case kParseErrorUnspecificSyntaxError: return RAPIDJSON_ERROR_STRING("Unspecific syntax error.");
|
|
||||||
|
|
||||||
default: return RAPIDJSON_ERROR_STRING("Unknown error.");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_ERROR_EN_H_
|
|
||||||
@@ -1,155 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_ERROR_ERROR_H_
|
|
||||||
#define RAPIDJSON_ERROR_ERROR_H_
|
|
||||||
|
|
||||||
#include "../rapidjson.h"
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(padded)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/*! \file error.h */
|
|
||||||
|
|
||||||
/*! \defgroup RAPIDJSON_ERRORS RapidJSON error handling */
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_ERROR_CHARTYPE
|
|
||||||
|
|
||||||
//! Character type of error messages.
|
|
||||||
/*! \ingroup RAPIDJSON_ERRORS
|
|
||||||
The default character type is \c char.
|
|
||||||
On Windows, user can define this macro as \c TCHAR for supporting both
|
|
||||||
unicode/non-unicode settings.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_ERROR_CHARTYPE
|
|
||||||
#define RAPIDJSON_ERROR_CHARTYPE char
|
|
||||||
#endif
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_ERROR_STRING
|
|
||||||
|
|
||||||
//! Macro for converting string literial to \ref RAPIDJSON_ERROR_CHARTYPE[].
|
|
||||||
/*! \ingroup RAPIDJSON_ERRORS
|
|
||||||
By default this conversion macro does nothing.
|
|
||||||
On Windows, user can define this macro as \c _T(x) for supporting both
|
|
||||||
unicode/non-unicode settings.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_ERROR_STRING
|
|
||||||
#define RAPIDJSON_ERROR_STRING(x) x
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// ParseErrorCode
|
|
||||||
|
|
||||||
//! Error code of parsing.
|
|
||||||
/*! \ingroup RAPIDJSON_ERRORS
|
|
||||||
\see GenericReader::Parse, GenericReader::GetParseErrorCode
|
|
||||||
*/
|
|
||||||
enum ParseErrorCode {
|
|
||||||
kParseErrorNone = 0, //!< No error.
|
|
||||||
|
|
||||||
kParseErrorDocumentEmpty, //!< The document is empty.
|
|
||||||
kParseErrorDocumentRootNotSingular, //!< The document root must not follow by other values.
|
|
||||||
|
|
||||||
kParseErrorValueInvalid, //!< Invalid value.
|
|
||||||
|
|
||||||
kParseErrorObjectMissName, //!< Missing a name for object member.
|
|
||||||
kParseErrorObjectMissColon, //!< Missing a colon after a name of object member.
|
|
||||||
kParseErrorObjectMissCommaOrCurlyBracket, //!< Missing a comma or '}' after an object member.
|
|
||||||
|
|
||||||
kParseErrorArrayMissCommaOrSquareBracket, //!< Missing a comma or ']' after an array element.
|
|
||||||
|
|
||||||
kParseErrorStringUnicodeEscapeInvalidHex, //!< Incorrect hex digit after \\u escape in string.
|
|
||||||
kParseErrorStringUnicodeSurrogateInvalid, //!< The surrogate pair in string is invalid.
|
|
||||||
kParseErrorStringEscapeInvalid, //!< Invalid escape character in string.
|
|
||||||
kParseErrorStringMissQuotationMark, //!< Missing a closing quotation mark in string.
|
|
||||||
kParseErrorStringInvalidEncoding, //!< Invalid encoding in string.
|
|
||||||
|
|
||||||
kParseErrorNumberTooBig, //!< Number too big to be stored in double.
|
|
||||||
kParseErrorNumberMissFraction, //!< Miss fraction part in number.
|
|
||||||
kParseErrorNumberMissExponent, //!< Miss exponent in number.
|
|
||||||
|
|
||||||
kParseErrorTermination, //!< Parsing was terminated.
|
|
||||||
kParseErrorUnspecificSyntaxError //!< Unspecific syntax error.
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Result of parsing (wraps ParseErrorCode)
|
|
||||||
/*!
|
|
||||||
\ingroup RAPIDJSON_ERRORS
|
|
||||||
\code
|
|
||||||
Document doc;
|
|
||||||
ParseResult ok = doc.Parse("[42]");
|
|
||||||
if (!ok) {
|
|
||||||
fprintf(stderr, "JSON parse error: %s (%u)",
|
|
||||||
GetParseError_En(ok.Code()), ok.Offset());
|
|
||||||
exit(EXIT_FAILURE);
|
|
||||||
}
|
|
||||||
\endcode
|
|
||||||
\see GenericReader::Parse, GenericDocument::Parse
|
|
||||||
*/
|
|
||||||
struct ParseResult {
|
|
||||||
public:
|
|
||||||
//! Default constructor, no error.
|
|
||||||
ParseResult() : code_(kParseErrorNone), offset_(0) {}
|
|
||||||
//! Constructor to set an error.
|
|
||||||
ParseResult(ParseErrorCode code, size_t offset) : code_(code), offset_(offset) {}
|
|
||||||
|
|
||||||
//! Get the error code.
|
|
||||||
ParseErrorCode Code() const { return code_; }
|
|
||||||
//! Get the error offset, if \ref IsError(), 0 otherwise.
|
|
||||||
size_t Offset() const { return offset_; }
|
|
||||||
|
|
||||||
//! Conversion to \c bool, returns \c true, iff !\ref IsError().
|
|
||||||
operator bool() const { return !IsError(); }
|
|
||||||
//! Whether the result is an error.
|
|
||||||
bool IsError() const { return code_ != kParseErrorNone; }
|
|
||||||
|
|
||||||
bool operator==(const ParseResult& that) const { return code_ == that.code_; }
|
|
||||||
bool operator==(ParseErrorCode code) const { return code_ == code; }
|
|
||||||
friend bool operator==(ParseErrorCode code, const ParseResult & err) { return code == err.code_; }
|
|
||||||
|
|
||||||
//! Reset error code.
|
|
||||||
void Clear() { Set(kParseErrorNone); }
|
|
||||||
//! Update error code and offset.
|
|
||||||
void Set(ParseErrorCode code, size_t offset = 0) { code_ = code; offset_ = offset; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
ParseErrorCode code_;
|
|
||||||
size_t offset_;
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Function pointer type of GetParseError().
|
|
||||||
/*! \ingroup RAPIDJSON_ERRORS
|
|
||||||
|
|
||||||
This is the prototype for \c GetParseError_X(), where \c X is a locale.
|
|
||||||
User can dynamically change locale in runtime, e.g.:
|
|
||||||
\code
|
|
||||||
GetParseErrorFunc GetParseError = GetParseError_En; // or whatever
|
|
||||||
const RAPIDJSON_ERROR_CHARTYPE* s = GetParseError(document.GetParseErrorCode());
|
|
||||||
\endcode
|
|
||||||
*/
|
|
||||||
typedef const RAPIDJSON_ERROR_CHARTYPE* (*GetParseErrorFunc)(ParseErrorCode);
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_ERROR_ERROR_H_
|
|
||||||
@@ -1,99 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_FILEREADSTREAM_H_
|
|
||||||
#define RAPIDJSON_FILEREADSTREAM_H_
|
|
||||||
|
|
||||||
#include "stream.h"
|
|
||||||
#include <cstdio>
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(padded)
|
|
||||||
RAPIDJSON_DIAG_OFF(unreachable-code)
|
|
||||||
RAPIDJSON_DIAG_OFF(missing-noreturn)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! File byte stream for input using fread().
|
|
||||||
/*!
|
|
||||||
\note implements Stream concept
|
|
||||||
*/
|
|
||||||
class FileReadStream {
|
|
||||||
public:
|
|
||||||
typedef char Ch; //!< Character type (byte).
|
|
||||||
|
|
||||||
//! Constructor.
|
|
||||||
/*!
|
|
||||||
\param fp File pointer opened for read.
|
|
||||||
\param buffer user-supplied buffer.
|
|
||||||
\param bufferSize size of buffer in bytes. Must >=4 bytes.
|
|
||||||
*/
|
|
||||||
FileReadStream(std::FILE* fp, char* buffer, size_t bufferSize) : fp_(fp), buffer_(buffer), bufferSize_(bufferSize), bufferLast_(0), current_(buffer_), readCount_(0), count_(0), eof_(false) {
|
|
||||||
RAPIDJSON_ASSERT(fp_ != 0);
|
|
||||||
RAPIDJSON_ASSERT(bufferSize >= 4);
|
|
||||||
Read();
|
|
||||||
}
|
|
||||||
|
|
||||||
Ch Peek() const { return *current_; }
|
|
||||||
Ch Take() { Ch c = *current_; Read(); return c; }
|
|
||||||
size_t Tell() const { return count_ + static_cast<size_t>(current_ - buffer_); }
|
|
||||||
|
|
||||||
// Not implemented
|
|
||||||
void Put(Ch) { RAPIDJSON_ASSERT(false); }
|
|
||||||
void Flush() { RAPIDJSON_ASSERT(false); }
|
|
||||||
Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
// For encoding detection only.
|
|
||||||
const Ch* Peek4() const {
|
|
||||||
return (current_ + 4 <= bufferLast_) ? current_ : 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
void Read() {
|
|
||||||
if (current_ < bufferLast_)
|
|
||||||
++current_;
|
|
||||||
else if (!eof_) {
|
|
||||||
count_ += readCount_;
|
|
||||||
readCount_ = fread(buffer_, 1, bufferSize_, fp_);
|
|
||||||
bufferLast_ = buffer_ + readCount_ - 1;
|
|
||||||
current_ = buffer_;
|
|
||||||
|
|
||||||
if (readCount_ < bufferSize_) {
|
|
||||||
buffer_[readCount_] = '\0';
|
|
||||||
++bufferLast_;
|
|
||||||
eof_ = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
std::FILE* fp_;
|
|
||||||
Ch *buffer_;
|
|
||||||
size_t bufferSize_;
|
|
||||||
Ch *bufferLast_;
|
|
||||||
Ch *current_;
|
|
||||||
size_t readCount_;
|
|
||||||
size_t count_; //!< Number of characters read
|
|
||||||
bool eof_;
|
|
||||||
};
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_FILESTREAM_H_
|
|
||||||
@@ -1,104 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_FILEWRITESTREAM_H_
|
|
||||||
#define RAPIDJSON_FILEWRITESTREAM_H_
|
|
||||||
|
|
||||||
#include "stream.h"
|
|
||||||
#include <cstdio>
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(unreachable-code)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Wrapper of C file stream for input using fread().
|
|
||||||
/*!
|
|
||||||
\note implements Stream concept
|
|
||||||
*/
|
|
||||||
class FileWriteStream {
|
|
||||||
public:
|
|
||||||
typedef char Ch; //!< Character type. Only support char.
|
|
||||||
|
|
||||||
FileWriteStream(std::FILE* fp, char* buffer, size_t bufferSize) : fp_(fp), buffer_(buffer), bufferEnd_(buffer + bufferSize), current_(buffer_) {
|
|
||||||
RAPIDJSON_ASSERT(fp_ != 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
void Put(char c) {
|
|
||||||
if (current_ >= bufferEnd_)
|
|
||||||
Flush();
|
|
||||||
|
|
||||||
*current_++ = c;
|
|
||||||
}
|
|
||||||
|
|
||||||
void PutN(char c, size_t n) {
|
|
||||||
size_t avail = static_cast<size_t>(bufferEnd_ - current_);
|
|
||||||
while (n > avail) {
|
|
||||||
std::memset(current_, c, avail);
|
|
||||||
current_ += avail;
|
|
||||||
Flush();
|
|
||||||
n -= avail;
|
|
||||||
avail = static_cast<size_t>(bufferEnd_ - current_);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (n > 0) {
|
|
||||||
std::memset(current_, c, n);
|
|
||||||
current_ += n;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void Flush() {
|
|
||||||
if (current_ != buffer_) {
|
|
||||||
size_t result = fwrite(buffer_, 1, static_cast<size_t>(current_ - buffer_), fp_);
|
|
||||||
if (result < static_cast<size_t>(current_ - buffer_)) {
|
|
||||||
// failure deliberately ignored at this time
|
|
||||||
// added to avoid warn_unused_result build errors
|
|
||||||
}
|
|
||||||
current_ = buffer_;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Not implemented
|
|
||||||
char Peek() const { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
char Take() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
size_t Tell() const { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
char* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
size_t PutEnd(char*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
// Prohibit copy constructor & assignment operator.
|
|
||||||
FileWriteStream(const FileWriteStream&);
|
|
||||||
FileWriteStream& operator=(const FileWriteStream&);
|
|
||||||
|
|
||||||
std::FILE* fp_;
|
|
||||||
char *buffer_;
|
|
||||||
char *bufferEnd_;
|
|
||||||
char *current_;
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Implement specialized version of PutN() with memset() for better performance.
|
|
||||||
template<>
|
|
||||||
inline void PutN(FileWriteStream& stream, char c, size_t n) {
|
|
||||||
stream.PutN(c, n);
|
|
||||||
}
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_FILESTREAM_H_
|
|
||||||
@@ -1,151 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_FWD_H_
|
|
||||||
#define RAPIDJSON_FWD_H_
|
|
||||||
|
|
||||||
#include "rapidjson.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
// encodings.h
|
|
||||||
|
|
||||||
template<typename CharType> struct UTF8;
|
|
||||||
template<typename CharType> struct UTF16;
|
|
||||||
template<typename CharType> struct UTF16BE;
|
|
||||||
template<typename CharType> struct UTF16LE;
|
|
||||||
template<typename CharType> struct UTF32;
|
|
||||||
template<typename CharType> struct UTF32BE;
|
|
||||||
template<typename CharType> struct UTF32LE;
|
|
||||||
template<typename CharType> struct ASCII;
|
|
||||||
template<typename CharType> struct AutoUTF;
|
|
||||||
|
|
||||||
template<typename SourceEncoding, typename TargetEncoding>
|
|
||||||
struct Transcoder;
|
|
||||||
|
|
||||||
// allocators.h
|
|
||||||
|
|
||||||
class CrtAllocator;
|
|
||||||
|
|
||||||
template <typename BaseAllocator>
|
|
||||||
class MemoryPoolAllocator;
|
|
||||||
|
|
||||||
// stream.h
|
|
||||||
|
|
||||||
template <typename Encoding>
|
|
||||||
struct GenericStringStream;
|
|
||||||
|
|
||||||
typedef GenericStringStream<UTF8<char> > StringStream;
|
|
||||||
|
|
||||||
template <typename Encoding>
|
|
||||||
struct GenericInsituStringStream;
|
|
||||||
|
|
||||||
typedef GenericInsituStringStream<UTF8<char> > InsituStringStream;
|
|
||||||
|
|
||||||
// stringbuffer.h
|
|
||||||
|
|
||||||
template <typename Encoding, typename Allocator>
|
|
||||||
class GenericStringBuffer;
|
|
||||||
|
|
||||||
typedef GenericStringBuffer<UTF8<char>, CrtAllocator> StringBuffer;
|
|
||||||
|
|
||||||
// filereadstream.h
|
|
||||||
|
|
||||||
class FileReadStream;
|
|
||||||
|
|
||||||
// filewritestream.h
|
|
||||||
|
|
||||||
class FileWriteStream;
|
|
||||||
|
|
||||||
// memorybuffer.h
|
|
||||||
|
|
||||||
template <typename Allocator>
|
|
||||||
struct GenericMemoryBuffer;
|
|
||||||
|
|
||||||
typedef GenericMemoryBuffer<CrtAllocator> MemoryBuffer;
|
|
||||||
|
|
||||||
// memorystream.h
|
|
||||||
|
|
||||||
struct MemoryStream;
|
|
||||||
|
|
||||||
// reader.h
|
|
||||||
|
|
||||||
template<typename Encoding, typename Derived>
|
|
||||||
struct BaseReaderHandler;
|
|
||||||
|
|
||||||
template <typename SourceEncoding, typename TargetEncoding, typename StackAllocator>
|
|
||||||
class GenericReader;
|
|
||||||
|
|
||||||
typedef GenericReader<UTF8<char>, UTF8<char>, CrtAllocator> Reader;
|
|
||||||
|
|
||||||
// writer.h
|
|
||||||
|
|
||||||
template<typename OutputStream, typename SourceEncoding, typename TargetEncoding, typename StackAllocator, unsigned writeFlags>
|
|
||||||
class Writer;
|
|
||||||
|
|
||||||
// prettywriter.h
|
|
||||||
|
|
||||||
template<typename OutputStream, typename SourceEncoding, typename TargetEncoding, typename StackAllocator, unsigned writeFlags>
|
|
||||||
class PrettyWriter;
|
|
||||||
|
|
||||||
// document.h
|
|
||||||
|
|
||||||
template <typename Encoding, typename Allocator>
|
|
||||||
struct GenericMember;
|
|
||||||
|
|
||||||
template <bool Const, typename Encoding, typename Allocator>
|
|
||||||
class GenericMemberIterator;
|
|
||||||
|
|
||||||
template<typename CharType>
|
|
||||||
struct GenericStringRef;
|
|
||||||
|
|
||||||
template <typename Encoding, typename Allocator>
|
|
||||||
class GenericValue;
|
|
||||||
|
|
||||||
typedef GenericValue<UTF8<char>, MemoryPoolAllocator<CrtAllocator> > Value;
|
|
||||||
|
|
||||||
template <typename Encoding, typename Allocator, typename StackAllocator>
|
|
||||||
class GenericDocument;
|
|
||||||
|
|
||||||
typedef GenericDocument<UTF8<char>, MemoryPoolAllocator<CrtAllocator>, CrtAllocator> Document;
|
|
||||||
|
|
||||||
// pointer.h
|
|
||||||
|
|
||||||
template <typename ValueType, typename Allocator>
|
|
||||||
class GenericPointer;
|
|
||||||
|
|
||||||
typedef GenericPointer<Value, CrtAllocator> Pointer;
|
|
||||||
|
|
||||||
// schema.h
|
|
||||||
|
|
||||||
template <typename SchemaDocumentType>
|
|
||||||
class IGenericRemoteSchemaDocumentProvider;
|
|
||||||
|
|
||||||
template <typename ValueT, typename Allocator>
|
|
||||||
class GenericSchemaDocument;
|
|
||||||
|
|
||||||
typedef GenericSchemaDocument<Value, CrtAllocator> SchemaDocument;
|
|
||||||
typedef IGenericRemoteSchemaDocumentProvider<SchemaDocument> IRemoteSchemaDocumentProvider;
|
|
||||||
|
|
||||||
template <
|
|
||||||
typename SchemaDocumentType,
|
|
||||||
typename OutputHandler,
|
|
||||||
typename StateAllocator>
|
|
||||||
class GenericSchemaValidator;
|
|
||||||
|
|
||||||
typedef GenericSchemaValidator<SchemaDocument, BaseReaderHandler<UTF8<char>, void>, CrtAllocator> SchemaValidator;
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_RAPIDJSONFWD_H_
|
|
||||||
@@ -1,290 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_BIGINTEGER_H_
|
|
||||||
#define RAPIDJSON_BIGINTEGER_H_
|
|
||||||
|
|
||||||
#include "../rapidjson.h"
|
|
||||||
|
|
||||||
#if defined(_MSC_VER) && defined(_M_AMD64)
|
|
||||||
#include <intrin.h> // for _umul128
|
|
||||||
#pragma intrinsic(_umul128)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
class BigInteger {
|
|
||||||
public:
|
|
||||||
typedef uint64_t Type;
|
|
||||||
|
|
||||||
BigInteger(const BigInteger& rhs) : count_(rhs.count_) {
|
|
||||||
std::memcpy(digits_, rhs.digits_, count_ * sizeof(Type));
|
|
||||||
}
|
|
||||||
|
|
||||||
explicit BigInteger(uint64_t u) : count_(1) {
|
|
||||||
digits_[0] = u;
|
|
||||||
}
|
|
||||||
|
|
||||||
BigInteger(const char* decimals, size_t length) : count_(1) {
|
|
||||||
RAPIDJSON_ASSERT(length > 0);
|
|
||||||
digits_[0] = 0;
|
|
||||||
size_t i = 0;
|
|
||||||
const size_t kMaxDigitPerIteration = 19; // 2^64 = 18446744073709551616 > 10^19
|
|
||||||
while (length >= kMaxDigitPerIteration) {
|
|
||||||
AppendDecimal64(decimals + i, decimals + i + kMaxDigitPerIteration);
|
|
||||||
length -= kMaxDigitPerIteration;
|
|
||||||
i += kMaxDigitPerIteration;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (length > 0)
|
|
||||||
AppendDecimal64(decimals + i, decimals + i + length);
|
|
||||||
}
|
|
||||||
|
|
||||||
BigInteger& operator=(const BigInteger &rhs)
|
|
||||||
{
|
|
||||||
if (this != &rhs) {
|
|
||||||
count_ = rhs.count_;
|
|
||||||
std::memcpy(digits_, rhs.digits_, count_ * sizeof(Type));
|
|
||||||
}
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
BigInteger& operator=(uint64_t u) {
|
|
||||||
digits_[0] = u;
|
|
||||||
count_ = 1;
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
BigInteger& operator+=(uint64_t u) {
|
|
||||||
Type backup = digits_[0];
|
|
||||||
digits_[0] += u;
|
|
||||||
for (size_t i = 0; i < count_ - 1; i++) {
|
|
||||||
if (digits_[i] >= backup)
|
|
||||||
return *this; // no carry
|
|
||||||
backup = digits_[i + 1];
|
|
||||||
digits_[i + 1] += 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Last carry
|
|
||||||
if (digits_[count_ - 1] < backup)
|
|
||||||
PushBack(1);
|
|
||||||
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
BigInteger& operator*=(uint64_t u) {
|
|
||||||
if (u == 0) return *this = 0;
|
|
||||||
if (u == 1) return *this;
|
|
||||||
if (*this == 1) return *this = u;
|
|
||||||
|
|
||||||
uint64_t k = 0;
|
|
||||||
for (size_t i = 0; i < count_; i++) {
|
|
||||||
uint64_t hi;
|
|
||||||
digits_[i] = MulAdd64(digits_[i], u, k, &hi);
|
|
||||||
k = hi;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (k > 0)
|
|
||||||
PushBack(k);
|
|
||||||
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
BigInteger& operator*=(uint32_t u) {
|
|
||||||
if (u == 0) return *this = 0;
|
|
||||||
if (u == 1) return *this;
|
|
||||||
if (*this == 1) return *this = u;
|
|
||||||
|
|
||||||
uint64_t k = 0;
|
|
||||||
for (size_t i = 0; i < count_; i++) {
|
|
||||||
const uint64_t c = digits_[i] >> 32;
|
|
||||||
const uint64_t d = digits_[i] & 0xFFFFFFFF;
|
|
||||||
const uint64_t uc = u * c;
|
|
||||||
const uint64_t ud = u * d;
|
|
||||||
const uint64_t p0 = ud + k;
|
|
||||||
const uint64_t p1 = uc + (p0 >> 32);
|
|
||||||
digits_[i] = (p0 & 0xFFFFFFFF) | (p1 << 32);
|
|
||||||
k = p1 >> 32;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (k > 0)
|
|
||||||
PushBack(k);
|
|
||||||
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
BigInteger& operator<<=(size_t shift) {
|
|
||||||
if (IsZero() || shift == 0) return *this;
|
|
||||||
|
|
||||||
size_t offset = shift / kTypeBit;
|
|
||||||
size_t interShift = shift % kTypeBit;
|
|
||||||
RAPIDJSON_ASSERT(count_ + offset <= kCapacity);
|
|
||||||
|
|
||||||
if (interShift == 0) {
|
|
||||||
std::memmove(&digits_[count_ - 1 + offset], &digits_[count_ - 1], count_ * sizeof(Type));
|
|
||||||
count_ += offset;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
digits_[count_] = 0;
|
|
||||||
for (size_t i = count_; i > 0; i--)
|
|
||||||
digits_[i + offset] = (digits_[i] << interShift) | (digits_[i - 1] >> (kTypeBit - interShift));
|
|
||||||
digits_[offset] = digits_[0] << interShift;
|
|
||||||
count_ += offset;
|
|
||||||
if (digits_[count_])
|
|
||||||
count_++;
|
|
||||||
}
|
|
||||||
|
|
||||||
std::memset(digits_, 0, offset * sizeof(Type));
|
|
||||||
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool operator==(const BigInteger& rhs) const {
|
|
||||||
return count_ == rhs.count_ && std::memcmp(digits_, rhs.digits_, count_ * sizeof(Type)) == 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool operator==(const Type rhs) const {
|
|
||||||
return count_ == 1 && digits_[0] == rhs;
|
|
||||||
}
|
|
||||||
|
|
||||||
BigInteger& MultiplyPow5(unsigned exp) {
|
|
||||||
static const uint32_t kPow5[12] = {
|
|
||||||
5,
|
|
||||||
5 * 5,
|
|
||||||
5 * 5 * 5,
|
|
||||||
5 * 5 * 5 * 5,
|
|
||||||
5 * 5 * 5 * 5 * 5,
|
|
||||||
5 * 5 * 5 * 5 * 5 * 5,
|
|
||||||
5 * 5 * 5 * 5 * 5 * 5 * 5,
|
|
||||||
5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
|
|
||||||
5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
|
|
||||||
5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
|
|
||||||
5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
|
|
||||||
5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5
|
|
||||||
};
|
|
||||||
if (exp == 0) return *this;
|
|
||||||
for (; exp >= 27; exp -= 27) *this *= RAPIDJSON_UINT64_C2(0X6765C793, 0XFA10079D); // 5^27
|
|
||||||
for (; exp >= 13; exp -= 13) *this *= static_cast<uint32_t>(1220703125u); // 5^13
|
|
||||||
if (exp > 0) *this *= kPow5[exp - 1];
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Compute absolute difference of this and rhs.
|
|
||||||
// Assume this != rhs
|
|
||||||
bool Difference(const BigInteger& rhs, BigInteger* out) const {
|
|
||||||
int cmp = Compare(rhs);
|
|
||||||
RAPIDJSON_ASSERT(cmp != 0);
|
|
||||||
const BigInteger *a, *b; // Makes a > b
|
|
||||||
bool ret;
|
|
||||||
if (cmp < 0) { a = &rhs; b = this; ret = true; }
|
|
||||||
else { a = this; b = &rhs; ret = false; }
|
|
||||||
|
|
||||||
Type borrow = 0;
|
|
||||||
for (size_t i = 0; i < a->count_; i++) {
|
|
||||||
Type d = a->digits_[i] - borrow;
|
|
||||||
if (i < b->count_)
|
|
||||||
d -= b->digits_[i];
|
|
||||||
borrow = (d > a->digits_[i]) ? 1 : 0;
|
|
||||||
out->digits_[i] = d;
|
|
||||||
if (d != 0)
|
|
||||||
out->count_ = i + 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
int Compare(const BigInteger& rhs) const {
|
|
||||||
if (count_ != rhs.count_)
|
|
||||||
return count_ < rhs.count_ ? -1 : 1;
|
|
||||||
|
|
||||||
for (size_t i = count_; i-- > 0;)
|
|
||||||
if (digits_[i] != rhs.digits_[i])
|
|
||||||
return digits_[i] < rhs.digits_[i] ? -1 : 1;
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t GetCount() const { return count_; }
|
|
||||||
Type GetDigit(size_t index) const { RAPIDJSON_ASSERT(index < count_); return digits_[index]; }
|
|
||||||
bool IsZero() const { return count_ == 1 && digits_[0] == 0; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
void AppendDecimal64(const char* begin, const char* end) {
|
|
||||||
uint64_t u = ParseUint64(begin, end);
|
|
||||||
if (IsZero())
|
|
||||||
*this = u;
|
|
||||||
else {
|
|
||||||
unsigned exp = static_cast<unsigned>(end - begin);
|
|
||||||
(MultiplyPow5(exp) <<= exp) += u; // *this = *this * 10^exp + u
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void PushBack(Type digit) {
|
|
||||||
RAPIDJSON_ASSERT(count_ < kCapacity);
|
|
||||||
digits_[count_++] = digit;
|
|
||||||
}
|
|
||||||
|
|
||||||
static uint64_t ParseUint64(const char* begin, const char* end) {
|
|
||||||
uint64_t r = 0;
|
|
||||||
for (const char* p = begin; p != end; ++p) {
|
|
||||||
RAPIDJSON_ASSERT(*p >= '0' && *p <= '9');
|
|
||||||
r = r * 10u + static_cast<unsigned>(*p - '0');
|
|
||||||
}
|
|
||||||
return r;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Assume a * b + k < 2^128
|
|
||||||
static uint64_t MulAdd64(uint64_t a, uint64_t b, uint64_t k, uint64_t* outHigh) {
|
|
||||||
#if defined(_MSC_VER) && defined(_M_AMD64)
|
|
||||||
uint64_t low = _umul128(a, b, outHigh) + k;
|
|
||||||
if (low < k)
|
|
||||||
(*outHigh)++;
|
|
||||||
return low;
|
|
||||||
#elif (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6)) && defined(__x86_64__)
|
|
||||||
__extension__ typedef unsigned __int128 uint128;
|
|
||||||
uint128 p = static_cast<uint128>(a) * static_cast<uint128>(b);
|
|
||||||
p += k;
|
|
||||||
*outHigh = static_cast<uint64_t>(p >> 64);
|
|
||||||
return static_cast<uint64_t>(p);
|
|
||||||
#else
|
|
||||||
const uint64_t a0 = a & 0xFFFFFFFF, a1 = a >> 32, b0 = b & 0xFFFFFFFF, b1 = b >> 32;
|
|
||||||
uint64_t x0 = a0 * b0, x1 = a0 * b1, x2 = a1 * b0, x3 = a1 * b1;
|
|
||||||
x1 += (x0 >> 32); // can't give carry
|
|
||||||
x1 += x2;
|
|
||||||
if (x1 < x2)
|
|
||||||
x3 += (static_cast<uint64_t>(1) << 32);
|
|
||||||
uint64_t lo = (x1 << 32) + (x0 & 0xFFFFFFFF);
|
|
||||||
uint64_t hi = x3 + (x1 >> 32);
|
|
||||||
|
|
||||||
lo += k;
|
|
||||||
if (lo < k)
|
|
||||||
hi++;
|
|
||||||
*outHigh = hi;
|
|
||||||
return lo;
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
||||||
static const size_t kBitCount = 3328; // 64bit * 54 > 10^1000
|
|
||||||
static const size_t kCapacity = kBitCount / sizeof(Type);
|
|
||||||
static const size_t kTypeBit = sizeof(Type) * 8;
|
|
||||||
|
|
||||||
Type digits_[kCapacity];
|
|
||||||
size_t count_;
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_BIGINTEGER_H_
|
|
||||||
@@ -1,258 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
// This is a C++ header-only implementation of Grisu2 algorithm from the publication:
|
|
||||||
// Loitsch, Florian. "Printing floating-point numbers quickly and accurately with
|
|
||||||
// integers." ACM Sigplan Notices 45.6 (2010): 233-243.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_DIYFP_H_
|
|
||||||
#define RAPIDJSON_DIYFP_H_
|
|
||||||
|
|
||||||
#include "../rapidjson.h"
|
|
||||||
|
|
||||||
#if defined(_MSC_VER) && defined(_M_AMD64)
|
|
||||||
#include <intrin.h>
|
|
||||||
#pragma intrinsic(_BitScanReverse64)
|
|
||||||
#pragma intrinsic(_umul128)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(effc++)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(padded)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct DiyFp {
|
|
||||||
DiyFp() : f(), e() {}
|
|
||||||
|
|
||||||
DiyFp(uint64_t fp, int exp) : f(fp), e(exp) {}
|
|
||||||
|
|
||||||
explicit DiyFp(double d) {
|
|
||||||
union {
|
|
||||||
double d;
|
|
||||||
uint64_t u64;
|
|
||||||
} u = { d };
|
|
||||||
|
|
||||||
int biased_e = static_cast<int>((u.u64 & kDpExponentMask) >> kDpSignificandSize);
|
|
||||||
uint64_t significand = (u.u64 & kDpSignificandMask);
|
|
||||||
if (biased_e != 0) {
|
|
||||||
f = significand + kDpHiddenBit;
|
|
||||||
e = biased_e - kDpExponentBias;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
f = significand;
|
|
||||||
e = kDpMinExponent + 1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
DiyFp operator-(const DiyFp& rhs) const {
|
|
||||||
return DiyFp(f - rhs.f, e);
|
|
||||||
}
|
|
||||||
|
|
||||||
DiyFp operator*(const DiyFp& rhs) const {
|
|
||||||
#if defined(_MSC_VER) && defined(_M_AMD64)
|
|
||||||
uint64_t h;
|
|
||||||
uint64_t l = _umul128(f, rhs.f, &h);
|
|
||||||
if (l & (uint64_t(1) << 63)) // rounding
|
|
||||||
h++;
|
|
||||||
return DiyFp(h, e + rhs.e + 64);
|
|
||||||
#elif (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6)) && defined(__x86_64__)
|
|
||||||
__extension__ typedef unsigned __int128 uint128;
|
|
||||||
uint128 p = static_cast<uint128>(f) * static_cast<uint128>(rhs.f);
|
|
||||||
uint64_t h = static_cast<uint64_t>(p >> 64);
|
|
||||||
uint64_t l = static_cast<uint64_t>(p);
|
|
||||||
if (l & (uint64_t(1) << 63)) // rounding
|
|
||||||
h++;
|
|
||||||
return DiyFp(h, e + rhs.e + 64);
|
|
||||||
#else
|
|
||||||
const uint64_t M32 = 0xFFFFFFFF;
|
|
||||||
const uint64_t a = f >> 32;
|
|
||||||
const uint64_t b = f & M32;
|
|
||||||
const uint64_t c = rhs.f >> 32;
|
|
||||||
const uint64_t d = rhs.f & M32;
|
|
||||||
const uint64_t ac = a * c;
|
|
||||||
const uint64_t bc = b * c;
|
|
||||||
const uint64_t ad = a * d;
|
|
||||||
const uint64_t bd = b * d;
|
|
||||||
uint64_t tmp = (bd >> 32) + (ad & M32) + (bc & M32);
|
|
||||||
tmp += 1U << 31; /// mult_round
|
|
||||||
return DiyFp(ac + (ad >> 32) + (bc >> 32) + (tmp >> 32), e + rhs.e + 64);
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
||||||
DiyFp Normalize() const {
|
|
||||||
#if defined(_MSC_VER) && defined(_M_AMD64)
|
|
||||||
unsigned long index;
|
|
||||||
_BitScanReverse64(&index, f);
|
|
||||||
return DiyFp(f << (63 - index), e - (63 - index));
|
|
||||||
#elif defined(__GNUC__) && __GNUC__ >= 4
|
|
||||||
int s = __builtin_clzll(f);
|
|
||||||
return DiyFp(f << s, e - s);
|
|
||||||
#else
|
|
||||||
DiyFp res = *this;
|
|
||||||
while (!(res.f & (static_cast<uint64_t>(1) << 63))) {
|
|
||||||
res.f <<= 1;
|
|
||||||
res.e--;
|
|
||||||
}
|
|
||||||
return res;
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
||||||
DiyFp NormalizeBoundary() const {
|
|
||||||
DiyFp res = *this;
|
|
||||||
while (!(res.f & (kDpHiddenBit << 1))) {
|
|
||||||
res.f <<= 1;
|
|
||||||
res.e--;
|
|
||||||
}
|
|
||||||
res.f <<= (kDiySignificandSize - kDpSignificandSize - 2);
|
|
||||||
res.e = res.e - (kDiySignificandSize - kDpSignificandSize - 2);
|
|
||||||
return res;
|
|
||||||
}
|
|
||||||
|
|
||||||
void NormalizedBoundaries(DiyFp* minus, DiyFp* plus) const {
|
|
||||||
DiyFp pl = DiyFp((f << 1) + 1, e - 1).NormalizeBoundary();
|
|
||||||
DiyFp mi = (f == kDpHiddenBit) ? DiyFp((f << 2) - 1, e - 2) : DiyFp((f << 1) - 1, e - 1);
|
|
||||||
mi.f <<= mi.e - pl.e;
|
|
||||||
mi.e = pl.e;
|
|
||||||
*plus = pl;
|
|
||||||
*minus = mi;
|
|
||||||
}
|
|
||||||
|
|
||||||
double ToDouble() const {
|
|
||||||
union {
|
|
||||||
double d;
|
|
||||||
uint64_t u64;
|
|
||||||
}u;
|
|
||||||
const uint64_t be = (e == kDpDenormalExponent && (f & kDpHiddenBit) == 0) ? 0 :
|
|
||||||
static_cast<uint64_t>(e + kDpExponentBias);
|
|
||||||
u.u64 = (f & kDpSignificandMask) | (be << kDpSignificandSize);
|
|
||||||
return u.d;
|
|
||||||
}
|
|
||||||
|
|
||||||
static const int kDiySignificandSize = 64;
|
|
||||||
static const int kDpSignificandSize = 52;
|
|
||||||
static const int kDpExponentBias = 0x3FF + kDpSignificandSize;
|
|
||||||
static const int kDpMaxExponent = 0x7FF - kDpExponentBias;
|
|
||||||
static const int kDpMinExponent = -kDpExponentBias;
|
|
||||||
static const int kDpDenormalExponent = -kDpExponentBias + 1;
|
|
||||||
static const uint64_t kDpExponentMask = RAPIDJSON_UINT64_C2(0x7FF00000, 0x00000000);
|
|
||||||
static const uint64_t kDpSignificandMask = RAPIDJSON_UINT64_C2(0x000FFFFF, 0xFFFFFFFF);
|
|
||||||
static const uint64_t kDpHiddenBit = RAPIDJSON_UINT64_C2(0x00100000, 0x00000000);
|
|
||||||
|
|
||||||
uint64_t f;
|
|
||||||
int e;
|
|
||||||
};
|
|
||||||
|
|
||||||
inline DiyFp GetCachedPowerByIndex(size_t index) {
|
|
||||||
// 10^-348, 10^-340, ..., 10^340
|
|
||||||
static const uint64_t kCachedPowers_F[] = {
|
|
||||||
RAPIDJSON_UINT64_C2(0xfa8fd5a0, 0x081c0288), RAPIDJSON_UINT64_C2(0xbaaee17f, 0xa23ebf76),
|
|
||||||
RAPIDJSON_UINT64_C2(0x8b16fb20, 0x3055ac76), RAPIDJSON_UINT64_C2(0xcf42894a, 0x5dce35ea),
|
|
||||||
RAPIDJSON_UINT64_C2(0x9a6bb0aa, 0x55653b2d), RAPIDJSON_UINT64_C2(0xe61acf03, 0x3d1a45df),
|
|
||||||
RAPIDJSON_UINT64_C2(0xab70fe17, 0xc79ac6ca), RAPIDJSON_UINT64_C2(0xff77b1fc, 0xbebcdc4f),
|
|
||||||
RAPIDJSON_UINT64_C2(0xbe5691ef, 0x416bd60c), RAPIDJSON_UINT64_C2(0x8dd01fad, 0x907ffc3c),
|
|
||||||
RAPIDJSON_UINT64_C2(0xd3515c28, 0x31559a83), RAPIDJSON_UINT64_C2(0x9d71ac8f, 0xada6c9b5),
|
|
||||||
RAPIDJSON_UINT64_C2(0xea9c2277, 0x23ee8bcb), RAPIDJSON_UINT64_C2(0xaecc4991, 0x4078536d),
|
|
||||||
RAPIDJSON_UINT64_C2(0x823c1279, 0x5db6ce57), RAPIDJSON_UINT64_C2(0xc2109436, 0x4dfb5637),
|
|
||||||
RAPIDJSON_UINT64_C2(0x9096ea6f, 0x3848984f), RAPIDJSON_UINT64_C2(0xd77485cb, 0x25823ac7),
|
|
||||||
RAPIDJSON_UINT64_C2(0xa086cfcd, 0x97bf97f4), RAPIDJSON_UINT64_C2(0xef340a98, 0x172aace5),
|
|
||||||
RAPIDJSON_UINT64_C2(0xb23867fb, 0x2a35b28e), RAPIDJSON_UINT64_C2(0x84c8d4df, 0xd2c63f3b),
|
|
||||||
RAPIDJSON_UINT64_C2(0xc5dd4427, 0x1ad3cdba), RAPIDJSON_UINT64_C2(0x936b9fce, 0xbb25c996),
|
|
||||||
RAPIDJSON_UINT64_C2(0xdbac6c24, 0x7d62a584), RAPIDJSON_UINT64_C2(0xa3ab6658, 0x0d5fdaf6),
|
|
||||||
RAPIDJSON_UINT64_C2(0xf3e2f893, 0xdec3f126), RAPIDJSON_UINT64_C2(0xb5b5ada8, 0xaaff80b8),
|
|
||||||
RAPIDJSON_UINT64_C2(0x87625f05, 0x6c7c4a8b), RAPIDJSON_UINT64_C2(0xc9bcff60, 0x34c13053),
|
|
||||||
RAPIDJSON_UINT64_C2(0x964e858c, 0x91ba2655), RAPIDJSON_UINT64_C2(0xdff97724, 0x70297ebd),
|
|
||||||
RAPIDJSON_UINT64_C2(0xa6dfbd9f, 0xb8e5b88f), RAPIDJSON_UINT64_C2(0xf8a95fcf, 0x88747d94),
|
|
||||||
RAPIDJSON_UINT64_C2(0xb9447093, 0x8fa89bcf), RAPIDJSON_UINT64_C2(0x8a08f0f8, 0xbf0f156b),
|
|
||||||
RAPIDJSON_UINT64_C2(0xcdb02555, 0x653131b6), RAPIDJSON_UINT64_C2(0x993fe2c6, 0xd07b7fac),
|
|
||||||
RAPIDJSON_UINT64_C2(0xe45c10c4, 0x2a2b3b06), RAPIDJSON_UINT64_C2(0xaa242499, 0x697392d3),
|
|
||||||
RAPIDJSON_UINT64_C2(0xfd87b5f2, 0x8300ca0e), RAPIDJSON_UINT64_C2(0xbce50864, 0x92111aeb),
|
|
||||||
RAPIDJSON_UINT64_C2(0x8cbccc09, 0x6f5088cc), RAPIDJSON_UINT64_C2(0xd1b71758, 0xe219652c),
|
|
||||||
RAPIDJSON_UINT64_C2(0x9c400000, 0x00000000), RAPIDJSON_UINT64_C2(0xe8d4a510, 0x00000000),
|
|
||||||
RAPIDJSON_UINT64_C2(0xad78ebc5, 0xac620000), RAPIDJSON_UINT64_C2(0x813f3978, 0xf8940984),
|
|
||||||
RAPIDJSON_UINT64_C2(0xc097ce7b, 0xc90715b3), RAPIDJSON_UINT64_C2(0x8f7e32ce, 0x7bea5c70),
|
|
||||||
RAPIDJSON_UINT64_C2(0xd5d238a4, 0xabe98068), RAPIDJSON_UINT64_C2(0x9f4f2726, 0x179a2245),
|
|
||||||
RAPIDJSON_UINT64_C2(0xed63a231, 0xd4c4fb27), RAPIDJSON_UINT64_C2(0xb0de6538, 0x8cc8ada8),
|
|
||||||
RAPIDJSON_UINT64_C2(0x83c7088e, 0x1aab65db), RAPIDJSON_UINT64_C2(0xc45d1df9, 0x42711d9a),
|
|
||||||
RAPIDJSON_UINT64_C2(0x924d692c, 0xa61be758), RAPIDJSON_UINT64_C2(0xda01ee64, 0x1a708dea),
|
|
||||||
RAPIDJSON_UINT64_C2(0xa26da399, 0x9aef774a), RAPIDJSON_UINT64_C2(0xf209787b, 0xb47d6b85),
|
|
||||||
RAPIDJSON_UINT64_C2(0xb454e4a1, 0x79dd1877), RAPIDJSON_UINT64_C2(0x865b8692, 0x5b9bc5c2),
|
|
||||||
RAPIDJSON_UINT64_C2(0xc83553c5, 0xc8965d3d), RAPIDJSON_UINT64_C2(0x952ab45c, 0xfa97a0b3),
|
|
||||||
RAPIDJSON_UINT64_C2(0xde469fbd, 0x99a05fe3), RAPIDJSON_UINT64_C2(0xa59bc234, 0xdb398c25),
|
|
||||||
RAPIDJSON_UINT64_C2(0xf6c69a72, 0xa3989f5c), RAPIDJSON_UINT64_C2(0xb7dcbf53, 0x54e9bece),
|
|
||||||
RAPIDJSON_UINT64_C2(0x88fcf317, 0xf22241e2), RAPIDJSON_UINT64_C2(0xcc20ce9b, 0xd35c78a5),
|
|
||||||
RAPIDJSON_UINT64_C2(0x98165af3, 0x7b2153df), RAPIDJSON_UINT64_C2(0xe2a0b5dc, 0x971f303a),
|
|
||||||
RAPIDJSON_UINT64_C2(0xa8d9d153, 0x5ce3b396), RAPIDJSON_UINT64_C2(0xfb9b7cd9, 0xa4a7443c),
|
|
||||||
RAPIDJSON_UINT64_C2(0xbb764c4c, 0xa7a44410), RAPIDJSON_UINT64_C2(0x8bab8eef, 0xb6409c1a),
|
|
||||||
RAPIDJSON_UINT64_C2(0xd01fef10, 0xa657842c), RAPIDJSON_UINT64_C2(0x9b10a4e5, 0xe9913129),
|
|
||||||
RAPIDJSON_UINT64_C2(0xe7109bfb, 0xa19c0c9d), RAPIDJSON_UINT64_C2(0xac2820d9, 0x623bf429),
|
|
||||||
RAPIDJSON_UINT64_C2(0x80444b5e, 0x7aa7cf85), RAPIDJSON_UINT64_C2(0xbf21e440, 0x03acdd2d),
|
|
||||||
RAPIDJSON_UINT64_C2(0x8e679c2f, 0x5e44ff8f), RAPIDJSON_UINT64_C2(0xd433179d, 0x9c8cb841),
|
|
||||||
RAPIDJSON_UINT64_C2(0x9e19db92, 0xb4e31ba9), RAPIDJSON_UINT64_C2(0xeb96bf6e, 0xbadf77d9),
|
|
||||||
RAPIDJSON_UINT64_C2(0xaf87023b, 0x9bf0ee6b)
|
|
||||||
};
|
|
||||||
static const int16_t kCachedPowers_E[] = {
|
|
||||||
-1220, -1193, -1166, -1140, -1113, -1087, -1060, -1034, -1007, -980,
|
|
||||||
-954, -927, -901, -874, -847, -821, -794, -768, -741, -715,
|
|
||||||
-688, -661, -635, -608, -582, -555, -529, -502, -475, -449,
|
|
||||||
-422, -396, -369, -343, -316, -289, -263, -236, -210, -183,
|
|
||||||
-157, -130, -103, -77, -50, -24, 3, 30, 56, 83,
|
|
||||||
109, 136, 162, 189, 216, 242, 269, 295, 322, 348,
|
|
||||||
375, 402, 428, 455, 481, 508, 534, 561, 588, 614,
|
|
||||||
641, 667, 694, 720, 747, 774, 800, 827, 853, 880,
|
|
||||||
907, 933, 960, 986, 1013, 1039, 1066
|
|
||||||
};
|
|
||||||
return DiyFp(kCachedPowers_F[index], kCachedPowers_E[index]);
|
|
||||||
}
|
|
||||||
|
|
||||||
inline DiyFp GetCachedPower(int e, int* K) {
|
|
||||||
|
|
||||||
//int k = static_cast<int>(ceil((-61 - e) * 0.30102999566398114)) + 374;
|
|
||||||
double dk = (-61 - e) * 0.30102999566398114 + 347; // dk must be positive, so can do ceiling in positive
|
|
||||||
int k = static_cast<int>(dk);
|
|
||||||
if (dk - k > 0.0)
|
|
||||||
k++;
|
|
||||||
|
|
||||||
unsigned index = static_cast<unsigned>((k >> 3) + 1);
|
|
||||||
*K = -(-348 + static_cast<int>(index << 3)); // decimal exponent no need lookup table
|
|
||||||
|
|
||||||
return GetCachedPowerByIndex(index);
|
|
||||||
}
|
|
||||||
|
|
||||||
inline DiyFp GetCachedPower10(int exp, int *outExp) {
|
|
||||||
unsigned index = (static_cast<unsigned>(exp) + 348u) / 8u;
|
|
||||||
*outExp = -348 + static_cast<int>(index) * 8;
|
|
||||||
return GetCachedPowerByIndex(index);
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
RAPIDJSON_DIAG_OFF(padded)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_DIYFP_H_
|
|
||||||
@@ -1,245 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
// This is a C++ header-only implementation of Grisu2 algorithm from the publication:
|
|
||||||
// Loitsch, Florian. "Printing floating-point numbers quickly and accurately with
|
|
||||||
// integers." ACM Sigplan Notices 45.6 (2010): 233-243.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_DTOA_
|
|
||||||
#define RAPIDJSON_DTOA_
|
|
||||||
|
|
||||||
#include "itoa.h" // GetDigitsLut()
|
|
||||||
#include "diyfp.h"
|
|
||||||
#include "ieee754.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(effc++)
|
|
||||||
RAPIDJSON_DIAG_OFF(array-bounds) // some gcc versions generate wrong warnings https://gcc.gnu.org/bugzilla/show_bug.cgi?id=59124
|
|
||||||
#endif
|
|
||||||
|
|
||||||
inline void GrisuRound(char* buffer, int len, uint64_t delta, uint64_t rest, uint64_t ten_kappa, uint64_t wp_w) {
|
|
||||||
while (rest < wp_w && delta - rest >= ten_kappa &&
|
|
||||||
(rest + ten_kappa < wp_w || /// closer
|
|
||||||
wp_w - rest > rest + ten_kappa - wp_w)) {
|
|
||||||
buffer[len - 1]--;
|
|
||||||
rest += ten_kappa;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
inline unsigned CountDecimalDigit32(uint32_t n) {
|
|
||||||
// Simple pure C++ implementation was faster than __builtin_clz version in this situation.
|
|
||||||
if (n < 10) return 1;
|
|
||||||
if (n < 100) return 2;
|
|
||||||
if (n < 1000) return 3;
|
|
||||||
if (n < 10000) return 4;
|
|
||||||
if (n < 100000) return 5;
|
|
||||||
if (n < 1000000) return 6;
|
|
||||||
if (n < 10000000) return 7;
|
|
||||||
if (n < 100000000) return 8;
|
|
||||||
// Will not reach 10 digits in DigitGen()
|
|
||||||
//if (n < 1000000000) return 9;
|
|
||||||
//return 10;
|
|
||||||
return 9;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline void DigitGen(const DiyFp& W, const DiyFp& Mp, uint64_t delta, char* buffer, int* len, int* K) {
|
|
||||||
static const uint32_t kPow10[] = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000 };
|
|
||||||
const DiyFp one(uint64_t(1) << -Mp.e, Mp.e);
|
|
||||||
const DiyFp wp_w = Mp - W;
|
|
||||||
uint32_t p1 = static_cast<uint32_t>(Mp.f >> -one.e);
|
|
||||||
uint64_t p2 = Mp.f & (one.f - 1);
|
|
||||||
unsigned kappa = CountDecimalDigit32(p1); // kappa in [0, 9]
|
|
||||||
*len = 0;
|
|
||||||
|
|
||||||
while (kappa > 0) {
|
|
||||||
uint32_t d = 0;
|
|
||||||
switch (kappa) {
|
|
||||||
case 9: d = p1 / 100000000; p1 %= 100000000; break;
|
|
||||||
case 8: d = p1 / 10000000; p1 %= 10000000; break;
|
|
||||||
case 7: d = p1 / 1000000; p1 %= 1000000; break;
|
|
||||||
case 6: d = p1 / 100000; p1 %= 100000; break;
|
|
||||||
case 5: d = p1 / 10000; p1 %= 10000; break;
|
|
||||||
case 4: d = p1 / 1000; p1 %= 1000; break;
|
|
||||||
case 3: d = p1 / 100; p1 %= 100; break;
|
|
||||||
case 2: d = p1 / 10; p1 %= 10; break;
|
|
||||||
case 1: d = p1; p1 = 0; break;
|
|
||||||
default:;
|
|
||||||
}
|
|
||||||
if (d || *len)
|
|
||||||
buffer[(*len)++] = static_cast<char>('0' + static_cast<char>(d));
|
|
||||||
kappa--;
|
|
||||||
uint64_t tmp = (static_cast<uint64_t>(p1) << -one.e) + p2;
|
|
||||||
if (tmp <= delta) {
|
|
||||||
*K += kappa;
|
|
||||||
GrisuRound(buffer, *len, delta, tmp, static_cast<uint64_t>(kPow10[kappa]) << -one.e, wp_w.f);
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// kappa = 0
|
|
||||||
for (;;) {
|
|
||||||
p2 *= 10;
|
|
||||||
delta *= 10;
|
|
||||||
char d = static_cast<char>(p2 >> -one.e);
|
|
||||||
if (d || *len)
|
|
||||||
buffer[(*len)++] = static_cast<char>('0' + d);
|
|
||||||
p2 &= one.f - 1;
|
|
||||||
kappa--;
|
|
||||||
if (p2 < delta) {
|
|
||||||
*K += kappa;
|
|
||||||
int index = -static_cast<int>(kappa);
|
|
||||||
GrisuRound(buffer, *len, delta, p2, one.f, wp_w.f * (index < 9 ? kPow10[-static_cast<int>(kappa)] : 0));
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
inline void Grisu2(double value, char* buffer, int* length, int* K) {
|
|
||||||
const DiyFp v(value);
|
|
||||||
DiyFp w_m, w_p;
|
|
||||||
v.NormalizedBoundaries(&w_m, &w_p);
|
|
||||||
|
|
||||||
const DiyFp c_mk = GetCachedPower(w_p.e, K);
|
|
||||||
const DiyFp W = v.Normalize() * c_mk;
|
|
||||||
DiyFp Wp = w_p * c_mk;
|
|
||||||
DiyFp Wm = w_m * c_mk;
|
|
||||||
Wm.f++;
|
|
||||||
Wp.f--;
|
|
||||||
DigitGen(W, Wp, Wp.f - Wm.f, buffer, length, K);
|
|
||||||
}
|
|
||||||
|
|
||||||
inline char* WriteExponent(int K, char* buffer) {
|
|
||||||
if (K < 0) {
|
|
||||||
*buffer++ = '-';
|
|
||||||
K = -K;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (K >= 100) {
|
|
||||||
*buffer++ = static_cast<char>('0' + static_cast<char>(K / 100));
|
|
||||||
K %= 100;
|
|
||||||
const char* d = GetDigitsLut() + K * 2;
|
|
||||||
*buffer++ = d[0];
|
|
||||||
*buffer++ = d[1];
|
|
||||||
}
|
|
||||||
else if (K >= 10) {
|
|
||||||
const char* d = GetDigitsLut() + K * 2;
|
|
||||||
*buffer++ = d[0];
|
|
||||||
*buffer++ = d[1];
|
|
||||||
}
|
|
||||||
else
|
|
||||||
*buffer++ = static_cast<char>('0' + static_cast<char>(K));
|
|
||||||
|
|
||||||
return buffer;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline char* Prettify(char* buffer, int length, int k, int maxDecimalPlaces) {
|
|
||||||
const int kk = length + k; // 10^(kk-1) <= v < 10^kk
|
|
||||||
|
|
||||||
if (0 <= k && kk <= 21) {
|
|
||||||
// 1234e7 -> 12340000000
|
|
||||||
for (int i = length; i < kk; i++)
|
|
||||||
buffer[i] = '0';
|
|
||||||
buffer[kk] = '.';
|
|
||||||
buffer[kk + 1] = '0';
|
|
||||||
return &buffer[kk + 2];
|
|
||||||
}
|
|
||||||
else if (0 < kk && kk <= 21) {
|
|
||||||
// 1234e-2 -> 12.34
|
|
||||||
std::memmove(&buffer[kk + 1], &buffer[kk], static_cast<size_t>(length - kk));
|
|
||||||
buffer[kk] = '.';
|
|
||||||
if (0 > k + maxDecimalPlaces) {
|
|
||||||
// When maxDecimalPlaces = 2, 1.2345 -> 1.23, 1.102 -> 1.1
|
|
||||||
// Remove extra trailing zeros (at least one) after truncation.
|
|
||||||
for (int i = kk + maxDecimalPlaces; i > kk + 1; i--)
|
|
||||||
if (buffer[i] != '0')
|
|
||||||
return &buffer[i + 1];
|
|
||||||
return &buffer[kk + 2]; // Reserve one zero
|
|
||||||
}
|
|
||||||
else
|
|
||||||
return &buffer[length + 1];
|
|
||||||
}
|
|
||||||
else if (-6 < kk && kk <= 0) {
|
|
||||||
// 1234e-6 -> 0.001234
|
|
||||||
const int offset = 2 - kk;
|
|
||||||
std::memmove(&buffer[offset], &buffer[0], static_cast<size_t>(length));
|
|
||||||
buffer[0] = '0';
|
|
||||||
buffer[1] = '.';
|
|
||||||
for (int i = 2; i < offset; i++)
|
|
||||||
buffer[i] = '0';
|
|
||||||
if (length - kk > maxDecimalPlaces) {
|
|
||||||
// When maxDecimalPlaces = 2, 0.123 -> 0.12, 0.102 -> 0.1
|
|
||||||
// Remove extra trailing zeros (at least one) after truncation.
|
|
||||||
for (int i = maxDecimalPlaces + 1; i > 2; i--)
|
|
||||||
if (buffer[i] != '0')
|
|
||||||
return &buffer[i + 1];
|
|
||||||
return &buffer[3]; // Reserve one zero
|
|
||||||
}
|
|
||||||
else
|
|
||||||
return &buffer[length + offset];
|
|
||||||
}
|
|
||||||
else if (kk < -maxDecimalPlaces) {
|
|
||||||
// Truncate to zero
|
|
||||||
buffer[0] = '0';
|
|
||||||
buffer[1] = '.';
|
|
||||||
buffer[2] = '0';
|
|
||||||
return &buffer[3];
|
|
||||||
}
|
|
||||||
else if (length == 1) {
|
|
||||||
// 1e30
|
|
||||||
buffer[1] = 'e';
|
|
||||||
return WriteExponent(kk - 1, &buffer[2]);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
// 1234e30 -> 1.234e33
|
|
||||||
std::memmove(&buffer[2], &buffer[1], static_cast<size_t>(length - 1));
|
|
||||||
buffer[1] = '.';
|
|
||||||
buffer[length + 1] = 'e';
|
|
||||||
return WriteExponent(kk - 1, &buffer[0 + length + 2]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
inline char* dtoa(double value, char* buffer, int maxDecimalPlaces = 324) {
|
|
||||||
RAPIDJSON_ASSERT(maxDecimalPlaces >= 1);
|
|
||||||
Double d(value);
|
|
||||||
if (d.IsZero()) {
|
|
||||||
if (d.Sign())
|
|
||||||
*buffer++ = '-'; // -0.0, Issue #289
|
|
||||||
buffer[0] = '0';
|
|
||||||
buffer[1] = '.';
|
|
||||||
buffer[2] = '0';
|
|
||||||
return &buffer[3];
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
if (value < 0) {
|
|
||||||
*buffer++ = '-';
|
|
||||||
value = -value;
|
|
||||||
}
|
|
||||||
int length, K;
|
|
||||||
Grisu2(value, buffer, &length, &K);
|
|
||||||
return Prettify(buffer, length, K, maxDecimalPlaces);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_DTOA_
|
|
||||||
@@ -1,78 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_IEEE754_
|
|
||||||
#define RAPIDJSON_IEEE754_
|
|
||||||
|
|
||||||
#include "../rapidjson.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
class Double {
|
|
||||||
public:
|
|
||||||
Double() {}
|
|
||||||
Double(double d) : d_(d) {}
|
|
||||||
Double(uint64_t u) : u_(u) {}
|
|
||||||
|
|
||||||
double Value() const { return d_; }
|
|
||||||
uint64_t Uint64Value() const { return u_; }
|
|
||||||
|
|
||||||
double NextPositiveDouble() const {
|
|
||||||
RAPIDJSON_ASSERT(!Sign());
|
|
||||||
return Double(u_ + 1).Value();
|
|
||||||
}
|
|
||||||
|
|
||||||
bool Sign() const { return (u_ & kSignMask) != 0; }
|
|
||||||
uint64_t Significand() const { return u_ & kSignificandMask; }
|
|
||||||
int Exponent() const { return static_cast<int>(((u_ & kExponentMask) >> kSignificandSize) - kExponentBias); }
|
|
||||||
|
|
||||||
bool IsNan() const { return (u_ & kExponentMask) == kExponentMask && Significand() != 0; }
|
|
||||||
bool IsInf() const { return (u_ & kExponentMask) == kExponentMask && Significand() == 0; }
|
|
||||||
bool IsNanOrInf() const { return (u_ & kExponentMask) == kExponentMask; }
|
|
||||||
bool IsNormal() const { return (u_ & kExponentMask) != 0 || Significand() == 0; }
|
|
||||||
bool IsZero() const { return (u_ & (kExponentMask | kSignificandMask)) == 0; }
|
|
||||||
|
|
||||||
uint64_t IntegerSignificand() const { return IsNormal() ? Significand() | kHiddenBit : Significand(); }
|
|
||||||
int IntegerExponent() const { return (IsNormal() ? Exponent() : kDenormalExponent) - kSignificandSize; }
|
|
||||||
uint64_t ToBias() const { return (u_ & kSignMask) ? ~u_ + 1 : u_ | kSignMask; }
|
|
||||||
|
|
||||||
static unsigned EffectiveSignificandSize(int order) {
|
|
||||||
if (order >= -1021)
|
|
||||||
return 53;
|
|
||||||
else if (order <= -1074)
|
|
||||||
return 0;
|
|
||||||
else
|
|
||||||
return static_cast<unsigned>(order) + 1074;
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
static const int kSignificandSize = 52;
|
|
||||||
static const int kExponentBias = 0x3FF;
|
|
||||||
static const int kDenormalExponent = 1 - kExponentBias;
|
|
||||||
static const uint64_t kSignMask = RAPIDJSON_UINT64_C2(0x80000000, 0x00000000);
|
|
||||||
static const uint64_t kExponentMask = RAPIDJSON_UINT64_C2(0x7FF00000, 0x00000000);
|
|
||||||
static const uint64_t kSignificandMask = RAPIDJSON_UINT64_C2(0x000FFFFF, 0xFFFFFFFF);
|
|
||||||
static const uint64_t kHiddenBit = RAPIDJSON_UINT64_C2(0x00100000, 0x00000000);
|
|
||||||
|
|
||||||
union {
|
|
||||||
double d_;
|
|
||||||
uint64_t u_;
|
|
||||||
};
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_IEEE754_
|
|
||||||
@@ -1,304 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_ITOA_
|
|
||||||
#define RAPIDJSON_ITOA_
|
|
||||||
|
|
||||||
#include "../rapidjson.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
inline const char* GetDigitsLut() {
|
|
||||||
static const char cDigitsLut[200] = {
|
|
||||||
'0','0','0','1','0','2','0','3','0','4','0','5','0','6','0','7','0','8','0','9',
|
|
||||||
'1','0','1','1','1','2','1','3','1','4','1','5','1','6','1','7','1','8','1','9',
|
|
||||||
'2','0','2','1','2','2','2','3','2','4','2','5','2','6','2','7','2','8','2','9',
|
|
||||||
'3','0','3','1','3','2','3','3','3','4','3','5','3','6','3','7','3','8','3','9',
|
|
||||||
'4','0','4','1','4','2','4','3','4','4','4','5','4','6','4','7','4','8','4','9',
|
|
||||||
'5','0','5','1','5','2','5','3','5','4','5','5','5','6','5','7','5','8','5','9',
|
|
||||||
'6','0','6','1','6','2','6','3','6','4','6','5','6','6','6','7','6','8','6','9',
|
|
||||||
'7','0','7','1','7','2','7','3','7','4','7','5','7','6','7','7','7','8','7','9',
|
|
||||||
'8','0','8','1','8','2','8','3','8','4','8','5','8','6','8','7','8','8','8','9',
|
|
||||||
'9','0','9','1','9','2','9','3','9','4','9','5','9','6','9','7','9','8','9','9'
|
|
||||||
};
|
|
||||||
return cDigitsLut;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline char* u32toa(uint32_t value, char* buffer) {
|
|
||||||
const char* cDigitsLut = GetDigitsLut();
|
|
||||||
|
|
||||||
if (value < 10000) {
|
|
||||||
const uint32_t d1 = (value / 100) << 1;
|
|
||||||
const uint32_t d2 = (value % 100) << 1;
|
|
||||||
|
|
||||||
if (value >= 1000)
|
|
||||||
*buffer++ = cDigitsLut[d1];
|
|
||||||
if (value >= 100)
|
|
||||||
*buffer++ = cDigitsLut[d1 + 1];
|
|
||||||
if (value >= 10)
|
|
||||||
*buffer++ = cDigitsLut[d2];
|
|
||||||
*buffer++ = cDigitsLut[d2 + 1];
|
|
||||||
}
|
|
||||||
else if (value < 100000000) {
|
|
||||||
// value = bbbbcccc
|
|
||||||
const uint32_t b = value / 10000;
|
|
||||||
const uint32_t c = value % 10000;
|
|
||||||
|
|
||||||
const uint32_t d1 = (b / 100) << 1;
|
|
||||||
const uint32_t d2 = (b % 100) << 1;
|
|
||||||
|
|
||||||
const uint32_t d3 = (c / 100) << 1;
|
|
||||||
const uint32_t d4 = (c % 100) << 1;
|
|
||||||
|
|
||||||
if (value >= 10000000)
|
|
||||||
*buffer++ = cDigitsLut[d1];
|
|
||||||
if (value >= 1000000)
|
|
||||||
*buffer++ = cDigitsLut[d1 + 1];
|
|
||||||
if (value >= 100000)
|
|
||||||
*buffer++ = cDigitsLut[d2];
|
|
||||||
*buffer++ = cDigitsLut[d2 + 1];
|
|
||||||
|
|
||||||
*buffer++ = cDigitsLut[d3];
|
|
||||||
*buffer++ = cDigitsLut[d3 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d4];
|
|
||||||
*buffer++ = cDigitsLut[d4 + 1];
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
// value = aabbbbcccc in decimal
|
|
||||||
|
|
||||||
const uint32_t a = value / 100000000; // 1 to 42
|
|
||||||
value %= 100000000;
|
|
||||||
|
|
||||||
if (a >= 10) {
|
|
||||||
const unsigned i = a << 1;
|
|
||||||
*buffer++ = cDigitsLut[i];
|
|
||||||
*buffer++ = cDigitsLut[i + 1];
|
|
||||||
}
|
|
||||||
else
|
|
||||||
*buffer++ = static_cast<char>('0' + static_cast<char>(a));
|
|
||||||
|
|
||||||
const uint32_t b = value / 10000; // 0 to 9999
|
|
||||||
const uint32_t c = value % 10000; // 0 to 9999
|
|
||||||
|
|
||||||
const uint32_t d1 = (b / 100) << 1;
|
|
||||||
const uint32_t d2 = (b % 100) << 1;
|
|
||||||
|
|
||||||
const uint32_t d3 = (c / 100) << 1;
|
|
||||||
const uint32_t d4 = (c % 100) << 1;
|
|
||||||
|
|
||||||
*buffer++ = cDigitsLut[d1];
|
|
||||||
*buffer++ = cDigitsLut[d1 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d2];
|
|
||||||
*buffer++ = cDigitsLut[d2 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d3];
|
|
||||||
*buffer++ = cDigitsLut[d3 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d4];
|
|
||||||
*buffer++ = cDigitsLut[d4 + 1];
|
|
||||||
}
|
|
||||||
return buffer;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline char* i32toa(int32_t value, char* buffer) {
|
|
||||||
uint32_t u = static_cast<uint32_t>(value);
|
|
||||||
if (value < 0) {
|
|
||||||
*buffer++ = '-';
|
|
||||||
u = ~u + 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
return u32toa(u, buffer);
|
|
||||||
}
|
|
||||||
|
|
||||||
inline char* u64toa(uint64_t value, char* buffer) {
|
|
||||||
const char* cDigitsLut = GetDigitsLut();
|
|
||||||
const uint64_t kTen8 = 100000000;
|
|
||||||
const uint64_t kTen9 = kTen8 * 10;
|
|
||||||
const uint64_t kTen10 = kTen8 * 100;
|
|
||||||
const uint64_t kTen11 = kTen8 * 1000;
|
|
||||||
const uint64_t kTen12 = kTen8 * 10000;
|
|
||||||
const uint64_t kTen13 = kTen8 * 100000;
|
|
||||||
const uint64_t kTen14 = kTen8 * 1000000;
|
|
||||||
const uint64_t kTen15 = kTen8 * 10000000;
|
|
||||||
const uint64_t kTen16 = kTen8 * kTen8;
|
|
||||||
|
|
||||||
if (value < kTen8) {
|
|
||||||
uint32_t v = static_cast<uint32_t>(value);
|
|
||||||
if (v < 10000) {
|
|
||||||
const uint32_t d1 = (v / 100) << 1;
|
|
||||||
const uint32_t d2 = (v % 100) << 1;
|
|
||||||
|
|
||||||
if (v >= 1000)
|
|
||||||
*buffer++ = cDigitsLut[d1];
|
|
||||||
if (v >= 100)
|
|
||||||
*buffer++ = cDigitsLut[d1 + 1];
|
|
||||||
if (v >= 10)
|
|
||||||
*buffer++ = cDigitsLut[d2];
|
|
||||||
*buffer++ = cDigitsLut[d2 + 1];
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
// value = bbbbcccc
|
|
||||||
const uint32_t b = v / 10000;
|
|
||||||
const uint32_t c = v % 10000;
|
|
||||||
|
|
||||||
const uint32_t d1 = (b / 100) << 1;
|
|
||||||
const uint32_t d2 = (b % 100) << 1;
|
|
||||||
|
|
||||||
const uint32_t d3 = (c / 100) << 1;
|
|
||||||
const uint32_t d4 = (c % 100) << 1;
|
|
||||||
|
|
||||||
if (value >= 10000000)
|
|
||||||
*buffer++ = cDigitsLut[d1];
|
|
||||||
if (value >= 1000000)
|
|
||||||
*buffer++ = cDigitsLut[d1 + 1];
|
|
||||||
if (value >= 100000)
|
|
||||||
*buffer++ = cDigitsLut[d2];
|
|
||||||
*buffer++ = cDigitsLut[d2 + 1];
|
|
||||||
|
|
||||||
*buffer++ = cDigitsLut[d3];
|
|
||||||
*buffer++ = cDigitsLut[d3 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d4];
|
|
||||||
*buffer++ = cDigitsLut[d4 + 1];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (value < kTen16) {
|
|
||||||
const uint32_t v0 = static_cast<uint32_t>(value / kTen8);
|
|
||||||
const uint32_t v1 = static_cast<uint32_t>(value % kTen8);
|
|
||||||
|
|
||||||
const uint32_t b0 = v0 / 10000;
|
|
||||||
const uint32_t c0 = v0 % 10000;
|
|
||||||
|
|
||||||
const uint32_t d1 = (b0 / 100) << 1;
|
|
||||||
const uint32_t d2 = (b0 % 100) << 1;
|
|
||||||
|
|
||||||
const uint32_t d3 = (c0 / 100) << 1;
|
|
||||||
const uint32_t d4 = (c0 % 100) << 1;
|
|
||||||
|
|
||||||
const uint32_t b1 = v1 / 10000;
|
|
||||||
const uint32_t c1 = v1 % 10000;
|
|
||||||
|
|
||||||
const uint32_t d5 = (b1 / 100) << 1;
|
|
||||||
const uint32_t d6 = (b1 % 100) << 1;
|
|
||||||
|
|
||||||
const uint32_t d7 = (c1 / 100) << 1;
|
|
||||||
const uint32_t d8 = (c1 % 100) << 1;
|
|
||||||
|
|
||||||
if (value >= kTen15)
|
|
||||||
*buffer++ = cDigitsLut[d1];
|
|
||||||
if (value >= kTen14)
|
|
||||||
*buffer++ = cDigitsLut[d1 + 1];
|
|
||||||
if (value >= kTen13)
|
|
||||||
*buffer++ = cDigitsLut[d2];
|
|
||||||
if (value >= kTen12)
|
|
||||||
*buffer++ = cDigitsLut[d2 + 1];
|
|
||||||
if (value >= kTen11)
|
|
||||||
*buffer++ = cDigitsLut[d3];
|
|
||||||
if (value >= kTen10)
|
|
||||||
*buffer++ = cDigitsLut[d3 + 1];
|
|
||||||
if (value >= kTen9)
|
|
||||||
*buffer++ = cDigitsLut[d4];
|
|
||||||
if (value >= kTen8)
|
|
||||||
*buffer++ = cDigitsLut[d4 + 1];
|
|
||||||
|
|
||||||
*buffer++ = cDigitsLut[d5];
|
|
||||||
*buffer++ = cDigitsLut[d5 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d6];
|
|
||||||
*buffer++ = cDigitsLut[d6 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d7];
|
|
||||||
*buffer++ = cDigitsLut[d7 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d8];
|
|
||||||
*buffer++ = cDigitsLut[d8 + 1];
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
const uint32_t a = static_cast<uint32_t>(value / kTen16); // 1 to 1844
|
|
||||||
value %= kTen16;
|
|
||||||
|
|
||||||
if (a < 10)
|
|
||||||
*buffer++ = static_cast<char>('0' + static_cast<char>(a));
|
|
||||||
else if (a < 100) {
|
|
||||||
const uint32_t i = a << 1;
|
|
||||||
*buffer++ = cDigitsLut[i];
|
|
||||||
*buffer++ = cDigitsLut[i + 1];
|
|
||||||
}
|
|
||||||
else if (a < 1000) {
|
|
||||||
*buffer++ = static_cast<char>('0' + static_cast<char>(a / 100));
|
|
||||||
|
|
||||||
const uint32_t i = (a % 100) << 1;
|
|
||||||
*buffer++ = cDigitsLut[i];
|
|
||||||
*buffer++ = cDigitsLut[i + 1];
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
const uint32_t i = (a / 100) << 1;
|
|
||||||
const uint32_t j = (a % 100) << 1;
|
|
||||||
*buffer++ = cDigitsLut[i];
|
|
||||||
*buffer++ = cDigitsLut[i + 1];
|
|
||||||
*buffer++ = cDigitsLut[j];
|
|
||||||
*buffer++ = cDigitsLut[j + 1];
|
|
||||||
}
|
|
||||||
|
|
||||||
const uint32_t v0 = static_cast<uint32_t>(value / kTen8);
|
|
||||||
const uint32_t v1 = static_cast<uint32_t>(value % kTen8);
|
|
||||||
|
|
||||||
const uint32_t b0 = v0 / 10000;
|
|
||||||
const uint32_t c0 = v0 % 10000;
|
|
||||||
|
|
||||||
const uint32_t d1 = (b0 / 100) << 1;
|
|
||||||
const uint32_t d2 = (b0 % 100) << 1;
|
|
||||||
|
|
||||||
const uint32_t d3 = (c0 / 100) << 1;
|
|
||||||
const uint32_t d4 = (c0 % 100) << 1;
|
|
||||||
|
|
||||||
const uint32_t b1 = v1 / 10000;
|
|
||||||
const uint32_t c1 = v1 % 10000;
|
|
||||||
|
|
||||||
const uint32_t d5 = (b1 / 100) << 1;
|
|
||||||
const uint32_t d6 = (b1 % 100) << 1;
|
|
||||||
|
|
||||||
const uint32_t d7 = (c1 / 100) << 1;
|
|
||||||
const uint32_t d8 = (c1 % 100) << 1;
|
|
||||||
|
|
||||||
*buffer++ = cDigitsLut[d1];
|
|
||||||
*buffer++ = cDigitsLut[d1 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d2];
|
|
||||||
*buffer++ = cDigitsLut[d2 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d3];
|
|
||||||
*buffer++ = cDigitsLut[d3 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d4];
|
|
||||||
*buffer++ = cDigitsLut[d4 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d5];
|
|
||||||
*buffer++ = cDigitsLut[d5 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d6];
|
|
||||||
*buffer++ = cDigitsLut[d6 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d7];
|
|
||||||
*buffer++ = cDigitsLut[d7 + 1];
|
|
||||||
*buffer++ = cDigitsLut[d8];
|
|
||||||
*buffer++ = cDigitsLut[d8 + 1];
|
|
||||||
}
|
|
||||||
|
|
||||||
return buffer;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline char* i64toa(int64_t value, char* buffer) {
|
|
||||||
uint64_t u = static_cast<uint64_t>(value);
|
|
||||||
if (value < 0) {
|
|
||||||
*buffer++ = '-';
|
|
||||||
u = ~u + 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
return u64toa(u, buffer);
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_ITOA_
|
|
||||||
@@ -1,181 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_INTERNAL_META_H_
|
|
||||||
#define RAPIDJSON_INTERNAL_META_H_
|
|
||||||
|
|
||||||
#include "../rapidjson.h"
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(effc++)
|
|
||||||
#endif
|
|
||||||
#if defined(_MSC_VER)
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(6334)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if RAPIDJSON_HAS_CXX11_TYPETRAITS
|
|
||||||
#include <type_traits>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
//@cond RAPIDJSON_INTERNAL
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
// Helper to wrap/convert arbitrary types to void, useful for arbitrary type matching
|
|
||||||
template <typename T> struct Void { typedef void Type; };
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// BoolType, TrueType, FalseType
|
|
||||||
//
|
|
||||||
template <bool Cond> struct BoolType {
|
|
||||||
static const bool Value = Cond;
|
|
||||||
typedef BoolType Type;
|
|
||||||
};
|
|
||||||
typedef BoolType<true> TrueType;
|
|
||||||
typedef BoolType<false> FalseType;
|
|
||||||
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// SelectIf, BoolExpr, NotExpr, AndExpr, OrExpr
|
|
||||||
//
|
|
||||||
|
|
||||||
template <bool C> struct SelectIfImpl { template <typename T1, typename T2> struct Apply { typedef T1 Type; }; };
|
|
||||||
template <> struct SelectIfImpl<false> { template <typename T1, typename T2> struct Apply { typedef T2 Type; }; };
|
|
||||||
template <bool C, typename T1, typename T2> struct SelectIfCond : SelectIfImpl<C>::template Apply<T1,T2> {};
|
|
||||||
template <typename C, typename T1, typename T2> struct SelectIf : SelectIfCond<C::Value, T1, T2> {};
|
|
||||||
|
|
||||||
template <bool Cond1, bool Cond2> struct AndExprCond : FalseType {};
|
|
||||||
template <> struct AndExprCond<true, true> : TrueType {};
|
|
||||||
template <bool Cond1, bool Cond2> struct OrExprCond : TrueType {};
|
|
||||||
template <> struct OrExprCond<false, false> : FalseType {};
|
|
||||||
|
|
||||||
template <typename C> struct BoolExpr : SelectIf<C,TrueType,FalseType>::Type {};
|
|
||||||
template <typename C> struct NotExpr : SelectIf<C,FalseType,TrueType>::Type {};
|
|
||||||
template <typename C1, typename C2> struct AndExpr : AndExprCond<C1::Value, C2::Value>::Type {};
|
|
||||||
template <typename C1, typename C2> struct OrExpr : OrExprCond<C1::Value, C2::Value>::Type {};
|
|
||||||
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// AddConst, MaybeAddConst, RemoveConst
|
|
||||||
template <typename T> struct AddConst { typedef const T Type; };
|
|
||||||
template <bool Constify, typename T> struct MaybeAddConst : SelectIfCond<Constify, const T, T> {};
|
|
||||||
template <typename T> struct RemoveConst { typedef T Type; };
|
|
||||||
template <typename T> struct RemoveConst<const T> { typedef T Type; };
|
|
||||||
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// IsSame, IsConst, IsMoreConst, IsPointer
|
|
||||||
//
|
|
||||||
template <typename T, typename U> struct IsSame : FalseType {};
|
|
||||||
template <typename T> struct IsSame<T, T> : TrueType {};
|
|
||||||
|
|
||||||
template <typename T> struct IsConst : FalseType {};
|
|
||||||
template <typename T> struct IsConst<const T> : TrueType {};
|
|
||||||
|
|
||||||
template <typename CT, typename T>
|
|
||||||
struct IsMoreConst
|
|
||||||
: AndExpr<IsSame<typename RemoveConst<CT>::Type, typename RemoveConst<T>::Type>,
|
|
||||||
BoolType<IsConst<CT>::Value >= IsConst<T>::Value> >::Type {};
|
|
||||||
|
|
||||||
template <typename T> struct IsPointer : FalseType {};
|
|
||||||
template <typename T> struct IsPointer<T*> : TrueType {};
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// IsBaseOf
|
|
||||||
//
|
|
||||||
#if RAPIDJSON_HAS_CXX11_TYPETRAITS
|
|
||||||
|
|
||||||
template <typename B, typename D> struct IsBaseOf
|
|
||||||
: BoolType< ::std::is_base_of<B,D>::value> {};
|
|
||||||
|
|
||||||
#else // simplified version adopted from Boost
|
|
||||||
|
|
||||||
template<typename B, typename D> struct IsBaseOfImpl {
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(B) != 0);
|
|
||||||
RAPIDJSON_STATIC_ASSERT(sizeof(D) != 0);
|
|
||||||
|
|
||||||
typedef char (&Yes)[1];
|
|
||||||
typedef char (&No) [2];
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
static Yes Check(const D*, T);
|
|
||||||
static No Check(const B*, int);
|
|
||||||
|
|
||||||
struct Host {
|
|
||||||
operator const B*() const;
|
|
||||||
operator const D*();
|
|
||||||
};
|
|
||||||
|
|
||||||
enum { Value = (sizeof(Check(Host(), 0)) == sizeof(Yes)) };
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename B, typename D> struct IsBaseOf
|
|
||||||
: OrExpr<IsSame<B, D>, BoolExpr<IsBaseOfImpl<B, D> > >::Type {};
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_HAS_CXX11_TYPETRAITS
|
|
||||||
|
|
||||||
|
|
||||||
//////////////////////////////////////////////////////////////////////////
|
|
||||||
// EnableIf / DisableIf
|
|
||||||
//
|
|
||||||
template <bool Condition, typename T = void> struct EnableIfCond { typedef T Type; };
|
|
||||||
template <typename T> struct EnableIfCond<false, T> { /* empty */ };
|
|
||||||
|
|
||||||
template <bool Condition, typename T = void> struct DisableIfCond { typedef T Type; };
|
|
||||||
template <typename T> struct DisableIfCond<true, T> { /* empty */ };
|
|
||||||
|
|
||||||
template <typename Condition, typename T = void>
|
|
||||||
struct EnableIf : EnableIfCond<Condition::Value, T> {};
|
|
||||||
|
|
||||||
template <typename Condition, typename T = void>
|
|
||||||
struct DisableIf : DisableIfCond<Condition::Value, T> {};
|
|
||||||
|
|
||||||
// SFINAE helpers
|
|
||||||
struct SfinaeTag {};
|
|
||||||
template <typename T> struct RemoveSfinaeTag;
|
|
||||||
template <typename T> struct RemoveSfinaeTag<SfinaeTag&(*)(T)> { typedef T Type; };
|
|
||||||
|
|
||||||
#define RAPIDJSON_REMOVEFPTR_(type) \
|
|
||||||
typename ::RAPIDJSON_NAMESPACE::internal::RemoveSfinaeTag \
|
|
||||||
< ::RAPIDJSON_NAMESPACE::internal::SfinaeTag&(*) type>::Type
|
|
||||||
|
|
||||||
#define RAPIDJSON_ENABLEIF(cond) \
|
|
||||||
typename ::RAPIDJSON_NAMESPACE::internal::EnableIf \
|
|
||||||
<RAPIDJSON_REMOVEFPTR_(cond)>::Type * = NULL
|
|
||||||
|
|
||||||
#define RAPIDJSON_DISABLEIF(cond) \
|
|
||||||
typename ::RAPIDJSON_NAMESPACE::internal::DisableIf \
|
|
||||||
<RAPIDJSON_REMOVEFPTR_(cond)>::Type * = NULL
|
|
||||||
|
|
||||||
#define RAPIDJSON_ENABLEIF_RETURN(cond,returntype) \
|
|
||||||
typename ::RAPIDJSON_NAMESPACE::internal::EnableIf \
|
|
||||||
<RAPIDJSON_REMOVEFPTR_(cond), \
|
|
||||||
RAPIDJSON_REMOVEFPTR_(returntype)>::Type
|
|
||||||
|
|
||||||
#define RAPIDJSON_DISABLEIF_RETURN(cond,returntype) \
|
|
||||||
typename ::RAPIDJSON_NAMESPACE::internal::DisableIf \
|
|
||||||
<RAPIDJSON_REMOVEFPTR_(cond), \
|
|
||||||
RAPIDJSON_REMOVEFPTR_(returntype)>::Type
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
//@endcond
|
|
||||||
|
|
||||||
#if defined(__GNUC__) || defined(_MSC_VER)
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_INTERNAL_META_H_
|
|
||||||
@@ -1,55 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_POW10_
|
|
||||||
#define RAPIDJSON_POW10_
|
|
||||||
|
|
||||||
#include "../rapidjson.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
//! Computes integer powers of 10 in double (10.0^n).
|
|
||||||
/*! This function uses lookup table for fast and accurate results.
|
|
||||||
\param n non-negative exponent. Must <= 308.
|
|
||||||
\return 10.0^n
|
|
||||||
*/
|
|
||||||
inline double Pow10(int n) {
|
|
||||||
static const double e[] = { // 1e-0...1e308: 309 * 8 bytes = 2472 bytes
|
|
||||||
1e+0,
|
|
||||||
1e+1, 1e+2, 1e+3, 1e+4, 1e+5, 1e+6, 1e+7, 1e+8, 1e+9, 1e+10, 1e+11, 1e+12, 1e+13, 1e+14, 1e+15, 1e+16, 1e+17, 1e+18, 1e+19, 1e+20,
|
|
||||||
1e+21, 1e+22, 1e+23, 1e+24, 1e+25, 1e+26, 1e+27, 1e+28, 1e+29, 1e+30, 1e+31, 1e+32, 1e+33, 1e+34, 1e+35, 1e+36, 1e+37, 1e+38, 1e+39, 1e+40,
|
|
||||||
1e+41, 1e+42, 1e+43, 1e+44, 1e+45, 1e+46, 1e+47, 1e+48, 1e+49, 1e+50, 1e+51, 1e+52, 1e+53, 1e+54, 1e+55, 1e+56, 1e+57, 1e+58, 1e+59, 1e+60,
|
|
||||||
1e+61, 1e+62, 1e+63, 1e+64, 1e+65, 1e+66, 1e+67, 1e+68, 1e+69, 1e+70, 1e+71, 1e+72, 1e+73, 1e+74, 1e+75, 1e+76, 1e+77, 1e+78, 1e+79, 1e+80,
|
|
||||||
1e+81, 1e+82, 1e+83, 1e+84, 1e+85, 1e+86, 1e+87, 1e+88, 1e+89, 1e+90, 1e+91, 1e+92, 1e+93, 1e+94, 1e+95, 1e+96, 1e+97, 1e+98, 1e+99, 1e+100,
|
|
||||||
1e+101,1e+102,1e+103,1e+104,1e+105,1e+106,1e+107,1e+108,1e+109,1e+110,1e+111,1e+112,1e+113,1e+114,1e+115,1e+116,1e+117,1e+118,1e+119,1e+120,
|
|
||||||
1e+121,1e+122,1e+123,1e+124,1e+125,1e+126,1e+127,1e+128,1e+129,1e+130,1e+131,1e+132,1e+133,1e+134,1e+135,1e+136,1e+137,1e+138,1e+139,1e+140,
|
|
||||||
1e+141,1e+142,1e+143,1e+144,1e+145,1e+146,1e+147,1e+148,1e+149,1e+150,1e+151,1e+152,1e+153,1e+154,1e+155,1e+156,1e+157,1e+158,1e+159,1e+160,
|
|
||||||
1e+161,1e+162,1e+163,1e+164,1e+165,1e+166,1e+167,1e+168,1e+169,1e+170,1e+171,1e+172,1e+173,1e+174,1e+175,1e+176,1e+177,1e+178,1e+179,1e+180,
|
|
||||||
1e+181,1e+182,1e+183,1e+184,1e+185,1e+186,1e+187,1e+188,1e+189,1e+190,1e+191,1e+192,1e+193,1e+194,1e+195,1e+196,1e+197,1e+198,1e+199,1e+200,
|
|
||||||
1e+201,1e+202,1e+203,1e+204,1e+205,1e+206,1e+207,1e+208,1e+209,1e+210,1e+211,1e+212,1e+213,1e+214,1e+215,1e+216,1e+217,1e+218,1e+219,1e+220,
|
|
||||||
1e+221,1e+222,1e+223,1e+224,1e+225,1e+226,1e+227,1e+228,1e+229,1e+230,1e+231,1e+232,1e+233,1e+234,1e+235,1e+236,1e+237,1e+238,1e+239,1e+240,
|
|
||||||
1e+241,1e+242,1e+243,1e+244,1e+245,1e+246,1e+247,1e+248,1e+249,1e+250,1e+251,1e+252,1e+253,1e+254,1e+255,1e+256,1e+257,1e+258,1e+259,1e+260,
|
|
||||||
1e+261,1e+262,1e+263,1e+264,1e+265,1e+266,1e+267,1e+268,1e+269,1e+270,1e+271,1e+272,1e+273,1e+274,1e+275,1e+276,1e+277,1e+278,1e+279,1e+280,
|
|
||||||
1e+281,1e+282,1e+283,1e+284,1e+285,1e+286,1e+287,1e+288,1e+289,1e+290,1e+291,1e+292,1e+293,1e+294,1e+295,1e+296,1e+297,1e+298,1e+299,1e+300,
|
|
||||||
1e+301,1e+302,1e+303,1e+304,1e+305,1e+306,1e+307,1e+308
|
|
||||||
};
|
|
||||||
RAPIDJSON_ASSERT(n >= 0 && n <= 308);
|
|
||||||
return e[n];
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_POW10_
|
|
||||||
@@ -1,701 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_INTERNAL_REGEX_H_
|
|
||||||
#define RAPIDJSON_INTERNAL_REGEX_H_
|
|
||||||
|
|
||||||
#include "../allocators.h"
|
|
||||||
#include "../stream.h"
|
|
||||||
#include "stack.h"
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(padded)
|
|
||||||
RAPIDJSON_DIAG_OFF(switch-enum)
|
|
||||||
RAPIDJSON_DIAG_OFF(implicit-fallthrough)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(effc++)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(4512) // assignment operator could not be generated
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_REGEX_VERBOSE
|
|
||||||
#define RAPIDJSON_REGEX_VERBOSE 0
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// GenericRegex
|
|
||||||
|
|
||||||
static const SizeType kRegexInvalidState = ~SizeType(0); //!< Represents an invalid index in GenericRegex::State::out, out1
|
|
||||||
static const SizeType kRegexInvalidRange = ~SizeType(0);
|
|
||||||
|
|
||||||
//! Regular expression engine with subset of ECMAscript grammar.
|
|
||||||
/*!
|
|
||||||
Supported regular expression syntax:
|
|
||||||
- \c ab Concatenation
|
|
||||||
- \c a|b Alternation
|
|
||||||
- \c a? Zero or one
|
|
||||||
- \c a* Zero or more
|
|
||||||
- \c a+ One or more
|
|
||||||
- \c a{3} Exactly 3 times
|
|
||||||
- \c a{3,} At least 3 times
|
|
||||||
- \c a{3,5} 3 to 5 times
|
|
||||||
- \c (ab) Grouping
|
|
||||||
- \c ^a At the beginning
|
|
||||||
- \c a$ At the end
|
|
||||||
- \c . Any character
|
|
||||||
- \c [abc] Character classes
|
|
||||||
- \c [a-c] Character class range
|
|
||||||
- \c [a-z0-9_] Character class combination
|
|
||||||
- \c [^abc] Negated character classes
|
|
||||||
- \c [^a-c] Negated character class range
|
|
||||||
- \c [\b] Backspace (U+0008)
|
|
||||||
- \c \\| \\\\ ... Escape characters
|
|
||||||
- \c \\f Form feed (U+000C)
|
|
||||||
- \c \\n Line feed (U+000A)
|
|
||||||
- \c \\r Carriage return (U+000D)
|
|
||||||
- \c \\t Tab (U+0009)
|
|
||||||
- \c \\v Vertical tab (U+000B)
|
|
||||||
|
|
||||||
\note This is a Thompson NFA engine, implemented with reference to
|
|
||||||
Cox, Russ. "Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby,...).",
|
|
||||||
https://swtch.com/~rsc/regexp/regexp1.html
|
|
||||||
*/
|
|
||||||
template <typename Encoding, typename Allocator = CrtAllocator>
|
|
||||||
class GenericRegex {
|
|
||||||
public:
|
|
||||||
typedef typename Encoding::Ch Ch;
|
|
||||||
|
|
||||||
GenericRegex(const Ch* source, Allocator* allocator = 0) :
|
|
||||||
states_(allocator, 256), ranges_(allocator, 256), root_(kRegexInvalidState), stateCount_(), rangeCount_(),
|
|
||||||
stateSet_(), state0_(allocator, 0), state1_(allocator, 0), anchorBegin_(), anchorEnd_()
|
|
||||||
{
|
|
||||||
GenericStringStream<Encoding> ss(source);
|
|
||||||
DecodedStream<GenericStringStream<Encoding> > ds(ss);
|
|
||||||
Parse(ds);
|
|
||||||
}
|
|
||||||
|
|
||||||
~GenericRegex() {
|
|
||||||
Allocator::Free(stateSet_);
|
|
||||||
}
|
|
||||||
|
|
||||||
bool IsValid() const {
|
|
||||||
return root_ != kRegexInvalidState;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
bool Match(InputStream& is) const {
|
|
||||||
return SearchWithAnchoring(is, true, true);
|
|
||||||
}
|
|
||||||
|
|
||||||
bool Match(const Ch* s) const {
|
|
||||||
GenericStringStream<Encoding> is(s);
|
|
||||||
return Match(is);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
bool Search(InputStream& is) const {
|
|
||||||
return SearchWithAnchoring(is, anchorBegin_, anchorEnd_);
|
|
||||||
}
|
|
||||||
|
|
||||||
bool Search(const Ch* s) const {
|
|
||||||
GenericStringStream<Encoding> is(s);
|
|
||||||
return Search(is);
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
enum Operator {
|
|
||||||
kZeroOrOne,
|
|
||||||
kZeroOrMore,
|
|
||||||
kOneOrMore,
|
|
||||||
kConcatenation,
|
|
||||||
kAlternation,
|
|
||||||
kLeftParenthesis
|
|
||||||
};
|
|
||||||
|
|
||||||
static const unsigned kAnyCharacterClass = 0xFFFFFFFF; //!< For '.'
|
|
||||||
static const unsigned kRangeCharacterClass = 0xFFFFFFFE;
|
|
||||||
static const unsigned kRangeNegationFlag = 0x80000000;
|
|
||||||
|
|
||||||
struct Range {
|
|
||||||
unsigned start; //
|
|
||||||
unsigned end;
|
|
||||||
SizeType next;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct State {
|
|
||||||
SizeType out; //!< Equals to kInvalid for matching state
|
|
||||||
SizeType out1; //!< Equals to non-kInvalid for split
|
|
||||||
SizeType rangeStart;
|
|
||||||
unsigned codepoint;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct Frag {
|
|
||||||
Frag(SizeType s, SizeType o, SizeType m) : start(s), out(o), minIndex(m) {}
|
|
||||||
SizeType start;
|
|
||||||
SizeType out; //!< link-list of all output states
|
|
||||||
SizeType minIndex;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename SourceStream>
|
|
||||||
class DecodedStream {
|
|
||||||
public:
|
|
||||||
DecodedStream(SourceStream& ss) : ss_(ss), codepoint_() { Decode(); }
|
|
||||||
unsigned Peek() { return codepoint_; }
|
|
||||||
unsigned Take() {
|
|
||||||
unsigned c = codepoint_;
|
|
||||||
if (c) // No further decoding when '\0'
|
|
||||||
Decode();
|
|
||||||
return c;
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
void Decode() {
|
|
||||||
if (!Encoding::Decode(ss_, &codepoint_))
|
|
||||||
codepoint_ = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
SourceStream& ss_;
|
|
||||||
unsigned codepoint_;
|
|
||||||
};
|
|
||||||
|
|
||||||
State& GetState(SizeType index) {
|
|
||||||
RAPIDJSON_ASSERT(index < stateCount_);
|
|
||||||
return states_.template Bottom<State>()[index];
|
|
||||||
}
|
|
||||||
|
|
||||||
const State& GetState(SizeType index) const {
|
|
||||||
RAPIDJSON_ASSERT(index < stateCount_);
|
|
||||||
return states_.template Bottom<State>()[index];
|
|
||||||
}
|
|
||||||
|
|
||||||
Range& GetRange(SizeType index) {
|
|
||||||
RAPIDJSON_ASSERT(index < rangeCount_);
|
|
||||||
return ranges_.template Bottom<Range>()[index];
|
|
||||||
}
|
|
||||||
|
|
||||||
const Range& GetRange(SizeType index) const {
|
|
||||||
RAPIDJSON_ASSERT(index < rangeCount_);
|
|
||||||
return ranges_.template Bottom<Range>()[index];
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
void Parse(DecodedStream<InputStream>& ds) {
|
|
||||||
Allocator allocator;
|
|
||||||
Stack<Allocator> operandStack(&allocator, 256); // Frag
|
|
||||||
Stack<Allocator> operatorStack(&allocator, 256); // Operator
|
|
||||||
Stack<Allocator> atomCountStack(&allocator, 256); // unsigned (Atom per parenthesis)
|
|
||||||
|
|
||||||
*atomCountStack.template Push<unsigned>() = 0;
|
|
||||||
|
|
||||||
unsigned codepoint;
|
|
||||||
while (ds.Peek() != 0) {
|
|
||||||
switch (codepoint = ds.Take()) {
|
|
||||||
case '^':
|
|
||||||
anchorBegin_ = true;
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '$':
|
|
||||||
anchorEnd_ = true;
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '|':
|
|
||||||
while (!operatorStack.Empty() && *operatorStack.template Top<Operator>() < kAlternation)
|
|
||||||
if (!Eval(operandStack, *operatorStack.template Pop<Operator>(1)))
|
|
||||||
return;
|
|
||||||
*operatorStack.template Push<Operator>() = kAlternation;
|
|
||||||
*atomCountStack.template Top<unsigned>() = 0;
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '(':
|
|
||||||
*operatorStack.template Push<Operator>() = kLeftParenthesis;
|
|
||||||
*atomCountStack.template Push<unsigned>() = 0;
|
|
||||||
break;
|
|
||||||
|
|
||||||
case ')':
|
|
||||||
while (!operatorStack.Empty() && *operatorStack.template Top<Operator>() != kLeftParenthesis)
|
|
||||||
if (!Eval(operandStack, *operatorStack.template Pop<Operator>(1)))
|
|
||||||
return;
|
|
||||||
if (operatorStack.Empty())
|
|
||||||
return;
|
|
||||||
operatorStack.template Pop<Operator>(1);
|
|
||||||
atomCountStack.template Pop<unsigned>(1);
|
|
||||||
ImplicitConcatenation(atomCountStack, operatorStack);
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '?':
|
|
||||||
if (!Eval(operandStack, kZeroOrOne))
|
|
||||||
return;
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '*':
|
|
||||||
if (!Eval(operandStack, kZeroOrMore))
|
|
||||||
return;
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '+':
|
|
||||||
if (!Eval(operandStack, kOneOrMore))
|
|
||||||
return;
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '{':
|
|
||||||
{
|
|
||||||
unsigned n, m;
|
|
||||||
if (!ParseUnsigned(ds, &n))
|
|
||||||
return;
|
|
||||||
|
|
||||||
if (ds.Peek() == ',') {
|
|
||||||
ds.Take();
|
|
||||||
if (ds.Peek() == '}')
|
|
||||||
m = kInfinityQuantifier;
|
|
||||||
else if (!ParseUnsigned(ds, &m) || m < n)
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
m = n;
|
|
||||||
|
|
||||||
if (!EvalQuantifier(operandStack, n, m) || ds.Peek() != '}')
|
|
||||||
return;
|
|
||||||
ds.Take();
|
|
||||||
}
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '.':
|
|
||||||
PushOperand(operandStack, kAnyCharacterClass);
|
|
||||||
ImplicitConcatenation(atomCountStack, operatorStack);
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '[':
|
|
||||||
{
|
|
||||||
SizeType range;
|
|
||||||
if (!ParseRange(ds, &range))
|
|
||||||
return;
|
|
||||||
SizeType s = NewState(kRegexInvalidState, kRegexInvalidState, kRangeCharacterClass);
|
|
||||||
GetState(s).rangeStart = range;
|
|
||||||
*operandStack.template Push<Frag>() = Frag(s, s, s);
|
|
||||||
}
|
|
||||||
ImplicitConcatenation(atomCountStack, operatorStack);
|
|
||||||
break;
|
|
||||||
|
|
||||||
case '\\': // Escape character
|
|
||||||
if (!CharacterEscape(ds, &codepoint))
|
|
||||||
return; // Unsupported escape character
|
|
||||||
// fall through to default
|
|
||||||
|
|
||||||
default: // Pattern character
|
|
||||||
PushOperand(operandStack, codepoint);
|
|
||||||
ImplicitConcatenation(atomCountStack, operatorStack);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
while (!operatorStack.Empty())
|
|
||||||
if (!Eval(operandStack, *operatorStack.template Pop<Operator>(1)))
|
|
||||||
return;
|
|
||||||
|
|
||||||
// Link the operand to matching state.
|
|
||||||
if (operandStack.GetSize() == sizeof(Frag)) {
|
|
||||||
Frag* e = operandStack.template Pop<Frag>(1);
|
|
||||||
Patch(e->out, NewState(kRegexInvalidState, kRegexInvalidState, 0));
|
|
||||||
root_ = e->start;
|
|
||||||
|
|
||||||
#if RAPIDJSON_REGEX_VERBOSE
|
|
||||||
printf("root: %d\n", root_);
|
|
||||||
for (SizeType i = 0; i < stateCount_ ; i++) {
|
|
||||||
State& s = GetState(i);
|
|
||||||
printf("[%2d] out: %2d out1: %2d c: '%c'\n", i, s.out, s.out1, (char)s.codepoint);
|
|
||||||
}
|
|
||||||
printf("\n");
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
||||||
// Preallocate buffer for SearchWithAnchoring()
|
|
||||||
RAPIDJSON_ASSERT(stateSet_ == 0);
|
|
||||||
if (stateCount_ > 0) {
|
|
||||||
stateSet_ = static_cast<unsigned*>(states_.GetAllocator().Malloc(GetStateSetSize()));
|
|
||||||
state0_.template Reserve<SizeType>(stateCount_);
|
|
||||||
state1_.template Reserve<SizeType>(stateCount_);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
SizeType NewState(SizeType out, SizeType out1, unsigned codepoint) {
|
|
||||||
State* s = states_.template Push<State>();
|
|
||||||
s->out = out;
|
|
||||||
s->out1 = out1;
|
|
||||||
s->codepoint = codepoint;
|
|
||||||
s->rangeStart = kRegexInvalidRange;
|
|
||||||
return stateCount_++;
|
|
||||||
}
|
|
||||||
|
|
||||||
void PushOperand(Stack<Allocator>& operandStack, unsigned codepoint) {
|
|
||||||
SizeType s = NewState(kRegexInvalidState, kRegexInvalidState, codepoint);
|
|
||||||
*operandStack.template Push<Frag>() = Frag(s, s, s);
|
|
||||||
}
|
|
||||||
|
|
||||||
void ImplicitConcatenation(Stack<Allocator>& atomCountStack, Stack<Allocator>& operatorStack) {
|
|
||||||
if (*atomCountStack.template Top<unsigned>())
|
|
||||||
*operatorStack.template Push<Operator>() = kConcatenation;
|
|
||||||
(*atomCountStack.template Top<unsigned>())++;
|
|
||||||
}
|
|
||||||
|
|
||||||
SizeType Append(SizeType l1, SizeType l2) {
|
|
||||||
SizeType old = l1;
|
|
||||||
while (GetState(l1).out != kRegexInvalidState)
|
|
||||||
l1 = GetState(l1).out;
|
|
||||||
GetState(l1).out = l2;
|
|
||||||
return old;
|
|
||||||
}
|
|
||||||
|
|
||||||
void Patch(SizeType l, SizeType s) {
|
|
||||||
for (SizeType next; l != kRegexInvalidState; l = next) {
|
|
||||||
next = GetState(l).out;
|
|
||||||
GetState(l).out = s;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
bool Eval(Stack<Allocator>& operandStack, Operator op) {
|
|
||||||
switch (op) {
|
|
||||||
case kConcatenation:
|
|
||||||
RAPIDJSON_ASSERT(operandStack.GetSize() >= sizeof(Frag) * 2);
|
|
||||||
{
|
|
||||||
Frag e2 = *operandStack.template Pop<Frag>(1);
|
|
||||||
Frag e1 = *operandStack.template Pop<Frag>(1);
|
|
||||||
Patch(e1.out, e2.start);
|
|
||||||
*operandStack.template Push<Frag>() = Frag(e1.start, e2.out, Min(e1.minIndex, e2.minIndex));
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
|
|
||||||
case kAlternation:
|
|
||||||
if (operandStack.GetSize() >= sizeof(Frag) * 2) {
|
|
||||||
Frag e2 = *operandStack.template Pop<Frag>(1);
|
|
||||||
Frag e1 = *operandStack.template Pop<Frag>(1);
|
|
||||||
SizeType s = NewState(e1.start, e2.start, 0);
|
|
||||||
*operandStack.template Push<Frag>() = Frag(s, Append(e1.out, e2.out), Min(e1.minIndex, e2.minIndex));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
|
|
||||||
case kZeroOrOne:
|
|
||||||
if (operandStack.GetSize() >= sizeof(Frag)) {
|
|
||||||
Frag e = *operandStack.template Pop<Frag>(1);
|
|
||||||
SizeType s = NewState(kRegexInvalidState, e.start, 0);
|
|
||||||
*operandStack.template Push<Frag>() = Frag(s, Append(e.out, s), e.minIndex);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
|
|
||||||
case kZeroOrMore:
|
|
||||||
if (operandStack.GetSize() >= sizeof(Frag)) {
|
|
||||||
Frag e = *operandStack.template Pop<Frag>(1);
|
|
||||||
SizeType s = NewState(kRegexInvalidState, e.start, 0);
|
|
||||||
Patch(e.out, s);
|
|
||||||
*operandStack.template Push<Frag>() = Frag(s, s, e.minIndex);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
|
|
||||||
default:
|
|
||||||
RAPIDJSON_ASSERT(op == kOneOrMore);
|
|
||||||
if (operandStack.GetSize() >= sizeof(Frag)) {
|
|
||||||
Frag e = *operandStack.template Pop<Frag>(1);
|
|
||||||
SizeType s = NewState(kRegexInvalidState, e.start, 0);
|
|
||||||
Patch(e.out, s);
|
|
||||||
*operandStack.template Push<Frag>() = Frag(e.start, s, e.minIndex);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
bool EvalQuantifier(Stack<Allocator>& operandStack, unsigned n, unsigned m) {
|
|
||||||
RAPIDJSON_ASSERT(n <= m);
|
|
||||||
RAPIDJSON_ASSERT(operandStack.GetSize() >= sizeof(Frag));
|
|
||||||
|
|
||||||
if (n == 0) {
|
|
||||||
if (m == 0) // a{0} not support
|
|
||||||
return false;
|
|
||||||
else if (m == kInfinityQuantifier)
|
|
||||||
Eval(operandStack, kZeroOrMore); // a{0,} -> a*
|
|
||||||
else {
|
|
||||||
Eval(operandStack, kZeroOrOne); // a{0,5} -> a?
|
|
||||||
for (unsigned i = 0; i < m - 1; i++)
|
|
||||||
CloneTopOperand(operandStack); // a{0,5} -> a? a? a? a? a?
|
|
||||||
for (unsigned i = 0; i < m - 1; i++)
|
|
||||||
Eval(operandStack, kConcatenation); // a{0,5} -> a?a?a?a?a?
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (unsigned i = 0; i < n - 1; i++) // a{3} -> a a a
|
|
||||||
CloneTopOperand(operandStack);
|
|
||||||
|
|
||||||
if (m == kInfinityQuantifier)
|
|
||||||
Eval(operandStack, kOneOrMore); // a{3,} -> a a a+
|
|
||||||
else if (m > n) {
|
|
||||||
CloneTopOperand(operandStack); // a{3,5} -> a a a a
|
|
||||||
Eval(operandStack, kZeroOrOne); // a{3,5} -> a a a a?
|
|
||||||
for (unsigned i = n; i < m - 1; i++)
|
|
||||||
CloneTopOperand(operandStack); // a{3,5} -> a a a a? a?
|
|
||||||
for (unsigned i = n; i < m; i++)
|
|
||||||
Eval(operandStack, kConcatenation); // a{3,5} -> a a aa?a?
|
|
||||||
}
|
|
||||||
|
|
||||||
for (unsigned i = 0; i < n - 1; i++)
|
|
||||||
Eval(operandStack, kConcatenation); // a{3} -> aaa, a{3,} -> aaa+, a{3.5} -> aaaa?a?
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
static SizeType Min(SizeType a, SizeType b) { return a < b ? a : b; }
|
|
||||||
|
|
||||||
void CloneTopOperand(Stack<Allocator>& operandStack) {
|
|
||||||
const Frag src = *operandStack.template Top<Frag>(); // Copy constructor to prevent invalidation
|
|
||||||
SizeType count = stateCount_ - src.minIndex; // Assumes top operand contains states in [src->minIndex, stateCount_)
|
|
||||||
State* s = states_.template Push<State>(count);
|
|
||||||
memcpy(s, &GetState(src.minIndex), count * sizeof(State));
|
|
||||||
for (SizeType j = 0; j < count; j++) {
|
|
||||||
if (s[j].out != kRegexInvalidState)
|
|
||||||
s[j].out += count;
|
|
||||||
if (s[j].out1 != kRegexInvalidState)
|
|
||||||
s[j].out1 += count;
|
|
||||||
}
|
|
||||||
*operandStack.template Push<Frag>() = Frag(src.start + count, src.out + count, src.minIndex + count);
|
|
||||||
stateCount_ += count;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
bool ParseUnsigned(DecodedStream<InputStream>& ds, unsigned* u) {
|
|
||||||
unsigned r = 0;
|
|
||||||
if (ds.Peek() < '0' || ds.Peek() > '9')
|
|
||||||
return false;
|
|
||||||
while (ds.Peek() >= '0' && ds.Peek() <= '9') {
|
|
||||||
if (r >= 429496729 && ds.Peek() > '5') // 2^32 - 1 = 4294967295
|
|
||||||
return false; // overflow
|
|
||||||
r = r * 10 + (ds.Take() - '0');
|
|
||||||
}
|
|
||||||
*u = r;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
bool ParseRange(DecodedStream<InputStream>& ds, SizeType* range) {
|
|
||||||
bool isBegin = true;
|
|
||||||
bool negate = false;
|
|
||||||
int step = 0;
|
|
||||||
SizeType start = kRegexInvalidRange;
|
|
||||||
SizeType current = kRegexInvalidRange;
|
|
||||||
unsigned codepoint;
|
|
||||||
while ((codepoint = ds.Take()) != 0) {
|
|
||||||
if (isBegin) {
|
|
||||||
isBegin = false;
|
|
||||||
if (codepoint == '^') {
|
|
||||||
negate = true;
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
switch (codepoint) {
|
|
||||||
case ']':
|
|
||||||
if (start == kRegexInvalidRange)
|
|
||||||
return false; // Error: nothing inside []
|
|
||||||
if (step == 2) { // Add trailing '-'
|
|
||||||
SizeType r = NewRange('-');
|
|
||||||
RAPIDJSON_ASSERT(current != kRegexInvalidRange);
|
|
||||||
GetRange(current).next = r;
|
|
||||||
}
|
|
||||||
if (negate)
|
|
||||||
GetRange(start).start |= kRangeNegationFlag;
|
|
||||||
*range = start;
|
|
||||||
return true;
|
|
||||||
|
|
||||||
case '\\':
|
|
||||||
if (ds.Peek() == 'b') {
|
|
||||||
ds.Take();
|
|
||||||
codepoint = 0x0008; // Escape backspace character
|
|
||||||
}
|
|
||||||
else if (!CharacterEscape(ds, &codepoint))
|
|
||||||
return false;
|
|
||||||
// fall through to default
|
|
||||||
|
|
||||||
default:
|
|
||||||
switch (step) {
|
|
||||||
case 1:
|
|
||||||
if (codepoint == '-') {
|
|
||||||
step++;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
// fall through to step 0 for other characters
|
|
||||||
|
|
||||||
case 0:
|
|
||||||
{
|
|
||||||
SizeType r = NewRange(codepoint);
|
|
||||||
if (current != kRegexInvalidRange)
|
|
||||||
GetRange(current).next = r;
|
|
||||||
if (start == kRegexInvalidRange)
|
|
||||||
start = r;
|
|
||||||
current = r;
|
|
||||||
}
|
|
||||||
step = 1;
|
|
||||||
break;
|
|
||||||
|
|
||||||
default:
|
|
||||||
RAPIDJSON_ASSERT(step == 2);
|
|
||||||
GetRange(current).end = codepoint;
|
|
||||||
step = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
SizeType NewRange(unsigned codepoint) {
|
|
||||||
Range* r = ranges_.template Push<Range>();
|
|
||||||
r->start = r->end = codepoint;
|
|
||||||
r->next = kRegexInvalidRange;
|
|
||||||
return rangeCount_++;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
bool CharacterEscape(DecodedStream<InputStream>& ds, unsigned* escapedCodepoint) {
|
|
||||||
unsigned codepoint;
|
|
||||||
switch (codepoint = ds.Take()) {
|
|
||||||
case '^':
|
|
||||||
case '$':
|
|
||||||
case '|':
|
|
||||||
case '(':
|
|
||||||
case ')':
|
|
||||||
case '?':
|
|
||||||
case '*':
|
|
||||||
case '+':
|
|
||||||
case '.':
|
|
||||||
case '[':
|
|
||||||
case ']':
|
|
||||||
case '{':
|
|
||||||
case '}':
|
|
||||||
case '\\':
|
|
||||||
*escapedCodepoint = codepoint; return true;
|
|
||||||
case 'f': *escapedCodepoint = 0x000C; return true;
|
|
||||||
case 'n': *escapedCodepoint = 0x000A; return true;
|
|
||||||
case 'r': *escapedCodepoint = 0x000D; return true;
|
|
||||||
case 't': *escapedCodepoint = 0x0009; return true;
|
|
||||||
case 'v': *escapedCodepoint = 0x000B; return true;
|
|
||||||
default:
|
|
||||||
return false; // Unsupported escape character
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename InputStream>
|
|
||||||
bool SearchWithAnchoring(InputStream& is, bool anchorBegin, bool anchorEnd) const {
|
|
||||||
RAPIDJSON_ASSERT(IsValid());
|
|
||||||
DecodedStream<InputStream> ds(is);
|
|
||||||
|
|
||||||
state0_.Clear();
|
|
||||||
Stack<Allocator> *current = &state0_, *next = &state1_;
|
|
||||||
const size_t stateSetSize = GetStateSetSize();
|
|
||||||
std::memset(stateSet_, 0, stateSetSize);
|
|
||||||
|
|
||||||
bool matched = AddState(*current, root_);
|
|
||||||
unsigned codepoint;
|
|
||||||
while (!current->Empty() && (codepoint = ds.Take()) != 0) {
|
|
||||||
std::memset(stateSet_, 0, stateSetSize);
|
|
||||||
next->Clear();
|
|
||||||
matched = false;
|
|
||||||
for (const SizeType* s = current->template Bottom<SizeType>(); s != current->template End<SizeType>(); ++s) {
|
|
||||||
const State& sr = GetState(*s);
|
|
||||||
if (sr.codepoint == codepoint ||
|
|
||||||
sr.codepoint == kAnyCharacterClass ||
|
|
||||||
(sr.codepoint == kRangeCharacterClass && MatchRange(sr.rangeStart, codepoint)))
|
|
||||||
{
|
|
||||||
matched = AddState(*next, sr.out) || matched;
|
|
||||||
if (!anchorEnd && matched)
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (!anchorBegin)
|
|
||||||
AddState(*next, root_);
|
|
||||||
}
|
|
||||||
internal::Swap(current, next);
|
|
||||||
}
|
|
||||||
|
|
||||||
return matched;
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t GetStateSetSize() const {
|
|
||||||
return (stateCount_ + 31) / 32 * 4;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Return whether the added states is a match state
|
|
||||||
bool AddState(Stack<Allocator>& l, SizeType index) const {
|
|
||||||
RAPIDJSON_ASSERT(index != kRegexInvalidState);
|
|
||||||
|
|
||||||
const State& s = GetState(index);
|
|
||||||
if (s.out1 != kRegexInvalidState) { // Split
|
|
||||||
bool matched = AddState(l, s.out);
|
|
||||||
return AddState(l, s.out1) || matched;
|
|
||||||
}
|
|
||||||
else if (!(stateSet_[index >> 5] & (1 << (index & 31)))) {
|
|
||||||
stateSet_[index >> 5] |= (1 << (index & 31));
|
|
||||||
*l.template PushUnsafe<SizeType>() = index;
|
|
||||||
}
|
|
||||||
return s.out == kRegexInvalidState; // by using PushUnsafe() above, we can ensure s is not validated due to reallocation.
|
|
||||||
}
|
|
||||||
|
|
||||||
bool MatchRange(SizeType rangeIndex, unsigned codepoint) const {
|
|
||||||
bool yes = (GetRange(rangeIndex).start & kRangeNegationFlag) == 0;
|
|
||||||
while (rangeIndex != kRegexInvalidRange) {
|
|
||||||
const Range& r = GetRange(rangeIndex);
|
|
||||||
if (codepoint >= (r.start & ~kRangeNegationFlag) && codepoint <= r.end)
|
|
||||||
return yes;
|
|
||||||
rangeIndex = r.next;
|
|
||||||
}
|
|
||||||
return !yes;
|
|
||||||
}
|
|
||||||
|
|
||||||
Stack<Allocator> states_;
|
|
||||||
Stack<Allocator> ranges_;
|
|
||||||
SizeType root_;
|
|
||||||
SizeType stateCount_;
|
|
||||||
SizeType rangeCount_;
|
|
||||||
|
|
||||||
static const unsigned kInfinityQuantifier = ~0u;
|
|
||||||
|
|
||||||
// For SearchWithAnchoring()
|
|
||||||
uint32_t* stateSet_; // allocated by states_.GetAllocator()
|
|
||||||
mutable Stack<Allocator> state0_;
|
|
||||||
mutable Stack<Allocator> state1_;
|
|
||||||
bool anchorBegin_;
|
|
||||||
bool anchorEnd_;
|
|
||||||
};
|
|
||||||
|
|
||||||
typedef GenericRegex<UTF8<> > Regex;
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_INTERNAL_REGEX_H_
|
|
||||||
@@ -1,230 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_INTERNAL_STACK_H_
|
|
||||||
#define RAPIDJSON_INTERNAL_STACK_H_
|
|
||||||
|
|
||||||
#include "../allocators.h"
|
|
||||||
#include "swap.h"
|
|
||||||
|
|
||||||
#if defined(__clang__)
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(c++98-compat)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// Stack
|
|
||||||
|
|
||||||
//! A type-unsafe stack for storing different types of data.
|
|
||||||
/*! \tparam Allocator Allocator for allocating stack memory.
|
|
||||||
*/
|
|
||||||
template <typename Allocator>
|
|
||||||
class Stack {
|
|
||||||
public:
|
|
||||||
// Optimization note: Do not allocate memory for stack_ in constructor.
|
|
||||||
// Do it lazily when first Push() -> Expand() -> Resize().
|
|
||||||
Stack(Allocator* allocator, size_t stackCapacity) : allocator_(allocator), ownAllocator_(0), stack_(0), stackTop_(0), stackEnd_(0), initialCapacity_(stackCapacity) {
|
|
||||||
}
|
|
||||||
|
|
||||||
#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
|
|
||||||
Stack(Stack&& rhs)
|
|
||||||
: allocator_(rhs.allocator_),
|
|
||||||
ownAllocator_(rhs.ownAllocator_),
|
|
||||||
stack_(rhs.stack_),
|
|
||||||
stackTop_(rhs.stackTop_),
|
|
||||||
stackEnd_(rhs.stackEnd_),
|
|
||||||
initialCapacity_(rhs.initialCapacity_)
|
|
||||||
{
|
|
||||||
rhs.allocator_ = 0;
|
|
||||||
rhs.ownAllocator_ = 0;
|
|
||||||
rhs.stack_ = 0;
|
|
||||||
rhs.stackTop_ = 0;
|
|
||||||
rhs.stackEnd_ = 0;
|
|
||||||
rhs.initialCapacity_ = 0;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
~Stack() {
|
|
||||||
Destroy();
|
|
||||||
}
|
|
||||||
|
|
||||||
#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
|
|
||||||
Stack& operator=(Stack&& rhs) {
|
|
||||||
if (&rhs != this)
|
|
||||||
{
|
|
||||||
Destroy();
|
|
||||||
|
|
||||||
allocator_ = rhs.allocator_;
|
|
||||||
ownAllocator_ = rhs.ownAllocator_;
|
|
||||||
stack_ = rhs.stack_;
|
|
||||||
stackTop_ = rhs.stackTop_;
|
|
||||||
stackEnd_ = rhs.stackEnd_;
|
|
||||||
initialCapacity_ = rhs.initialCapacity_;
|
|
||||||
|
|
||||||
rhs.allocator_ = 0;
|
|
||||||
rhs.ownAllocator_ = 0;
|
|
||||||
rhs.stack_ = 0;
|
|
||||||
rhs.stackTop_ = 0;
|
|
||||||
rhs.stackEnd_ = 0;
|
|
||||||
rhs.initialCapacity_ = 0;
|
|
||||||
}
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
void Swap(Stack& rhs) RAPIDJSON_NOEXCEPT {
|
|
||||||
internal::Swap(allocator_, rhs.allocator_);
|
|
||||||
internal::Swap(ownAllocator_, rhs.ownAllocator_);
|
|
||||||
internal::Swap(stack_, rhs.stack_);
|
|
||||||
internal::Swap(stackTop_, rhs.stackTop_);
|
|
||||||
internal::Swap(stackEnd_, rhs.stackEnd_);
|
|
||||||
internal::Swap(initialCapacity_, rhs.initialCapacity_);
|
|
||||||
}
|
|
||||||
|
|
||||||
void Clear() { stackTop_ = stack_; }
|
|
||||||
|
|
||||||
void ShrinkToFit() {
|
|
||||||
if (Empty()) {
|
|
||||||
// If the stack is empty, completely deallocate the memory.
|
|
||||||
Allocator::Free(stack_);
|
|
||||||
stack_ = 0;
|
|
||||||
stackTop_ = 0;
|
|
||||||
stackEnd_ = 0;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
Resize(GetSize());
|
|
||||||
}
|
|
||||||
|
|
||||||
// Optimization note: try to minimize the size of this function for force inline.
|
|
||||||
// Expansion is run very infrequently, so it is moved to another (probably non-inline) function.
|
|
||||||
template<typename T>
|
|
||||||
RAPIDJSON_FORCEINLINE void Reserve(size_t count = 1) {
|
|
||||||
// Expand the stack if needed
|
|
||||||
if (RAPIDJSON_UNLIKELY(stackTop_ + sizeof(T) * count > stackEnd_))
|
|
||||||
Expand<T>(count);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
RAPIDJSON_FORCEINLINE T* Push(size_t count = 1) {
|
|
||||||
Reserve<T>(count);
|
|
||||||
return PushUnsafe<T>(count);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
RAPIDJSON_FORCEINLINE T* PushUnsafe(size_t count = 1) {
|
|
||||||
RAPIDJSON_ASSERT(stackTop_ + sizeof(T) * count <= stackEnd_);
|
|
||||||
T* ret = reinterpret_cast<T*>(stackTop_);
|
|
||||||
stackTop_ += sizeof(T) * count;
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
T* Pop(size_t count) {
|
|
||||||
RAPIDJSON_ASSERT(GetSize() >= count * sizeof(T));
|
|
||||||
stackTop_ -= count * sizeof(T);
|
|
||||||
return reinterpret_cast<T*>(stackTop_);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
T* Top() {
|
|
||||||
RAPIDJSON_ASSERT(GetSize() >= sizeof(T));
|
|
||||||
return reinterpret_cast<T*>(stackTop_ - sizeof(T));
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
const T* Top() const {
|
|
||||||
RAPIDJSON_ASSERT(GetSize() >= sizeof(T));
|
|
||||||
return reinterpret_cast<T*>(stackTop_ - sizeof(T));
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
T* End() { return reinterpret_cast<T*>(stackTop_); }
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
const T* End() const { return reinterpret_cast<T*>(stackTop_); }
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
T* Bottom() { return reinterpret_cast<T*>(stack_); }
|
|
||||||
|
|
||||||
template<typename T>
|
|
||||||
const T* Bottom() const { return reinterpret_cast<T*>(stack_); }
|
|
||||||
|
|
||||||
bool HasAllocator() const {
|
|
||||||
return allocator_ != 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
Allocator& GetAllocator() {
|
|
||||||
RAPIDJSON_ASSERT(allocator_);
|
|
||||||
return *allocator_;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool Empty() const { return stackTop_ == stack_; }
|
|
||||||
size_t GetSize() const { return static_cast<size_t>(stackTop_ - stack_); }
|
|
||||||
size_t GetCapacity() const { return static_cast<size_t>(stackEnd_ - stack_); }
|
|
||||||
|
|
||||||
private:
|
|
||||||
template<typename T>
|
|
||||||
void Expand(size_t count) {
|
|
||||||
// Only expand the capacity if the current stack exists. Otherwise just create a stack with initial capacity.
|
|
||||||
size_t newCapacity;
|
|
||||||
if (stack_ == 0) {
|
|
||||||
if (!allocator_)
|
|
||||||
ownAllocator_ = allocator_ = RAPIDJSON_NEW(Allocator());
|
|
||||||
newCapacity = initialCapacity_;
|
|
||||||
} else {
|
|
||||||
newCapacity = GetCapacity();
|
|
||||||
newCapacity += (newCapacity + 1) / 2;
|
|
||||||
}
|
|
||||||
size_t newSize = GetSize() + sizeof(T) * count;
|
|
||||||
if (newCapacity < newSize)
|
|
||||||
newCapacity = newSize;
|
|
||||||
|
|
||||||
Resize(newCapacity);
|
|
||||||
}
|
|
||||||
|
|
||||||
void Resize(size_t newCapacity) {
|
|
||||||
const size_t size = GetSize(); // Backup the current size
|
|
||||||
stack_ = static_cast<char*>(allocator_->Realloc(stack_, GetCapacity(), newCapacity));
|
|
||||||
stackTop_ = stack_ + size;
|
|
||||||
stackEnd_ = stack_ + newCapacity;
|
|
||||||
}
|
|
||||||
|
|
||||||
void Destroy() {
|
|
||||||
Allocator::Free(stack_);
|
|
||||||
RAPIDJSON_DELETE(ownAllocator_); // Only delete if it is owned by the stack
|
|
||||||
}
|
|
||||||
|
|
||||||
// Prohibit copy constructor & assignment operator.
|
|
||||||
Stack(const Stack&);
|
|
||||||
Stack& operator=(const Stack&);
|
|
||||||
|
|
||||||
Allocator* allocator_;
|
|
||||||
Allocator* ownAllocator_;
|
|
||||||
char *stack_;
|
|
||||||
char *stackTop_;
|
|
||||||
char *stackEnd_;
|
|
||||||
size_t initialCapacity_;
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#if defined(__clang__)
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_STACK_H_
|
|
||||||
@@ -1,55 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_INTERNAL_STRFUNC_H_
|
|
||||||
#define RAPIDJSON_INTERNAL_STRFUNC_H_
|
|
||||||
|
|
||||||
#include "../stream.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
//! Custom strlen() which works on different character types.
|
|
||||||
/*! \tparam Ch Character type (e.g. char, wchar_t, short)
|
|
||||||
\param s Null-terminated input string.
|
|
||||||
\return Number of characters in the string.
|
|
||||||
\note This has the same semantics as strlen(), the return value is not number of Unicode codepoints.
|
|
||||||
*/
|
|
||||||
template <typename Ch>
|
|
||||||
inline SizeType StrLen(const Ch* s) {
|
|
||||||
const Ch* p = s;
|
|
||||||
while (*p) ++p;
|
|
||||||
return SizeType(p - s);
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Returns number of code points in a encoded string.
|
|
||||||
template<typename Encoding>
|
|
||||||
bool CountStringCodePoint(const typename Encoding::Ch* s, SizeType length, SizeType* outCount) {
|
|
||||||
GenericStringStream<Encoding> is(s);
|
|
||||||
const typename Encoding::Ch* end = s + length;
|
|
||||||
SizeType count = 0;
|
|
||||||
while (is.src_ < end) {
|
|
||||||
unsigned codepoint;
|
|
||||||
if (!Encoding::Decode(is, &codepoint))
|
|
||||||
return false;
|
|
||||||
count++;
|
|
||||||
}
|
|
||||||
*outCount = count;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_INTERNAL_STRFUNC_H_
|
|
||||||
@@ -1,269 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_STRTOD_
|
|
||||||
#define RAPIDJSON_STRTOD_
|
|
||||||
|
|
||||||
#include "ieee754.h"
|
|
||||||
#include "biginteger.h"
|
|
||||||
#include "diyfp.h"
|
|
||||||
#include "pow10.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
inline double FastPath(double significand, int exp) {
|
|
||||||
if (exp < -308)
|
|
||||||
return 0.0;
|
|
||||||
else if (exp >= 0)
|
|
||||||
return significand * internal::Pow10(exp);
|
|
||||||
else
|
|
||||||
return significand / internal::Pow10(-exp);
|
|
||||||
}
|
|
||||||
|
|
||||||
inline double StrtodNormalPrecision(double d, int p) {
|
|
||||||
if (p < -308) {
|
|
||||||
// Prevent expSum < -308, making Pow10(p) = 0
|
|
||||||
d = FastPath(d, -308);
|
|
||||||
d = FastPath(d, p + 308);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
d = FastPath(d, p);
|
|
||||||
return d;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
inline T Min3(T a, T b, T c) {
|
|
||||||
T m = a;
|
|
||||||
if (m > b) m = b;
|
|
||||||
if (m > c) m = c;
|
|
||||||
return m;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline int CheckWithinHalfULP(double b, const BigInteger& d, int dExp) {
|
|
||||||
const Double db(b);
|
|
||||||
const uint64_t bInt = db.IntegerSignificand();
|
|
||||||
const int bExp = db.IntegerExponent();
|
|
||||||
const int hExp = bExp - 1;
|
|
||||||
|
|
||||||
int dS_Exp2 = 0, dS_Exp5 = 0, bS_Exp2 = 0, bS_Exp5 = 0, hS_Exp2 = 0, hS_Exp5 = 0;
|
|
||||||
|
|
||||||
// Adjust for decimal exponent
|
|
||||||
if (dExp >= 0) {
|
|
||||||
dS_Exp2 += dExp;
|
|
||||||
dS_Exp5 += dExp;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
bS_Exp2 -= dExp;
|
|
||||||
bS_Exp5 -= dExp;
|
|
||||||
hS_Exp2 -= dExp;
|
|
||||||
hS_Exp5 -= dExp;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Adjust for binary exponent
|
|
||||||
if (bExp >= 0)
|
|
||||||
bS_Exp2 += bExp;
|
|
||||||
else {
|
|
||||||
dS_Exp2 -= bExp;
|
|
||||||
hS_Exp2 -= bExp;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Adjust for half ulp exponent
|
|
||||||
if (hExp >= 0)
|
|
||||||
hS_Exp2 += hExp;
|
|
||||||
else {
|
|
||||||
dS_Exp2 -= hExp;
|
|
||||||
bS_Exp2 -= hExp;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Remove common power of two factor from all three scaled values
|
|
||||||
int common_Exp2 = Min3(dS_Exp2, bS_Exp2, hS_Exp2);
|
|
||||||
dS_Exp2 -= common_Exp2;
|
|
||||||
bS_Exp2 -= common_Exp2;
|
|
||||||
hS_Exp2 -= common_Exp2;
|
|
||||||
|
|
||||||
BigInteger dS = d;
|
|
||||||
dS.MultiplyPow5(static_cast<unsigned>(dS_Exp5)) <<= static_cast<unsigned>(dS_Exp2);
|
|
||||||
|
|
||||||
BigInteger bS(bInt);
|
|
||||||
bS.MultiplyPow5(static_cast<unsigned>(bS_Exp5)) <<= static_cast<unsigned>(bS_Exp2);
|
|
||||||
|
|
||||||
BigInteger hS(1);
|
|
||||||
hS.MultiplyPow5(static_cast<unsigned>(hS_Exp5)) <<= static_cast<unsigned>(hS_Exp2);
|
|
||||||
|
|
||||||
BigInteger delta(0);
|
|
||||||
dS.Difference(bS, &delta);
|
|
||||||
|
|
||||||
return delta.Compare(hS);
|
|
||||||
}
|
|
||||||
|
|
||||||
inline bool StrtodFast(double d, int p, double* result) {
|
|
||||||
// Use fast path for string-to-double conversion if possible
|
|
||||||
// see http://www.exploringbinary.com/fast-path-decimal-to-floating-point-conversion/
|
|
||||||
if (p > 22 && p < 22 + 16) {
|
|
||||||
// Fast Path Cases In Disguise
|
|
||||||
d *= internal::Pow10(p - 22);
|
|
||||||
p = 22;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (p >= -22 && p <= 22 && d <= 9007199254740991.0) { // 2^53 - 1
|
|
||||||
*result = FastPath(d, p);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Compute an approximation and see if it is within 1/2 ULP
|
|
||||||
inline bool StrtodDiyFp(const char* decimals, size_t length, size_t decimalPosition, int exp, double* result) {
|
|
||||||
uint64_t significand = 0;
|
|
||||||
size_t i = 0; // 2^64 - 1 = 18446744073709551615, 1844674407370955161 = 0x1999999999999999
|
|
||||||
for (; i < length; i++) {
|
|
||||||
if (significand > RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) ||
|
|
||||||
(significand == RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) && decimals[i] > '5'))
|
|
||||||
break;
|
|
||||||
significand = significand * 10u + static_cast<unsigned>(decimals[i] - '0');
|
|
||||||
}
|
|
||||||
|
|
||||||
if (i < length && decimals[i] >= '5') // Rounding
|
|
||||||
significand++;
|
|
||||||
|
|
||||||
size_t remaining = length - i;
|
|
||||||
const unsigned kUlpShift = 3;
|
|
||||||
const unsigned kUlp = 1 << kUlpShift;
|
|
||||||
int64_t error = (remaining == 0) ? 0 : kUlp / 2;
|
|
||||||
|
|
||||||
DiyFp v(significand, 0);
|
|
||||||
v = v.Normalize();
|
|
||||||
error <<= -v.e;
|
|
||||||
|
|
||||||
const int dExp = static_cast<int>(decimalPosition) - static_cast<int>(i) + exp;
|
|
||||||
|
|
||||||
int actualExp;
|
|
||||||
DiyFp cachedPower = GetCachedPower10(dExp, &actualExp);
|
|
||||||
if (actualExp != dExp) {
|
|
||||||
static const DiyFp kPow10[] = {
|
|
||||||
DiyFp(RAPIDJSON_UINT64_C2(0xa0000000, 00000000), -60), // 10^1
|
|
||||||
DiyFp(RAPIDJSON_UINT64_C2(0xc8000000, 00000000), -57), // 10^2
|
|
||||||
DiyFp(RAPIDJSON_UINT64_C2(0xfa000000, 00000000), -54), // 10^3
|
|
||||||
DiyFp(RAPIDJSON_UINT64_C2(0x9c400000, 00000000), -50), // 10^4
|
|
||||||
DiyFp(RAPIDJSON_UINT64_C2(0xc3500000, 00000000), -47), // 10^5
|
|
||||||
DiyFp(RAPIDJSON_UINT64_C2(0xf4240000, 00000000), -44), // 10^6
|
|
||||||
DiyFp(RAPIDJSON_UINT64_C2(0x98968000, 00000000), -40) // 10^7
|
|
||||||
};
|
|
||||||
int adjustment = dExp - actualExp - 1;
|
|
||||||
RAPIDJSON_ASSERT(adjustment >= 0 && adjustment < 7);
|
|
||||||
v = v * kPow10[adjustment];
|
|
||||||
if (length + static_cast<unsigned>(adjustment)> 19u) // has more digits than decimal digits in 64-bit
|
|
||||||
error += kUlp / 2;
|
|
||||||
}
|
|
||||||
|
|
||||||
v = v * cachedPower;
|
|
||||||
|
|
||||||
error += kUlp + (error == 0 ? 0 : 1);
|
|
||||||
|
|
||||||
const int oldExp = v.e;
|
|
||||||
v = v.Normalize();
|
|
||||||
error <<= oldExp - v.e;
|
|
||||||
|
|
||||||
const unsigned effectiveSignificandSize = Double::EffectiveSignificandSize(64 + v.e);
|
|
||||||
unsigned precisionSize = 64 - effectiveSignificandSize;
|
|
||||||
if (precisionSize + kUlpShift >= 64) {
|
|
||||||
unsigned scaleExp = (precisionSize + kUlpShift) - 63;
|
|
||||||
v.f >>= scaleExp;
|
|
||||||
v.e += scaleExp;
|
|
||||||
error = (error >> scaleExp) + 1 + static_cast<int>(kUlp);
|
|
||||||
precisionSize -= scaleExp;
|
|
||||||
}
|
|
||||||
|
|
||||||
DiyFp rounded(v.f >> precisionSize, v.e + static_cast<int>(precisionSize));
|
|
||||||
const uint64_t precisionBits = (v.f & ((uint64_t(1) << precisionSize) - 1)) * kUlp;
|
|
||||||
const uint64_t halfWay = (uint64_t(1) << (precisionSize - 1)) * kUlp;
|
|
||||||
if (precisionBits >= halfWay + static_cast<unsigned>(error)) {
|
|
||||||
rounded.f++;
|
|
||||||
if (rounded.f & (DiyFp::kDpHiddenBit << 1)) { // rounding overflows mantissa (issue #340)
|
|
||||||
rounded.f >>= 1;
|
|
||||||
rounded.e++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
*result = rounded.ToDouble();
|
|
||||||
|
|
||||||
return halfWay - static_cast<unsigned>(error) >= precisionBits || precisionBits >= halfWay + static_cast<unsigned>(error);
|
|
||||||
}
|
|
||||||
|
|
||||||
inline double StrtodBigInteger(double approx, const char* decimals, size_t length, size_t decimalPosition, int exp) {
|
|
||||||
const BigInteger dInt(decimals, length);
|
|
||||||
const int dExp = static_cast<int>(decimalPosition) - static_cast<int>(length) + exp;
|
|
||||||
Double a(approx);
|
|
||||||
int cmp = CheckWithinHalfULP(a.Value(), dInt, dExp);
|
|
||||||
if (cmp < 0)
|
|
||||||
return a.Value(); // within half ULP
|
|
||||||
else if (cmp == 0) {
|
|
||||||
// Round towards even
|
|
||||||
if (a.Significand() & 1)
|
|
||||||
return a.NextPositiveDouble();
|
|
||||||
else
|
|
||||||
return a.Value();
|
|
||||||
}
|
|
||||||
else // adjustment
|
|
||||||
return a.NextPositiveDouble();
|
|
||||||
}
|
|
||||||
|
|
||||||
inline double StrtodFullPrecision(double d, int p, const char* decimals, size_t length, size_t decimalPosition, int exp) {
|
|
||||||
RAPIDJSON_ASSERT(d >= 0.0);
|
|
||||||
RAPIDJSON_ASSERT(length >= 1);
|
|
||||||
|
|
||||||
double result;
|
|
||||||
if (StrtodFast(d, p, &result))
|
|
||||||
return result;
|
|
||||||
|
|
||||||
// Trim leading zeros
|
|
||||||
while (*decimals == '0' && length > 1) {
|
|
||||||
length--;
|
|
||||||
decimals++;
|
|
||||||
decimalPosition--;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Trim trailing zeros
|
|
||||||
while (decimals[length - 1] == '0' && length > 1) {
|
|
||||||
length--;
|
|
||||||
decimalPosition--;
|
|
||||||
exp++;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Trim right-most digits
|
|
||||||
const int kMaxDecimalDigit = 780;
|
|
||||||
if (static_cast<int>(length) > kMaxDecimalDigit) {
|
|
||||||
int delta = (static_cast<int>(length) - kMaxDecimalDigit);
|
|
||||||
exp += delta;
|
|
||||||
decimalPosition -= static_cast<unsigned>(delta);
|
|
||||||
length = kMaxDecimalDigit;
|
|
||||||
}
|
|
||||||
|
|
||||||
// If too small, underflow to zero
|
|
||||||
if (int(length) + exp < -324)
|
|
||||||
return 0.0;
|
|
||||||
|
|
||||||
if (StrtodDiyFp(decimals, length, decimalPosition, exp, &result))
|
|
||||||
return result;
|
|
||||||
|
|
||||||
// Use approximation from StrtodDiyFp and make adjustment with BigInteger comparison
|
|
||||||
return StrtodBigInteger(result, decimals, length, decimalPosition, exp);
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_STRTOD_
|
|
||||||
@@ -1,46 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_INTERNAL_SWAP_H_
|
|
||||||
#define RAPIDJSON_INTERNAL_SWAP_H_
|
|
||||||
|
|
||||||
#include "../rapidjson.h"
|
|
||||||
|
|
||||||
#if defined(__clang__)
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(c++98-compat)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
namespace internal {
|
|
||||||
|
|
||||||
//! Custom swap() to avoid dependency on C++ <algorithm> header
|
|
||||||
/*! \tparam T Type of the arguments to swap, should be instantiated with primitive C++ types only.
|
|
||||||
\note This has the same semantics as std::swap().
|
|
||||||
*/
|
|
||||||
template <typename T>
|
|
||||||
inline void Swap(T& a, T& b) RAPIDJSON_NOEXCEPT {
|
|
||||||
T tmp = a;
|
|
||||||
a = b;
|
|
||||||
b = tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace internal
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#if defined(__clang__)
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_INTERNAL_SWAP_H_
|
|
||||||
@@ -1,115 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_ISTREAMWRAPPER_H_
|
|
||||||
#define RAPIDJSON_ISTREAMWRAPPER_H_
|
|
||||||
|
|
||||||
#include "stream.h"
|
|
||||||
#include <iosfwd>
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(padded)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(4351) // new behavior: elements of array 'array' will be default initialized
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Wrapper of \c std::basic_istream into RapidJSON's Stream concept.
|
|
||||||
/*!
|
|
||||||
The classes can be wrapped including but not limited to:
|
|
||||||
|
|
||||||
- \c std::istringstream
|
|
||||||
- \c std::stringstream
|
|
||||||
- \c std::wistringstream
|
|
||||||
- \c std::wstringstream
|
|
||||||
- \c std::ifstream
|
|
||||||
- \c std::fstream
|
|
||||||
- \c std::wifstream
|
|
||||||
- \c std::wfstream
|
|
||||||
|
|
||||||
\tparam StreamType Class derived from \c std::basic_istream.
|
|
||||||
*/
|
|
||||||
|
|
||||||
template <typename StreamType>
|
|
||||||
class BasicIStreamWrapper {
|
|
||||||
public:
|
|
||||||
typedef typename StreamType::char_type Ch;
|
|
||||||
BasicIStreamWrapper(StreamType& stream) : stream_(stream), count_(), peekBuffer_() {}
|
|
||||||
|
|
||||||
Ch Peek() const {
|
|
||||||
typename StreamType::int_type c = stream_.peek();
|
|
||||||
return RAPIDJSON_LIKELY(c != StreamType::traits_type::eof()) ? static_cast<Ch>(c) : '\0';
|
|
||||||
}
|
|
||||||
|
|
||||||
Ch Take() {
|
|
||||||
typename StreamType::int_type c = stream_.get();
|
|
||||||
if (RAPIDJSON_LIKELY(c != StreamType::traits_type::eof())) {
|
|
||||||
count_++;
|
|
||||||
return static_cast<Ch>(c);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
return '\0';
|
|
||||||
}
|
|
||||||
|
|
||||||
// tellg() may return -1 when failed. So we count by ourself.
|
|
||||||
size_t Tell() const { return count_; }
|
|
||||||
|
|
||||||
Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
void Put(Ch) { RAPIDJSON_ASSERT(false); }
|
|
||||||
void Flush() { RAPIDJSON_ASSERT(false); }
|
|
||||||
size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
// For encoding detection only.
|
|
||||||
const Ch* Peek4() const {
|
|
||||||
RAPIDJSON_ASSERT(sizeof(Ch) == 1); // Only usable for byte stream.
|
|
||||||
int i;
|
|
||||||
bool hasError = false;
|
|
||||||
for (i = 0; i < 4; ++i) {
|
|
||||||
typename StreamType::int_type c = stream_.get();
|
|
||||||
if (c == StreamType::traits_type::eof()) {
|
|
||||||
hasError = true;
|
|
||||||
stream_.clear();
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
peekBuffer_[i] = static_cast<Ch>(c);
|
|
||||||
}
|
|
||||||
for (--i; i >= 0; --i)
|
|
||||||
stream_.putback(peekBuffer_[i]);
|
|
||||||
return !hasError ? peekBuffer_ : 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
private:
|
|
||||||
BasicIStreamWrapper(const BasicIStreamWrapper&);
|
|
||||||
BasicIStreamWrapper& operator=(const BasicIStreamWrapper&);
|
|
||||||
|
|
||||||
StreamType& stream_;
|
|
||||||
size_t count_; //!< Number of characters read. Note:
|
|
||||||
mutable Ch peekBuffer_[4];
|
|
||||||
};
|
|
||||||
|
|
||||||
typedef BasicIStreamWrapper<std::istream> IStreamWrapper;
|
|
||||||
typedef BasicIStreamWrapper<std::wistream> WIStreamWrapper;
|
|
||||||
|
|
||||||
#if defined(__clang__) || defined(_MSC_VER)
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_ISTREAMWRAPPER_H_
|
|
||||||
@@ -1,70 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_MEMORYBUFFER_H_
|
|
||||||
#define RAPIDJSON_MEMORYBUFFER_H_
|
|
||||||
|
|
||||||
#include "stream.h"
|
|
||||||
#include "internal/stack.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Represents an in-memory output byte stream.
|
|
||||||
/*!
|
|
||||||
This class is mainly for being wrapped by EncodedOutputStream or AutoUTFOutputStream.
|
|
||||||
|
|
||||||
It is similar to FileWriteBuffer but the destination is an in-memory buffer instead of a file.
|
|
||||||
|
|
||||||
Differences between MemoryBuffer and StringBuffer:
|
|
||||||
1. StringBuffer has Encoding but MemoryBuffer is only a byte buffer.
|
|
||||||
2. StringBuffer::GetString() returns a null-terminated string. MemoryBuffer::GetBuffer() returns a buffer without terminator.
|
|
||||||
|
|
||||||
\tparam Allocator type for allocating memory buffer.
|
|
||||||
\note implements Stream concept
|
|
||||||
*/
|
|
||||||
template <typename Allocator = CrtAllocator>
|
|
||||||
struct GenericMemoryBuffer {
|
|
||||||
typedef char Ch; // byte
|
|
||||||
|
|
||||||
GenericMemoryBuffer(Allocator* allocator = 0, size_t capacity = kDefaultCapacity) : stack_(allocator, capacity) {}
|
|
||||||
|
|
||||||
void Put(Ch c) { *stack_.template Push<Ch>() = c; }
|
|
||||||
void Flush() {}
|
|
||||||
|
|
||||||
void Clear() { stack_.Clear(); }
|
|
||||||
void ShrinkToFit() { stack_.ShrinkToFit(); }
|
|
||||||
Ch* Push(size_t count) { return stack_.template Push<Ch>(count); }
|
|
||||||
void Pop(size_t count) { stack_.template Pop<Ch>(count); }
|
|
||||||
|
|
||||||
const Ch* GetBuffer() const {
|
|
||||||
return stack_.template Bottom<Ch>();
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t GetSize() const { return stack_.GetSize(); }
|
|
||||||
|
|
||||||
static const size_t kDefaultCapacity = 256;
|
|
||||||
mutable internal::Stack<Allocator> stack_;
|
|
||||||
};
|
|
||||||
|
|
||||||
typedef GenericMemoryBuffer<> MemoryBuffer;
|
|
||||||
|
|
||||||
//! Implement specialized version of PutN() with memset() for better performance.
|
|
||||||
template<>
|
|
||||||
inline void PutN(MemoryBuffer& memoryBuffer, char c, size_t n) {
|
|
||||||
std::memset(memoryBuffer.stack_.Push<char>(n), c, n * sizeof(c));
|
|
||||||
}
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_MEMORYBUFFER_H_
|
|
||||||
@@ -1,71 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_MEMORYSTREAM_H_
|
|
||||||
#define RAPIDJSON_MEMORYSTREAM_H_
|
|
||||||
|
|
||||||
#include "stream.h"
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(unreachable-code)
|
|
||||||
RAPIDJSON_DIAG_OFF(missing-noreturn)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Represents an in-memory input byte stream.
|
|
||||||
/*!
|
|
||||||
This class is mainly for being wrapped by EncodedInputStream or AutoUTFInputStream.
|
|
||||||
|
|
||||||
It is similar to FileReadBuffer but the source is an in-memory buffer instead of a file.
|
|
||||||
|
|
||||||
Differences between MemoryStream and StringStream:
|
|
||||||
1. StringStream has encoding but MemoryStream is a byte stream.
|
|
||||||
2. MemoryStream needs size of the source buffer and the buffer don't need to be null terminated. StringStream assume null-terminated string as source.
|
|
||||||
3. MemoryStream supports Peek4() for encoding detection. StringStream is specified with an encoding so it should not have Peek4().
|
|
||||||
\note implements Stream concept
|
|
||||||
*/
|
|
||||||
struct MemoryStream {
|
|
||||||
typedef char Ch; // byte
|
|
||||||
|
|
||||||
MemoryStream(const Ch *src, size_t size) : src_(src), begin_(src), end_(src + size), size_(size) {}
|
|
||||||
|
|
||||||
Ch Peek() const { return RAPIDJSON_UNLIKELY(src_ == end_) ? '\0' : *src_; }
|
|
||||||
Ch Take() { return RAPIDJSON_UNLIKELY(src_ == end_) ? '\0' : *src_++; }
|
|
||||||
size_t Tell() const { return static_cast<size_t>(src_ - begin_); }
|
|
||||||
|
|
||||||
Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
void Put(Ch) { RAPIDJSON_ASSERT(false); }
|
|
||||||
void Flush() { RAPIDJSON_ASSERT(false); }
|
|
||||||
size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
// For encoding detection only.
|
|
||||||
const Ch* Peek4() const {
|
|
||||||
return Tell() + 4 <= size_ ? src_ : 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
const Ch* src_; //!< Current read position.
|
|
||||||
const Ch* begin_; //!< Original head of the string.
|
|
||||||
const Ch* end_; //!< End of stream.
|
|
||||||
size_t size_; //!< Size of the stream.
|
|
||||||
};
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_MEMORYBUFFER_H_
|
|
||||||
@@ -1,316 +0,0 @@
|
|||||||
// ISO C9x compliant inttypes.h for Microsoft Visual Studio
|
|
||||||
// Based on ISO/IEC 9899:TC2 Committee draft (May 6, 2005) WG14/N1124
|
|
||||||
//
|
|
||||||
// Copyright (c) 2006-2013 Alexander Chemeris
|
|
||||||
//
|
|
||||||
// Redistribution and use in source and binary forms, with or without
|
|
||||||
// modification, are permitted provided that the following conditions are met:
|
|
||||||
//
|
|
||||||
// 1. Redistributions of source code must retain the above copyright notice,
|
|
||||||
// this list of conditions and the following disclaimer.
|
|
||||||
//
|
|
||||||
// 2. Redistributions in binary form must reproduce the above copyright
|
|
||||||
// notice, this list of conditions and the following disclaimer in the
|
|
||||||
// documentation and/or other materials provided with the distribution.
|
|
||||||
//
|
|
||||||
// 3. Neither the name of the product nor the names of its contributors may
|
|
||||||
// be used to endorse or promote products derived from this software
|
|
||||||
// without specific prior written permission.
|
|
||||||
//
|
|
||||||
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
|
||||||
// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
||||||
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
|
|
||||||
// EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
||||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
||||||
// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
||||||
// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
||||||
// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
||||||
// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
//
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
// The above software in this distribution may have been modified by
|
|
||||||
// THL A29 Limited ("Tencent Modifications").
|
|
||||||
// All Tencent Modifications are Copyright (C) 2015 THL A29 Limited.
|
|
||||||
|
|
||||||
#ifndef _MSC_VER // [
|
|
||||||
#error "Use this header only with Microsoft Visual C++ compilers!"
|
|
||||||
#endif // _MSC_VER ]
|
|
||||||
|
|
||||||
#ifndef _MSC_INTTYPES_H_ // [
|
|
||||||
#define _MSC_INTTYPES_H_
|
|
||||||
|
|
||||||
#if _MSC_VER > 1000
|
|
||||||
#pragma once
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include "stdint.h"
|
|
||||||
|
|
||||||
// miloyip: VC supports inttypes.h since VC2013
|
|
||||||
#if _MSC_VER >= 1800
|
|
||||||
#include <inttypes.h>
|
|
||||||
#else
|
|
||||||
|
|
||||||
// 7.8 Format conversion of integer types
|
|
||||||
|
|
||||||
typedef struct {
|
|
||||||
intmax_t quot;
|
|
||||||
intmax_t rem;
|
|
||||||
} imaxdiv_t;
|
|
||||||
|
|
||||||
// 7.8.1 Macros for format specifiers
|
|
||||||
|
|
||||||
#if !defined(__cplusplus) || defined(__STDC_FORMAT_MACROS) // [ See footnote 185 at page 198
|
|
||||||
|
|
||||||
// The fprintf macros for signed integers are:
|
|
||||||
#define PRId8 "d"
|
|
||||||
#define PRIi8 "i"
|
|
||||||
#define PRIdLEAST8 "d"
|
|
||||||
#define PRIiLEAST8 "i"
|
|
||||||
#define PRIdFAST8 "d"
|
|
||||||
#define PRIiFAST8 "i"
|
|
||||||
|
|
||||||
#define PRId16 "hd"
|
|
||||||
#define PRIi16 "hi"
|
|
||||||
#define PRIdLEAST16 "hd"
|
|
||||||
#define PRIiLEAST16 "hi"
|
|
||||||
#define PRIdFAST16 "hd"
|
|
||||||
#define PRIiFAST16 "hi"
|
|
||||||
|
|
||||||
#define PRId32 "I32d"
|
|
||||||
#define PRIi32 "I32i"
|
|
||||||
#define PRIdLEAST32 "I32d"
|
|
||||||
#define PRIiLEAST32 "I32i"
|
|
||||||
#define PRIdFAST32 "I32d"
|
|
||||||
#define PRIiFAST32 "I32i"
|
|
||||||
|
|
||||||
#define PRId64 "I64d"
|
|
||||||
#define PRIi64 "I64i"
|
|
||||||
#define PRIdLEAST64 "I64d"
|
|
||||||
#define PRIiLEAST64 "I64i"
|
|
||||||
#define PRIdFAST64 "I64d"
|
|
||||||
#define PRIiFAST64 "I64i"
|
|
||||||
|
|
||||||
#define PRIdMAX "I64d"
|
|
||||||
#define PRIiMAX "I64i"
|
|
||||||
|
|
||||||
#define PRIdPTR "Id"
|
|
||||||
#define PRIiPTR "Ii"
|
|
||||||
|
|
||||||
// The fprintf macros for unsigned integers are:
|
|
||||||
#define PRIo8 "o"
|
|
||||||
#define PRIu8 "u"
|
|
||||||
#define PRIx8 "x"
|
|
||||||
#define PRIX8 "X"
|
|
||||||
#define PRIoLEAST8 "o"
|
|
||||||
#define PRIuLEAST8 "u"
|
|
||||||
#define PRIxLEAST8 "x"
|
|
||||||
#define PRIXLEAST8 "X"
|
|
||||||
#define PRIoFAST8 "o"
|
|
||||||
#define PRIuFAST8 "u"
|
|
||||||
#define PRIxFAST8 "x"
|
|
||||||
#define PRIXFAST8 "X"
|
|
||||||
|
|
||||||
#define PRIo16 "ho"
|
|
||||||
#define PRIu16 "hu"
|
|
||||||
#define PRIx16 "hx"
|
|
||||||
#define PRIX16 "hX"
|
|
||||||
#define PRIoLEAST16 "ho"
|
|
||||||
#define PRIuLEAST16 "hu"
|
|
||||||
#define PRIxLEAST16 "hx"
|
|
||||||
#define PRIXLEAST16 "hX"
|
|
||||||
#define PRIoFAST16 "ho"
|
|
||||||
#define PRIuFAST16 "hu"
|
|
||||||
#define PRIxFAST16 "hx"
|
|
||||||
#define PRIXFAST16 "hX"
|
|
||||||
|
|
||||||
#define PRIo32 "I32o"
|
|
||||||
#define PRIu32 "I32u"
|
|
||||||
#define PRIx32 "I32x"
|
|
||||||
#define PRIX32 "I32X"
|
|
||||||
#define PRIoLEAST32 "I32o"
|
|
||||||
#define PRIuLEAST32 "I32u"
|
|
||||||
#define PRIxLEAST32 "I32x"
|
|
||||||
#define PRIXLEAST32 "I32X"
|
|
||||||
#define PRIoFAST32 "I32o"
|
|
||||||
#define PRIuFAST32 "I32u"
|
|
||||||
#define PRIxFAST32 "I32x"
|
|
||||||
#define PRIXFAST32 "I32X"
|
|
||||||
|
|
||||||
#define PRIo64 "I64o"
|
|
||||||
#define PRIu64 "I64u"
|
|
||||||
#define PRIx64 "I64x"
|
|
||||||
#define PRIX64 "I64X"
|
|
||||||
#define PRIoLEAST64 "I64o"
|
|
||||||
#define PRIuLEAST64 "I64u"
|
|
||||||
#define PRIxLEAST64 "I64x"
|
|
||||||
#define PRIXLEAST64 "I64X"
|
|
||||||
#define PRIoFAST64 "I64o"
|
|
||||||
#define PRIuFAST64 "I64u"
|
|
||||||
#define PRIxFAST64 "I64x"
|
|
||||||
#define PRIXFAST64 "I64X"
|
|
||||||
|
|
||||||
#define PRIoMAX "I64o"
|
|
||||||
#define PRIuMAX "I64u"
|
|
||||||
#define PRIxMAX "I64x"
|
|
||||||
#define PRIXMAX "I64X"
|
|
||||||
|
|
||||||
#define PRIoPTR "Io"
|
|
||||||
#define PRIuPTR "Iu"
|
|
||||||
#define PRIxPTR "Ix"
|
|
||||||
#define PRIXPTR "IX"
|
|
||||||
|
|
||||||
// The fscanf macros for signed integers are:
|
|
||||||
#define SCNd8 "d"
|
|
||||||
#define SCNi8 "i"
|
|
||||||
#define SCNdLEAST8 "d"
|
|
||||||
#define SCNiLEAST8 "i"
|
|
||||||
#define SCNdFAST8 "d"
|
|
||||||
#define SCNiFAST8 "i"
|
|
||||||
|
|
||||||
#define SCNd16 "hd"
|
|
||||||
#define SCNi16 "hi"
|
|
||||||
#define SCNdLEAST16 "hd"
|
|
||||||
#define SCNiLEAST16 "hi"
|
|
||||||
#define SCNdFAST16 "hd"
|
|
||||||
#define SCNiFAST16 "hi"
|
|
||||||
|
|
||||||
#define SCNd32 "ld"
|
|
||||||
#define SCNi32 "li"
|
|
||||||
#define SCNdLEAST32 "ld"
|
|
||||||
#define SCNiLEAST32 "li"
|
|
||||||
#define SCNdFAST32 "ld"
|
|
||||||
#define SCNiFAST32 "li"
|
|
||||||
|
|
||||||
#define SCNd64 "I64d"
|
|
||||||
#define SCNi64 "I64i"
|
|
||||||
#define SCNdLEAST64 "I64d"
|
|
||||||
#define SCNiLEAST64 "I64i"
|
|
||||||
#define SCNdFAST64 "I64d"
|
|
||||||
#define SCNiFAST64 "I64i"
|
|
||||||
|
|
||||||
#define SCNdMAX "I64d"
|
|
||||||
#define SCNiMAX "I64i"
|
|
||||||
|
|
||||||
#ifdef _WIN64 // [
|
|
||||||
# define SCNdPTR "I64d"
|
|
||||||
# define SCNiPTR "I64i"
|
|
||||||
#else // _WIN64 ][
|
|
||||||
# define SCNdPTR "ld"
|
|
||||||
# define SCNiPTR "li"
|
|
||||||
#endif // _WIN64 ]
|
|
||||||
|
|
||||||
// The fscanf macros for unsigned integers are:
|
|
||||||
#define SCNo8 "o"
|
|
||||||
#define SCNu8 "u"
|
|
||||||
#define SCNx8 "x"
|
|
||||||
#define SCNX8 "X"
|
|
||||||
#define SCNoLEAST8 "o"
|
|
||||||
#define SCNuLEAST8 "u"
|
|
||||||
#define SCNxLEAST8 "x"
|
|
||||||
#define SCNXLEAST8 "X"
|
|
||||||
#define SCNoFAST8 "o"
|
|
||||||
#define SCNuFAST8 "u"
|
|
||||||
#define SCNxFAST8 "x"
|
|
||||||
#define SCNXFAST8 "X"
|
|
||||||
|
|
||||||
#define SCNo16 "ho"
|
|
||||||
#define SCNu16 "hu"
|
|
||||||
#define SCNx16 "hx"
|
|
||||||
#define SCNX16 "hX"
|
|
||||||
#define SCNoLEAST16 "ho"
|
|
||||||
#define SCNuLEAST16 "hu"
|
|
||||||
#define SCNxLEAST16 "hx"
|
|
||||||
#define SCNXLEAST16 "hX"
|
|
||||||
#define SCNoFAST16 "ho"
|
|
||||||
#define SCNuFAST16 "hu"
|
|
||||||
#define SCNxFAST16 "hx"
|
|
||||||
#define SCNXFAST16 "hX"
|
|
||||||
|
|
||||||
#define SCNo32 "lo"
|
|
||||||
#define SCNu32 "lu"
|
|
||||||
#define SCNx32 "lx"
|
|
||||||
#define SCNX32 "lX"
|
|
||||||
#define SCNoLEAST32 "lo"
|
|
||||||
#define SCNuLEAST32 "lu"
|
|
||||||
#define SCNxLEAST32 "lx"
|
|
||||||
#define SCNXLEAST32 "lX"
|
|
||||||
#define SCNoFAST32 "lo"
|
|
||||||
#define SCNuFAST32 "lu"
|
|
||||||
#define SCNxFAST32 "lx"
|
|
||||||
#define SCNXFAST32 "lX"
|
|
||||||
|
|
||||||
#define SCNo64 "I64o"
|
|
||||||
#define SCNu64 "I64u"
|
|
||||||
#define SCNx64 "I64x"
|
|
||||||
#define SCNX64 "I64X"
|
|
||||||
#define SCNoLEAST64 "I64o"
|
|
||||||
#define SCNuLEAST64 "I64u"
|
|
||||||
#define SCNxLEAST64 "I64x"
|
|
||||||
#define SCNXLEAST64 "I64X"
|
|
||||||
#define SCNoFAST64 "I64o"
|
|
||||||
#define SCNuFAST64 "I64u"
|
|
||||||
#define SCNxFAST64 "I64x"
|
|
||||||
#define SCNXFAST64 "I64X"
|
|
||||||
|
|
||||||
#define SCNoMAX "I64o"
|
|
||||||
#define SCNuMAX "I64u"
|
|
||||||
#define SCNxMAX "I64x"
|
|
||||||
#define SCNXMAX "I64X"
|
|
||||||
|
|
||||||
#ifdef _WIN64 // [
|
|
||||||
# define SCNoPTR "I64o"
|
|
||||||
# define SCNuPTR "I64u"
|
|
||||||
# define SCNxPTR "I64x"
|
|
||||||
# define SCNXPTR "I64X"
|
|
||||||
#else // _WIN64 ][
|
|
||||||
# define SCNoPTR "lo"
|
|
||||||
# define SCNuPTR "lu"
|
|
||||||
# define SCNxPTR "lx"
|
|
||||||
# define SCNXPTR "lX"
|
|
||||||
#endif // _WIN64 ]
|
|
||||||
|
|
||||||
#endif // __STDC_FORMAT_MACROS ]
|
|
||||||
|
|
||||||
// 7.8.2 Functions for greatest-width integer types
|
|
||||||
|
|
||||||
// 7.8.2.1 The imaxabs function
|
|
||||||
#define imaxabs _abs64
|
|
||||||
|
|
||||||
// 7.8.2.2 The imaxdiv function
|
|
||||||
|
|
||||||
// This is modified version of div() function from Microsoft's div.c found
|
|
||||||
// in %MSVC.NET%\crt\src\div.c
|
|
||||||
#ifdef STATIC_IMAXDIV // [
|
|
||||||
static
|
|
||||||
#else // STATIC_IMAXDIV ][
|
|
||||||
_inline
|
|
||||||
#endif // STATIC_IMAXDIV ]
|
|
||||||
imaxdiv_t __cdecl imaxdiv(intmax_t numer, intmax_t denom)
|
|
||||||
{
|
|
||||||
imaxdiv_t result;
|
|
||||||
|
|
||||||
result.quot = numer / denom;
|
|
||||||
result.rem = numer % denom;
|
|
||||||
|
|
||||||
if (numer < 0 && result.rem > 0) {
|
|
||||||
// did division wrong; must fix up
|
|
||||||
++result.quot;
|
|
||||||
result.rem -= denom;
|
|
||||||
}
|
|
||||||
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
// 7.8.2.3 The strtoimax and strtoumax functions
|
|
||||||
#define strtoimax _strtoi64
|
|
||||||
#define strtoumax _strtoui64
|
|
||||||
|
|
||||||
// 7.8.2.4 The wcstoimax and wcstoumax functions
|
|
||||||
#define wcstoimax _wcstoi64
|
|
||||||
#define wcstoumax _wcstoui64
|
|
||||||
|
|
||||||
#endif // _MSC_VER >= 1800
|
|
||||||
|
|
||||||
#endif // _MSC_INTTYPES_H_ ]
|
|
||||||
@@ -1,300 +0,0 @@
|
|||||||
// ISO C9x compliant stdint.h for Microsoft Visual Studio
|
|
||||||
// Based on ISO/IEC 9899:TC2 Committee draft (May 6, 2005) WG14/N1124
|
|
||||||
//
|
|
||||||
// Copyright (c) 2006-2013 Alexander Chemeris
|
|
||||||
//
|
|
||||||
// Redistribution and use in source and binary forms, with or without
|
|
||||||
// modification, are permitted provided that the following conditions are met:
|
|
||||||
//
|
|
||||||
// 1. Redistributions of source code must retain the above copyright notice,
|
|
||||||
// this list of conditions and the following disclaimer.
|
|
||||||
//
|
|
||||||
// 2. Redistributions in binary form must reproduce the above copyright
|
|
||||||
// notice, this list of conditions and the following disclaimer in the
|
|
||||||
// documentation and/or other materials provided with the distribution.
|
|
||||||
//
|
|
||||||
// 3. Neither the name of the product nor the names of its contributors may
|
|
||||||
// be used to endorse or promote products derived from this software
|
|
||||||
// without specific prior written permission.
|
|
||||||
//
|
|
||||||
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
|
||||||
// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
||||||
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
|
|
||||||
// EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
||||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
||||||
// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
||||||
// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
||||||
// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
||||||
// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
//
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
// The above software in this distribution may have been modified by
|
|
||||||
// THL A29 Limited ("Tencent Modifications").
|
|
||||||
// All Tencent Modifications are Copyright (C) 2015 THL A29 Limited.
|
|
||||||
|
|
||||||
#ifndef _MSC_VER // [
|
|
||||||
#error "Use this header only with Microsoft Visual C++ compilers!"
|
|
||||||
#endif // _MSC_VER ]
|
|
||||||
|
|
||||||
#ifndef _MSC_STDINT_H_ // [
|
|
||||||
#define _MSC_STDINT_H_
|
|
||||||
|
|
||||||
#if _MSC_VER > 1000
|
|
||||||
#pragma once
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// miloyip: Originally Visual Studio 2010 uses its own stdint.h. However it generates warning with INT64_C(), so change to use this file for vs2010.
|
|
||||||
#if _MSC_VER >= 1600 // [
|
|
||||||
#include <stdint.h>
|
|
||||||
|
|
||||||
#if !defined(__cplusplus) || defined(__STDC_CONSTANT_MACROS) // [ See footnote 224 at page 260
|
|
||||||
|
|
||||||
#undef INT8_C
|
|
||||||
#undef INT16_C
|
|
||||||
#undef INT32_C
|
|
||||||
#undef INT64_C
|
|
||||||
#undef UINT8_C
|
|
||||||
#undef UINT16_C
|
|
||||||
#undef UINT32_C
|
|
||||||
#undef UINT64_C
|
|
||||||
|
|
||||||
// 7.18.4.1 Macros for minimum-width integer constants
|
|
||||||
|
|
||||||
#define INT8_C(val) val##i8
|
|
||||||
#define INT16_C(val) val##i16
|
|
||||||
#define INT32_C(val) val##i32
|
|
||||||
#define INT64_C(val) val##i64
|
|
||||||
|
|
||||||
#define UINT8_C(val) val##ui8
|
|
||||||
#define UINT16_C(val) val##ui16
|
|
||||||
#define UINT32_C(val) val##ui32
|
|
||||||
#define UINT64_C(val) val##ui64
|
|
||||||
|
|
||||||
// 7.18.4.2 Macros for greatest-width integer constants
|
|
||||||
// These #ifndef's are needed to prevent collisions with <boost/cstdint.hpp>.
|
|
||||||
// Check out Issue 9 for the details.
|
|
||||||
#ifndef INTMAX_C // [
|
|
||||||
# define INTMAX_C INT64_C
|
|
||||||
#endif // INTMAX_C ]
|
|
||||||
#ifndef UINTMAX_C // [
|
|
||||||
# define UINTMAX_C UINT64_C
|
|
||||||
#endif // UINTMAX_C ]
|
|
||||||
|
|
||||||
#endif // __STDC_CONSTANT_MACROS ]
|
|
||||||
|
|
||||||
#else // ] _MSC_VER >= 1700 [
|
|
||||||
|
|
||||||
#include <limits.h>
|
|
||||||
|
|
||||||
// For Visual Studio 6 in C++ mode and for many Visual Studio versions when
|
|
||||||
// compiling for ARM we have to wrap <wchar.h> include with 'extern "C++" {}'
|
|
||||||
// or compiler would give many errors like this:
|
|
||||||
// error C2733: second C linkage of overloaded function 'wmemchr' not allowed
|
|
||||||
#if defined(__cplusplus) && !defined(_M_ARM)
|
|
||||||
extern "C" {
|
|
||||||
#endif
|
|
||||||
# include <wchar.h>
|
|
||||||
#if defined(__cplusplus) && !defined(_M_ARM)
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Define _W64 macros to mark types changing their size, like intptr_t.
|
|
||||||
#ifndef _W64
|
|
||||||
# if !defined(__midl) && (defined(_X86_) || defined(_M_IX86)) && _MSC_VER >= 1300
|
|
||||||
# define _W64 __w64
|
|
||||||
# else
|
|
||||||
# define _W64
|
|
||||||
# endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
// 7.18.1 Integer types
|
|
||||||
|
|
||||||
// 7.18.1.1 Exact-width integer types
|
|
||||||
|
|
||||||
// Visual Studio 6 and Embedded Visual C++ 4 doesn't
|
|
||||||
// realize that, e.g. char has the same size as __int8
|
|
||||||
// so we give up on __intX for them.
|
|
||||||
#if (_MSC_VER < 1300)
|
|
||||||
typedef signed char int8_t;
|
|
||||||
typedef signed short int16_t;
|
|
||||||
typedef signed int int32_t;
|
|
||||||
typedef unsigned char uint8_t;
|
|
||||||
typedef unsigned short uint16_t;
|
|
||||||
typedef unsigned int uint32_t;
|
|
||||||
#else
|
|
||||||
typedef signed __int8 int8_t;
|
|
||||||
typedef signed __int16 int16_t;
|
|
||||||
typedef signed __int32 int32_t;
|
|
||||||
typedef unsigned __int8 uint8_t;
|
|
||||||
typedef unsigned __int16 uint16_t;
|
|
||||||
typedef unsigned __int32 uint32_t;
|
|
||||||
#endif
|
|
||||||
typedef signed __int64 int64_t;
|
|
||||||
typedef unsigned __int64 uint64_t;
|
|
||||||
|
|
||||||
|
|
||||||
// 7.18.1.2 Minimum-width integer types
|
|
||||||
typedef int8_t int_least8_t;
|
|
||||||
typedef int16_t int_least16_t;
|
|
||||||
typedef int32_t int_least32_t;
|
|
||||||
typedef int64_t int_least64_t;
|
|
||||||
typedef uint8_t uint_least8_t;
|
|
||||||
typedef uint16_t uint_least16_t;
|
|
||||||
typedef uint32_t uint_least32_t;
|
|
||||||
typedef uint64_t uint_least64_t;
|
|
||||||
|
|
||||||
// 7.18.1.3 Fastest minimum-width integer types
|
|
||||||
typedef int8_t int_fast8_t;
|
|
||||||
typedef int16_t int_fast16_t;
|
|
||||||
typedef int32_t int_fast32_t;
|
|
||||||
typedef int64_t int_fast64_t;
|
|
||||||
typedef uint8_t uint_fast8_t;
|
|
||||||
typedef uint16_t uint_fast16_t;
|
|
||||||
typedef uint32_t uint_fast32_t;
|
|
||||||
typedef uint64_t uint_fast64_t;
|
|
||||||
|
|
||||||
// 7.18.1.4 Integer types capable of holding object pointers
|
|
||||||
#ifdef _WIN64 // [
|
|
||||||
typedef signed __int64 intptr_t;
|
|
||||||
typedef unsigned __int64 uintptr_t;
|
|
||||||
#else // _WIN64 ][
|
|
||||||
typedef _W64 signed int intptr_t;
|
|
||||||
typedef _W64 unsigned int uintptr_t;
|
|
||||||
#endif // _WIN64 ]
|
|
||||||
|
|
||||||
// 7.18.1.5 Greatest-width integer types
|
|
||||||
typedef int64_t intmax_t;
|
|
||||||
typedef uint64_t uintmax_t;
|
|
||||||
|
|
||||||
|
|
||||||
// 7.18.2 Limits of specified-width integer types
|
|
||||||
|
|
||||||
#if !defined(__cplusplus) || defined(__STDC_LIMIT_MACROS) // [ See footnote 220 at page 257 and footnote 221 at page 259
|
|
||||||
|
|
||||||
// 7.18.2.1 Limits of exact-width integer types
|
|
||||||
#define INT8_MIN ((int8_t)_I8_MIN)
|
|
||||||
#define INT8_MAX _I8_MAX
|
|
||||||
#define INT16_MIN ((int16_t)_I16_MIN)
|
|
||||||
#define INT16_MAX _I16_MAX
|
|
||||||
#define INT32_MIN ((int32_t)_I32_MIN)
|
|
||||||
#define INT32_MAX _I32_MAX
|
|
||||||
#define INT64_MIN ((int64_t)_I64_MIN)
|
|
||||||
#define INT64_MAX _I64_MAX
|
|
||||||
#define UINT8_MAX _UI8_MAX
|
|
||||||
#define UINT16_MAX _UI16_MAX
|
|
||||||
#define UINT32_MAX _UI32_MAX
|
|
||||||
#define UINT64_MAX _UI64_MAX
|
|
||||||
|
|
||||||
// 7.18.2.2 Limits of minimum-width integer types
|
|
||||||
#define INT_LEAST8_MIN INT8_MIN
|
|
||||||
#define INT_LEAST8_MAX INT8_MAX
|
|
||||||
#define INT_LEAST16_MIN INT16_MIN
|
|
||||||
#define INT_LEAST16_MAX INT16_MAX
|
|
||||||
#define INT_LEAST32_MIN INT32_MIN
|
|
||||||
#define INT_LEAST32_MAX INT32_MAX
|
|
||||||
#define INT_LEAST64_MIN INT64_MIN
|
|
||||||
#define INT_LEAST64_MAX INT64_MAX
|
|
||||||
#define UINT_LEAST8_MAX UINT8_MAX
|
|
||||||
#define UINT_LEAST16_MAX UINT16_MAX
|
|
||||||
#define UINT_LEAST32_MAX UINT32_MAX
|
|
||||||
#define UINT_LEAST64_MAX UINT64_MAX
|
|
||||||
|
|
||||||
// 7.18.2.3 Limits of fastest minimum-width integer types
|
|
||||||
#define INT_FAST8_MIN INT8_MIN
|
|
||||||
#define INT_FAST8_MAX INT8_MAX
|
|
||||||
#define INT_FAST16_MIN INT16_MIN
|
|
||||||
#define INT_FAST16_MAX INT16_MAX
|
|
||||||
#define INT_FAST32_MIN INT32_MIN
|
|
||||||
#define INT_FAST32_MAX INT32_MAX
|
|
||||||
#define INT_FAST64_MIN INT64_MIN
|
|
||||||
#define INT_FAST64_MAX INT64_MAX
|
|
||||||
#define UINT_FAST8_MAX UINT8_MAX
|
|
||||||
#define UINT_FAST16_MAX UINT16_MAX
|
|
||||||
#define UINT_FAST32_MAX UINT32_MAX
|
|
||||||
#define UINT_FAST64_MAX UINT64_MAX
|
|
||||||
|
|
||||||
// 7.18.2.4 Limits of integer types capable of holding object pointers
|
|
||||||
#ifdef _WIN64 // [
|
|
||||||
# define INTPTR_MIN INT64_MIN
|
|
||||||
# define INTPTR_MAX INT64_MAX
|
|
||||||
# define UINTPTR_MAX UINT64_MAX
|
|
||||||
#else // _WIN64 ][
|
|
||||||
# define INTPTR_MIN INT32_MIN
|
|
||||||
# define INTPTR_MAX INT32_MAX
|
|
||||||
# define UINTPTR_MAX UINT32_MAX
|
|
||||||
#endif // _WIN64 ]
|
|
||||||
|
|
||||||
// 7.18.2.5 Limits of greatest-width integer types
|
|
||||||
#define INTMAX_MIN INT64_MIN
|
|
||||||
#define INTMAX_MAX INT64_MAX
|
|
||||||
#define UINTMAX_MAX UINT64_MAX
|
|
||||||
|
|
||||||
// 7.18.3 Limits of other integer types
|
|
||||||
|
|
||||||
#ifdef _WIN64 // [
|
|
||||||
# define PTRDIFF_MIN _I64_MIN
|
|
||||||
# define PTRDIFF_MAX _I64_MAX
|
|
||||||
#else // _WIN64 ][
|
|
||||||
# define PTRDIFF_MIN _I32_MIN
|
|
||||||
# define PTRDIFF_MAX _I32_MAX
|
|
||||||
#endif // _WIN64 ]
|
|
||||||
|
|
||||||
#define SIG_ATOMIC_MIN INT_MIN
|
|
||||||
#define SIG_ATOMIC_MAX INT_MAX
|
|
||||||
|
|
||||||
#ifndef SIZE_MAX // [
|
|
||||||
# ifdef _WIN64 // [
|
|
||||||
# define SIZE_MAX _UI64_MAX
|
|
||||||
# else // _WIN64 ][
|
|
||||||
# define SIZE_MAX _UI32_MAX
|
|
||||||
# endif // _WIN64 ]
|
|
||||||
#endif // SIZE_MAX ]
|
|
||||||
|
|
||||||
// WCHAR_MIN and WCHAR_MAX are also defined in <wchar.h>
|
|
||||||
#ifndef WCHAR_MIN // [
|
|
||||||
# define WCHAR_MIN 0
|
|
||||||
#endif // WCHAR_MIN ]
|
|
||||||
#ifndef WCHAR_MAX // [
|
|
||||||
# define WCHAR_MAX _UI16_MAX
|
|
||||||
#endif // WCHAR_MAX ]
|
|
||||||
|
|
||||||
#define WINT_MIN 0
|
|
||||||
#define WINT_MAX _UI16_MAX
|
|
||||||
|
|
||||||
#endif // __STDC_LIMIT_MACROS ]
|
|
||||||
|
|
||||||
|
|
||||||
// 7.18.4 Limits of other integer types
|
|
||||||
|
|
||||||
#if !defined(__cplusplus) || defined(__STDC_CONSTANT_MACROS) // [ See footnote 224 at page 260
|
|
||||||
|
|
||||||
// 7.18.4.1 Macros for minimum-width integer constants
|
|
||||||
|
|
||||||
#define INT8_C(val) val##i8
|
|
||||||
#define INT16_C(val) val##i16
|
|
||||||
#define INT32_C(val) val##i32
|
|
||||||
#define INT64_C(val) val##i64
|
|
||||||
|
|
||||||
#define UINT8_C(val) val##ui8
|
|
||||||
#define UINT16_C(val) val##ui16
|
|
||||||
#define UINT32_C(val) val##ui32
|
|
||||||
#define UINT64_C(val) val##ui64
|
|
||||||
|
|
||||||
// 7.18.4.2 Macros for greatest-width integer constants
|
|
||||||
// These #ifndef's are needed to prevent collisions with <boost/cstdint.hpp>.
|
|
||||||
// Check out Issue 9 for the details.
|
|
||||||
#ifndef INTMAX_C // [
|
|
||||||
# define INTMAX_C INT64_C
|
|
||||||
#endif // INTMAX_C ]
|
|
||||||
#ifndef UINTMAX_C // [
|
|
||||||
# define UINTMAX_C UINT64_C
|
|
||||||
#endif // UINTMAX_C ]
|
|
||||||
|
|
||||||
#endif // __STDC_CONSTANT_MACROS ]
|
|
||||||
|
|
||||||
#endif // _MSC_VER >= 1600 ]
|
|
||||||
|
|
||||||
#endif // _MSC_STDINT_H_ ]
|
|
||||||
@@ -1,81 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_OSTREAMWRAPPER_H_
|
|
||||||
#define RAPIDJSON_OSTREAMWRAPPER_H_
|
|
||||||
|
|
||||||
#include "stream.h"
|
|
||||||
#include <iosfwd>
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(padded)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Wrapper of \c std::basic_ostream into RapidJSON's Stream concept.
|
|
||||||
/*!
|
|
||||||
The classes can be wrapped including but not limited to:
|
|
||||||
|
|
||||||
- \c std::ostringstream
|
|
||||||
- \c std::stringstream
|
|
||||||
- \c std::wpstringstream
|
|
||||||
- \c std::wstringstream
|
|
||||||
- \c std::ifstream
|
|
||||||
- \c std::fstream
|
|
||||||
- \c std::wofstream
|
|
||||||
- \c std::wfstream
|
|
||||||
|
|
||||||
\tparam StreamType Class derived from \c std::basic_ostream.
|
|
||||||
*/
|
|
||||||
|
|
||||||
template <typename StreamType>
|
|
||||||
class BasicOStreamWrapper {
|
|
||||||
public:
|
|
||||||
typedef typename StreamType::char_type Ch;
|
|
||||||
BasicOStreamWrapper(StreamType& stream) : stream_(stream) {}
|
|
||||||
|
|
||||||
void Put(Ch c) {
|
|
||||||
stream_.put(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
void Flush() {
|
|
||||||
stream_.flush();
|
|
||||||
}
|
|
||||||
|
|
||||||
// Not implemented
|
|
||||||
char Peek() const { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
char Take() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
size_t Tell() const { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
char* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
size_t PutEnd(char*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
private:
|
|
||||||
BasicOStreamWrapper(const BasicOStreamWrapper&);
|
|
||||||
BasicOStreamWrapper& operator=(const BasicOStreamWrapper&);
|
|
||||||
|
|
||||||
StreamType& stream_;
|
|
||||||
};
|
|
||||||
|
|
||||||
typedef BasicOStreamWrapper<std::ostream> OStreamWrapper;
|
|
||||||
typedef BasicOStreamWrapper<std::wostream> WOStreamWrapper;
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_OSTREAMWRAPPER_H_
|
|
||||||
File diff suppressed because it is too large
Load Diff
@@ -1,255 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_PRETTYWRITER_H_
|
|
||||||
#define RAPIDJSON_PRETTYWRITER_H_
|
|
||||||
|
|
||||||
#include "writer.h"
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(effc++)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Combination of PrettyWriter format flags.
|
|
||||||
/*! \see PrettyWriter::SetFormatOptions
|
|
||||||
*/
|
|
||||||
enum PrettyFormatOptions {
|
|
||||||
kFormatDefault = 0, //!< Default pretty formatting.
|
|
||||||
kFormatSingleLineArray = 1 //!< Format arrays on a single line.
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Writer with indentation and spacing.
|
|
||||||
/*!
|
|
||||||
\tparam OutputStream Type of ouptut os.
|
|
||||||
\tparam SourceEncoding Encoding of source string.
|
|
||||||
\tparam TargetEncoding Encoding of output stream.
|
|
||||||
\tparam StackAllocator Type of allocator for allocating memory of stack.
|
|
||||||
*/
|
|
||||||
template<typename OutputStream, typename SourceEncoding = UTF8<>, typename TargetEncoding = UTF8<>, typename StackAllocator = CrtAllocator, unsigned writeFlags = kWriteDefaultFlags>
|
|
||||||
class PrettyWriter : public Writer<OutputStream, SourceEncoding, TargetEncoding, StackAllocator, writeFlags> {
|
|
||||||
public:
|
|
||||||
typedef Writer<OutputStream, SourceEncoding, TargetEncoding, StackAllocator> Base;
|
|
||||||
typedef typename Base::Ch Ch;
|
|
||||||
|
|
||||||
//! Constructor
|
|
||||||
/*! \param os Output stream.
|
|
||||||
\param allocator User supplied allocator. If it is null, it will create a private one.
|
|
||||||
\param levelDepth Initial capacity of stack.
|
|
||||||
*/
|
|
||||||
explicit PrettyWriter(OutputStream& os, StackAllocator* allocator = 0, size_t levelDepth = Base::kDefaultLevelDepth) :
|
|
||||||
Base(os, allocator, levelDepth), indentChar_(' '), indentCharCount_(4), formatOptions_(kFormatDefault) {}
|
|
||||||
|
|
||||||
|
|
||||||
explicit PrettyWriter(StackAllocator* allocator = 0, size_t levelDepth = Base::kDefaultLevelDepth) :
|
|
||||||
Base(allocator, levelDepth), indentChar_(' '), indentCharCount_(4) {}
|
|
||||||
|
|
||||||
//! Set custom indentation.
|
|
||||||
/*! \param indentChar Character for indentation. Must be whitespace character (' ', '\\t', '\\n', '\\r').
|
|
||||||
\param indentCharCount Number of indent characters for each indentation level.
|
|
||||||
\note The default indentation is 4 spaces.
|
|
||||||
*/
|
|
||||||
PrettyWriter& SetIndent(Ch indentChar, unsigned indentCharCount) {
|
|
||||||
RAPIDJSON_ASSERT(indentChar == ' ' || indentChar == '\t' || indentChar == '\n' || indentChar == '\r');
|
|
||||||
indentChar_ = indentChar;
|
|
||||||
indentCharCount_ = indentCharCount;
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Set pretty writer formatting options.
|
|
||||||
/*! \param options Formatting options.
|
|
||||||
*/
|
|
||||||
PrettyWriter& SetFormatOptions(PrettyFormatOptions options) {
|
|
||||||
formatOptions_ = options;
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*! @name Implementation of Handler
|
|
||||||
\see Handler
|
|
||||||
*/
|
|
||||||
//@{
|
|
||||||
|
|
||||||
bool Null() { PrettyPrefix(kNullType); return Base::WriteNull(); }
|
|
||||||
bool Bool(bool b) { PrettyPrefix(b ? kTrueType : kFalseType); return Base::WriteBool(b); }
|
|
||||||
bool Int(int i) { PrettyPrefix(kNumberType); return Base::WriteInt(i); }
|
|
||||||
bool Uint(unsigned u) { PrettyPrefix(kNumberType); return Base::WriteUint(u); }
|
|
||||||
bool Int64(int64_t i64) { PrettyPrefix(kNumberType); return Base::WriteInt64(i64); }
|
|
||||||
bool Uint64(uint64_t u64) { PrettyPrefix(kNumberType); return Base::WriteUint64(u64); }
|
|
||||||
bool Double(double d) { PrettyPrefix(kNumberType); return Base::WriteDouble(d); }
|
|
||||||
|
|
||||||
bool RawNumber(const Ch* str, SizeType length, bool copy = false) {
|
|
||||||
(void)copy;
|
|
||||||
PrettyPrefix(kNumberType);
|
|
||||||
return Base::WriteString(str, length);
|
|
||||||
}
|
|
||||||
|
|
||||||
bool String(const Ch* str, SizeType length, bool copy = false) {
|
|
||||||
(void)copy;
|
|
||||||
PrettyPrefix(kStringType);
|
|
||||||
return Base::WriteString(str, length);
|
|
||||||
}
|
|
||||||
|
|
||||||
#if RAPIDJSON_HAS_STDSTRING
|
|
||||||
bool String(const std::basic_string<Ch>& str) {
|
|
||||||
return String(str.data(), SizeType(str.size()));
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
bool StartObject() {
|
|
||||||
PrettyPrefix(kObjectType);
|
|
||||||
new (Base::level_stack_.template Push<typename Base::Level>()) typename Base::Level(false);
|
|
||||||
return Base::WriteStartObject();
|
|
||||||
}
|
|
||||||
|
|
||||||
bool Key(const Ch* str, SizeType length, bool copy = false) { return String(str, length, copy); }
|
|
||||||
|
|
||||||
#if RAPIDJSON_HAS_STDSTRING
|
|
||||||
bool Key(const std::basic_string<Ch>& str) {
|
|
||||||
return Key(str.data(), SizeType(str.size()));
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
bool EndObject(SizeType memberCount = 0) {
|
|
||||||
(void)memberCount;
|
|
||||||
RAPIDJSON_ASSERT(Base::level_stack_.GetSize() >= sizeof(typename Base::Level));
|
|
||||||
RAPIDJSON_ASSERT(!Base::level_stack_.template Top<typename Base::Level>()->inArray);
|
|
||||||
bool empty = Base::level_stack_.template Pop<typename Base::Level>(1)->valueCount == 0;
|
|
||||||
|
|
||||||
if (!empty) {
|
|
||||||
Base::os_->Put('\n');
|
|
||||||
WriteIndent();
|
|
||||||
}
|
|
||||||
bool ret = Base::WriteEndObject();
|
|
||||||
(void)ret;
|
|
||||||
RAPIDJSON_ASSERT(ret == true);
|
|
||||||
if (Base::level_stack_.Empty()) // end of json text
|
|
||||||
Base::os_->Flush();
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool StartArray() {
|
|
||||||
PrettyPrefix(kArrayType);
|
|
||||||
new (Base::level_stack_.template Push<typename Base::Level>()) typename Base::Level(true);
|
|
||||||
return Base::WriteStartArray();
|
|
||||||
}
|
|
||||||
|
|
||||||
bool EndArray(SizeType memberCount = 0) {
|
|
||||||
(void)memberCount;
|
|
||||||
RAPIDJSON_ASSERT(Base::level_stack_.GetSize() >= sizeof(typename Base::Level));
|
|
||||||
RAPIDJSON_ASSERT(Base::level_stack_.template Top<typename Base::Level>()->inArray);
|
|
||||||
bool empty = Base::level_stack_.template Pop<typename Base::Level>(1)->valueCount == 0;
|
|
||||||
|
|
||||||
if (!empty && !(formatOptions_ & kFormatSingleLineArray)) {
|
|
||||||
Base::os_->Put('\n');
|
|
||||||
WriteIndent();
|
|
||||||
}
|
|
||||||
bool ret = Base::WriteEndArray();
|
|
||||||
(void)ret;
|
|
||||||
RAPIDJSON_ASSERT(ret == true);
|
|
||||||
if (Base::level_stack_.Empty()) // end of json text
|
|
||||||
Base::os_->Flush();
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
//@}
|
|
||||||
|
|
||||||
/*! @name Convenience extensions */
|
|
||||||
//@{
|
|
||||||
|
|
||||||
//! Simpler but slower overload.
|
|
||||||
bool String(const Ch* str) { return String(str, internal::StrLen(str)); }
|
|
||||||
bool Key(const Ch* str) { return Key(str, internal::StrLen(str)); }
|
|
||||||
|
|
||||||
//@}
|
|
||||||
|
|
||||||
//! Write a raw JSON value.
|
|
||||||
/*!
|
|
||||||
For user to write a stringified JSON as a value.
|
|
||||||
|
|
||||||
\param json A well-formed JSON value. It should not contain null character within [0, length - 1] range.
|
|
||||||
\param length Length of the json.
|
|
||||||
\param type Type of the root of json.
|
|
||||||
\note When using PrettyWriter::RawValue(), the result json may not be indented correctly.
|
|
||||||
*/
|
|
||||||
bool RawValue(const Ch* json, size_t length, Type type) { PrettyPrefix(type); return Base::WriteRawValue(json, length); }
|
|
||||||
|
|
||||||
protected:
|
|
||||||
void PrettyPrefix(Type type) {
|
|
||||||
(void)type;
|
|
||||||
if (Base::level_stack_.GetSize() != 0) { // this value is not at root
|
|
||||||
typename Base::Level* level = Base::level_stack_.template Top<typename Base::Level>();
|
|
||||||
|
|
||||||
if (level->inArray) {
|
|
||||||
if (level->valueCount > 0) {
|
|
||||||
Base::os_->Put(','); // add comma if it is not the first element in array
|
|
||||||
if (formatOptions_ & kFormatSingleLineArray)
|
|
||||||
Base::os_->Put(' ');
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!(formatOptions_ & kFormatSingleLineArray)) {
|
|
||||||
Base::os_->Put('\n');
|
|
||||||
WriteIndent();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else { // in object
|
|
||||||
if (level->valueCount > 0) {
|
|
||||||
if (level->valueCount % 2 == 0) {
|
|
||||||
Base::os_->Put(',');
|
|
||||||
Base::os_->Put('\n');
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
Base::os_->Put(':');
|
|
||||||
Base::os_->Put(' ');
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else
|
|
||||||
Base::os_->Put('\n');
|
|
||||||
|
|
||||||
if (level->valueCount % 2 == 0)
|
|
||||||
WriteIndent();
|
|
||||||
}
|
|
||||||
if (!level->inArray && level->valueCount % 2 == 0)
|
|
||||||
RAPIDJSON_ASSERT(type == kStringType); // if it's in object, then even number should be a name
|
|
||||||
level->valueCount++;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
RAPIDJSON_ASSERT(!Base::hasRoot_); // Should only has one and only one root.
|
|
||||||
Base::hasRoot_ = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WriteIndent() {
|
|
||||||
size_t count = (Base::level_stack_.GetSize() / sizeof(typename Base::Level)) * indentCharCount_;
|
|
||||||
PutN(*Base::os_, static_cast<typename TargetEncoding::Ch>(indentChar_), count);
|
|
||||||
}
|
|
||||||
|
|
||||||
Ch indentChar_;
|
|
||||||
unsigned indentCharCount_;
|
|
||||||
PrettyFormatOptions formatOptions_;
|
|
||||||
|
|
||||||
private:
|
|
||||||
// Prohibit copy constructor & assignment operator.
|
|
||||||
PrettyWriter(const PrettyWriter&);
|
|
||||||
PrettyWriter& operator=(const PrettyWriter&);
|
|
||||||
};
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#ifdef __GNUC__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_RAPIDJSON_H_
|
|
||||||
@@ -1,615 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_RAPIDJSON_H_
|
|
||||||
#define RAPIDJSON_RAPIDJSON_H_
|
|
||||||
|
|
||||||
/*!\file rapidjson.h
|
|
||||||
\brief common definitions and configuration
|
|
||||||
|
|
||||||
\see RAPIDJSON_CONFIG
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*! \defgroup RAPIDJSON_CONFIG RapidJSON configuration
|
|
||||||
\brief Configuration macros for library features
|
|
||||||
|
|
||||||
Some RapidJSON features are configurable to adapt the library to a wide
|
|
||||||
variety of platforms, environments and usage scenarios. Most of the
|
|
||||||
features can be configured in terms of overriden or predefined
|
|
||||||
preprocessor macros at compile-time.
|
|
||||||
|
|
||||||
Some additional customization is available in the \ref RAPIDJSON_ERRORS APIs.
|
|
||||||
|
|
||||||
\note These macros should be given on the compiler command-line
|
|
||||||
(where applicable) to avoid inconsistent values when compiling
|
|
||||||
different translation units of a single application.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <cstdlib> // malloc(), realloc(), free(), size_t
|
|
||||||
#include <cstring> // memset(), memcpy(), memmove(), memcmp()
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_VERSION_STRING
|
|
||||||
//
|
|
||||||
// ALWAYS synchronize the following 3 macros with corresponding variables in /CMakeLists.txt.
|
|
||||||
//
|
|
||||||
|
|
||||||
//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
|
|
||||||
// token stringification
|
|
||||||
#define RAPIDJSON_STRINGIFY(x) RAPIDJSON_DO_STRINGIFY(x)
|
|
||||||
#define RAPIDJSON_DO_STRINGIFY(x) #x
|
|
||||||
//!@endcond
|
|
||||||
|
|
||||||
/*! \def RAPIDJSON_MAJOR_VERSION
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief Major version of RapidJSON in integer.
|
|
||||||
*/
|
|
||||||
/*! \def RAPIDJSON_MINOR_VERSION
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief Minor version of RapidJSON in integer.
|
|
||||||
*/
|
|
||||||
/*! \def RAPIDJSON_PATCH_VERSION
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief Patch version of RapidJSON in integer.
|
|
||||||
*/
|
|
||||||
/*! \def RAPIDJSON_VERSION_STRING
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief Version of RapidJSON in "<major>.<minor>.<patch>" string format.
|
|
||||||
*/
|
|
||||||
#define RAPIDJSON_MAJOR_VERSION 1
|
|
||||||
#define RAPIDJSON_MINOR_VERSION 1
|
|
||||||
#define RAPIDJSON_PATCH_VERSION 0
|
|
||||||
#define RAPIDJSON_VERSION_STRING \
|
|
||||||
RAPIDJSON_STRINGIFY(RAPIDJSON_MAJOR_VERSION.RAPIDJSON_MINOR_VERSION.RAPIDJSON_PATCH_VERSION)
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_NAMESPACE_(BEGIN|END)
|
|
||||||
/*! \def RAPIDJSON_NAMESPACE
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief provide custom rapidjson namespace
|
|
||||||
|
|
||||||
In order to avoid symbol clashes and/or "One Definition Rule" errors
|
|
||||||
between multiple inclusions of (different versions of) RapidJSON in
|
|
||||||
a single binary, users can customize the name of the main RapidJSON
|
|
||||||
namespace.
|
|
||||||
|
|
||||||
In case of a single nesting level, defining \c RAPIDJSON_NAMESPACE
|
|
||||||
to a custom name (e.g. \c MyRapidJSON) is sufficient. If multiple
|
|
||||||
levels are needed, both \ref RAPIDJSON_NAMESPACE_BEGIN and \ref
|
|
||||||
RAPIDJSON_NAMESPACE_END need to be defined as well:
|
|
||||||
|
|
||||||
\code
|
|
||||||
// in some .cpp file
|
|
||||||
#define RAPIDJSON_NAMESPACE my::rapidjson
|
|
||||||
#define RAPIDJSON_NAMESPACE_BEGIN namespace my { namespace rapidjson {
|
|
||||||
#define RAPIDJSON_NAMESPACE_END } }
|
|
||||||
#include "rapidjson/..."
|
|
||||||
\endcode
|
|
||||||
|
|
||||||
\see rapidjson
|
|
||||||
*/
|
|
||||||
/*! \def RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief provide custom rapidjson namespace (opening expression)
|
|
||||||
\see RAPIDJSON_NAMESPACE
|
|
||||||
*/
|
|
||||||
/*! \def RAPIDJSON_NAMESPACE_END
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief provide custom rapidjson namespace (closing expression)
|
|
||||||
\see RAPIDJSON_NAMESPACE
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_NAMESPACE
|
|
||||||
#define RAPIDJSON_NAMESPACE rapidjson
|
|
||||||
#endif
|
|
||||||
#ifndef RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
#define RAPIDJSON_NAMESPACE_BEGIN namespace RAPIDJSON_NAMESPACE {
|
|
||||||
#endif
|
|
||||||
#ifndef RAPIDJSON_NAMESPACE_END
|
|
||||||
#define RAPIDJSON_NAMESPACE_END }
|
|
||||||
#endif
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_HAS_STDSTRING
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_HAS_STDSTRING
|
|
||||||
#ifdef RAPIDJSON_DOXYGEN_RUNNING
|
|
||||||
#define RAPIDJSON_HAS_STDSTRING 1 // force generation of documentation
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_HAS_STDSTRING 0 // no std::string support by default
|
|
||||||
#endif
|
|
||||||
/*! \def RAPIDJSON_HAS_STDSTRING
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief Enable RapidJSON support for \c std::string
|
|
||||||
|
|
||||||
By defining this preprocessor symbol to \c 1, several convenience functions for using
|
|
||||||
\ref rapidjson::GenericValue with \c std::string are enabled, especially
|
|
||||||
for construction and comparison.
|
|
||||||
|
|
||||||
\hideinitializer
|
|
||||||
*/
|
|
||||||
#endif // !defined(RAPIDJSON_HAS_STDSTRING)
|
|
||||||
|
|
||||||
#if RAPIDJSON_HAS_STDSTRING
|
|
||||||
#include <string>
|
|
||||||
#endif // RAPIDJSON_HAS_STDSTRING
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_NO_INT64DEFINE
|
|
||||||
|
|
||||||
/*! \def RAPIDJSON_NO_INT64DEFINE
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief Use external 64-bit integer types.
|
|
||||||
|
|
||||||
RapidJSON requires the 64-bit integer types \c int64_t and \c uint64_t types
|
|
||||||
to be available at global scope.
|
|
||||||
|
|
||||||
If users have their own definition, define RAPIDJSON_NO_INT64DEFINE to
|
|
||||||
prevent RapidJSON from defining its own types.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_NO_INT64DEFINE
|
|
||||||
//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
|
|
||||||
#if defined(_MSC_VER) && (_MSC_VER < 1800) // Visual Studio 2013
|
|
||||||
#include "msinttypes/stdint.h"
|
|
||||||
#include "msinttypes/inttypes.h"
|
|
||||||
#else
|
|
||||||
// Other compilers should have this.
|
|
||||||
#include <stdint.h>
|
|
||||||
#include <inttypes.h>
|
|
||||||
#endif
|
|
||||||
//!@endcond
|
|
||||||
#ifdef RAPIDJSON_DOXYGEN_RUNNING
|
|
||||||
#define RAPIDJSON_NO_INT64DEFINE
|
|
||||||
#endif
|
|
||||||
#endif // RAPIDJSON_NO_INT64TYPEDEF
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_FORCEINLINE
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_FORCEINLINE
|
|
||||||
//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
|
|
||||||
#if defined(_MSC_VER) && defined(NDEBUG)
|
|
||||||
#define RAPIDJSON_FORCEINLINE __forceinline
|
|
||||||
#elif defined(__GNUC__) && __GNUC__ >= 4 && defined(NDEBUG)
|
|
||||||
#define RAPIDJSON_FORCEINLINE __attribute__((always_inline))
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_FORCEINLINE
|
|
||||||
#endif
|
|
||||||
//!@endcond
|
|
||||||
#endif // RAPIDJSON_FORCEINLINE
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_ENDIAN
|
|
||||||
#define RAPIDJSON_LITTLEENDIAN 0 //!< Little endian machine
|
|
||||||
#define RAPIDJSON_BIGENDIAN 1 //!< Big endian machine
|
|
||||||
|
|
||||||
//! Endianness of the machine.
|
|
||||||
/*!
|
|
||||||
\def RAPIDJSON_ENDIAN
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
|
|
||||||
GCC 4.6 provided macro for detecting endianness of the target machine. But other
|
|
||||||
compilers may not have this. User can define RAPIDJSON_ENDIAN to either
|
|
||||||
\ref RAPIDJSON_LITTLEENDIAN or \ref RAPIDJSON_BIGENDIAN.
|
|
||||||
|
|
||||||
Default detection implemented with reference to
|
|
||||||
\li https://gcc.gnu.org/onlinedocs/gcc-4.6.0/cpp/Common-Predefined-Macros.html
|
|
||||||
\li http://www.boost.org/doc/libs/1_42_0/boost/detail/endian.hpp
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_ENDIAN
|
|
||||||
// Detect with GCC 4.6's macro
|
|
||||||
# ifdef __BYTE_ORDER__
|
|
||||||
# if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
|
|
||||||
# define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
|
|
||||||
# elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
|
|
||||||
# define RAPIDJSON_ENDIAN RAPIDJSON_BIGENDIAN
|
|
||||||
# else
|
|
||||||
# error Unknown machine endianess detected. User needs to define RAPIDJSON_ENDIAN.
|
|
||||||
# endif // __BYTE_ORDER__
|
|
||||||
// Detect with GLIBC's endian.h
|
|
||||||
# elif defined(__GLIBC__)
|
|
||||||
# include <endian.h>
|
|
||||||
# if (__BYTE_ORDER == __LITTLE_ENDIAN)
|
|
||||||
# define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
|
|
||||||
# elif (__BYTE_ORDER == __BIG_ENDIAN)
|
|
||||||
# define RAPIDJSON_ENDIAN RAPIDJSON_BIGENDIAN
|
|
||||||
# else
|
|
||||||
# error Unknown machine endianess detected. User needs to define RAPIDJSON_ENDIAN.
|
|
||||||
# endif // __GLIBC__
|
|
||||||
// Detect with _LITTLE_ENDIAN and _BIG_ENDIAN macro
|
|
||||||
# elif defined(_LITTLE_ENDIAN) && !defined(_BIG_ENDIAN)
|
|
||||||
# define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
|
|
||||||
# elif defined(_BIG_ENDIAN) && !defined(_LITTLE_ENDIAN)
|
|
||||||
# define RAPIDJSON_ENDIAN RAPIDJSON_BIGENDIAN
|
|
||||||
// Detect with architecture macros
|
|
||||||
# elif defined(__sparc) || defined(__sparc__) || defined(_POWER) || defined(__powerpc__) || defined(__ppc__) || defined(__hpux) || defined(__hppa) || defined(_MIPSEB) || defined(_POWER) || defined(__s390__)
|
|
||||||
# define RAPIDJSON_ENDIAN RAPIDJSON_BIGENDIAN
|
|
||||||
# elif defined(__i386__) || defined(__alpha__) || defined(__ia64) || defined(__ia64__) || defined(_M_IX86) || defined(_M_IA64) || defined(_M_ALPHA) || defined(__amd64) || defined(__amd64__) || defined(_M_AMD64) || defined(__x86_64) || defined(__x86_64__) || defined(_M_X64) || defined(__bfin__)
|
|
||||||
# define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
|
|
||||||
# elif defined(_MSC_VER) && defined(_M_ARM)
|
|
||||||
# define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
|
|
||||||
# elif defined(RAPIDJSON_DOXYGEN_RUNNING)
|
|
||||||
# define RAPIDJSON_ENDIAN
|
|
||||||
# else
|
|
||||||
# error Unknown machine endianess detected. User needs to define RAPIDJSON_ENDIAN.
|
|
||||||
# endif
|
|
||||||
#endif // RAPIDJSON_ENDIAN
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_64BIT
|
|
||||||
|
|
||||||
//! Whether using 64-bit architecture
|
|
||||||
#ifndef RAPIDJSON_64BIT
|
|
||||||
#if defined(__LP64__) || (defined(__x86_64__) && defined(__ILP32__)) || defined(_WIN64) || defined(__EMSCRIPTEN__)
|
|
||||||
#define RAPIDJSON_64BIT 1
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_64BIT 0
|
|
||||||
#endif
|
|
||||||
#endif // RAPIDJSON_64BIT
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_ALIGN
|
|
||||||
|
|
||||||
//! Data alignment of the machine.
|
|
||||||
/*! \ingroup RAPIDJSON_CONFIG
|
|
||||||
\param x pointer to align
|
|
||||||
|
|
||||||
Some machines require strict data alignment. Currently the default uses 4 bytes
|
|
||||||
alignment on 32-bit platforms and 8 bytes alignment for 64-bit platforms.
|
|
||||||
User can customize by defining the RAPIDJSON_ALIGN function macro.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_ALIGN
|
|
||||||
#if RAPIDJSON_64BIT == 1
|
|
||||||
#define RAPIDJSON_ALIGN(x) (((x) + static_cast<uint64_t>(7u)) & ~static_cast<uint64_t>(7u))
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_ALIGN(x) (((x) + 3u) & ~3u)
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_UINT64_C2
|
|
||||||
|
|
||||||
//! Construct a 64-bit literal by a pair of 32-bit integer.
|
|
||||||
/*!
|
|
||||||
64-bit literal with or without ULL suffix is prone to compiler warnings.
|
|
||||||
UINT64_C() is C macro which cause compilation problems.
|
|
||||||
Use this macro to define 64-bit constants by a pair of 32-bit integer.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_UINT64_C2
|
|
||||||
#define RAPIDJSON_UINT64_C2(high32, low32) ((static_cast<uint64_t>(high32) << 32) | static_cast<uint64_t>(low32))
|
|
||||||
#endif
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_48BITPOINTER_OPTIMIZATION
|
|
||||||
|
|
||||||
//! Use only lower 48-bit address for some pointers.
|
|
||||||
/*!
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
|
|
||||||
This optimization uses the fact that current X86-64 architecture only implement lower 48-bit virtual address.
|
|
||||||
The higher 16-bit can be used for storing other data.
|
|
||||||
\c GenericValue uses this optimization to reduce its size form 24 bytes to 16 bytes in 64-bit architecture.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_48BITPOINTER_OPTIMIZATION
|
|
||||||
#if defined(__amd64__) || defined(__amd64) || defined(__x86_64__) || defined(__x86_64) || defined(_M_X64) || defined(_M_AMD64)
|
|
||||||
#define RAPIDJSON_48BITPOINTER_OPTIMIZATION 1
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_48BITPOINTER_OPTIMIZATION 0
|
|
||||||
#endif
|
|
||||||
#endif // RAPIDJSON_48BITPOINTER_OPTIMIZATION
|
|
||||||
|
|
||||||
#if RAPIDJSON_48BITPOINTER_OPTIMIZATION == 1
|
|
||||||
#if RAPIDJSON_64BIT != 1
|
|
||||||
#error RAPIDJSON_48BITPOINTER_OPTIMIZATION can only be set to 1 when RAPIDJSON_64BIT=1
|
|
||||||
#endif
|
|
||||||
#define RAPIDJSON_SETPOINTER(type, p, x) (p = reinterpret_cast<type *>((reinterpret_cast<uintptr_t>(p) & static_cast<uintptr_t>(RAPIDJSON_UINT64_C2(0xFFFF0000, 0x00000000))) | reinterpret_cast<uintptr_t>(reinterpret_cast<const void*>(x))))
|
|
||||||
#define RAPIDJSON_GETPOINTER(type, p) (reinterpret_cast<type *>(reinterpret_cast<uintptr_t>(p) & static_cast<uintptr_t>(RAPIDJSON_UINT64_C2(0x0000FFFF, 0xFFFFFFFF))))
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_SETPOINTER(type, p, x) (p = (x))
|
|
||||||
#define RAPIDJSON_GETPOINTER(type, p) (p)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_SSE2/RAPIDJSON_SSE42/RAPIDJSON_SIMD
|
|
||||||
|
|
||||||
/*! \def RAPIDJSON_SIMD
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief Enable SSE2/SSE4.2 optimization.
|
|
||||||
|
|
||||||
RapidJSON supports optimized implementations for some parsing operations
|
|
||||||
based on the SSE2 or SSE4.2 SIMD extensions on modern Intel-compatible
|
|
||||||
processors.
|
|
||||||
|
|
||||||
To enable these optimizations, two different symbols can be defined;
|
|
||||||
\code
|
|
||||||
// Enable SSE2 optimization.
|
|
||||||
#define RAPIDJSON_SSE2
|
|
||||||
|
|
||||||
// Enable SSE4.2 optimization.
|
|
||||||
#define RAPIDJSON_SSE42
|
|
||||||
\endcode
|
|
||||||
|
|
||||||
\c RAPIDJSON_SSE42 takes precedence, if both are defined.
|
|
||||||
|
|
||||||
If any of these symbols is defined, RapidJSON defines the macro
|
|
||||||
\c RAPIDJSON_SIMD to indicate the availability of the optimized code.
|
|
||||||
*/
|
|
||||||
#if defined(RAPIDJSON_SSE2) || defined(RAPIDJSON_SSE42) \
|
|
||||||
|| defined(RAPIDJSON_DOXYGEN_RUNNING)
|
|
||||||
#define RAPIDJSON_SIMD
|
|
||||||
#endif
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_NO_SIZETYPEDEFINE
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_NO_SIZETYPEDEFINE
|
|
||||||
/*! \def RAPIDJSON_NO_SIZETYPEDEFINE
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief User-provided \c SizeType definition.
|
|
||||||
|
|
||||||
In order to avoid using 32-bit size types for indexing strings and arrays,
|
|
||||||
define this preprocessor symbol and provide the type rapidjson::SizeType
|
|
||||||
before including RapidJSON:
|
|
||||||
\code
|
|
||||||
#define RAPIDJSON_NO_SIZETYPEDEFINE
|
|
||||||
namespace rapidjson { typedef ::std::size_t SizeType; }
|
|
||||||
#include "rapidjson/..."
|
|
||||||
\endcode
|
|
||||||
|
|
||||||
\see rapidjson::SizeType
|
|
||||||
*/
|
|
||||||
#ifdef RAPIDJSON_DOXYGEN_RUNNING
|
|
||||||
#define RAPIDJSON_NO_SIZETYPEDEFINE
|
|
||||||
#endif
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
//! Size type (for string lengths, array sizes, etc.)
|
|
||||||
/*! RapidJSON uses 32-bit array/string indices even on 64-bit platforms,
|
|
||||||
instead of using \c size_t. Users may override the SizeType by defining
|
|
||||||
\ref RAPIDJSON_NO_SIZETYPEDEFINE.
|
|
||||||
*/
|
|
||||||
typedef unsigned SizeType;
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// always import std::size_t to rapidjson namespace
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
using std::size_t;
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_ASSERT
|
|
||||||
|
|
||||||
//! Assertion.
|
|
||||||
/*! \ingroup RAPIDJSON_CONFIG
|
|
||||||
By default, rapidjson uses C \c assert() for internal assertions.
|
|
||||||
User can override it by defining RAPIDJSON_ASSERT(x) macro.
|
|
||||||
|
|
||||||
\note Parsing errors are handled and can be customized by the
|
|
||||||
\ref RAPIDJSON_ERRORS APIs.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_ASSERT
|
|
||||||
#include <cassert>
|
|
||||||
#define RAPIDJSON_ASSERT(x) assert(x)
|
|
||||||
#endif // RAPIDJSON_ASSERT
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_STATIC_ASSERT
|
|
||||||
|
|
||||||
// Adopt from boost
|
|
||||||
#ifndef RAPIDJSON_STATIC_ASSERT
|
|
||||||
#ifndef __clang__
|
|
||||||
//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
|
|
||||||
#endif
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
template <bool x> struct STATIC_ASSERTION_FAILURE;
|
|
||||||
template <> struct STATIC_ASSERTION_FAILURE<true> { enum { value = 1 }; };
|
|
||||||
template<int x> struct StaticAssertTest {};
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#define RAPIDJSON_JOIN(X, Y) RAPIDJSON_DO_JOIN(X, Y)
|
|
||||||
#define RAPIDJSON_DO_JOIN(X, Y) RAPIDJSON_DO_JOIN2(X, Y)
|
|
||||||
#define RAPIDJSON_DO_JOIN2(X, Y) X##Y
|
|
||||||
|
|
||||||
#if defined(__GNUC__)
|
|
||||||
#define RAPIDJSON_STATIC_ASSERT_UNUSED_ATTRIBUTE __attribute__((unused))
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_STATIC_ASSERT_UNUSED_ATTRIBUTE
|
|
||||||
#endif
|
|
||||||
#ifndef __clang__
|
|
||||||
//!@endcond
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/*! \def RAPIDJSON_STATIC_ASSERT
|
|
||||||
\brief (Internal) macro to check for conditions at compile-time
|
|
||||||
\param x compile-time condition
|
|
||||||
\hideinitializer
|
|
||||||
*/
|
|
||||||
#define RAPIDJSON_STATIC_ASSERT(x) \
|
|
||||||
typedef ::RAPIDJSON_NAMESPACE::StaticAssertTest< \
|
|
||||||
sizeof(::RAPIDJSON_NAMESPACE::STATIC_ASSERTION_FAILURE<bool(x) >)> \
|
|
||||||
RAPIDJSON_JOIN(StaticAssertTypedef, __LINE__) RAPIDJSON_STATIC_ASSERT_UNUSED_ATTRIBUTE
|
|
||||||
#endif
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_LIKELY, RAPIDJSON_UNLIKELY
|
|
||||||
|
|
||||||
//! Compiler branching hint for expression with high probability to be true.
|
|
||||||
/*!
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\param x Boolean expression likely to be true.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_LIKELY
|
|
||||||
#if defined(__GNUC__) || defined(__clang__)
|
|
||||||
#define RAPIDJSON_LIKELY(x) __builtin_expect(!!(x), 1)
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_LIKELY(x) (x)
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
//! Compiler branching hint for expression with low probability to be true.
|
|
||||||
/*!
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\param x Boolean expression unlikely to be true.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_UNLIKELY
|
|
||||||
#if defined(__GNUC__) || defined(__clang__)
|
|
||||||
#define RAPIDJSON_UNLIKELY(x) __builtin_expect(!!(x), 0)
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_UNLIKELY(x) (x)
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// Helpers
|
|
||||||
|
|
||||||
//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
|
|
||||||
|
|
||||||
#define RAPIDJSON_MULTILINEMACRO_BEGIN do {
|
|
||||||
#define RAPIDJSON_MULTILINEMACRO_END \
|
|
||||||
} while((void)0, 0)
|
|
||||||
|
|
||||||
// adopted from Boost
|
|
||||||
#define RAPIDJSON_VERSION_CODE(x,y,z) \
|
|
||||||
(((x)*100000) + ((y)*100) + (z))
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// RAPIDJSON_DIAG_PUSH/POP, RAPIDJSON_DIAG_OFF
|
|
||||||
|
|
||||||
#if defined(__GNUC__)
|
|
||||||
#define RAPIDJSON_GNUC \
|
|
||||||
RAPIDJSON_VERSION_CODE(__GNUC__,__GNUC_MINOR__,__GNUC_PATCHLEVEL__)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if defined(__clang__) || (defined(RAPIDJSON_GNUC) && RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,2,0))
|
|
||||||
|
|
||||||
#define RAPIDJSON_PRAGMA(x) _Pragma(RAPIDJSON_STRINGIFY(x))
|
|
||||||
#define RAPIDJSON_DIAG_PRAGMA(x) RAPIDJSON_PRAGMA(GCC diagnostic x)
|
|
||||||
#define RAPIDJSON_DIAG_OFF(x) \
|
|
||||||
RAPIDJSON_DIAG_PRAGMA(ignored RAPIDJSON_STRINGIFY(RAPIDJSON_JOIN(-W,x)))
|
|
||||||
|
|
||||||
// push/pop support in Clang and GCC>=4.6
|
|
||||||
#if defined(__clang__) || (defined(RAPIDJSON_GNUC) && RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,6,0))
|
|
||||||
#define RAPIDJSON_DIAG_PUSH RAPIDJSON_DIAG_PRAGMA(push)
|
|
||||||
#define RAPIDJSON_DIAG_POP RAPIDJSON_DIAG_PRAGMA(pop)
|
|
||||||
#else // GCC >= 4.2, < 4.6
|
|
||||||
#define RAPIDJSON_DIAG_PUSH /* ignored */
|
|
||||||
#define RAPIDJSON_DIAG_POP /* ignored */
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#elif defined(_MSC_VER)
|
|
||||||
|
|
||||||
// pragma (MSVC specific)
|
|
||||||
#define RAPIDJSON_PRAGMA(x) __pragma(x)
|
|
||||||
#define RAPIDJSON_DIAG_PRAGMA(x) RAPIDJSON_PRAGMA(warning(x))
|
|
||||||
|
|
||||||
#define RAPIDJSON_DIAG_OFF(x) RAPIDJSON_DIAG_PRAGMA(disable: x)
|
|
||||||
#define RAPIDJSON_DIAG_PUSH RAPIDJSON_DIAG_PRAGMA(push)
|
|
||||||
#define RAPIDJSON_DIAG_POP RAPIDJSON_DIAG_PRAGMA(pop)
|
|
||||||
|
|
||||||
#else
|
|
||||||
|
|
||||||
#define RAPIDJSON_DIAG_OFF(x) /* ignored */
|
|
||||||
#define RAPIDJSON_DIAG_PUSH /* ignored */
|
|
||||||
#define RAPIDJSON_DIAG_POP /* ignored */
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_DIAG_*
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// C++11 features
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_HAS_CXX11_RVALUE_REFS
|
|
||||||
#if defined(__clang__)
|
|
||||||
#if __has_feature(cxx_rvalue_references) && \
|
|
||||||
(defined(_LIBCPP_VERSION) || defined(__GLIBCXX__) && __GLIBCXX__ >= 20080306)
|
|
||||||
#define RAPIDJSON_HAS_CXX11_RVALUE_REFS 1
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_HAS_CXX11_RVALUE_REFS 0
|
|
||||||
#endif
|
|
||||||
#elif (defined(RAPIDJSON_GNUC) && (RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,3,0)) && defined(__GXX_EXPERIMENTAL_CXX0X__)) || \
|
|
||||||
(defined(_MSC_VER) && _MSC_VER >= 1600)
|
|
||||||
|
|
||||||
#define RAPIDJSON_HAS_CXX11_RVALUE_REFS 1
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_HAS_CXX11_RVALUE_REFS 0
|
|
||||||
#endif
|
|
||||||
#endif // RAPIDJSON_HAS_CXX11_RVALUE_REFS
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_HAS_CXX11_NOEXCEPT
|
|
||||||
#if defined(__clang__)
|
|
||||||
#define RAPIDJSON_HAS_CXX11_NOEXCEPT __has_feature(cxx_noexcept)
|
|
||||||
#elif (defined(RAPIDJSON_GNUC) && (RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,6,0)) && defined(__GXX_EXPERIMENTAL_CXX0X__))
|
|
||||||
// (defined(_MSC_VER) && _MSC_VER >= ????) // not yet supported
|
|
||||||
#define RAPIDJSON_HAS_CXX11_NOEXCEPT 1
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_HAS_CXX11_NOEXCEPT 0
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
#if RAPIDJSON_HAS_CXX11_NOEXCEPT
|
|
||||||
#define RAPIDJSON_NOEXCEPT noexcept
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_NOEXCEPT /* noexcept */
|
|
||||||
#endif // RAPIDJSON_HAS_CXX11_NOEXCEPT
|
|
||||||
|
|
||||||
// no automatic detection, yet
|
|
||||||
#ifndef RAPIDJSON_HAS_CXX11_TYPETRAITS
|
|
||||||
#define RAPIDJSON_HAS_CXX11_TYPETRAITS 0
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_HAS_CXX11_RANGE_FOR
|
|
||||||
#if defined(__clang__)
|
|
||||||
#define RAPIDJSON_HAS_CXX11_RANGE_FOR __has_feature(cxx_range_for)
|
|
||||||
#elif (defined(RAPIDJSON_GNUC) && (RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,3,0)) && defined(__GXX_EXPERIMENTAL_CXX0X__)) || \
|
|
||||||
(defined(_MSC_VER) && _MSC_VER >= 1700)
|
|
||||||
#define RAPIDJSON_HAS_CXX11_RANGE_FOR 1
|
|
||||||
#else
|
|
||||||
#define RAPIDJSON_HAS_CXX11_RANGE_FOR 0
|
|
||||||
#endif
|
|
||||||
#endif // RAPIDJSON_HAS_CXX11_RANGE_FOR
|
|
||||||
|
|
||||||
//!@endcond
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// new/delete
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_NEW
|
|
||||||
///! customization point for global \c new
|
|
||||||
#define RAPIDJSON_NEW(x) new x
|
|
||||||
#endif
|
|
||||||
#ifndef RAPIDJSON_DELETE
|
|
||||||
///! customization point for global \c delete
|
|
||||||
#define RAPIDJSON_DELETE(x) delete x
|
|
||||||
#endif
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// Type
|
|
||||||
|
|
||||||
/*! \namespace rapidjson
|
|
||||||
\brief main RapidJSON namespace
|
|
||||||
\see RAPIDJSON_NAMESPACE
|
|
||||||
*/
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Type of JSON value
|
|
||||||
enum Type {
|
|
||||||
kNullType = 0, //!< null
|
|
||||||
kFalseType = 1, //!< false
|
|
||||||
kTrueType = 2, //!< true
|
|
||||||
kObjectType = 3, //!< object
|
|
||||||
kArrayType = 4, //!< array
|
|
||||||
kStringType = 5, //!< string
|
|
||||||
kNumberType = 6 //!< number
|
|
||||||
};
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_RAPIDJSON_H_
|
|
||||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
@@ -1,179 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#include "rapidjson.h"
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_STREAM_H_
|
|
||||||
#define RAPIDJSON_STREAM_H_
|
|
||||||
|
|
||||||
#include "encodings.h"
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// Stream
|
|
||||||
|
|
||||||
/*! \class rapidjson::Stream
|
|
||||||
\brief Concept for reading and writing characters.
|
|
||||||
|
|
||||||
For read-only stream, no need to implement PutBegin(), Put(), Flush() and PutEnd().
|
|
||||||
|
|
||||||
For write-only stream, only need to implement Put() and Flush().
|
|
||||||
|
|
||||||
\code
|
|
||||||
concept Stream {
|
|
||||||
typename Ch; //!< Character type of the stream.
|
|
||||||
|
|
||||||
//! Read the current character from stream without moving the read cursor.
|
|
||||||
Ch Peek() const;
|
|
||||||
|
|
||||||
//! Read the current character from stream and moving the read cursor to next character.
|
|
||||||
Ch Take();
|
|
||||||
|
|
||||||
//! Get the current read cursor.
|
|
||||||
//! \return Number of characters read from start.
|
|
||||||
size_t Tell();
|
|
||||||
|
|
||||||
//! Begin writing operation at the current read pointer.
|
|
||||||
//! \return The begin writer pointer.
|
|
||||||
Ch* PutBegin();
|
|
||||||
|
|
||||||
//! Write a character.
|
|
||||||
void Put(Ch c);
|
|
||||||
|
|
||||||
//! Flush the buffer.
|
|
||||||
void Flush();
|
|
||||||
|
|
||||||
//! End the writing operation.
|
|
||||||
//! \param begin The begin write pointer returned by PutBegin().
|
|
||||||
//! \return Number of characters written.
|
|
||||||
size_t PutEnd(Ch* begin);
|
|
||||||
}
|
|
||||||
\endcode
|
|
||||||
*/
|
|
||||||
|
|
||||||
//! Provides additional information for stream.
|
|
||||||
/*!
|
|
||||||
By using traits pattern, this type provides a default configuration for stream.
|
|
||||||
For custom stream, this type can be specialized for other configuration.
|
|
||||||
See TEST(Reader, CustomStringStream) in readertest.cpp for example.
|
|
||||||
*/
|
|
||||||
template<typename Stream>
|
|
||||||
struct StreamTraits {
|
|
||||||
//! Whether to make local copy of stream for optimization during parsing.
|
|
||||||
/*!
|
|
||||||
By default, for safety, streams do not use local copy optimization.
|
|
||||||
Stream that can be copied fast should specialize this, like StreamTraits<StringStream>.
|
|
||||||
*/
|
|
||||||
enum { copyOptimization = 0 };
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Reserve n characters for writing to a stream.
|
|
||||||
template<typename Stream>
|
|
||||||
inline void PutReserve(Stream& stream, size_t count) {
|
|
||||||
(void)stream;
|
|
||||||
(void)count;
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Write character to a stream, presuming buffer is reserved.
|
|
||||||
template<typename Stream>
|
|
||||||
inline void PutUnsafe(Stream& stream, typename Stream::Ch c) {
|
|
||||||
stream.Put(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Put N copies of a character to a stream.
|
|
||||||
template<typename Stream, typename Ch>
|
|
||||||
inline void PutN(Stream& stream, Ch c, size_t n) {
|
|
||||||
PutReserve(stream, n);
|
|
||||||
for (size_t i = 0; i < n; i++)
|
|
||||||
PutUnsafe(stream, c);
|
|
||||||
}
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// StringStream
|
|
||||||
|
|
||||||
//! Read-only string stream.
|
|
||||||
/*! \note implements Stream concept
|
|
||||||
*/
|
|
||||||
template <typename Encoding>
|
|
||||||
struct GenericStringStream {
|
|
||||||
typedef typename Encoding::Ch Ch;
|
|
||||||
|
|
||||||
GenericStringStream(const Ch *src) : src_(src), head_(src) {}
|
|
||||||
|
|
||||||
Ch Peek() const { return *src_; }
|
|
||||||
Ch Take() { return *src_++; }
|
|
||||||
size_t Tell() const { return static_cast<size_t>(src_ - head_); }
|
|
||||||
|
|
||||||
Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
void Put(Ch) { RAPIDJSON_ASSERT(false); }
|
|
||||||
void Flush() { RAPIDJSON_ASSERT(false); }
|
|
||||||
size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
|
|
||||||
|
|
||||||
const Ch* src_; //!< Current read position.
|
|
||||||
const Ch* head_; //!< Original head of the string.
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename Encoding>
|
|
||||||
struct StreamTraits<GenericStringStream<Encoding> > {
|
|
||||||
enum { copyOptimization = 1 };
|
|
||||||
};
|
|
||||||
|
|
||||||
//! String stream with UTF8 encoding.
|
|
||||||
typedef GenericStringStream<UTF8<> > StringStream;
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// InsituStringStream
|
|
||||||
|
|
||||||
//! A read-write string stream.
|
|
||||||
/*! This string stream is particularly designed for in-situ parsing.
|
|
||||||
\note implements Stream concept
|
|
||||||
*/
|
|
||||||
template <typename Encoding>
|
|
||||||
struct GenericInsituStringStream {
|
|
||||||
typedef typename Encoding::Ch Ch;
|
|
||||||
|
|
||||||
GenericInsituStringStream(Ch *src) : src_(src), dst_(0), head_(src) {}
|
|
||||||
|
|
||||||
// Read
|
|
||||||
Ch Peek() { return *src_; }
|
|
||||||
Ch Take() { return *src_++; }
|
|
||||||
size_t Tell() { return static_cast<size_t>(src_ - head_); }
|
|
||||||
|
|
||||||
// Write
|
|
||||||
void Put(Ch c) { RAPIDJSON_ASSERT(dst_ != 0); *dst_++ = c; }
|
|
||||||
|
|
||||||
Ch* PutBegin() { return dst_ = src_; }
|
|
||||||
size_t PutEnd(Ch* begin) { return static_cast<size_t>(dst_ - begin); }
|
|
||||||
void Flush() {}
|
|
||||||
|
|
||||||
Ch* Push(size_t count) { Ch* begin = dst_; dst_ += count; return begin; }
|
|
||||||
void Pop(size_t count) { dst_ -= count; }
|
|
||||||
|
|
||||||
Ch* src_;
|
|
||||||
Ch* dst_;
|
|
||||||
Ch* head_;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename Encoding>
|
|
||||||
struct StreamTraits<GenericInsituStringStream<Encoding> > {
|
|
||||||
enum { copyOptimization = 1 };
|
|
||||||
};
|
|
||||||
|
|
||||||
//! Insitu string stream with UTF8 encoding.
|
|
||||||
typedef GenericInsituStringStream<UTF8<> > InsituStringStream;
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_STREAM_H_
|
|
||||||
@@ -1,117 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_STRINGBUFFER_H_
|
|
||||||
#define RAPIDJSON_STRINGBUFFER_H_
|
|
||||||
|
|
||||||
#include "stream.h"
|
|
||||||
#include "internal/stack.h"
|
|
||||||
|
|
||||||
#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
|
|
||||||
#include <utility> // std::move
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include "internal/stack.h"
|
|
||||||
|
|
||||||
#if defined(__clang__)
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(c++98-compat)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
//! Represents an in-memory output stream.
|
|
||||||
/*!
|
|
||||||
\tparam Encoding Encoding of the stream.
|
|
||||||
\tparam Allocator type for allocating memory buffer.
|
|
||||||
\note implements Stream concept
|
|
||||||
*/
|
|
||||||
template <typename Encoding, typename Allocator = CrtAllocator>
|
|
||||||
class GenericStringBuffer {
|
|
||||||
public:
|
|
||||||
typedef typename Encoding::Ch Ch;
|
|
||||||
|
|
||||||
GenericStringBuffer(Allocator* allocator = 0, size_t capacity = kDefaultCapacity) : stack_(allocator, capacity) {}
|
|
||||||
|
|
||||||
#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
|
|
||||||
GenericStringBuffer(GenericStringBuffer&& rhs) : stack_(std::move(rhs.stack_)) {}
|
|
||||||
GenericStringBuffer& operator=(GenericStringBuffer&& rhs) {
|
|
||||||
if (&rhs != this)
|
|
||||||
stack_ = std::move(rhs.stack_);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
void Put(Ch c) { *stack_.template Push<Ch>() = c; }
|
|
||||||
void PutUnsafe(Ch c) { *stack_.template PushUnsafe<Ch>() = c; }
|
|
||||||
void Flush() {}
|
|
||||||
|
|
||||||
void Clear() { stack_.Clear(); }
|
|
||||||
void ShrinkToFit() {
|
|
||||||
// Push and pop a null terminator. This is safe.
|
|
||||||
*stack_.template Push<Ch>() = '\0';
|
|
||||||
stack_.ShrinkToFit();
|
|
||||||
stack_.template Pop<Ch>(1);
|
|
||||||
}
|
|
||||||
|
|
||||||
void Reserve(size_t count) { stack_.template Reserve<Ch>(count); }
|
|
||||||
Ch* Push(size_t count) { return stack_.template Push<Ch>(count); }
|
|
||||||
Ch* PushUnsafe(size_t count) { return stack_.template PushUnsafe<Ch>(count); }
|
|
||||||
void Pop(size_t count) { stack_.template Pop<Ch>(count); }
|
|
||||||
|
|
||||||
const Ch* GetString() const {
|
|
||||||
// Push and pop a null terminator. This is safe.
|
|
||||||
*stack_.template Push<Ch>() = '\0';
|
|
||||||
stack_.template Pop<Ch>(1);
|
|
||||||
|
|
||||||
return stack_.template Bottom<Ch>();
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t GetSize() const { return stack_.GetSize(); }
|
|
||||||
|
|
||||||
static const size_t kDefaultCapacity = 256;
|
|
||||||
mutable internal::Stack<Allocator> stack_;
|
|
||||||
|
|
||||||
private:
|
|
||||||
// Prohibit copy constructor & assignment operator.
|
|
||||||
GenericStringBuffer(const GenericStringBuffer&);
|
|
||||||
GenericStringBuffer& operator=(const GenericStringBuffer&);
|
|
||||||
};
|
|
||||||
|
|
||||||
//! String buffer with UTF8 encoding
|
|
||||||
typedef GenericStringBuffer<UTF8<> > StringBuffer;
|
|
||||||
|
|
||||||
template<typename Encoding, typename Allocator>
|
|
||||||
inline void PutReserve(GenericStringBuffer<Encoding, Allocator>& stream, size_t count) {
|
|
||||||
stream.Reserve(count);
|
|
||||||
}
|
|
||||||
|
|
||||||
template<typename Encoding, typename Allocator>
|
|
||||||
inline void PutUnsafe(GenericStringBuffer<Encoding, Allocator>& stream, typename Encoding::Ch c) {
|
|
||||||
stream.PutUnsafe(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Implement specialized version of PutN() with memset() for better performance.
|
|
||||||
template<>
|
|
||||||
inline void PutN(GenericStringBuffer<UTF8<> >& stream, char c, size_t n) {
|
|
||||||
std::memset(stream.stack_.Push<char>(n), c, n * sizeof(c));
|
|
||||||
}
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#if defined(__clang__)
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_STRINGBUFFER_H_
|
|
||||||
@@ -1,610 +0,0 @@
|
|||||||
// Tencent is pleased to support the open source community by making RapidJSON available.
|
|
||||||
//
|
|
||||||
// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.
|
|
||||||
//
|
|
||||||
// Licensed under the MIT License (the "License"); you may not use this file except
|
|
||||||
// in compliance with the License. You may obtain a copy of the License at
|
|
||||||
//
|
|
||||||
// http://opensource.org/licenses/MIT
|
|
||||||
//
|
|
||||||
// Unless required by applicable law or agreed to in writing, software distributed
|
|
||||||
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
||||||
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
||||||
// specific language governing permissions and limitations under the License.
|
|
||||||
|
|
||||||
#ifndef RAPIDJSON_WRITER_H_
|
|
||||||
#define RAPIDJSON_WRITER_H_
|
|
||||||
|
|
||||||
#include "stream.h"
|
|
||||||
#include "internal/stack.h"
|
|
||||||
#include "internal/strfunc.h"
|
|
||||||
#include "internal/dtoa.h"
|
|
||||||
#include "internal/itoa.h"
|
|
||||||
#include "stringbuffer.h"
|
|
||||||
#include <new> // placement new
|
|
||||||
|
|
||||||
#if defined(RAPIDJSON_SIMD) && defined(_MSC_VER)
|
|
||||||
#include <intrin.h>
|
|
||||||
#pragma intrinsic(_BitScanForward)
|
|
||||||
#endif
|
|
||||||
#ifdef RAPIDJSON_SSE42
|
|
||||||
#include <nmmintrin.h>
|
|
||||||
#elif defined(RAPIDJSON_SSE2)
|
|
||||||
#include <emmintrin.h>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(4127) // conditional expression is constant
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_PUSH
|
|
||||||
RAPIDJSON_DIAG_OFF(padded)
|
|
||||||
RAPIDJSON_DIAG_OFF(unreachable-code)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_BEGIN
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////
|
|
||||||
// WriteFlag
|
|
||||||
|
|
||||||
/*! \def RAPIDJSON_WRITE_DEFAULT_FLAGS
|
|
||||||
\ingroup RAPIDJSON_CONFIG
|
|
||||||
\brief User-defined kWriteDefaultFlags definition.
|
|
||||||
|
|
||||||
User can define this as any \c WriteFlag combinations.
|
|
||||||
*/
|
|
||||||
#ifndef RAPIDJSON_WRITE_DEFAULT_FLAGS
|
|
||||||
#define RAPIDJSON_WRITE_DEFAULT_FLAGS kWriteNoFlags
|
|
||||||
#endif
|
|
||||||
|
|
||||||
//! Combination of writeFlags
|
|
||||||
enum WriteFlag {
|
|
||||||
kWriteNoFlags = 0, //!< No flags are set.
|
|
||||||
kWriteValidateEncodingFlag = 1, //!< Validate encoding of JSON strings.
|
|
||||||
kWriteNanAndInfFlag = 2, //!< Allow writing of Infinity, -Infinity and NaN.
|
|
||||||
kWriteDefaultFlags = RAPIDJSON_WRITE_DEFAULT_FLAGS //!< Default write flags. Can be customized by defining RAPIDJSON_WRITE_DEFAULT_FLAGS
|
|
||||||
};
|
|
||||||
|
|
||||||
//! JSON writer
|
|
||||||
/*! Writer implements the concept Handler.
|
|
||||||
It generates JSON text by events to an output os.
|
|
||||||
|
|
||||||
User may programmatically calls the functions of a writer to generate JSON text.
|
|
||||||
|
|
||||||
On the other side, a writer can also be passed to objects that generates events,
|
|
||||||
|
|
||||||
for example Reader::Parse() and Document::Accept().
|
|
||||||
|
|
||||||
\tparam OutputStream Type of output stream.
|
|
||||||
\tparam SourceEncoding Encoding of source string.
|
|
||||||
\tparam TargetEncoding Encoding of output stream.
|
|
||||||
\tparam StackAllocator Type of allocator for allocating memory of stack.
|
|
||||||
\note implements Handler concept
|
|
||||||
*/
|
|
||||||
template<typename OutputStream, typename SourceEncoding = UTF8<>, typename TargetEncoding = UTF8<>, typename StackAllocator = CrtAllocator, unsigned writeFlags = kWriteDefaultFlags>
|
|
||||||
class Writer {
|
|
||||||
public:
|
|
||||||
typedef typename SourceEncoding::Ch Ch;
|
|
||||||
|
|
||||||
static const int kDefaultMaxDecimalPlaces = 324;
|
|
||||||
|
|
||||||
//! Constructor
|
|
||||||
/*! \param os Output stream.
|
|
||||||
\param stackAllocator User supplied allocator. If it is null, it will create a private one.
|
|
||||||
\param levelDepth Initial capacity of stack.
|
|
||||||
*/
|
|
||||||
explicit
|
|
||||||
Writer(OutputStream& os, StackAllocator* stackAllocator = 0, size_t levelDepth = kDefaultLevelDepth) :
|
|
||||||
os_(&os), level_stack_(stackAllocator, levelDepth * sizeof(Level)), maxDecimalPlaces_(kDefaultMaxDecimalPlaces), hasRoot_(false) {}
|
|
||||||
|
|
||||||
explicit
|
|
||||||
Writer(StackAllocator* allocator = 0, size_t levelDepth = kDefaultLevelDepth) :
|
|
||||||
os_(0), level_stack_(allocator, levelDepth * sizeof(Level)), maxDecimalPlaces_(kDefaultMaxDecimalPlaces), hasRoot_(false) {}
|
|
||||||
|
|
||||||
//! Reset the writer with a new stream.
|
|
||||||
/*!
|
|
||||||
This function reset the writer with a new stream and default settings,
|
|
||||||
in order to make a Writer object reusable for output multiple JSONs.
|
|
||||||
|
|
||||||
\param os New output stream.
|
|
||||||
\code
|
|
||||||
Writer<OutputStream> writer(os1);
|
|
||||||
writer.StartObject();
|
|
||||||
// ...
|
|
||||||
writer.EndObject();
|
|
||||||
|
|
||||||
writer.Reset(os2);
|
|
||||||
writer.StartObject();
|
|
||||||
// ...
|
|
||||||
writer.EndObject();
|
|
||||||
\endcode
|
|
||||||
*/
|
|
||||||
void Reset(OutputStream& os) {
|
|
||||||
os_ = &os;
|
|
||||||
hasRoot_ = false;
|
|
||||||
level_stack_.Clear();
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Checks whether the output is a complete JSON.
|
|
||||||
/*!
|
|
||||||
A complete JSON has a complete root object or array.
|
|
||||||
*/
|
|
||||||
bool IsComplete() const {
|
|
||||||
return hasRoot_ && level_stack_.Empty();
|
|
||||||
}
|
|
||||||
|
|
||||||
int GetMaxDecimalPlaces() const {
|
|
||||||
return maxDecimalPlaces_;
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Sets the maximum number of decimal places for double output.
|
|
||||||
/*!
|
|
||||||
This setting truncates the output with specified number of decimal places.
|
|
||||||
|
|
||||||
For example,
|
|
||||||
|
|
||||||
\code
|
|
||||||
writer.SetMaxDecimalPlaces(3);
|
|
||||||
writer.StartArray();
|
|
||||||
writer.Double(0.12345); // "0.123"
|
|
||||||
writer.Double(0.0001); // "0.0"
|
|
||||||
writer.Double(1.234567890123456e30); // "1.234567890123456e30" (do not truncate significand for positive exponent)
|
|
||||||
writer.Double(1.23e-4); // "0.0" (do truncate significand for negative exponent)
|
|
||||||
writer.EndArray();
|
|
||||||
\endcode
|
|
||||||
|
|
||||||
The default setting does not truncate any decimal places. You can restore to this setting by calling
|
|
||||||
\code
|
|
||||||
writer.SetMaxDecimalPlaces(Writer::kDefaultMaxDecimalPlaces);
|
|
||||||
\endcode
|
|
||||||
*/
|
|
||||||
void SetMaxDecimalPlaces(int maxDecimalPlaces) {
|
|
||||||
maxDecimalPlaces_ = maxDecimalPlaces;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*!@name Implementation of Handler
|
|
||||||
\see Handler
|
|
||||||
*/
|
|
||||||
//@{
|
|
||||||
|
|
||||||
bool Null() { Prefix(kNullType); return EndValue(WriteNull()); }
|
|
||||||
bool Bool(bool b) { Prefix(b ? kTrueType : kFalseType); return EndValue(WriteBool(b)); }
|
|
||||||
bool Int(int i) { Prefix(kNumberType); return EndValue(WriteInt(i)); }
|
|
||||||
bool Uint(unsigned u) { Prefix(kNumberType); return EndValue(WriteUint(u)); }
|
|
||||||
bool Int64(int64_t i64) { Prefix(kNumberType); return EndValue(WriteInt64(i64)); }
|
|
||||||
bool Uint64(uint64_t u64) { Prefix(kNumberType); return EndValue(WriteUint64(u64)); }
|
|
||||||
|
|
||||||
//! Writes the given \c double value to the stream
|
|
||||||
/*!
|
|
||||||
\param d The value to be written.
|
|
||||||
\return Whether it is succeed.
|
|
||||||
*/
|
|
||||||
bool Double(double d) { Prefix(kNumberType); return EndValue(WriteDouble(d)); }
|
|
||||||
|
|
||||||
bool RawNumber(const Ch* str, SizeType length, bool copy = false) {
|
|
||||||
(void)copy;
|
|
||||||
Prefix(kNumberType);
|
|
||||||
return EndValue(WriteString(str, length));
|
|
||||||
}
|
|
||||||
|
|
||||||
bool String(const Ch* str, SizeType length, bool copy = false) {
|
|
||||||
(void)copy;
|
|
||||||
Prefix(kStringType);
|
|
||||||
return EndValue(WriteString(str, length));
|
|
||||||
}
|
|
||||||
|
|
||||||
#if RAPIDJSON_HAS_STDSTRING
|
|
||||||
bool String(const std::basic_string<Ch>& str) {
|
|
||||||
return String(str.data(), SizeType(str.size()));
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
bool StartObject() {
|
|
||||||
Prefix(kObjectType);
|
|
||||||
new (level_stack_.template Push<Level>()) Level(false);
|
|
||||||
return WriteStartObject();
|
|
||||||
}
|
|
||||||
|
|
||||||
bool Key(const Ch* str, SizeType length, bool copy = false) { return String(str, length, copy); }
|
|
||||||
|
|
||||||
bool EndObject(SizeType memberCount = 0) {
|
|
||||||
(void)memberCount;
|
|
||||||
RAPIDJSON_ASSERT(level_stack_.GetSize() >= sizeof(Level));
|
|
||||||
RAPIDJSON_ASSERT(!level_stack_.template Top<Level>()->inArray);
|
|
||||||
level_stack_.template Pop<Level>(1);
|
|
||||||
return EndValue(WriteEndObject());
|
|
||||||
}
|
|
||||||
|
|
||||||
bool StartArray() {
|
|
||||||
Prefix(kArrayType);
|
|
||||||
new (level_stack_.template Push<Level>()) Level(true);
|
|
||||||
return WriteStartArray();
|
|
||||||
}
|
|
||||||
|
|
||||||
bool EndArray(SizeType elementCount = 0) {
|
|
||||||
(void)elementCount;
|
|
||||||
RAPIDJSON_ASSERT(level_stack_.GetSize() >= sizeof(Level));
|
|
||||||
RAPIDJSON_ASSERT(level_stack_.template Top<Level>()->inArray);
|
|
||||||
level_stack_.template Pop<Level>(1);
|
|
||||||
return EndValue(WriteEndArray());
|
|
||||||
}
|
|
||||||
//@}
|
|
||||||
|
|
||||||
/*! @name Convenience extensions */
|
|
||||||
//@{
|
|
||||||
|
|
||||||
//! Simpler but slower overload.
|
|
||||||
bool String(const Ch* str) { return String(str, internal::StrLen(str)); }
|
|
||||||
bool Key(const Ch* str) { return Key(str, internal::StrLen(str)); }
|
|
||||||
|
|
||||||
//@}
|
|
||||||
|
|
||||||
//! Write a raw JSON value.
|
|
||||||
/*!
|
|
||||||
For user to write a stringified JSON as a value.
|
|
||||||
|
|
||||||
\param json A well-formed JSON value. It should not contain null character within [0, length - 1] range.
|
|
||||||
\param length Length of the json.
|
|
||||||
\param type Type of the root of json.
|
|
||||||
*/
|
|
||||||
bool RawValue(const Ch* json, size_t length, Type type) { Prefix(type); return EndValue(WriteRawValue(json, length)); }
|
|
||||||
|
|
||||||
protected:
|
|
||||||
//! Information for each nested level
|
|
||||||
struct Level {
|
|
||||||
Level(bool inArray_) : valueCount(0), inArray(inArray_) {}
|
|
||||||
size_t valueCount; //!< number of values in this level
|
|
||||||
bool inArray; //!< true if in array, otherwise in object
|
|
||||||
};
|
|
||||||
|
|
||||||
static const size_t kDefaultLevelDepth = 32;
|
|
||||||
|
|
||||||
bool WriteNull() {
|
|
||||||
PutReserve(*os_, 4);
|
|
||||||
PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'u'); PutUnsafe(*os_, 'l'); PutUnsafe(*os_, 'l'); return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool WriteBool(bool b) {
|
|
||||||
if (b) {
|
|
||||||
PutReserve(*os_, 4);
|
|
||||||
PutUnsafe(*os_, 't'); PutUnsafe(*os_, 'r'); PutUnsafe(*os_, 'u'); PutUnsafe(*os_, 'e');
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
PutReserve(*os_, 5);
|
|
||||||
PutUnsafe(*os_, 'f'); PutUnsafe(*os_, 'a'); PutUnsafe(*os_, 'l'); PutUnsafe(*os_, 's'); PutUnsafe(*os_, 'e');
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool WriteInt(int i) {
|
|
||||||
char buffer[11];
|
|
||||||
const char* end = internal::i32toa(i, buffer);
|
|
||||||
PutReserve(*os_, static_cast<size_t>(end - buffer));
|
|
||||||
for (const char* p = buffer; p != end; ++p)
|
|
||||||
PutUnsafe(*os_, static_cast<typename TargetEncoding::Ch>(*p));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool WriteUint(unsigned u) {
|
|
||||||
char buffer[10];
|
|
||||||
const char* end = internal::u32toa(u, buffer);
|
|
||||||
PutReserve(*os_, static_cast<size_t>(end - buffer));
|
|
||||||
for (const char* p = buffer; p != end; ++p)
|
|
||||||
PutUnsafe(*os_, static_cast<typename TargetEncoding::Ch>(*p));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool WriteInt64(int64_t i64) {
|
|
||||||
char buffer[21];
|
|
||||||
const char* end = internal::i64toa(i64, buffer);
|
|
||||||
PutReserve(*os_, static_cast<size_t>(end - buffer));
|
|
||||||
for (const char* p = buffer; p != end; ++p)
|
|
||||||
PutUnsafe(*os_, static_cast<typename TargetEncoding::Ch>(*p));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool WriteUint64(uint64_t u64) {
|
|
||||||
char buffer[20];
|
|
||||||
char* end = internal::u64toa(u64, buffer);
|
|
||||||
PutReserve(*os_, static_cast<size_t>(end - buffer));
|
|
||||||
for (char* p = buffer; p != end; ++p)
|
|
||||||
PutUnsafe(*os_, static_cast<typename TargetEncoding::Ch>(*p));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool WriteDouble(double d) {
|
|
||||||
if (internal::Double(d).IsNanOrInf()) {
|
|
||||||
if (!(writeFlags & kWriteNanAndInfFlag))
|
|
||||||
return false;
|
|
||||||
if (internal::Double(d).IsNan()) {
|
|
||||||
PutReserve(*os_, 3);
|
|
||||||
PutUnsafe(*os_, 'N'); PutUnsafe(*os_, 'a'); PutUnsafe(*os_, 'N');
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (internal::Double(d).Sign()) {
|
|
||||||
PutReserve(*os_, 9);
|
|
||||||
PutUnsafe(*os_, '-');
|
|
||||||
}
|
|
||||||
else
|
|
||||||
PutReserve(*os_, 8);
|
|
||||||
PutUnsafe(*os_, 'I'); PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'f');
|
|
||||||
PutUnsafe(*os_, 'i'); PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'i'); PutUnsafe(*os_, 't'); PutUnsafe(*os_, 'y');
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
char buffer[25];
|
|
||||||
char* end = internal::dtoa(d, buffer, maxDecimalPlaces_);
|
|
||||||
PutReserve(*os_, static_cast<size_t>(end - buffer));
|
|
||||||
for (char* p = buffer; p != end; ++p)
|
|
||||||
PutUnsafe(*os_, static_cast<typename TargetEncoding::Ch>(*p));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool WriteString(const Ch* str, SizeType length) {
|
|
||||||
static const typename TargetEncoding::Ch hexDigits[16] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
|
|
||||||
static const char escape[256] = {
|
|
||||||
#define Z16 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
|
|
||||||
//0 1 2 3 4 5 6 7 8 9 A B C D E F
|
|
||||||
'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'b', 't', 'n', 'u', 'f', 'r', 'u', 'u', // 00
|
|
||||||
'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', // 10
|
|
||||||
0, 0, '"', 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 20
|
|
||||||
Z16, Z16, // 30~4F
|
|
||||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,'\\', 0, 0, 0, // 50
|
|
||||||
Z16, Z16, Z16, Z16, Z16, Z16, Z16, Z16, Z16, Z16 // 60~FF
|
|
||||||
#undef Z16
|
|
||||||
};
|
|
||||||
|
|
||||||
if (TargetEncoding::supportUnicode)
|
|
||||||
PutReserve(*os_, 2 + length * 6); // "\uxxxx..."
|
|
||||||
else
|
|
||||||
PutReserve(*os_, 2 + length * 12); // "\uxxxx\uyyyy..."
|
|
||||||
|
|
||||||
PutUnsafe(*os_, '\"');
|
|
||||||
GenericStringStream<SourceEncoding> is(str);
|
|
||||||
while (ScanWriteUnescapedString(is, length)) {
|
|
||||||
const Ch c = is.Peek();
|
|
||||||
if (!TargetEncoding::supportUnicode && static_cast<unsigned>(c) >= 0x80) {
|
|
||||||
// Unicode escaping
|
|
||||||
unsigned codepoint;
|
|
||||||
if (RAPIDJSON_UNLIKELY(!SourceEncoding::Decode(is, &codepoint)))
|
|
||||||
return false;
|
|
||||||
PutUnsafe(*os_, '\\');
|
|
||||||
PutUnsafe(*os_, 'u');
|
|
||||||
if (codepoint <= 0xD7FF || (codepoint >= 0xE000 && codepoint <= 0xFFFF)) {
|
|
||||||
PutUnsafe(*os_, hexDigits[(codepoint >> 12) & 15]);
|
|
||||||
PutUnsafe(*os_, hexDigits[(codepoint >> 8) & 15]);
|
|
||||||
PutUnsafe(*os_, hexDigits[(codepoint >> 4) & 15]);
|
|
||||||
PutUnsafe(*os_, hexDigits[(codepoint ) & 15]);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
RAPIDJSON_ASSERT(codepoint >= 0x010000 && codepoint <= 0x10FFFF);
|
|
||||||
// Surrogate pair
|
|
||||||
unsigned s = codepoint - 0x010000;
|
|
||||||
unsigned lead = (s >> 10) + 0xD800;
|
|
||||||
unsigned trail = (s & 0x3FF) + 0xDC00;
|
|
||||||
PutUnsafe(*os_, hexDigits[(lead >> 12) & 15]);
|
|
||||||
PutUnsafe(*os_, hexDigits[(lead >> 8) & 15]);
|
|
||||||
PutUnsafe(*os_, hexDigits[(lead >> 4) & 15]);
|
|
||||||
PutUnsafe(*os_, hexDigits[(lead ) & 15]);
|
|
||||||
PutUnsafe(*os_, '\\');
|
|
||||||
PutUnsafe(*os_, 'u');
|
|
||||||
PutUnsafe(*os_, hexDigits[(trail >> 12) & 15]);
|
|
||||||
PutUnsafe(*os_, hexDigits[(trail >> 8) & 15]);
|
|
||||||
PutUnsafe(*os_, hexDigits[(trail >> 4) & 15]);
|
|
||||||
PutUnsafe(*os_, hexDigits[(trail ) & 15]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if ((sizeof(Ch) == 1 || static_cast<unsigned>(c) < 256) && RAPIDJSON_UNLIKELY(escape[static_cast<unsigned char>(c)])) {
|
|
||||||
is.Take();
|
|
||||||
PutUnsafe(*os_, '\\');
|
|
||||||
PutUnsafe(*os_, static_cast<typename TargetEncoding::Ch>(escape[static_cast<unsigned char>(c)]));
|
|
||||||
if (escape[static_cast<unsigned char>(c)] == 'u') {
|
|
||||||
PutUnsafe(*os_, '0');
|
|
||||||
PutUnsafe(*os_, '0');
|
|
||||||
PutUnsafe(*os_, hexDigits[static_cast<unsigned char>(c) >> 4]);
|
|
||||||
PutUnsafe(*os_, hexDigits[static_cast<unsigned char>(c) & 0xF]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (RAPIDJSON_UNLIKELY(!(writeFlags & kWriteValidateEncodingFlag ?
|
|
||||||
Transcoder<SourceEncoding, TargetEncoding>::Validate(is, *os_) :
|
|
||||||
Transcoder<SourceEncoding, TargetEncoding>::TranscodeUnsafe(is, *os_))))
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
PutUnsafe(*os_, '\"');
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool ScanWriteUnescapedString(GenericStringStream<SourceEncoding>& is, size_t length) {
|
|
||||||
return RAPIDJSON_LIKELY(is.Tell() < length);
|
|
||||||
}
|
|
||||||
|
|
||||||
bool WriteStartObject() { os_->Put('{'); return true; }
|
|
||||||
bool WriteEndObject() { os_->Put('}'); return true; }
|
|
||||||
bool WriteStartArray() { os_->Put('['); return true; }
|
|
||||||
bool WriteEndArray() { os_->Put(']'); return true; }
|
|
||||||
|
|
||||||
bool WriteRawValue(const Ch* json, size_t length) {
|
|
||||||
PutReserve(*os_, length);
|
|
||||||
for (size_t i = 0; i < length; i++) {
|
|
||||||
RAPIDJSON_ASSERT(json[i] != '\0');
|
|
||||||
PutUnsafe(*os_, json[i]);
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
void Prefix(Type type) {
|
|
||||||
(void)type;
|
|
||||||
if (RAPIDJSON_LIKELY(level_stack_.GetSize() != 0)) { // this value is not at root
|
|
||||||
Level* level = level_stack_.template Top<Level>();
|
|
||||||
if (level->valueCount > 0) {
|
|
||||||
if (level->inArray)
|
|
||||||
os_->Put(','); // add comma if it is not the first element in array
|
|
||||||
else // in object
|
|
||||||
os_->Put((level->valueCount % 2 == 0) ? ',' : ':');
|
|
||||||
}
|
|
||||||
if (!level->inArray && level->valueCount % 2 == 0)
|
|
||||||
RAPIDJSON_ASSERT(type == kStringType); // if it's in object, then even number should be a name
|
|
||||||
level->valueCount++;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
RAPIDJSON_ASSERT(!hasRoot_); // Should only has one and only one root.
|
|
||||||
hasRoot_ = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Flush the value if it is the top level one.
|
|
||||||
bool EndValue(bool ret) {
|
|
||||||
if (RAPIDJSON_UNLIKELY(level_stack_.Empty())) // end of json text
|
|
||||||
os_->Flush();
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
OutputStream* os_;
|
|
||||||
internal::Stack<StackAllocator> level_stack_;
|
|
||||||
int maxDecimalPlaces_;
|
|
||||||
bool hasRoot_;
|
|
||||||
|
|
||||||
private:
|
|
||||||
// Prohibit copy constructor & assignment operator.
|
|
||||||
Writer(const Writer&);
|
|
||||||
Writer& operator=(const Writer&);
|
|
||||||
};
|
|
||||||
|
|
||||||
// Full specialization for StringStream to prevent memory copying
|
|
||||||
|
|
||||||
template<>
|
|
||||||
inline bool Writer<StringBuffer>::WriteInt(int i) {
|
|
||||||
char *buffer = os_->Push(11);
|
|
||||||
const char* end = internal::i32toa(i, buffer);
|
|
||||||
os_->Pop(static_cast<size_t>(11 - (end - buffer)));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
inline bool Writer<StringBuffer>::WriteUint(unsigned u) {
|
|
||||||
char *buffer = os_->Push(10);
|
|
||||||
const char* end = internal::u32toa(u, buffer);
|
|
||||||
os_->Pop(static_cast<size_t>(10 - (end - buffer)));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
inline bool Writer<StringBuffer>::WriteInt64(int64_t i64) {
|
|
||||||
char *buffer = os_->Push(21);
|
|
||||||
const char* end = internal::i64toa(i64, buffer);
|
|
||||||
os_->Pop(static_cast<size_t>(21 - (end - buffer)));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
inline bool Writer<StringBuffer>::WriteUint64(uint64_t u) {
|
|
||||||
char *buffer = os_->Push(20);
|
|
||||||
const char* end = internal::u64toa(u, buffer);
|
|
||||||
os_->Pop(static_cast<size_t>(20 - (end - buffer)));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
template<>
|
|
||||||
inline bool Writer<StringBuffer>::WriteDouble(double d) {
|
|
||||||
if (internal::Double(d).IsNanOrInf()) {
|
|
||||||
// Note: This code path can only be reached if (RAPIDJSON_WRITE_DEFAULT_FLAGS & kWriteNanAndInfFlag).
|
|
||||||
if (!(kWriteDefaultFlags & kWriteNanAndInfFlag))
|
|
||||||
return false;
|
|
||||||
if (internal::Double(d).IsNan()) {
|
|
||||||
PutReserve(*os_, 3);
|
|
||||||
PutUnsafe(*os_, 'N'); PutUnsafe(*os_, 'a'); PutUnsafe(*os_, 'N');
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (internal::Double(d).Sign()) {
|
|
||||||
PutReserve(*os_, 9);
|
|
||||||
PutUnsafe(*os_, '-');
|
|
||||||
}
|
|
||||||
else
|
|
||||||
PutReserve(*os_, 8);
|
|
||||||
PutUnsafe(*os_, 'I'); PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'f');
|
|
||||||
PutUnsafe(*os_, 'i'); PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'i'); PutUnsafe(*os_, 't'); PutUnsafe(*os_, 'y');
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
char *buffer = os_->Push(25);
|
|
||||||
char* end = internal::dtoa(d, buffer, maxDecimalPlaces_);
|
|
||||||
os_->Pop(static_cast<size_t>(25 - (end - buffer)));
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
#if defined(RAPIDJSON_SSE2) || defined(RAPIDJSON_SSE42)
|
|
||||||
template<>
|
|
||||||
inline bool Writer<StringBuffer>::ScanWriteUnescapedString(StringStream& is, size_t length) {
|
|
||||||
if (length < 16)
|
|
||||||
return RAPIDJSON_LIKELY(is.Tell() < length);
|
|
||||||
|
|
||||||
if (!RAPIDJSON_LIKELY(is.Tell() < length))
|
|
||||||
return false;
|
|
||||||
|
|
||||||
const char* p = is.src_;
|
|
||||||
const char* end = is.head_ + length;
|
|
||||||
const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
|
|
||||||
const char* endAligned = reinterpret_cast<const char*>(reinterpret_cast<size_t>(end) & static_cast<size_t>(~15));
|
|
||||||
if (nextAligned > end)
|
|
||||||
return true;
|
|
||||||
|
|
||||||
while (p != nextAligned)
|
|
||||||
if (*p < 0x20 || *p == '\"' || *p == '\\') {
|
|
||||||
is.src_ = p;
|
|
||||||
return RAPIDJSON_LIKELY(is.Tell() < length);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
os_->PutUnsafe(*p++);
|
|
||||||
|
|
||||||
// The rest of string using SIMD
|
|
||||||
static const char dquote[16] = { '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"' };
|
|
||||||
static const char bslash[16] = { '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\' };
|
|
||||||
static const char space[16] = { 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19, 0x19 };
|
|
||||||
const __m128i dq = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&dquote[0]));
|
|
||||||
const __m128i bs = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&bslash[0]));
|
|
||||||
const __m128i sp = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&space[0]));
|
|
||||||
|
|
||||||
for (; p != endAligned; p += 16) {
|
|
||||||
const __m128i s = _mm_load_si128(reinterpret_cast<const __m128i *>(p));
|
|
||||||
const __m128i t1 = _mm_cmpeq_epi8(s, dq);
|
|
||||||
const __m128i t2 = _mm_cmpeq_epi8(s, bs);
|
|
||||||
const __m128i t3 = _mm_cmpeq_epi8(_mm_max_epu8(s, sp), sp); // s < 0x20 <=> max(s, 0x19) == 0x19
|
|
||||||
const __m128i x = _mm_or_si128(_mm_or_si128(t1, t2), t3);
|
|
||||||
unsigned short r = static_cast<unsigned short>(_mm_movemask_epi8(x));
|
|
||||||
if (RAPIDJSON_UNLIKELY(r != 0)) { // some of characters is escaped
|
|
||||||
SizeType len;
|
|
||||||
#ifdef _MSC_VER // Find the index of first escaped
|
|
||||||
unsigned long offset;
|
|
||||||
_BitScanForward(&offset, r);
|
|
||||||
len = offset;
|
|
||||||
#else
|
|
||||||
len = static_cast<SizeType>(__builtin_ffs(r) - 1);
|
|
||||||
#endif
|
|
||||||
char* q = reinterpret_cast<char*>(os_->PushUnsafe(len));
|
|
||||||
for (size_t i = 0; i < len; i++)
|
|
||||||
q[i] = p[i];
|
|
||||||
|
|
||||||
p += len;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
_mm_storeu_si128(reinterpret_cast<__m128i *>(os_->PushUnsafe(16)), s);
|
|
||||||
}
|
|
||||||
|
|
||||||
is.src_ = p;
|
|
||||||
return RAPIDJSON_LIKELY(is.Tell() < length);
|
|
||||||
}
|
|
||||||
#endif // defined(RAPIDJSON_SSE2) || defined(RAPIDJSON_SSE42)
|
|
||||||
|
|
||||||
RAPIDJSON_NAMESPACE_END
|
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef __clang__
|
|
||||||
RAPIDJSON_DIAG_POP
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // RAPIDJSON_RAPIDJSON_H_
|
|
||||||
@@ -1,137 +0,0 @@
|
|||||||
#include "rpc_connection.h"
|
|
||||||
#include "serialization.h"
|
|
||||||
|
|
||||||
#include <atomic>
|
|
||||||
|
|
||||||
static const int RpcVersion = 1;
|
|
||||||
static RpcConnection Instance;
|
|
||||||
|
|
||||||
/*static*/ RpcConnection* RpcConnection::Create(const char* applicationId)
|
|
||||||
{
|
|
||||||
Instance.connection = BaseConnection::Create();
|
|
||||||
StringCopy(Instance.appId, applicationId);
|
|
||||||
return &Instance;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*static*/ void RpcConnection::Destroy(RpcConnection*& c)
|
|
||||||
{
|
|
||||||
c->Close();
|
|
||||||
BaseConnection::Destroy(c->connection);
|
|
||||||
c = nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
void RpcConnection::Open()
|
|
||||||
{
|
|
||||||
if (state == State::Connected) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (state == State::Disconnected && !connection->Open()) {
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (state == State::SentHandshake) {
|
|
||||||
JsonDocument message;
|
|
||||||
if (Read(message)) {
|
|
||||||
auto cmd = GetStrMember(&message, "cmd");
|
|
||||||
auto evt = GetStrMember(&message, "evt");
|
|
||||||
if (cmd && evt && !strcmp(cmd, "DISPATCH") && !strcmp(evt, "READY")) {
|
|
||||||
state = State::Connected;
|
|
||||||
if (onConnect) {
|
|
||||||
onConnect(message);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
sendFrame.opcode = Opcode::Handshake;
|
|
||||||
sendFrame.length = (uint32_t)JsonWriteHandshakeObj(
|
|
||||||
sendFrame.message, sizeof(sendFrame.message), RpcVersion, appId);
|
|
||||||
|
|
||||||
if (connection->Write(&sendFrame, sizeof(MessageFrameHeader) + sendFrame.length)) {
|
|
||||||
state = State::SentHandshake;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
Close();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void RpcConnection::Close()
|
|
||||||
{
|
|
||||||
if (onDisconnect && (state == State::Connected || state == State::SentHandshake)) {
|
|
||||||
onDisconnect(lastErrorCode, lastErrorMessage);
|
|
||||||
}
|
|
||||||
connection->Close();
|
|
||||||
state = State::Disconnected;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool RpcConnection::Write(const void* data, size_t length)
|
|
||||||
{
|
|
||||||
sendFrame.opcode = Opcode::Frame;
|
|
||||||
memcpy(sendFrame.message, data, length);
|
|
||||||
sendFrame.length = (uint32_t)length;
|
|
||||||
if (!connection->Write(&sendFrame, sizeof(MessageFrameHeader) + length)) {
|
|
||||||
Close();
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool RpcConnection::Read(JsonDocument& message)
|
|
||||||
{
|
|
||||||
if (state != State::Connected && state != State::SentHandshake) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
MessageFrame readFrame;
|
|
||||||
for (;;) {
|
|
||||||
bool didRead = connection->Read(&readFrame, sizeof(MessageFrameHeader));
|
|
||||||
if (!didRead) {
|
|
||||||
if (!connection->isOpen) {
|
|
||||||
lastErrorCode = (int)ErrorCode::PipeClosed;
|
|
||||||
StringCopy(lastErrorMessage, "Pipe closed");
|
|
||||||
Close();
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (readFrame.length > 0) {
|
|
||||||
didRead = connection->Read(readFrame.message, readFrame.length);
|
|
||||||
if (!didRead) {
|
|
||||||
lastErrorCode = (int)ErrorCode::ReadCorrupt;
|
|
||||||
StringCopy(lastErrorMessage, "Partial data in frame");
|
|
||||||
Close();
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
readFrame.message[readFrame.length] = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
switch (readFrame.opcode) {
|
|
||||||
case Opcode::Close: {
|
|
||||||
message.ParseInsitu(readFrame.message);
|
|
||||||
lastErrorCode = GetIntMember(&message, "code");
|
|
||||||
StringCopy(lastErrorMessage, GetStrMember(&message, "message", ""));
|
|
||||||
Close();
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
case Opcode::Frame:
|
|
||||||
message.ParseInsitu(readFrame.message);
|
|
||||||
return true;
|
|
||||||
case Opcode::Ping:
|
|
||||||
readFrame.opcode = Opcode::Pong;
|
|
||||||
if (!connection->Write(&readFrame, sizeof(MessageFrameHeader) + readFrame.length)) {
|
|
||||||
Close();
|
|
||||||
}
|
|
||||||
break;
|
|
||||||
case Opcode::Pong:
|
|
||||||
break;
|
|
||||||
case Opcode::Handshake:
|
|
||||||
default:
|
|
||||||
// something bad happened
|
|
||||||
lastErrorCode = (int)ErrorCode::ReadCorrupt;
|
|
||||||
StringCopy(lastErrorMessage, "Bad ipc frame");
|
|
||||||
Close();
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@@ -1,59 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "connection.h"
|
|
||||||
#include "serialization.h"
|
|
||||||
|
|
||||||
// I took this from the buffer size libuv uses for named pipes; I suspect ours would usually be much
|
|
||||||
// smaller.
|
|
||||||
constexpr size_t MaxRpcFrameSize = 64 * 1024;
|
|
||||||
|
|
||||||
struct RpcConnection {
|
|
||||||
enum class ErrorCode : int {
|
|
||||||
Success = 0,
|
|
||||||
PipeClosed = 1,
|
|
||||||
ReadCorrupt = 2,
|
|
||||||
};
|
|
||||||
|
|
||||||
enum class Opcode : uint32_t {
|
|
||||||
Handshake = 0,
|
|
||||||
Frame = 1,
|
|
||||||
Close = 2,
|
|
||||||
Ping = 3,
|
|
||||||
Pong = 4,
|
|
||||||
};
|
|
||||||
|
|
||||||
struct MessageFrameHeader {
|
|
||||||
Opcode opcode;
|
|
||||||
uint32_t length;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct MessageFrame : public MessageFrameHeader {
|
|
||||||
char message[MaxRpcFrameSize - sizeof(MessageFrameHeader)];
|
|
||||||
};
|
|
||||||
|
|
||||||
enum class State : uint32_t {
|
|
||||||
Disconnected,
|
|
||||||
SentHandshake,
|
|
||||||
AwaitingResponse,
|
|
||||||
Connected,
|
|
||||||
};
|
|
||||||
|
|
||||||
BaseConnection* connection{nullptr};
|
|
||||||
State state{State::Disconnected};
|
|
||||||
void (*onConnect)(JsonDocument& message){nullptr};
|
|
||||||
void (*onDisconnect)(int errorCode, const char* message){nullptr};
|
|
||||||
char appId[64]{};
|
|
||||||
int lastErrorCode{0};
|
|
||||||
char lastErrorMessage[256]{};
|
|
||||||
RpcConnection::MessageFrame sendFrame;
|
|
||||||
|
|
||||||
static RpcConnection* Create(const char* applicationId);
|
|
||||||
static void Destroy(RpcConnection*&);
|
|
||||||
|
|
||||||
inline bool IsOpen() const { return state == State::Connected; }
|
|
||||||
|
|
||||||
void Open();
|
|
||||||
void Close();
|
|
||||||
bool Write(const void* data, size_t length);
|
|
||||||
bool Read(JsonDocument& message);
|
|
||||||
};
|
|
||||||
@@ -1,250 +0,0 @@
|
|||||||
#include "serialization.h"
|
|
||||||
#include "connection.h"
|
|
||||||
#include "discord_rpc.h"
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
void NumberToString(char* dest, T number)
|
|
||||||
{
|
|
||||||
if (!number) {
|
|
||||||
*dest++ = '0';
|
|
||||||
*dest++ = 0;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
if (number < 0) {
|
|
||||||
*dest++ = '-';
|
|
||||||
number = -number;
|
|
||||||
}
|
|
||||||
char temp[32];
|
|
||||||
int place = 0;
|
|
||||||
while (number) {
|
|
||||||
auto digit = number % 10;
|
|
||||||
number = number / 10;
|
|
||||||
temp[place++] = '0' + (char)digit;
|
|
||||||
}
|
|
||||||
for (--place; place >= 0; --place) {
|
|
||||||
*dest++ = temp[place];
|
|
||||||
}
|
|
||||||
*dest = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
// it's ever so slightly faster to not have to strlen the key
|
|
||||||
template <typename T>
|
|
||||||
void WriteKey(JsonWriter& w, T& k)
|
|
||||||
{
|
|
||||||
w.Key(k, sizeof(T) - 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
struct WriteObject {
|
|
||||||
JsonWriter& writer;
|
|
||||||
WriteObject(JsonWriter& w)
|
|
||||||
: writer(w)
|
|
||||||
{
|
|
||||||
writer.StartObject();
|
|
||||||
}
|
|
||||||
template <typename T>
|
|
||||||
WriteObject(JsonWriter& w, T& name)
|
|
||||||
: writer(w)
|
|
||||||
{
|
|
||||||
WriteKey(writer, name);
|
|
||||||
writer.StartObject();
|
|
||||||
}
|
|
||||||
~WriteObject() { writer.EndObject(); }
|
|
||||||
};
|
|
||||||
|
|
||||||
struct WriteArray {
|
|
||||||
JsonWriter& writer;
|
|
||||||
template <typename T>
|
|
||||||
WriteArray(JsonWriter& w, T& name)
|
|
||||||
: writer(w)
|
|
||||||
{
|
|
||||||
WriteKey(writer, name);
|
|
||||||
writer.StartArray();
|
|
||||||
}
|
|
||||||
~WriteArray() { writer.EndArray(); }
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
void WriteOptionalString(JsonWriter& w, T& k, const char* value)
|
|
||||||
{
|
|
||||||
if (value && value[0]) {
|
|
||||||
w.Key(k, sizeof(T) - 1);
|
|
||||||
w.String(value);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static void JsonWriteNonce(JsonWriter& writer, int nonce)
|
|
||||||
{
|
|
||||||
WriteKey(writer, "nonce");
|
|
||||||
char nonceBuffer[32];
|
|
||||||
NumberToString(nonceBuffer, nonce);
|
|
||||||
writer.String(nonceBuffer);
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t JsonWriteRichPresenceObj(char* dest,
|
|
||||||
size_t maxLen,
|
|
||||||
int nonce,
|
|
||||||
int pid,
|
|
||||||
const DiscordRichPresence* presence)
|
|
||||||
{
|
|
||||||
JsonWriter writer(dest, maxLen);
|
|
||||||
|
|
||||||
{
|
|
||||||
WriteObject top(writer);
|
|
||||||
|
|
||||||
JsonWriteNonce(writer, nonce);
|
|
||||||
|
|
||||||
WriteKey(writer, "cmd");
|
|
||||||
writer.String("SET_ACTIVITY");
|
|
||||||
|
|
||||||
{
|
|
||||||
WriteObject args(writer, "args");
|
|
||||||
|
|
||||||
WriteKey(writer, "pid");
|
|
||||||
writer.Int(pid);
|
|
||||||
|
|
||||||
if (presence != nullptr) {
|
|
||||||
WriteObject activity(writer, "activity");
|
|
||||||
|
|
||||||
WriteOptionalString(writer, "state", presence->state);
|
|
||||||
WriteOptionalString(writer, "details", presence->details);
|
|
||||||
|
|
||||||
if (presence->startTimestamp || presence->endTimestamp) {
|
|
||||||
WriteObject timestamps(writer, "timestamps");
|
|
||||||
|
|
||||||
if (presence->startTimestamp) {
|
|
||||||
WriteKey(writer, "start");
|
|
||||||
writer.Int64(presence->startTimestamp);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (presence->endTimestamp) {
|
|
||||||
WriteKey(writer, "end");
|
|
||||||
writer.Int64(presence->endTimestamp);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if ((presence->largeImageKey && presence->largeImageKey[0]) ||
|
|
||||||
(presence->largeImageText && presence->largeImageText[0]) ||
|
|
||||||
(presence->smallImageKey && presence->smallImageKey[0]) ||
|
|
||||||
(presence->smallImageText && presence->smallImageText[0])) {
|
|
||||||
WriteObject assets(writer, "assets");
|
|
||||||
WriteOptionalString(writer, "large_image", presence->largeImageKey);
|
|
||||||
WriteOptionalString(writer, "large_text", presence->largeImageText);
|
|
||||||
WriteOptionalString(writer, "small_image", presence->smallImageKey);
|
|
||||||
WriteOptionalString(writer, "small_text", presence->smallImageText);
|
|
||||||
}
|
|
||||||
|
|
||||||
if ((presence->partyId && presence->partyId[0]) || presence->partySize ||
|
|
||||||
presence->partyMax || presence->partyPrivacy) {
|
|
||||||
WriteObject party(writer, "party");
|
|
||||||
WriteOptionalString(writer, "id", presence->partyId);
|
|
||||||
if (presence->partySize && presence->partyMax) {
|
|
||||||
WriteArray size(writer, "size");
|
|
||||||
writer.Int(presence->partySize);
|
|
||||||
writer.Int(presence->partyMax);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (presence->partyPrivacy) {
|
|
||||||
WriteKey(writer, "privacy");
|
|
||||||
writer.Int(presence->partyPrivacy);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if ((presence->matchSecret && presence->matchSecret[0]) ||
|
|
||||||
(presence->joinSecret && presence->joinSecret[0]) ||
|
|
||||||
(presence->spectateSecret && presence->spectateSecret[0])) {
|
|
||||||
WriteObject secrets(writer, "secrets");
|
|
||||||
WriteOptionalString(writer, "match", presence->matchSecret);
|
|
||||||
WriteOptionalString(writer, "join", presence->joinSecret);
|
|
||||||
WriteOptionalString(writer, "spectate", presence->spectateSecret);
|
|
||||||
}
|
|
||||||
|
|
||||||
writer.Key("instance");
|
|
||||||
writer.Bool(presence->instance != 0);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return writer.Size();
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t JsonWriteHandshakeObj(char* dest, size_t maxLen, int version, const char* applicationId)
|
|
||||||
{
|
|
||||||
JsonWriter writer(dest, maxLen);
|
|
||||||
|
|
||||||
{
|
|
||||||
WriteObject obj(writer);
|
|
||||||
WriteKey(writer, "v");
|
|
||||||
writer.Int(version);
|
|
||||||
WriteKey(writer, "client_id");
|
|
||||||
writer.String(applicationId);
|
|
||||||
}
|
|
||||||
|
|
||||||
return writer.Size();
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t JsonWriteSubscribeCommand(char* dest, size_t maxLen, int nonce, const char* evtName)
|
|
||||||
{
|
|
||||||
JsonWriter writer(dest, maxLen);
|
|
||||||
|
|
||||||
{
|
|
||||||
WriteObject obj(writer);
|
|
||||||
|
|
||||||
JsonWriteNonce(writer, nonce);
|
|
||||||
|
|
||||||
WriteKey(writer, "cmd");
|
|
||||||
writer.String("SUBSCRIBE");
|
|
||||||
|
|
||||||
WriteKey(writer, "evt");
|
|
||||||
writer.String(evtName);
|
|
||||||
}
|
|
||||||
|
|
||||||
return writer.Size();
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t JsonWriteUnsubscribeCommand(char* dest, size_t maxLen, int nonce, const char* evtName)
|
|
||||||
{
|
|
||||||
JsonWriter writer(dest, maxLen);
|
|
||||||
|
|
||||||
{
|
|
||||||
WriteObject obj(writer);
|
|
||||||
|
|
||||||
JsonWriteNonce(writer, nonce);
|
|
||||||
|
|
||||||
WriteKey(writer, "cmd");
|
|
||||||
writer.String("UNSUBSCRIBE");
|
|
||||||
|
|
||||||
WriteKey(writer, "evt");
|
|
||||||
writer.String(evtName);
|
|
||||||
}
|
|
||||||
|
|
||||||
return writer.Size();
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t JsonWriteJoinReply(char* dest, size_t maxLen, const char* userId, int reply, int nonce)
|
|
||||||
{
|
|
||||||
JsonWriter writer(dest, maxLen);
|
|
||||||
|
|
||||||
{
|
|
||||||
WriteObject obj(writer);
|
|
||||||
|
|
||||||
WriteKey(writer, "cmd");
|
|
||||||
if (reply == DISCORD_REPLY_YES) {
|
|
||||||
writer.String("SEND_ACTIVITY_JOIN_INVITE");
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
writer.String("CLOSE_ACTIVITY_JOIN_REQUEST");
|
|
||||||
}
|
|
||||||
|
|
||||||
WriteKey(writer, "args");
|
|
||||||
{
|
|
||||||
WriteObject args(writer);
|
|
||||||
|
|
||||||
WriteKey(writer, "user_id");
|
|
||||||
writer.String(userId);
|
|
||||||
}
|
|
||||||
|
|
||||||
JsonWriteNonce(writer, nonce);
|
|
||||||
}
|
|
||||||
|
|
||||||
return writer.Size();
|
|
||||||
}
|
|
||||||
@@ -1,201 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include <stdint.h>
|
|
||||||
|
|
||||||
#include "rapidjson/document.h"
|
|
||||||
#include "rapidjson/stringbuffer.h"
|
|
||||||
#include "rapidjson/writer.h"
|
|
||||||
|
|
||||||
// if only there was a standard library function for this
|
|
||||||
template <size_t Len>
|
|
||||||
inline size_t StringCopy(char (&dest)[Len], const char* src)
|
|
||||||
{
|
|
||||||
if (!src || !Len) {
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
size_t copied;
|
|
||||||
char* out = dest;
|
|
||||||
for (copied = 1; *src && copied < Len; ++copied) {
|
|
||||||
*out++ = *src++;
|
|
||||||
}
|
|
||||||
*out = 0;
|
|
||||||
return copied - 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t JsonWriteHandshakeObj(char* dest, size_t maxLen, int version, const char* applicationId);
|
|
||||||
|
|
||||||
// Commands
|
|
||||||
struct DiscordRichPresence;
|
|
||||||
size_t JsonWriteRichPresenceObj(char* dest,
|
|
||||||
size_t maxLen,
|
|
||||||
int nonce,
|
|
||||||
int pid,
|
|
||||||
const DiscordRichPresence* presence);
|
|
||||||
size_t JsonWriteSubscribeCommand(char* dest, size_t maxLen, int nonce, const char* evtName);
|
|
||||||
|
|
||||||
size_t JsonWriteUnsubscribeCommand(char* dest, size_t maxLen, int nonce, const char* evtName);
|
|
||||||
|
|
||||||
size_t JsonWriteJoinReply(char* dest, size_t maxLen, const char* userId, int reply, int nonce);
|
|
||||||
|
|
||||||
// I want to use as few allocations as I can get away with, and to do that with RapidJson, you need
|
|
||||||
// to supply some of your own allocators for stuff rather than use the defaults
|
|
||||||
|
|
||||||
class LinearAllocator {
|
|
||||||
public:
|
|
||||||
char* buffer_;
|
|
||||||
char* end_;
|
|
||||||
LinearAllocator()
|
|
||||||
{
|
|
||||||
assert(0); // needed for some default case in rapidjson, should not use
|
|
||||||
}
|
|
||||||
LinearAllocator(char* buffer, size_t size)
|
|
||||||
: buffer_(buffer)
|
|
||||||
, end_(buffer + size)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
static const bool kNeedFree = false;
|
|
||||||
void* Malloc(size_t size)
|
|
||||||
{
|
|
||||||
char* res = buffer_;
|
|
||||||
buffer_ += size;
|
|
||||||
if (buffer_ > end_) {
|
|
||||||
buffer_ = res;
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
return res;
|
|
||||||
}
|
|
||||||
void* Realloc(void* originalPtr, size_t originalSize, size_t newSize)
|
|
||||||
{
|
|
||||||
if (newSize == 0) {
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
// allocate how much you need in the first place
|
|
||||||
assert(!originalPtr && !originalSize);
|
|
||||||
// unused parameter warning
|
|
||||||
(void)(originalPtr);
|
|
||||||
(void)(originalSize);
|
|
||||||
return Malloc(newSize);
|
|
||||||
}
|
|
||||||
static void Free(void* ptr)
|
|
||||||
{
|
|
||||||
/* shrug */
|
|
||||||
(void)ptr;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
template <size_t Size>
|
|
||||||
class FixedLinearAllocator : public LinearAllocator {
|
|
||||||
public:
|
|
||||||
char fixedBuffer_[Size];
|
|
||||||
FixedLinearAllocator()
|
|
||||||
: LinearAllocator(fixedBuffer_, Size)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
static const bool kNeedFree = false;
|
|
||||||
};
|
|
||||||
|
|
||||||
// wonder why this isn't a thing already, maybe I missed it
|
|
||||||
class DirectStringBuffer {
|
|
||||||
public:
|
|
||||||
using Ch = char;
|
|
||||||
char* buffer_;
|
|
||||||
char* end_;
|
|
||||||
char* current_;
|
|
||||||
|
|
||||||
DirectStringBuffer(char* buffer, size_t maxLen)
|
|
||||||
: buffer_(buffer)
|
|
||||||
, end_(buffer + maxLen)
|
|
||||||
, current_(buffer)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
void Put(char c)
|
|
||||||
{
|
|
||||||
if (current_ < end_) {
|
|
||||||
*current_++ = c;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
void Flush() {}
|
|
||||||
size_t GetSize() const { return (size_t)(current_ - buffer_); }
|
|
||||||
};
|
|
||||||
|
|
||||||
using MallocAllocator = rapidjson::CrtAllocator;
|
|
||||||
using PoolAllocator = rapidjson::MemoryPoolAllocator<MallocAllocator>;
|
|
||||||
using UTF8 = rapidjson::UTF8<char>;
|
|
||||||
// Writer appears to need about 16 bytes per nested object level (with 64bit size_t)
|
|
||||||
using StackAllocator = FixedLinearAllocator<2048>;
|
|
||||||
constexpr size_t WriterNestingLevels = 2048 / (2 * sizeof(size_t));
|
|
||||||
using JsonWriterBase =
|
|
||||||
rapidjson::Writer<DirectStringBuffer, UTF8, UTF8, StackAllocator, rapidjson::kWriteNoFlags>;
|
|
||||||
class JsonWriter : public JsonWriterBase {
|
|
||||||
public:
|
|
||||||
DirectStringBuffer stringBuffer_;
|
|
||||||
StackAllocator stackAlloc_;
|
|
||||||
|
|
||||||
JsonWriter(char* dest, size_t maxLen)
|
|
||||||
: JsonWriterBase(stringBuffer_, &stackAlloc_, WriterNestingLevels)
|
|
||||||
, stringBuffer_(dest, maxLen)
|
|
||||||
, stackAlloc_()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t Size() const { return stringBuffer_.GetSize(); }
|
|
||||||
};
|
|
||||||
|
|
||||||
using JsonDocumentBase = rapidjson::GenericDocument<UTF8, PoolAllocator, StackAllocator>;
|
|
||||||
class JsonDocument : public JsonDocumentBase {
|
|
||||||
public:
|
|
||||||
static const int kDefaultChunkCapacity = 32 * 1024;
|
|
||||||
// json parser will use this buffer first, then allocate more if needed; I seriously doubt we
|
|
||||||
// send any messages that would use all of this, though.
|
|
||||||
char parseBuffer_[32 * 1024];
|
|
||||||
MallocAllocator mallocAllocator_;
|
|
||||||
PoolAllocator poolAllocator_;
|
|
||||||
StackAllocator stackAllocator_;
|
|
||||||
JsonDocument()
|
|
||||||
: JsonDocumentBase(rapidjson::kObjectType,
|
|
||||||
&poolAllocator_,
|
|
||||||
sizeof(stackAllocator_.fixedBuffer_),
|
|
||||||
&stackAllocator_)
|
|
||||||
, poolAllocator_(parseBuffer_, sizeof(parseBuffer_), kDefaultChunkCapacity, &mallocAllocator_)
|
|
||||||
, stackAllocator_()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
using JsonValue = rapidjson::GenericValue<UTF8, PoolAllocator>;
|
|
||||||
|
|
||||||
inline JsonValue* GetObjMember(JsonValue* obj, const char* name)
|
|
||||||
{
|
|
||||||
if (obj) {
|
|
||||||
auto member = obj->FindMember(name);
|
|
||||||
if (member != obj->MemberEnd() && member->value.IsObject()) {
|
|
||||||
return &member->value;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline int GetIntMember(JsonValue* obj, const char* name, int notFoundDefault = 0)
|
|
||||||
{
|
|
||||||
if (obj) {
|
|
||||||
auto member = obj->FindMember(name);
|
|
||||||
if (member != obj->MemberEnd() && member->value.IsInt()) {
|
|
||||||
return member->value.GetInt();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return notFoundDefault;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline const char* GetStrMember(JsonValue* obj,
|
|
||||||
const char* name,
|
|
||||||
const char* notFoundDefault = nullptr)
|
|
||||||
{
|
|
||||||
if (obj) {
|
|
||||||
auto member = obj->FindMember(name);
|
|
||||||
if (member != obj->MemberEnd() && member->value.IsString()) {
|
|
||||||
return member->value.GetString();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return notFoundDefault;
|
|
||||||
}
|
|
||||||
@@ -14,7 +14,6 @@
|
|||||||
#include "window/Display.h"
|
#include "window/Display.h"
|
||||||
#include "updater/Updater.h"
|
#include "updater/Updater.h"
|
||||||
#include "misc/Backward.hpp"
|
#include "misc/Backward.hpp"
|
||||||
#include "misc/DiscordRPC.h"
|
|
||||||
|
|
||||||
#ifdef __ANDROID__
|
#ifdef __ANDROID__
|
||||||
extern "C"
|
extern "C"
|
||||||
@@ -26,9 +25,6 @@ int main(int argc, const char* args[]) {
|
|||||||
backward::SignalHandling sh;
|
backward::SignalHandling sh;
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
// start discord rpc
|
|
||||||
td::utils::InitDiscordRPC();
|
|
||||||
|
|
||||||
// remove the outdated binary
|
// remove the outdated binary
|
||||||
td::utils::Updater::RemoveOldFile();
|
td::utils::Updater::RemoveOldFile();
|
||||||
|
|
||||||
@@ -37,10 +33,7 @@ int main(int argc, const char* args[]) {
|
|||||||
Display::PollEvents();
|
Display::PollEvents();
|
||||||
Display::Render();
|
Display::Render();
|
||||||
Display::Update();
|
Display::Update();
|
||||||
td::utils::UpdateDiscordRPC();
|
|
||||||
}
|
}
|
||||||
|
|
||||||
Display::Destroy();
|
Display::Destroy();
|
||||||
td::utils::ShutdownDiscordRPC();
|
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
@@ -1,6 +1,8 @@
|
|||||||
#include "game/World.h"
|
#include "game/World.h"
|
||||||
#include "protocol/PacketDispatcher.h"
|
#include "protocol/PacketDispatcher.h"
|
||||||
#include "protocol/Protocol.h"
|
#include "protocol/Protocol.h"
|
||||||
|
#include "protocol/packets/WorldBeginDataPacket.h"
|
||||||
|
#include "protocol/packets/WorldDataPacket.h"
|
||||||
#include "game/BaseGame.h"
|
#include "game/BaseGame.h"
|
||||||
#include "misc/Random.h"
|
#include "misc/Random.h"
|
||||||
#include "misc/Compression.h"
|
#include "misc/Compression.h"
|
||||||
|
|||||||
@@ -1,6 +1,12 @@
|
|||||||
#include "game/client/Client.h"
|
#include "game/client/Client.h"
|
||||||
#include "misc/Format.h"
|
#include "misc/Format.h"
|
||||||
|
|
||||||
|
#include "protocol/packets/DisconnectPacket.h"
|
||||||
|
#include "protocol/packets/PlaceTowerPacket.h"
|
||||||
|
#include "protocol/packets/RemoveTowerPacket.h"
|
||||||
|
#include "protocol/packets/SelectTeamPacket.h"
|
||||||
|
#include "protocol/packets/UpgradeTowerPacket.h"
|
||||||
|
|
||||||
namespace td {
|
namespace td {
|
||||||
namespace client {
|
namespace client {
|
||||||
|
|
||||||
|
|||||||
@@ -1,6 +1,12 @@
|
|||||||
#include "game/client/ClientConnexion.h"
|
#include "game/client/ClientConnexion.h"
|
||||||
#include "render/WorldRenderer.h"
|
#include "render/WorldRenderer.h"
|
||||||
|
|
||||||
|
#include "protocol/packets/ConnectionInfoPacket.h"
|
||||||
|
#include "protocol/packets/DisconnectPacket.h"
|
||||||
|
#include "protocol/packets/KeepAlivePacket.h"
|
||||||
|
#include "protocol/packets/PlayerLoginPacket.h"
|
||||||
|
#include "protocol/packets/ServerTpsPacket.h"
|
||||||
|
|
||||||
namespace td {
|
namespace td {
|
||||||
namespace client {
|
namespace client {
|
||||||
|
|
||||||
@@ -32,7 +38,7 @@ void ClientConnexion::HandlePacket(const protocol::ServerTpsPacket* packet) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
void ClientConnexion::Login() {
|
void ClientConnexion::Login() {
|
||||||
td::protocol::PlayerLoginPacket loginPacket("Persson" + std::to_string(m_ConnectionID));
|
td::protocol::PlayerLoginPacket loginPacket("Persson" + std::to_string(static_cast<unsigned int>(m_ConnectionID)));
|
||||||
SendPacket(&loginPacket);
|
SendPacket(&loginPacket);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -1,7 +1,18 @@
|
|||||||
#include "game/client/ClientGame.h"
|
#include "game/client/ClientGame.h"
|
||||||
#include "protocol/PacketDispatcher.h"
|
#include "protocol/PacketDispatcher.h"
|
||||||
#include "game/client/Client.h"
|
#include "game/client/Client.h"
|
||||||
#include "misc/DiscordRPC.h"
|
|
||||||
|
#include "protocol/packets/ConnectionInfoPacket.h"
|
||||||
|
#include "protocol/packets/PlayerJoinPacket.h"
|
||||||
|
#include "protocol/packets/PlayerListPacket.h"
|
||||||
|
#include "protocol/packets/PlayerLeavePacket.h"
|
||||||
|
#include "protocol/packets/UpdatePlayerTeamPacket.h"
|
||||||
|
#include "protocol/packets/UpdateLobbyTimePacket.h"
|
||||||
|
#include "protocol/packets/UpdateGameStatePacket.h"
|
||||||
|
#include "protocol/packets/UpdateMoneyPacket.h"
|
||||||
|
#include "protocol/packets/UpdateExpPacket.h"
|
||||||
|
#include "protocol/packets/DisconnectPacket.h"
|
||||||
|
#include "protocol/packets/WorldDataPacket.h"
|
||||||
|
|
||||||
namespace td {
|
namespace td {
|
||||||
namespace client {
|
namespace client {
|
||||||
@@ -29,9 +40,6 @@ ClientGame::~ClientGame() {
|
|||||||
void ClientGame::Tick(std::uint64_t delta) {
|
void ClientGame::Tick(std::uint64_t delta) {
|
||||||
game::Game::Tick(delta);
|
game::Game::Tick(delta);
|
||||||
m_WorldRenderer.Update();
|
m_WorldRenderer.Update();
|
||||||
if (m_GameState == game::GameState::Lobby && m_LobbyTime > 0) {
|
|
||||||
m_LobbyTime -= delta;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
void ClientGame::HandlePacket(const protocol::PlayerJoinPacket* packet) {
|
void ClientGame::HandlePacket(const protocol::PlayerJoinPacket* packet) {
|
||||||
@@ -44,7 +52,7 @@ void ClientGame::HandlePacket(const protocol::PlayerJoinPacket* packet) {
|
|||||||
void ClientGame::HandlePacket(const protocol::PlayerLeavePacket* packet) {
|
void ClientGame::HandlePacket(const protocol::PlayerLeavePacket* packet) {
|
||||||
game::Player* player = &m_Players[packet->GetPlayerID()];
|
game::Player* player = &m_Players[packet->GetPlayerID()];
|
||||||
if (player->GetTeamColor() != game::TeamColor::None) {
|
if (player->GetTeamColor() != game::TeamColor::None) {
|
||||||
m_Teams[(std::size_t)player->GetTeamColor()].RemovePlayer(player);
|
m_Teams[static_cast<std::size_t>(player->GetTeamColor())].RemovePlayer(player);
|
||||||
}
|
}
|
||||||
m_Players.erase(player->GetID());
|
m_Players.erase(player->GetID());
|
||||||
}
|
}
|
||||||
@@ -58,7 +66,7 @@ void ClientGame::HandlePacket(const protocol::PlayerListPacket* packet) {
|
|||||||
player.SetTeamColor(playerInfo.team);
|
player.SetTeamColor(playerInfo.team);
|
||||||
m_Players.insert({ playerID, player });
|
m_Players.insert({ playerID, player });
|
||||||
if (player.GetTeamColor() != game::TeamColor::None) {
|
if (player.GetTeamColor() != game::TeamColor::None) {
|
||||||
m_Teams[(std::size_t)player.GetTeamColor()].AddPlayer(&m_Players[playerID]);
|
m_Teams[static_cast<std::size_t>(player.GetTeamColor())].AddPlayer(&m_Players[playerID]);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
m_Player = &m_Players[m_ConnexionID];
|
m_Player = &m_Players[m_ConnexionID];
|
||||||
@@ -86,7 +94,8 @@ void ClientGame::HandlePacket(const protocol::ConnexionInfoPacket* packet) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
void ClientGame::HandlePacket(const protocol::UpdateLobbyTimePacket* packet) {
|
void ClientGame::HandlePacket(const protocol::UpdateLobbyTimePacket* packet) {
|
||||||
m_LobbyTime = packet->GetRemainingTime();
|
m_GameStartTime = packet->GetStartTime();
|
||||||
|
m_LobbyStartTime = utils::GetTime();
|
||||||
}
|
}
|
||||||
|
|
||||||
void ClientGame::HandlePacket(const protocol::UpdateMoneyPacket* packet) {
|
void ClientGame::HandlePacket(const protocol::UpdateMoneyPacket* packet) {
|
||||||
@@ -98,7 +107,7 @@ void ClientGame::HandlePacket(const protocol::UpdateExpPacket* packet) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
void ClientGame::HandlePacket(const protocol::DisconnectPacket* packet) {
|
void ClientGame::HandlePacket(const protocol::DisconnectPacket* packet) {
|
||||||
SetGameState(game::GameState::Disconnected);
|
m_GameState = game::GameState::Disconnected;
|
||||||
m_Renderer->SetBackgroundColor({ 0, 0, 0 });
|
m_Renderer->SetBackgroundColor({ 0, 0, 0 });
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -115,30 +124,5 @@ void ClientGame::RenderWorld() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void ClientGame::SetGameState(game::GameState newState) {
|
|
||||||
game::Game::SetGameState(newState);
|
|
||||||
|
|
||||||
// Update Discord presence
|
|
||||||
switch (newState) {
|
|
||||||
|
|
||||||
case game::GameState::Lobby:
|
|
||||||
utils::UpdateDiscordPresence("In Lobby", "Normal Mode", true);
|
|
||||||
break;
|
|
||||||
|
|
||||||
case game::GameState::Game:
|
|
||||||
utils::UpdateDiscordPresence("In Game", "Normal Mode", true);
|
|
||||||
break;
|
|
||||||
|
|
||||||
case game::GameState::Closed:
|
|
||||||
case game::GameState::Disconnected:
|
|
||||||
utils::UpdateDiscordPresence("In Main Menu", "Normal Mode", true);
|
|
||||||
break;
|
|
||||||
|
|
||||||
case game::GameState::EndGame:
|
|
||||||
utils::UpdateDiscordPresence("In End Game", "Normal Mode", true);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace client
|
} // namespace client
|
||||||
} // namespace td
|
} // namespace td
|
||||||
|
|||||||
@@ -3,6 +3,15 @@
|
|||||||
#include "game/client/ClientGame.h"
|
#include "game/client/ClientGame.h"
|
||||||
#include "render/WorldRenderer.h"
|
#include "render/WorldRenderer.h"
|
||||||
|
|
||||||
|
#include "protocol/packets/WorldAddTowerPacket.h"
|
||||||
|
#include "protocol/packets/WorldBeginDataPacket.h"
|
||||||
|
#include "protocol/packets/WorldDataPacket.h"
|
||||||
|
#include "protocol/packets/SpawnMobPacket.h"
|
||||||
|
#include "protocol/packets/UpgradeTowerPacket.h"
|
||||||
|
#include "protocol/packets/RemoveTowerPacket.h"
|
||||||
|
#include "protocol/packets/UpdateCastleLifePacket.h"
|
||||||
|
#include "protocol/packets/UpdateMobStatesPacket.h"
|
||||||
|
|
||||||
namespace td {
|
namespace td {
|
||||||
namespace client {
|
namespace client {
|
||||||
|
|
||||||
|
|||||||
@@ -1,6 +1,8 @@
|
|||||||
#include "game/server/Lobby.h"
|
#include "game/server/Lobby.h"
|
||||||
#include "game/server/Server.h"
|
#include "game/server/Server.h"
|
||||||
|
|
||||||
|
#include "protocol/packets/UpdateLobbyTimePacket.h"
|
||||||
|
|
||||||
#include "misc/Time.h"
|
#include "misc/Time.h"
|
||||||
|
|
||||||
#ifdef NDEBUG
|
#ifdef NDEBUG
|
||||||
@@ -31,33 +33,39 @@ Lobby::Lobby(Server* server) : m_Server(server), m_Timer(1000, std::bind(&Lobby:
|
|||||||
}
|
}
|
||||||
|
|
||||||
void Lobby::Tick() {
|
void Lobby::Tick() {
|
||||||
if (m_GameStarted || m_StartTimerTime == 0)
|
if (m_GameStarted || m_StartTime == 0)
|
||||||
return;
|
return;
|
||||||
|
|
||||||
if (utils::GetTime() - m_StartTimerTime >= LobbyWaitingTime) {
|
if (utils::GetTime() >= m_StartTime) {
|
||||||
m_Server->GetGame().NotifyListeners(&game::GameListener::OnGameBegin);
|
m_Server->GetGame().NotifyListeners(&game::GameListener::OnGameBegin);
|
||||||
m_GameStarted = true;
|
m_GameStarted = true;
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
m_Timer.Update();
|
//m_Timer.Update();
|
||||||
}
|
}
|
||||||
|
|
||||||
void Lobby::SendTimeRemaining() {
|
void Lobby::SendTimeRemaining() {
|
||||||
protocol::UpdateLobbyTimePacket packet(LobbyWaitingTime - (utils::GetTime() - m_StartTimerTime)); // converting second to millis
|
protocol::UpdateLobbyTimePacket packet(m_StartTime);
|
||||||
m_Server->BroadcastPacket(&packet);
|
m_Server->BroadcastPacket(&packet);
|
||||||
}
|
}
|
||||||
|
|
||||||
void Lobby::OnPlayerJoin(std::uint8_t playerID) {
|
void Lobby::OnPlayerJoin(std::uint8_t playerID) {
|
||||||
if (m_GameStarted)
|
if (m_GameStarted)
|
||||||
return;
|
return;
|
||||||
|
|
||||||
utils::LOG("(Server) Player Joined Lobby !");
|
utils::LOG("(Server) Player Joined Lobby !");
|
||||||
m_Players.push_back(playerID);
|
m_Players.push_back(playerID);
|
||||||
|
|
||||||
if (m_Players.size() == MIN_PLAYER_WAITING) { // start timer if a second player join the match
|
if (m_Players.size() == MIN_PLAYER_WAITING) { // start timer if a second player join the match
|
||||||
m_StartTimerTime = utils::GetTime();
|
m_StartTime = utils::GetTime() + static_cast<std::uint64_t>(LobbyWaitingTime);
|
||||||
m_Timer.Reset();
|
m_Timer.Reset();
|
||||||
SendTimeRemaining();
|
SendTimeRemaining();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// notify player that just arrived
|
||||||
|
protocol::UpdateLobbyTimePacket packet(m_StartTime);
|
||||||
|
m_Server->GetConnexions().at(playerID).SendPacket(&packet);
|
||||||
}
|
}
|
||||||
|
|
||||||
void Lobby::OnPlayerLeave(std::uint8_t playerID) {
|
void Lobby::OnPlayerLeave(std::uint8_t playerID) {
|
||||||
@@ -71,9 +79,8 @@ void Lobby::OnPlayerLeave(std::uint8_t playerID) {
|
|||||||
m_Players.erase(it);
|
m_Players.erase(it);
|
||||||
|
|
||||||
if (m_Players.size() == 1) {
|
if (m_Players.size() == 1) {
|
||||||
protocol::UpdateLobbyTimePacket packet(0);
|
m_StartTime = 0; // reset timer if there is only one player left
|
||||||
m_Server->BroadcastPacket(&packet);
|
SendTimeRemaining();
|
||||||
m_StartTimerTime = 0; // reset timer if there is only one player left
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user