?? memuriuniqfilter.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>MemUriUniqFilter xref</title><link type="text/css" rel="stylesheet" href="../../../../stylesheet.css" /></head><body><div id="overview"><a href="../../../../../apidocs/org/archive/crawler/util/MemUriUniqFilter.html">View Javadoc</a></div><pre><a name="1" href="#1">1</a> <em class="comment">/*<em class="comment"> Copyright (C) 2003 Internet Archive.</em></em><a name="2" href="#2">2</a> <em class="comment"> *</em><a name="3" href="#3">3</a> <em class="comment"> * This file is part of the Heritrix web crawler (crawler.archive.org).</em><a name="4" href="#4">4</a> <em class="comment"> *</em><a name="5" href="#5">5</a> <em class="comment"> * Heritrix is free software; you can redistribute it and/or modify</em><a name="6" href="#6">6</a> <em class="comment"> * it under the terms of the GNU Lesser Public License as published by</em><a name="7" href="#7">7</a> <em class="comment"> * the Free Software Foundation; either version 2.1 of the License, or</em><a name="8" href="#8">8</a> <em class="comment"> * any later version.</em><a name="9" href="#9">9</a> <em class="comment"> *</em><a name="10" href="#10">10</a> <em class="comment"> * Heritrix is distributed in the hope that it will be useful,</em><a name="11" href="#11">11</a> <em class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</em><a name="12" href="#12">12</a> <em class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</em><a name="13" href="#13">13</a> <em class="comment"> * GNU Lesser Public License for more details.</em><a name="14" href="#14">14</a> <em class="comment"> *</em><a name="15" href="#15">15</a> <em class="comment"> * You should have received a copy of the GNU Lesser Public License</em><a name="16" href="#16">16</a> <em class="comment"> * along with Heritrix; if not, write to the Free Software</em><a name="17" href="#17">17</a> <em class="comment"> * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</em><a name="18" href="#18">18</a> <em class="comment"> *</em><a name="19" href="#19">19</a> <em class="comment"> * MemUURISet.java</em><a name="20" href="#20">20</a> <em class="comment"> * Created on Sep 15, 2003</em><a name="21" href="#21">21</a> <em class="comment"> *</em><a name="22" href="#22">22</a> <em class="comment"> * $Header$</em><a name="23" href="#23">23</a> <em class="comment"> */</em><a name="24" href="#24">24</a> <strong>package</strong> <a href="../../../../org/archive/crawler/util/package-summary.html">org.archive.crawler.util</a>;<a name="25" href="#25">25</a> <a name="26" href="#26">26</a> <strong>import</strong> java.util.HashSet;<a name="27" href="#27">27</a> <a name="28" href="#28">28</a> <em>/**<em>*</em></em><a name="29" href="#29">29</a> <em> * A purely in-memory UriUniqFilter based on a HashSet, which remembers</em><a name="30" href="#30">30</a> <em> * every full URI string it sees. </em><a name="31" href="#31">31</a> <em> * </em><a name="32" href="#32">32</a> <em> * @author gojomo</em><a name="33" href="#33">33</a> <em> *</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/MemUriUniqFilter.html">MemUriUniqFilter</a><a name="36" href="#36">36</a> <strong>extends</strong> <a href="../../../../org/archive/crawler/util/SetBasedUriUniqFilter.html">SetBasedUriUniqFilter</a> {<a name="37" href="#37">37</a> HashSet<CharSequence> hashSet; <a name="38" href="#38">38</a> <a name="39" href="#39">39</a> <strong>protected</strong> <strong>synchronized</strong> <strong>boolean</strong> setAdd(CharSequence uri) {<a name="40" href="#40">40</a> <strong>return</strong> hashSet.add(uri);<a name="41" href="#41">41</a> }<a name="42" href="#42">42</a> <strong>protected</strong> <strong>synchronized</strong> <strong>boolean</strong> setRemove(CharSequence uri) {<a name="43" href="#43">43</a> <strong>return</strong> hashSet.remove(uri);<a name="44" href="#44">44</a> }<a name="45" href="#45">45</a> <strong>protected</strong> <strong>synchronized</strong> <strong>long</strong> setCount() {<a name="46" href="#46">46</a> <strong>return</strong> (<strong>long</strong>)hashSet.size();<a name="47" href="#47">47</a> }<a name="48" href="#48">48</a> <a name="49" href="#49">49</a> <em class="comment">/*<em class="comment"> (non-Javadoc)</em></em><a name="50" href="#50">50</a> <em class="comment"> * @see org.archive.crawler.util.UriUniqFilterImpl#createUriSet()</em><a name="51" href="#51">51</a> <em class="comment"> */</em><a name="52" href="#52">52</a> <strong>protected</strong> <strong>void</strong> createUriSet() {<a name="53" href="#53">53</a> hashSet = <strong>new</strong> HashSet<CharSequence>();<a name="54" href="#54">54</a> }<a name="55" href="#55">55</a> <a name="56" href="#56">56</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 + -