How to use

getLocale

method

in

org.apache.lucene.search.SortField

/** Returns an array of collators, possibly <code>null</code>.  The collators
 * correspond to any SortFields which were given a specific locale.
 * @param fields Array of sort fields.
 * @return Array, possibly <code>null</code>.
 */
private Collator[] hasCollators (final SortField[] fields) {
  if (fields == null) return null;
  Collator[] ret = new Collator[fields.length];
  for (int i=0; i<fields.length; ++i) {
    Locale locale = fields[i].getLocale();
    if (locale != null)
      ret[i] = Collator.getInstance (locale);
  }
  return ret;
}

/** Returns an array of collators, possibly <code>null</code>.  The collators
 * correspond to any SortFields which were given a specific locale.
 * @param fields Array of sort fields.
 * @return Array, possibly <code>null</code>.
 */
private Collator[] hasCollators (final SortField[] fields) {
  if (fields == null) return null;
  Collator[] ret = new Collator[fields.length];
  for (int i=0; i<fields.length; ++i) {
    Locale locale = fields[i].getLocale();
    if (locale != null)
      ret[i] = Collator.getInstance (locale);
  }
  return ret;
}

/** Returns an array of collators, possibly <code>null</code>.  The collators
 * correspond to any SortFields which were given a specific locale.
 * @param fields Array of sort fields.
 * @return Array, possibly <code>null</code>.
 */
private Collator[] hasCollators (final SortField[] fields) {
  if (fields == null) return null;
  Collator[] ret = new Collator[fields.length];
  for (int i=0; i<fields.length; ++i) {
    Locale locale = fields[i].getLocale();
    if (locale != null)
      ret[i] = Collator.getInstance (locale);
  }
  return ret;
}

