Java CacheEntry.getReaderKey方法代码示例

import org.apache.lucene.search.FieldCache.CacheEntry; //导入方法依赖的package包/类
/**
 * Tests a CacheEntry[] for indication of "insane" cache usage.
 * <p>
 * <B>NOTE:</b>FieldCache CreationPlaceholder objects are ignored.
 * (:TODO: is this a bad idea? are we masking a real problem?)
 * </p>
 */
public Insanity[] check(CacheEntry... cacheEntries) {
  if (null == cacheEntries || 0 == cacheEntries.length) 
    return new Insanity[0];

  // the indirect mapping lets MapOfSet dedup identical valIds for us
  //
  // maps the (valId) identityhashCode of cache values to 
  // sets of CacheEntry instances
  final MapOfSets<Integer, CacheEntry> valIdToItems = new MapOfSets<>(new HashMap<Integer, Set<CacheEntry>>(17));
  // maps ReaderField keys to Sets of ValueIds
  final MapOfSets<ReaderField, Integer> readerFieldToValIds = new MapOfSets<>(new HashMap<ReaderField, Set<Integer>>(17));
  //

  // any keys that we know result in more then one valId
  final Set<ReaderField> valMismatchKeys = new HashSet<>();

  // iterate over all the cacheEntries to get the mappings we'll need
  for (int i = 0; i < cacheEntries.length; i++) {
    final CacheEntry item = cacheEntries[i];
    final Object val = item.getValue();

    // It's OK to have dup entries, where one is eg
    // float[] and the other is the Bits (from
    // getDocWithField())
    if (val != null && "BitsEntry".equals(val.getClass().getSimpleName())) {
      continue;
    }

    if (val instanceof FieldCache.CreationPlaceholder)
      continue;

    final ReaderField rf = new ReaderField(item.getReaderKey(), 
                                          item.getFieldName());

    final Integer valId = Integer.valueOf(System.identityHashCode(val));

    // indirect mapping, so the MapOfSet will dedup identical valIds for us
    valIdToItems.put(valId, item);
    if (1 < readerFieldToValIds.put(rf, valId)) {
      valMismatchKeys.add(rf);
    }
  }

  final List<Insanity> insanity = new ArrayList<>(valMismatchKeys.size() * 3);

  insanity.addAll(checkValueMismatch(valIdToItems, 
                                     readerFieldToValIds, 
                                     valMismatchKeys));
  insanity.addAll(checkSubreaders(valIdToItems, 
                                  readerFieldToValIds));
                  
  return insanity.toArray(new Insanity[insanity.size()]);
}
 

import org.apache.lucene.search.FieldCache.CacheEntry; //导入方法依赖的package包/类
/**
 * Tests a CacheEntry[] for indication of "insane" cache usage.
 * <p>
 * <B>NOTE:</b>FieldCache CreationPlaceholder objects are ignored.
 * (:TODO: is this a bad idea? are we masking a real problem?)
 * </p>
 */
public Insanity[] check(CacheEntry... cacheEntries) {
  if (null == cacheEntries || 0 == cacheEntries.length) 
    return new Insanity[0];

  if (estimateRam) {
    for (int i = 0; i < cacheEntries.length; i++) {
      cacheEntries[i].estimateSize();
    }
  }

  // the indirect mapping lets MapOfSet dedup identical valIds for us
  //
  // maps the (valId) identityhashCode of cache values to 
  // sets of CacheEntry instances
  final MapOfSets<Integer, CacheEntry> valIdToItems = new MapOfSets<Integer, CacheEntry>(new HashMap<Integer, Set<CacheEntry>>(17));
  // maps ReaderField keys to Sets of ValueIds
  final MapOfSets<ReaderField, Integer> readerFieldToValIds = new MapOfSets<ReaderField, Integer>(new HashMap<ReaderField, Set<Integer>>(17));
  //

  // any keys that we know result in more then one valId
  final Set<ReaderField> valMismatchKeys = new HashSet<ReaderField>();

  // iterate over all the cacheEntries to get the mappings we'll need
  for (int i = 0; i < cacheEntries.length; i++) {
    final CacheEntry item = cacheEntries[i];
    final Object val = item.getValue();

    // It's OK to have dup entries, where one is eg
    // float[] and the other is the Bits (from
    // getDocWithField())
    if (val instanceof Bits) {
      continue;
    }

    if (val instanceof FieldCache.CreationPlaceholder)
      continue;

    final ReaderField rf = new ReaderField(item.getReaderKey(), 
                                          item.getFieldName());

    final Integer valId = Integer.valueOf(System.identityHashCode(val));

    // indirect mapping, so the MapOfSet will dedup identical valIds for us
    valIdToItems.put(valId, item);
    if (1 < readerFieldToValIds.put(rf, valId)) {
      valMismatchKeys.add(rf);
    }
  }

  final List<Insanity> insanity = new ArrayList<Insanity>(valMismatchKeys.size() * 3);

  insanity.addAll(checkValueMismatch(valIdToItems, 
                                     readerFieldToValIds, 
                                     valMismatchKeys));
  insanity.addAll(checkSubreaders(valIdToItems, 
                                  readerFieldToValIds));
                  
  return insanity.toArray(new Insanity[insanity.size()]);
}