婷婷综合国产,91蜜桃婷婷狠狠久久综合9色 ,九九九九九精品,国产综合av

主頁 > 知識庫 > java Lucene 中自定義排序的實現

java Lucene 中自定義排序的實現
熱門標簽：開封便宜外呼系統報價 黃石智能營銷電銷機器人效果 怎樣把地圖標注出來 淮南騰訊地圖標注 騰訊地圖標注商戶改名注冊入駐 電話機器人的特色和創新 漯河辦理400電話 地圖標注人員兼職 商丘百應電話機器人有沒有效果
Lucene中的自定義排序功能和Java集合中的自定義排序的實現方法差不多,都要實現一下比較接口. 在Java中只要實現Comparable接口就可以了.但是在Lucene中要實現SortComparatorSource接口和ScoreDocComparator接口.在了解具體實現方法之前先來看看這兩個接口的定義吧.
SortComparatorSource接口的功能是返回一個用來排序ScoreDocs的comparator(Expert: returns a comparator for sorting ScoreDocs).該接口只定義了一個方法.如下:
Java代碼
/**
* Creates a comparator for the field in the given index.
* @param reader - Index to create comparator for.
* @param fieldname - Field to create comparator for.
* @return Comparator of ScoreDoc objects.
* @throws IOException - If an error occurs reading the index.
*/
public ScoreDocComparator newComparator(IndexReader reader,String fieldname) throws IOException
view plaincopy to clipboardprint?
/**
* Creates a comparator for the field in the given index.
* @param reader - Index to create comparator for.
* @param fieldname - Field to create comparator for.
* @return Comparator of ScoreDoc objects.
* @throws IOException - If an error occurs reading the index.
*/
public ScoreDocComparator newComparator(IndexReader reader,String fieldname) throws IOException
/**
* Creates a comparator for the field in the given index.
* @param reader - Index to create comparator for.
* @param fieldname - Field to create comparator for.
* @return Comparator of ScoreDoc objects.
* @throws IOException - If an error occurs reading the index.
*/
public ScoreDocComparator newComparator(IndexReader reader,String fieldname) throws IOException
該方法只是創造一個ScoreDocComparator 實例用來實現排序.所以我們還要實現ScoreDocComparator 接口.來看看ScoreDocComparator 接口.功能是比較來兩個ScoreDoc 對象來排序(Compares two ScoreDoc objects for sorting) 里面定義了兩個Lucene實現的靜態實例.如下:
Java代碼
//Special comparator for sorting hits according to computed relevance (document score).
public static final ScoreDocComparator RELEVANCE;
//Special comparator for sorting hits according to index order (document number).
public static final ScoreDocComparator INDEXORDER;
view plaincopy to clipboardprint?
//Special comparator for sorting hits according to computed relevance (document score).
public static final ScoreDocComparator RELEVANCE;
//Special comparator for sorting hits according to index order (document number).
public static final ScoreDocComparator INDEXORDER;
//Special comparator for sorting hits according to computed relevance (document score).
public static final ScoreDocComparator RELEVANCE;

