summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorXavi Artigas <xavierartigas@yahoo.es>2018-04-30 02:06:16 -0700
committerapache <apache@e5-web1.enlightenment.org>2018-04-30 02:06:16 -0700
commit9378a2ecde48ec7765c6b19eac4f921efa02249c (patch)
treef8de89e5987d1cbb76ff84b3fbc7a4560b792120
parentf764caf2d34189c7457f2730a41a61178858c181 (diff)
Wiki page hash-tables.md changed with summary [Typos and links] by Xavi Artigas
-rw-r--r--pages/develop/guides/c/eina/hash-tables.md.txt6
1 files changed, 3 insertions, 3 deletions
diff --git a/pages/develop/guides/c/eina/hash-tables.md.txt b/pages/develop/guides/c/eina/hash-tables.md.txt
index 256881b85..a90dedad5 100644
--- a/pages/develop/guides/c/eina/hash-tables.md.txt
+++ b/pages/develop/guides/c/eina/hash-tables.md.txt
@@ -19,16 +19,16 @@ To create the hash table, use the ``eina_hash_new()`` function:
19* The fourth parameter is the function called on each value when the hash table is freed, or when an item is deleted from it. ``NULL`` can be passed as the callback. 19* The fourth parameter is the function called on each value when the hash table is freed, or when an item is deleted from it. ``NULL`` can be passed as the callback.
20* The last parameter is the size of the buckets. 20* The last parameter is the size of the buckets.
21 21
22When you create an ``Eina_Hash`` instance, you have to create four potentially long callback functions. ``Eina_Hash`` has some predefined functions to make these shorter. These are used to create various types ofof hash tables: 22When you create an ``Eina_Hash`` instance, you have to create four potentially long callback functions. ``Eina_Hash`` has some predefined functions to make these shorter. These are used to create various types of hash tables:
23 23
24* ``eina_hash_string_djb2_new()`` creates a new hash table using the djb2 algorithm for strings. 24* ``eina_hash_string_djb2_new()`` creates a new hash table using the [djb2](https://en.wikipedia.org/wiki/List_of_hash_functions#Non-cryptographic_hash_functions) algorithm for strings.
25* ``eina_hash_string_superfast_new()`` creates a new hash table for use with strings. This is best for long strings. 25* ``eina_hash_string_superfast_new()`` creates a new hash table for use with strings. This is best for long strings.
26* ``eina_hash_string_small_new()`` creates a new hash table for use with strings with a small bucket size. 26* ``eina_hash_string_small_new()`` creates a new hash table for use with strings with a small bucket size.
27* ``eina_hash_int32_new()`` and ``eina_hash_int64_new()`` create a new hash table for use with 32-bit and 64-bit integers. 27* ``eina_hash_int32_new()`` and ``eina_hash_int64_new()`` create a new hash table for use with 32-bit and 64-bit integers.
28* ``eina_hash_pointer_new()`` creates a new hash table for use with pointers. 28* ``eina_hash_pointer_new()`` creates a new hash table for use with pointers.
29* ``eina_hash_stringshared_new()`` creates a new hash table for use with shared strings. 29* ``eina_hash_stringshared_new()`` creates a new hash table for use with shared strings.
30 30
31All these predefined functions require only one parameter : the function to free the data you've stored in the hash table. 31All these predefined functions require only one parameter: the function to free the data you've stored in the hash table.
32 32
33The following example shows how to manage a small phone book using the ``eina_hash_string_superfast_new()`` function to create a hash table. 33The following example shows how to manage a small phone book using the ``eina_hash_string_superfast_new()`` function to create a hash table.
34 34