Verified Commit a96aba88 authored by Camil Staps's avatar Camil Staps 🚀

Fix comments in Data.Set

parent 48aeafe1
Pipeline #8460 passed with stage
in 1 minute and 29 seconds
......@@ -153,9 +153,8 @@ minView :: !.(Set a) -> .(Maybe (!a, !Set a))
maxView :: !.(Set a) -> .(Maybe (!a, !Set a))
/**
* The union of two sets, preferring the first set when equal elements ar
* encountered. The implementation uses the efficient hedge-union algorithm.
* Hedge-union is more efficient on (bigset `union` smallset).
* The union of two sets, preferring the first set when equal elements are
* encountered.
*/
union :: !u:(Set a) !u:(Set a) -> Set a | < a & == a
......
......@@ -163,8 +163,6 @@ deleteMax Tip = Tip
// | /O(n+m)/. The union of two sets, preferring the first set when
// equal elements are encountered.
// The implementation uses the efficient /hedge-union/ algorithm.
// Hedge-union is more efficient on (bigset `union` smallset).
union :: !u:(Set a) !u:(Set a) -> Set a | < a & == a
union t1 Tip = t1
union t1 (Bin _ x Tip Tip) = insertR x t1
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment