Removed unused code

Author: RonPieket

BinaryRelations/BinaryRelations.h

@@ -52,12 +52,6 @@ typename std::vector<T>::const_iterator findInSortedVector(const std::vector<T>
         return vector->cend();
 }
 
-template <typename T> int appendToSortedVector(std::vector<T> *vector, const T &value) noexcept
-{
-    vector->append(value);
-    return 1;
-}
-
 template <typename T> int insertIntoSortedVector(std::vector<T> *vector, const T &value) noexcept
 {
     typename std::vector<T>::iterator it = std::lower_bound(vector->begin(), vector->end(), value);

README.md

@@ -322,11 +322,11 @@ Results microseconds.
 all those I have found have a license that is more restrictive than the MIT
 license.
 
-The array insert operation, which requires shifting half the array on average,
-is definitely a performance liability. This can be improved by segmenting the
-array, so that you only have to shift half of the segment.
+The array insert and erase operations, which require shifting half the array on
+average, are definitely a performance liability. This can be optimized, at the
+cost complexity.
 
-Performance of this tech has not been an issue in our tools. But there is plenty
+Performance of this tech has not been an issue in our tools, but there is plenty
 of room for improvement.
 
 How it works