?? workqueuefrontier.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>WorkQueueFrontier xref</title><link type="text/css" rel="stylesheet" href="../../../../stylesheet.css" /></head><body><div id="overview"><a href="../../../../../apidocs/org/archive/crawler/frontier/WorkQueueFrontier.html">View Javadoc</a></div><pre><a name="1" href="#1">1</a> <em class="comment">/*<em class="comment"> $Id: WorkQueueFrontier.java 5046 2007-04-10 01:40:08Z gojomo $</em></em><a name="2" href="#2">2</a> <em class="comment"> * Created on Sep 24, 2004</em><a name="3" href="#3">3</a> <em class="comment"> *</em><a name="4" href="#4">4</a> <em class="comment"> * Copyright (C) 2004 Internet Archive.</em><a name="5" href="#5">5</a> <em class="comment"> *</em><a name="6" href="#6">6</a> <em class="comment"> * This file is part of the Heritrix web crawler (crawler.archive.org).</em><a name="7" href="#7">7</a> <em class="comment"> *</em><a name="8" href="#8">8</a> <em class="comment"> * Heritrix is free software; you can redistribute it and/or modify</em><a name="9" href="#9">9</a> <em class="comment"> * it under the terms of the GNU Lesser Public License as published by</em><a name="10" href="#10">10</a> <em class="comment"> * the Free Software Foundation; either version 2.1 of the License, or</em><a name="11" href="#11">11</a> <em class="comment"> * any later version.</em><a name="12" href="#12">12</a> <em class="comment"> *</em><a name="13" href="#13">13</a> <em class="comment"> * Heritrix is distributed in the hope that it will be useful,</em><a name="14" href="#14">14</a> <em class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</em><a name="15" href="#15">15</a> <em class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</em><a name="16" href="#16">16</a> <em class="comment"> * GNU Lesser Public License for more details.</em><a name="17" href="#17">17</a> <em class="comment"> *</em><a name="18" href="#18">18</a> <em class="comment"> * You should have received a copy of the GNU Lesser Public License</em><a name="19" href="#19">19</a> <em class="comment"> * along with Heritrix; if not, write to the Free Software</em><a name="20" href="#20">20</a> <em class="comment"> * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</em><a name="21" href="#21">21</a> <em class="comment"> *</em><a name="22" href="#22">22</a> <em class="comment"> */</em><a name="23" href="#23">23</a> <strong>package</strong> <a href="../../../../org/archive/crawler/frontier/package-summary.html">org.archive.crawler.frontier</a>;<a name="24" href="#24">24</a> <a name="25" href="#25">25</a> <strong>import</strong> java.io.IOException;<a name="26" href="#26">26</a> <strong>import</strong> java.io.PrintWriter;<a name="27" href="#27">27</a> <strong>import</strong> java.io.Serializable;<a name="28" href="#28">28</a> <strong>import</strong> java.util.ArrayList;<a name="29" href="#29">29</a> <strong>import</strong> java.util.Collection;<a name="30" href="#30">30</a> <strong>import</strong> java.util.Collections;<a name="31" href="#31">31</a> <strong>import</strong> java.util.Date;<a name="32" href="#32">32</a> <strong>import</strong> java.util.HashMap;<a name="33" href="#33">33</a> <strong>import</strong> java.util.Iterator;<a name="34" href="#34">34</a> <strong>import</strong> java.util.Map;<a name="35" href="#35">35</a> <strong>import</strong> java.util.SortedSet;<a name="36" href="#36">36</a> <strong>import</strong> java.util.Timer;<a name="37" href="#37">37</a> <strong>import</strong> java.util.TimerTask;<a name="38" href="#38">38</a> <strong>import</strong> java.util.TreeSet;<a name="39" href="#39">39</a> <strong>import</strong> java.util.logging.Level;<a name="40" href="#40">40</a> <strong>import</strong> java.util.logging.Logger;<a name="41" href="#41">41</a> <a name="42" href="#42">42</a> <strong>import</strong> org.apache.commons.collections.Bag;<a name="43" href="#43">43</a> <strong>import</strong> org.apache.commons.collections.BagUtils;<a name="44" href="#44">44</a> <strong>import</strong> org.apache.commons.collections.bag.HashBag;<a name="45" href="#45">45</a> <strong>import</strong> org.archive.crawler.datamodel.CandidateURI;<a name="46" href="#46">46</a> <strong>import</strong> org.archive.crawler.datamodel.CoreAttributeConstants;<a name="47" href="#47">47</a> <strong>import</strong> org.archive.crawler.datamodel.CrawlURI;<a name="48" href="#48">48</a> <strong>import</strong> org.archive.crawler.datamodel.FetchStatusCodes;<a name="49" href="#49">49</a> <strong>import</strong> org.archive.crawler.datamodel.UriUniqFilter;<a name="50" href="#50">50</a> <strong>import</strong> org.archive.crawler.datamodel.UriUniqFilter.HasUriReceiver;<a name="51" href="#51">51</a> <strong>import</strong> org.archive.crawler.framework.CrawlController;<a name="52" href="#52">52</a> <strong>import</strong> org.archive.crawler.framework.Frontier;<a name="53" href="#53">53</a> <strong>import</strong> org.archive.crawler.framework.exceptions.EndedException;<a name="54" href="#54">54</a> <strong>import</strong> org.archive.crawler.framework.exceptions.FatalConfigurationException;<a name="55" href="#55">55</a> <strong>import</strong> org.archive.crawler.settings.SimpleType;<a name="56" href="#56">56</a> <strong>import</strong> org.archive.crawler.settings.Type;<a name="57" href="#57">57</a> <strong>import</strong> org.archive.net.UURI;<a name="58" href="#58">58</a> <strong>import</strong> org.archive.util.ArchiveUtils;<a name="59" href="#59">59</a> <a name="60" href="#60">60</a> <strong>import</strong> com.sleepycat.collections.StoredIterator;<a name="61" href="#61">61</a> <a name="62" href="#62">62</a> <strong>import</strong> java.util.concurrent.BlockingQueue;<a name="63" href="#63">63</a> <strong>import</strong> java.util.concurrent.LinkedBlockingQueue;<a name="64" href="#64">64</a> <strong>import</strong> java.util.concurrent.TimeUnit;<a name="65" href="#65">65</a> <a name="66" href="#66">66</a> <em>/**<em>*</em></em><a name="67" href="#67">67</a> <em> * A common Frontier base using several queues to hold pending URIs. </em><a name="68" href="#68">68</a> <em> * </em><a name="69" href="#69">69</a> <em> * Uses in-memory map of all known 'queues' inside a single database.</em><a name="70" href="#70">70</a> <em> * Round-robins between all queues.</em><a name="71" href="#71">71</a> <em> *</em><a name="72" href="#72">72</a> <em> * @author Gordon Mohr</em><a name="73" href="#73">73</a> <em> * @author Christian Kohlschuetter</em><a name="74" href="#74">74</a> <em> */</em><a name="75" href="#75">75</a> <strong>public</strong> <strong>abstract</strong> <strong>class</strong> <a href="../../../../org/archive/crawler/frontier/WorkQueueFrontier.html">WorkQueueFrontier</a> <strong>extends</strong> <a href="../../../../org/archive/crawler/frontier/AbstractFrontier.html">AbstractFrontier</a><a name="76" href="#76">76</a> implements FetchStatusCodes, CoreAttributeConstants, HasUriReceiver,<a name="77" href="#77">77</a> Serializable {<a name="78" href="#78">78</a> <strong>private</strong> <strong>static</strong> <strong>final</strong> <strong>long</strong> serialVersionUID = 570384305871965843L;<a name="79" href="#79">79</a> <a name="80" href="#80">80</a> <strong>public</strong> <strong>class</strong> WakeTask <strong>extends</strong> TimerTask {<a name="81" href="#81">81</a> @Override<a name="82" href="#82">82</a> <strong>public</strong> <strong>void</strong> run() {<a name="83" href="#83">83</a> <strong>synchronized</strong>(snoozedClassQueues) {<a name="84" href="#84">84</a> <strong>if</strong>(<strong>this</strong>!=nextWake) {<a name="85" href="#85">85</a> <em class="comment">// an intervening waketask was made</em><a name="86" href="#86">86</a> <strong>return</strong>;<a name="87" href="#87">87</a> }<a name="88" href="#88">88</a> wakeQueues();<a name="89" href="#89">89</a> }<a name="90" href="#90">90</a> }<a name="91" href="#91">91</a> }<a name="92" href="#92">92</a> <a name="93" href="#93">93</a> <em>/**<em>* truncate reporting of queues at some large but not unbounded number */</em></em><a name="94" href="#94">94</a> <strong>private</strong> <strong>static</strong> <strong>final</strong> <strong>int</strong> REPORT_MAX_QUEUES = 2000;<a name="95" href="#95">95</a> <a name="96" href="#96">96</a> <em>/**<em>*</em></em><a name="97" href="#97">97</a> <em> * If we know that only a small amount of queues is held in memory,</em><a name="98" href="#98">98</a> <em> * we can avoid using a disk-based BigMap.</em><a name="99" href="#99">99</a> <em> * This only works efficiently if the WorkQueue does not hold its</em><a name="100" href="#100">100</a> <em> * entries in memory as well.</em><a name="101" href="#101">101</a> <em> */</em> <a name="102" href="#102">102</a> <strong>private</strong> <strong>static</strong> <strong>final</strong> <strong>int</strong> MAX_QUEUES_TO_HOLD_ALLQUEUES_IN_MEMORY = 3000;<a name="103" href="#103">103</a> <a name="104" href="#104">104</a> <em>/**<em>*</em></em><a name="105" href="#105">105</a> <em> * When a snooze target for a queue is longer than this amount, and </em><a name="106" href="#106">106</a> <em> * there are already ready queues, deactivate rather than snooze </em><a name="107" href="#107">107</a> <em> * the current queue -- so other more responsive sites get a chance</em><a name="108" href="#108">108</a> <em> * in active rotation. (As a result, queue's next try may be much</em><a name="109" href="#109">109</a> <em> * further in the future than the snooze target delay.)</em><a name="110" href="#110">110</a> <em> */</em><a name="111" href="#111">111</a> <strong>public</strong> <strong>final</strong> <strong>static</strong> String ATTR_SNOOZE_DEACTIVATE_MS =<a name="112" href="#112">112</a> <span class="string">"snooze-deactivate-ms"</span>;<a name="113" href="#113">113</a> <strong>public</strong> <strong>static</strong> Long DEFAULT_SNOOZE_DEACTIVATE_MS = <strong>new</strong> Long(5*60*1000); <em class="comment">// 5 minutes</em><a name="114" href="#114">114</a> <a name="115" href="#115">115</a> <strong>private</strong> <strong>static</strong> <strong>final</strong> Logger logger =<a name="116" href="#116">116</a> Logger.getLogger(WorkQueueFrontier.<strong>class</strong>.getName());<a name="117" href="#117">117</a> <a name="118" href="#118">118</a> <em>/**<em>* whether to hold queues INACTIVE until needed for throughput */</em></em><a name="119" href="#119">119</a> <strong>public</strong> <strong>final</strong> <strong>static</strong> String ATTR_HOLD_QUEUES = <span class="string">"hold-queues"</span>;<a name="120" href="#120">120</a> <strong>protected</strong> <strong>final</strong> <strong>static</strong> Boolean DEFAULT_HOLD_QUEUES = <strong>new</strong> Boolean(<strong>true</strong>); <a name="121" href="#121">121</a> <a name="122" href="#122">122</a> <em>/**<em>* amount to replenish budget on each activation (duty cycle) */</em></em><a name="123" href="#123">123</a> <strong>public</strong> <strong>final</strong> <strong>static</strong> String ATTR_BALANCE_REPLENISH_AMOUNT =<a name="124" href="#124">124</a> <span class="string">"balance-replenish-amount"</span>;<a name="125" href="#125">125</a> <strong>protected</strong> <strong>final</strong> <strong>static</strong> Integer DEFAULT_BALANCE_REPLENISH_AMOUNT =<a name="126" href="#126">126</a> <strong>new</strong> Integer(3000);<a name="127" href="#127">127</a> <a name="128" href="#128">128</a> <em>/**<em>* whether to hold queues INACTIVE until needed for throughput */</em></em><a name="129" href="#129">129</a> <strong>public</strong> <strong>final</strong> <strong>static</strong> String ATTR_ERROR_PENALTY_AMOUNT =<a name="130" href="#130">130</a> <span class="string">"error-penalty-amount"</span>;<a name="131" href="#131">131</a> <strong>protected</strong> <strong>final</strong> <strong>static</strong> Integer DEFAULT_ERROR_PENALTY_AMOUNT =<a name="132" href="#132">132</a> <strong>new</strong> Integer(100);<a name="133" href="#133">133</a> <a name="134" href="#134">134</a> ?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -