histotable.html
来自「网络爬虫开源代码」· HTML 代码 · 共 187 行
HTML
187 行
<!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" xml:lang="en" lang="en"><head><meta http-equiv="content-type" content="text/html; charset=UTF-8" /><title>Histotable xref</title><link type="text/css" rel="stylesheet" href="../../../stylesheet.css" /></head><body><div id="overview"><a href="../../../../apidocs/org/archive/util/Histotable.html">View Javadoc</a></div><pre><a name="1" href="#1">1</a> <em class="comment">/*</em><a name="2" href="#2">2</a> <em class="comment"> * Histotable.java</em><a name="3" href="#3">3</a> <em class="comment"> * </em><a name="4" href="#4">4</a> <em class="comment"> * Created on Aug 5, 2004</em><a name="5" href="#5">5</a> <em class="comment"> *</em><a name="6" href="#6">6</a> <em class="comment"> * $Id: Histotable.java 5047 2007-04-10 01:47:42Z gojomo $</em><a name="7" href="#7">7</a> <em class="comment"> *</em><a name="8" href="#8">8</a> <em class="comment"> * Copyright (C) 2007 Internet Archive.</em><a name="9" href="#9">9</a> <em class="comment"> *</em><a name="10" href="#10">10</a> <em class="comment"> * This file is part of the Heritrix web crawler (crawler.archive.org).</em><a name="11" href="#11">11</a> <em class="comment"> *</em><a name="12" href="#12">12</a> <em class="comment"> * Heritrix is free software; you can redistribute it and/or modify</em><a name="13" href="#13">13</a> <em class="comment"> * it under the terms of the GNU Lesser Public License as published by</em><a name="14" href="#14">14</a> <em class="comment"> * the Free Software Foundation; either version 2.1 of the License, or</em><a name="15" href="#15">15</a> <em class="comment"> * any later version.</em><a name="16" href="#16">16</a> <em class="comment"> *</em><a name="17" href="#17">17</a> <em class="comment"> * Heritrix is distributed in the hope that it will be useful,</em><a name="18" href="#18">18</a> <em class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</em><a name="19" href="#19">19</a> <em class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</em><a name="20" href="#20">20</a> <em class="comment"> * GNU Lesser Public License for more details.</em><a name="21" href="#21">21</a> <em class="comment"> *</em><a name="22" href="#22">22</a> <em class="comment"> * You should have received a copy of the GNU Lesser Public License</em><a name="23" href="#23">23</a> <em class="comment"> * along with Heritrix; if not, write to the Free Software</em><a name="24" href="#24">24</a> <em class="comment"> * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</em><a name="25" href="#25">25</a> <em class="comment"> */</em><a name="26" href="#26">26</a> <a name="27" href="#27">27</a> <a name="28" href="#28">28</a> <strong>package</strong> <a href="../../../org/archive/util/package-summary.html">org.archive.util</a>;<a name="29" href="#29">29</a> <a name="30" href="#30">30</a> <strong>import</strong> java.util.Comparator;<a name="31" href="#31">31</a> <strong>import</strong> java.util.HashMap;<a name="32" href="#32">32</a> <strong>import</strong> java.util.Map;<a name="33" href="#33">33</a> <strong>import</strong> java.util.TreeSet;<a name="34" href="#34">34</a> <a name="35" href="#35">35</a> <a name="36" href="#36">36</a> <em>/**<em>*</em></em><a name="37" href="#37">37</a> <em> * Collect and report frequency information. </em><a name="38" href="#38">38</a> <em> * </em><a name="39" href="#39">39</a> <em> * Assumes external synchornization.</em><a name="40" href="#40">40</a> <em> * </em><a name="41" href="#41">41</a> <em> * @author gojomo</em><a name="42" href="#42">42</a> <em> */</em><a name="43" href="#43">43</a> <strong>public</strong> <strong>class</strong> Histotable<K> <strong>extends</strong> HashMap<K,Long> { <a name="44" href="#44">44</a> <strong>private</strong> <strong>static</strong> <strong>final</strong> <strong>long</strong> serialVersionUID = 310306238032568623L;<a name="45" href="#45">45</a> <a name="46" href="#46">46</a> <em>/**<em>*</em></em><a name="47" href="#47">47</a> <em> * Record one more occurence of the given object key.</em><a name="48" href="#48">48</a> <em> * </em><a name="49" href="#49">49</a> <em> * @param key Object key.</em><a name="50" href="#50">50</a> <em> */</em><a name="51" href="#51">51</a> <strong>public</strong> <strong>void</strong> tally(K key) {<a name="52" href="#52">52</a> tally(key,1L);<a name="53" href="#53">53</a> }<a name="54" href="#54">54</a> <a name="55" href="#55">55</a> <em>/**<em>*</em></em><a name="56" href="#56">56</a> <em> * Record <i>count</i> more occurence(s) of the given object key.</em><a name="57" href="#57">57</a> <em> * </em><a name="58" href="#58">58</a> <em> * @param key Object key.</em><a name="59" href="#59">59</a> <em> */</em><a name="60" href="#60">60</a> <strong>public</strong> <strong>void</strong> tally(K key,<strong>long</strong> count) {<a name="61" href="#61">61</a> <strong>if</strong> (containsKey(key)) {<a name="62" href="#62">62</a> put(key,get(key) + count);<a name="63" href="#63">63</a> } <strong>else</strong> {<a name="64" href="#64">64</a> <em class="comment">// if we didn't find this key add it</em><a name="65" href="#65">65</a> put(key, count);<a name="66" href="#66">66</a> }<a name="67" href="#67">67</a> }<a name="68" href="#68">68</a> <a name="69" href="#69">69</a> <em>/**<em>*</em></em><a name="70" href="#70">70</a> <em> * @return Return an up-to-date sorted version of the totalled info.</em><a name="71" href="#71">71</a> <em> */</em><a name="72" href="#72">72</a> <strong>public</strong> TreeSet getSortedByCounts() {<a name="73" href="#73">73</a> <em class="comment">// sorted by count</em><a name="74" href="#74">74</a> TreeSet<Map.Entry<K,Long>> sorted = <a name="75" href="#75">75</a> <strong>new</strong> TreeSet<Map.Entry<K,Long>>(<a name="76" href="#76">76</a> <strong>new</strong> Comparator<Map.Entry<K,Long>>() {<a name="77" href="#77">77</a> <strong>public</strong> <strong>int</strong> compare(Map.Entry<K,Long> e1, <a name="78" href="#78">78</a> Map.Entry<K,Long> e2) {<a name="79" href="#79">79</a> <strong>long</strong> firstVal = e1.getValue();<a name="80" href="#80">80</a> <strong>long</strong> secondVal = e2.getValue();<a name="81" href="#81">81</a> <strong>if</strong> (firstVal < secondVal) { <strong>return</strong> 1; }<a name="82" href="#82">82</a> <strong>if</strong> (secondVal < firstVal) { <strong>return</strong> -1; }<a name="83" href="#83">83</a> <em class="comment">// If the values are the same, sort by keys.</em><a name="84" href="#84">84</a> String firstKey = (String) ((Map.Entry) e1).getKey();<a name="85" href="#85">85</a> String secondKey = (String) ((Map.Entry) e2).getKey();<a name="86" href="#86">86</a> <strong>return</strong> firstKey.compareTo(secondKey);<a name="87" href="#87">87</a> }<a name="88" href="#88">88</a> });<a name="89" href="#89">89</a> <a name="90" href="#90">90</a> sorted.addAll(entrySet());<a name="91" href="#91">91</a> <strong>return</strong> sorted;<a name="92" href="#92">92</a> }<a name="93" href="#93">93</a> <a name="94" href="#94">94</a> <em>/**<em>*</em></em><a name="95" href="#95">95</a> <em> * @return Return an up-to-date sorted version of the totalled info.</em><a name="96" href="#96">96</a> <em> */</em><a name="97" href="#97">97</a> <strong>public</strong> TreeSet getSortedByKeys() {<a name="98" href="#98">98</a> TreeSet<Map.Entry<K,Long>> sorted = <a name="99" href="#99">99</a> <strong>new</strong> TreeSet<Map.Entry<K,Long>>(<a name="100" href="#100">100</a> <strong>new</strong> Comparator<Map.Entry<K,Long>>() {<a name="101" href="#101">101</a> @SuppressWarnings(<span class="string">"unchecked"</span>)<a name="102" href="#102">102</a> <strong>public</strong> <strong>int</strong> compare(Map.Entry<K,Long> e1, <a name="103" href="#103">103</a> Map.Entry<K,Long> e2) {<a name="104" href="#104">104</a> K firstKey = e1.getKey();<a name="105" href="#105">105</a> K secondKey = e2.getKey();<a name="106" href="#106">106</a> <em class="comment">// If the values are the same, sort by keys.</em><a name="107" href="#107">107</a> <strong>return</strong> ((Comparable<K>)firstKey).compareTo(secondKey);<a name="108" href="#108">108</a> }<a name="109" href="#109">109</a> }); <a name="110" href="#110">110</a> sorted.addAll(entrySet());<a name="111" href="#111">111</a> <strong>return</strong> sorted;<a name="112" href="#112">112</a> }<a name="113" href="#113">113</a> <a name="114" href="#114">114</a> <em>/**<em>*</em></em><a name="115" href="#115">115</a> <em> * Return the largest value of any key that is larger than 0. If no </em><a name="116" href="#116">116</a> <em> * values or no value larger than zero, return zero. </em><a name="117" href="#117">117</a> <em> * </em><a name="118" href="#118">118</a> <em> * @return long largest value or zero if none larger than zero</em><a name="119" href="#119">119</a> <em> */</em><a name="120" href="#120">120</a> <strong>public</strong> <strong>long</strong> getLargestValue() {<a name="121" href="#121">121</a> <strong>long</strong> largest = 0; <a name="122" href="#122">122</a> <strong>for</strong> (Long el : values()) {<a name="123" href="#123">123</a> <strong>if</strong> (el > largest) {<a name="124" href="#124">124</a> largest = el;<a name="125" href="#125">125</a> }<a name="126" href="#126">126</a> }<a name="127" href="#127">127</a> <strong>return</strong> largest;<a name="128" href="#128">128</a> }<a name="129" href="#129">129</a> <a name="130" href="#130">130</a> <em>/**<em>*</em></em><a name="131" href="#131">131</a> <em> * Return the total of all tallies. </em><a name="132" href="#132">132</a> <em> * </em><a name="133" href="#133">133</a> <em> * @return long total of all tallies</em><a name="134" href="#134">134</a> <em> */</em><a name="135" href="#135">135</a> <strong>public</strong> <strong>long</strong> getTotal() {<a name="136" href="#136">136</a> <strong>long</strong> total = 0; <a name="137" href="#137">137</a> <strong>for</strong> (Long el : values()) {<a name="138" href="#138">138</a> total += el; <a name="139" href="#139">139</a> }<a name="140" href="#140">140</a> <strong>return</strong> total;<a name="141" href="#141">141</a> }<a name="142" href="#142">142</a> <a name="143" href="#143">143</a> <em>/**<em>*</em></em><a name="144" href="#144">144</a> <em> * Utility method to convert a key-&gt;Long into</em><a name="145" href="#145">145</a> <em> * the string "count key".</em><a name="146" href="#146">146</a> <em> * </em><a name="147" href="#147">147</a> <em> * @param e Map key.</em><a name="148" href="#148">148</a> <em> * @return String 'count key'.</em><a name="149" href="#149">149</a> <em> */</em><a name="150" href="#150">150</a> <strong>public</strong> <strong>static</strong> String entryString(Object e) {<a name="151" href="#151">151</a> Map.Entry entry = (Map.Entry) e;<a name="152" href="#152">152</a> <strong>return</strong> entry.getValue() + <span class="string">" "</span> + entry.getKey();<a name="153" href="#153">153</a> }<a name="154" href="#154">154</a> <a name="155" href="#155">155</a> <strong>public</strong> <strong>long</strong> add(Histotable<K> ht) {<a name="156" href="#156">156</a> <strong>long</strong> net = 0;<a name="157" href="#157">157</a> <strong>for</strong> (K key : ht.keySet()) {<a name="158" href="#158">158</a> <strong>long</strong> change = ht.get(key);<a name="159" href="#159">159</a> net += change;<a name="160" href="#160">160</a> tally(key,change);<a name="161" href="#161">161</a> }<a name="162" href="#162">162</a> <strong>return</strong> net;<a name="163" href="#163">163</a> }<a name="164" href="#164">164</a> <strong>public</strong> <strong>long</strong> subtract(Histotable<K> ht) {<a name="165" href="#165">165</a> <strong>long</strong> net = 0; <a name="166" href="#166">166</a> <strong>for</strong> (K key : ht.keySet()) {<a name="167" href="#167">167</a> <strong>long</strong> change = ht.get(key);<a name="168" href="#168">168</a> net -= change;<a name="169" href="#169">169</a> tally(key,-change);<a name="170" href="#170">170</a> }<a name="171" href="#171">171</a> <strong>return</strong> net;<a name="172" href="#172">172</a> }<a name="173" href="#173">173</a> }</pre><hr/><div id="footer">This page was automatically generated by <a href="http://maven.apache.org/">Maven</a></div></body></html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?