Skip to content

Latest commit

History

49 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

simd_hash_map

REQUIREMENTS TO BUILD:

API as of 26 April 2019

  • Template Parameters
    • class Key
    • class T
    • class Hash = std::hash<Key>
    • class KeyEqual = std::equal_to<Key>
  • Member Types
    • key_type : Key
    • mapped_type : T
    • value_type : std::pair<const Key, T>
    • size_type : std::size_t
    • difference_type : std::ptrdiff_t
    • hasher : Hash
    • key_equal : KeyEqual
    • reference : value_type&
    • const_reference : const value_type&
    • pointer : value_type*
    • const_pointer : const value_type*
    • iterator : LegacyForwardIterator
    • const_iterator : Constant LegacyForwardIterator
  • Member Functions
    • (constructor)
    • (destructor)
  • Iterators
    • begin() and cbegin()
      • Returns an iterator to the beginning.
    • end() and cend()
      • Returns an iterator to the end.
  • Modifiers
    • template<typename Args...>
    • try_emplace(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given Args.
        • False: Key already found in map, nothing occured.
      • Try to emplace key/value into the map.
      • If key is already present, nothing occurs
    • template<typename Args...>
    • emplace_or_assign(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given key and Args.
        • False: Key already found in map, new value assigned.
      • Emplace key/value into the map.
    • erase(key_type)
      • return : bool
        • True: Key found, value_type erased
        • False: Key not found, nothing occured
      • Erase key/value with given key.
  • Lookup
    • find(key_type)
      • return : std::optional<iterator>
        • Optional contains iterator if key was successfully found.
        • Iterator to key/value pair.
      • find key/value pair with given key
    • contains(key_type)
      • return : bool
        • True: Map conatins key.
        • False: Map does not contain key.
      • Check if map conatins key/value pair with given key.
    • clear()
      • return : void
      • Clear and reset the map.
      • Does not change max_size() of map.
  • Capcaity
    • size()
      • return : std::size_t
      • Returns the size of the map (aka number of inserted pairs).
    • max_size()
      • return : std::size_t
      • Returns the maximum capacity of map before needing to grow/rehash.
    • empty()
      • return : bool
      • Checks if the map is empty or not.
  • Hash Policy
    • load_factor()
      • return : float
      • Returns the load factor of the current map.
      • load_factor() == size()/max_size()
  • Observers
    • key_eq()
      • return : const KeyEqual&
    • hash_functions()
      • return : const Hash&

Major Differences between simd_hash_map and std::unordered_map

  • To optimize value semantics and reduce unnecessary moves and copies, the two "inserting" functions take a key and forwarded value arguments separately. If value_type is emplaced, it is constructed as value_type {std::piecewise_construct, std::forward_as_tuple(key_type), std::forward_as_tuple(std::forward<Args>(args)...)};. If just the mapped_type is inserted due to the key already existing, the following occurs: old_mapped_value = std::move(mapped_type{std::forward<Args>(args)...});.
  • Due to the nature of how this hash table deals with collisions, the user cannot determine the load factor as when the hash table will grow in size.
  • find(key_type) returns an std::optional<iterator>. This is because I try to practice declarative programming, and returning an std::optional is IMO more delcarative than just an iterator which could point to the end of the map.
  • As of 26 April 2019, this container does not take custom allocators, however, this feature will be implemented in the future.

Tests

To run tests, compile as follow inside the tests/ directory

gcc tests-main.cpp "test file"

About

A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX)

Resources

Stars

12 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
GitHub - NathanSWard/simd_hash_map: A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX) · GitHub
Skip to content

Latest commit

History

49 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

simd_hash_map

REQUIREMENTS TO BUILD:

