Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[SR-10667] Optimise chained SubSequence producing methods into fewer calls #53066

Open
swift-ci opened this issue May 11, 2019 · 0 comments
Open

[SR-10667] Optimise chained SubSequence producing methods into fewer calls #53066

swift-ci opened this issue May 11, 2019 · 0 comments
Labels
compiler The Swift compiler in itself good first issue Good for newcomers improvement performance SILGen Area → compiler: The SIL generation stage

Comments

@swift-ci
Copy link
Collaborator

Previous ID SR-10667
Radar None
Original Reporter bnut (JIRA User)
Type Improvement
Status In Progress
Resolution
Additional Detail from JIRA
Votes 1
Component/s Compiler
Labels Improvement, Performance, SILGen, StarterBug
Assignee mkita (JIRA)
Priority Medium

md5: 3d2eff2a03f31963319181f67fe2b19a

Issue Description:

This code (on BidirectionalCollection) is nice and concise, but it's not efficient:

self.suffix(2).dropLast().last

It could be optimised by the compiler into something like this:

index(endIndex, offsetBy: -2, limitedBy: startIndex).map { self[$0] }

At @jckarter's suggestion this could be implemented with @_semantics similar to some existing optimisations on Array and String. An example of this is here: #5978.

There's a lot of permutations for suffix, prefix, dropFirst, dropLast, first, last, etc. so adding a special case for every one would be excessive. Ideally there is a more generic approach to pattern match and reduce these kinds of expressions. This might be done by having multiple small patterns, that can be combined to reduce the chain of calls iteratively.

Here are some ideas for further optimisations:

// Sequence:
suffix(m).suffix(n) -> suffix(Swift.min(m, n))
prefix(m).prefix(n) -> prefix(Swift.min(m, n))
dropFirst(m).dropFirst(n) -> dropFirst(m + n)
dropLast(m).dropLast(n) -> dropLast(m + n)

prefix(m).dropFirst(n) -> prefix(m - Swift.min(n,m))
suffix(m).dropFirst(n) -> suffix(m - Swift.min(n,m))

filter(where: predicate).first -> first(where: predicate)

// Collection
prefix(n).first -> first
suffix(n).last -> last

prefix(n).last  -> index(startIndex, offsetBy: n, limitedBy: endIndex).map { self[$0] }

// BidirectionalCollection
suffix(n).first -> index(endIndex, offsetBy: -n, limitedBy: startIndex).map { self[$0] }
@swift-ci swift-ci transferred this issue from apple/swift-issues Apr 25, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
compiler The Swift compiler in itself good first issue Good for newcomers improvement performance SILGen Area → compiler: The SIL generation stage
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@swift-ci