Merge branch 'release-0.2.0'

Author: gmardau

.gitignore

@@ -1,3 +1,2 @@
 src/btree
-src/kd_tree
 src/orthtree

README.md

@@ -14,7 +14,7 @@ This library adopts the single include policy. To use it, download the [latest r
 
 ## Future Development
 
-At the time of writing, the library contains only Binary trees. In future releases this library is expected to include Space Partitioning trees (namely KD-trees and Orthrees (n-analogue of quadtrees)) and B-trees.
+At the time of writing, the library contains Binary trees and Point k-d trees. In future releases this library is expected to include other Space Partitioning trees (namely Range k-d trees and Orthrees (n-analogue of quadtrees)) and B-trees.
 
 ## License
 

docs/examples/binary_tree/map/array_subscript.cpp

@@ -1,7 +1,7 @@
 #include <iostream>
 
 using intpair = std::pair<int, int>;
-std::ostream& operator<<(std::ostream& os, const intpair& i) {
+std::ostream &operator<< (std::ostream &os, const intpair &i) {
 	os << i.first << ',' << i.second; return os;
 }
 

docs/examples/binary_tree/map/assign.cpp

@@ -1,7 +1,7 @@
 #include <iostream>
 
 using intpair = std::pair<int, int>;
-std::ostream& operator<<(std::ostream& os, const intpair& i) {
+std::ostream &operator<< (std::ostream &os, const intpair &i) {
 	os << i.first << ',' << i.second; return os;
 }
 

docs/examples/binary_tree/map/at.cpp

@@ -1,7 +1,7 @@
 #include <iostream>
 
 using intpair = std::pair<int, int>;
-std::ostream& operator<<(std::ostream& os, const intpair& i) {
+std::ostream &operator<< (std::ostream &os, const intpair &i) {
 	os << i.first << ',' << i.second; return os;
 }
 

docs/examples/binary_tree/map/capacity.cpp

@@ -1,7 +1,7 @@
 #include <iostream>
 
 using intpair = std::pair<int, int>;
-std::ostream& operator<<(std::ostream& os, const intpair& i) {
+std::ostream &operator<< (std::ostream &os, const intpair &i) {
 	os << i.first << ',' << i.second; return os;
 }
 

docs/examples/binary_tree/map/clear.cpp

@@ -1,7 +1,7 @@
 #include <iostream>
 
 using intpair = std::pair<int, int>;
-std::ostream& operator<<(std::ostream& os, const intpair& i) {
+std::ostream &operator<< (std::ostream &os, const intpair &i) {
 	os << i.first << ',' << i.second; return os;
 }
 

docs/examples/binary_tree/map/comparison.cpp

@@ -1,7 +1,7 @@
 #include <iostream>
 
 using intpair = std::pair<int, int>;
-std::ostream& operator<<(std::ostream& os, const intpair& i) {
+std::ostream &operator<< (std::ostream &os, const intpair &i) {
 	os << i.first << ',' << i.second; return os;
 }
 

docs/examples/binary_tree/map/constructor.cpp

@@ -1,7 +1,7 @@
 #include <iostream>
 
 using intpair = std::pair<int, int>;
-std::ostream& operator<<(std::ostream& os, const intpair& i) {
+std::ostream &operator<< (std::ostream &os, const intpair &i) {
 	os << i.first << ',' << i.second; return os;
 }
 

docs/examples/binary_tree/map/contains.cpp

@@ -1,7 +1,7 @@
 #include <iostream>
 
 using intpair = std::pair<int, int>;
-std::ostream& operator<<(std::ostream& os, const intpair& i) {
+std::ostream &operator<< (std::ostream &os, const intpair &i) {
 	os << i.first << ',' << i.second; return os;
 }