Roll version to 0.2.0 and update CHANGELOG

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.

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: