aboutsummaryrefslogtreecommitdiffstats
path: root/doc/html/BinaryIndexTree_8h_source.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/BinaryIndexTree_8h_source.html')
-rw-r--r--doc/html/BinaryIndexTree_8h_source.html133
1 files changed, 0 insertions, 133 deletions
diff --git a/doc/html/BinaryIndexTree_8h_source.html b/doc/html/BinaryIndexTree_8h_source.html
deleted file mode 100644
index d27f522..0000000
--- a/doc/html/BinaryIndexTree_8h_source.html
+++ /dev/null
@@ -1,133 +0,0 @@
-<!-- HTML header for doxygen 1.8.3.1-->
-<!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.6"/>
-<title>Templates -- Meow: meowpp/dsa/BinaryIndexTree.h Source File</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="navtree.js"></script>
-<script type="text/javascript">
- $(document).ready(initResizable);
- $(window).load(resizeHeight);
-</script>
-<link href="stylesheet.css" rel="stylesheet" type="text/css" />
-<link href="custom.css" rel="stylesheet" type="text/css"/>
-</head>
-<body>
-<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
-<div id="titlearea">
-<table cellspacing="0" cellpadding="0">
- <tbody>
- <tr style="height: 56px;">
- <td id="projectlogo"><img alt="Logo" src="logo.png"/></td>
- <td style="padding-left: 0.5em;">
- <div id="projectname">Templates -- Meow
- &#160;<span id="projectnumber">1.2.11</span>
- </div>
- <div id="projectbrief">A C++ template contains kinds of interesting classes and functions</div>
- </td>
- </tr>
- </tbody>
-</table>
-</div>
-<!-- end header part -->
-<!-- Generated by Doxygen 1.8.6 -->
-</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('BinaryIndexTree_8h_source.html','');});
-</script>
-<div id="doc-content">
-<div class="header">
- <div class="headertitle">
-<div class="title">BinaryIndexTree.h</div> </div>
-</div><!--header-->
-<div class="contents">
-<a href="BinaryIndexTree_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="preprocessor">#ifndef dsa_BinaryIndexTree_H__</span></div>
-<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define dsa_BinaryIndexTree_H__</span></div>
-<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="preprocessor"></span></div>
-<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
-<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;</div>
-<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div>
-<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div>
-<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;</div>
-<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<span class="keyword">namespace </span>meow {</div>
-<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;</div>
-<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> Value&gt;</div>
-<div class="line"><a name="l00021"></a><span class="lineno"><a class="line" href="classmeow_1_1BinaryIndexTree.html"> 21</a></span>&#160;<span class="keyword">class </span><a class="code" href="classmeow_1_1BinaryIndexTree.html">BinaryIndexTree</a> {</div>
-<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="keyword">private</span>:</div>
-<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; std::vector&lt;Value&gt; array_;</div>
-<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="keyword">public</span>:</div>
-<div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="classmeow_1_1BinaryIndexTree.html#afe34f33091c5c8267f1d219ff40824c4"> 28</a></span>&#160; <a class="code" href="classmeow_1_1BinaryIndexTree.html#afe34f33091c5c8267f1d219ff40824c4">BinaryIndexTree</a>() {</div>
-<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; }</div>
-<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160;</div>
-<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="classmeow_1_1BinaryIndexTree.html#a355a4eacbfbe2112720d529efdbad021"> 37</a></span>&#160; <a class="code" href="classmeow_1_1BinaryIndexTree.html#a355a4eacbfbe2112720d529efdbad021">BinaryIndexTree</a>(<span class="keywordtype">size_t</span> size, Value <span class="keyword">const</span>&amp; value):</div>
-<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; array_(size, value) {</div>
-<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; }</div>
-<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160;</div>
-<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="classmeow_1_1BinaryIndexTree.html#a8323caade12e478be1e47b7612a60b8f"> 47</a></span>&#160; <a class="code" href="classmeow_1_1BinaryIndexTree.html#a8323caade12e478be1e47b7612a60b8f">BinaryIndexTree</a>(<a class="code" href="classmeow_1_1BinaryIndexTree.html">BinaryIndexTree</a> <span class="keyword">const</span>&amp; tree2):</div>
-<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; array_(tree2.array_) {</div>
-<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; }</div>
-<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160;</div>
-<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="classmeow_1_1BinaryIndexTree.html#a5634a9420ee864860bbf8605b9e17c32"> 60</a></span>&#160; <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1BinaryIndexTree.html#a5634a9420ee864860bbf8605b9e17c32">reset</a>(<span class="keywordtype">size_t</span> size, Value <span class="keyword">const</span>&amp; init) {</div>
-<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; array_.clear();</div>
-<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; array_.resize(size, init);</div>
-<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; }</div>
-<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160;</div>
-<div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="classmeow_1_1BinaryIndexTree.html#a3a4f1799b20d5dab24d8cc584db5d32d"> 74</a></span>&#160; <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1BinaryIndexTree.html#a3a4f1799b20d5dab24d8cc584db5d32d">update</a>(<span class="keywordtype">size_t</span> index, Value <span class="keyword">const</span>&amp; value) {</div>
-<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; index++;</div>
-<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="keywordflow">for</span> ( ; index &lt;= array_.size(); index += (index &amp; -index)) {</div>
-<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; array_[index - 1] = array_[index - 1] + value;</div>
-<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; }</div>
-<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; }</div>
-<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160;</div>
-<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160;</div>
-<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classmeow_1_1BinaryIndexTree.html#a99f7d954c32c0292a9dda4b74abe5833"> 90</a></span>&#160; Value <a class="code" href="classmeow_1_1BinaryIndexTree.html#a99f7d954c32c0292a9dda4b74abe5833">query</a>(ssize_t index)<span class="keyword"> const </span>{</div>
-<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; index = std::min(index + 1, (ssize_t)array_.size());</div>
-<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; Value ret(0);</div>
-<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="keywordflow">for</span> ( ; 0 &lt; index; index -= (index &amp; -index)) {</div>
-<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; ret = ret + array_[index - 1];</div>
-<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; }</div>
-<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <span class="keywordflow">return</span> ret;</div>
-<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; }</div>
-<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160;};</div>
-<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160;</div>
-<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160;} <span class="comment">// meow</span></div>
-<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160;</div>
-<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160;<span class="preprocessor">#endif // dsa_BinaryIndexTree_H__</span></div>
-<div class="ttc" id="classmeow_1_1BinaryIndexTree_html_a5634a9420ee864860bbf8605b9e17c32"><div class="ttname"><a href="classmeow_1_1BinaryIndexTree.html#a5634a9420ee864860bbf8605b9e17c32">meow::BinaryIndexTree::reset</a></div><div class="ttdeci">void reset(size_t size, Value const &amp;init)</div><div class="ttdoc">將資料洗掉, 重設 </div><div class="ttdef"><b>Definition:</b> <a href="BinaryIndexTree_8h_source.html#l00060">BinaryIndexTree.h:60</a></div></div>
-<div class="ttc" id="classmeow_1_1BinaryIndexTree_html"><div class="ttname"><a href="classmeow_1_1BinaryIndexTree.html">meow::BinaryIndexTree</a></div><div class="ttdoc">極度簡化的 SegmentTree 已無區間更新的操作 </div><div class="ttdef"><b>Definition:</b> <a href="BinaryIndexTree_8h_source.html#l00021">BinaryIndexTree.h:21</a></div></div>
-<div class="ttc" id="classmeow_1_1BinaryIndexTree_html_afe34f33091c5c8267f1d219ff40824c4"><div class="ttname"><a href="classmeow_1_1BinaryIndexTree.html#afe34f33091c5c8267f1d219ff40824c4">meow::BinaryIndexTree::BinaryIndexTree</a></div><div class="ttdeci">BinaryIndexTree()</div><div class="ttdoc">constructor </div><div class="ttdef"><b>Definition:</b> <a href="BinaryIndexTree_8h_source.html#l00028">BinaryIndexTree.h:28</a></div></div>
-<div class="ttc" id="classmeow_1_1BinaryIndexTree_html_a355a4eacbfbe2112720d529efdbad021"><div class="ttname"><a href="classmeow_1_1BinaryIndexTree.html#a355a4eacbfbe2112720d529efdbad021">meow::BinaryIndexTree::BinaryIndexTree</a></div><div class="ttdeci">BinaryIndexTree(size_t size, Value const &amp;value)</div><div class="ttdoc">constructor </div><div class="ttdef"><b>Definition:</b> <a href="BinaryIndexTree_8h_source.html#l00037">BinaryIndexTree.h:37</a></div></div>
-<div class="ttc" id="classmeow_1_1BinaryIndexTree_html_a99f7d954c32c0292a9dda4b74abe5833"><div class="ttname"><a href="classmeow_1_1BinaryIndexTree.html#a99f7d954c32c0292a9dda4b74abe5833">meow::BinaryIndexTree::query</a></div><div class="ttdeci">Value query(ssize_t index) const </div><div class="ttdoc">詢問 0~index 的區間值 </div><div class="ttdef"><b>Definition:</b> <a href="BinaryIndexTree_8h_source.html#l00090">BinaryIndexTree.h:90</a></div></div>
-<div class="ttc" id="classmeow_1_1BinaryIndexTree_html_a3a4f1799b20d5dab24d8cc584db5d32d"><div class="ttname"><a href="classmeow_1_1BinaryIndexTree.html#a3a4f1799b20d5dab24d8cc584db5d32d">meow::BinaryIndexTree::update</a></div><div class="ttdeci">void update(size_t index, Value const &amp;value)</div><div class="ttdoc">將array中第 index (從零算起)個element多加上指定的值 </div><div class="ttdef"><b>Definition:</b> <a href="BinaryIndexTree_8h_source.html#l00074">BinaryIndexTree.h:74</a></div></div>
-<div class="ttc" id="classmeow_1_1BinaryIndexTree_html_a8323caade12e478be1e47b7612a60b8f"><div class="ttname"><a href="classmeow_1_1BinaryIndexTree.html#a8323caade12e478be1e47b7612a60b8f">meow::BinaryIndexTree::BinaryIndexTree</a></div><div class="ttdeci">BinaryIndexTree(BinaryIndexTree const &amp;tree2)</div><div class="ttdoc">constructor </div><div class="ttdef"><b>Definition:</b> <a href="BinaryIndexTree_8h_source.html#l00047">BinaryIndexTree.h:47</a></div></div>
-</div><!-- fragment --></div><!-- contents -->
-</div><!-- doc-content -->
-<!-- HTML footer for doxygen 1.8.3.1-->
-<!-- start footer part -->
-<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
- <ul>
- <li class="navelem"><a class="el" href="dir_92fecd8d02dd5e7a67429447fdf0f60f.html">meowpp</a></li><li class="navelem"><a class="el" href="dir_a17ff8dcb3a1c1b842af541700214096.html">dsa</a></li><li class="navelem"><a class="el" href="BinaryIndexTree_8h.html">BinaryIndexTree.h</a></li>
- <li class="footer">Generated on Mon Sep 8 2014 21:25:40 for Templates -- Meow by
- <a href="http://www.doxygen.org/index.html">
- <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
- </ul>
-</div>
-</body>
-</html>