/lucene-3.6.0/lucene/contrib/queryparser/src/java/org/apache/lucene/queryParser/core/config/ |
H A D | AbstractQueryConfig.java | 31 * Each configuration is is a key->value pair. The key should be an unique 48 * Returns the value held by the given key. 52 * @param key the key, cannot be <code>null</code> 54 * @return the value held by the given key 57 public <T> T get(ConfigurationKey<T> key) { argument 59 if (key == null) { 60 throw new IllegalArgumentException("key cannot be null!"); 63 return (T) this.configMap.get(key); 79 get(ConfigurationKey<T> key, T defaultValue) argument 100 has(ConfigurationKey<T> key) argument 117 set(ConfigurationKey<T> key, T value) argument 157 unset(ConfigurationKey<T> key) argument [all...] |
/lucene-3.6.0/lucene/contrib/analyzers/common/src/java/org/apache/lucene/analysis/charfilter/ |
H A D | htmlentity.py | 28 key = match.group(1) 29 if key == 'quot': codes[key] = r'\"' 30 elif key == 'nbsp': codes[key] = ' '; 31 else : codes[key] = r'\u%04X' % int(match.group(2)) 37 for key in keys: 38 new_entry = ('"%s"' if first_entry else ' | "%s"') % key 44 if key in ('quot','copy','gt','lt','reg','amp'): 45 new_entry = ' | "%s"' % key [all...] |
/lucene-3.6.0/solr/solrj/src/test/org/apache/solr/common/params/ |
H A D | ModifiableSolrParamsTest.java | 43 String key = "key"; 46 modifiable.add(key, values); 47 String[] result = modifiable.getParams(key); 55 String key = "key"; 59 modifiable.add(key, helloWorld); 60 assertArrayEquals("checking Hello World: ", helloWorld, modifiable.getParams(key)); 62 modifiable.add(key, universe); 63 String[] result = modifiable.getParams(key); [all...] |
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/index/params/ |
H A D | FacetParamsMissingPropertyException.java | 29 public FacetParamsMissingPropertyException(String key) { argument 30 super("Property with key \"" + key + "\" not found");
|
/lucene-3.6.0/lucene/contrib/grouping/src/java/org/apache/lucene/search/grouping/ |
H A D | SentinelIntSet.java | 56 public int hash(int key) { argument 57 return key; 62 /** returns the slot for this key */ 63 public int getSlot(int key) { argument 64 assert key != emptyVal; 65 int h = hash(key); 67 if (keys[s] == key || keys[s]== emptyVal) return s; 72 } while (keys[s] != key && keys[s] != emptyVal); 76 /** returns the slot for this key, or -slot-1 if not found */ 77 public int find(int key) { argument 92 exists(int key) argument 96 put(int key) argument [all...] |
/lucene-3.6.0/lucene/contrib/queryparser/src/java/org/apache/lucene/messages/ |
H A D | MessageImpl.java | 32 private String key; field in class:MessageImpl 36 public MessageImpl(String key) { argument 37 this.key = key; 41 public MessageImpl(String key, Object... args) { argument 42 this(key); 51 return this.key;
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/ |
H A D | AttributeReflector.java | 27 * passing the class name of the {@link Attribute}, a key and the actual value. 30 * as attribute class, {@code "term"} as key and the actual value as a String. 32 public void reflect(Class<? extends Attribute> attClass, String key, Object value); argument
|
H A D | MapOfSets.java | 49 * Adds val to the Set associated with key in the Map. If key is not 51 * @return the size of the Set associated with key once val is added to it. 53 public int put(K key, V val) { argument 55 if (theMap.containsKey(key)) { 56 theSet = theMap.get(key); 59 theMap.put(key, theSet); 65 * Adds multiple vals to the Set associated with key in the Map. 66 * If key is not 68 * @return the size of the Set associated with key onc 70 putAll(K key, Collection<? extends V> vals) argument [all...] |
H A D | Parameter.java | 41 String key = makeKey(name); 43 if(allParameters.containsKey(key)) 44 throw new IllegalArgumentException("Parameter name " + key + " already used!"); 46 allParameters.put(key, this);
|
H A D | DoubleBarrelLRUCache.java | 31 * entry, it's promoted to primary (<b>NOTE</b>: the key is 47 /** Object providing clone(); the key class must subclass this. */ 67 public V get(K key) { argument 79 V result = primary.get(key); 82 result = secondary.get(key); 85 put((K) key.clone(), result); 91 public void put(K key, V value) { argument 101 primary.put(key, value);
|
/lucene-3.6.0/solr/contrib/dataimporthandler/src/java/org/apache/solr/handler/dataimport/ |
H A D | DIHWriterBase.java | 32 Object key = null; 34 key = aMap.get(keyFieldName); 36 key = aMap.entrySet().iterator().next(); 38 if (key != null) { 39 deltaKeys.add(key);
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/schema/ |
H A D | RandomSortField.java | 67 private static int hash(int key) { argument 68 key = ~key + (key << 15); // key = (key << 15) - key - 1; 69 key = key ^ (key >>> 1 [all...] |
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/util/collections/ |
H A D | FloatToObjectMap.java | 36 * list, to which the key,value pair is allocated. 251 * @param key 254 * element which is being mapped using the given key 256 private void prvt_put(float key, T e) { argument 258 int hashIndex = calcBaseHashIndex(key); 266 keys[objectIndex] = key; 278 * @param key 280 protected int calcBaseHashIndex(float key) { argument 281 return Float.floatToIntBits(key) & hashFactor; 310 * Checks if a given key exist 316 containsKey(float key) argument 345 find(float key) argument 378 findForRemove(float key, int baseHashIndex) argument 409 get(float key) argument 479 put(float key, T e) argument 512 remove(float key) argument [all...] |
H A D | IntToDoubleMap.java | 33 * list, to which the key,value pair is allocated. 251 * @param key 254 * double value which is being mapped using the given key 256 private void prvt_put(int key, double v) { argument 258 int hashIndex = calcBaseHashIndex(key); 266 keys[objectIndex] = key; 280 * @param key 282 protected int calcBaseHashIndex(int key) { argument 283 return key & hashFactor; 312 * Checks if a given key exist 318 containsKey(int key) argument 346 find(int key) argument 379 findForRemove(int key, int baseHashIndex) argument 409 get(int key) argument 477 put(int key, double v) argument 509 remove(int key) argument [all...] |
H A D | IntToIntMap.java | 33 * list, to which the key,value pair is allocated. 249 * @param key 252 * value which is being mapped using the given key 254 private void prvt_put(int key, int e) { argument 256 int hashIndex = calcBaseHashIndex(key); 264 keys[objectIndex] = key; 277 * @param key 279 protected int calcBaseHashIndex(int key) { argument 280 return key & hashFactor; 309 * Checks if a given key exist 315 containsKey(int key) argument 343 find(int key) argument 376 findForRemove(int key, int baseHashIndex) argument 406 get(int key) argument 474 put(int key, int e) argument 506 remove(int key) argument [all...] |
H A D | IntToObjectMap.java | 35 * list, to which the key,value pair is allocated. 250 * @param key 253 * element which is being mapped using the given key 255 private void prvt_put(int key, T e) { argument 257 int hashIndex = calcBaseHashIndex(key); 265 keys[objectIndex] = key; 278 * @param key 280 protected int calcBaseHashIndex(int key) { argument 281 return key & hashFactor; 310 * Checks if a given key exist 316 containsKey(int key) argument 345 find(int key) argument 378 findForRemove(int key, int baseHashIndex) argument 409 get(int key) argument 479 put(int key, T e) argument 512 remove(int key) argument [all...] |
H A D | ArrayHashMap.java | 34 * list, to which the <key,value> pair is allocated. 225 private void prvt_put(K key, V value) { argument 227 int hashIndex = calcBaseHashIndex(key); 235 keys[objectIndex] = key; 246 protected int calcBaseHashIndex(K key) { argument 247 return key.hashCode() & hashFactor; 273 /** Returns true iff the key exists in the map. */ 274 public boolean containsKey(K key) { argument 275 return find(key) != 0; 289 /** Returns the index of the given key, o 290 find(K key) argument 320 findForRemove(K key, int baseHashIndex) argument 344 get(K key) argument 406 put(K key, V e) argument 439 remove(K key) argument [all...] |
H A D | ObjectToFloatMap.java | 35 * list, to which the key,value pair is allocated. 251 * @param key 254 * element which is being mapped using the given key 256 private void prvt_put(K key, float e) { argument 258 int hashIndex = calcBaseHashIndex(key); 266 keys[objectIndex] = key; 279 * @param key 281 protected int calcBaseHashIndex(K key) { argument 282 return key.hashCode() & hashFactor; 313 * Checks if a given key exist 319 containsKey(K key) argument 347 find(K key) argument 380 findForRemove(K key, int baseHashIndex) argument 410 get(K key) argument 479 put(K key, float e) argument 511 remove(K key) argument [all...] |
H A D | ObjectToIntMap.java | 35 * list, to which the key,value pair is allocated. 251 * @param key 254 * element which is being mapped using the given key 256 private void prvt_put(K key, int e) { argument 258 int hashIndex = calcBaseHashIndex(key); 266 keys[objectIndex] = key; 279 * @param key 281 protected int calcBaseHashIndex(K key) { argument 282 return key.hashCode() & hashFactor; 313 * Checks if a given key exist 319 containsKey(K key) argument 347 find(K key) argument 380 findForRemove(K key, int baseHashIndex) argument 410 get(K key) argument 478 put(K key, int e) argument 510 remove(K key) argument [all...] |
/lucene-3.6.0/lucene/test-framework/src/java/org/apache/lucene/util/ |
H A D | SystemPropertiesRestoreRule.java | 76 final Object key = e.nextElement(); 78 if (key instanceof String) { 79 String value = properties.getProperty((String) key); 81 Object ovalue = properties.get(key); 88 result.put((String) key, value); 101 for (String key : after.keySet()) { 102 if (!ignoredKeys.contains(key)) 103 System.clearProperty(key); 108 String key = e.getValue(); 109 if (!ignoredKeys.contains(key)) { [all...] |
H A D | SystemPropertiesInvariantRule.java | 101 String key = i.next(); 102 String valueBefore = before.get(key); 103 String valueAfter = after.get(key); 113 for (String key : missingKeys) { 114 b.append(" ").append(key) 116 .append(before.get(key)) 122 for (String key : newKeys) { 123 b.append(" ").append(key) 125 .append(after.get(key)) 131 for (String key [all...] |
/lucene-3.6.0/lucene/contrib/analyzers/stempel/src/java/org/egothor/stemmer/ |
H A D | MultiTrie2.java | 92 * Return the element that is stored in a cell associated with the given key. 94 * @param key the key to the cell holding the desired element 98 public CharSequence getFully(CharSequence key) { argument 101 CharSequence lastkey = key; 114 // key=key.substring(lengthPP(r)); 118 key = skip(key, lengthPP(p[i - 1])); 120 key 140 getLastOnPath(CharSequence key) argument 197 add(CharSequence key, CharSequence cmd) argument [all...] |
/lucene-3.6.0/solr/contrib/uima/src/java/org/apache/solr/uima/processor/ae/ |
H A D | AEProviderFactory.java | 47 String key = new StringBuilder(core).append(aePath).toString(); 48 if (providerCache.get(key) == null) { 49 providerCache.put(key, new OverridingParamsAEProvider(aePath, runtimeParameters)); 51 return providerCache.get(key);
|
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/taxonomy/writercache/lru/ |
H A D | NameHashIntCacheLRU.java | 25 * It uses as key, hash of the path instead of the path. 38 Object key(CategoryPath name) { method in class:NameHashIntCacheLRU 43 Object key(CategoryPath name, int prefixLen) { method in class:NameHashIntCacheLRU
|
/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/search/ |
H A D | TotalFacetCountsCache.java | 93 // create the key 94 TFCKey key = new TFCKey(indexReader, taxonomy, facetIndexingParams); 97 TotalFacetCounts tfc = cache.get(key); 99 markRecentlyUsed(key); 102 return computeAndCache(key, clCache); 106 * Mark key as it as recently used. 124 * of the same 'key' in lruKeys, but this is handled by the loop in trimCache(), 125 * where an attempt to remove the same key twice is a no-op. 128 private void markRecentlyUsed(TFCKey key) { argument 129 lruKeys.remove(key); 152 computeAndCache(TFCKey key, CategoryListCache clCache) argument [all...] |