pub struct PointRenames {
pub anchored: BTreeMap<String, String>,
pub positional: BTreeMap<String, String>,
}Expand description
What the two versions of a part say about which point became which, and on what evidence.
Fields§
§anchored: BTreeMap<String, String>Renames a shared ANCHOR proves: both versions seat the point with the same geometry, so one IS the other whatever it is spelled.
positional: BTreeMap<String, String>Renames read POSITIONALLY, which a delete-and-add of a point in the same place is indistinguishable from. A consumer should still APPLY them.
Implementations§
Trait Implementations§
Source§impl Clone for PointRenames
impl Clone for PointRenames
Source§impl Debug for PointRenames
impl Debug for PointRenames
Source§impl Default for PointRenames
impl Default for PointRenames
impl Eq for PointRenames
Source§impl PartialEq for PointRenames
impl PartialEq for PointRenames
impl StructuralPartialEq for PointRenames
Auto Trait Implementations§
impl Forget for PointRenames
impl Freeze for PointRenames
impl RefUnwindSafe for PointRenames
impl Send for PointRenames
impl Sync for PointRenames
impl Unpin for PointRenames
impl UnsafeUnpin for PointRenames
impl UnwindSafe for PointRenames
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.