Add more container functions to support future indexed binary heap

src/backing/containers/pair.rs

@@ -13,11 +13,25 @@ impl<D: Clone, P: PartialOrd + Clone> Pair<D, P> {
         Self { data, priority }
     }
 
-    /// Retrieves the internal data.
-    /// It would be nicer to implement this using [`From`] or [`Into`], but I don't see a way to do that using generics.
+    /// Returns the internal data.
+    /// It might(?) be nicer to implement this using [`From`] or [`Into`], but I don't see a way to do that using generics.
     pub fn data(self) -> D {
         self.data
     }
+
+    pub fn get_data(&self) -> &D {
+        &self.data
+    }
+
+    /// Retrieve the priority associated with the data
+    pub fn get_priority(&self) -> &P {
+        &self.priority
+    }
+
+    /// Update the priority associated with the data
+    pub fn set_priority(&mut self, priority: P) {
+        self.priority = priority
+    }
 }
 
 impl<D: Clone, P: PartialOrd + Clone> PartialOrd for Pair<D, P> {

src/backing/containers/py_item.rs

@@ -48,6 +48,8 @@ impl PartialEq for PyItem {
     }
 }
 
+impl Eq for PyItem {}
+
 impl Hash for PyItem {
     fn hash<H: Hasher>(&self, state: &mut H) {
         // TODO: Should warn or fail instead of defaulting to 0