update name.

Author: dbittman

Cargo.toml

@@ -1,5 +1,5 @@
 [package]
-name = "interval_tree"
+name = "nonoverlapping_interval_tree"
 version = "0.1.0"
 edition = "2021"
 authors = ["Daniel Bittman <[email protected]>"]
@@ -10,6 +10,7 @@ readme = "README.md"
 description = "Map data structure keyed on (non-overlapping) ranges that allows lookup of a point within a range. Can be no_std (with use of alloc crate)."
 keywords = ["map", "no_std", "range", "interval", "tree"]
 categories = ["data-structures", "no-std"]
+
 [dependencies]
 
 [features]

src/lib.rs

@@ -13,7 +13,7 @@
 //!
 //! # Examples
 //! ```
-//! use interval_tree::NonOverlappingIntervalTree;
+//! use nonoverlapping_interval_tree::NonOverlappingIntervalTree;
 //! let mut it = NonOverlappingIntervalTree::new();
 //! it.insert_replace(1..3, "hello");
 //! assert_eq!(it.get(&2), Some(&"hello"));
@@ -142,7 +142,7 @@ impl<K: Ord + Clone, V> NonOverlappingIntervalTree<K, V> {
     /// are in the tree that overlap with the inserted range.
     /// # Examples
     /// ```
-    /// use interval_tree::NonOverlappingIntervalTree;
+    /// use nonoverlapping_interval_tree::NonOverlappingIntervalTree;
     /// let mut it = NonOverlappingIntervalTree::new();
     /// it.insert_replace(1..3, "hello");
     /// ```