API as of 26 April 2019

  • Template Parameters
    • class Key
    • class T
    • class Hash = std::hash<Key>
    • class KeyEqual = std::equal_to<Key>
  • Member Types
    • key_type : Key
    • mapped_type : T
    • value_type : std::pair<const Key, T>
    • size_type : std::size_t
    • difference_type : std::ptrdiff_t
    • hasher : Hash
    • key_equal : KeyEqual
    • reference : value_type&
    • const_reference : const value_type&
    • pointer : value_type*
    • const_pointer : const value_type*
    • iterator : LegacyForwardIterator
    • const_iterator : Constant LegacyForwardIterator
  • Member Functions
    • (constructor)
    • (destructor)
  • Iterators
    • begin() and cbegin()
      • Returns an iterator to the beginning.
    • end() and cend()
      • Returns an iterator to the end.
  • Modifiers
    • template<typename Args...>
    • try_emplace(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given Args.
        • False: Key already found in map, nothing occured.
      • Try to emplace key/value into the map.
      • If key is already present, nothing occurs
    • template<typename Args...>
    • emplace_or_assign(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given key and Args.
        • False: Key already found in map, new value assigned.
      • Emplace key/value into the map.
    • erase(key_type)
      • return : bool
        • True: Key found, value_type erased
        • False: Key not found, nothing occured
      • Erase key/value with given key.
  • Lookup
    • find(key_type)
      • return : std::optional<iterator>
        • Optional contains iterator if key was successfully found.
        • Iterator to key/value pair.
      • find key/value pair with given key
    • contains(key_type)
      • return : bool
        • True: Map conatins key.
        • False: Map does not contain key.
      • Check if map conatins key/value pair with given key.
    • clear()
      • return : void
      • Clear and reset the map.
      • Does not change max_size() of map.
  • Capcaity
    • size()
      • return : std::size_t
      • Returns the size of the map (aka number of inserted pairs).
    • max_size()
      • return : std::size_t
      • Returns the maximum capacity of map before needing to grow/rehash.
    • empty()
      • return : bool
      • Checks if the map is empty or not.
  • Hash Policy
    • load_factor()
      • return : float
      • Returns the load factor of the current map.
      • load_factor() == size()/max_size()
  • Observers
    • key_eq()
      • return : const KeyEqual&
    • hash_functions()
      • return : const Hash&

Major Differences between simd_hash_map and std::unordered_map

  • To optimize value semantics and reduce unnecessary moves and copies, the two "inserting" functions take a key and forwarded value arguments separately. If value_type is emplaced, it is constructed as value_type {std::piecewise_construct, std::forward_as_tuple(key_type), std::forward_as_tuple(std::forward<Args>(args)...)};. If just the mapped_type is inserted due to the key already existing, the following occurs: old_mapped_value = std::move(mapped_type{std::forward<Args>(args)...});.
  • Due to the nature of how this hash table deals with collisions, the user cannot determine the load factor as when the hash table will grow in size.
  • find(key_type) returns an std::optional<iterator>. This is because I try to practice declarative programming, and returning an std::optional is IMO more delcarative than just an iterator which could point to the end of the map.
  • As of 26 April 2019, this container does not take custom allocators, however, this feature will be implemented in the future.

Tests

To run tests, compile as follow inside the tests/ directory

gcc tests-main.cpp "test file"

About

A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX)

Resources

Stars

12 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Force GitHub README to respect dark mode (function() { var style = document.createElement('style'); style.textContent = ' .markdown-body { color-scheme: dark light; } .markdown-body pre { background: #161b22 !important; } .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; } .markdown-body table th, .markdown-body table td { border-color: #30363d !important; } .markdown-body img { background: #0d1117; } .markdown-body blockquote { border-left-color: #8b949e; } .markdown-body hr { border-color: #30363d; } '; document.head.appendChild(style); })(); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - NathanSWard/simd_hash_map: A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX) · GitHub
Skip to content

Latest commit

History

49 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

simd_hash_map

REQUIREMENTS TO BUILD:

