Normalize all the line endings

6 files changed, 1263 insertions, 1263 deletions

diff --git a/include/rapidjson/internal/meta.h b/include/rapidjson/internal/meta.h
index 2daad964..5a9aaa42 100644
--- a/include/rapidjson/internal/meta.h
+++ b/include/rapidjson/internal/meta.h
@@ -1,181 +1,181 @@
-// 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_

+// 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_
diff --git a/include/rapidjson/internal/pow10.h b/include/rapidjson/internal/pow10.h
index 1d2dff06..02f475d7 100644
--- a/include/rapidjson/internal/pow10.h
+++ b/include/rapidjson/internal/pow10.h
@@ -1,55 +1,55 @@
-// 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_

+// 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_
diff --git a/include/rapidjson/internal/regex.h b/include/rapidjson/internal/regex.h
index 8efca0a7..aeb0e3ef 100644
--- a/include/rapidjson/internal/regex.h
+++ b/include/rapidjson/internal/regex.h
@@ -1,696 +1,696 @@
-// 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

-

-#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:

-                if (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;

-                }

-                return false;

-

-            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;

-

-            case 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;

-

-            default:

-                return false;

-        }

-    }

-

-    bool EvalQuantifier(Stack<Allocator>& operandStack, unsigned n, unsigned m) {

-        RAPIDJSON_ASSERT(n <= m);

-        if (operandStack.GetSize() < sizeof(Frag))

-            return false;

-

-        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>();

-        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 {

-        if (index == kRegexInvalidState)

-            return true;

-

-        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

-

-#endif // RAPIDJSON_INTERNAL_REGEX_H_

+// 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
+
+#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:
+                if (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;
+                }
+                return false;
+
+            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;
+
+            case 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;
+
+            default:
+                return false;
+        }
+    }
+
+    bool EvalQuantifier(Stack<Allocator>& operandStack, unsigned n, unsigned m) {
+        RAPIDJSON_ASSERT(n <= m);
+        if (operandStack.GetSize() < sizeof(Frag))
+            return false;
+
+        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>();
+        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 {
+        if (index == kRegexInvalidState)
+            return true;
+
+        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
+
+#endif // RAPIDJSON_INTERNAL_REGEX_H_
diff --git a/include/rapidjson/internal/stack.h b/include/rapidjson/internal/stack.h
index c1beaacd..022c9aab 100644
--- a/include/rapidjson/internal/stack.h
+++ b/include/rapidjson/internal/stack.h
@@ -1,230 +1,230 @@
-// 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_

+// 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_
diff --git a/include/rapidjson/internal/strfunc.h b/include/rapidjson/internal/strfunc.h
index 34d47038..2edfae52 100644
--- a/include/rapidjson/internal/strfunc.h
+++ b/include/rapidjson/internal/strfunc.h
@@ -1,55 +1,55 @@
-// 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_

+// 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_
diff --git a/include/rapidjson/internal/swap.h b/include/rapidjson/internal/swap.h
index cbb2abda..666e49f9 100644
--- a/include/rapidjson/internal/swap.h
+++ b/include/rapidjson/internal/swap.h
@@ -1,46 +1,46 @@
-// 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_

+// 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_