go-hashmap, v1.5
Posted on
The library that implements a hash map with synchronized and concurrent wrappers.
Support stopping of iteration via a context.
Change Log
- support stopping of iteration via a context:
- for a hash map;
- for a synchronized hash map;
- for a concurrent hash map.
Features
- implementation of a hash map:
- use the open addressing strategy for collision resolution;
- use the key interface for supporting custom types;
- support operations:
- getting of an item by a key;
- iteration over items and their keys:
- support stopping of iteration:
- via a handling result;
- via a context;
- support randomizing of iteration order;
- support stopping of iteration:
- setting of an item by a key;
- deleting of an item by a key;
- support options:
- initial capacity;
- maximal load factor;
- grow factor;
- implementation of a synchronized hash map:
- use the interface of an universal storage as an inner map;
- use a mutex lock to access the inner map;
- support operations:
- getting of an item by a key;
- iteration over items and their keys:
- support stopping of iteration:
- via a handling result;
- via a context;
- support randomizing of iteration order;
- support stopping of iteration:
- setting of an item by a key;
- deleting of an item by a key;
- support options:
- inner map;
- implementation of a concurrent hash map:
- use data sharding for concurrent access;
- use the interface of an universal storage as one shard;
- support operations:
- getting of an item by a key;
- iteration over items and their keys:
- support stopping of iteration:
- via a handling result;
- via a context;
- support randomizing of iteration order:
- over items and their keys;
- over shards;
- support stopping of iteration:
- setting of an item by a key;
- deleting of an item by a key;
- support options:
- concurrency level;
- shard factory.
Repository
Link: https://github.com/thewizardplusplus/go-hashmap/tree/v1.5.
Content: code.
License: MIT.