<!-- HTML header for doxygen 1.8.7-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.14"/>
<title>RapidJSON: include/rapidjson/internal/dtoa.h 源文件</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function() { init_search(); });
/* @license-end */
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="doxygenextra.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="topbanner"><a href="https://github.com/miloyip/rapidjson" title="RapidJSON GitHub"><i class="githublogo"></i></a></div>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="搜索" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.8.14 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
/* @license-end */
</script>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('dtoa_8h_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">dtoa.h</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Tencent is pleased to support the open source community by making RapidJSON available.</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// </span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip. All rights reserved.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// Licensed under the MIT License (the "License"); you may not use this file except</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// in compliance with the License. You may obtain a copy of the License at</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// http://opensource.org/licenses/MIT</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">//</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software distributed </span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR </span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// CONDITIONS OF ANY KIND, either express or implied. See the License for the </span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// specific language governing permissions and limitations under the License.</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// This is a C++ header-only implementation of Grisu2 algorithm from the publication:</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Loitsch, Florian. "Printing floating-point numbers quickly and accurately with</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// integers." ACM Sigplan Notices 45.6 (2010): 233-243.</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#ifndef RAPIDJSON_DTOA_</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#define RAPIDJSON_DTOA_</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "itoa.h"</span> <span class="comment">// GetDigitsLut()</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "diyfp.h"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "ieee754.h"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> RAPIDJSON_NAMESPACE_BEGIN</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span>internal {</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#ifdef __GNUC__</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> RAPIDJSON_DIAG_PUSH</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> RAPIDJSON_DIAG_OFF(effc++)</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> RAPIDJSON_DIAG_OFF(array-bounds) <span class="comment">// some gcc versions generate wrong warnings https://gcc.gnu.org/bugzilla/show_bug.cgi?id=59124</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> GrisuRound(<span class="keywordtype">char</span>* buffer, <span class="keywordtype">int</span> len, uint64_t delta, uint64_t rest, uint64_t ten_kappa, uint64_t wp_w) {</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">while</span> (rest < wp_w && delta - rest >= ten_kappa &&</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  (rest + ten_kappa < wp_w || <span class="comment">/// closer</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"></span> wp_w - rest > rest + ten_kappa - wp_w)) {</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  buffer[len - 1]--;</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  rest += ten_kappa;</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  }</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> }</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">inline</span> <span class="keywordtype">unsigned</span> CountDecimalDigit32(uint32_t n) {</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// Simple pure C++ implementation was faster than __builtin_clz version in this situation.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">if</span> (n < 10) <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">if</span> (n < 100) <span class="keywordflow">return</span> 2;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">if</span> (n < 1000) <span class="keywordflow">return</span> 3;</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">if</span> (n < 10000) <span class="keywordflow">return</span> 4;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">if</span> (n < 100000) <span class="keywordflow">return</span> 5;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">if</span> (n < 1000000) <span class="keywordflow">return</span> 6;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (n < 10000000) <span class="keywordflow">return</span> 7;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (n < 100000000) <span class="keywordflow">return</span> 8;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// Will not reach 10 digits in DigitGen()</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">//if (n < 1000000000) return 9;</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">//return 10;</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">return</span> 9;</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> }</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> DigitGen(<span class="keyword">const</span> DiyFp& W, <span class="keyword">const</span> DiyFp& Mp, uint64_t delta, <span class="keywordtype">char</span>* buffer, <span class="keywordtype">int</span>* len, <span class="keywordtype">int</span>* K) {</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">static</span> <span class="keyword">const</span> uint32_t kPow10[] = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000 };</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">const</span> DiyFp one(uint64_t(1) << -Mp.e, Mp.e);</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">const</span> DiyFp wp_w = Mp - W;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  uint32_t p1 = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(Mp.f >> -one.e);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  uint64_t p2 = Mp.f & (one.f - 1);</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">unsigned</span> kappa = CountDecimalDigit32(p1); <span class="comment">// kappa in [0, 9]</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  *len = 0;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">while</span> (kappa > 0) {</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  uint32_t d = 0;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">switch</span> (kappa) {</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">case</span> 9: d = p1 / 100000000; p1 %= 100000000; <span class="keywordflow">break</span>;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">case</span> 8: d = p1 / 10000000; p1 %= 10000000; <span class="keywordflow">break</span>;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">case</span> 7: d = p1 / 1000000; p1 %= 1000000; <span class="keywordflow">break</span>;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">case</span> 6: d = p1 / 100000; p1 %= 100000; <span class="keywordflow">break</span>;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">case</span> 5: d = p1 / 10000; p1 %= 10000; <span class="keywordflow">break</span>;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">case</span> 4: d = p1 / 1000; p1 %= 1000; <span class="keywordflow">break</span>;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">case</span> 3: d = p1 / 100; p1 %= 100; <span class="keywordflow">break</span>;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">case</span> 2: d = p1 / 10; p1 %= 10; <span class="keywordflow">break</span>;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">case</span> 1: d = p1; p1 = 0; <span class="keywordflow">break</span>;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">default</span>:;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">if</span> (d || *len)</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  buffer[(*len)++] = <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(<span class="charliteral">'0'</span> + <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(d));</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  kappa--;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  uint64_t tmp = (<span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(p1) << -one.e) + p2;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">if</span> (tmp <= delta) {</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  *K += kappa;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  GrisuRound(buffer, *len, delta, tmp, static_cast<uint64_t>(kPow10[kappa]) << -one.e, wp_w.f);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  }</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// kappa = 0</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">for</span> (;;) {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  p2 *= 10;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  delta *= 10;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordtype">char</span> d = <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(p2 >> -one.e);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (d || *len)</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  buffer[(*len)++] = <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(<span class="charliteral">'0'</span> + d);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  p2 &= one.f - 1;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  kappa--;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (p2 < delta) {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  *K += kappa;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">int</span> index = -<span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(kappa);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  GrisuRound(buffer, *len, delta, p2, one.f, wp_w.f * (index < 9 ? kPow10[-static_cast<int>(kappa)] : 0));</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Grisu2(<span class="keywordtype">double</span> value, <span class="keywordtype">char</span>* buffer, <span class="keywordtype">int</span>* length, <span class="keywordtype">int</span>* K) {</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">const</span> DiyFp v(value);</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  DiyFp w_m, w_p;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  v.NormalizedBoundaries(&w_m, &w_p);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">const</span> DiyFp c_mk = GetCachedPower(w_p.e, K);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">const</span> DiyFp W = v.Normalize() * c_mk;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  DiyFp Wp = w_p * c_mk;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  DiyFp Wm = w_m * c_mk;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  Wm.f++;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  Wp.f--;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  DigitGen(W, Wp, Wp.f - Wm.f, buffer, length, K);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> }</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="keyword">inline</span> <span class="keywordtype">char</span>* WriteExponent(<span class="keywordtype">int</span> K, <span class="keywordtype">char</span>* buffer) {</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (K < 0) {</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  *buffer++ = <span class="charliteral">'-'</span>;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  K = -K;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">if</span> (K >= 100) {</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  *buffer++ = <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(<span class="charliteral">'0'</span> + <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(K / 100));</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  K %= 100;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* d = GetDigitsLut() + K * 2;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  *buffer++ = d[0];</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  *buffer++ = d[1];</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (K >= 10) {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* d = GetDigitsLut() + K * 2;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  *buffer++ = d[0];</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  *buffer++ = d[1];</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  *buffer++ = <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(<span class="charliteral">'0'</span> + <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(K));</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">return</span> buffer;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="keyword">inline</span> <span class="keywordtype">char</span>* Prettify(<span class="keywordtype">char</span>* buffer, <span class="keywordtype">int</span> length, <span class="keywordtype">int</span> k, <span class="keywordtype">int</span> maxDecimalPlaces) {</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kk = length + k; <span class="comment">// 10^(kk-1) <= v < 10^kk</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">if</span> (0 <= k && kk <= 21) {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// 1234e7 -> 12340000000</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = length; i < kk; i++)</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  buffer[i] = <span class="charliteral">'0'</span>;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  buffer[kk] = <span class="charliteral">'.'</span>;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  buffer[kk + 1] = <span class="charliteral">'0'</span>;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">return</span> &buffer[kk + 2];</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (0 < kk && kk <= 21) {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// 1234e-2 -> 12.34</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  std::memmove(&buffer[kk + 1], &buffer[kk], static_cast<size_t>(length - kk));</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  buffer[kk] = <span class="charliteral">'.'</span>;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span> (0 > k + maxDecimalPlaces) {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// When maxDecimalPlaces = 2, 1.2345 -> 1.23, 1.102 -> 1.1</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// Remove extra trailing zeros (at least one) after truncation.</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = kk + maxDecimalPlaces; i > kk + 1; i--)</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">if</span> (buffer[i] != <span class="charliteral">'0'</span>)</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">return</span> &buffer[i + 1];</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">return</span> &buffer[kk + 2]; <span class="comment">// Reserve one zero</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">return</span> &buffer[length + 1];</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (-6 < kk && kk <= 0) {</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// 1234e-6 -> 0.001234</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> offset = 2 - kk;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  std::memmove(&buffer[offset], &buffer[0], static_cast<size_t>(length));</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  buffer[0] = <span class="charliteral">'0'</span>;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  buffer[1] = <span class="charliteral">'.'</span>;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i < offset; i++)</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  buffer[i] = <span class="charliteral">'0'</span>;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">if</span> (length - kk > maxDecimalPlaces) {</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// When maxDecimalPlaces = 2, 0.123 -> 0.12, 0.102 -> 0.1</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Remove extra trailing zeros (at least one) after truncation.</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = maxDecimalPlaces + 1; i > 2; i--)</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">if</span> (buffer[i] != <span class="charliteral">'0'</span>)</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">return</span> &buffer[i + 1];</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">return</span> &buffer[3]; <span class="comment">// Reserve one zero</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">return</span> &buffer[length + offset];</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (kk < -maxDecimalPlaces) {</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">// Truncate to zero</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  buffer[0] = <span class="charliteral">'0'</span>;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  buffer[1] = <span class="charliteral">'.'</span>;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  buffer[2] = <span class="charliteral">'0'</span>;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">return</span> &buffer[3];</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (length == 1) {</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// 1e30</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  buffer[1] = <span class="charliteral">'e'</span>;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> WriteExponent(kk - 1, &buffer[2]);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// 1234e30 -> 1.234e33</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  std::memmove(&buffer[2], &buffer[1], static_cast<size_t>(length - 1));</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  buffer[1] = <span class="charliteral">'.'</span>;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  buffer[length + 1] = <span class="charliteral">'e'</span>;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">return</span> WriteExponent(kk - 1, &buffer[0 + length + 2]);</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  }</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> }</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="keyword">inline</span> <span class="keywordtype">char</span>* dtoa(<span class="keywordtype">double</span> value, <span class="keywordtype">char</span>* buffer, <span class="keywordtype">int</span> maxDecimalPlaces = 324) {</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="code" href="group___r_a_p_i_d_j_s_o_n___c_o_n_f_i_g.html#gabeba18d612187bad2ac62aed9276d47c">RAPIDJSON_ASSERT</a>(maxDecimalPlaces >= 1);</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  Double d(value);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">if</span> (d.IsZero()) {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">if</span> (d.Sign())</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  *buffer++ = <span class="charliteral">'-'</span>; <span class="comment">// -0.0, Issue #289</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  buffer[0] = <span class="charliteral">'0'</span>;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  buffer[1] = <span class="charliteral">'.'</span>;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  buffer[2] = <span class="charliteral">'0'</span>;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> &buffer[3];</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">if</span> (value < 0) {</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  *buffer++ = <span class="charliteral">'-'</span>;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  value = -value;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordtype">int</span> length, K;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  Grisu2(value, buffer, &length, &K);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">return</span> Prettify(buffer, length, K, maxDecimalPlaces);</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="preprocessor">#ifdef __GNUC__</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> RAPIDJSON_DIAG_POP</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> </div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> } <span class="comment">// namespace internal</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> RAPIDJSON_NAMESPACE_END</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="preprocessor">#endif // RAPIDJSON_DTOA_</span></div><div class="ttc" id="group___r_a_p_i_d_j_s_o_n___c_o_n_f_i_g_html_gabeba18d612187bad2ac62aed9276d47c"><div class="ttname"><a href="group___r_a_p_i_d_j_s_o_n___c_o_n_f_i_g.html#gabeba18d612187bad2ac62aed9276d47c">RAPIDJSON_ASSERT</a></div><div class="ttdeci">#define RAPIDJSON_ASSERT(x)</div><div class="ttdoc">Assertion. </div><div class="ttdef"><b>Definition:</b> rapidjson.h:402</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- HTML footer for doxygen 1.8.7-->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_32fb88e4d38e67d524aa70efbc36f66b.html">rapidjson</a></li><li class="navelem"><a class="el" href="dir_8d7584a8244d286291cd37b99676a43b.html">internal</a></li><li class="navelem"><b>dtoa.h</b></li>
</ul>
</div>
</body>
</html>
