From 05b5289436c468fb2a108b6161e8cec78b27a4ff Mon Sep 17 00:00:00 2001
From: ripytide <james.forsterer@gmail.com>
Date: Fri, 31 Mar 2023 18:07:15 +0100
Subject: [PATCH] fixed #10

---
 src/range_bounds_map.rs | 50 -----------------------------------------
 src/range_bounds_set.rs | 49 ----------------------------------------
 2 files changed, 99 deletions(-)

diff --git a/src/range_bounds_map.rs b/src/range_bounds_map.rs
index 922b098..e29843e 100644
--- a/src/range_bounds_map.rs
+++ b/src/range_bounds_map.rs
@@ -1738,56 +1738,6 @@ where
 	}
 }
 
-impl<const N: usize, I, K, V> TryFrom<[(K, V); N]> for RangeBoundsMap<I, K, V>
-where
-	K: RangeBounds<I>,
-	I: Ord + Clone,
-{
-	type Error = OverlapError;
-	#[trivial]
-	fn try_from(pairs: [(K, V); N]) -> Result<Self, Self::Error> {
-		let mut range_bounds_map = RangeBoundsMap::new();
-		for (range_bounds, value) in pairs {
-			range_bounds_map.insert_strict(range_bounds, value)?;
-		}
-
-		return Ok(range_bounds_map);
-	}
-}
-impl<I, K, V> TryFrom<Vec<(K, V)>> for RangeBoundsMap<I, K, V>
-where
-	K: RangeBounds<I>,
-	I: Ord + Clone,
-{
-	type Error = OverlapError;
-	#[trivial]
-	fn try_from(pairs: Vec<(K, V)>) -> Result<Self, Self::Error> {
-		let mut range_bounds_map = RangeBoundsMap::new();
-		for (range_bounds, value) in pairs {
-			range_bounds_map.insert_strict(range_bounds, value)?;
-		}
-
-		return Ok(range_bounds_map);
-	}
-}
-
-impl<I, K, V> FromIterator<(K, V)> for RangeBoundsMap<I, K, V>
-where
-	K: RangeBounds<I>,
-	I: Ord + Clone,
-{
-	#[trivial]
-	fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self {
-		let mut output = RangeBoundsMap::new();
-
-		for (range_bounds, value) in iter {
-			output.insert_strict(range_bounds, value).unwrap();
-		}
-
-		return output;
-	}
-}
-
 impl<I, K, V> IntoIterator for RangeBoundsMap<I, K, V>
 where
 	K: RangeBounds<I>,
diff --git a/src/range_bounds_set.rs b/src/range_bounds_set.rs
index 3c59edd..ae28007 100644
--- a/src/range_bounds_set.rs
+++ b/src/range_bounds_set.rs
@@ -1016,55 +1016,6 @@ where
 	}
 }
 
-impl<const N: usize, I, K> TryFrom<[K; N]> for RangeBoundsSet<I, K>
-where
-	K: RangeBounds<I>,
-	I: Ord + Clone,
-{
-	type Error = OverlapError;
-	#[trivial]
-	fn try_from(pairs: [K; N]) -> Result<Self, Self::Error> {
-		let mut range_bounds_set = RangeBoundsSet::new();
-		for range_bounds in pairs {
-			range_bounds_set.insert_strict(range_bounds)?;
-		}
-
-		return Ok(range_bounds_set);
-	}
-}
-impl<I, K> TryFrom<Vec<K>> for RangeBoundsSet<I, K>
-where
-	K: RangeBounds<I>,
-	I: Ord + Clone,
-{
-	type Error = OverlapError;
-	#[trivial]
-	fn try_from(pairs: Vec<K>) -> Result<Self, Self::Error> {
-		let mut range_bounds_set = RangeBoundsSet::new();
-		for range_bounds in pairs {
-			range_bounds_set.insert_strict(range_bounds)?;
-		}
-
-		return Ok(range_bounds_set);
-	}
-}
-
-impl<I, K> FromIterator<K> for RangeBoundsSet<I, K>
-where
-	K: RangeBounds<I>,
-	I: Ord + Clone,
-{
-	#[trivial]
-	fn from_iter<T: IntoIterator<Item = K>>(iter: T) -> Self {
-		let mut output = RangeBoundsSet::new();
-
-		for range_bounds in iter {
-			output.insert_strict(range_bounds).unwrap();
-		}
-
-		return output;
-	}
-}
 impl<I, K> IntoIterator for RangeBoundsSet<I, K>
 where
 	K: RangeBounds<I>,