swiftlang/swift

[SR-6865] Sorted collections

Open

#49,414 opened on Jan 29, 2018

View on GitHub
 (1 comment) (0 reactions) (0 assignees)Swift (10,719 forks)batch import
featuregood first issuestandard libraryswift evolution proposal needed

Repository metrics

Stars
 (69,989 stars)
PR merge metrics
 (Avg merge 8d 17h) (510 merged PRs in 30d)

Description
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.

Contributor guide

Research direction
Study the current Swift collection protocols (Set, Dictionary, Array) and design sorted variants using balanced trees or contiguous storage with efficient bulk insertion. Look at existing sorted collection implementations in other languages for inspiration.
Tech stack
swift
Domain
api
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
3-5 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Stale
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
SwiftData Structures
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
60