dietmarkuehl

Let's Hash Things Out

At the Albuquerque meeting P0814 "hash_combine() Again" was discussed and accepted for further work by LEWG. Unfortunately, this proposal throws out multiple improvements on hashing supportapproach and disregards a substantial amount of work leading to superior hashing support. This proposal is an attempt to bring the various bits together to avoid accepting an inferior approach into the standard C++ library.

dietmarkuehl

ToDo

The link pointing here needs to be replaced to point at a more sensible place.

dietmarkuehl

Defining and Using a Symbol Analogue for Error Reporting in C++

Abstract

The use of exceptions isn't a viable error handling approach in all cases and returning codes for error handling is sometimes preferable. However, using integral types for error identification is problematic as there is no good mechanism to guarantee that each value uniquely

dietmarkuehl

Graph Algorithms Hand-Out

Terms

• graph: G = (V, E)
  • V = vertices, nodes
  • E = edges, i.e., pairs (n, m) of nodes; [directed] links between nodes
• node n is adjacent to node m if there is an edge (n, m) or (m, n)
  • generally there are multiple nodes adjacent to a node n
• for a node it is possible to get iterators for the adjacent nodes

dietmarkuehl

Value Types

This page describes what should be considered when creating a value type. It provides a quick checklist which can be used as a reminder of the various considerations. It also contains an explanation of the why the various consideration are important and possible implementatation strategies.

There are many places where allocators are mentioned. The allocators mention on this page are generally refering to the base class