if (s2 == null) c = -1;      // could be null if there are
else if (s1 == null) c = 1;  // no terms in the given field
else if (fields[i].getLocale() == null) {
  c = s2.compareTo(s1);
} else {
else if (fields[i].getLocale() == null) {
  c = s1.compareTo(s2);
} else {

else if (fields[i].getLocale() == null) {
  c = s1.compareTo(s2);
} else {

else if (fields[i].getLocale() == null) {
  c = s1.compareTo(s2);
} else {

public QueryResultKey(Query query, List<Query> filters, Sort sort, int nc_flags) {
 this.query = query;
 this.sort = sort;
 this.filters = filters;
 this.nc_flags = nc_flags;
 int h = query.hashCode();
 if (filters != null) h ^= filters.hashCode();
 sfields = (this.sort !=null) ? this.sort.getSort() : defaultSort;
 for (SortField sf : sfields) {
  // mix the bits so that sortFields are position dependent
  // so that a,b won't hash to the same value as b,a
  h ^= (h << 8) | (h >>> 25);   // reversible hash
  if (sf.getField() != null) h += sf.getField().hashCode();
  h += sf.getType();
  if (sf.getReverse()) h=~h;
  if (sf.getLocale()!=null) h+=sf.getLocale().hashCode();
  if (sf.getFactory()!=null) h+=sf.getFactory().hashCode();
 }
 hc = h;
}

/**
 * Creates a hit queue sorted by the given list of fields.
 * @param reader  Index to use.
 * @param fields Fieldable names, in priority order (highest priority first).  Cannot be <code>null</code> or empty.
 * @param size  The number of hits to retain.  Must be greater than zero.
 * @throws IOException
 */
public FieldSortedHitQueue (IndexReader reader, SortField[] fields, int size)
throws IOException {
 final int n = fields.length;
 comparators = new ScoreDocComparator[n];
 this.fields = new SortField[n];
 for (int i=0; i<n; ++i) {
  String fieldname = fields[i].getField();
  comparators[i] = getCachedComparator (reader, fieldname, fields[i].getType(), fields[i].getLocale(), fields[i].getFactory());
  
  if (comparators[i].sortType() == SortField.STRING) {
    this.fields[i] = new SortField (fieldname, fields[i].getLocale(), fields[i].getReverse());
  } else {
    this.fields[i] = new SortField (fieldname, comparators[i].sortType(), fields[i].getReverse());
  }
 }
 initialize (size);
}

public ShardFieldSortedHitQueue(SortField[] fields, int size) {
 final int n = fields.length;
 comparators = new Comparator[n];
 this.fields = new SortField[n];
 for (int i = 0; i < n; ++i) {
  // keep track of the named fields
  int type = fields[i].getType();
  if (type!=SortField.SCORE && type!=SortField.DOC) {
   fieldNames.add(fields[i].getField());
  }
  String fieldname = fields[i].getField();
  comparators[i] = getCachedComparator(fieldname, fields[i]
    .getType(), fields[i].getLocale(), fields[i].getComparatorSource());
  if (fields[i].getType() == SortField.STRING) {
   this.fields[i] = new SortField(fieldname, fields[i].getLocale(),
     fields[i].getReverse());
  } else {
   this.fields[i] = new SortField(fieldname, fields[i].getType(),
     fields[i].getReverse());
  }
  //System.out.println("%%%%%%%%%%%%%%%%%% got "+fields[i].getType() +"   for "+ fieldname +"  fields[i].getReverse(): "+fields[i].getReverse());
 }
 initialize(size);
}

/**
 * Creates a hit queue sorted by the given list of fields.
 * @param reader  Index to use.
 * @param fields Fieldable names, in priority order (highest priority first).  Cannot be <code>null</code> or empty.
 * @param size  The number of hits to retain.  Must be greater than zero.
 * @throws IOException
 */
public FieldSortedHitQueue (IndexReader reader, SortField[] fields, int size)
throws IOException {
 final int n = fields.length;
 comparators = new ScoreDocComparator[n];
 this.fields = new SortField[n];
 for (int i=0; i<n; ++i) {
  String fieldname = fields[i].getField();
  comparators[i] = getCachedComparator (reader, fieldname, fields[i].getType(), fields[i].getLocale(), fields[i].getFactory());
  
  if (comparators[i].sortType() == SortField.STRING) {
    this.fields[i] = new SortField (fieldname, fields[i].getLocale(), fields[i].getReverse());
  } else {
    this.fields[i] = new SortField (fieldname, comparators[i].sortType(), fields[i].getReverse());
  }
 }
 initialize (size);
}

public boolean equals(Object o) {
 if (o==this) return true;
 if (!(o instanceof QueryResultKey)) return false;
 QueryResultKey other = (QueryResultKey)o;
 // fast check of the whole hash code... most hash tables will only use
 // some of the bits, so if this is a hash collision, it's still likely
 // that the full cached hash code will be different.
 if (this.hc != other.hc) return false;
 // check for the thing most likely to be different (and the fastest things)
 // first.
 if (this.sfields.length != other.sfields.length) return false;
 if (!this.query.equals(other.query)) return false;
 if (!isEqual(this.filters, other.filters)) return false;
 for (int i=0; i<sfields.length; i++) {
  SortField sf1 = this.sfields[i];
  SortField sf2 = other.sfields[i];
  if (sf1.getType() != sf2.getType()) return false;
  if (sf1.getReverse() != sf2.getReverse()) return false;
  if (!isEqual(sf1.getField(),sf2.getField())) return false;
  if (!isEqual(sf1.getLocale(), sf2.getLocale())) return false;
  if (!isEqual(sf1.getFactory(), sf2.getFactory())) return false;
  // NOTE: the factory must be identical!!! use singletons!
 }
 return true;
}

/**
 * Creates a hit queue sorted by the given list of fields.
 * @param reader  Index to use.
 * @param fields Field names, in priority order (highest priority first).  Cannot be <code>null</code> or empty.
 * @param size  The number of hits to retain.  Must be greater than zero.
 * @throws IOException
 */
FieldSortedHitQueue (IndexReader reader, SortField[] fields, int size)
throws IOException {
 final int n = fields.length;
 comparators = new ScoreDocComparator[n];
 this.fields = new SortField[n];
 for (int i=0; i<n; ++i) {
  String fieldname = fields[i].getField();
  comparators[i] = getCachedComparator (reader, fieldname, fields[i].getType(), fields[i].getLocale(), fields[i].getFactory());
  this.fields[i] = new SortField (fieldname, comparators[i].sortType(), fields[i].getReverse());
 }
 initialize (size);
}