From 958da58afb838e56df44cbc4f996325ff4df06a1 Mon Sep 17 00:00:00 2001
From: ripytide
Date: Mon, 24 Apr 2023 09:33:41 +0100
Subject: [PATCH] bump version and update descriptions read for next release
---
Cargo.lock | 2 +-
Cargo.toml | 6 +++---
README.md | 5 +++--
src/lib.rs | 5 +++--
4 files changed, 10 insertions(+), 8 deletions(-)
diff --git a/Cargo.lock b/Cargo.lock
index 93b1c71..8e522e0 100644
--- a/Cargo.lock
+++ b/Cargo.lock
@@ -105,7 +105,7 @@ dependencies = [
[[package]]
name = "range_bounds_map"
-version = "0.3.2"
+version = "0.4.0"
dependencies = [
"btree_monstrousity",
"either",
diff --git a/Cargo.toml b/Cargo.toml
index 791fc28..0fa5a06 100644
--- a/Cargo.toml
+++ b/Cargo.toml
@@ -1,11 +1,11 @@
[package]
name = "range_bounds_map"
-version = "0.3.2"
+version = "0.4.0"
authors = ["James Forster "]
edition = "2021"
description = """
-This crate provides [`RangeBoundsMap`] and [`RangeBoundsSet`], Data
-Structures for storing non-overlapping intervals based of [`BTreeMap`].
+This crate provides RangeBoundsMap and RangeBoundsSet, Data
+Structures for storing non-overlapping intervals based of BTreeMap.
"""
documentation = "https://docs.rs/range_bounds_map"
readme = "README.md"
diff --git a/README.md b/README.md
index ebe854e..0a7e827 100644
--- a/README.md
+++ b/README.md
@@ -9,8 +9,9 @@
-This crate provides [`RangeBoundsMap`] and [`RangeBoundsSet`], Data
-Structures for storing non-overlapping intervals based of [`BTreeMap`].
+This crate provides [`DiscreteRangeMap`] and [`DiscreteRangeSet`],
+Data Structures for storing non-overlapping discrete intervals based
+off [`BTreeMap`].
## Example using [`Range`]s
diff --git a/src/lib.rs b/src/lib.rs
index d20968a..315c57f 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -17,8 +17,9 @@ You should have received a copy of the GNU Affero General Public License
along with range_bounds_map. If not, see .
*/
-//! This crate provides [`RangeBoundsMap`] and [`RangeBoundsSet`], Data
-//! Structures for storing non-overlapping intervals based of [`BTreeMap`].
+//! This crate provides [`DiscreteRangeMap`] and [`DiscreteRangeSet`],
+//! Data Structures for storing non-overlapping discrete intervals based
+//! off [`BTreeMap`].
//!
//! ## Example using [`Range`]s
//!