| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Dynamically Composing Collection Operations through Collection Promises
Abstract : Filtering, mapping, and iterating collections are frequent operations. It is known that composing a number of these operations may create intermediate collections causing an additional and unnecessary overhead. To reduce the number of intermediate collections it is often necessary to rewrite the source code and combine the operations. However, for some cases such reduction becomes aplicable only after a source code refactoring (i.e., when the collection operations are in different methods) which could introduce code duplication. In this paper we propose Collection Promises to dynamically compose collection operations in order to reduce the number of unnecessary intermediate collections. Collection Promises delay a number of collection operations and then merge them using compositions rules. By using Collection Promises developers can automatically reduce the intermediate collections even if the collection operations are in different methods.
Cited literature [8 references]
https://hal.inria.fr/hal-01358347
Contributor : Lse Lse Connect in order to contact the contributor
Submitted on : Wednesday, August 31, 2016 - 3:20:08 PM
Last modification on : Thursday, January 20, 2022 - 4:16:41 PM
Long-term archiving on: : Thursday, December 1, 2016 - 10:32:20 PM
Contributor : Lse Lse Connect in order to contact the contributor
Submitted on : Wednesday, August 31, 2016 - 3:20:08 PM
Last modification on : Thursday, January 20, 2022 - 4:16:41 PM
Long-term archiving on: : Thursday, December 1, 2016 - 10:32:20 PM
File
CollectionPrimisesIWST.pdf
Files produced by the author(s)