Dynamically Composing Collection Operations ...
Type de document :
Communication dans un congrès avec actes
DOI :
Titre :
Dynamically Composing Collection Operations through Collection Promises
Auteur(s) :
Sandoval Alcocer, Juan Pablo [Auteur]
Computer Science Department [Santiago] [DCC]
Denker, Marcus [Auteur]
Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD]
Bergel, Alexandre [Auteur]
Computer Science Department [Santiago] [DCC]
Acurana, Yasett [Auteur]
Computer Science Department [Santiago] [DCC]
Computer Science Department [Santiago] [DCC]
Denker, Marcus [Auteur]
Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD]
Bergel, Alexandre [Auteur]
Computer Science Department [Santiago] [DCC]
Acurana, Yasett [Auteur]
Computer Science Department [Santiago] [DCC]
Titre de la manifestation scientifique :
Proceedings of the 11th Edition of the International Workshop on Smalltalk Technologies
Organisateur(s) de la manifestation scientifique :
ESUG
Ville :
Prague
Pays :
République tchèque
Date de début de la manifestation scientifique :
2016-08-22
Titre de l’ouvrage :
IWST'16
Titre de la revue :
Proceedings of the 11th Edition of the International Workshop on Smalltalk Technologies
Date de publication :
2016-08-31
Mot(s)-clé(s) en anglais :
promises
programming
collection
optimisation
programming
collection
optimisation
Discipline(s) HAL :
Informatique [cs]/Langage de programmation [cs.PL]
Résumé en anglais : [en]
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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01358347/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01358347/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01358347/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- CollectionPrimisesIWST.pdf
- Accès libre
- Accéder au document