//Special comparator for sorting hits according to index order (document number).
public static final ScoreDocComparator INDEXORDER;
有3個方法與排序相關,需要我們實現 分別如下:
Java代碼
/**
* Compares two ScoreDoc objects and returns a result indicating their sort order.
* @param i First ScoreDoc
* @param j Second ScoreDoc
* @return -1 if i should come before j;
* 1 if i should come after j;
* 0 if they are equal
*/
public int compare(ScoreDoc i,ScoreDoc j);
/**
* Returns the value used to sort the given document. The object returned must implement the java.io.Serializable interface. This is used by multisearchers to determine how to collate results from their searchers.
* @param i Document
* @return Serializable object
*/
public Comparable sortValue(ScoreDoc i);
/**
* Returns the type of sort. Should return SortField.SCORE, SortField.DOC, SortField.STRING, SortField.INTEGER, SortField.FLOAT or SortField.CUSTOM. It is not valid to return SortField.AUTO. This is used by multisearchers to determine how to collate results from their searchers.
* @return One of the constants in SortField.
*/
public int sortType();
view plaincopy to clipboardprint?
/**
* Compares two ScoreDoc objects and returns a result indicating their sort order.
* @param i First ScoreDoc
* @param j Second ScoreDoc
* @return -1 if i should come before j;
* 1 if i should come after j;
* 0 if they are equal
*/
public int compare(ScoreDoc i,ScoreDoc j);
/**
* Returns the value used to sort the given document. The object returned must implement the java.io.Serializable interface. This is used by multisearchers to determine how to collate results from their searchers.
* @param i Document
* @return Serializable object
*/
public Comparable sortValue(ScoreDoc i);
/**
* Returns the type of sort. Should return SortField.SCORE, SortField.DOC, SortField.STRING, SortField.INTEGER, SortField.FLOAT or SortField.CUSTOM. It is not valid to return SortField.AUTO. This is used by multisearchers to determine how to collate results from their searchers.
* @return One of the constants in SortField.
*/
public int sortType();
/**
     * Compares two ScoreDoc objects and returns a result indicating their sort order.
     * @param i First ScoreDoc
     * @param j Second ScoreDoc
     * @return -1 if i should come before j;
     * 1 if i should come after j;
     * 0 if they are equal
     */
    public int compare(ScoreDoc i,ScoreDoc j);
    /**
     * Returns the value used to sort the given document. The object returned must implement the java.io.Serializable interface. This is used by multisearchers to determine how to collate results from their searchers.
     * @param i Document
     * @return Serializable object
     */
    public Comparable sortValue(ScoreDoc i);
    /**
     * Returns the type of sort. Should return SortField.SCORE, SortField.DOC, SortField.STRING, SortField.INTEGER, SortField.FLOAT or SortField.CUSTOM. It is not valid to return SortField.AUTO. This is used by multisearchers to determine how to collate results from their searchers.
     * @return One of the constants in SortField.
     */
    public int sortType();
