?? lexicalcrawlmapper.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>LexicalCrawlMapper xref</title><link type="text/css" rel="stylesheet" href="../../../../stylesheet.css" /></head><body><div id="overview"><a href="../../../../../apidocs/org/archive/crawler/processor/LexicalCrawlMapper.html">View Javadoc</a></div><pre><a name="1" href="#1">1</a> <em class="comment">/*<em class="comment"> LexicalCrawlMapper</em></em><a name="2" href="#2">2</a> <em class="comment"> * </em><a name="3" href="#3">3</a> <em class="comment"> * Created on Sep 30, 2005</em><a name="4" href="#4">4</a> <em class="comment"> *</em><a name="5" href="#5">5</a> <em class="comment"> * Copyright (C) 2005 Internet Archive.</em><a name="6" href="#6">6</a> <em class="comment"> * </em><a name="7" href="#7">7</a> <em class="comment"> * This file is part of the Heritrix web crawler (crawler.archive.org).</em><a name="8" href="#8">8</a> <em class="comment"> * </em><a name="9" href="#9">9</a> <em class="comment"> * Heritrix is free software; you can redistribute it and/or modify</em><a name="10" href="#10">10</a> <em class="comment"> * it under the terms of the GNU Lesser Public License as published by</em><a name="11" href="#11">11</a> <em class="comment"> * the Free Software Foundation; either version 2.1 of the License, or</em><a name="12" href="#12">12</a> <em class="comment"> * any later version.</em><a name="13" href="#13">13</a> <em class="comment"> * </em><a name="14" href="#14">14</a> <em class="comment"> * Heritrix is distributed in the hope that it will be useful, </em><a name="15" href="#15">15</a> <em class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</em><a name="16" href="#16">16</a> <em class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</em><a name="17" href="#17">17</a> <em class="comment"> * GNU Lesser Public License for more details.</em><a name="18" href="#18">18</a> <em class="comment"> * </em><a name="19" href="#19">19</a> <em class="comment"> * You should have received a copy of the GNU Lesser Public License</em><a name="20" href="#20">20</a> <em class="comment"> * along with Heritrix; if not, write to the Free Software</em><a name="21" href="#21">21</a> <em class="comment"> * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</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/processor/package-summary.html">org.archive.crawler.processor</a>;<a name="24" href="#24">24</a> <a name="25" href="#25">25</a> <strong>import</strong> java.io.BufferedReader;<a name="26" href="#26">26</a> <strong>import</strong> java.io.File;<a name="27" href="#27">27</a> <strong>import</strong> java.io.FileReader;<a name="28" href="#28">28</a> <strong>import</strong> java.io.IOException;<a name="29" href="#29">29</a> <strong>import</strong> java.io.InputStreamReader;<a name="30" href="#30">30</a> <strong>import</strong> java.io.Reader;<a name="31" href="#31">31</a> <strong>import</strong> java.net.URL;<a name="32" href="#32">32</a> <strong>import</strong> java.net.URLConnection;<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.SortedMap;<a name="35" href="#35">35</a> <strong>import</strong> java.util.TreeMap;<a name="36" href="#36">36</a> <a name="37" href="#37">37</a> <strong>import</strong> org.archive.crawler.datamodel.CandidateURI;<a name="38" href="#38">38</a> <strong>import</strong> org.archive.crawler.settings.SimpleType;<a name="39" href="#39">39</a> <strong>import</strong> org.archive.util.iterator.LineReadingIterator;<a name="40" href="#40">40</a> <strong>import</strong> org.archive.util.iterator.RegexpLineIterator;<a name="41" href="#41">41</a> <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> * A simple crawl splitter/mapper, dividing up CandidateURIs/CrawlURIs</em><a name="45" href="#45">45</a> <em> * between crawlers by diverting some range of URIs to local log files</em><a name="46" href="#46">46</a> <em> * (which can then be imported to other crawlers). </em><a name="47" href="#47">47</a> <em> * </em><a name="48" href="#48">48</a> <em> * May operate on a CrawlURI (typically early in the processing chain) or</em><a name="49" href="#49">49</a> <em> * its CandidateURI outlinks (late in the processing chain, after </em><a name="50" href="#50">50</a> <em> * LinksScoper), or both (if inserted and configured in both places). </em><a name="51" href="#51">51</a> <em> * </em><a name="52" href="#52">52</a> <em> * <p>Uses lexical comparisons of classKeys to map URIs to crawlers. The</em><a name="53" href="#53">53</a> <em> * 'map' is specified via either a local or HTTP-fetchable file. Each</em><a name="54" href="#54">54</a> <em> * line of this file should contain two space-separated tokens, the</em><a name="55" href="#55">55</a> <em> * first a key and the second a crawler node name (which should be</em><a name="56" href="#56">56</a> <em> * legal as part of a filename). All URIs will be mapped to the crawler</em><a name="57" href="#57">57</a> <em> * node name associated with the nearest mapping key equal or subsequent </em><a name="58" href="#58">58</a> <em> * to the URI's own classKey. If there are no mapping keys equal or </em><a name="59" href="#59">59</a> <em> * after the classKey, the mapping 'wraps around' to the first mapping key.</em><a name="60" href="#60">60</a> <em> * </em><a name="61" href="#61">61</a> <em> * <p>One crawler name is distinguished as the 'local name'; URIs mapped to</em><a name="62" href="#62">62</a> <em> * this name are not diverted, but continue to be processed normally.</em><a name="63" href="#63">63</a> <em> * </em><a name="64" href="#64">64</a> <em> * <p>For example, assume a SurtAuthorityQueueAssignmentPolicy and</em><a name="65" href="#65">65</a> <em> * a simple mapping file:</em><a name="66" href="#66">66</a> <em> * </em><a name="67" href="#67">67</a> <em> * <pre></em><a name="68" href="#68">68</a> <em> * d crawlerA</em><a name="69" href="#69">69</a> <em> * ~ crawlerB</em><a name="70" href="#70">70</a> <em> * </pre></em><a name="71" href="#71">71</a> <em> * <p>All URIs with "com," classKeys will find the 'd' key as the nearest</em><a name="72" href="#72">72</a> <em> * subsequent mapping key, and thus be mapped to 'crawlerA'. If that's</em><a name="73" href="#73">73</a> <em> * the 'local name', the URIs will be processed normally; otherwise, the</em><a name="74" href="#74">74</a> <em> * URI will be written to a diversion log aimed for 'crawlerA'. </em><a name="75" href="#75">75</a> <em> * </em><a name="76" href="#76">76</a> <em> * <p>If using the JMX importUris operation importing URLs dropped by</em><a name="77" href="#77">77</a> <em> * a {@link LexicalCrawlMapper} instance, use <code>recoveryLog</code> style.</em><a name="78" href="#78">78</a> <em> * </em><a name="79" href="#79">79</a> <em> * @author gojomo</em><a name="80" href="#80">80</a> <em> * @version $Date: 2006-09-26 20:38:48 +0000 (Tue, 26 Sep 2006) $, $Revision: 4667 $</em><a name="81" href="#81">81</a> <em> */</em><a name="82" href="#82">82</a> <strong>public</strong> <strong>class</strong> <a href="../../../../org/archive/crawler/processor/LexicalCrawlMapper.html">LexicalCrawlMapper</a> <strong>extends</strong> <a href="../../../../org/archive/crawler/processor/CrawlMapper.html">CrawlMapper</a> {<a name="83" href="#83">83</a> <strong>private</strong> <strong>static</strong> <strong>final</strong> <strong>long</strong> serialVersionUID = 1L;<a name="84" href="#84">84</a> <a name="85" href="#85">85</a> <em>/**<em>* where to load map from */</em></em><a name="86" href="#86">86</a> <strong>public</strong> <strong>static</strong> <strong>final</strong> String ATTR_MAP_SOURCE = <span class="string">"map-source"</span>;?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -