commit | 979e0eacbd59327654d0c8d4216d6732413ef2a0 | [log] [tgz] |
---|---|---|
author | mtklein <mtklein@chromium.org> | Thu Feb 12 13:20:08 2015 -0800 |
committer | Commit bot <commit-bot@chromium.org> | Thu Feb 12 13:20:08 2015 -0800 |
tree | 7a2b531b512870ab097c23df7d32548f07c71f84 | |
parent | cd963666006f7171e1dc2156ecf5016d53a7af5b [diff] |
Spin off SkTHashTable, SkTHashMap, SkTHashSet SkTHashTable is very similar to SkTDynamicHash, except it's generalized to support non-pointer value types. It doesn't support remove(), just to keep things simple (it's not hard to add). Instead of an iterator, it has foreach(), again, to keep things simple. SkTHashMap<K,V> and SkTHashSet<T> build a friendlier experience on top of SkTHashTable. BUG=skia: Review URL: https://codereview.chromium.org/925613002