That was surprisingly good. I really enjoyed the clever usages of , but I wonder about the efficiency of some of those compositions. The chain of sort/stable_sort he used for sorting by last/first/mid names is impressive, but it sounds inefficient to run sort three times instead of a single sort with a more complex comparator.
That was surprisingly good. I really enjoyed the clever usages of , but I wonder about the efficiency of some of those compositions. The chain of sort/stable_sort he used for sorting by last/first/mid names is impressive, but it sounds inefficient to run sort three times instead of a single sort with a more complex comparator.
Great talk. Wish the background picture could be removed...
A small but important mistake on slide 91: set_difference requires that the original ranges are sorted (w.r.t. operator