# A sequence that deduplicates an already-sorted sequence

**URL:** <https://forums.swift.org/t/a-sequence-that-deduplicates-an-already-sorted-sequence/79611>\
**Category:** Algorithms\
**Tags:** sorting, sequence\
**Created:** [May 1, 2025, 3:40am UTC](https://forums.swift.org/t/a-sequence-that-deduplicates-an-already-sorted-sequence/79611 "2025-05-01T03:40:57Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![CTMacUser](https://sea2.discourse-cdn.com/swift/user_avatar/forums.swift.org/ctmacuser/32/1802_2.png) [@CTMacUser](https://forums.swift.org/u/CTMacUser)\
**Post date:** [May 1, 2025, 3:40am UTC](https://forums.swift.org/t/a-sequence-that-deduplicates-an-already-sorted-sequence/79611/1 "2025-05-01T03:40:57Z")

</div>

I already wrote the code, made a [pull request](https://github.com/apple/swift-algorithms/pull/257), then added an [issue](https://github.com/apple/swift-algorithms/issues/258).

I'm writing a `Set`-like type for Swift.Collections, and I want to deduplicate the data from a bulk-element initializer before building the binary tree in advance.