API as of 26 April 2019

  • Template Parameters
    • class Key
    • class T
    • class Hash = std::hash<Key>
    • class KeyEqual = std::equal_to<Key>
  • Member Types
    • key_type : Key
    • mapped_type : T
    • value_type : std::pair<const Key, T>
    • size_type : std::size_t
    • difference_type : std::ptrdiff_t
    • hasher : Hash
    • key_equal : KeyEqual
    • reference : value_type&
    • const_reference : const value_type&
    • pointer : value_type*
    • const_pointer : const value_type*
    • iterator : LegacyForwardIterator
    • const_iterator : Constant LegacyForwardIterator
  • Member Functions
    • (constructor)
    • (destructor)
  • Iterators
    • begin() and cbegin()
      • Returns an iterator to the beginning.
    • end() and cend()
      • Returns an iterator to the end.
  • Modifiers
    • template<typename Args...>
    • try_emplace(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given Args.
        • False: Key already found in map, nothing occured.
      • Try to emplace key/value into the map.
      • If key is already present, nothing occurs
    • template<typename Args...>
    • emplace_or_assign(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given key and Args.
        • False: Key already found in map, new value assigned.
      • Emplace key/value into the map.
    • erase(key_type)
      • return : bool
        • True: Key found, value_type erased
        • False: Key not found, nothing occured
      • Erase key/value with given key.
  • Lookup
    • find(key_type)
      • return : std::optional<iterator>
        • Optional contains iterator if key was successfully found.
        • Iterator to key/value pair.
      • find key/value pair with given key
    • contains(key_type)
      • return : bool
        • True: Map conatins key.
        • False: Map does not contain key.
      • Check if map conatins key/value pair with given key.
    • clear()
      • return : void
      • Clear and reset the map.
      • Does not change max_size() of map.
  • Capcaity
    • size()
      • return : std::size_t
      • Returns the size of the map (aka number of inserted pairs).
    • max_size()
      • return : std::size_t
      • Returns the maximum capacity of map before needing to grow/rehash.
    • empty()
      • return : bool
      • Checks if the map is empty or not.
  • Hash Policy
    • load_factor()
      • return : float
      • Returns the load factor of the current map.
      • load_factor() == size()/max_size()
  • Observers
    • key_eq()
      • return : const KeyEqual&
    • hash_functions()
      • return : const Hash&

Major Differences between simd_hash_map and std::unordered_map

  • To optimize value semantics and reduce unnecessary moves and copies, the two "inserting" functions take a key and forwarded value arguments separately. If value_type is emplaced, it is constructed as value_type {std::piecewise_construct, std::forward_as_tuple(key_type), std::forward_as_tuple(std::forward<Args>(args)...)};. If just the mapped_type is inserted due to the key already existing, the following occurs: old_mapped_value = std::move(mapped_type{std::forward<Args>(args)...});.
  • Due to the nature of how this hash table deals with collisions, the user cannot determine the load factor as when the hash table will grow in size.
  • find(key_type) returns an std::optional<iterator>. This is because I try to practice declarative programming, and returning an std::optional is IMO more delcarative than just an iterator which could point to the end of the map.
  • As of 26 April 2019, this container does not take custom allocators, however, this feature will be implemented in the future.

Tests

To run tests, compile as follow inside the tests/ directory

gcc tests-main.cpp "test file"

About

A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX)

Resources

Stars

12 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Highlight search terms from Google/DuckDuckGo/Bing referrer (function() { var ref = document.referrer; var terms = []; if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) { var url = new URL(ref); var q = url.searchParams.get('q') || url.searchParams.get('p'); if (q) { terms = q.split(/\s+/).filter(function(t) { return t.length > 2; }); } } if (terms.length === 0) return; var style = document.createElement('style'); style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }'; document.head.appendChild(style); function highlight(node) { if (node.nodeType === 3) { // text node var text = node.textContent; var found = false; terms.forEach(function(term) { var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - NathanSWard/simd_hash_map: A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX) · GitHub
Skip to content

Latest commit

History

49 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

simd_hash_map

REQUIREMENTS TO BUILD:

API as of 26 April 2019

  • Template Parameters
    • class Key
    • class T
    • class Hash = std::hash<Key>
    • class KeyEqual = std::equal_to<Key>
  • Member Types
    • key_type : Key
    • mapped_type : T
    • value_type : std::pair<const Key, T>
    • size_type : std::size_t
    • difference_type : std::ptrdiff_t
    • hasher : Hash
    • key_equal : KeyEqual
    • reference : value_type&
    • const_reference : const value_type&
    • pointer : value_type*
    • const_pointer : const value_type*
    • iterator : LegacyForwardIterator
    • const_iterator : Constant LegacyForwardIterator
  • Member Functions
    • (constructor)
    • (destructor)
  • Iterators
    • begin() and cbegin()
      • Returns an iterator to the beginning.
    • end() and cend()
      • Returns an iterator to the end.
  • Modifiers
    • template<typename Args...>
    • try_emplace(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given Args.
        • False: Key already found in map, nothing occured.
      • Try to emplace key/value into the map.
      • If key is already present, nothing occurs
    • template<typename Args...>
    • emplace_or_assign(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given key and Args.
        • False: Key already found in map, new value assigned.
      • Emplace key/value into the map.
    • erase(key_type)
      • return : bool
        • True: Key found, value_type erased
        • False: Key not found, nothing occured
      • Erase key/value with given key.
  • Lookup
    • find(key_type)
      • return : std::optional<iterator>
        • Optional contains iterator if key was successfully found.
        • Iterator to key/value pair.
      • find key/value pair with given key
    • contains(key_type)
      • return : bool
        • True: Map conatins key.
        • False: Map does not contain key.
      • Check if map conatins key/value pair with given key.
    • clear()
      • return : void
      • Clear and reset the map.
      • Does not change max_size() of map.
  • Capcaity
    • size()
      • return : std::size_t
      • Returns the size of the map (aka number of inserted pairs).
    • max_size()
      • return : std::size_t
      • Returns the maximum capacity of map before needing to grow/rehash.
    • empty()
      • return : bool
      • Checks if the map is empty or not.
  • Hash Policy
    • load_factor()
      • return : float
      • Returns the load factor of the current map.
      • load_factor() == size()/max_size()
  • Observers
    • key_eq()
      • return : const KeyEqual&
    • hash_functions()
      • return : const Hash&

Major Differences between simd_hash_map and std::unordered_map

  • To optimize value semantics and reduce unnecessary moves and copies, the two "inserting" functions take a key and forwarded value arguments separately. If value_type is emplaced, it is constructed as value_type {std::piecewise_construct, std::forward_as_tuple(key_type), std::forward_as_tuple(std::forward<Args>(args)...)};. If just the mapped_type is inserted due to the key already existing, the following occurs: old_mapped_value = std::move(mapped_type{std::forward<Args>(args)...});.
  • Due to the nature of how this hash table deals with collisions, the user cannot determine the load factor as when the hash table will grow in size.
  • find(key_type) returns an std::optional<iterator>. This is because I try to practice declarative programming, and returning an std::optional is IMO more delcarative than just an iterator which could point to the end of the map.
  • As of 26 April 2019, this container does not take custom allocators, however, this feature will be implemented in the future.

Tests

To run tests, compile as follow inside the tests/ directory

gcc tests-main.cpp "test file"

About

A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX)

Resources

Stars

12 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ' GitHub - NathanSWard/simd_hash_map: A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX) · GitHub
Skip to content

Latest commit

History

49 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

simd_hash_map

REQUIREMENTS TO BUILD:

API as of 26 April 2019

  • Template Parameters
    • class Key
    • class T
    • class Hash = std::hash<Key>
    • class KeyEqual = std::equal_to<Key>
  • Member Types
    • key_type : Key
    • mapped_type : T
    • value_type : std::pair<const Key, T>
    • size_type : std::size_t
    • difference_type : std::ptrdiff_t
    • hasher : Hash
    • key_equal : KeyEqual
    • reference : value_type&
    • const_reference : const value_type&
    • pointer : value_type*
    • const_pointer : const value_type*
    • iterator : LegacyForwardIterator
    • const_iterator : Constant LegacyForwardIterator
  • Member Functions
    • (constructor)
    • (destructor)
  • Iterators
    • begin() and cbegin()
      • Returns an iterator to the beginning.
    • end() and cend()
      • Returns an iterator to the end.
  • Modifiers
    • template<typename Args...>
    • try_emplace(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given Args.
        • False: Key already found in map, nothing occured.
      • Try to emplace key/value into the map.
      • If key is already present, nothing occurs
    • template<typename Args...>
    • emplace_or_assign(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given key and Args.
        • False: Key already found in map, new value assigned.
      • Emplace key/value into the map.
    • erase(key_type)
      • return : bool
        • True: Key found, value_type erased
        • False: Key not found, nothing occured
      • Erase key/value with given key.
  • Lookup
    • find(key_type)
      • return : std::optional<iterator>
        • Optional contains iterator if key was successfully found.
        • Iterator to key/value pair.
      • find key/value pair with given key
    • contains(key_type)
      • return : bool
        • True: Map conatins key.
        • False: Map does not contain key.
      • Check if map conatins key/value pair with given key.
    • clear()
      • return : void
      • Clear and reset the map.
      • Does not change max_size() of map.
  • Capcaity
    • size()
      • return : std::size_t
      • Returns the size of the map (aka number of inserted pairs).
    • max_size()
      • return : std::size_t
      • Returns the maximum capacity of map before needing to grow/rehash.
    • empty()
      • return : bool
      • Checks if the map is empty or not.
  • Hash Policy
    • load_factor()
      • return : float
      • Returns the load factor of the current map.
      • load_factor() == size()/max_size()
  • Observers
    • key_eq()
      • return : const KeyEqual&
    • hash_functions()
      • return : const Hash&

Major Differences between simd_hash_map and std::unordered_map

  • To optimize value semantics and reduce unnecessary moves and copies, the two "inserting" functions take a key and forwarded value arguments separately. If value_type is emplaced, it is constructed as value_type {std::piecewise_construct, std::forward_as_tuple(key_type), std::forward_as_tuple(std::forward<Args>(args)...)};. If just the mapped_type is inserted due to the key already existing, the following occurs: old_mapped_value = std::move(mapped_type{std::forward<Args>(args)...});.
  • Due to the nature of how this hash table deals with collisions, the user cannot determine the load factor as when the hash table will grow in size.
  • find(key_type) returns an std::optional<iterator>. This is because I try to practice declarative programming, and returning an std::optional is IMO more delcarative than just an iterator which could point to the end of the map.
  • As of 26 April 2019, this container does not take custom allocators, however, this feature will be implemented in the future.

Tests

To run tests, compile as follow inside the tests/ directory

gcc tests-main.cpp "test file"

About

A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX)

Resources

Stars

12 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - NathanSWard/simd_hash_map: A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX) · GitHub
Skip to content

Latest commit

History

49 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

simd_hash_map

REQUIREMENTS TO BUILD:

API as of 26 April 2019

  • Template Parameters
    • class Key
    • class T
    • class Hash = std::hash<Key>
    • class KeyEqual = std::equal_to<Key>
  • Member Types
    • key_type : Key
    • mapped_type : T
    • value_type : std::pair<const Key, T>
    • size_type : std::size_t
    • difference_type : std::ptrdiff_t
    • hasher : Hash
    • key_equal : KeyEqual
    • reference : value_type&
    • const_reference : const value_type&
    • pointer : value_type*
    • const_pointer : const value_type*
    • iterator : LegacyForwardIterator
    • const_iterator : Constant LegacyForwardIterator
  • Member Functions
    • (constructor)
    • (destructor)
  • Iterators
    • begin() and cbegin()
      • Returns an iterator to the beginning.
    • end() and cend()
      • Returns an iterator to the end.
  • Modifiers
    • template<typename Args...>
    • try_emplace(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given Args.
        • False: Key already found in map, nothing occured.
      • Try to emplace key/value into the map.
      • If key is already present, nothing occurs
    • template<typename Args...>
    • emplace_or_assign(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given key and Args.
        • False: Key already found in map, new value assigned.
      • Emplace key/value into the map.
    • erase(key_type)
      • return : bool
        • True: Key found, value_type erased
        • False: Key not found, nothing occured
      • Erase key/value with given key.
  • Lookup
    • find(key_type)
      • return : std::optional<iterator>
        • Optional contains iterator if key was successfully found.
        • Iterator to key/value pair.
      • find key/value pair with given key
    • contains(key_type)
      • return : bool
        • True: Map conatins key.
        • False: Map does not contain key.
      • Check if map conatins key/value pair with given key.
    • clear()
      • return : void
      • Clear and reset the map.
      • Does not change max_size() of map.
  • Capcaity
    • size()
      • return : std::size_t
      • Returns the size of the map (aka number of inserted pairs).
    • max_size()
      • return : std::size_t
      • Returns the maximum capacity of map before needing to grow/rehash.
    • empty()
      • return : bool
      • Checks if the map is empty or not.
  • Hash Policy
    • load_factor()
      • return : float
      • Returns the load factor of the current map.
      • load_factor() == size()/max_size()
  • Observers
    • key_eq()
      • return : const KeyEqual&
    • hash_functions()
      • return : const Hash&

Major Differences between simd_hash_map and std::unordered_map

  • To optimize value semantics and reduce unnecessary moves and copies, the two "inserting" functions take a key and forwarded value arguments separately. If value_type is emplaced, it is constructed as value_type {std::piecewise_construct, std::forward_as_tuple(key_type), std::forward_as_tuple(std::forward<Args>(args)...)};. If just the mapped_type is inserted due to the key already existing, the following occurs: old_mapped_value = std::move(mapped_type{std::forward<Args>(args)...});.
  • Due to the nature of how this hash table deals with collisions, the user cannot determine the load factor as when the hash table will grow in size.
  • find(key_type) returns an std::optional<iterator>. This is because I try to practice declarative programming, and returning an std::optional is IMO more delcarative than just an iterator which could point to the end of the map.
  • As of 26 April 2019, this container does not take custom allocators, however, this feature will be implemented in the future.

Tests

To run tests, compile as follow inside the tests/ directory

gcc tests-main.cpp "test file"

About

A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX)

Resources

Stars

12 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); })(); GitHub - NathanSWard/simd_hash_map: A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX) · GitHub
Skip to content

