From 4c194350dea385787d1eea2e7e49111e5c2b9ad5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Kasper=20Overg=C3=A5rd=20Nielsen?= <kasper@byolimit.com>
Date: Wed, 28 Aug 2024 21:21:05 +0200
Subject: [PATCH] Roll version to 0.2.0 and update CHANGELOG

---
 CHANGELOG.md | 6 ++++++
 pubspec.yaml | 5 ++---
 2 files changed, 8 insertions(+), 3 deletions(-)

diff --git a/CHANGELOG.md b/CHANGELOG.md
index de21bb1..9d24317 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -1,3 +1,9 @@
+## 0.2.0
+
+- Add `TreapSet<T>` a `Set<T>` with constant time `toSet` and logarithmic `elementAt`, `skip`, and `take`.
+- Add comparative benchmark for `HashSet`, `LinkedHashSet`, `SplayTreeSet`, and `TreapSet`.
+- Increase test coverage to 100% branch coverage
+
 ## 0.1.0
 
 - Initial version. Public interface still subject to change.
diff --git a/pubspec.yaml b/pubspec.yaml
index 8c65408..89a1aa8 100644
--- a/pubspec.yaml
+++ b/pubspec.yaml
@@ -3,15 +3,14 @@ description: >-
  A persistent treap for Dart.
  
  A heap balanced randomized binary tree with efficient value semantics.
- All operations are O(log n) worst case.
-
+ 
 topics:
   - treap
   - data-structures
   - collections
   - functional
 
-version: 0.1.0 # still some planned interface changes
+version: 0.2.0 # still some planned interface changes
 homepage: https://github.com/nielsenko/treap
 
 environment: