Updating release notes and readme, which was accidentally updated to …

…to non-merged overhaul from erik domke.

README.md

@@ -53,10 +53,10 @@ var tree = new RangeTree<int, string>()
 // Alternatively, use the Add method, for example:
 // tree.Add(0, 10, "1");
 
-var results1 = tree[5];     // 1 item: [0 - 10] "1"
-var results2 = tree[10];    // 1 item: [0 - 10] "1"
-var results3 = tree[29];    // 2 items: [20 - 30] "2", [25 - 35] "4"
-var results4 = tree[5, 15]; // 2 items: [0 - 10] "1", [15 - 17] "3"
+var results1 = tree.Query(5);     // 1 item: [0 - 10]
+var results2 = tree.Query(10);    // 1 item: [0 - 10]
+var results3 = tree.Query(29);    // 2 items: [20 - 30], [25 - 35]
+var results4 = tree.Query(5, 15); // 2 items: [0 - 10], [15 - 17]
 ```
 
 The solution file contains a few examples and also a comparision of the default and async versions.

RangeTree/RangeTree.csproj

@@ -20,7 +20,8 @@ In computer science, an interval tree is an ordered tree data structure to hold
     <PackageId>RangeTree</PackageId>
     <Authors>Matthias Buchetics, Alexander Pacha, Steve Hansen, Erik Domke</Authors>
     <Product>RangeTree  - A generic interval tree implementation in C#</Product>
-    <PackageReleaseNotes>Fixing bug that an exception is thrown when querying an empty tree that previously had elements.
+    <PackageReleaseNotes>Major overhaul by Erik Domke to a nice and cleaner interface.
+Support for async version has been dropped and Rebuild / AutoRebuild functionality is now only internal (there was no reason for making it accessible from the outside anyway).
 For a full list changes at https://github.com/mbuchetics/RangeTree/releases</PackageReleaseNotes>
     <AssemblyVersion>2.0.0</AssemblyVersion>
     <FileVersion>2.0.0</FileVersion>