看個例子吧!
該例子為Lucene in Action中的一個實現,用來搜索距你最近的餐館的名字. 餐館坐標用字符串"x,y"來存儲.
Java代碼
package com.nikee.lucene;
import java.io.IOException;
import org.apache.lucene.index.IndexReader;
import org.apache.lucene.index.Term;
import org.apache.lucene.index.TermDocs;
import org.apache.lucene.index.TermEnum;
import org.apache.lucene.search.ScoreDoc;
import org.apache.lucene.search.ScoreDocComparator;
import org.apache.lucene.search.SortComparatorSource;
import org.apache.lucene.search.SortField;
//實現了搜索距你最近的餐館的名字. 餐館坐標用字符串"x,y"來存儲
//DistanceComparatorSource 實現了SortComparatorSource接口
public class DistanceComparatorSource implements SortComparatorSource {
private static final long serialVersionUID = 1L;
// x y 用來保存 坐標位置
private int x;
private int y;
public DistanceComparatorSource(int x, int y) {
this.x = x;
this.y = y;
}
// 返回ScoreDocComparator 用來實現排序功能
public ScoreDocComparator newComparator(IndexReader reader, String fieldname) throws IOException {
return new DistanceScoreDocLookupComparator(reader, fieldname, x, y);
}
//DistanceScoreDocLookupComparator 實現了ScoreDocComparator 用來排序
private static class DistanceScoreDocLookupComparator implements ScoreDocComparator {
private float[] distances; // 保存每個餐館到指定點的距離
// 構造函數 , 構造函數在這里幾乎完成所有的準備工作.
public DistanceScoreDocLookupComparator(IndexReader reader, String fieldname, int x, int y) throws IOException {
System.out.println("fieldName2="+fieldname);
final TermEnum enumerator = reader.terms(new Term(fieldname, ""));
System.out.println("maxDoc="+reader.maxDoc());
distances = new float[reader.maxDoc()]; // 初始化distances
if (distances.length > 0) {
TermDocs termDocs = reader.termDocs();
try {
if (enumerator.term() == null) {
throw new RuntimeException("no terms in field " + fieldname);
}
int i = 0,j = 0;
do {
System.out.println("in do-while :" + i ++);
Term term = enumerator.term(); // 取出每一個Term
if (term.field() != fieldname) // 與給定的域不符合則比較下一個
break;
//Sets this to the data for the current term in a TermEnum.
//This may be optimized in some implementations.
termDocs.seek(enumerator); //參考TermDocs Doc
while (termDocs.next()) {
System.out.println(" in while :" + j ++);
System.out.println(" in while ,Term :" + term.toString());
String[] xy = term.text().split(","); // 去處x y
int deltax = Integer.parseInt(xy[0]) - x;
int deltay = Integer.parseInt(xy[1]) - y;
// 計算距離
distances[termDocs.doc()] = (float) Math.sqrt(deltax * deltax + deltay * deltay);
}
}
while (enumerator.next());
} finally {
termDocs.close();
}
}
}
//有上面的構造函數的準備 這里就比較簡單了
public int compare(ScoreDoc i, ScoreDoc j) {
if (distances[i.doc] distances[j.doc])
return -1;
if (distances[i.doc] > distances[j.doc])
return 1;
return 0;
}
// 返回距離
public Comparable sortValue(ScoreDoc i) {
return new Float(distances[i.doc]);
}
//指定SortType
public int sortType() {
return SortField.FLOAT;
}
}
public String toString() {
return "Distance from (" + x + "," + y + ")";
}
}
view plaincopy to clipboardprint?
package com.nikee.lucene;
import java.io.IOException;
import org.apache.lucene.index.IndexReader;
import org.apache.lucene.index.Term;
import org.apache.lucene.index.TermDocs;
import org.apache.lucene.index.TermEnum;
import org.apache.lucene.search.ScoreDoc;
import org.apache.lucene.search.ScoreDocComparator;
import org.apache.lucene.search.SortComparatorSource;
import org.apache.lucene.search.SortField;
//實現了搜索距你最近的餐館的名字. 餐館坐標用字符串"x,y"來存儲
//DistanceComparatorSource 實現了SortComparatorSource接口
public class DistanceComparatorSource implements SortComparatorSource {
private static final long serialVersionUID = 1L;
// x y 用來保存 坐標位置
private int x;
private int y;
public DistanceComparatorSource(int x, int y) {
this.x = x;
this.y = y;
}
// 返回ScoreDocComparator 用來實現排序功能
public ScoreDocComparator newComparator(IndexReader reader, String fieldname) throws IOException {
return new DistanceScoreDocLookupComparator(reader, fieldname, x, y);
}
//DistanceScoreDocLookupComparator 實現了ScoreDocComparator 用來排序
private static class DistanceScoreDocLookupComparator implements ScoreDocComparator {
private float[] distances; // 保存每個餐館到指定點的距離
// 構造函數 , 構造函數在這里幾乎完成所有的準備工作.
public DistanceScoreDocLookupComparator(IndexReader reader, String fieldname, int x, int y) throws IOException {
System.out.println("fieldName2="+fieldname);
final TermEnum enumerator = reader.terms(new Term(fieldname, ""));
System.out.println("maxDoc="+reader.maxDoc());
distances = new float[reader.maxDoc()]; // 初始化distances
if (distances.length > 0) {
TermDocs termDocs = reader.termDocs();
try {
if (enumerator.term() == null) {
throw new RuntimeException("no terms in field " + fieldname);
}
int i = 0,j = 0;
do {
System.out.println("in do-while :" + i ++);
Term term = enumerator.term(); // 取出每一個Term
if (term.field() != fieldname) // 與給定的域不符合則比較下一個
break;
//Sets this to the data for the current term in a TermEnum.
//This may be optimized in some implementations.
termDocs.seek(enumerator); //參考TermDocs Doc
while (termDocs.next()) {
System.out.println(" in while :" + j ++);
System.out.println(" in while ,Term :" + term.toString());
String[] xy = term.text().split(","); // 去處x y
int deltax = Integer.parseInt(xy[0]) - x;
int deltay = Integer.parseInt(xy[1]) - y;
// 計算距離
distances[termDocs.doc()] = (float) Math.sqrt(deltax * deltax + deltay * deltay);
}
}
while (enumerator.next());
} finally {
termDocs.close();
}
}
}
//有上面的構造函數的準備 這里就比較簡單了
public int compare(ScoreDoc i, ScoreDoc j) {
if (distances[i.doc] distances[j.doc])
return -1;
if (distances[i.doc] > distances[j.doc])
return 1;
return 0;
}
// 返回距離
public Comparable sortValue(ScoreDoc i) {
return new Float(distances[i.doc]);
}
//指定SortType
public int sortType() {
return SortField.FLOAT;
}
}
public String toString() {
return "Distance from (" + x + "," + y + ")";
}
}
package com.nikee.lucene;
import java.io.IOException;
import org.apache.lucene.index.IndexReader;
import org.apache.lucene.index.Term;
import org.apache.lucene.index.TermDocs;
import org.apache.lucene.index.TermEnum;
import org.apache.lucene.search.ScoreDoc;
import org.apache.lucene.search.ScoreDocComparator;
import org.apache.lucene.search.SortComparatorSource;
import org.apache.lucene.search.SortField;
//實現了搜索距你最近的餐館的名字. 餐館坐標用字符串"x,y"來存儲
//DistanceComparatorSource 實現了SortComparatorSource接口
public class DistanceComparatorSource implements SortComparatorSource {
    private static final long serialVersionUID = 1L;

