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

📄 memfpmergeuriuniqfilter.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>MemFPMergeUriUniqFilter xref</title><link type="text/css" rel="stylesheet" href="../../../../stylesheet.css" /></head><body><div id="overview"><a href="../../../../../apidocs/org/archive/crawler/util/MemFPMergeUriUniqFilter.html">View Javadoc</a></div><pre><a name="1" href="#1">1</a>   <em class="comment">/*<em class="comment"> MemFPMergeUriUniqFilter</em></em><a name="2" href="#2">2</a>   <em class="comment">*</em><a name="3" href="#3">3</a>   <em class="comment">* $Id: MemFPMergeUriUniqFilter.java,v 1.1 2005/12/16 03:10:54 gojomo Exp $</em><a name="4" href="#4">4</a>   <em class="comment">*</em><a name="5" href="#5">5</a>   <em class="comment">* Created on Dec 14, 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/util/package-summary.html">org.archive.crawler.util</a>;<a name="26" href="#26">26</a>  <a name="27" href="#27">27</a>  <strong>import</strong> it.unimi.dsi.fastutil.longs.LongArrayList;<a name="28" href="#28">28</a>  <strong>import</strong> it.unimi.dsi.fastutil.longs.LongIterator;<a name="29" href="#29">29</a>  <a name="30" href="#30">30</a>  <em>/**<em>*</em></em><a name="31" href="#31">31</a>  <em> * Crude all-in-memory FP-merging UriUniqFilter. </em><a name="32" href="#32">32</a>  <em> * </em><a name="33" href="#33">33</a>  <em> * @author gojomo</em><a name="34" href="#34">34</a>  <em> */</em><a name="35" href="#35">35</a>  <strong>public</strong> <strong>class</strong> <a href="../../../../org/archive/crawler/util/MemFPMergeUriUniqFilter.html">MemFPMergeUriUniqFilter</a> <strong>extends</strong> <a href="../../../../org/archive/crawler/util/FPMergeUriUniqFilter.html">FPMergeUriUniqFilter</a> {<a name="36" href="#36">36</a>      <strong>protected</strong> LongArrayList allFps = <strong>new</strong> LongArrayList();<a name="37" href="#37">37</a>      <strong>protected</strong> LongArrayList newFps;<a name="38" href="#38">38</a>      <a name="39" href="#39">39</a>      <em class="comment">/*<em class="comment"> (non-Javadoc)</em></em><a name="40" href="#40">40</a>  <em class="comment">     * @see org.archive.crawler.util.FPMergeUriUniqFilter#beginFpMerge()</em><a name="41" href="#41">41</a>  <em class="comment">     */</em><a name="42" href="#42">42</a>      <strong>protected</strong> LongIterator beginFpMerge() {<a name="43" href="#43">43</a>          <strong>new</strong>Fps = <strong>new</strong> LongArrayList((<strong>int</strong>) (allFps.size()+(pending()/2)));<a name="44" href="#44">44</a>          <strong>return</strong> allFps.longIterator();<a name="45" href="#45">45</a>      }<a name="46" href="#46">46</a>  <a name="47" href="#47">47</a>      <em class="comment">/*<em class="comment"> (non-Javadoc)</em></em><a name="48" href="#48">48</a>  <em class="comment">     * @see org.archive.crawler.util.FPMergeUriUniqFilter#addNewFp(java.lang.Long)</em><a name="49" href="#49">49</a>  <em class="comment">     */</em><a name="50" href="#50">50</a>      <strong>protected</strong> <strong>void</strong> addNewFp(<strong>long</strong> currFp) {<a name="51" href="#51">51</a>          newFps.add(currFp);<a name="52" href="#52">52</a>      }<a name="53" href="#53">53</a>  <a name="54" href="#54">54</a>      <em class="comment">/*<em class="comment"> (non-Javadoc)</em></em><a name="55" href="#55">55</a>  <em class="comment">     * @see org.archive.crawler.util.FPMergeUriUniqFilter#finishFpMerge()</em><a name="56" href="#56">56</a>  <em class="comment">     */</em><a name="57" href="#57">57</a>      <strong>protected</strong> <strong>void</strong> finishFpMerge() {<a name="58" href="#58">58</a>          allFps = newFps;<a name="59" href="#59">59</a>          newFps = <strong>null</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.crawler.datamodel.UriUniqFilter#count()</em><a name="64" href="#64">64</a>  <em class="comment">     */</em><a name="65" href="#65">65</a>      <strong>public</strong> <strong>long</strong> count() {<a name="66" href="#66">66</a>          <strong>return</strong> allFps.size();<a name="67" href="#67">67</a>      }<a name="68" href="#68">68</a>  <a name="69" href="#69">69</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 + -