亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來(lái)到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關(guān)于我們
? 蟲蟲下載站

?? bloomfilter32bitsplit.html

?? 網(wǎng)絡(luò)爬蟲開(kāi)源代碼
?? HTML
?? 第 1 頁(yè) / 共 2 頁(yè)
字號(hào):
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"><!--NewPage--><HTML><HEAD><!-- Generated by javadoc (build 1.5.0_07) on Sun May 06 17:59:51 GMT 2007 --><TITLE>BloomFilter32bitSplit (Heritrix 1.12.1)</TITLE><META NAME="keywords" CONTENT="org.archive.util.BloomFilter32bitSplit class"><LINK REL ="stylesheet" TYPE="text/css" HREF="../../../stylesheet.css" TITLE="Style"><SCRIPT type="text/javascript">function windowTitle(){    parent.document.title="BloomFilter32bitSplit (Heritrix 1.12.1)";}</SCRIPT><NOSCRIPT></NOSCRIPT></HEAD><BODY BGCOLOR="white" onload="windowTitle();"><!-- ========= START OF TOP NAVBAR ======= --><A NAME="navbar_top"><!-- --></A><A HREF="#skip-navbar_top" title="Skip navigation links"></A><TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY=""><TR><TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1"><A NAME="navbar_top_firstrow"><!-- --></A><TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">  <TR ALIGN="center" VALIGN="top">  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> &nbsp;<FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="class-use/BloomFilter32bitSplit.html"><FONT CLASS="NavBarFont1"><B>Use</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A>&nbsp;</TD>  </TR></TABLE></TD><TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM></EM></TD></TR><TR><TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">&nbsp;<A HREF="../../../org/archive/util/BloomFilter32bit.html" title="class in org.archive.util"><B>PREV CLASS</B></A>&nbsp;&nbsp;<A HREF="../../../org/archive/util/BloomFilter32bp2.html" title="class in org.archive.util"><B>NEXT CLASS</B></A></FONT></TD><TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">  <A HREF="../../../index.html?org/archive/util/BloomFilter32bitSplit.html" target="_top"><B>FRAMES</B></A>  &nbsp;&nbsp;<A HREF="BloomFilter32bitSplit.html" target="_top"><B>NO FRAMES</B></A>  &nbsp;&nbsp;<SCRIPT type="text/javascript">  <!--  if(window==top) {    document.writeln('<A HREF="../../../allclasses-noframe.html"><B>All Classes</B></A>');  }  //--></SCRIPT><NOSCRIPT>  <A HREF="../../../allclasses-noframe.html"><B>All Classes</B></A></NOSCRIPT></FONT></TD></TR><TR><TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">  SUMMARY:&nbsp;NESTED&nbsp;|&nbsp;<A HREF="#field_summary">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_summary">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_summary">METHOD</A></FONT></TD><TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">DETAIL:&nbsp;<A HREF="#field_detail">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_detail">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_detail">METHOD</A></FONT></TD></TR></TABLE><A NAME="skip-navbar_top"></A><!-- ========= END OF TOP NAVBAR ========= --><HR><!-- ======== START OF CLASS DATA ======== --><H2><FONT SIZE="-1">org.archive.util</FONT><BR>Class BloomFilter32bitSplit</H2><PRE>java.lang.Object  <IMG SRC="../../../resources/inherit.gif" ALT="extended by "><B>org.archive.util.BloomFilter32bitSplit</B></PRE><DL><DT><B>All Implemented Interfaces:</B> <DD>java.io.Serializable, <A HREF="../../../org/archive/util/BloomFilter.html" title="interface in org.archive.util">BloomFilter</A></DD></DL><HR><DL><DT><PRE>public class <B>BloomFilter32bitSplit</B><DT>extends java.lang.Object<DT>implements java.io.Serializable, <A HREF="../../../org/archive/util/BloomFilter.html" title="interface in org.archive.util">BloomFilter</A></DL></PRE><P>A Bloom filter. SLIGHTLY ADAPTED VERSION OF MG4J it.unimi.dsi.mg4j.util.BloomFilter  <p>KEY CHANGES: <ul> <li>Adapted to use 32bit ops as much as possible... may be slightly faster on 32bit hardware/OS</li> <li>NUMBER_OF_WEIGHTS is 2083, to better avoid collisions between  similar strings</li> <li>Removed dependence on cern.colt MersenneTwister (replaced with SecureRandom) and QuickBitVector (replaced with local methods).</li> </ul>  <hr>  <P>Instances of this class represent a set of character sequences (with false positives) using a Bloom filter. Because of the way Bloom filters work, you cannot remove elements. <P>Bloom filters have an expected error rate, depending on the number of hash functions used, on the filter size and on the number of elements in the filter. This implementation uses a variable optimal number of hash functions, depending on the expected number of elements. More precisely, a Bloom filter for <var>n</var> character sequences with <var>d</var> hash functions will use ln 2 <var>d</var><var>n</var> &#8776; 1.44 <var>d</var><var>n</var> bits; false positives will happen with probability 2<sup>-<var>d</var></sup>. <P>Hash functions are generated at creation time using universal hashing. Each hash function uses <A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#NUMBER_OF_WEIGHTS"><CODE>NUMBER_OF_WEIGHTS</CODE></A> random integers, which are cyclically multiplied by the character codes in a character sequence. The resulting integers are XOR-ed together. <P>This class exports access methods that are very similar to those of <CODE>Set</CODE>, but it does not implement that interface, as too many non-optional methods would be unimplementable (e.g., iterators).<P><P><DL><DT><B>Author:</B></DT>  <DD>Sebastiano Vigna</DD><DT><B>See Also:</B><DD><A HREF="../../../serialized-form.html#org.archive.util.BloomFilter32bitSplit">Serialized Form</A></DL><HR><P><!-- =========== FIELD SUMMARY =========== --><A NAME="field_summary"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""><TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2"><B>Field Summary</B></FONT></TH></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>protected static&nbsp;long</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#ADDRESS_BITS_PER_UNIT">ADDRESS_BITS_PER_UNIT</A></B></CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>protected static&nbsp;long</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#BIT_INDEX_MASK">BIT_INDEX_MASK</A></B></CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;int</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#d">d</A></B></CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;The number of hash functions used by this filter.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;long</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#m">m</A></B></CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;The number of bits in this filter.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>static&nbsp;int</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#NUMBER_OF_WEIGHTS">NUMBER_OF_WEIGHTS</A></B></CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;The number of weights used to create hash functions.</TD></TR></TABLE>&nbsp;<!-- ======== CONSTRUCTOR SUMMARY ======== --><A NAME="constructor_summary"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""><TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2"><B>Constructor Summary</B></FONT></TH></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#BloomFilter32bitSplit(int, int)">BloomFilter32bitSplit</A></B>(int&nbsp;n,                      int&nbsp;d)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Creates a new Bloom filter with given number of hash functions and expected number of elements.</TD></TR></TABLE>&nbsp;<!-- ========== METHOD SUMMARY =========== --><A NAME="method_summary"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""><TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2"><B>Method Summary</B></FONT></TH></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;boolean</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#add(java.lang.CharSequence)">add</A></B>(java.lang.CharSequence&nbsp;s)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Adds a character sequence to the filter.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;boolean</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#contains(java.lang.CharSequence)">contains</A></B>(java.lang.CharSequence&nbsp;s)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Checks whether the given character sequence is in this filter.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>protected &nbsp;boolean</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#getBit(long)">getBit</A></B>(long&nbsp;bitIndex)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns from the local bitvector the value of the bit with  the specified index.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;long</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#getSizeBytes()">getSizeBytes</A></B>()</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;The amount of memory in bytes consumed by the bloom  bitfield.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>protected &nbsp;void</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#setBit(long)">setBit</A></B>(long&nbsp;bitIndex)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Changes the bit with index <tt>bitIndex</tt> in local bitvector.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>protected &nbsp;boolean</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#setGetBit(long)">setGetBit</A></B>(long&nbsp;bitIndex)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Sets the bit with index <tt>bitIndex</tt> in local bitvector --  returning the old value.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;int</CODE></FONT></TD><TD><CODE><B><A HREF="../../../org/archive/util/BloomFilter32bitSplit.html#size()">size</A></B>()</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;The number of character sequences in the filter.</TD></TR></TABLE>&nbsp;<A NAME="methods_inherited_from_class_java.lang.Object"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""><TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor"><TH ALIGN="left"><B>Methods inherited from class java.lang.Object</B></TH></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD><CODE>clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait</CODE></TD></TR></TABLE>&nbsp;<P><!-- ============ FIELD DETAIL =========== -->

