Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2991041.2991049 | IWST |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan Pablo Sandoval Alcocer | 1 | 29 | 5.62 |
| Marcus Denker | 2 | 285 | 23.94 |
| Alexandre Bergel | 3 | 366 | 53.15 |
| Yasett Acurana | 4 | 0 | 0.34 |