new RandomScoreFunctionBuilder().seed(sessionId.hashCode())) }),
                    0, pollingFetchSize, SortBuilders.scoreSort().order(SortOrder.DESC));
        } else if (!ORDER_SEQUENTIAL.equals(crawlOrder)) {
            logger.warn("Invalid crawl order specified: {}. Falling back to sequential.", crawlOrder);
        }
        return super.fetchUrlQueueList(sessionId);

	Comment string
	Option  string        // WITH PARSER parser_name
	Fields  []IndexOption // Note: IndexOption's Field maybe the same
}

type IndexOption struct {
	*Field
	Expression string
	Sort       string // DESC, ASC
	Collate    string
	Length     int
	Priority   int
}

// ParseIndexes parse schema indexes
func (schema *Schema) ParseIndexes() []*Index {
	indexesByName := map[string]*Index{}
	indexes := []*Index{}

labels.search_result_sort_filename_desc=Nome do arquivo (desc)
labels.search_result_sort_created_asc=Data (asc)
labels.search_result_sort_created_desc=Data (desc)
labels.search_result_sort_content_length_asc=Tamanho (asc)
labels.search_result_sort_content_length_desc=Tamanho (desc)
labels.search_result_sort_last_modified_asc=Última modificação (asc)
labels.search_result_sort_last_modified_desc=Última modificação (desc)

	AssertEqual(t, names2, []string{"distinct", "distinct", "distinct", "distinct-2", "distinct-3"})

	var results []User
	if err := DB.Distinct("name", "age").Where("name like ?", "distinct%").Order("name, age desc").Find(&results).Error; err != nil {
		t.Errorf("failed to query users, got error: %v", err)
	}

	expects := []User{
		{Name: "distinct", Age: 20},
		{Name: "distinct", Age: 18},
		{Name: "distinct-2", Age: 18},

labels.search_result_sort_filename_desc=Nome file (desc)
labels.search_result_sort_created_asc=Data (asc)
labels.search_result_sort_created_desc=Data (desc)
labels.search_result_sort_content_length_asc=Dimensione (asc)
labels.search_result_sort_content_length_desc=Dimensione (desc)
labels.search_result_sort_last_modified_asc=Ultima modifica (asc)
labels.search_result_sort_last_modified_desc=Ultima modifica (desc)

            }
            final SortOrder sortOrder;
            if (values.length == 2) {
                if (SortOrder.DESC.toString().equalsIgnoreCase(values[1])) {
                    sortOrder = SortOrder.DESC;
                } else if (SortOrder.ASC.toString().equalsIgnoreCase(values[1])) {
                    sortOrder = SortOrder.ASC;
                } else {

		flags            uint16
		crc32            uint32
		uncompressedSize uint64
		compressedSize   uint64
	}{
		{
			name:    "small store w desc",
			content: []byte("gophers"),
			method:  Store,
			flags:   0x8,
		},
		{
			name:    "small deflate wo desc",
			content: bytes.Repeat([]byte("abcdefg"), 2048),
			method:  Deflate,
		},
	}

	// write a zip file
	archive := new(bytes.Buffer)

labels.search_result_sort_filename_desc=by Filename (desc)
labels.search_result_sort_created_asc=by Date (asc)
labels.search_result_sort_created_desc=by Date (desc)
labels.search_result_sort_content_length_asc=by Size (asc)
labels.search_result_sort_content_length_desc=by Size (desc)
labels.search_result_sort_last_modified_asc=by Last Modified (asc)
labels.search_result_sort_last_modified_desc=by Last Modified (desc)

 * if some elements are too small, they will be aggregated by smallElementAggregateFunction.
 *
 * @param list the list to split, must be ordered by size desc
 * @param toIntFunction the function used to map the element to its "size"
 * @param largeElementSplitFunction the function used to further split the large element into smaller pieces

		},
		{
			Name:  "idx_user_indices_name3",
			Type:  "btree",
			Where: "name3 != 'jinzhu'",
			Fields: []schema.IndexOption{{
				Field:   &schema.Field{Name: "Name3"},
				Sort:    "desc",
				Collate: "utf8",
				Length:  10,
			}},
		},
		{
			Name:   "idx_user_indices_name4",
			Class:  "UNIQUE",