    // x y 用來保存 坐標位置
    private int x;
    private int y;

    public DistanceComparatorSource(int x, int y) {
        this.x = x;
        this.y = y;
    }

    // 返回ScoreDocComparator 用來實現排序功能
    public ScoreDocComparator newComparator(IndexReader reader, String fieldname) throws IOException {
        return new DistanceScoreDocLookupComparator(reader, fieldname, x, y);
    }

    //DistanceScoreDocLookupComparator 實現了ScoreDocComparator 用來排序
    private static class DistanceScoreDocLookupComparator implements ScoreDocComparator {
        private float[] distances; // 保存每個餐館到指定點的距離

        // 構造函數 , 構造函數在這里幾乎完成所有的準備工作.
        public DistanceScoreDocLookupComparator(IndexReader reader, String fieldname, int x, int y) throws IOException {
            System.out.println("fieldName2="+fieldname);
            final TermEnum enumerator = reader.terms(new Term(fieldname, ""));

            System.out.println("maxDoc="+reader.maxDoc());
            distances = new float[reader.maxDoc()]; // 初始化distances
            if (distances.length > 0) {
                TermDocs termDocs = reader.termDocs();
                try {
                    if (enumerator.term() == null) {
                        throw new RuntimeException("no terms in field " + fieldname);
                    }
                    int i = 0,j = 0;
                    do {
                        System.out.println("in do-while :" + i ++);
                        Term term = enumerator.term(); // 取出每一個Term
                        if (term.field() != fieldname) // 與給定的域不符合則比較下一個
                            break;

                        //Sets this to the data for the current term in a TermEnum.
                        //This may be optimized in some implementations.
                        termDocs.seek(enumerator); //參考TermDocs Doc
                        while (termDocs.next()) {
                            System.out.println(" in while :" + j ++);
                            System.out.println(" in while ,Term :" + term.toString());

                            String[] xy = term.text().split(","); // 去處x y
                            int deltax = Integer.parseInt(xy[0]) - x;
                            int deltay = Integer.parseInt(xy[1]) - y;
                            // 計算距離
                            distances[termDocs.doc()] = (float) Math.sqrt(deltax * deltax + deltay * deltay);
                        }
                    }
                    while (enumerator.next());
                } finally {
                    termDocs.close();
                }
            }
        }
        //有上面的構造函數的準備 這里就比較簡單了
        public int compare(ScoreDoc i, ScoreDoc j) {
            if (distances[i.doc] distances[j.doc])
                return -1;
            if (distances[i.doc] > distances[j.doc])
                return 1;
            return 0;
        }

        // 返回距離
        public Comparable sortValue(ScoreDoc i) {
            return new Float(distances[i.doc]);
        }

        //指定SortType
        public int sortType() {
            return SortField.FLOAT;
        }
    }

