-
### Background and motivation
The goal is to simplify creating a hash code from an enumerable. This is specifically useful for C# records when working with custom equality and ImmutableArray/Immutab…
-
### Version
Vert.x 4.0.3
### Steps to reproduce
The implementation of hashCode() in `JsonObject` and `JsonArray` just returns the underlying list or map's `hashCode()` value. However, the cor…
-
I sometimes implement hashCodes of immutable classes as vals or lazy vals (especially when the classes represent DAG nodes: this avoid costly hashCode recomputations). Unfortunately, I get the "implem…
-
The second line of hashCode() calls super.hashCode(), which calls Table's hashCode(), which then proceeds to call Util.getFields(this.getClass())... which throws an exception for the Join class.
Stac…
-
The current code is expensive, since it is based on the member fields _and_ is recomputed every time. It also uses the sum of several small integers weighted equally.
Suggested improvements:
1. co…
-
http://ydlmlh.iteye.com/blog/1413573
http://it.deepinmind.com/java/2014/03/31/hashcode-method-performance-tuning.html
http://www.cnblogs.com/nktblog/articles/2518111.html
-
Wouldn't it be better just to use MacAddress for equals and hashcode? So you could compare them while observe and just list the current values of a specifiy beacon.
```java
@Override public boole…
-
**Is your feature request related to a problem? Please describe.**
When using enum sum types in Rust like
```rust
pub enum HttpBody {
Text(String),
Bytes(Vec),
BytesStream,
Fo…
-
```
Option presently uses reference equality rather than structural equality, which
violates referential transparency and causes other surprising behavior.
Example:
Option o1 = just("foo");
Op…
-
changed the `public void Add(T value, IEqualityComparer comparer)` method of `System.HashCode` so that it no longer calls `comparer.GetHashCode(value)` if `value == null`. That is particularly useful…