Todo List

Class ash::dense_hashset< Value, HashFx, EqualKey, Alloc >

csilvers: implement Alloc get_allocator() const;

Member ash::dense_hashtable< Value, Key, HashFx, KeyAccess, EqualKey, TblAlloc >::set_empty_key (const_reference val)

csilvers: change all callers of this to pass in a key instead, and take a const key_type instead of const value_type.

Member ash::hashmatrix::bucket_count () const

Loki: This is ugly, fix this on the hashtable end.

Member ash::hashmatrix::max_bucket_count () const

Loki: This is ugly, fix this on the hashtable end.

Member ash::hashmatrix::max_size () const

Loki: This is ugly, fix this on the hashtable end.

Class ash::sparse_group< Val, GroupSz, TblAlloc >

Loki: The STL container that's most closely related seems to be std::vector. Refactor to use std::vector semantics where possible/reasonable. Iterators need special attention; the nonempty_iterator may fit the STL idea of an iterator better.

Member ash::sparse_group< Val, GroupSz, TblAlloc >::copy (size_type i, const_reference val)

austern: Make this exception safe: handle exceptions from value_type's copy constructor.

Member ash::sparse_group< Val, GroupSz, TblAlloc >::erase (size_type i)

austern: Make this exception safe: handle exceptions from value_type's copy constructor.

Member ash::sparse_group< Val, GroupSz, TblAlloc >::mutating_get (size_type i)

csilvers: make protected + friend.

Member ash::sparse_group< Val, GroupSz, TblAlloc >::operator= (sparse_group const &sg)

austern: Make this exception safe. Handle exceptions in value_type's copy constructor.

Member ash::sparse_group< Val, GroupSz, TblAlloc >::set (size_type i, const_reference val)

austern: Make this exception safe: handle exceptions from value_type's copy constructor.

Member ash::sparse_group< Val, GroupSz, TblAlloc >::unsafe_get (size_type i) const

csilvers: make protected + friend. This is used by sparse_hashtable to get an element from the table when we know it exists.

Class ash::sparse_hashmap< Key, Data, HashFx, EqualKey, Alloc >

csilvers: implement Alloc get_allocator() const;

Class ash::sparse_hashset< Value, HashFx, EqualKey, Alloc >

csilvers: implement Alloc get_allocator() const;

Class ash::sparse_table< Val, GroupSz, TblAlloc >

Loki: The STL container that's most closely related seems to be std::vector. Refactor to use std::vector semantics where possible/reasonable. Iterators need special attention; the nonempty_iterator may fit the STL idea of an iterator better.

Member ash::sparse_table< Val, GroupSz, TblAlloc >::mutating_get (size_type i)

csilvers: make protected + friend.

Member ash::sparse_table< Val, GroupSz, TblAlloc >::unsafe_get (size_type i) const

csilvers: make protected + friend. This is used by sparse_hashtable to get an element from the table when we know it exists.