| # | Line 1025 | Line 1025 | public class ConcurrentHashMapV8<K, V> | |
|---|---|---|
| 1025 | * we apply a transform that spreads the impact of higher bits | |
| 1026 | * downward. There is a tradeoff between speed, utility, and | |
| 1027 | * quality of bit-spreading. Because many common sets of hashes | |
| 1028 | < | * are already reaonably distributed across bits (so don't benefit |
| 1028 | > | * are already reasonably distributed across bits (so don't benefit |
| 1029 | * from spreading), and because we use trees to handle large sets | |
| 1030 | * of collisions in bins, we don't need excessively high quality. | |
| 1031 | */ | |
| – | Removed lines |
| + | Added lines |
| < | Changed lines |
| > | Changed lines |