Latest commit

History

49 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

simd_hash_map

REQUIREMENTS TO BUILD:

API as of 26 April 2019

  • Template Parameters
    • class Key
    • class T
    • class Hash = std::hash<Key>
    • class KeyEqual = std::equal_to<Key>
  • Member Types
    • key_type : Key
    • mapped_type : T
    • value_type : std::pair<const Key, T>
    • size_type : std::size_t
    • difference_type : std::ptrdiff_t
    • hasher : Hash
    • key_equal : KeyEqual
    • reference : value_type&
    • const_reference : const value_type&
    • pointer : value_type*
    • const_pointer : const value_type*
    • iterator : LegacyForwardIterator
    • const_iterator : Constant LegacyForwardIterator
  • Member Functions
    • (constructor)
    • (destructor)
  • Iterators
    • begin() and cbegin()
      • Returns an iterator to the beginning.
    • end() and cend()
      • Returns an iterator to the end.
  • Modifiers
    • template<typename Args...>
    • try_emplace(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given Args.
        • False: Key already found in map, nothing occured.
      • Try to emplace key/value into the map.
      • If key is already present, nothing occurs
    • template<typename Args...>
    • emplace_or_assign(key_type, Args &&...)
      • return : std::pair<iterator, bool>
        • Iterator to key/value pair.
        • True: Emplaced with given key and Args.
        • False: Key already found in map, new value assigned.
      • Emplace key/value into the map.
    • erase(key_type)
      • return : bool
        • True: Key found, value_type erased
        • False: Key not found, nothing occured
      • Erase key/value with given key.
  • Lookup
    • find(key_type)
      • return : std::optional<iterator>
        • Optional contains iterator if key was successfully found.
        • Iterator to key/value pair.
      • find key/value pair with given key
    • contains(key_type)
      • return : bool
        • True: Map conatins key.
        • False: Map does not contain key.
      • Check if map conatins key/value pair with given key.
    • clear()
      • return : void
      • Clear and reset the map.
      • Does not change max_size() of map.
  • Capcaity
    • size()
      • return : std::size_t
      • Returns the size of the map (aka number of inserted pairs).
    • max_size()
      • return : std::size_t
      • Returns the maximum capacity of map before needing to grow/rehash.
    • empty()
      • return : bool
      • Checks if the map is empty or not.
  • Hash Policy
    • load_factor()
      • return : float
      • Returns the load factor of the current map.
      • load_factor() == size()/max_size()
  • Observers
    • key_eq()
      • return : const KeyEqual&
    • hash_functions()
      • return : const Hash&

Major Differences between simd_hash_map and std::unordered_map

  • To optimize value semantics and reduce unnecessary moves and copies, the two "inserting" functions take a key and forwarded value arguments separately. If value_type is emplaced, it is constructed as value_type {std::piecewise_construct, std::forward_as_tuple(key_type), std::forward_as_tuple(std::forward<Args>(args)...)};. If just the mapped_type is inserted due to the key already existing, the following occurs: old_mapped_value = std::move(mapped_type{std::forward<Args>(args)...});.
  • Due to the nature of how this hash table deals with collisions, the user cannot determine the load factor as when the hash table will grow in size.
  • find(key_type) returns an std::optional<iterator>. This is because I try to practice declarative programming, and returning an std::optional is IMO more delcarative than just an iterator which could point to the end of the map.
  • As of 26 April 2019, this container does not take custom allocators, however, this feature will be implemented in the future.

Tests

To run tests, compile as follow inside the tests/ directory

gcc tests-main.cpp "test file"

About

A c++ hash map/table which utilizes simd (specifically Intel x86 SSE/AVX)

Resources

Stars

12 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages