From 978969aabc13d8e47069b8f5a1a9284d1655c11b Mon Sep 17 00:00:00 2001
From: lcnr/Bastian Kauschke <bastian_kauschke@hotmail.de>
Date: Sat, 27 Jul 2019 11:26:22 +0200
Subject: [PATCH 1/2] impl Clone for ops

---
 src/ops.rs | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/ops.rs b/src/ops.rs
index 8ff72ca..262b621 100644
--- a/src/ops.rs
+++ b/src/ops.rs
@@ -93,7 +93,7 @@ where
 /// two original sets.
 ///
 /// [`BitSetLike`]: ../trait.BitSetLike.html
-#[derive(Debug)]
+#[derive(Debug, Clone)]
 pub struct BitSetAnd<A: BitSetLike, B: BitSetLike>(pub A, pub B);
 
 impl<A: BitSetLike, B: BitSetLike> BitSetLike for BitSetAnd<A, B> {
@@ -137,7 +137,7 @@ impl<A: DrainableBitSet, B: DrainableBitSet> DrainableBitSet for BitSetAnd<A, B>
 /// two original sets.
 ///
 /// [`BitSetLike`]: ../trait.BitSetLike.html
-#[derive(Debug)]
+#[derive(Debug, Clone)]
 pub struct BitSetOr<A: BitSetLike, B: BitSetLike>(pub A, pub B);
 
 impl<A: BitSetLike, B: BitSetLike> BitSetLike for BitSetOr<A, B> {
@@ -180,7 +180,7 @@ impl<A: DrainableBitSet, B: DrainableBitSet> DrainableBitSet for BitSetOr<A, B>
 /// Note: the implementation is sub-optimal because layers 1-3 are not active.
 ///
 /// [`BitSetLike`]: ../trait.BitSetLike.html
-#[derive(Debug)]
+#[derive(Debug, Clone)]
 pub struct BitSetNot<A: BitSetLike>(pub A);
 
 impl<A: BitSetLike> BitSetLike for BitSetNot<A> {
@@ -211,7 +211,7 @@ impl<A: BitSetLike> BitSetLike for BitSetNot<A> {
 /// two original sets.
 ///
 /// [`BitSetLike`]: ../trait.BitSetLike.html
-#[derive(Debug)]
+#[derive(Debug, Clone)]
 pub struct BitSetXor<A: BitSetLike, B: BitSetLike>(pub A, pub B);
 
 impl<A: BitSetLike, B: BitSetLike> BitSetLike for BitSetXor<A, B> {
@@ -259,7 +259,7 @@ impl<A: BitSetLike, B: BitSetLike> BitSetLike for BitSetXor<A, B> {
 
 /// `BitSetAll` is a bitset with all bits set. Essentially the same as
 /// `BitSetNot(BitSet::new())` but without any allocation.
-#[derive(Debug)]
+#[derive(Debug, Clone)]
 pub struct BitSetAll;
 impl BitSetLike for BitSetAll {
     #[inline]

From e8cb94ef9e21dd574acec69b34ffb3ea5578ca82 Mon Sep 17 00:00:00 2001
From: lcnr/Bastian Kauschke <bastian_kauschke@hotmail.de>
Date: Sat, 27 Jul 2019 11:27:10 +0200
Subject: [PATCH 2/2] update version from 0.6.2 to 0.6.3

---
 Cargo.toml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Cargo.toml b/Cargo.toml
index cb41771..3863692 100644
--- a/Cargo.toml
+++ b/Cargo.toml
@@ -1,6 +1,6 @@
 [package]
 name = "hibitset"
-version = "0.6.2"
+version = "0.6.3"
 description = "Hierarchical bit set structure"
 documentation = "https://docs.rs/hibitset"
 repository = "https://github.com/slide-rs/hibitset"