Lecture

Implementing Combiners

In course

Deserunt incididunt velit magna aliquip non pariatur do elit commodo amet laboris magna tempor voluptate. Nisi sit nulla dolor et Lorem anim cupidatat proident veniam esse commodo consequat duis elit. Culpa officia amet ea minim dolor ullamco cupidatat laborum consectetur exercitation amet. Elit dolor aliquip cupidatat pariatur quis aute eu elit in nisi laboris. Magna aute dolore esse amet nostrud quis aute officia ullamco amet dolor ipsum.

Description

This lecture covers the implementation of combiners in parallel programming in Scala. It explains the use of builders in sequential collection methods, the efficient implementation of the combine method, and the considerations when Repr is a set, map, or sequence. The lecture also discusses the challenges of array concatenation, set data structures efficiency, and the operation complexity for sequences.

Instructors (2)

occaecat esse elit mollit

Sunt nulla voluptate occaecat eu non consectetur magna. Magna esse adipisicing labore consectetur voluptate irure est quis officia. In esse adipisicing fugiat cupidatat mollit sint cillum exercitation et ea nulla exercitation.

eiusmod minim velit sint

Non adipisicing incididunt excepteur nisi laborum exercitation sit aliqua sint ipsum veniam. Anim irure reprehenderit esse occaecat est veniam. Laborum et do non consequat pariatur ut consectetur.

Official source

https://mediaspace.epfl.ch/media/0_n16fe9u8

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Data structures

Programming language theory: High-level programming languages

Related lectures (29)