000221664 001__ 221664
000221664 005__ 20190416220333.0
000221664 037__ $$aREP_WORK
000221664 245__ $$aAuto-Collections for Scala
000221664 269__ $$a2016
000221664 260__ $$c2016
000221664 300__ $$a8
000221664 336__ $$aReports
000221664 520__ $$aModern programming languages such as Scala, Java and C# make extensive use of collections. A collection implementation represents a fixed choice in the dimensions of operation time and space utilization. Using the collection in a manner not consistent with this fixed choice can cause significant performance degradation. Often programmers have to choose between under-performing generic collection and specific data-structures at the cost of modularity and ex- tensibility. In his paper, we present and evaluate a generic collection library that automatically choose the appropriate collection implementations for an application. We implemented our solution in the Dotty compiler for Scala and showed that our implementation can choose optimal collections for com- mon basic algorithms.
000221664 700__ $$aRenucci, Allan Vincent Roger
000221664 700__ $$g233192$$aPetrashko, Dmytro$$0248093
000221664 8564_ $$uhttps://infoscience.epfl.ch/record/221664/files/Renucci%20Renucci%20-%202016%20-%20Auto-Collections.pdf$$zn/a$$s202412$$yn/a
000221664 909C0 $$xU10409$$0252187$$pLAMP
000221664 909CO $$ooai:infoscience.tind.io:221664$$qGLOBAL_SET$$pIC$$preport
000221664 917Z8 $$x233192
000221664 937__ $$aEPFL-REPORT-221664
000221664 973__ $$aEPFL
000221664 980__ $$aREPORT