This issue adds a functionality to efficiently compute the hash code for a consecutive memory region. This functionality is important in practical scenarios because it helps:
- Avoid unnecessary memory copy.
- Avoid repeated conversions between Java objects & Arrow buffers.
Since the algorithm for calculating hash code has significant performance implications, we need to design an interface so that different algorithms can be easily introduces as plug-ins.