?? 快捷鍵說(shuō)明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號(hào) Ctrl + =
減小字號(hào) Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
a亚洲天堂av| 日韩avvvv在线播放| 亚洲一区二区视频在线| 偷偷要91色婷婷| 精品一区二区在线视频| 懂色中文一区二区在线播放| 91蝌蚪porny九色| 91精品在线麻豆| 国产精品情趣视频| 午夜精品视频在线观看| 国产盗摄女厕一区二区三区| 91色综合久久久久婷婷| 欧美一区二区三区播放老司机| 精品成a人在线观看| 亚洲欧美偷拍卡通变态| 玖玖九九国产精品| 91亚洲精品久久久蜜桃网站| 欧美一卡2卡三卡4卡5免费| 中文字幕成人在线观看| 亚洲综合色成人| 精品一区精品二区高清| 白白色亚洲国产精品| 欧美日本在线观看| 久久综合九色综合97婷婷女人| 亚洲欧洲一区二区三区| 日韩精品国产精品| 懂色一区二区三区免费观看 | 国产一区二区久久| 91免费小视频| 日韩欧美另类在线| 亚洲男人的天堂网| 久久精品99国产精品| 懂色av一区二区三区免费观看| jiyouzz国产精品久久| 91国在线观看| 日韩亚洲欧美综合| 国产精品欧美经典| 久久国产精品第一页| 91在线观看美女| 日韩欧美中文一区| 亚洲天堂久久久久久久| 精品一区二区综合| 欧美亚洲日本国产| 国产精品私房写真福利视频| 亚洲成人av中文| www.亚洲人| 精品国产91久久久久久久妲己| 亚洲色欲色欲www| 欧美性高清videossexo| 国产午夜亚洲精品羞羞网站| 亚洲一区二区三区激情| 风间由美性色一区二区三区| 日韩女优av电影| 亚洲自拍欧美精品| 北条麻妃一区二区三区| 2017欧美狠狠色| 亚洲国产一二三| a美女胸又www黄视频久久| 久久只精品国产| 婷婷成人激情在线网| 日本精品一区二区三区高清| 国产喷白浆一区二区三区| 三级一区在线视频先锋 | 欧美一级艳片视频免费观看| 亚洲欧洲在线观看av| 国产精品18久久久久久久久| 91精品久久久久久久99蜜桃 | 青青青伊人色综合久久| 欧美怡红院视频| 亚洲欧洲在线观看av| 国产成人综合亚洲网站| 精品免费日韩av| 日本不卡免费在线视频| 欧美视频在线一区| 亚洲精品乱码久久久久久| 不卡的看片网站| 国产网红主播福利一区二区| 黄色资源网久久资源365| 51精品秘密在线观看| 亚洲影视在线观看| 91成人在线观看喷潮| 亚洲天堂2014| 91网站黄www| 最近日韩中文字幕| 国产一区二区三区在线观看免费视频| 欧美日韩黄色一区二区| 亚洲欧美日韩国产另类专区| 成人av在线网站| 欧美国产精品中文字幕| 成人久久视频在线观看| 国产精品视频一区二区三区不卡| 国产精品综合av一区二区国产馆| 精品日韩成人av| 国产在线观看免费一区| 久久久99精品免费观看不卡| 国产又黄又大久久| 国产三级精品三级| 成人妖精视频yjsp地址| 久久亚洲一区二区三区明星换脸| 久久99在线观看| 久久久久久久久免费| 国产精品99久久久久久有的能看| 久久这里只有精品视频网| 国产精品香蕉一区二区三区| 欧美国产精品一区二区| 成人sese在线| 一区av在线播放| 7777精品伊人久久久大香线蕉| 视频在线观看国产精品| 日韩视频永久免费| 国产在线不卡一卡二卡三卡四卡| 国产亚洲欧美色| 99re成人精品视频| 亚洲国产日韩一级| 日韩一级大片在线| 国产福利视频一区二区三区| 国产视频一区在线播放| 国产露脸91国语对白| 国产女主播一区| jizzjizzjizz欧美| 舔着乳尖日韩一区| 久久久久久久久久电影| av影院午夜一区| 午夜电影网一区| 久久综合九色综合97婷婷| 北岛玲一区二区三区四区| 亚洲国产欧美日韩另类综合 | 欧美日韩美女一区二区| 日本成人在线不卡视频| 国产区在线观看成人精品| 色偷偷88欧美精品久久久| 日日夜夜精品视频天天综合网| 欧美大度的电影原声| 成人国产精品免费观看| 午夜一区二区三区在线观看| 欧美精品一区二| 94色蜜桃网一区二区三区| 婷婷六月综合网| 国产精品免费丝袜| 欧美精品乱人伦久久久久久| 国产麻豆一精品一av一免费| 亚洲男帅同性gay1069| 精品盗摄一区二区三区| 91蜜桃在线观看| 裸体健美xxxx欧美裸体表演| 国产亚洲女人久久久久毛片| 一本色道a无线码一区v| 青青国产91久久久久久| 中文子幕无线码一区tr | 亚洲品质自拍视频网站| 51午夜精品国产| 色婷婷av一区二区三区gif| 精品一区二区三区在线播放| 久久天堂av综合合色蜜桃网| 成人福利视频网站| 激情欧美日韩一区二区| 亚洲午夜av在线| 国产精品久久久久一区二区三区| 日韩一区二区三区视频在线| av男人天堂一区| 久久99在线观看| 天天综合网 天天综合色| 国产精品电影一区二区| 337p亚洲精品色噜噜噜| 成人国产精品免费观看动漫 | 欧美麻豆精品久久久久久| 成人免费av网站| 韩国女主播一区二区三区| 五月天久久比比资源色| 亚洲丝袜精品丝袜在线| 国产偷国产偷亚洲高清人白洁| 欧美图片一区二区三区| 972aa.com艺术欧美| 国产aⅴ精品一区二区三区色成熟| 日本不卡视频一二三区| 亚洲成av人片在线观看无码| 欧美极品另类videosde| 欧美一区欧美二区| 4438成人网| 欧美日韩夫妻久久| 色8久久精品久久久久久蜜| 成人免费观看av| 风间由美一区二区三区在线观看 | 卡一卡二国产精品| 五月婷婷激情综合| 亚洲一区在线观看免费观看电影高清| 国产精品三级电影| 国产欧美一区二区三区网站| 日韩午夜精品视频| 欧美日韩精品一二三区| 日本久久电影网| 91偷拍与自偷拍精品| av在线播放成人| 99国产精品久久久久| av电影天堂一区二区在线观看| 国产精品一二三四| 久草这里只有精品视频| 久99久精品视频免费观看| 九一九一国产精品| 国内外精品视频|