Unimpl Eq for VecMap

Summary: Map comparison is trick (ordered vs unordered), so remove this unused implementations to avoid using them accidentally.

Reviewed By: ndmitchell

Differential Revision: D41166332

fbshipit-source-id: aee935e98d5ec13aa2910bee83ebaa1b07faff1d

Author: stepancheg

starlark_map/src/vec2/mod.rs

@@ -83,14 +83,6 @@ pub(crate) struct Vec2<K, V> {
 unsafe impl<K: Send, V: Send> Send for Vec2<K, V> {}
 unsafe impl<K: Sync, V: Sync> Sync for Vec2<K, V> {}
 
-impl<K: PartialEq, V: PartialEq> PartialEq for Vec2<K, V> {
-    fn eq(&self, other: &Self) -> bool {
-        self.len == other.len && self.iter().eq(other.iter())
-    }
-}
-
-impl<K: Eq, V: Eq> Eq for Vec2<K, V> {}
-
 impl<K, V> Default for Vec2<K, V> {
     #[inline]
     fn default() -> Vec2<K, V> {

starlark_map/src/vec_map/mod.rs

@@ -55,7 +55,7 @@ impl<K: Hash, V: Hash> Hash for Bucket<K, V> {
     }
 }
 
-#[derive(Debug, Clone, Eq, PartialEq, Default_, Allocative)]
+#[derive(Debug, Clone, Default_, Allocative)]
 pub(crate) struct VecMap<K, V> {
     buckets: Vec2<(K, V), StarlarkHashValue>,
 }