<!-- 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.13"/>
<title>RapidJSON: include/rapidjson/internal/itoa.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">
$(document).ready(initResizable);
</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">
$(document).ready(function() { init_search(); });
</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.13 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
</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">
$(document).ready(function(){initNavTree('itoa_8h_source.html','');});
</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">itoa.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="preprocessor">#ifndef RAPIDJSON_ITOA_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#define RAPIDJSON_ITOA_</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "../rapidjson.h"</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> RAPIDJSON_NAMESPACE_BEGIN</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">namespace </span>internal {</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">inline</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* GetDigitsLut() {</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">char</span> cDigitsLut[200] = {</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="charliteral">'0'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'9'</span>,</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="charliteral">'1'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'9'</span>,</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="charliteral">'2'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'9'</span>,</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="charliteral">'3'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'9'</span>,</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="charliteral">'4'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'9'</span>,</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="charliteral">'5'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'9'</span>,</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="charliteral">'6'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'9'</span>,</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="charliteral">'7'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'9'</span>,</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="charliteral">'8'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'9'</span>,</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="charliteral">'9'</span>,<span class="charliteral">'0'</span>,<span class="charliteral">'9'</span>,<span class="charliteral">'1'</span>,<span class="charliteral">'9'</span>,<span class="charliteral">'2'</span>,<span class="charliteral">'9'</span>,<span class="charliteral">'3'</span>,<span class="charliteral">'9'</span>,<span class="charliteral">'4'</span>,<span class="charliteral">'9'</span>,<span class="charliteral">'5'</span>,<span class="charliteral">'9'</span>,<span class="charliteral">'6'</span>,<span class="charliteral">'9'</span>,<span class="charliteral">'7'</span>,<span class="charliteral">'9'</span>,<span class="charliteral">'8'</span>,<span class="charliteral">'9'</span>,<span class="charliteral">'9'</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  };</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">return</span> cDigitsLut;</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> }</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">inline</span> <span class="keywordtype">char</span>* u32toa(uint32_t value, <span class="keywordtype">char</span>* buffer) {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* cDigitsLut = GetDigitsLut();</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>  <span class="keywordflow">if</span> (value < 10000) {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">const</span> uint32_t d1 = (value / 100) << 1;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">const</span> uint32_t d2 = (value % 100) << 1;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">if</span> (value >= 1000)</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  *buffer++ = cDigitsLut[d1];</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">if</span> (value >= 100)</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  *buffer++ = cDigitsLut[d1 + 1];</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">if</span> (value >= 10)</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  *buffer++ = cDigitsLut[d2];</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  *buffer++ = cDigitsLut[d2 + 1];</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value < 100000000) {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// value = bbbbcccc</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">const</span> uint32_t b = value / 10000;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">const</span> uint32_t c = value % 10000;</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>  <span class="keyword">const</span> uint32_t d1 = (b / 100) << 1;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> uint32_t d2 = (b % 100) << 1;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">const</span> uint32_t d3 = (c / 100) << 1;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">const</span> uint32_t d4 = (c % 100) << 1;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">if</span> (value >= 10000000)</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  *buffer++ = cDigitsLut[d1];</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (value >= 1000000)</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  *buffer++ = cDigitsLut[d1 + 1];</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (value >= 100000)</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  *buffer++ = cDigitsLut[d2];</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  *buffer++ = cDigitsLut[d2 + 1];</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  *buffer++ = cDigitsLut[d3];</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  *buffer++ = cDigitsLut[d3 + 1];</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  *buffer++ = cDigitsLut[d4];</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  *buffer++ = cDigitsLut[d4 + 1];</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// value = aabbbbcccc in decimal</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">const</span> uint32_t a = value / 100000000; <span class="comment">// 1 to 42</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  value %= 100000000;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (a >= 10) {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> i = a << 1;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  *buffer++ = cDigitsLut[i];</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  *buffer++ = cDigitsLut[i + 1];</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</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>(a));</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>  <span class="keyword">const</span> uint32_t b = value / 10000; <span class="comment">// 0 to 9999</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">const</span> uint32_t c = value % 10000; <span class="comment">// 0 to 9999</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">const</span> uint32_t d1 = (b / 100) << 1;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">const</span> uint32_t d2 = (b % 100) << 1;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">const</span> uint32_t d3 = (c / 100) << 1;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">const</span> uint32_t d4 = (c % 100) << 1;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  *buffer++ = cDigitsLut[d1];</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  *buffer++ = cDigitsLut[d1 + 1];</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  *buffer++ = cDigitsLut[d2];</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  *buffer++ = cDigitsLut[d2 + 1];</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  *buffer++ = cDigitsLut[d3];</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  *buffer++ = cDigitsLut[d3 + 1];</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  *buffer++ = cDigitsLut[d4];</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  *buffer++ = cDigitsLut[d4 + 1];</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>  <span class="keywordflow">return</span> buffer;</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> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="keyword">inline</span> <span class="keywordtype">char</span>* i32toa(int32_t value, <span class="keywordtype">char</span>* buffer) {</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  uint32_t u = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(value);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (value < 0) {</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  *buffer++ = <span class="charliteral">'-'</span>;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  u = ~u + 1;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span> u32toa(u, buffer);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> }</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="keyword">inline</span> <span class="keywordtype">char</span>* u64toa(uint64_t value, <span class="keywordtype">char</span>* buffer) {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* cDigitsLut = GetDigitsLut();</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">const</span> uint64_t kTen8 = 100000000;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">const</span> uint64_t kTen9 = kTen8 * 10;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">const</span> uint64_t kTen10 = kTen8 * 100;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">const</span> uint64_t kTen11 = kTen8 * 1000;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">const</span> uint64_t kTen12 = kTen8 * 10000;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">const</span> uint64_t kTen13 = kTen8 * 100000;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">const</span> uint64_t kTen14 = kTen8 * 1000000;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">const</span> uint64_t kTen15 = kTen8 * 10000000;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> uint64_t kTen16 = kTen8 * kTen8;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (value < kTen8) {</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  uint32_t v = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(value);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">if</span> (v < 10000) {</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">const</span> uint32_t d1 = (v / 100) << 1;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">const</span> uint32_t d2 = (v % 100) << 1;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (v >= 1000)</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  *buffer++ = cDigitsLut[d1];</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">if</span> (v >= 100)</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  *buffer++ = cDigitsLut[d1 + 1];</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (v >= 10)</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  *buffer++ = cDigitsLut[d2];</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  *buffer++ = cDigitsLut[d2 + 1];</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>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// value = bbbbcccc</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">const</span> uint32_t b = v / 10000;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">const</span> uint32_t c = v % 10000;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">const</span> uint32_t d1 = (b / 100) << 1;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">const</span> uint32_t d2 = (b % 100) << 1;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">const</span> uint32_t d3 = (c / 100) << 1;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">const</span> uint32_t d4 = (c % 100) << 1;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (value >= 10000000)</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  *buffer++ = cDigitsLut[d1];</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">if</span> (value >= 1000000)</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  *buffer++ = cDigitsLut[d1 + 1];</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">if</span> (value >= 100000)</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  *buffer++ = cDigitsLut[d2];</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  *buffer++ = cDigitsLut[d2 + 1];</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  </div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  *buffer++ = cDigitsLut[d3];</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  *buffer++ = cDigitsLut[d3 + 1];</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  *buffer++ = cDigitsLut[d4];</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  *buffer++ = cDigitsLut[d4 + 1];</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>  }</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value < kTen16) {</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">const</span> uint32_t v0 = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(value / kTen8);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> uint32_t v1 = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(value % kTen8);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keyword">const</span> uint32_t b0 = v0 / 10000;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">const</span> uint32_t c0 = v0 % 10000;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keyword">const</span> uint32_t d1 = (b0 / 100) << 1;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">const</span> uint32_t d2 = (b0 % 100) << 1;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">const</span> uint32_t d3 = (c0 / 100) << 1;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">const</span> uint32_t d4 = (c0 % 100) << 1;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">const</span> uint32_t b1 = v1 / 10000;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">const</span> uint32_t c1 = v1 % 10000;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">const</span> uint32_t d5 = (b1 / 100) << 1;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keyword">const</span> uint32_t d6 = (b1 % 100) << 1;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> uint32_t d7 = (c1 / 100) << 1;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> uint32_t d8 = (c1 % 100) << 1;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">if</span> (value >= kTen15)</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  *buffer++ = cDigitsLut[d1];</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (value >= kTen14)</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  *buffer++ = cDigitsLut[d1 + 1];</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span> (value >= kTen13)</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  *buffer++ = cDigitsLut[d2];</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">if</span> (value >= kTen12)</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  *buffer++ = cDigitsLut[d2 + 1];</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">if</span> (value >= kTen11)</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  *buffer++ = cDigitsLut[d3];</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">if</span> (value >= kTen10)</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  *buffer++ = cDigitsLut[d3 + 1];</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (value >= kTen9)</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  *buffer++ = cDigitsLut[d4];</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">if</span> (value >= kTen8)</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  *buffer++ = cDigitsLut[d4 + 1];</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  </div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  *buffer++ = cDigitsLut[d5];</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  *buffer++ = cDigitsLut[d5 + 1];</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  *buffer++ = cDigitsLut[d6];</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  *buffer++ = cDigitsLut[d6 + 1];</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  *buffer++ = cDigitsLut[d7];</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  *buffer++ = cDigitsLut[d7 + 1];</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  *buffer++ = cDigitsLut[d8];</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  *buffer++ = cDigitsLut[d8 + 1];</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">const</span> uint32_t a = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(value / kTen16); <span class="comment">// 1 to 1844</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  value %= kTen16;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  </div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">if</span> (a < 10)</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</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>(a));</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a < 100) {</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> uint32_t i = a << 1;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  *buffer++ = cDigitsLut[i];</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  *buffer++ = cDigitsLut[i + 1];</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a < 1000) {</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</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>(a / 100));</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>  <span class="keyword">const</span> uint32_t i = (a % 100) << 1;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  *buffer++ = cDigitsLut[i];</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  *buffer++ = cDigitsLut[i + 1];</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">const</span> uint32_t i = (a / 100) << 1;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">const</span> uint32_t j = (a % 100) << 1;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  *buffer++ = cDigitsLut[i];</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  *buffer++ = cDigitsLut[i + 1];</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  *buffer++ = cDigitsLut[j];</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  *buffer++ = cDigitsLut[j + 1];</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keyword">const</span> uint32_t v0 = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(value / kTen8);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keyword">const</span> uint32_t v1 = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(value % kTen8);</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  </div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">const</span> uint32_t b0 = v0 / 10000;</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">const</span> uint32_t c0 = v0 % 10000;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  </div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">const</span> uint32_t d1 = (b0 / 100) << 1;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">const</span> uint32_t d2 = (b0 % 100) << 1;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  </div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">const</span> uint32_t d3 = (c0 / 100) << 1;</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">const</span> uint32_t d4 = (c0 % 100) << 1;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  </div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">const</span> uint32_t b1 = v1 / 10000;</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keyword">const</span> uint32_t c1 = v1 % 10000;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  </div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">const</span> uint32_t d5 = (b1 / 100) << 1;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">const</span> uint32_t d6 = (b1 % 100) << 1;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">const</span> uint32_t d7 = (c1 / 100) << 1;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">const</span> uint32_t d8 = (c1 % 100) << 1;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  </div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  *buffer++ = cDigitsLut[d1];</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  *buffer++ = cDigitsLut[d1 + 1];</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  *buffer++ = cDigitsLut[d2];</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  *buffer++ = cDigitsLut[d2 + 1];</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  *buffer++ = cDigitsLut[d3];</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  *buffer++ = cDigitsLut[d3 + 1];</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  *buffer++ = cDigitsLut[d4];</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  *buffer++ = cDigitsLut[d4 + 1];</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  *buffer++ = cDigitsLut[d5];</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  *buffer++ = cDigitsLut[d5 + 1];</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  *buffer++ = cDigitsLut[d6];</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  *buffer++ = cDigitsLut[d6 + 1];</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  *buffer++ = cDigitsLut[d7];</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  *buffer++ = cDigitsLut[d7 + 1];</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  *buffer++ = cDigitsLut[d8];</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  *buffer++ = cDigitsLut[d8 + 1];</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  }</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">return</span> buffer;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> }</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="keyword">inline</span> <span class="keywordtype">char</span>* i64toa(int64_t value, <span class="keywordtype">char</span>* buffer) {</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  uint64_t u = <span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(value);</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">if</span> (value < 0) {</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  *buffer++ = <span class="charliteral">'-'</span>;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  u = ~u + 1;</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> </div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">return</span> u64toa(u, buffer);</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> }</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> } <span class="comment">// namespace internal</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> RAPIDJSON_NAMESPACE_END</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="preprocessor">#endif // RAPIDJSON_ITOA_</span></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>itoa.h</b></li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
6
>
x86_64
>
media
>
core-updates
>
by-pkgid
>
c6b0bede079df9548348adf37bc6052d
>
files
>
798
