Simplify turning DynamicSortedSet into Slice

arBmind · arBmind · commit 58a749d4817d · 2025-02-17T22:30:47.000+01:00
diff --git a/src/array19.lib/array19/DynamicSortedSet.h b/src/array19.lib/array19/DynamicSortedSet.h
@@ -20,6 +20,8 @@ template<class T, class Less = std::less<>> struct DynamicSortedSet {
         return b != e;
     }
 
+    operator SliceOf<T const>() const { return SliceOf{begin(), count()}; }
+
     void add(T const& v) {
         auto [b, e] = std::equal_range(m.amendBegin(), m.amendEnd(), v, Less{});
         if (b == e) {

Original file line number	Diff line number	Diff line change
`@@ -20,6 +20,8 @@ template<class T, class Less = std::less<>> struct DynamicSortedSet {`
`20`	`20`	`return b != e;`
`21`	`21`	`}`
`22`	`22`
	`23`	`+ operator SliceOf<T const>() const { return SliceOf{begin(), count()}; }`
	`24`	`+`
`23`	`25`	`void add(T const& v) {`
`24`	`26`	`auto [b, e] = std::equal_range(m.amendBegin(), m.amendEnd(), v, Less{});`
`25`	`27`	`if (b == e) {`