    public String toString() {
        return "Distance from (" + x + "," + y + ")";
    }
}
這是一個實現了上面兩個接口的兩個類, 里面帶有詳細注釋, 可以看出 自定義排序并不是很難的. 該實現能否正確實現,我們來看看測試代碼能否通過吧.
Java代碼
package com.nikee.lucene.test;
import java.io.IOException;
import junit.framework.TestCase;
import org.apache.lucene.analysis.WhitespaceAnalyzer;
import org.apache.lucene.document.Document;
import org.apache.lucene.document.Field;
import org.apache.lucene.index.IndexWriter;
import org.apache.lucene.index.Term;
import org.apache.lucene.search.FieldDoc;
import org.apache.lucene.search.Hits;
import org.apache.lucene.search.IndexSearcher;
import org.apache.lucene.search.Query;
import org.apache.lucene.search.ScoreDoc;
import org.apache.lucene.search.Sort;
import org.apache.lucene.search.SortField;
import org.apache.lucene.search.TermQuery;
import org.apache.lucene.search.TopFieldDocs;
import org.apache.lucene.store.RAMDirectory;
import com.nikee.lucene.DistanceComparatorSource;
public class DistanceComparatorSourceTest extends TestCase {
private RAMDirectory directory;
private IndexSearcher searcher;
private Query query;
//建立測試環境
protected void setUp() throws Exception {
directory = new RAMDirectory();
IndexWriter writer = new IndexWriter(directory, new WhitespaceAnalyzer(), true);
addPoint(writer, "El Charro", "restaurant", 1, 2);
addPoint(writer, "Cafe Poca Cosa", "restaurant", 5, 9);
addPoint(writer, "Los Betos", "restaurant", 9, 6);
addPoint(writer, "Nico's Taco Shop", "restaurant", 3, 8);
writer.close();
searcher = new IndexSearcher(directory);
query = new TermQuery(new Term("type", "restaurant"));
}
private void addPoint(IndexWriter writer, String name, String type, int x, int y) throws IOException {
Document doc = new Document();
doc.add(new Field("name", name, Field.Store.YES, Field.Index.TOKENIZED));
doc.add(new Field("type", type, Field.Store.YES, Field.Index.TOKENIZED));
doc.add(new Field("location", x + "," + y, Field.Store.YES, Field.Index.UN_TOKENIZED));
writer.addDocument(doc);
}
public void testNearestRestaurantToHome() throws Exception {
//使用DistanceComparatorSource來構造一個SortField
Sort sort = new Sort(new SortField("location", new DistanceComparatorSource(0, 0)));
Hits hits = searcher.search(query, sort); // 搜索
//測試
assertEquals("closest", "El Charro", hits.doc(0).get("name"));
assertEquals("furthest", "Los Betos", hits.doc(3).get("name"));
}
public void testNeareastRestaurantToWork() throws Exception {
Sort sort = new Sort(new SortField("location", new DistanceComparatorSource(10, 10))); // 工作的坐標 10,10
//上面的測試實現了自定義排序,但是并不能訪問自定義排序的更詳細信息,利用
//TopFieldDocs 可以進一步訪問相關信息
TopFieldDocs docs = searcher.search(query, null, 3, sort);
assertEquals(4, docs.totalHits);
assertEquals(3, docs.scoreDocs.length);
//取得FieldDoc 利用FieldDoc可以取得關于排序的更詳細信息 請查看FieldDoc Doc
FieldDoc fieldDoc = (FieldDoc) docs.scoreDocs[0];
assertEquals("(10,10) -> (9,6) = sqrt(17)", new Float(Math.sqrt(17)), fieldDoc.fields[0]);
Document document = searcher.doc(fieldDoc.doc);
assertEquals("Los Betos", document.get("name"));
dumpDocs(sort, docs); // 顯示相關信息
}
// 顯示有關排序的信息
private void dumpDocs(Sort sort, TopFieldDocs docs) throws IOException {
System.out.println("Sorted by: " + sort);
ScoreDoc[] scoreDocs = docs.scoreDocs;
for (int i = 0; i scoreDocs.length; i++) {
FieldDoc fieldDoc = (FieldDoc) scoreDocs[i];
Float distance = (Float) fieldDoc.fields[0];
Document doc = searcher.doc(fieldDoc.doc);
System.out.println(" " + doc.get("name") + " @ (" + doc.get("location") + ") -> " + distance);
}
}
}
您可能感興趣的文章:
  • java的arraylist排序示例(arraylist用法)
  • java ArrayList集合中的某個對象屬性進行排序的實現代碼
  • Java ArrayList的不同排序方法
  • java教程之二個arraylist排序的示例分享
  • java對ArrayList排序代碼示例
  • java實現ArrayList根據存儲對象排序功能示例
  • java中實現Comparable接口實現自定義排序的示例
  • Java Collections.sort()實現List排序的默認方法和自定義方法
  • Java針對ArrayList自定義排序的2種實現方法

