swiftlang/swift

[SR-6865] Sorted collections

Open

#49,414 建立於 2018年1月29日

在 GitHub 查看
 (1 留言) (0 反應) (0 負責人)Swift (69,989 star) (10,719 fork)batch import
featuregood first issuestandard libraryswift evolution proposal needed

描述
Previous ID SR-6865
Radar rdar://problem/20340872
Original Reporter @airspeedswift
Type New Feature
Votes 1
Component/s Standard Library
Labels New Feature, StarterProposal
Assignee None
Priority Medium

md5: 5e738267ffe5dde28ff4e498aac141e3

Issue Description:

It would be useful to have sorted equivalents of Set, Dictionary and Array, that kept their elements in sorted order, and only required Comparable, or could take a custom comparator. SortedSet and SortedDictionary would probably be best represented by a tree, whereas SortedArray would be represented by contiguous storage and would need an API for efficiently adding new entries in bulk.

貢獻者指南

技術棧
swift
領域
data
議題類型
feature
難度面向新貢獻者的預計實作難度，1 表示很小改動，5 表示專家級工作。
5
預計時間有經驗貢獻者完成調查、實作、測試並準備 pull request 的粗略時間範圍。
over 1 week
活動狀態議題目前的可參與程度：新鮮、活躍、陳舊、阻塞或等待維護者輸入。
stale
清晰度議題是否清楚說明預期改動、驗收標準和下一步。
clear
前置要求
Swiftdata structuresAPI design
新手友善度1-100 的估計分數，表示該議題對首次貢獻者的友善程度。
15
研究方向
Review the Swift standard library source code for existing collection types (e.g., Set, Dictionary) in the 'stdlib/public/core' directory. Search for any prior Swift Evolution proposals or discussions about sorted collections. Assess the feasibility of implementing SortedSet and SortedDictionary using a tree structure, and SortedArray using contiguous storage. This issue requires a deep understanding of Swift's standard library design and performance considerations. Consider proposing a detailed design document before implementation.