bump version and update descriptions read for next release

This commit is contained in:
ripytide
2023-04-24 09:33:41 +01:00
parent fc23e9b96b
commit 958da58afb
4 changed files with 10 additions and 8 deletions
Generated
+1 -1
View File
@@ -105,7 +105,7 @@ dependencies = [
[[package]]
name = "range_bounds_map"
version = "0.3.2"
version = "0.4.0"
dependencies = [
"btree_monstrousity",
"either",
+3 -3
View File
@@ -1,11 +1,11 @@
[package]
name = "range_bounds_map"
version = "0.3.2"
version = "0.4.0"
authors = ["James Forster <james.forsterer@gmail.com>"]
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"
+3 -2
View File
@@ -9,8 +9,9 @@
<img src="logo.png" alt="range_bounds_map_logo" width="350">
</p>
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
+3 -2
View File
@@ -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 <https://www.gnu.org/licenses/>.
*/
//! 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
//!