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

.par shouldn't force and copy random accessible collections #4984

Closed
scabug opened this issue Sep 9, 2011 · 3 comments
Closed

.par shouldn't force and copy random accessible collections #4984

scabug opened this issue Sep 9, 2011 · 3 comments
Labels
enhancement

Comments

@scabug
Copy link

scabug commented Sep 9, 2011

Copying the complete collection when calling .par on IndexedSeqs is wasteful. There are use cases where the IndexedSeq is backed by an external data store which may be (much) bigger than what currently fits into memory. Is there any rationale for that copying in the case of IndexedSeqs? Or is there just no alternative implementation yet?
@scabug
Copy link
Author

scabug commented Sep 9, 2011

Imported From: https://issues.scala-lang.org/browse/SI-4984?orig=1
Reporter: @jrudolph
Affected Versions: 2.9.0-1, 2.9.1

@scabug
Copy link
Author

scabug commented Oct 10, 2011

@axel22 said:
Good question. Well, IndexedSeq still allows the apply operation to be O(log n). But I guess we could have a default implementation for the indexed sequences to avoid the copying, and have them borrow combiners from a concrete collection such as a parallel array.

@SethTisue
Copy link
Member

please open a new ticket at https://github.com/scala/scala-parallel-collections if this is still a concern

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@axel22 @SethTisue @scabug