標簽：馬鞍山 紅河 鄭州 岳陽 亳州 大興安嶺 拉薩 武威

巨人網絡通訊聲明：本文標題《java Lucene 中自定義排序的實現》，本文關鍵詞  java,Lucene,中,自定義,排序,；如發現本文內容存在版權問題，煩請提供相關信息告之我們，我們將及時溝通與處理。本站內容系統采集于網絡，涉及言論、版權與本站無關。
  • 相關文章
  • 下面列出與本文章《java Lucene 中自定義排序的實現》相關的同類信息！
  • 本頁收集關于java Lucene 中自定義排序的實現的相關信息資訊供網民參考！
    • 推薦文章
    婷婷综合国产,91蜜桃婷婷狠狠久久综合9色 ,九九九九九精品,国产综合av
    欧美高清精品3d| 秋霞电影网一区二区| 成人av在线网站| 秋霞电影网一区二区| 亚洲色图制服诱惑| 欧美电影免费观看高清完整版在线| av欧美精品.com| 国产一区二区三区综合| 视频精品一区二区| 一区二区在线观看不卡| 国产视频亚洲色图| 久久综合久久综合久久综合| 欧美久久一二三四区| 欧美日韩国产在线观看| 色老综合老女人久久久| 国产成人在线视频网站| 国产一区二区三区久久悠悠色av| 美腿丝袜一区二区三区| 免费精品视频在线| 免费久久99精品国产| 久久99精品国产| 久久超碰97中文字幕| 精品一区二区三区日韩| 国产在线不卡一区| 国产福利精品一区二区| 成人爱爱电影网址| 色综合天天综合网国产成人综合天 | 91国产精品成人| av欧美精品.com| 粉嫩绯色av一区二区在线观看| 日韩国产精品大片| 国产精品夜夜爽| 99免费精品在线| 成人网男人的天堂| 成人午夜激情在线| www.爱久久.com| 欧美日韩视频一区二区| 欧美精品三级在线观看| 精品处破学生在线二十三| 国产亚洲精久久久久久| 国产精品欧美极品| 艳妇臀荡乳欲伦亚洲一区| 亚洲国产电影在线观看| 国产精品乱码人人做人人爱| 中文字幕制服丝袜一区二区三区| 亚洲婷婷国产精品电影人久久| 国产精品国产自产拍在线| 国产精品电影一区二区三区| 亚洲国产精品一区二区久久恐怖片 | 粉嫩久久99精品久久久久久夜| 久久精品二区亚洲w码| 精品一区二区三区免费毛片爱| 99国产精品久久久久久久久久久| 色综合天天在线| 精品入口麻豆88视频| 国产女人18水真多18精品一级做 | 午夜欧美一区二区三区在线播放| 午夜国产精品影院在线观看| 裸体一区二区三区| 韩国女主播一区二区三区| 色一情一伦一子一伦一区| 777久久久精品| 久久久精品欧美丰满| 一区二区三区色| 韩国精品久久久| 91论坛在线播放| 精品人在线二区三区| 中文字幕在线不卡视频| 天使萌一区二区三区免费观看| 国产91色综合久久免费分享| 在线观看视频欧美| 日韩三级在线免费观看| 伊人夜夜躁av伊人久久| 九色综合国产一区二区三区| 在线观看日韩国产| 欧美国产日本韩| 日韩高清不卡一区| 91浏览器打开| 中文无字幕一区二区三区| 午夜视频在线观看一区| 成人av资源在线| 日韩女优av电影| 国产免费观看久久| 欧美a一区二区| 国产suv精品一区二区6| 欧美欧美欧美欧美| 国产精品国产三级国产a| 亚洲国产三级在线| 成人深夜福利app| 亚洲精品一区二区三区蜜桃下载 | 黄色日韩三级电影| 欧美一卡二卡三卡| 亚洲一区二区三区四区五区黄| 99久久婷婷国产综合精品| 中文字幕在线一区免费| 丰满少妇在线播放bd日韩电影| 91精品国产91久久综合桃花| 亚洲一区在线观看免费观看电影高清 | 中文字幕在线不卡| 成a人片国产精品| 欧美国产禁国产网站cc| 国产伦精品一区二区三区免费| 精品日韩在线观看| 国产一区二区三区在线观看免费视频 | 日韩精品一区二区三区在线| 视频一区二区欧美| 在线不卡免费欧美| 久久99久国产精品黄毛片色诱| 欧美一区二区三区在线电影| 七七婷婷婷婷精品国产| 精品国产伦一区二区三区观看体验| 久久国产综合精品| 国产日韩av一区| 91免费在线看| 午夜久久久久久久久久一区二区| 在线电影一区二区三区| 精品制服美女丁香| 国产日产欧美一区| 91欧美一区二区| 亚洲成人av一区二区| 欧美精品一区二区三区久久久| 亚洲已满18点击进入久久| 精品日韩av一区二区| 成人国产精品免费网站| 中文字幕一区免费在线观看| 不卡一卡二卡三乱码免费网站| 中文字幕一区av| 日韩一区二区在线观看| 亚洲一级二级三级| 日韩欧美精品三级| 粉嫩av一区二区三区在线播放| 国产精品久久一级| 精品污污网站免费看| 日韩高清不卡一区二区三区| 日韩三级视频在线看| 成人美女在线观看| 一区二区三区精品| 91麻豆精品国产| 国产suv精品一区二区三区| 一区二区三区国产精华| 日韩精品影音先锋| 欧美午夜精品久久久久久超碰| 麻豆专区一区二区三区四区五区| 亚洲国产精品黑人久久久| 欧美综合在线视频| 激情久久久久久久久久久久久久久久| 国产精品美女久久久久久久 | 国产日韩欧美综合在线| 一本一道久久a久久精品综合蜜臀| 日韩影视精彩在线| 亚洲欧美激情一区二区| 日韩免费观看高清完整版在线观看| 国产精品一二二区| 爽好久久久欧美精品| 最近日韩中文字幕| 久久久久久久综合色一本| 欧美三级电影网站| 日本久久电影网| 风间由美性色一区二区三区| 日本va欧美va精品发布| 亚洲激情第一区| 国产免费观看久久| 久久久一区二区三区| 日韩午夜av电影| 欧美三区免费完整视频在线观看| 国产91高潮流白浆在线麻豆| 日韩主播视频在线| 亚洲免费观看在线观看| 中文字幕成人在线观看| 精品国产髙清在线看国产毛片| 欧美美女黄视频| 欧美日韩三级在线| 一本色道久久综合狠狠躁的推荐| 国内精品在线播放| 奇米色一区二区| 日韩电影在线一区二区| 一区二区三区四区在线免费观看| 亚洲欧洲av另类| 国产精品久久久久久久第一福利 | 欧美国产一区二区| 欧美精品一区男女天堂| 精品久久久三级丝袜| 麻豆精品在线看| 亚洲大型综合色站| 亚洲女同一区二区| 亚洲欧美日韩中文播放| 国产精品私人自拍| 久久影院午夜片一区| 欧美一区二区三区在线视频| 欧美亚洲国产一区二区三区va| 91视视频在线观看入口直接观看www| 韩国av一区二区| 国产一区二三区| 国产成a人亚洲精品| 精品一区二区在线看| 亚洲欧美一区二区不卡| 国产精品久久久久国产精品日日| 欧美激情一区二区在线| 国产精品美女久久福利网站| 中文字幕成人网|