Lines Matching full:value
81 * <p>An entry whose key or value is reclaimed by the garbage collector
132 * the actual concurrency will vary. Ideally, you should choose a value
134 * table. Using a significantly higher value than you need can waste
135 * space and time, and a significantly lower value can lead to thread
137 * magnitude do not usually have much noticeable impact. A value of one
152 * Specifies that each key (not value) stored in the map should be
171 * Specifies that each key (not value) stored in the map should be
200 * Specifies that each value (not key) stored in the map should be
223 * Specifies that each value (not key) stored in the map should be
237 * @throws IllegalStateException if the value strength was already set
247 throw new IllegalStateException("Value strength was already set to "
296 * Map#get} either returns an already-computed value for the given key,
298 * is currently computing the value for this key, simply waits for that thread
299 * to finish and returns its computed value. Note that the function may be
302 * <p>If an entry's value has not finished computing yet, query methods
304 * other words, an entry isn't externally visible until the value's
328 * value. When the computation completes, its new result will overwrite the
329 * value that was put in the map manually.
350 ReferenceEntry<K, V> entry, V value) {
351 return new WeakValueReference<K, V>(value, entry);
379 ReferenceEntry<K, V> entry, V value) {
380 return new SoftValueReference<K, V>(value, entry);
408 ReferenceEntry<K, V> entry, V value) {
409 return new StrongValueReference<K, V>(value);
442 * Creates a reference for the given value according to this value
446 ReferenceEntry<K, V> entry, V value);
456 * Creates a new entry and copies the value and other state from an
488 public void setValue(ReferenceEntry<K, V> entry, V value) {
490 entry, valueStrength.referenceValue(entry, value));
492 scheduleRemoval(entry.getKey(), value);
496 void scheduleRemoval(K key, V value) {
504 * entry was set to the same value again.
507 final WeakReference<V> valueReference = new WeakReference<V>(value);
513 // Remove if the value is still the same.
591 V value;
593 value = computer.apply(key);
606 if (value == null) {
613 setValue(entry, value);
615 return value;
619 * Sets the value reference on an entry and notifies waiting
634 * Points to an old entry where a value is being computed. Used to
651 V value = original.getValueReference().get();
653 return value;
669 V value = StrategyImpl.this.waitForValue(original);
671 return value;
704 // Custom serialization code ensures that the key and value
756 /** A reference to a value. */
759 * Gets the value. Does not block or throw exceptions.
767 * Waits for a value that may still be computing. Unlike get(),
789 * Singleton placeholder that indicates a value is being computed.
792 // Safe because impl never uses a parameter or returns any non-null value
846 * Gets the value reference from this entry.
851 * Sets the value reference for this entry.
858 * Removes this entry from the map if its value reference hasn't
859 * changed. Used to clean up after values. The value reference can
1047 /** References a weak value. */
1072 /** References a soft value. */
1097 /** References a strong value. */
