Defined the behavior of the remove methods when duplicates are possible

Author: Hackerpilot

src/containers/ttree.d

@@ -160,7 +160,11 @@ struct TTree(T, Allocator = Mallocator, bool allowDuplicates = false,
 	alias put = insert;
 
 	/**
-	 * Removes a value from the tree.
+	 * Removes a single value from the tree, or does nothing.
+	 *
+	 * If `allowDuplicates` is true only a single element that is equivalent to
+	 * the given `value` will be removed. Which of these elements is removed is
+	 * not defined.
 	 *
 	 * Params:
 	 *     value = a value equal to the one to be removed
@@ -1326,3 +1330,23 @@ version(emsi_containers_unittest) unittest
 	tt.insert(f);
 	auto r = tt[];
 }
+
+version(emsi_containers_unittest) unittest
+{
+	import std.range : walkLength;
+	import std.stdio;
+
+	TTree!(int, Mallocator, true) tt;
+	tt.insert(10);
+	tt.insert(11);
+	tt.insert(12);
+	writeln(tt[]);
+	assert(tt.length == 3);
+	tt.insert(11);
+	writeln(tt[]);
+	assert(tt.length == 4);
+	tt.remove(11);
+	writeln(tt[]);
+	assert(tt.length == 3);
+	assert(tt[].walkLength == tt.length);
+}

src/containers/unrolledlist.d

@@ -194,7 +194,8 @@ struct UnrolledList(T, Allocator = Mallocator,
 	}
 
 	/**
-	 * Removes the given item from the list.
+	 * Removes the first instance of the given item from the list.
+	 *
 	 * Returns: true if something was removed.
 	 */
 	bool remove(T item)