Back to 2014-proposals
Title: Accessible Algorithms
Proposer: Dietmar Kuhl
Type: Tutorial
Duration: 90 mins
Description:
The standard C++ library contains a fairly large set of algorithms suitable for containers. The interface to these algorithms makes them unnecesary hard to use: Even if there is a readily available perfect match, the need to extract a pair of iterators for a container seems unnecessary hard. Also, the interface is makes it hard or inefficient to apply the algorithms to certain kinds of commonly used sequences, e.g., C strings. When it comes to processing sequences with multiple separate fields or multiple parallel sequences. Interestingly, all of these problems can be resolved by using slightly different but compatible concepts when implementing the algorithms. This presentation discusses the various problems and their respective solution (ranges, hetrogenous iterators, consistently delimited sequences, property maps) and shows how C++ 2011 features can be used to create an integrated solutions providing much for flexible while easier to use algorithms.
2014:accessible_algorithms
2014/accessible_algorithms.txt · Last modified: 2016/06/11 14:05 by 127.0.0.1