?? bdbmultipleworkqueuestest.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>BdbMultipleWorkQueuesTest xref</title><link type="text/css" rel="stylesheet" href="../../../../stylesheet.css" /></head><body><div id="overview"><a href="../../../../../apidocs/org/archive/crawler/frontier/BdbMultipleWorkQueuesTest.html">View Javadoc</a></div><pre><a name="1" href="#1">1</a> <em class="comment">/*<em class="comment"> BdbMultipleWorkQueuesTest</em></em><a name="2" href="#2">2</a> <em class="comment">*</em><a name="3" href="#3">3</a> <em class="comment">* $Id: BdbMultipleWorkQueuesTest.java 4161 2006-01-30 23:10:35Z 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 Jul 21, 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/crawler/frontier/package-summary.html">org.archive.crawler.frontier</a>;<a name="26" href="#26">26</a> <a name="27" href="#27">27</a> <strong>import</strong> org.apache.commons.httpclient.URIException;<a name="28" href="#28">28</a> <strong>import</strong> org.archive.crawler.datamodel.CandidateURI;<a name="29" href="#29">29</a> <strong>import</strong> org.archive.crawler.datamodel.CrawlURI;<a name="30" href="#30">30</a> <strong>import</strong> org.archive.net.UURIFactory;<a name="31" href="#31">31</a> <a name="32" href="#32">32</a> <strong>import</strong> com.sleepycat.je.tree.Key;<a name="33" href="#33">33</a> <a name="34" href="#34">34</a> <strong>import</strong> junit.framework.TestCase;<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> * Unit tests for BdbMultipleWorkQueues functionality. </em><a name="38" href="#38">38</a> <em> * </em><a name="39" href="#39">39</a> <em> * @author gojomo</em><a name="40" href="#40">40</a> <em> */</em><a name="41" href="#41">41</a> <strong>public</strong> <strong>class</strong> <a href="../../../../org/archive/crawler/frontier/BdbMultipleWorkQueuesTest.html">BdbMultipleWorkQueuesTest</a> <strong>extends</strong> TestCase {<a name="42" href="#42">42</a> <a name="43" href="#43">43</a> <em>/**<em>*</em></em><a name="44" href="#44">44</a> <em> * Basic sanity checks for calculateInsertKey() -- ensure ordinal, cost,</em><a name="45" href="#45">45</a> <em> * and schedulingDirective have the intended effects, for ordinal values</em><a name="46" href="#46">46</a> <em> * up through 1/4th of the maximum (about 2^61).</em><a name="47" href="#47">47</a> <em> * </em><a name="48" href="#48">48</a> <em> * @throws URIException</em><a name="49" href="#49">49</a> <em> */</em><a name="50" href="#50">50</a> <strong>public</strong> <strong>void</strong> testCalculateInsertKey() throws URIException {<a name="51" href="#51">51</a> <strong>for</strong> (<strong>long</strong> ordinalOrigin = 1; ordinalOrigin < Long.MAX_VALUE / 4; ordinalOrigin <<= 1) {<a name="52" href="#52">52</a> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a> cauri1 = <a name="53" href="#53">53</a> <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a>(UURIFactory.getInstance(<span class="string">"http://archive.org/foo"</span>));<a name="54" href="#54">54</a> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a> curi1 = <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a>(cauri1, ordinalOrigin);<a name="55" href="#55">55</a> curi1.setClassKey(<span class="string">"foo"</span>);<a name="56" href="#56">56</a> byte[] key1 = <a name="57" href="#57">57</a> BdbMultipleWorkQueues.calculateInsertKey(curi1).getData();<a name="58" href="#58">58</a> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a> cauri2 = <a name="59" href="#59">59</a> <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a>(UURIFactory.getInstance(<span class="string">"http://archive.org/bar"</span>));<a name="60" href="#60">60</a> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a> curi2 = <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a>(cauri2, ordinalOrigin + 1);<a name="61" href="#61">61</a> curi2.setClassKey(<span class="string">"foo"</span>);<a name="62" href="#62">62</a> byte[] key2 = <a name="63" href="#63">63</a> BdbMultipleWorkQueues.calculateInsertKey(curi2).getData();<a name="64" href="#64">64</a> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a> cauri3 = <a name="65" href="#65">65</a> <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a>(UURIFactory.getInstance(<span class="string">"http://archive.org/baz"</span>));<a name="66" href="#66">66</a> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a> curi3 = <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a>(cauri3, ordinalOrigin + 2);<a name="67" href="#67">67</a> curi3.setClassKey(<span class="string">"foo"</span>);<a name="68" href="#68">68</a> curi3.setSchedulingDirective(CandidateURI.HIGH);<a name="69" href="#69">69</a> byte[] key3 = <a name="70" href="#70">70</a> BdbMultipleWorkQueues.calculateInsertKey(curi3).getData();<a name="71" href="#71">71</a> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a> cauri4 = <a name="72" href="#72">72</a> <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a>(UURIFactory.getInstance(<span class="string">"http://archive.org/zle"</span>));<a name="73" href="#73">73</a> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a> curi4 = <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a>(cauri4, ordinalOrigin + 3);<a name="74" href="#74">74</a> curi4.setClassKey(<span class="string">"foo"</span>);<a name="75" href="#75">75</a> curi4.setHolderCost(2);<a name="76" href="#76">76</a> byte[] key4 = <a name="77" href="#77">77</a> BdbMultipleWorkQueues.calculateInsertKey(curi4).getData();<a name="78" href="#78">78</a> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a> cauri5 = <a name="79" href="#79">79</a> <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CandidateURI.html">CandidateURI</a>(UURIFactory.getInstance(<span class="string">"http://archive.org/gru"</span>));<a name="80" href="#80">80</a> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a> curi5 = <strong>new</strong> <a href="../../../../org/archive/crawler/datamodel/CrawlURI.html">CrawlURI</a>(cauri5, ordinalOrigin + 4);<a name="81" href="#81">81</a> curi5.setClassKey(<span class="string">"foo"</span>);<a name="82" href="#82">82</a> curi5.setHolderCost(1);<a name="83" href="#83">83</a> byte[] key5 = <a name="84" href="#84">84</a> BdbMultipleWorkQueues.calculateInsertKey(curi5).getData();<a name="85" href="#85">85</a> <em class="comment">// ensure that key1 (with lower ordinal) sorts before key2 (higher</em><a name="86" href="#86">86</a> <em class="comment">// ordinal)</em><a name="87" href="#87">87</a> assertTrue(<span class="string">"lower ordinal sorting first ("</span> + ordinalOrigin + <span class="string">")"</span>,<a name="88" href="#88">88</a> Key.compareKeys(key1, key2, <strong>null</strong>) < 0);<a name="89" href="#89">89</a> <em class="comment">// ensure that key3 (with HIGH scheduling) sorts before key2 (even</em><a name="90" href="#90">90</a> <em class="comment">// though</em><a name="91" href="#91">91</a> <em class="comment">// it has lower ordinal)</em><a name="92" href="#92">92</a> assertTrue(<span class="string">"lower directive sorting first ("</span> + ordinalOrigin + <span class="string">")"</span>,<a name="93" href="#93">93</a> Key.compareKeys(key3, key2, <strong>null</strong>) < 0);<a name="94" href="#94">94</a> <em class="comment">// ensure that key5 (with lower cost) sorts before key4 (even though </em><a name="95" href="#95">95</a> <em class="comment">// key4 has lower ordinal and same default NORMAL scheduling directive)</em><a name="96" href="#96">96</a> assertTrue(<span class="string">"lower cost sorting first ("</span> + ordinalOrigin + <span class="string">")"</span>, Key<a name="97" href="#97">97</a> .compareKeys(key5, key4, <strong>null</strong>) < 0);<a name="98" href="#98">98</a> }<a name="99" href="#99">99</a> }<a name="100" href="#100">100</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 + -