/** * Add the entry to the map, and dump the map to a file if it's been a while * since we last did. * @see java.util.HashMap#put */ @Override public V put(K key, V value) { V result = super.put(key, value); puts++; if (++entriesSinceLastWritten >= frequencyToWrite) { write(); // okay if backingFile is null // printStats(System.err); } return result; }
/** * Add the entry to the map, and dump the map to a file if it's been a while * since we last did. * @see java.util.HashMap#put */ @Override public V put(K key, V value) { V result = super.put(key, value); puts++; if (++entriesSinceLastWritten >= frequencyToWrite) { write(); // okay if backingFile is null // printStats(System.err); } return result; }
/** * Add the entry to the map, and dump the map to a file if it's been a while * since we last did. * @see java.util.HashMap#put */ @Override public V put(K key, V value) { V result = super.put(key, value); puts++; if (++entriesSinceLastWritten >= frequencyToWrite) { write(); // okay if backingFile is null // printStats(System.err); } return result; }
/** * Add the entry to the map, and dump the map to a file if it's been a while * since we last did. * @see java.util.HashMap#put */ @Override public V put(K key, V value) { V result = super.put(key, value); puts++; if (++entriesSinceLastWritten >= frequencyToWrite) { write(); // okay if backingFile is null // printStats(System.err); } return result; }