?? arraylongfpcache.html
字號(hào):
<!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>ArrayLongFPCache xref</title><link type="text/css" rel="stylesheet" href="../../../../stylesheet.css" /></head><body><div id="overview"><a href="../../../../../apidocs/org/archive/util/fingerprint/ArrayLongFPCache.html">View Javadoc</a></div><pre><a name="1" href="#1">1</a> <em class="comment">/*<em class="comment"> ArrayLongFPCache</em></em><a name="2" href="#2">2</a> <em class="comment">*</em><a name="3" href="#3">3</a> <em class="comment">* $Id: ArrayLongFPCache.java 3870 2005-10-06 05:01:49Z gojomo $</em><a name="4" href="#4">4</a> <em class="comment">*</em><a name="5" href="#5">5</a> <em class="comment">* Created on Oct 5, 2005</em><a name="6" href="#6">6</a> <em class="comment">*</em><a name="7" href="#7">7</a> <em class="comment">* Copyright (C) 2005 Internet Archive.</em><a name="8" href="#8">8</a> <em class="comment">*</em><a name="9" href="#9">9</a> <em class="comment">* This file is part of the Heritrix web crawler (crawler.archive.org).</em><a name="10" href="#10">10</a> <em class="comment">*</em><a name="11" href="#11">11</a> <em class="comment">* Heritrix is free software; you can redistribute it and/or modify</em><a name="12" href="#12">12</a> <em class="comment">* it under the terms of the GNU Lesser Public License as published by</em><a name="13" href="#13">13</a> <em class="comment">* the Free Software Foundation; either version 2.1 of the License, or</em><a name="14" href="#14">14</a> <em class="comment">* any later version.</em><a name="15" href="#15">15</a> <em class="comment">*</em><a name="16" href="#16">16</a> <em class="comment">* Heritrix is distributed in the hope that it will be useful,</em><a name="17" href="#17">17</a> <em class="comment">* but WITHOUT ANY WARRANTY; without even the implied warranty of</em><a name="18" href="#18">18</a> <em class="comment">* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</em><a name="19" href="#19">19</a> <em class="comment">* GNU Lesser Public License for more details.</em><a name="20" href="#20">20</a> <em class="comment">*</em><a name="21" href="#21">21</a> <em class="comment">* You should have received a copy of the GNU Lesser Public License</em><a name="22" href="#22">22</a> <em class="comment">* along with Heritrix; if not, write to the Free Software</em><a name="23" href="#23">23</a> <em class="comment">* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</em><a name="24" href="#24">24</a> <em class="comment">*/</em> <a name="25" href="#25">25</a> <strong>package</strong> <a href="../../../../org/archive/util/fingerprint/package-summary.html">org.archive.util.fingerprint</a>;<a name="26" href="#26">26</a> <a name="27" href="#27">27</a> <em>/**<em>*</em></em><a name="28" href="#28">28</a> <em> * Simple long fingerprint cache using a backing array; any long maps to </em><a name="29" href="#29">29</a> <em> * one of 'smear' slots. Longs inserted should be randomly distributed, </em><a name="30" href="#30">30</a> <em> * </em><a name="31" href="#31">31</a> <em> * @author gojomo</em><a name="32" href="#32">32</a> <em> */</em><a name="33" href="#33">33</a> <strong>public</strong> <strong>class</strong> <a href="../../../../org/archive/util/fingerprint/ArrayLongFPCache.html">ArrayLongFPCache</a> implements <a href="../../../../org/archive/util/fingerprint/LongFPSet.html">LongFPSet</a> {<a name="34" href="#34">34</a> <strong>public</strong> <strong>static</strong> <strong>final</strong> <strong>int</strong> DEFAULT_CAPACITY = 1 << 20; <em class="comment">// 1 million, 8MB</em><a name="35" href="#35">35</a> <strong>public</strong> <strong>static</strong> <strong>final</strong> <strong>int</strong> DEFAULT_SMEAR = 5; <a name="36" href="#36">36</a> <a name="37" href="#37">37</a> <strong>long</strong> cache[] = <strong>new</strong> <strong>long</strong>[DEFAULT_CAPACITY];<a name="38" href="#38">38</a> <strong>int</strong> smear = DEFAULT_SMEAR;<a name="39" href="#39">39</a> <strong>int</strong> count = 0;<a name="40" href="#40">40</a> <a name="41" href="#41">41</a> <strong>public</strong> <strong>void</strong> setCapacity(<strong>int</strong> newCapacity) {<a name="42" href="#42">42</a> <strong>long</strong>[] oldCache = cache;<a name="43" href="#43">43</a> cache = <strong>new</strong> <strong>long</strong>[<strong>new</strong>Capacity];<a name="44" href="#44">44</a> <strong>for</strong>(<strong>int</strong> i=0;i<oldCache.length;i++) {<a name="45" href="#45">45</a> add(oldCache[i]);<a name="46" href="#46">46</a> }<a name="47" href="#47">47</a> }<a name="48" href="#48">48</a> <a name="49" href="#49">49</a> <em class="comment">/*<em class="comment"> (non-Javadoc)</em></em><a name="50" href="#50">50</a> <em class="comment"> * @see org.archive.util.fingerprint.LongFPSet#add(long)</em><a name="51" href="#51">51</a> <em class="comment"> */</em><a name="52" href="#52">52</a> <strong>public</strong> <strong>boolean</strong> add(<strong>long</strong> l) {<a name="53" href="#53">53</a> <strong>if</strong>(contains(l)) {<a name="54" href="#54">54</a> <strong>return</strong> false; <a name="55" href="#55">55</a> }<a name="56" href="#56">56</a> <strong>int</strong> index = (Math.abs((<strong>int</strong>) (l % cache.length)) + (count % smear)) % cache.length;<a name="57" href="#57">57</a> count++;<a name="58" href="#58">58</a> cache[index]=l;<a name="59" href="#59">59</a> <strong>return</strong> <strong>true</strong>;<a name="60" href="#60">60</a> }<a name="61" href="#61">61</a> <a name="62" href="#62">62</a> <em class="comment">/*<em class="comment"> (non-Javadoc)</em></em><a name="63" href="#63">63</a> <em class="comment"> * @see org.archive.util.fingerprint.LongFPSet#contains(long)</em><a name="64" href="#64">64</a> <em class="comment"> */</em><a name="65" href="#65">65</a> <strong>public</strong> <strong>boolean</strong> contains(<strong>long</strong> l) {<a name="66" href="#66">66</a> <strong>int</strong> index = Math.abs((<strong>int</strong>) (l % cache.length));<a name="67" href="#67">67</a> <strong>for</strong>(<strong>int</strong> i = index; i < index + smear; i++) {<a name="68" href="#68">68</a> <strong>if</strong>(cache[i%cache.length]==l) {<a name="69" href="#69">69</a> <strong>return</strong> <strong>true</strong>;<a name="70" href="#70">70</a> }<a name="71" href="#71">71</a> }<a name="72" href="#72">72</a> <strong>return</strong> false;<a name="73" href="#73">73</a> }<a name="74" href="#74">74</a> <a name="75" href="#75">75</a> <em class="comment">/*<em class="comment"> (non-Javadoc)</em></em><a name="76" href="#76">76</a> <em class="comment"> * @see org.archive.util.fingerprint.LongFPSet#remove(long)</em><a name="77" href="#77">77</a> <em class="comment"> */</em><a name="78" href="#78">78</a> <strong>public</strong> <strong>boolean</strong> remove(<strong>long</strong> l) {<a name="79" href="#79">79</a> <strong>int</strong> index = Math.abs((<strong>int</strong>) (l % cache.length));<a name="80" href="#80">80</a> <strong>for</strong>(<strong>int</strong> i = index; i < index + smear; i++) {<a name="81" href="#81">81</a> <strong>if</strong>(cache[i%cache.length]==l) {<a name="82" href="#82">82</a> cache[i%cache.length]=0;<a name="83" href="#83">83</a> count = Math.min(count,cache.length);<a name="84" href="#84">84</a> count--;<a name="85" href="#85">85</a> <strong>return</strong> <strong>true</strong>;<a name="86" href="#86">86</a> }<a name="87" href="#87">87</a> }<a name="88" href="#88">88</a> <strong>return</strong> false;<a name="89" href="#89">89</a> }<a name="90" href="#90">90</a> <a name="91" href="#91">91</a> <em class="comment">/*<em class="comment"> (non-Javadoc)</em></em><a name="92" href="#92">92</a> <em class="comment"> * @see org.archive.util.fingerprint.LongFPSet#count()</em><a name="93" href="#93">93</a> <em class="comment"> */</em><a name="94" href="#94">94</a> <strong>public</strong> <strong>long</strong> count() {<a name="95" href="#95">95</a> <strong>return</strong> Math.min(count,cache.length);<a name="96" href="#96">96</a> }<a name="97" href="#97">97</a> <a name="98" href="#98">98</a> <em class="comment">/*<em class="comment"> (non-Javadoc)</em></em><a name="99" href="#99">99</a> <em class="comment"> * @see org.archive.util.fingerprint.LongFPSet#quickContains(long)</em><a name="100" href="#100">100</a> <em class="comment"> */</em><a name="101" href="#101">101</a> <strong>public</strong> <strong>boolean</strong> quickContains(<strong>long</strong> fp) {<a name="102" href="#102">102</a> <strong>return</strong> contains(fp);<a name="103" href="#103">103</a> }<a name="104" href="#104">104</a> <a name="105" href="#105">105</a> <strong>public</strong> <strong>int</strong> cacheLength() {<a name="106" href="#106">106</a> <strong>return</strong> cache.length;<a name="107" href="#107">107</a> }<a name="108" href="#108">108</a> <a name="109" href="#109">109</a> }</pre><hr/><div id="footer">This page was automatically generated by <a href="http://maven.apache.org/">Maven</a></div></body></html>?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號(hào)
Ctrl + =
減小字號(hào)
Ctrl + -