Rivoreo Source Code Repositories
src.rivoreo.one / net / facil.io / 0.7.0.beta7 / . / docs / 0.6.x / fiobj_hash.html
blob: 63628bf5e8b0c10095f9ac46bd0b9231bd1c3bdc [file] [log] [blame] [raw]
<!DOCTYPE html><html><head><meta charset="utf-8" /><meta content="IE=edge" http-equiv="X-UA-Compatible" /><meta content="width=device-width, initial-scale=1, maximum-scale=2.0, user-scalable=yes, minimal-ui=yes" name="viewport" /><title>facil.io - FIOBJ Hash Map API</title><meta content="facil.io - FIOBJ Hash Map API" name="description" /><link href="https://fonts.googleapis.com/css?family=Montserrat|Quicksand|Karla" rel="stylesheet" type="text/css" /><script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.4/jquery.min.js"></script><link href="/assets/styles/main.css" rel="stylesheet" type="text/css" /><script type="application/ld+json">{"@context":"http://schema.org","@type":"WebSite","url":"http://facil.io","name":"facil.io","description":"facil.io - a light web application framework in C, with support for HTTP, WebSockets and Pub/Sub out of the box.","keywords":"C, web, framework, websockets, websocket, realtime, real-time, easy","image":"http://facil.io/website/logo/facil-io.svg","author":[{"@type":"Person","name":"Bo (Myst)","url":"http://stackoverflow.com/users/4025095/myst","email":"bo(at)facil.io"}],"sourceOrganization":{"@context":"http://schema.org","@type":"Organization","name":"Plezi","url":"http://facil.io","description":"facil.io - a light web application framework in C, with support for HTTP, WebSockets and Pub/Sub out of the box.","logo":"http://facil.io/website/logo/facil-io.svg","image":"http://facil.io/website/logo/facil-io.svg","email":"bo(at)facil.io","member":[{"@type":"Person","name":"Bo (Myst)","url":"http://stackoverflow.com/users/4025095/myst","email":"bo(at)facil.io"}]}}</script><meta content="facil.io" name="apple-mobile-web-app-title" /><meta content="facil.io - the C Web Application Framework" name="application-name" /><meta content="#b91d47" name="msapplication-TileColor" /><meta content="/mstile-144x144.png" name="msapplication-TileImage" /><meta content="#ffffff" name="theme-color" /></head><body><a href="/" id="logo"></a><input id="show_nav" type="checkbox" /><nav id="top_nav"><ul><li><a href="/0.7.x/index">Latest Docs</a></li><li><a href="https://github.com/boazsegev/facil.io" target="_blank">Source Code</a></li><li><a href="javascript: change_themes();" id="theme">Night Theme</a></li></ul></nav><input id="show_sidebar" type="checkbox" /><nav id="side_bar"><h2 id="version-0-6-x"><a href="/0.6.x/index">Version 0.6.x</a></h2>
<ul>
<li><a href="/0.6.x/api">API Overview</a></li>
<li><a href="/0.6.x/modules">The Modules</a></li>
</ul>
<h3 id="core-api"><a href="/0.6.x/facil">Core API</a></h3>
<ul>
<li><a href="/0.6.x/defer">Event scheduling</a></li>
<li><a href="/0.6.x/evio">Low Level Polling</a></li>
<li><a href="/0.6.x/sock">Low Level Sockets</a></li>
<li><a href="/0.6.x/fio_mem">Memory Allocation</a></li>
</ul>
<h3 id="extensions">Extensions</h3>
<ul>
<li><a href="/0.6.x/http">HTTP</a></li>
<li><a href="/0.6.x/websockets">WebSockets</a></li>
<li><a href="/0.6.x/pubsub">Pub/Sub</a></li>
<li><a href="/0.6.x/fio_cli">CLI (command line)</a></li>
</ul>
<h3 id="the-fiobj-types"><a href="/0.6.x/fiobj">The FIOBJ types</a></h3>
<ul>
<li><a href="/0.6.x/fiobj_primitives">Primitives</a></li>
<li><a href="/0.6.x/fiobj_numbers">Numbers</a></li>
<li><a href="/0.6.x/fiobj_str">Strings</a></li>
<li><a href="/0.6.x/fiobj_ary">Array</a></li>
<li><a href="/0.6.x/fiobj_hash">HashMap</a></li>
<li><a href="/0.6.x/fiobj_json">JSON</a></li>
</ul>
<h3 id="core-types"><a href="/0.6.x/types">Core Types</a></h3>
<ul>
<li><a href="/0.6.x/fio_ary">C Arrays</a></li>
<li><a href="/0.6.x/fio_hashmap">C HashMap</a></li>
<li><a href="/0.6.x/fio_llist">Linked Lists</a></li>
</ul>
</nav><div id="md_container"><div class='toc'><ul>
<li>
<a href="#facil-io-fiobj-hash-map-api">facil.io - FIOBJ Hash Map API</a>
<ul>
<li>
<ul>
<li>
<a href="#hash-creation">Hash Creation</a>
<ul>
<li>
<a href="#fiobj_hash_new"><code>fiobj_hash_new</code></a>
</li>
<li>
<a href="#fiobj_hash_new2"><code>fiobj_hash_new2</code></a>
</li>
</ul>
</li>
<li>
<a href="#hash-properties-and-state">Hash properties and state</a>
<ul>
<li>
<a href="#fiobj_hash_capa"><code>fiobj_hash_capa</code></a>
</li>
<li>
<a href="#fiobj_hash_count"><code>fiobj_hash_count</code></a>
</li>
</ul>
</li>
<li>
<a href="#populating-and-managing-the-hash">Populating and Managing the Hash</a>
<ul>
<li>
<a href="#fiobj_hash_set"><code>fiobj_hash_set</code></a>
</li>
<li>
<a href="#fiobj_hash_pop"><code>fiobj_hash_pop</code></a>
</li>
<li>
<a href="#fiobj_hash_replace"><code>fiobj_hash_replace</code></a>
</li>
<li>
<a href="#fiobj_hash_remove"><code>fiobj_hash_remove</code></a>
</li>
<li>
<a href="#fiobj_hash_remove2"><code>fiobj_hash_remove2</code></a>
</li>
<li>
<a href="#fiobj_hash_delete"><code>fiobj_hash_delete</code></a>
</li>
<li>
<a href="#fiobj_hash_delete2"><code>fiobj_hash_delete2</code></a>
</li>
<li>
<a href="#fiobj_hash_get"><code>fiobj_hash_get</code></a>
</li>
<li>
<a href="#fiobj_hash_get2"><code>fiobj_hash_get2</code></a>
</li>
<li>
<a href="#fiobj_hash_haskey"><code>fiobj_hash_haskey</code></a>
</li>
<li>
<a href="#fiobj_hash_clear"><code>fiobj_hash_clear</code></a>
</li>
</ul>
</li>
<li>
<a href="#rehashing">Rehashing</a>
<ul>
<li>
<a href="#fiobj_hash_rehash"><code>fiobj_hash_rehash</code></a>
</li>
</ul>
</li>
</ul>
</li>
</ul>
</li>
</ul>
</div><h1 id="facil-io-fiobj-hash-map-api">facil.io - FIOBJ Hash Map API</h1>
<h3 id="hash-creation">Hash Creation</h3>
<h4 id="fiobj_hash_new"><code>fiobj_hash_new</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="n">FIOBJ</span> <span class="n">fiobj_hash_new</span><span class="p">(</span><span class="kt">void</span><span class="p">);</span>
</code></pre></div>
<p>Creates a mutable empty Hash object. Use <code>fiobj_free</code> when done.</p>
<p>Notice that these Hash objects are optimized for smaller collections and retain order of object insertion.</p>
<h4 id="fiobj_hash_new2"><code>fiobj_hash_new2</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="n">FIOBJ</span> <span class="n">fiobj_hash_new2</span><span class="p">(</span><span class="kt">size_t</span> <span class="n">capa</span><span class="p">);</span>
</code></pre></div>
<p>Creates a mutable empty Hash object with an initial capacity of <code>capa</code>. Use <code>fiobj_free</code> when done.</p>
<p>This allows optimizations for larger (or smaller) collections.</p>
<h3 id="hash-properties-and-state">Hash properties and state</h3>
<h4 id="fiobj_hash_capa"><code>fiobj_hash_capa</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="kt">size_t</span> <span class="n">fiobj_hash_capa</span><span class="p">(</span><span class="k">const</span> <span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">);</span>
</code></pre></div>
<p>Returns a temporary theoretical Hash map capacity. This could be used for testing performance and memory consumption.</p>
<h4 id="fiobj_hash_count"><code>fiobj_hash_count</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="kt">size_t</span> <span class="n">fiobj_hash_count</span><span class="p">(</span><span class="k">const</span> <span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">);</span>
</code></pre></div>
<p>Returns the number of elements in the Hash.</p>
<h3 id="populating-and-managing-the-hash">Populating and Managing the Hash</h3>
<h4 id="fiobj_hash_set"><code>fiobj_hash_set</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="kt">int</span> <span class="n">fiobj_hash_set</span><span class="p">(</span><span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="n">FIOBJ</span> <span class="n">key</span><span class="p">,</span> <span class="n">FIOBJ</span> <span class="n">obj</span><span class="p">);</span>
</code></pre></div>
<p>Sets a key-value pair in the Hash, duplicating the Symbol and <strong>moving</strong> the ownership of the object to the Hash.</p>
<p>Returns -1 on error.</p>
<h4 id="fiobj_hash_pop"><code>fiobj_hash_pop</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="n">FIOBJ</span> <span class="n">fiobj_hash_pop</span><span class="p">(</span><span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="n">FIOBJ</span> <span class="o">*</span><span class="n">key</span><span class="p">);</span>
</code></pre></div>
<p>Allows the Hash to be used as a stack.</p>
<p>If a pointer <code>key</code> is provided, it will receive ownership of the key (remember to free).</p>
<p>Returns FIOBJ_INVALID on error.</p>
<p>Returns and object if successful (remember to free).</p>
<h4 id="fiobj_hash_replace"><code>fiobj_hash_replace</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="n">FIOBJ</span> <span class="n">fiobj_hash_replace</span><span class="p">(</span><span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="n">FIOBJ</span> <span class="n">key</span><span class="p">,</span> <span class="n">FIOBJ</span> <span class="n">obj</span><span class="p">);</span>
</code></pre></div>
<p>Replaces the value in a key-value pair, returning the old value (and it&#39;s ownership) to the caller.</p>
<p>A return value of FIOBJ_INVALID indicates that no previous object existed (but a new key-value pair was created.</p>
<p>Errors are silently ignored.</p>
<p>Remember to free the returned object.</p>
<h4 id="fiobj_hash_remove"><code>fiobj_hash_remove</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="n">FIOBJ</span> <span class="n">fiobj_hash_remove</span><span class="p">(</span><span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="n">FIOBJ</span> <span class="n">key</span><span class="p">);</span>
</code></pre></div>
<p>Removes a key-value pair from the Hash, if it exists, returning the old object (instead of freeing it).</p>
<h4 id="fiobj_hash_remove2"><code>fiobj_hash_remove2</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="n">FIOBJ</span> <span class="n">fiobj_hash_remove2</span><span class="p">(</span><span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="kt">uint64_t</span> <span class="n">key_hash</span><span class="p">);</span>
</code></pre></div>
<p>Removes a key-value pair from the Hash, if it exists, returning the old object (instead of freeing it).</p>
<h4 id="fiobj_hash_delete"><code>fiobj_hash_delete</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="kt">int</span> <span class="n">fiobj_hash_delete</span><span class="p">(</span><span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="n">FIOBJ</span> <span class="n">key</span><span class="p">);</span>
</code></pre></div>
<p>Deletes a key-value pair from the Hash, if it exists, freeing the associated object.</p>
<p>Returns -1 on type error or if the object never existed.</p>
<h4 id="fiobj_hash_delete2"><code>fiobj_hash_delete2</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="kt">int</span> <span class="n">fiobj_hash_delete2</span><span class="p">(</span><span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="kt">uint64_t</span> <span class="n">key_hash</span><span class="p">);</span>
</code></pre></div>
<p>Deletes a key-value pair from the Hash, if it exists, freeing the associated object.</p>
<p>This function takes a <code>uint64_t</code> Hash value (see <code>fio_siphash</code>) to perform a lookup in the HashMap, which is slightly faster than the other variations.</p>
<p>Returns -1 on type error or if the object never existed.</p>
<h4 id="fiobj_hash_get"><code>fiobj_hash_get</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="n">FIOBJ</span> <span class="n">fiobj_hash_get</span><span class="p">(</span><span class="k">const</span> <span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="n">FIOBJ</span> <span class="n">key</span><span class="p">);</span>
</code></pre></div>
<p>Returns a temporary handle to the object associated with the Symbol, FIOBJ_INVALID if none.</p>
<h4 id="fiobj_hash_get2"><code>fiobj_hash_get2</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="n">FIOBJ</span> <span class="n">fiobj_hash_get2</span><span class="p">(</span><span class="k">const</span> <span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="kt">uint64_t</span> <span class="n">key_hash</span><span class="p">);</span>
</code></pre></div>
<p>Returns a temporary handle to the object associated hashed key value.</p>
<p>This function takes a <code>uint64_t</code> Hash value (see <code>fio_siphash</code>) to
perform a lookup in the HashMap, which is slightly faster than the other
variations.</p>
<p>Returns FIOBJ_INVALID if no object is associated with this hashed key value.</p>
<h4 id="fiobj_hash_haskey"><code>fiobj_hash_haskey</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="kt">int</span> <span class="n">fiobj_hash_haskey</span><span class="p">(</span><span class="k">const</span> <span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">,</span> <span class="n">FIOBJ</span> <span class="n">key</span><span class="p">);</span>
</code></pre></div>
<p>Returns 1 if the key (Symbol) exists in the Hash, even if it&#39;s value is NULL.</p>
<h4 id="fiobj_hash_clear"><code>fiobj_hash_clear</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="kt">void</span> <span class="n">fiobj_hash_clear</span><span class="p">(</span><span class="k">const</span> <span class="n">FIOBJ</span> <span class="n">hash</span><span class="p">);</span>
</code></pre></div>
<p>Empties the Hash.</p>
<h3 id="rehashing">Rehashing</h3>
<p>Rehashing is usually performed automatically, as needed, and shouldn&#39;t be performed manually unless there is a known reason to do so.</p>
<h4 id="fiobj_hash_rehash"><code>fiobj_hash_rehash</code></h4>
<div class="highlight"><pre class="highlight c"><code><span class="kt">void</span> <span class="n">fiobj_hash_rehash</span><span class="p">(</span><span class="n">FIOBJ</span> <span class="n">h</span><span class="p">);</span>
</code></pre></div>
<p>Attempts to rehash the Hash Map.</p>
</div><a href="/" id="sign"></a><div class="hidden" id="notice"><a class="notice_close" onclick="hide_notice()">X</a><div id="notice_text"></div></div><script>function change_themes() {
if(localStorage.getItem("theme") == 'dark') {
localStorage.setItem("theme", "light");
} else {
localStorage.setItem("theme", "dark");
}
$('body')[0].className = localStorage.getItem("theme");
set_theme_link();
$('#show_nav').attr('checked', false);
return false;
};
function sidebar_name() { return window.location.pathname.slice(0, window.location.pathname.lastIndexOf("/")); }
function on_sidebar_link(e) {
sessionStorage.setItem("sidebar.expect", sidebar_name());
sessionStorage.setItem("sidebar.pos", document.getElementById("side_bar").scrollTop);
}
function load_sidebar_pos() {
var e = document.getElementById("side_bar");
if(!e) {
console.warn("No sidebar detected");
return;
}
var expect = sidebar_name();
if(sessionStorage.getItem("sidebar.expect") == expect) {
e.scrollTo(0, parseInt(sessionStorage.getItem("sidebar.pos")));
} else {
sessionStorage.setItem("sidebar.expect", false);
sessionStorage.setItem("sidebar.pos", 0);
}
if(e) {
// add link callbacks
var links = document.links;
var count = links.length;
for (var i = 0; i < count; i++) {
var href = links[i].href;
if(href.startsWith(document.location.origin)) {
href = href.slice(document.location.origin.length);
}
if(href.startsWith(expect)) {
/* add link event */
links[i].addEventListener("click", on_sidebar_link);
}
}
}
};
load_sidebar_pos();
function set_theme_link() {
$("#theme").html( ( (localStorage.getItem("theme") == 'dark') ? "Day" : "Night") + " Theme" );
}
$('body')[0].className = (localStorage.getItem("theme") == 'dark') ? "dark" : "light";
set_theme_link();
function show_notice() { document.getElementById("notice").classList.remove('hidden'); };
function hide_notice() { document.getElementById("notice").classList.add('hidden'); };
$('#toc').on("touchstart", function (e) { return true; } );
$('#toc').on("hover", function (e) { return true; } );
// hljs.initHighlighting();
// Google Analytics
// if(location.hostname != "localhost") {
// (function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
// (i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
// m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
// })(window,document,'script','//www.google-analytics.com/analytics.js','ga');
// ga('create', 'UA-69931401-1', 'auto');
// ga('send', 'pageview');
// }</script></body></html>