⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 longfpsetcachetest.html

📁 用JAVA编写的,在做实验的时候留下来的,本来想删的,但是传上来,大家分享吧
💻 HTML
字号:
<!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>LongFPSetCacheTest xref</title><link type="text/css" rel="stylesheet" href="../../../../stylesheet.css" /></head><body><div id="overview"><a href="../../../../../apidocs/org/archive/util/fingerprint/LongFPSetCacheTest.html">View Javadoc</a></div><pre><a name="1" href="#1">1</a>   <em class="comment">/*<em class="comment"> LongFPSetCacheTest</em></em><a name="2" href="#2">2</a>   <em class="comment"> *</em><a name="3" href="#3">3</a>   <em class="comment"> * $Id: LongFPSetCacheTest.java,v 1.1 2005/05/06 02:49:01 stack-sf Exp $</em><a name="4" href="#4">4</a>   <em class="comment"> *</em><a name="5" href="#5">5</a>   <em class="comment"> * Created Wed Jan 21 09:00:29 CET 2004</em><a name="6" href="#6">6</a>   <em class="comment"> *</em><a name="7" href="#7">7</a>   <em class="comment"> *  Copyright (C) 2004 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>  <a name="26" href="#26">26</a>  <strong>package</strong> <a href="../../../../org/archive/util/fingerprint/package-summary.html">org.archive.util.fingerprint</a>;<a name="27" href="#27">27</a>  <a name="28" href="#28">28</a>  <strong>import</strong> junit.framework.Test;<a name="29" href="#29">29</a>  <strong>import</strong> junit.framework.TestSuite;<a name="30" href="#30">30</a>  <a name="31" href="#31">31</a>  <em>/**<em>*</em></em><a name="32" href="#32">32</a>  <em> * JUnit test suite for LongFPSetCache</em><a name="33" href="#33">33</a>  <em> *</em><a name="34" href="#34">34</a>  <em> * @author &lt;a href="<a href="mailto:me@jamesc.net" target="alexandria_uri">mailto:me@jamesc.net</a>">James Casey&lt;/a></em><a name="35" href="#35">35</a>  <em> * @version $ Id:$</em><a name="36" href="#36">36</a>  <em> */</em><a name="37" href="#37">37</a>  <strong>public</strong> <strong>class</strong> <a href="../../../../org/archive/util/fingerprint/LongFPSetCacheTest.html">LongFPSetCacheTest</a> <strong>extends</strong> <a href="../../../../org/archive/util/fingerprint/LongFPSetTestCase.html">LongFPSetTestCase</a> {<a name="38" href="#38">38</a>      <em>/**<em>*</em></em><a name="39" href="#39">39</a>  <em>     * Create a new LongFPSetCacheTest object</em><a name="40" href="#40">40</a>  <em>     *</em><a name="41" href="#41">41</a>  <em>     * @param testName the name of the test</em><a name="42" href="#42">42</a>  <em>     */</em><a name="43" href="#43">43</a>      <strong>public</strong> <a href="../../../../org/archive/util/fingerprint/LongFPSetCacheTest.html">LongFPSetCacheTest</a>(<strong>final</strong> String testName) {<a name="44" href="#44">44</a>          <strong>super</strong>(testName);<a name="45" href="#45">45</a>      }<a name="46" href="#46">46</a>  <a name="47" href="#47">47</a>      <em>/**<em>*</em></em><a name="48" href="#48">48</a>  <em>     * run all the tests for LongFPSetCacheTest</em><a name="49" href="#49">49</a>  <em>     *</em><a name="50" href="#50">50</a>  <em>     * @param argv the command line arguments</em><a name="51" href="#51">51</a>  <em>     */</em><a name="52" href="#52">52</a>      <strong>public</strong> <strong>static</strong> <strong>void</strong> main(String argv[]) {<a name="53" href="#53">53</a>          junit.textui.TestRunner.run(suite());<a name="54" href="#54">54</a>      }<a name="55" href="#55">55</a>  <a name="56" href="#56">56</a>      <em>/**<em>*</em></em><a name="57" href="#57">57</a>  <em>     * return the suite of tests for LongFPSetCacheTest</em><a name="58" href="#58">58</a>  <em>     *</em><a name="59" href="#59">59</a>  <em>     * @return the suite of test</em><a name="60" href="#60">60</a>  <em>     */</em><a name="61" href="#61">61</a>      <strong>public</strong> <strong>static</strong> Test suite() {<a name="62" href="#62">62</a>          <strong>return</strong> <strong>new</strong> TestSuite(LongFPSetCacheTest.<strong>class</strong>);<a name="63" href="#63">63</a>      }<a name="64" href="#64">64</a>  <a name="65" href="#65">65</a>      <a href="../../../../org/archive/util/fingerprint/LongFPSet.html">LongFPSet</a> makeLongFPSet() {<a name="66" href="#66">66</a>          <strong>return</strong> <strong>new</strong> <a href="../../../../org/archive/util/fingerprint/LongFPSetCache.html">LongFPSetCache</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>     *  This is a cache buffer, which does not grow,</em><a name="71" href="#71">71</a>  <em>     * but chucks out old values.  Therefore it has a different behaviour</em><a name="72" href="#72">72</a>  <em>     * from all the other LongFPSets.  We do a different test here.</em><a name="73" href="#73">73</a>  <em>     */</em><a name="74" href="#74">74</a>  <a name="75" href="#75">75</a>      <strong>public</strong> <strong>void</strong> testCount() {<a name="76" href="#76">76</a>          <a href="../../../../org/archive/util/fingerprint/LongFPSet.html">LongFPSet</a> fpSet = <strong>new</strong> <a href="../../../../org/archive/util/fingerprint/LongFPSetCache.html">LongFPSetCache</a>();<a name="77" href="#77">77</a>          <em class="comment">// TODO: for some reason, when run in a debugger, </em><a name="78" href="#78">78</a>          <em class="comment">// the cache-item-discard is glacially slow. It's</em><a name="79" href="#79">79</a>          <em class="comment">// reasonable when executing.) So, reducing the </em><a name="80" href="#80">80</a>          <em class="comment">// number of past-saturation tests in order to let</em><a name="81" href="#81">81</a>          <em class="comment">// full-unit-tests complete more quickly. </em><a name="82" href="#82">82</a>          <strong>final</strong> <strong>int</strong> NUM = 800; <em class="comment">// was 1000</em><a name="83" href="#83">83</a>          <strong>final</strong> <strong>int</strong> MAX_ENTRIES = 768;<a name="84" href="#84">84</a>  <a name="85" href="#85">85</a>          assertEquals(<span class="string">"empty set to start"</span>, 0, fpSet.count());<a name="86" href="#86">86</a>  <a name="87" href="#87">87</a>          <strong>for</strong> (<strong>int</strong> i = 1; i &lt; NUM; ++i) {<a name="88" href="#88">88</a>              fpSet.add((<strong>long</strong>) i);<a name="89" href="#89">89</a>              assertEquals(<span class="string">"correct num on add"</span>,<a name="90" href="#90">90</a>                      i&lt;MAX_ENTRIES?i:MAX_ENTRIES, fpSet.count());<a name="91" href="#91">91</a>          }<a name="92" href="#92">92</a>      }<a name="93" href="#93">93</a>  <a name="94" href="#94">94</a>      <em class="comment">// TODO - implement test methods in LongFPSetCacheTest</em><a name="95" href="#95">95</a>  }<a name="96" href="#96">96</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 + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -