yet another W for linear searches

1 files changed, 17 insertions, 2 deletions

diff --git a/azalea-core/src/position.rs b/azalea-core/src/position.rs
index 16578517..6d0b28da 100755
--- a/azalea-core/src/position.rs
+++ b/azalea-core/src/position.rs
@@ -228,11 +228,17 @@ impl Add<ChunkPos> for ChunkPos {
         }
     }
 }
+impl From<ChunkPos> for u64 {
+    #[inline]
+    fn from(pos: ChunkPos) -> Self {
+        ((pos.x as u64) << 32) | (pos.z as u64)
+    }
+}
 impl Hash for ChunkPos {
+    #[inline]
     fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
         // optimized hash that only calls hash once
-        let combined = (self.x as u64) << 32 | (self.z as u64);
-        combined.hash(state);
+        u64::from(*self).hash(state);
     }
 }
 /// nohash_hasher lets us have IntMap<ChunkPos, _> which is significantly faster
@@ -316,6 +322,15 @@ impl From<BlockPos> for ChunkSectionPos {
         }
     }
 }
+impl From<&BlockPos> for ChunkSectionPos {
+    fn from(pos: &BlockPos) -> Self {
+        ChunkSectionPos {
+            x: pos.x.div_floor(16),
+            y: pos.y.div_floor(16),
+            z: pos.z.div_floor(16),
+        }
+    }
+}
 
 impl From<ChunkSectionPos> for ChunkPos {
     fn from(pos: ChunkSectionPos) -> Self {