update wrong replacements

README.md

@@ -108,8 +108,9 @@ value `6.5` exists.
 ### Finite-ness
 
 This crate is also designed to work with [`Finite`] types since it is
-much easy to implement and it is not restrictive to users since you
-can still represent `Infinite` numbers in `Finite` types paradoxically.
+much easier to implement and it is not restrictive to users since you
+can still represent `Infinite` numbers in `Finite` types paradoxically
+using the concept of [`Actual Infinity`].
 
 For example you could define `Infinite` for `u8` as `u8::MAX` or if
 you still want to use `u8::MAX` as a `Finite` number you could define
@@ -201,10 +202,10 @@ topic area:
   for [`Range`]s and not [`RangeInclusive`]s. And also no fancy
   merging functions.
 - <https://docs.rs/unbounded-interval-tree>
-  A data structure based off of a 2007 published paper! It supports any
-  DiscreteRange as keys too, except it is implemented with a non-balancing
-  `Box<Node>` based tree, however it also supports overlapping
-  DiscreteRange which my library does not.
+  A data structure based off of a 2007 published paper! It supports
+  any range as keys, unfortunately, it is implemented with a
+  non-balancing `Box<Node>` based tree, however it also supports
+  overlapping ranges which my library does not.
 - <https://docs.rs/rangetree>
   I'm not entirely sure what this library is or isn't, but it looks like
   a custom red-black tree/BTree implementation used specifically for a

rustfmt.toml

@@ -1,9 +1,9 @@
 # todo this file put back to normal
-# - rename DiscreteRange{Set,Map} to DiscreteRange{Set,Map}
+
 # - rename crate too
 # - add link to previous crate on readme
 # - update shared descriptions to note the discreteness
-# - fix doc.rs rs in docs to print at new crate name
+# - fix doc.rs links in docs to print at new crate name
 # - fix doc warnings
 hard_tabs=true
 imports_granularity="Module"

src/discrete_range_map.rs

@@ -746,7 +746,7 @@ where
 			.map(|(key, _)| (key.start(), key.end()));
 
 		// If the start or end point of outer_range is not
-		// contained within a DiscreteRange in the map then we need to
+		// contained within a range in the map then we need to
 		// generate the gaps.
 		let start_gap = (!self
 			.inner
@@ -1455,9 +1455,7 @@ where
 	}
 }
 
-/// A simple helper trait to make my implemtation nicer, if you
-/// already implement DiscreteRange and Copy on your type then this will
-/// also be implemted.
+/// A range that has Finite **Inclusive** end-points.
 pub trait FiniteRange<I> {
 	fn start(&self) -> I;
 	fn end(&self) -> I;
@@ -1564,7 +1562,7 @@ where
 		let mut map = DiscreteRangeMap::new();
 		while let Some((range_bounds, value)) = access.next_entry()? {
 			map.insert_strict(range_bounds, value)
-				.map_err(|_| serde::de::Error::custom("DiscreteRange overlap"))?;
+				.map_err(|_| serde::de::Error::custom("ranges overlap"))?;
 		}
 		Ok(map)
 	}

src/discrete_range_set.rs

@@ -256,7 +256,7 @@ where
 		let mut set = DiscreteRangeSet::new();
 		while let Some(range_bounds) = access.next_element()? {
 			set.insert_strict(range_bounds)
-				.map_err(|_| serde::de::Error::custom("DiscreteRange overlap"))?;
+				.map_err(|_| serde::de::Error::custom("ranges overlap"))?;
 		}
 		Ok(set)
 	}

src/lib.rs

@@ -116,8 +116,9 @@ along with range_bounds_map. If not, see <https://www.gnu.org/licenses/>.
 //! ### Finite-ness
 //!
 //! This crate is also designed to work with [`Finite`] types since it is
-//! much easy to implement and it is not restrictive to users since you
-//! can still represent `Infinite` numbers in `Finite` types paradoxically.
+//! much easier to implement and it is not restrictive to users since you
+//! can still represent `Infinite` numbers in `Finite` types paradoxically
+//! using the concept of [`Actual Infinity`].
 //!
 //! For example you could define `Infinite` for `u8` as `u8::MAX` or if
 //! you still want to use `u8::MAX` as a `Finite` number you could define
@@ -209,10 +210,10 @@ along with range_bounds_map. If not, see <https://www.gnu.org/licenses/>.
 //!   for [`Range`]s and not [`RangeInclusive`]s. And also no fancy
 //!   merging functions.
 //! - <https://docs.rs/unbounded-interval-tree>
-//!   A data structure based off of a 2007 published paper! It supports any
-//!   DiscreteRange as keys too, except it is implemented with a non-balancing
-//!   `Box<Node>` based tree, however it also supports overlapping
-//!   DiscreteRange which my library does not.
+//!   A data structure based off of a 2007 published paper! It supports
+//!   any range as keys, unfortunately, it is implemented with a
+//!   non-balancing `Box<Node>` based tree, however it also supports
+//!   overlapping ranges which my library does not.
 //! - <https://docs.rs/rangetree>
 //!   I'm not entirely sure what this library is or isn't, but it looks like
 //!   a custom red-black tree/BTree implementation used specifically for a