\hypertarget{group__Eina__Hash__Group}{}\section{Hash Table}
\label{group__Eina__Hash__Group}\index{Hash Table@{Hash Table}}


Hash table management.  


\subsection*{Data Structures}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{struct__Eina__Hash__Tuple}{\+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple}
\begin{DoxyCompactList}\small\item\em Data for a hash table of key/value pairs. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Macros}
\begin{DoxyCompactItemize}
\item 
\#define \hyperlink{group__Eina__Hash__Group_gaaaa18f69c9854f63beae15c42f1256b8}{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H}(Function)~((\hyperlink{group__Eina__Hash__Group_ga290c5e9227e166b006e0373805576fa2}{Eina\+\_\+\+Key\+\_\+\+Length})Function)
\item 
\#define \hyperlink{group__Eina__Hash__Group_ga1c48d74b1ed071d8c156a98f5f0a06f6}{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P}(Function)~((\hyperlink{group__Eina__Hash__Group_gaa6df1403bfe855ea76c3828da89f5bdc}{Eina\+\_\+\+Key\+\_\+\+Cmp})Function)
\item 
\#define \hyperlink{group__Eina__Hash__Group_gaf53593bdd5cc3d238e5eea2ae86d42a0}{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H}(Function)~((\hyperlink{group__Eina__Hash__Group_ga273283c779b3c12b56bd74292dd110cd}{Eina\+\_\+\+Key\+\_\+\+Hash})Function)
\end{DoxyCompactItemize}
\subsection*{Typedefs}
\begin{DoxyCompactItemize}
\item 
\hypertarget{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{}typedef struct \+\_\+\+Eina\+\_\+\+Hash \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash}\label{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}

\begin{DoxyCompactList}\small\item\em Type for a generic hash table. \end{DoxyCompactList}\item 
\hypertarget{group__Eina__Hash__Group_gad6674b938d2e803035a19e2c97683961}{}typedef struct \hyperlink{struct__Eina__Hash__Tuple}{\+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple} \hyperlink{group__Eina__Hash__Group_gad6674b938d2e803035a19e2c97683961}{Eina\+\_\+\+Hash\+\_\+\+Tuple}\label{group__Eina__Hash__Group_gad6674b938d2e803035a19e2c97683961}

\begin{DoxyCompactList}\small\item\em Type for a hash table of key/value pairs. \end{DoxyCompactList}\item 
\hypertarget{group__Eina__Hash__Group_ga290c5e9227e166b006e0373805576fa2}{}typedef unsigned int($\ast$ \hyperlink{group__Eina__Hash__Group_ga290c5e9227e166b006e0373805576fa2}{Eina\+\_\+\+Key\+\_\+\+Length}) (const void $\ast$key)\label{group__Eina__Hash__Group_ga290c5e9227e166b006e0373805576fa2}

\begin{DoxyCompactList}\small\item\em Type for a function to determine the length of a hash key. \end{DoxyCompactList}\item 
\hypertarget{group__Eina__Hash__Group_gaa6df1403bfe855ea76c3828da89f5bdc}{}typedef int($\ast$ \hyperlink{group__Eina__Hash__Group_gaa6df1403bfe855ea76c3828da89f5bdc}{Eina\+\_\+\+Key\+\_\+\+Cmp}) (const void $\ast$key1, int key1\+\_\+length, const void $\ast$key2, int key2\+\_\+length)\label{group__Eina__Hash__Group_gaa6df1403bfe855ea76c3828da89f5bdc}

\begin{DoxyCompactList}\small\item\em Type for a function to compare two hash keys. \end{DoxyCompactList}\item 
\hypertarget{group__Eina__Hash__Group_ga273283c779b3c12b56bd74292dd110cd}{}typedef int($\ast$ \hyperlink{group__Eina__Hash__Group_ga273283c779b3c12b56bd74292dd110cd}{Eina\+\_\+\+Key\+\_\+\+Hash}) (const void $\ast$key, int key\+\_\+length)\label{group__Eina__Hash__Group_ga273283c779b3c12b56bd74292dd110cd}

\begin{DoxyCompactList}\small\item\em Type for a function to create a hash key. \end{DoxyCompactList}\item 
\hypertarget{group__Eina__Hash__Group_ga29e5a6f3ff7e719018d87d8769604e40}{}typedef \hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool}($\ast$ \hyperlink{group__Eina__Hash__Group_ga29e5a6f3ff7e719018d87d8769604e40}{Eina\+\_\+\+Hash\+\_\+\+Foreach}) (const \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, void $\ast$data, void $\ast$fdata)\label{group__Eina__Hash__Group_ga29e5a6f3ff7e719018d87d8769604e40}

\begin{DoxyCompactList}\small\item\em Type for a function to iterate over a hash table. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$ \hyperlink{group__Eina__Hash__Group_ga32c9a8a82e2d20338618baf6af3d1614}{eina\+\_\+hash\+\_\+new} (\hyperlink{group__Eina__Hash__Group_ga290c5e9227e166b006e0373805576fa2}{Eina\+\_\+\+Key\+\_\+\+Length} key\+\_\+length\+\_\+cb, \hyperlink{group__Eina__Hash__Group_gaa6df1403bfe855ea76c3828da89f5bdc}{Eina\+\_\+\+Key\+\_\+\+Cmp} key\+\_\+cmp\+\_\+cb, \hyperlink{group__Eina__Hash__Group_ga273283c779b3c12b56bd74292dd110cd}{Eina\+\_\+\+Key\+\_\+\+Hash} key\+\_\+hash\+\_\+cb, \hyperlink{group__Eina__Types__Group_gadbac560ba2bca5c61d97bfbb542018f3}{Eina\+\_\+\+Free\+\_\+\+Cb} data\+\_\+free\+\_\+cb, int buckets\+\_\+power\+\_\+size)
\begin{DoxyCompactList}\small\item\em Create a new hash table. \end{DoxyCompactList}\item 
void \hyperlink{group__Eina__Hash__Group_ga5b2ef7d6f5d6c4bdbb65c3440832dc2d}{eina\+\_\+hash\+\_\+free\+\_\+cb\+\_\+set} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, \hyperlink{group__Eina__Types__Group_gadbac560ba2bca5c61d97bfbb542018f3}{Eina\+\_\+\+Free\+\_\+\+Cb} data\+\_\+free\+\_\+cb)
\begin{DoxyCompactList}\small\item\em Redefine the callback that clean the data of a hash. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$ \hyperlink{group__Eina__Hash__Group_ga32047bcf971a00298f4564b567444c65}{eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new} (\hyperlink{group__Eina__Types__Group_gadbac560ba2bca5c61d97bfbb542018f3}{Eina\+\_\+\+Free\+\_\+\+Cb} data\+\_\+free\+\_\+cb)
\begin{DoxyCompactList}\small\item\em Create a new hash table using the djb2 algorithm. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$ \hyperlink{group__Eina__Hash__Group_gad7203e20b1496445cb819c7862171c87}{eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new} (\hyperlink{group__Eina__Types__Group_gadbac560ba2bca5c61d97bfbb542018f3}{Eina\+\_\+\+Free\+\_\+\+Cb} data\+\_\+free\+\_\+cb)
\begin{DoxyCompactList}\small\item\em Create a new hash table for use with strings. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$ \hyperlink{group__Eina__Hash__Group_gaad2e43204f79ee5a8f19470ff5ba4ac8}{eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new} (\hyperlink{group__Eina__Types__Group_gadbac560ba2bca5c61d97bfbb542018f3}{Eina\+\_\+\+Free\+\_\+\+Cb} data\+\_\+free\+\_\+cb)
\begin{DoxyCompactList}\small\item\em Create a new hash table for use with strings with small bucket size. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$ \hyperlink{group__Eina__Hash__Group_ga63adbae9fc326c58d8d7e50573936089}{eina\+\_\+hash\+\_\+int32\+\_\+new} (\hyperlink{group__Eina__Types__Group_gadbac560ba2bca5c61d97bfbb542018f3}{Eina\+\_\+\+Free\+\_\+\+Cb} data\+\_\+free\+\_\+cb)
\begin{DoxyCompactList}\small\item\em Create a new hash table for use with 32bit integers. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$ \hyperlink{group__Eina__Hash__Group_ga0be89f46d734f7c51cc0cf1cee55e341}{eina\+\_\+hash\+\_\+int64\+\_\+new} (\hyperlink{group__Eina__Types__Group_gadbac560ba2bca5c61d97bfbb542018f3}{Eina\+\_\+\+Free\+\_\+\+Cb} data\+\_\+free\+\_\+cb)
\begin{DoxyCompactList}\small\item\em Create a new hash table for use with 64bit integers. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$ \hyperlink{group__Eina__Hash__Group_ga0cd41f505034160d99f3b907ad3d74ce}{eina\+\_\+hash\+\_\+pointer\+\_\+new} (\hyperlink{group__Eina__Types__Group_gadbac560ba2bca5c61d97bfbb542018f3}{Eina\+\_\+\+Free\+\_\+\+Cb} data\+\_\+free\+\_\+cb)
\begin{DoxyCompactList}\small\item\em Create a new hash table for use with pointers. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$ \hyperlink{group__Eina__Hash__Group_ga75266e6a40be3a377345b4d883b6e9a7}{eina\+\_\+hash\+\_\+stringshared\+\_\+new} (\hyperlink{group__Eina__Types__Group_gadbac560ba2bca5c61d97bfbb542018f3}{Eina\+\_\+\+Free\+\_\+\+Cb} data\+\_\+free\+\_\+cb)
\begin{DoxyCompactList}\small\item\em Create a new hash table optimized for stringshared values. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_gafe3bb7c1f5616b4e158f60322e133260}{eina\+\_\+hash\+\_\+add} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Add an entry to the given hash table. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_ga50aa7d4303e5efbe8dc7f593b59b9f63}{eina\+\_\+hash\+\_\+direct\+\_\+add} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Add an entry to the given hash table without duplicating the string key. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_gad8a9ac3c61ead249a6927a12e9de871a}{eina\+\_\+hash\+\_\+del} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Remove the entry identified by a key or a data from the given hash table. \end{DoxyCompactList}\item 
void $\ast$ \hyperlink{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{eina\+\_\+hash\+\_\+find} (const \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key)
\begin{DoxyCompactList}\small\item\em Retrieve a specific entry in the given hash table. \end{DoxyCompactList}\item 
void $\ast$ \hyperlink{group__Eina__Hash__Group_gaabf2f2af1d93f969591f2c5b7378c543}{eina\+\_\+hash\+\_\+modify} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Modify the entry pointer at the specified key and return the old entry. \end{DoxyCompactList}\item 
void $\ast$ \hyperlink{group__Eina__Hash__Group_ga53fd5f171289d63c5d8532bb28434cb3}{eina\+\_\+hash\+\_\+set} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Modify the entry pointer at the specified key and return the old entry or add the entry if not found. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_gaa390160f31c235d91947281244e77628}{eina\+\_\+hash\+\_\+move} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$old\+\_\+key, const void $\ast$new\+\_\+key)
\begin{DoxyCompactList}\small\item\em Change the key associated with a data without triggering the free callback. \end{DoxyCompactList}\item 
void \hyperlink{group__Eina__Hash__Group_gadb6acb720ce267cc1cd4f51893539f59}{eina\+\_\+hash\+\_\+free} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash)
\begin{DoxyCompactList}\small\item\em Free the given hash table resources. \end{DoxyCompactList}\item 
void \hyperlink{group__Eina__Hash__Group_gabe2ba51e5dbf6fd5f60628b8e8f00eaa}{eina\+\_\+hash\+\_\+free\+\_\+buckets} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash)
\begin{DoxyCompactList}\small\item\em Free the given hash table buckets resources. \end{DoxyCompactList}\item 
int \hyperlink{group__Eina__Hash__Group_ga9289542f6724083eab306e5bb3ab10b0}{eina\+\_\+hash\+\_\+population} (const \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash)
\begin{DoxyCompactList}\small\item\em Returns the number of entries in the given hash table. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_ga4637f61969ecc13adaca17def6ed1a91}{eina\+\_\+hash\+\_\+add\+\_\+by\+\_\+hash} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, int key\+\_\+length, int key\+\_\+hash, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Add an entry to the given hash table. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_ga1a88c8632539860e1df25d1812f4146f}{eina\+\_\+hash\+\_\+direct\+\_\+add\+\_\+by\+\_\+hash} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, int key\+\_\+length, int key\+\_\+hash, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Add an entry to the given hash table and do not duplicate the string key. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_ga7454f861781493345ff389a2605a9237}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, int key\+\_\+length, int key\+\_\+hash)
\begin{DoxyCompactList}\small\item\em Remove the entry identified by a key and a key hash from the given hash table. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_gacdcde189b35d525773d699793daa9017}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key)
\begin{DoxyCompactList}\small\item\em Remove the entry identified by a key from the given hash table. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_ga66ca7b9af4f40eeefd8aa401e07147c1}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Remove the entry identified by a data from the given hash table. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Types__Group_ga3fe0caf72e93b1bab1ca8ee3ccf3f226}{Eina\+\_\+\+Bool} \hyperlink{group__Eina__Hash__Group_ga4ce2a4a6917d96d5a791633d83e7af4e}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+hash} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, int key\+\_\+length, int key\+\_\+hash, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Remove the entry identified by a key and a key hash or a data from the given hash table. \end{DoxyCompactList}\item 
void $\ast$ \hyperlink{group__Eina__Hash__Group_ga42dee6ba7f023156397ec4ece52e3cf5}{eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash} (const \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, int key\+\_\+length, int key\+\_\+hash)
\begin{DoxyCompactList}\small\item\em Retrieve a specific entry in the given hash table. \end{DoxyCompactList}\item 
void $\ast$ \hyperlink{group__Eina__Hash__Group_ga821f033abb9edea2929df2ecb4880a3a}{eina\+\_\+hash\+\_\+modify\+\_\+by\+\_\+hash} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, int key\+\_\+length, int key\+\_\+hash, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Modify the entry pointer at the specified key and returns the old entry. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Iterator__Group_ga15b975bb881d955249ce13d4ebc96948}{Eina\+\_\+\+Iterator} $\ast$ \hyperlink{group__Eina__Hash__Group_ga1a090384b1c057daec8e19c6a1ea2c0d}{eina\+\_\+hash\+\_\+iterator\+\_\+key\+\_\+new} (const \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash)
\begin{DoxyCompactList}\small\item\em Returned a new iterator associated to hash keys. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Iterator__Group_ga15b975bb881d955249ce13d4ebc96948}{Eina\+\_\+\+Iterator} $\ast$ \hyperlink{group__Eina__Hash__Group_ga5191350d6044d93b6518a957f12f5ac3}{eina\+\_\+hash\+\_\+iterator\+\_\+data\+\_\+new} (const \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash)
\begin{DoxyCompactList}\small\item\em Returned a new iterator associated to hash data. \end{DoxyCompactList}\item 
\hyperlink{group__Eina__Iterator__Group_ga15b975bb881d955249ce13d4ebc96948}{Eina\+\_\+\+Iterator} $\ast$ \hyperlink{group__Eina__Hash__Group_gaf0e7e38ec02c4bcfca3c3c4dd13c6af9}{eina\+\_\+hash\+\_\+iterator\+\_\+tuple\+\_\+new} (const \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash)
\begin{DoxyCompactList}\small\item\em Returned a new iterator associated to hash keys and data. \end{DoxyCompactList}\item 
void \hyperlink{group__Eina__Hash__Group_ga2c23f8425d3afcc61827ab67b46d7190}{eina\+\_\+hash\+\_\+foreach} (const \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, \hyperlink{group__Eina__Hash__Group_ga29e5a6f3ff7e719018d87d8769604e40}{Eina\+\_\+\+Hash\+\_\+\+Foreach} func, const void $\ast$fdata)
\begin{DoxyCompactList}\small\item\em Call a function on every member stored in the hash table. \end{DoxyCompactList}\item 
void \hyperlink{group__Eina__Hash__Group_ga7a119b7c8261a4d1026f3b7fcad13eca}{eina\+\_\+hash\+\_\+list\+\_\+append} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Append data to an \hyperlink{group__Eina__List__Group_ga3295e1210efea1fb0fd6acbf3cbc1f29}{Eina\+\_\+\+List} inside a hash. \end{DoxyCompactList}\item 
void \hyperlink{group__Eina__Hash__Group_ga7381144c09108de9fa9a8e67c281d289}{eina\+\_\+hash\+\_\+list\+\_\+prepend} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Prepend data to an \hyperlink{group__Eina__List__Group_ga3295e1210efea1fb0fd6acbf3cbc1f29}{Eina\+\_\+\+List} inside a hash. \end{DoxyCompactList}\item 
void \hyperlink{group__Eina__Hash__Group_gabb0157184bfef0302709e2d351446e7f}{eina\+\_\+hash\+\_\+list\+\_\+remove} (\hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} $\ast$hash, const void $\ast$key, const void $\ast$data)
\begin{DoxyCompactList}\small\item\em Remove data from an \hyperlink{group__Eina__List__Group_ga3295e1210efea1fb0fd6acbf3cbc1f29}{Eina\+\_\+\+List} inside a hash. \end{DoxyCompactList}\item 
int \hyperlink{group__Eina__Hash__Group_ga3a8434dd0fe7446af605c75e05e8eff0}{eina\+\_\+hash\+\_\+superfast} (const char $\ast$key, int len)
\begin{DoxyCompactList}\small\item\em Paul Hsieh (\href{http://www.azillionmonkeys.com/qed/hash.html}{\tt http\+://www.\+azillionmonkeys.\+com/qed/hash.\+html}) hash function used by Web\+Core (\href{http://webkit.org/blog/8/hashtables-part-2/}{\tt http\+://webkit.\+org/blog/8/hashtables-\/part-\/2/}) \end{DoxyCompactList}\item 
static int \hyperlink{group__Eina__Hash__Group_ga558f01dbe075fb0a6c45001e57419c63}{eina\+\_\+hash\+\_\+djb2} (const char $\ast$key, int len)
\begin{DoxyCompactList}\small\item\em Hash function first reported by Dan Bernstein many years ago in comp.\+lang.\+c. \end{DoxyCompactList}\item 
static int \hyperlink{group__Eina__Hash__Group_gaa0995ca588bd9508f53f722aaa6ee9b3}{eina\+\_\+hash\+\_\+djb2\+\_\+len} (const char $\ast$key, int $\ast$plen)
\begin{DoxyCompactList}\small\item\em Hash function first reported by Dan Bernstein many years ago in comp.\+lang.\+c. \end{DoxyCompactList}\item 
static int \hyperlink{group__Eina__Hash__Group_gaeceefc13a4baf86ceac4f963f221fa8b}{eina\+\_\+hash\+\_\+int32} (const unsigned int $\ast$pkey, int len)
\begin{DoxyCompactList}\small\item\em Hash function from \href{http://www.concentric.net/~Ttwang/tech/inthash.htm}{\tt http\+://www.\+concentric.\+net/$\sim$\+Ttwang/tech/inthash.\+htm}. \end{DoxyCompactList}\item 
static int \hyperlink{group__Eina__Hash__Group_ga59af62e37bbdab2cf63f49295fd57213}{eina\+\_\+hash\+\_\+int64} (const unsigned long long int $\ast$pkey, int len)
\begin{DoxyCompactList}\small\item\em Hash function from \href{http://www.concentric.net/~Ttwang/tech/inthash.htm}{\tt http\+://www.\+concentric.\+net/$\sim$\+Ttwang/tech/inthash.\+htm}. \end{DoxyCompactList}\item 
static int \hyperlink{group__Eina__Hash__Group_ga66870993e96429900f8ceeadd6f2cadf}{eina\+\_\+hash\+\_\+murmur3} (const char $\ast$key, int len)
\begin{DoxyCompactList}\small\item\em Hash function from \href{http://sites.google.com/site/murmurhash/}{\tt http\+://sites.\+google.\+com/site/murmurhash/}. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
Hash table management. 

Useful for mapping keys to values.

The hash table is useful for when one wants to implement a table that maps keys (usually strings) to data, and have relatively fast access time. The performance is proportional to the load factor of the table (number of elements / number of buckets). See \hyperlink{group__Eina__Hash__Group_hashtable_algo}{Algorithm} for implementation details.

Different implementations exists depending on what kind of key will be used to access the data\+: strings, integers, pointers, stringshared or your own.

Eina hash tables can copy the keys when using \hyperlink{group__Eina__Hash__Group_gafe3bb7c1f5616b4e158f60322e133260}{eina\+\_\+hash\+\_\+add()} or not when using \hyperlink{group__Eina__Hash__Group_ga50aa7d4303e5efbe8dc7f593b59b9f63}{eina\+\_\+hash\+\_\+direct\+\_\+add()}.\hypertarget{group__Eina__Hash__Group_hashtable_algo}{}\subsection{Algorithm}\label{group__Eina__Hash__Group_hashtable_algo}
The Eina\+\_\+\+Hash is implemented using an array of N \char`\"{}buckets\char`\"{}, where each bucket is a pointer to a structure that is the head of a \href{http://en.wikipedia.org/wiki/Red-black_tree}{\tt red-\/black tree}. The array can then be indexed by the \mbox{[}hash\+\_\+of\+\_\+element mod N\mbox{]}. The hash\+\_\+of\+\_\+element is calculated using the hashing function, passed as parameter to the \hyperlink{group__Eina__Hash__Group_ga32c9a8a82e2d20338618baf6af3d1614}{eina\+\_\+hash\+\_\+new} function. N is the number of buckets (array positions), and is calculated based on the buckets\+\_\+power\+\_\+size (argument of \hyperlink{group__Eina__Hash__Group_ga32c9a8a82e2d20338618baf6af3d1614}{eina\+\_\+hash\+\_\+new} too). The following picture illustrates the basic idea\+:

 
\begin{DoxyImageNoCaption}
  \mbox{\includegraphics[width=\textwidth,height=\textheight/2,keepaspectratio=true]{01_hash-table}}
\end{DoxyImageNoCaption}


Adding an element to the hash table is made of\+: \begin{DoxyItemize}
\item calculating the hash for that key (using the specified hash function); \item calculate the array position \mbox{[}hash mod N\mbox{]}; \item add the element to the rbtree on that position.\end{DoxyItemize}
The two first steps have constant time, proportional to the hash function being used. Adding the key to the rbtree will be proportional on the number of keys on that bucket.

The average cost of lookup depends on the number of keys per bucket (load factor) of the table, if the distribution of keys is sufficiently uniform.\hypertarget{group__Eina__Hash__Group_hashtable_perf}{}\subsection{Performance}\label{group__Eina__Hash__Group_hashtable_perf}
As said before, the performance depends on the load factor. So trying to keep the load factor as small as possible will improve the hash table performance. But increasing the buckets\+\_\+power\+\_\+size will also increase the memory consumption. The default hash table creation functions already have a good number of buckets, enough for most cases. Particularly for strings, if just a few keys (less than 30) will be added to the hash table, \hyperlink{group__Eina__Hash__Group_gaad2e43204f79ee5a8f19470ff5ba4ac8}{eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new} should be used, since it will reduce the memory consumption for the buckets, and you still won\textquotesingle{}t have many collisions. However, \hyperlink{group__Eina__Hash__Group_gaad2e43204f79ee5a8f19470ff5ba4ac8}{eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new} still uses the same hash calculation function that \hyperlink{group__Eina__Hash__Group_gad7203e20b1496445cb819c7862171c87}{eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new}, which is more complex than \hyperlink{group__Eina__Hash__Group_ga32047bcf971a00298f4564b567444c65}{eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new}. The latter has a faster hash computation function, but that will imply on a not so good distribution. But if just a few keys are being added, this is not a problem, it will still have not many collisions and be faster to calculate the hash than in a hash created with \hyperlink{group__Eina__Hash__Group_gaad2e43204f79ee5a8f19470ff5ba4ac8}{eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new} and \hyperlink{group__Eina__Hash__Group_gad7203e20b1496445cb819c7862171c87}{eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new}.

A simple comparison between them would be\+:

\begin{DoxyItemize}
\item {\ttfamily djb2} -\/ faster hash function -\/ 256 buckets (higher memory consumption) \item {\ttfamily string\+\_\+small} -\/ slower hash function but less collisions -\/ 32 buckets (lower memory consumption) \item {\ttfamily string\+\_\+superfast} -\/ slower hash function but less collisions -\/ 256 buckets (higher memory consumption) -\/ not randomized, avoid it on public remote interface.\end{DoxyItemize}
Basically for a very small number of keys (10 or less), {\ttfamily djb2} should be used, or {\ttfamily string\+\_\+small} if you have a restriction on memory usage. And for a higher number of keys, {\ttfamily string\+\_\+superfast} should be preferred if not used on a public remote interface.

If just stringshared keys are being added, use \hyperlink{group__Eina__Hash__Group_ga75266e6a40be3a377345b4d883b6e9a7}{eina\+\_\+hash\+\_\+stringshared\+\_\+new}. If a lot of keys will be added to the hash table (e.\+g. more than 1000), then it\textquotesingle{}s better to increase the buckets\+\_\+power\+\_\+size. See \hyperlink{group__Eina__Hash__Group_ga32c9a8a82e2d20338618baf6af3d1614}{eina\+\_\+hash\+\_\+new} for more details.

When adding a new key to a hash table, use \hyperlink{group__Eina__Hash__Group_gafe3bb7c1f5616b4e158f60322e133260}{eina\+\_\+hash\+\_\+add} or \hyperlink{group__Eina__Hash__Group_ga50aa7d4303e5efbe8dc7f593b59b9f63}{eina\+\_\+hash\+\_\+direct\+\_\+add} (the latter if this key is already stored elsewhere). If the key may be already inside the hash table, instead of checking with \hyperlink{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{eina\+\_\+hash\+\_\+find} and then doing \hyperlink{group__Eina__Hash__Group_gafe3bb7c1f5616b4e158f60322e133260}{eina\+\_\+hash\+\_\+add}, one can use just \hyperlink{group__Eina__Hash__Group_ga53fd5f171289d63c5d8532bb28434cb3}{eina\+\_\+hash\+\_\+set} (this will change the data pointed by this key if it was already present in the table).\hypertarget{group__Eina__Hash__Group_hashtable_tutorial}{}\subsection{Tutorial}\label{group__Eina__Hash__Group_hashtable_tutorial}
These examples show many Eina\+\_\+\+Hash functions in action\+: 
\begin{DoxyItemize}
\item \hyperlink{hash_01_example_page}{Eina\+\_\+\+Hash in action} 
\item \hyperlink{hash_02_example_page}{Different types of tables} 
\item Different types of hash in use\+: 
\begin{DoxyItemize}
\item \hyperlink{eina_hash_03_8c-example}{string small} 
\item \hyperlink{eina_hash_04_8c-example}{string djb2} 
\item \hyperlink{eina_hash_05_8c-example}{int32} 
\item \hyperlink{eina_hash_06_8c-example}{int64} 
\item \hyperlink{eina_hash_07_8c-example}{pointer} 
\end{DoxyItemize}
\item \hyperlink{eina_hash_08_8c-example}{Different add and delete functions} 
\end{DoxyItemize}

\subsection{Macro Definition Documentation}
\hypertarget{group__Eina__Hash__Group_gaaaa18f69c9854f63beae15c42f1256b8}{}\index{Hash Table@{Hash Table}!E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H@{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H}}
\index{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H@{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H}!Hash Table@{Hash Table}}
\subsubsection[{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H}]{\setlength{\rightskip}{0pt plus 5cm}\#define E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H(
\begin{DoxyParamCaption}
\item[{}]{Function}
\end{DoxyParamCaption}
)~(({\bf Eina\+\_\+\+Key\+\_\+\+Length})Function)}\label{group__Eina__Hash__Group_gaaaa18f69c9854f63beae15c42f1256b8}

\begin{DoxyParams}{Parameters}
{\em Function} & The function used to calculate length of hash key. \\
\hline
\end{DoxyParams}
\begin{Desc}
\item[Examples\+: ]\par
\hyperlink{eina_hash_02_8c-example}{eina\+\_\+hash\+\_\+02.\+c}.\end{Desc}


Referenced by eina\+\_\+file\+\_\+open(), eina\+\_\+file\+\_\+virtualize(), eina\+\_\+hash\+\_\+int32\+\_\+new(), eina\+\_\+hash\+\_\+int64\+\_\+new(), eina\+\_\+hash\+\_\+pointer\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new(), and eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new().

\hypertarget{group__Eina__Hash__Group_ga1c48d74b1ed071d8c156a98f5f0a06f6}{}\index{Hash Table@{Hash Table}!E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P@{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P}}
\index{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P@{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P}!Hash Table@{Hash Table}}
\subsubsection[{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P}]{\setlength{\rightskip}{0pt plus 5cm}\#define E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P(
\begin{DoxyParamCaption}
\item[{}]{Function}
\end{DoxyParamCaption}
)~(({\bf Eina\+\_\+\+Key\+\_\+\+Cmp})Function)}\label{group__Eina__Hash__Group_ga1c48d74b1ed071d8c156a98f5f0a06f6}

\begin{DoxyParams}{Parameters}
{\em Function} & The function used to compare hash key. \\
\hline
\end{DoxyParams}
\begin{Desc}
\item[Examples\+: ]\par
\hyperlink{eina_hash_02_8c-example}{eina\+\_\+hash\+\_\+02.\+c}.\end{Desc}


Referenced by eina\+\_\+file\+\_\+open(), eina\+\_\+file\+\_\+virtualize(), eina\+\_\+hash\+\_\+int32\+\_\+new(), eina\+\_\+hash\+\_\+int64\+\_\+new(), eina\+\_\+hash\+\_\+pointer\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new(), and eina\+\_\+hash\+\_\+stringshared\+\_\+new().

\hypertarget{group__Eina__Hash__Group_gaf53593bdd5cc3d238e5eea2ae86d42a0}{}\index{Hash Table@{Hash Table}!E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H@{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H}}
\index{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H@{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H}!Hash Table@{Hash Table}}
\subsubsection[{E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H}]{\setlength{\rightskip}{0pt plus 5cm}\#define E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H(
\begin{DoxyParamCaption}
\item[{}]{Function}
\end{DoxyParamCaption}
)~(({\bf Eina\+\_\+\+Key\+\_\+\+Hash})Function)}\label{group__Eina__Hash__Group_gaf53593bdd5cc3d238e5eea2ae86d42a0}

\begin{DoxyParams}{Parameters}
{\em Function} & The function used to hash key. \\
\hline
\end{DoxyParams}
\begin{Desc}
\item[Examples\+: ]\par
\hyperlink{eina_hash_02_8c-example}{eina\+\_\+hash\+\_\+02.\+c}.\end{Desc}


Referenced by eina\+\_\+file\+\_\+open(), eina\+\_\+file\+\_\+virtualize(), eina\+\_\+hash\+\_\+int32\+\_\+new(), eina\+\_\+hash\+\_\+int64\+\_\+new(), eina\+\_\+hash\+\_\+pointer\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new(), and eina\+\_\+hash\+\_\+stringshared\+\_\+new().



\subsection{Function Documentation}
\hypertarget{group__Eina__Hash__Group_ga32c9a8a82e2d20338618baf6af3d1614}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+new@{eina\+\_\+hash\+\_\+new}}
\index{eina\+\_\+hash\+\_\+new@{eina\+\_\+hash\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Hash}$\ast$ eina\+\_\+hash\+\_\+new (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Key\+\_\+\+Length}}]{key\+\_\+length\+\_\+cb, }
\item[{{\bf Eina\+\_\+\+Key\+\_\+\+Cmp}}]{key\+\_\+cmp\+\_\+cb, }
\item[{{\bf Eina\+\_\+\+Key\+\_\+\+Hash}}]{key\+\_\+hash\+\_\+cb, }
\item[{{\bf Eina\+\_\+\+Free\+\_\+\+Cb}}]{data\+\_\+free\+\_\+cb, }
\item[{int}]{buckets\+\_\+power\+\_\+size}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga32c9a8a82e2d20338618baf6af3d1614}


Create a new hash table. 


\begin{DoxyParams}{Parameters}
{\em key\+\_\+length\+\_\+cb} & The function called when getting the size of the key. \\
\hline
{\em key\+\_\+cmp\+\_\+cb} & The function called when comparing the keys. \\
\hline
{\em key\+\_\+hash\+\_\+cb} & The function called when getting the values. \\
\hline
{\em data\+\_\+free\+\_\+cb} & The function called on each value when the hash table is freed, or when an item is deleted from it. {\ttfamily N\+U\+L\+L} can be passed as callback. \\
\hline
{\em buckets\+\_\+power\+\_\+size} & The size of the buckets. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The new hash table.
\end{DoxyReturn}
This function creates a new hash table using user-\/defined callbacks to manage the hash table. On failure, {\ttfamily N\+U\+L\+L} is returned. If {\ttfamily key\+\_\+cmp\+\_\+cb} or {\ttfamily key\+\_\+hash\+\_\+cb} are {\ttfamily N\+U\+L\+L}, {\ttfamily N\+U\+L\+L} is returned. If {\ttfamily buckets\+\_\+power\+\_\+size} is smaller or equal than 2, or if it is greater or equal than 17, {\ttfamily N\+U\+L\+L} is returned.

The number of buckets created will be 2 $^\wedge$ {\ttfamily buckets\+\_\+power\+\_\+size}. This means that if {\ttfamily buckets\+\_\+power\+\_\+size} is 5, there will be created 32 buckets. for a {\ttfamily buckets\+\_\+power\+\_\+size} of 8, there will be 256 buckets.

Pre-\/defined functions are available to create a hash table. See \hyperlink{group__Eina__Hash__Group_ga32047bcf971a00298f4564b567444c65}{eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new()}, \hyperlink{group__Eina__Hash__Group_gad7203e20b1496445cb819c7862171c87}{eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new()}, \hyperlink{group__Eina__Hash__Group_gaad2e43204f79ee5a8f19470ff5ba4ac8}{eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new()}, \hyperlink{group__Eina__Hash__Group_ga63adbae9fc326c58d8d7e50573936089}{eina\+\_\+hash\+\_\+int32\+\_\+new()}, \hyperlink{group__Eina__Hash__Group_ga0be89f46d734f7c51cc0cf1cee55e341}{eina\+\_\+hash\+\_\+int64\+\_\+new()}, \hyperlink{group__Eina__Hash__Group_ga0cd41f505034160d99f3b907ad3d74ce}{eina\+\_\+hash\+\_\+pointer\+\_\+new()} and \hyperlink{group__Eina__Hash__Group_ga75266e6a40be3a377345b4d883b6e9a7}{eina\+\_\+hash\+\_\+stringshared\+\_\+new()}. 

References E\+I\+N\+A\+\_\+\+M\+A\+G\+I\+C\+\_\+\+S\+E\+T.



Referenced by eina\+\_\+cow\+\_\+add(), eina\+\_\+file\+\_\+open(), eina\+\_\+file\+\_\+virtualize(), eina\+\_\+hash\+\_\+int32\+\_\+new(), eina\+\_\+hash\+\_\+int64\+\_\+new(), eina\+\_\+hash\+\_\+pointer\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new(), and eina\+\_\+hash\+\_\+stringshared\+\_\+new().

\hypertarget{group__Eina__Hash__Group_ga5b2ef7d6f5d6c4bdbb65c3440832dc2d}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+free\+\_\+cb\+\_\+set@{eina\+\_\+hash\+\_\+free\+\_\+cb\+\_\+set}}
\index{eina\+\_\+hash\+\_\+free\+\_\+cb\+\_\+set@{eina\+\_\+hash\+\_\+free\+\_\+cb\+\_\+set}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+free\+\_\+cb\+\_\+set}]{\setlength{\rightskip}{0pt plus 5cm}void eina\+\_\+hash\+\_\+free\+\_\+cb\+\_\+set (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{{\bf Eina\+\_\+\+Free\+\_\+\+Cb}}]{data\+\_\+free\+\_\+cb}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga5b2ef7d6f5d6c4bdbb65c3440832dc2d}


Redefine the callback that clean the data of a hash. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table \\
\hline
{\em data\+\_\+free\+\_\+cb} & The function called on each value when the hash table is freed, or when an item is deleted from it. {\ttfamily N\+U\+L\+L} can be passed as callback to remove an existing callback.\\
\hline
\end{DoxyParams}
The argument received by {\ttfamily data\+\_\+free\+\_\+cb} will be that data of the item being removed.

\begin{DoxySince}{Since}
1.\+1 
\end{DoxySince}
\begin{DoxySeeAlso}{See also}
\hyperlink{group__Eina__Hash__Group_ga32c9a8a82e2d20338618baf6af3d1614}{eina\+\_\+hash\+\_\+new}. 
\end{DoxySeeAlso}
\hypertarget{group__Eina__Hash__Group_ga32047bcf971a00298f4564b567444c65}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new@{eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new}}
\index{eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new@{eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Hash}$\ast$ eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Free\+\_\+\+Cb}}]{data\+\_\+free\+\_\+cb}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga32047bcf971a00298f4564b567444c65}


Create a new hash table using the djb2 algorithm. 


\begin{DoxyParams}{Parameters}
{\em data\+\_\+free\+\_\+cb} & The function called on each value when the hash table is freed, or when an item is deleted from it. {\ttfamily N\+U\+L\+L} can be passed as callback. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The new hash table.
\end{DoxyReturn}
This function creates a new hash table using the djb2 algorithm for table management and strcmp() to compare the keys. Values can then be looked up with pointers other than the original key pointer that was used to add values. On failure, this function returns {\ttfamily N\+U\+L\+L}. 

References eina\+\_\+hash\+\_\+djb2(), eina\+\_\+hash\+\_\+new(), E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P, E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H, and E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H.

\hypertarget{group__Eina__Hash__Group_gad7203e20b1496445cb819c7862171c87}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new@{eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new}}
\index{eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new@{eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Hash}$\ast$ eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Free\+\_\+\+Cb}}]{data\+\_\+free\+\_\+cb}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gad7203e20b1496445cb819c7862171c87}


Create a new hash table for use with strings. 


\begin{DoxyParams}{Parameters}
{\em data\+\_\+free\+\_\+cb} & The function called on each value when the hash table is freed, or when an item is deleted from it. {\ttfamily N\+U\+L\+L} can be passed as callback. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The new hash table.
\end{DoxyReturn}
This function creates a new hash table using the superfast algorithm for table management and strcmp() to compare the keys. Values can then be looked up with pointers other than the original key pointer that was used to add values. On failure, this function returns {\ttfamily N\+U\+L\+L}.

N\+O\+T\+E\+: don\textquotesingle{}t use this kind of hash when their is a possibility to remotely request and push data in it. This hash is subject to denial of service. 

References eina\+\_\+hash\+\_\+new(), eina\+\_\+hash\+\_\+superfast(), E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P, E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H, and E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H.



Referenced by ecore\+\_\+con\+\_\+eet\+\_\+client\+\_\+new(), ecore\+\_\+con\+\_\+eet\+\_\+server\+\_\+new(), ecore\+\_\+evas\+\_\+data\+\_\+set(), ecore\+\_\+imf\+\_\+module\+\_\+register(), edje\+\_\+color\+\_\+class\+\_\+set(), edje\+\_\+text\+\_\+class\+\_\+set(), efreet\+\_\+desktop\+\_\+x\+\_\+field\+\_\+set(), efreet\+\_\+menu\+\_\+parse(), efreet\+\_\+mime\+\_\+init(), eldbus\+\_\+proxy\+\_\+event\+\_\+callback\+\_\+add(), and eldbus\+\_\+proxy\+\_\+properties\+\_\+monitor().

\hypertarget{group__Eina__Hash__Group_gaad2e43204f79ee5a8f19470ff5ba4ac8}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new@{eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new}}
\index{eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new@{eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Hash}$\ast$ eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Free\+\_\+\+Cb}}]{data\+\_\+free\+\_\+cb}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gaad2e43204f79ee5a8f19470ff5ba4ac8}


Create a new hash table for use with strings with small bucket size. 


\begin{DoxyParams}{Parameters}
{\em data\+\_\+free\+\_\+cb} & The function called on each value when the hash table is freed, or when an item is deleted from it. {\ttfamily N\+U\+L\+L} can be passed as callback. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The new hash table.
\end{DoxyReturn}
This function creates a new hash table using the superfast algorithm for table management and strcmp() to compare the keys, but with a smaller bucket size (compared to \hyperlink{group__Eina__Hash__Group_gad7203e20b1496445cb819c7862171c87}{eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new()}) which will minimize the memory used by the returned hash table. Values can then be looked up with pointers other than the original key pointer that was used to add values. On failure, this function returns {\ttfamily N\+U\+L\+L}. 

References eina\+\_\+hash\+\_\+new(), eina\+\_\+hash\+\_\+superfast(), E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P, E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H, and E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H.



Referenced by ecore\+\_\+thread\+\_\+global\+\_\+data\+\_\+add(), ecore\+\_\+thread\+\_\+global\+\_\+data\+\_\+set(), ecore\+\_\+thread\+\_\+local\+\_\+data\+\_\+add(), ecore\+\_\+thread\+\_\+local\+\_\+data\+\_\+set(), edje\+\_\+edit\+\_\+data\+\_\+add(), edje\+\_\+edit\+\_\+font\+\_\+add(), edje\+\_\+edit\+\_\+group\+\_\+data\+\_\+add(), eio\+\_\+file\+\_\+associate\+\_\+add(), eio\+\_\+file\+\_\+associate\+\_\+direct\+\_\+add(), eldbus\+\_\+address\+\_\+connection\+\_\+get(), eldbus\+\_\+object\+\_\+get(), and ethumb\+\_\+init().

\hypertarget{group__Eina__Hash__Group_ga63adbae9fc326c58d8d7e50573936089}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+int32\+\_\+new@{eina\+\_\+hash\+\_\+int32\+\_\+new}}
\index{eina\+\_\+hash\+\_\+int32\+\_\+new@{eina\+\_\+hash\+\_\+int32\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+int32\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Hash}$\ast$ eina\+\_\+hash\+\_\+int32\+\_\+new (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Free\+\_\+\+Cb}}]{data\+\_\+free\+\_\+cb}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga63adbae9fc326c58d8d7e50573936089}


Create a new hash table for use with 32bit integers. 


\begin{DoxyParams}{Parameters}
{\em data\+\_\+free\+\_\+cb} & The function called on each value when the hash table is freed, or when an item is deleted from it. {\ttfamily N\+U\+L\+L} can be passed as callback. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The new hash table.
\end{DoxyReturn}
This function creates a new hash table where keys are 32bit integers. When adding or looking up in the hash table, pointers to 32bit integers must be passed. They can be addresses on the stack if you let the eina\+\_\+hash copy the key. Values can then be looked up with pointers other than the original key pointer that was used to add values. This method is not suitable to match string keys as it would only match the first character. On failure, this function returns {\ttfamily N\+U\+L\+L}. 

References eina\+\_\+hash\+\_\+int32(), eina\+\_\+hash\+\_\+new(), E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P, E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H, and E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H.

\hypertarget{group__Eina__Hash__Group_ga0be89f46d734f7c51cc0cf1cee55e341}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+int64\+\_\+new@{eina\+\_\+hash\+\_\+int64\+\_\+new}}
\index{eina\+\_\+hash\+\_\+int64\+\_\+new@{eina\+\_\+hash\+\_\+int64\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+int64\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Hash}$\ast$ eina\+\_\+hash\+\_\+int64\+\_\+new (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Free\+\_\+\+Cb}}]{data\+\_\+free\+\_\+cb}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga0be89f46d734f7c51cc0cf1cee55e341}


Create a new hash table for use with 64bit integers. 


\begin{DoxyParams}{Parameters}
{\em data\+\_\+free\+\_\+cb} & The function called on each value when the hash table is freed, or when an item is deleted from it. {\ttfamily N\+U\+L\+L} can be passed as callback. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The new hash table.
\end{DoxyReturn}
This function creates a new hash table where keys are 64bit integers. When adding or looking up in the hash table, pointers to 64bit integers must be passed. They can be addresses on the stack. Values can then be looked up with pointers other than the original key pointer that was used to add values. This method is not suitable to match string keys as it would only match the first character. On failure, this function returns {\ttfamily N\+U\+L\+L}. 

References eina\+\_\+hash\+\_\+int64(), eina\+\_\+hash\+\_\+new(), E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P, E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H, and E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H.

\hypertarget{group__Eina__Hash__Group_ga0cd41f505034160d99f3b907ad3d74ce}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+pointer\+\_\+new@{eina\+\_\+hash\+\_\+pointer\+\_\+new}}
\index{eina\+\_\+hash\+\_\+pointer\+\_\+new@{eina\+\_\+hash\+\_\+pointer\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+pointer\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Hash}$\ast$ eina\+\_\+hash\+\_\+pointer\+\_\+new (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Free\+\_\+\+Cb}}]{data\+\_\+free\+\_\+cb}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga0cd41f505034160d99f3b907ad3d74ce}


Create a new hash table for use with pointers. 


\begin{DoxyParams}{Parameters}
{\em data\+\_\+free\+\_\+cb} & The function called on each value when the hash table is freed, or when an item is deleted from it. {\ttfamily N\+U\+L\+L} can be passed as callback. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The new hash table.
\end{DoxyReturn}
This function creates a new hash table using the int64/int32 algorithm for table management and dereferenced pointers to compare the keys. Values can then be looked up with pointers other than the original key pointer that was used to add values. This method may appear to be able to match string keys, actually it only matches the first character. On failure, this function returns {\ttfamily N\+U\+L\+L}.


\begin{DoxyCode}
1 // For a hash that will have only one pointer to each structure
2 extern Eina\_Hash *hash;
3 extern void *data;
4 
5 if (!eina\_hash\_find(hash, &data))
6    eina\_hash\_add(hash, &data, data);
\end{DoxyCode}
 

References eina\+\_\+hash\+\_\+int32(), eina\+\_\+hash\+\_\+int64(), eina\+\_\+hash\+\_\+new(), E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P, E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H, and E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+L\+E\+N\+G\+T\+H.



Referenced by eina\+\_\+cow\+\_\+add(), eina\+\_\+file\+\_\+open(), and eina\+\_\+file\+\_\+virtualize().

\hypertarget{group__Eina__Hash__Group_ga75266e6a40be3a377345b4d883b6e9a7}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+stringshared\+\_\+new@{eina\+\_\+hash\+\_\+stringshared\+\_\+new}}
\index{eina\+\_\+hash\+\_\+stringshared\+\_\+new@{eina\+\_\+hash\+\_\+stringshared\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+stringshared\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Hash}$\ast$ eina\+\_\+hash\+\_\+stringshared\+\_\+new (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Free\+\_\+\+Cb}}]{data\+\_\+free\+\_\+cb}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga75266e6a40be3a377345b4d883b6e9a7}


Create a new hash table optimized for stringshared values. 


\begin{DoxyParams}{Parameters}
{\em data\+\_\+free\+\_\+cb} & The function called on each value when the hash table is freed, or when an item is deleted from it. {\ttfamily N\+U\+L\+L} can be passed as callback. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The new hash table.
\end{DoxyReturn}
This function creates a new hash table optimized for stringshared values. Values C\+A\+N N\+O\+T be looked up with pointers not equal to the original key pointer that was used to add a value. On failure, this function returns {\ttfamily N\+U\+L\+L}.

Excerpt of code that will N\+O\+T work with this type of hash\+:


\begin{DoxyCode}
1 extern Eina\_Hash *hash;
2 extern const char *value;
3 const char *a = eina\_stringshare\_add("key");
4 
5 eina\_hash\_add(hash, a, value);
6 eina\_hash\_find(hash, "key");
\end{DoxyCode}
 

References eina\+\_\+hash\+\_\+new(), eina\+\_\+hash\+\_\+superfast(), E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+C\+M\+P, and E\+I\+N\+A\+\_\+\+K\+E\+Y\+\_\+\+H\+A\+S\+H.



Referenced by ecore\+\_\+con\+\_\+eet\+\_\+client\+\_\+new(), ecore\+\_\+con\+\_\+eet\+\_\+server\+\_\+new(), efreet\+\_\+mime\+\_\+type\+\_\+cache\+\_\+clear(), and ethumb\+\_\+client\+\_\+init().

\hypertarget{group__Eina__Hash__Group_gafe3bb7c1f5616b4e158f60322e133260}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+add@{eina\+\_\+hash\+\_\+add}}
\index{eina\+\_\+hash\+\_\+add@{eina\+\_\+hash\+\_\+add}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+add}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+add (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gafe3bb7c1f5616b4e158f60322e133260}


Add an entry to the given hash table. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key} & A unique key. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em data} & Data to associate with the string given by {\ttfamily key}. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.
\end{DoxyReturn}
This function adds {\ttfamily key} to {\ttfamily hash}. {\ttfamily key} is expected to be unique within the hash table. Key uniqueness varies depending on the type of {\ttfamily hash\+:} a stringshared \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} need to have unique pointers (which implies unique strings). All other string hash types require the strings themselves to be unique. Pointer, int32 and int64 hashes need to have these values as unique. Failure to use sufficient uniqueness will result in unexpected results when inserting data pointers accessed with \hyperlink{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{eina\+\_\+hash\+\_\+find()}, and removed with \hyperlink{group__Eina__Hash__Group_gad8a9ac3c61ead249a6927a12e9de871a}{eina\+\_\+hash\+\_\+del()}. Key strings are case sensitive. This function returns \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise. 

References E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E.



Referenced by ecore\+\_\+evas\+\_\+data\+\_\+set(), ecore\+\_\+imf\+\_\+module\+\_\+register(), ecore\+\_\+thread\+\_\+global\+\_\+data\+\_\+add(), ecore\+\_\+thread\+\_\+local\+\_\+data\+\_\+add(), ecore\+\_\+wl\+\_\+window\+\_\+new(), edje\+\_\+color\+\_\+class\+\_\+set(), edje\+\_\+edit\+\_\+data\+\_\+add(), edje\+\_\+edit\+\_\+group\+\_\+data\+\_\+add(), edje\+\_\+edit\+\_\+program\+\_\+del(), edje\+\_\+external\+\_\+type\+\_\+register(), edje\+\_\+text\+\_\+class\+\_\+set(), eeze\+\_\+net\+\_\+new(), efreet\+\_\+desktop\+\_\+x\+\_\+field\+\_\+set(), eina\+\_\+file\+\_\+map\+\_\+new(), eina\+\_\+file\+\_\+virtual\+\_\+map\+\_\+new(), eina\+\_\+hash\+\_\+move(), eina\+\_\+mempool\+\_\+register(), eio\+\_\+file\+\_\+associate\+\_\+add(), eldbus\+\_\+address\+\_\+connection\+\_\+get(), and eldbus\+\_\+service\+\_\+object\+\_\+manager\+\_\+attach().

\hypertarget{group__Eina__Hash__Group_ga50aa7d4303e5efbe8dc7f593b59b9f63}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+direct\+\_\+add@{eina\+\_\+hash\+\_\+direct\+\_\+add}}
\index{eina\+\_\+hash\+\_\+direct\+\_\+add@{eina\+\_\+hash\+\_\+direct\+\_\+add}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+direct\+\_\+add}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+direct\+\_\+add (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga50aa7d4303e5efbe8dc7f593b59b9f63}


Add an entry to the given hash table without duplicating the string key. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key} & A unique key. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em data} & Data to associate with the string given by {\ttfamily key}. Cannot be {\ttfamily N\+U\+L\+L} \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.
\end{DoxyReturn}
This function adds {\ttfamily key} to {\ttfamily hash}. {\ttfamily key} is expected to be unique within the hash table. Key uniqueness varies depending on the type of {\ttfamily hash\+:} a stringshared \hyperlink{group__Eina__Hash__Group_ga9a89d7d3ee260d3a60572ebf651b07e0}{Eina\+\_\+\+Hash} need have unique pointers (which implies unique strings). All other string hash types require the strings themselves to be unique. Pointer, int32 and int64 hashes need to have these values as unique. Failure to use sufficient uniqueness will result in unexpected results when inserting data pointers accessed with \hyperlink{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{eina\+\_\+hash\+\_\+find()}, and removed with \hyperlink{group__Eina__Hash__Group_gad8a9ac3c61ead249a6927a12e9de871a}{eina\+\_\+hash\+\_\+del()}. This function does not make a copy of {\ttfamily key}, so it must be a string constant or stored elsewhere ( in the object being added). Key strings are case sensitive. This function returns \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise. 

References E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E.



Referenced by ecore\+\_\+con\+\_\+eet\+\_\+data\+\_\+callback\+\_\+add(), ecore\+\_\+con\+\_\+eet\+\_\+raw\+\_\+data\+\_\+callback\+\_\+add(), ecore\+\_\+thread\+\_\+global\+\_\+data\+\_\+add(), ecore\+\_\+thread\+\_\+local\+\_\+data\+\_\+add(), edje\+\_\+edit\+\_\+font\+\_\+add(), edje\+\_\+edit\+\_\+group\+\_\+add(), edje\+\_\+edit\+\_\+group\+\_\+alias\+\_\+add(), edje\+\_\+edit\+\_\+group\+\_\+copy(), edje\+\_\+external\+\_\+type\+\_\+array\+\_\+register(), eina\+\_\+file\+\_\+map\+\_\+new(), eina\+\_\+file\+\_\+open(), eina\+\_\+file\+\_\+virtual\+\_\+map\+\_\+new(), eio\+\_\+file\+\_\+associate\+\_\+direct\+\_\+add(), eio\+\_\+monitor\+\_\+stringshared\+\_\+add(), and ethumb\+\_\+client\+\_\+thumb\+\_\+exists().

\hypertarget{group__Eina__Hash__Group_gad8a9ac3c61ead249a6927a12e9de871a}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+del@{eina\+\_\+hash\+\_\+del}}
\index{eina\+\_\+hash\+\_\+del@{eina\+\_\+hash\+\_\+del}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+del}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+del (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gad8a9ac3c61ead249a6927a12e9de871a}


Remove the entry identified by a key or a data from the given hash table. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. \\
\hline
{\em key} & The key. \\
\hline
{\em data} & The data pointer to remove if the key is {\ttfamily N\+U\+L\+L}. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.
\end{DoxyReturn}
This function removes the entry identified by {\ttfamily key} or {\ttfamily data} from {\ttfamily hash}. If a free function was given to the callback on creation, it will be called for the data being deleted. If {\ttfamily hash} is {\ttfamily N\+U\+L\+L}, the functions returns immediately \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E}. If {\ttfamily key} is {\ttfamily N\+U\+L\+L}, then {\ttfamily data} is used to find the a match to remove, otherwise {\ttfamily key} is used and {\ttfamily data} is not required and can be {\ttfamily N\+U\+L\+L}. This function returns \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.

\begin{DoxyNote}{Note}
if you know you already have the key, use \hyperlink{group__Eina__Hash__Group_gacdcde189b35d525773d699793daa9017}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key()} or \hyperlink{group__Eina__Hash__Group_ga7454f861781493345ff389a2605a9237}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash()}. If you know you don\textquotesingle{}t have the key, use \hyperlink{group__Eina__Hash__Group_ga66ca7b9af4f40eeefd8aa401e07147c1}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data()} directly. 
\end{DoxyNote}


References E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E, and eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data().



Referenced by ecore\+\_\+con\+\_\+eet\+\_\+data\+\_\+callback\+\_\+del(), ecore\+\_\+con\+\_\+eet\+\_\+raw\+\_\+data\+\_\+callback\+\_\+del(), ecore\+\_\+evas\+\_\+data\+\_\+set(), ecore\+\_\+wl\+\_\+window\+\_\+free(), edje\+\_\+color\+\_\+class\+\_\+del(), edje\+\_\+edit\+\_\+data\+\_\+del(), edje\+\_\+edit\+\_\+font\+\_\+add(), edje\+\_\+edit\+\_\+font\+\_\+del(), edje\+\_\+edit\+\_\+group\+\_\+data\+\_\+del(), edje\+\_\+edit\+\_\+group\+\_\+del(), edje\+\_\+external\+\_\+type\+\_\+array\+\_\+unregister(), edje\+\_\+text\+\_\+class\+\_\+del(), eina\+\_\+file\+\_\+common\+\_\+map\+\_\+free(), eina\+\_\+file\+\_\+flush(), eina\+\_\+file\+\_\+open(), eina\+\_\+file\+\_\+virtual\+\_\+map\+\_\+free(), eina\+\_\+hash\+\_\+move(), eina\+\_\+mempool\+\_\+unregister(), eio\+\_\+monitor\+\_\+stringshared\+\_\+add(), eldbus\+\_\+service\+\_\+interface\+\_\+unregister(), and eldbus\+\_\+service\+\_\+object\+\_\+manager\+\_\+detach().

\hypertarget{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+find@{eina\+\_\+hash\+\_\+find}}
\index{eina\+\_\+hash\+\_\+find@{eina\+\_\+hash\+\_\+find}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+find}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ eina\+\_\+hash\+\_\+find (
\begin{DoxyParamCaption}
\item[{const {\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}


Retrieve a specific entry in the given hash table. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. \\
\hline
{\em key} & The key of the entry to find. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The data pointer for the stored entry on success, {\ttfamily N\+U\+L\+L} otherwise.
\end{DoxyReturn}
This function retrieves the entry associated to {\ttfamily key} in {\ttfamily hash}. If {\ttfamily hash} is {\ttfamily N\+U\+L\+L}, this function returns immediately {\ttfamily N\+U\+L\+L}. This function returns the data pointer on success, {\ttfamily N\+U\+L\+L} otherwise. 

References eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash().



Referenced by ecore\+\_\+evas\+\_\+data\+\_\+get(), ecore\+\_\+thread\+\_\+global\+\_\+data\+\_\+find(), ecore\+\_\+thread\+\_\+global\+\_\+data\+\_\+wait(), ecore\+\_\+thread\+\_\+local\+\_\+data\+\_\+find(), ecore\+\_\+wl\+\_\+window\+\_\+find(), edje\+\_\+color\+\_\+class\+\_\+del(), edje\+\_\+color\+\_\+class\+\_\+get(), edje\+\_\+color\+\_\+class\+\_\+set(), edje\+\_\+edit\+\_\+data\+\_\+add(), edje\+\_\+edit\+\_\+data\+\_\+del(), edje\+\_\+edit\+\_\+data\+\_\+value\+\_\+get(), edje\+\_\+edit\+\_\+data\+\_\+value\+\_\+set(), edje\+\_\+edit\+\_\+font\+\_\+add(), edje\+\_\+edit\+\_\+font\+\_\+del(), edje\+\_\+edit\+\_\+group\+\_\+add(), edje\+\_\+edit\+\_\+group\+\_\+alias\+\_\+add(), edje\+\_\+edit\+\_\+group\+\_\+alias\+\_\+is(), edje\+\_\+edit\+\_\+group\+\_\+aliased\+\_\+get(), edje\+\_\+edit\+\_\+group\+\_\+aliases\+\_\+get(), edje\+\_\+edit\+\_\+group\+\_\+copy(), edje\+\_\+edit\+\_\+group\+\_\+data\+\_\+add(), edje\+\_\+edit\+\_\+group\+\_\+data\+\_\+del(), edje\+\_\+edit\+\_\+group\+\_\+data\+\_\+value\+\_\+get(), edje\+\_\+edit\+\_\+group\+\_\+data\+\_\+value\+\_\+set(), edje\+\_\+edit\+\_\+group\+\_\+del(), edje\+\_\+edit\+\_\+group\+\_\+exist(), edje\+\_\+edit\+\_\+group\+\_\+name\+\_\+set(), edje\+\_\+edit\+\_\+part\+\_\+del(), edje\+\_\+edit\+\_\+part\+\_\+item\+\_\+append(), edje\+\_\+edit\+\_\+part\+\_\+item\+\_\+source\+\_\+set(), edje\+\_\+edit\+\_\+program\+\_\+action\+\_\+set(), edje\+\_\+edit\+\_\+program\+\_\+del(), edje\+\_\+edit\+\_\+script\+\_\+program\+\_\+get(), edje\+\_\+edit\+\_\+script\+\_\+program\+\_\+set(), edje\+\_\+edit\+\_\+source\+\_\+generate(), edje\+\_\+edit\+\_\+state\+\_\+del(), edje\+\_\+external\+\_\+param\+\_\+info\+\_\+get(), edje\+\_\+external\+\_\+type\+\_\+get(), edje\+\_\+external\+\_\+type\+\_\+register(), edje\+\_\+mmap\+\_\+data\+\_\+get(), edje\+\_\+mmap\+\_\+group\+\_\+exists(), edje\+\_\+text\+\_\+class\+\_\+del(), edje\+\_\+text\+\_\+class\+\_\+get(), edje\+\_\+text\+\_\+class\+\_\+set(), eeze\+\_\+net\+\_\+new(), efreet\+\_\+desktop\+\_\+x\+\_\+field\+\_\+get(), efreet\+\_\+mime\+\_\+globs\+\_\+type\+\_\+get(), efreet\+\_\+util\+\_\+desktop\+\_\+exec\+\_\+find(), efreet\+\_\+util\+\_\+desktop\+\_\+exec\+\_\+glob\+\_\+list(), efreet\+\_\+util\+\_\+desktop\+\_\+file\+\_\+id\+\_\+find(), efreet\+\_\+util\+\_\+path\+\_\+to\+\_\+file\+\_\+id(), eina\+\_\+file\+\_\+common\+\_\+map\+\_\+free(), eina\+\_\+file\+\_\+map\+\_\+faulted(), eina\+\_\+file\+\_\+map\+\_\+new(), eina\+\_\+file\+\_\+map\+\_\+populate(), eina\+\_\+file\+\_\+open(), eina\+\_\+file\+\_\+virtual\+\_\+map\+\_\+free(), eina\+\_\+file\+\_\+virtual\+\_\+map\+\_\+new(), eina\+\_\+hash\+\_\+move(), eio\+\_\+file\+\_\+associate\+\_\+find(), eio\+\_\+monitor\+\_\+stringshared\+\_\+add(), eldbus\+\_\+address\+\_\+connection\+\_\+get(), eldbus\+\_\+name\+\_\+owner\+\_\+changed\+\_\+callback\+\_\+del(), eldbus\+\_\+proxy\+\_\+property\+\_\+local\+\_\+get(), eldbus\+\_\+service\+\_\+object\+\_\+manager\+\_\+attach(), eldbus\+\_\+service\+\_\+property\+\_\+changed(), and ethumb\+\_\+client\+\_\+thumb\+\_\+exists().

\hypertarget{group__Eina__Hash__Group_gaabf2f2af1d93f969591f2c5b7378c543}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+modify@{eina\+\_\+hash\+\_\+modify}}
\index{eina\+\_\+hash\+\_\+modify@{eina\+\_\+hash\+\_\+modify}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+modify}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ eina\+\_\+hash\+\_\+modify (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gaabf2f2af1d93f969591f2c5b7378c543}


Modify the entry pointer at the specified key and return the old entry. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. \\
\hline
{\em key} & The key of the entry to modify. \\
\hline
{\em data} & The data to replace the old entry. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The data pointer for the old stored entry on success, or {\ttfamily N\+U\+L\+L} otherwise.
\end{DoxyReturn}
This function modifies the data of {\ttfamily key} with {\ttfamily data} in {\ttfamily hash}. If no entry is found, nothing is added to {\ttfamily hash}. On success this function returns the old entry, otherwise it returns {\ttfamily N\+U\+L\+L}. 

References eina\+\_\+hash\+\_\+modify\+\_\+by\+\_\+hash().

\hypertarget{group__Eina__Hash__Group_ga53fd5f171289d63c5d8532bb28434cb3}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+set@{eina\+\_\+hash\+\_\+set}}
\index{eina\+\_\+hash\+\_\+set@{eina\+\_\+hash\+\_\+set}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+set}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ eina\+\_\+hash\+\_\+set (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga53fd5f171289d63c5d8532bb28434cb3}


Modify the entry pointer at the specified key and return the old entry or add the entry if not found. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. \\
\hline
{\em key} & The key of the entry to modify. \\
\hline
{\em data} & The data to replace the old entry \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The data pointer for the old stored entry, or {\ttfamily N\+U\+L\+L} otherwise.
\end{DoxyReturn}
This function modifies the data of {\ttfamily key} with {\ttfamily data} in {\ttfamily hash}. If no entry is found, {\ttfamily data} is added to {\ttfamily hash} with the key {\ttfamily key}. On success this function returns the old entry, otherwise it returns {\ttfamily N\+U\+L\+L}. 

References \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::data, \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key, and \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key\+\_\+length.



Referenced by ecore\+\_\+thread\+\_\+global\+\_\+data\+\_\+set(), ecore\+\_\+thread\+\_\+local\+\_\+data\+\_\+set(), edje\+\_\+edit\+\_\+program\+\_\+action\+\_\+set(), efreet\+\_\+util\+\_\+path\+\_\+to\+\_\+file\+\_\+id(), and evas\+\_\+smart\+\_\+legacy\+\_\+type\+\_\+register().

\hypertarget{group__Eina__Hash__Group_gaa390160f31c235d91947281244e77628}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+move@{eina\+\_\+hash\+\_\+move}}
\index{eina\+\_\+hash\+\_\+move@{eina\+\_\+hash\+\_\+move}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+move}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+move (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{old\+\_\+key, }
\item[{const void $\ast$}]{new\+\_\+key}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gaa390160f31c235d91947281244e77628}


Change the key associated with a data without triggering the free callback. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. \\
\hline
{\em old\+\_\+key} & The current key associated with the data \\
\hline
{\em new\+\_\+key} & The new key to associate data with \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} in any case but success, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} on success.
\end{DoxyReturn}
This function allows for the move of data from one key to another, but does not call the Eina\+\_\+\+Free\+\_\+\+Cb associated with the hash table when destroying the old key. 

References E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E, eina\+\_\+hash\+\_\+add(), eina\+\_\+hash\+\_\+del(), and eina\+\_\+hash\+\_\+find().



Referenced by edje\+\_\+edit\+\_\+data\+\_\+name\+\_\+set(), edje\+\_\+edit\+\_\+group\+\_\+data\+\_\+name\+\_\+set(), and edje\+\_\+edit\+\_\+group\+\_\+name\+\_\+set().

\hypertarget{group__Eina__Hash__Group_gadb6acb720ce267cc1cd4f51893539f59}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+free@{eina\+\_\+hash\+\_\+free}}
\index{eina\+\_\+hash\+\_\+free@{eina\+\_\+hash\+\_\+free}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+free}]{\setlength{\rightskip}{0pt plus 5cm}void eina\+\_\+hash\+\_\+free (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gadb6acb720ce267cc1cd4f51893539f59}


Free the given hash table resources. 


\begin{DoxyParams}{Parameters}
{\em hash} & The hash table to be freed.\\
\hline
\end{DoxyParams}
This function frees up all the memory allocated to storing {\ttfamily hash}, and call the free callback if it has been passed to the hash table at creation time. If no free callback has been passed, any entries in the table that the program has no more pointers for elsewhere may now be lost, so this should only be called if the program has already freed any allocated data in the hash table or has the pointers for data in the table stored elsewhere as well. If {\ttfamily hash} is {\ttfamily N\+U\+L\+L}, the function returns immediately.

Example\+: 
\begin{DoxyCode}
1 extern Eina\_Hash *hash;
2 
3 eina\_hash\_free(hash);
4 hash = NULL;
\end{DoxyCode}
 

References eina\+\_\+rbtree\+\_\+delete(), and E\+I\+N\+A\+\_\+\+R\+B\+T\+R\+E\+E\+\_\+\+F\+R\+E\+E\+\_\+\+C\+B.



Referenced by ecore\+\_\+con\+\_\+eet\+\_\+server\+\_\+free(), efreet\+\_\+mime\+\_\+type\+\_\+cache\+\_\+clear(), eina\+\_\+cow\+\_\+del(), eina\+\_\+file\+\_\+clean\+\_\+close(), eldbus\+\_\+proxy\+\_\+event\+\_\+callback\+\_\+del(), eldbus\+\_\+proxy\+\_\+properties\+\_\+monitor(), eldbus\+\_\+shutdown(), and ethumb\+\_\+client\+\_\+shutdown().

\hypertarget{group__Eina__Hash__Group_gabe2ba51e5dbf6fd5f60628b8e8f00eaa}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+free\+\_\+buckets@{eina\+\_\+hash\+\_\+free\+\_\+buckets}}
\index{eina\+\_\+hash\+\_\+free\+\_\+buckets@{eina\+\_\+hash\+\_\+free\+\_\+buckets}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+free\+\_\+buckets}]{\setlength{\rightskip}{0pt plus 5cm}void eina\+\_\+hash\+\_\+free\+\_\+buckets (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gabe2ba51e5dbf6fd5f60628b8e8f00eaa}


Free the given hash table buckets resources. 


\begin{DoxyParams}{Parameters}
{\em hash} & The hash table whose buckets have to be freed.\\
\hline
\end{DoxyParams}
This function frees up all the memory allocated to storing the buckets of {\ttfamily hash}, and calls the free callback on all hash table buckets if it has been passed to the hash table at creation time, then frees the buckets. If no free callback has been passed, no buckets value will be freed. If {\ttfamily hash} is {\ttfamily N\+U\+L\+L}, the function returns immediately. 

References eina\+\_\+rbtree\+\_\+delete(), and E\+I\+N\+A\+\_\+\+R\+B\+T\+R\+E\+E\+\_\+\+F\+R\+E\+E\+\_\+\+C\+B.

\hypertarget{group__Eina__Hash__Group_ga9289542f6724083eab306e5bb3ab10b0}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+population@{eina\+\_\+hash\+\_\+population}}
\index{eina\+\_\+hash\+\_\+population@{eina\+\_\+hash\+\_\+population}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+population}]{\setlength{\rightskip}{0pt plus 5cm}int eina\+\_\+hash\+\_\+population (
\begin{DoxyParamCaption}
\item[{const {\bf Eina\+\_\+\+Hash} $\ast$}]{hash}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga9289542f6724083eab306e5bb3ab10b0}


Returns the number of entries in the given hash table. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The number of entries in the hash table.
\end{DoxyReturn}
This function returns the number of entries in {\ttfamily hash}, or 0 on error. If {\ttfamily hash} is {\ttfamily N\+U\+L\+L}, {\ttfamily 0} is returned. 

Referenced by eina\+\_\+cow\+\_\+gc(), eldbus\+\_\+proxy\+\_\+properties\+\_\+monitor(), and eldbus\+\_\+shutdown().

\hypertarget{group__Eina__Hash__Group_ga4637f61969ecc13adaca17def6ed1a91}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+add\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+add\+\_\+by\+\_\+hash}}
\index{eina\+\_\+hash\+\_\+add\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+add\+\_\+by\+\_\+hash}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+add\+\_\+by\+\_\+hash}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+add\+\_\+by\+\_\+hash (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{int}]{key\+\_\+length, }
\item[{int}]{key\+\_\+hash, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga4637f61969ecc13adaca17def6ed1a91}


Add an entry to the given hash table. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key} & A unique key. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key\+\_\+length} & The length of the key. \\
\hline
{\em key\+\_\+hash} & The hash that will always match key. \\
\hline
{\em data} & The data to associate with the string given by the key. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.
\end{DoxyReturn}
This function adds {\ttfamily key} to {\ttfamily hash}. {\ttfamily hash}, {\ttfamily key} and {\ttfamily data} cannot be {\ttfamily N\+U\+L\+L}, in that case \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} is returned. {\ttfamily key} is expected to be a unique within the hash table. Otherwise, one cannot be sure which inserted data pointer will be accessed with \hyperlink{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{eina\+\_\+hash\+\_\+find}, and removed with \hyperlink{group__Eina__Hash__Group_gad8a9ac3c61ead249a6927a12e9de871a}{eina\+\_\+hash\+\_\+del}. Do not forget to count \textquotesingle{}\textbackslash{}0\textquotesingle{} for string when setting the value of {\ttfamily key\+\_\+length}. {\ttfamily key\+\_\+hash} is expected to always match {\ttfamily key}. Otherwise, one cannot be sure to find it again with \hyperlink{group__Eina__Hash__Group_ga42dee6ba7f023156397ec4ece52e3cf5}{eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash}. Key strings are case sensitive. This function returns \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.

\begin{DoxySeeAlso}{See also}
\hyperlink{group__Eina__Hash__Group_gafe3bb7c1f5616b4e158f60322e133260}{eina\+\_\+hash\+\_\+add()} 
\end{DoxySeeAlso}
\hypertarget{group__Eina__Hash__Group_ga1a88c8632539860e1df25d1812f4146f}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+direct\+\_\+add\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+direct\+\_\+add\+\_\+by\+\_\+hash}}
\index{eina\+\_\+hash\+\_\+direct\+\_\+add\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+direct\+\_\+add\+\_\+by\+\_\+hash}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+direct\+\_\+add\+\_\+by\+\_\+hash}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+direct\+\_\+add\+\_\+by\+\_\+hash (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{int}]{key\+\_\+length, }
\item[{int}]{key\+\_\+hash, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga1a88c8632539860e1df25d1812f4146f}


Add an entry to the given hash table and do not duplicate the string key. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key} & A unique key. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key\+\_\+length} & Should be the length of {\ttfamily key} (don\textquotesingle{}t forget to count \textquotesingle{}\textbackslash{}0\textquotesingle{} for string). \\
\hline
{\em key\+\_\+hash} & The hash that will always match key. \\
\hline
{\em data} & Data to associate with the string given by {\ttfamily key}. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.
\end{DoxyReturn}
This function adds {\ttfamily key} to {\ttfamily hash}. {\ttfamily hash}, {\ttfamily key} and {\ttfamily data} can be {\ttfamily N\+U\+L\+L}, in that case \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} is returned. {\ttfamily key} is expected to be unique within the hash table. Otherwise, one cannot be sure which inserted data pointer will be accessed with \hyperlink{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{eina\+\_\+hash\+\_\+find}, and removed with \hyperlink{group__Eina__Hash__Group_gad8a9ac3c61ead249a6927a12e9de871a}{eina\+\_\+hash\+\_\+del}. This function does not make a copy of {\ttfamily key} so it must be a string constant or stored elsewhere (in the object being added). Do not forget to count \textquotesingle{}\textbackslash{}0\textquotesingle{} for string when setting the value of {\ttfamily key\+\_\+length}. {\ttfamily key\+\_\+hash} is expected to always match {\ttfamily key}. Otherwise, one cannot be sure to find it again with \hyperlink{group__Eina__Hash__Group_ga42dee6ba7f023156397ec4ece52e3cf5}{eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash}. Key strings are case sensitive. This function returns \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.

\begin{DoxySeeAlso}{See also}
\hyperlink{group__Eina__Hash__Group_ga50aa7d4303e5efbe8dc7f593b59b9f63}{eina\+\_\+hash\+\_\+direct\+\_\+add()} 
\end{DoxySeeAlso}
\hypertarget{group__Eina__Hash__Group_ga7454f861781493345ff389a2605a9237}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash@{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash}}
\index{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash@{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{int}]{key\+\_\+length, }
\item[{int}]{key\+\_\+hash}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga7454f861781493345ff389a2605a9237}


Remove the entry identified by a key and a key hash from the given hash table. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key} & The key. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key\+\_\+length} & The length of the key. \\
\hline
{\em key\+\_\+hash} & The hash that always match the key. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.
\end{DoxyReturn}
This function removes the entry identified by {\ttfamily key} and {\ttfamily key\+\_\+hash} from {\ttfamily hash}. If a free function was given to the callback on creation, it will be called for the data being deleted. Do not forget to count \textquotesingle{}\textbackslash{}0\textquotesingle{} for string when setting the value of {\ttfamily key\+\_\+length}. If {\ttfamily hash} or {\ttfamily key} are {\ttfamily N\+U\+L\+L}, the functions returns immediately \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E}. This function returns \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.

\begin{DoxyNote}{Note}
if you don\textquotesingle{}t have the key\+\_\+hash, use \hyperlink{group__Eina__Hash__Group_gacdcde189b35d525773d699793daa9017}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key()} instead. 

if you don\textquotesingle{}t have the key, use \hyperlink{group__Eina__Hash__Group_ga66ca7b9af4f40eeefd8aa401e07147c1}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data()} instead. 
\end{DoxyNote}


References E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E.



Referenced by eina\+\_\+file\+\_\+close().

\hypertarget{group__Eina__Hash__Group_gacdcde189b35d525773d699793daa9017}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key@{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key}}
\index{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key@{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gacdcde189b35d525773d699793daa9017}


Remove the entry identified by a key from the given hash table. 

This version will calculate key length and hash by using functions provided to hash creation function.


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key} & The key. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.
\end{DoxyReturn}
This function removes the entry identified by {\ttfamily key} from {\ttfamily hash}. The key length and hash will be calculated automatically by using functiond provided to has creation function. If a free function was given to the callback on creation, it will be called for the data being deleted. If {\ttfamily hash} or {\ttfamily key} are {\ttfamily N\+U\+L\+L}, the functions returns immediately \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E}. This function returns \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.

\begin{DoxyNote}{Note}
if you already have the key\+\_\+hash, use \hyperlink{group__Eina__Hash__Group_ga7454f861781493345ff389a2605a9237}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash()} instead. 

if you don\textquotesingle{}t have the key, use \hyperlink{group__Eina__Hash__Group_ga66ca7b9af4f40eeefd8aa401e07147c1}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data()} instead. 
\end{DoxyNote}


References E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E.



Referenced by ecore\+\_\+thread\+\_\+global\+\_\+data\+\_\+del(), ecore\+\_\+thread\+\_\+local\+\_\+data\+\_\+del(), edje\+\_\+external\+\_\+type\+\_\+unregister(), eeze\+\_\+net\+\_\+free(), efreet\+\_\+desktop\+\_\+x\+\_\+field\+\_\+del(), and efreet\+\_\+desktop\+\_\+x\+\_\+field\+\_\+set().

\hypertarget{group__Eina__Hash__Group_ga66ca7b9af4f40eeefd8aa401e07147c1}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data@{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data}}
\index{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data@{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga66ca7b9af4f40eeefd8aa401e07147c1}


Remove the entry identified by a data from the given hash table. 

This version is slow since there is no quick access to nodes based on data.


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em data} & The data value to search and remove. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise. thing goes fine.
\end{DoxyReturn}
This function removes the entry identified by {\ttfamily data} from {\ttfamily hash}. If a free function was given to the callback on creation, it will be called for the data being deleted. If {\ttfamily hash} or {\ttfamily data} are {\ttfamily N\+U\+L\+L}, the functions returns immediately \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E}. This function returns \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.

\begin{DoxyNote}{Note}
if you already have the key, use \hyperlink{group__Eina__Hash__Group_gacdcde189b35d525773d699793daa9017}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key()} or \hyperlink{group__Eina__Hash__Group_ga7454f861781493345ff389a2605a9237}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash()} instead. 
\end{DoxyNote}


References E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E.



Referenced by eina\+\_\+hash\+\_\+del(), and eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+hash().

\hypertarget{group__Eina__Hash__Group_ga4ce2a4a6917d96d5a791633d83e7af4e}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+hash}}
\index{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+hash}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+hash}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Bool} eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+hash (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{int}]{key\+\_\+length, }
\item[{int}]{key\+\_\+hash, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga4ce2a4a6917d96d5a791633d83e7af4e}


Remove the entry identified by a key and a key hash or a data from the given hash table. 

If {\ttfamily key} is {\ttfamily N\+U\+L\+L}, then {\ttfamily data} is used to find a match to remove.


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key} & The key. \\
\hline
{\em key\+\_\+length} & The length of the key. \\
\hline
{\em key\+\_\+hash} & The hash that always match the key. \\
\hline
{\em data} & The data pointer to remove if the key is {\ttfamily N\+U\+L\+L}. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.
\end{DoxyReturn}
This function removes the entry identified by {\ttfamily key} and {\ttfamily key\+\_\+hash}, or {\ttfamily data}, from {\ttfamily hash}. If a free function was given to the callback on creation, it will be called for the data being deleted. If {\ttfamily hash} is {\ttfamily N\+U\+L\+L}, the functions returns immediately \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E}. If {\ttfamily key} is {\ttfamily N\+U\+L\+L}, then {\ttfamily key\+\_\+length} and {\ttfamily key\+\_\+hash} are ignored and {\ttfamily data} is used to find a match to remove, otherwise {\ttfamily key} and {\ttfamily key\+\_\+hash} are used and {\ttfamily data} is not required and can be {\ttfamily N\+U\+L\+L}. Do not forget to count \textquotesingle{}\textbackslash{}0\textquotesingle{} for string when setting the value of {\ttfamily key\+\_\+length}. This function returns \hyperlink{group__Eina__Types__Group_ga1feb115f8e9913e806e090d9bd5a7301}{E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E} if an error occurred, \hyperlink{group__Eina__Types__Group_ga05c12dacc8b4058994df842b41be85fc}{E\+I\+N\+A\+\_\+\+T\+R\+U\+E} otherwise.

\begin{DoxyNote}{Note}
if you know you already have the key, use \hyperlink{group__Eina__Hash__Group_ga7454f861781493345ff389a2605a9237}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+key\+\_\+hash()}, if you know you don\textquotesingle{}t have the key, use \hyperlink{group__Eina__Hash__Group_ga66ca7b9af4f40eeefd8aa401e07147c1}{eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data()} directly. 
\end{DoxyNote}


References E\+I\+N\+A\+\_\+\+F\+A\+L\+S\+E, and eina\+\_\+hash\+\_\+del\+\_\+by\+\_\+data().

\hypertarget{group__Eina__Hash__Group_ga42dee6ba7f023156397ec4ece52e3cf5}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash}}
\index{eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ eina\+\_\+hash\+\_\+find\+\_\+by\+\_\+hash (
\begin{DoxyParamCaption}
\item[{const {\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{int}]{key\+\_\+length, }
\item[{int}]{key\+\_\+hash}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga42dee6ba7f023156397ec4ece52e3cf5}


Retrieve a specific entry in the given hash table. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. Cannot be {\ttfamily N\+U\+L\+L}. \\
\hline
{\em key} & The key of the entry to find. \\
\hline
{\em key\+\_\+length} & The length of the key. \\
\hline
{\em key\+\_\+hash} & The hash that always match the key \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The data pointer for the stored entry on success, {\ttfamily N\+U\+L\+L} otherwise.
\end{DoxyReturn}
This function retrieves the entry associated to {\ttfamily key} of length {\ttfamily key\+\_\+length} in {\ttfamily hash}. {\ttfamily key\+\_\+hash} is the hash that always match {\ttfamily key}. It is ignored if {\ttfamily key} is {\ttfamily N\+U\+L\+L}. Do not forget to count \textquotesingle{}\textbackslash{}0\textquotesingle{} for string when setting the value of {\ttfamily key\+\_\+length}. If {\ttfamily hash} is {\ttfamily N\+U\+L\+L}, this function returns immediately {\ttfamily N\+U\+L\+L}. This function returns the data pointer on success, {\ttfamily N\+U\+L\+L} otherwise. 

References \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::data, \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key, and \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key\+\_\+length.



Referenced by eina\+\_\+file\+\_\+close(), and eina\+\_\+hash\+\_\+find().

\hypertarget{group__Eina__Hash__Group_ga821f033abb9edea2929df2ecb4880a3a}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+modify\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+modify\+\_\+by\+\_\+hash}}
\index{eina\+\_\+hash\+\_\+modify\+\_\+by\+\_\+hash@{eina\+\_\+hash\+\_\+modify\+\_\+by\+\_\+hash}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+modify\+\_\+by\+\_\+hash}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ eina\+\_\+hash\+\_\+modify\+\_\+by\+\_\+hash (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{int}]{key\+\_\+length, }
\item[{int}]{key\+\_\+hash, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga821f033abb9edea2929df2ecb4880a3a}


Modify the entry pointer at the specified key and returns the old entry. 


\begin{DoxyParams}{Parameters}
{\em hash} & The given hash table. \\
\hline
{\em key} & The key of the entry to modify. \\
\hline
{\em key\+\_\+length} & Should be the length of {\ttfamily key} (don\textquotesingle{}t forget to count \textquotesingle{}\textbackslash{}0\textquotesingle{} for string). \\
\hline
{\em key\+\_\+hash} & The hash that always match the key. Ignored if {\ttfamily key} is {\ttfamily N\+U\+L\+L}. \\
\hline
{\em data} & The data to replace the old entry, if it exists. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The data pointer for the old stored entry, or {\ttfamily N\+U\+L\+L} if not found. If an existing entry is not found, nothing is added to the hash. 
\end{DoxyReturn}


References \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::data, \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key, and \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key\+\_\+length.



Referenced by eina\+\_\+hash\+\_\+modify().

\hypertarget{group__Eina__Hash__Group_ga1a090384b1c057daec8e19c6a1ea2c0d}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+iterator\+\_\+key\+\_\+new@{eina\+\_\+hash\+\_\+iterator\+\_\+key\+\_\+new}}
\index{eina\+\_\+hash\+\_\+iterator\+\_\+key\+\_\+new@{eina\+\_\+hash\+\_\+iterator\+\_\+key\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+iterator\+\_\+key\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Iterator}$\ast$ eina\+\_\+hash\+\_\+iterator\+\_\+key\+\_\+new (
\begin{DoxyParamCaption}
\item[{const {\bf Eina\+\_\+\+Hash} $\ast$}]{hash}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga1a090384b1c057daec8e19c6a1ea2c0d}


Returned a new iterator associated to hash keys. 


\begin{DoxyParams}{Parameters}
{\em hash} & The hash. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
A new iterator.
\end{DoxyReturn}
This function returns a newly allocated iterator associated to {\ttfamily hash}. If {\ttfamily hash} is not populated, this function still returns a valid iterator that will always return false on \hyperlink{group__Eina__Iterator__Group_ga83346e93c32dbebc8fd66e4f278140c5}{eina\+\_\+iterator\+\_\+next()}, thus keeping A\+P\+I sane.

If the memory can not be allocated, N\+U\+L\+L is returned. Otherwise, a valid iterator is returned.

\begin{DoxyWarning}{Warning}
if the hash structure changes then the iterator becomes invalid! That is, if you add or remove items this iterator behavior is undefined and your program may crash! 
\end{DoxyWarning}


References E\+I\+N\+A\+\_\+\+M\+A\+G\+I\+C\+\_\+\+S\+E\+T, F\+U\+N\+C\+\_\+\+I\+T\+E\+R\+A\+T\+O\+R\+\_\+\+F\+R\+E\+E, F\+U\+N\+C\+\_\+\+I\+T\+E\+R\+A\+T\+O\+R\+\_\+\+G\+E\+T\+\_\+\+C\+O\+N\+T\+A\+I\+N\+E\+R, and F\+U\+N\+C\+\_\+\+I\+T\+E\+R\+A\+T\+O\+R\+\_\+\+N\+E\+X\+T.



Referenced by edje\+\_\+edit\+\_\+data\+\_\+list\+\_\+get(), edje\+\_\+edit\+\_\+group\+\_\+data\+\_\+list\+\_\+get(), edje\+\_\+edit\+\_\+source\+\_\+generate(), and edje\+\_\+mmap\+\_\+collection\+\_\+list().

\hypertarget{group__Eina__Hash__Group_ga5191350d6044d93b6518a957f12f5ac3}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+iterator\+\_\+data\+\_\+new@{eina\+\_\+hash\+\_\+iterator\+\_\+data\+\_\+new}}
\index{eina\+\_\+hash\+\_\+iterator\+\_\+data\+\_\+new@{eina\+\_\+hash\+\_\+iterator\+\_\+data\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+iterator\+\_\+data\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Iterator}$\ast$ eina\+\_\+hash\+\_\+iterator\+\_\+data\+\_\+new (
\begin{DoxyParamCaption}
\item[{const {\bf Eina\+\_\+\+Hash} $\ast$}]{hash}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga5191350d6044d93b6518a957f12f5ac3}


Returned a new iterator associated to hash data. 


\begin{DoxyParams}{Parameters}
{\em hash} & The hash. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
A new iterator.
\end{DoxyReturn}
This function returns a newly allocated iterator associated to {\ttfamily hash}. If {\ttfamily hash} is not populated, this function still returns a valid iterator that will always return false on \hyperlink{group__Eina__Iterator__Group_ga83346e93c32dbebc8fd66e4f278140c5}{eina\+\_\+iterator\+\_\+next()}, thus keeping A\+P\+I sane.

If the memory can not be allocated, {\ttfamily N\+U\+L\+L} is returned. Otherwise, a valid iterator is returned.

\begin{DoxyWarning}{Warning}
if the hash structure changes then the iterator becomes invalid. That is, if you add or remove items this iterator behavior is undefined and your program may crash. 
\end{DoxyWarning}


References E\+I\+N\+A\+\_\+\+M\+A\+G\+I\+C\+\_\+\+S\+E\+T, F\+U\+N\+C\+\_\+\+I\+T\+E\+R\+A\+T\+O\+R\+\_\+\+F\+R\+E\+E, F\+U\+N\+C\+\_\+\+I\+T\+E\+R\+A\+T\+O\+R\+\_\+\+G\+E\+T\+\_\+\+C\+O\+N\+T\+A\+I\+N\+E\+R, and F\+U\+N\+C\+\_\+\+I\+T\+E\+R\+A\+T\+O\+R\+\_\+\+N\+E\+X\+T.



Referenced by ecore\+\_\+wl\+\_\+window\+\_\+surface\+\_\+find(), edje\+\_\+color\+\_\+class\+\_\+del(), edje\+\_\+color\+\_\+class\+\_\+set(), edje\+\_\+edit\+\_\+clean\+\_\+save\+\_\+as(), edje\+\_\+edit\+\_\+font\+\_\+path\+\_\+get(), edje\+\_\+edit\+\_\+fonts\+\_\+list\+\_\+get(), edje\+\_\+edit\+\_\+group\+\_\+add(), edje\+\_\+edit\+\_\+group\+\_\+aliased\+\_\+get(), edje\+\_\+edit\+\_\+group\+\_\+aliases\+\_\+get(), edje\+\_\+edit\+\_\+group\+\_\+copy(), edje\+\_\+edit\+\_\+image\+\_\+del(), edje\+\_\+edit\+\_\+image\+\_\+replace(), edje\+\_\+edit\+\_\+image\+\_\+usage\+\_\+list\+\_\+get(), edje\+\_\+file\+\_\+iterator\+\_\+new(), edje\+\_\+mmap\+\_\+group\+\_\+exists(), edje\+\_\+text\+\_\+class\+\_\+del(), edje\+\_\+text\+\_\+class\+\_\+set(), eina\+\_\+cow\+\_\+gc(), and eina\+\_\+file\+\_\+flush().

\hypertarget{group__Eina__Hash__Group_gaf0e7e38ec02c4bcfca3c3c4dd13c6af9}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+iterator\+\_\+tuple\+\_\+new@{eina\+\_\+hash\+\_\+iterator\+\_\+tuple\+\_\+new}}
\index{eina\+\_\+hash\+\_\+iterator\+\_\+tuple\+\_\+new@{eina\+\_\+hash\+\_\+iterator\+\_\+tuple\+\_\+new}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+iterator\+\_\+tuple\+\_\+new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Eina\+\_\+\+Iterator}$\ast$ eina\+\_\+hash\+\_\+iterator\+\_\+tuple\+\_\+new (
\begin{DoxyParamCaption}
\item[{const {\bf Eina\+\_\+\+Hash} $\ast$}]{hash}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gaf0e7e38ec02c4bcfca3c3c4dd13c6af9}


Returned a new iterator associated to hash keys and data. 


\begin{DoxyParams}{Parameters}
{\em hash} & The hash. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
A new iterator.
\end{DoxyReturn}
This function returns a newly allocated iterator associated to {\ttfamily hash}. If {\ttfamily hash} is not populated, this function still returns a valid iterator that will always return false on \hyperlink{group__Eina__Iterator__Group_ga83346e93c32dbebc8fd66e4f278140c5}{eina\+\_\+iterator\+\_\+next()}, thus keeping A\+P\+I sane.

If the memory can not be allocated, {\ttfamily N\+U\+L\+L} is returned. Otherwise, a valid iterator is returned.

\begin{DoxyNote}{Note}
iterator data will provide values as Eina\+\_\+\+Hash\+\_\+\+Tuple that should not be modified!
\end{DoxyNote}
\begin{DoxyWarning}{Warning}
if the hash structure changes then the iterator becomes invalid! That is, if you add or remove items this iterator behavior is undefined and your program may crash! 
\end{DoxyWarning}


References E\+I\+N\+A\+\_\+\+M\+A\+G\+I\+C\+\_\+\+S\+E\+T, F\+U\+N\+C\+\_\+\+I\+T\+E\+R\+A\+T\+O\+R\+\_\+\+F\+R\+E\+E, F\+U\+N\+C\+\_\+\+I\+T\+E\+R\+A\+T\+O\+R\+\_\+\+G\+E\+T\+\_\+\+C\+O\+N\+T\+A\+I\+N\+E\+R, and F\+U\+N\+C\+\_\+\+I\+T\+E\+R\+A\+T\+O\+R\+\_\+\+N\+E\+X\+T.



Referenced by edje\+\_\+color\+\_\+class\+\_\+active\+\_\+iterator\+\_\+new(), edje\+\_\+external\+\_\+iterator\+\_\+get(), edje\+\_\+mmap\+\_\+color\+\_\+class\+\_\+iterator\+\_\+new(), eina\+\_\+hash\+\_\+foreach(), and eldbus\+\_\+shutdown().

\hypertarget{group__Eina__Hash__Group_ga2c23f8425d3afcc61827ab67b46d7190}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+foreach@{eina\+\_\+hash\+\_\+foreach}}
\index{eina\+\_\+hash\+\_\+foreach@{eina\+\_\+hash\+\_\+foreach}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+foreach}]{\setlength{\rightskip}{0pt plus 5cm}void eina\+\_\+hash\+\_\+foreach (
\begin{DoxyParamCaption}
\item[{const {\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{{\bf Eina\+\_\+\+Hash\+\_\+\+Foreach}}]{func, }
\item[{const void $\ast$}]{fdata}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga2c23f8425d3afcc61827ab67b46d7190}


Call a function on every member stored in the hash table. 


\begin{DoxyParams}{Parameters}
{\em hash} & The hash table whose members will be walked \\
\hline
{\em func} & The function to call on each parameter \\
\hline
{\em fdata} & The data pointer to pass to the function being called\\
\hline
\end{DoxyParams}
This function goes through every entry in the hash table {\ttfamily hash} and calls the function {\ttfamily func} on each member. The function should {\bfseries not} modify the hash table contents if it returns {\ttfamily 1}. {\bfseries If} the hash table contents are modified by this function or the function wishes to stop processing it must return {\ttfamily 0}, otherwise return {\ttfamily 1} to keep processing.

Example\+: 
\begin{DoxyCode}
1 extern Eina\_Hash *hash;
2 
3 Eina\_Bool hash\_fn(const Eina\_Hash *hash, const void *key,
4                   void *data, void *fdata)
5 \{
6   printf("Func data: %s, Hash entry: %s / %p\(\backslash\)n",
7          fdata, (const char *)key, data);
8   return 1;
9 \}
10 
11 int main(int argc, char **argv)
12 \{
13   char *hash\_fn\_data;
14 
15   hash\_fn\_data = strdup("Hello World");
16   eina\_hash\_foreach(hash, hash\_fn, hash\_fn\_data);
17   free(hash\_fn\_data);
18 \}
\end{DoxyCode}
 

References E\+I\+N\+A\+\_\+\+E\+A\+C\+H\+\_\+\+C\+B, eina\+\_\+hash\+\_\+iterator\+\_\+tuple\+\_\+new(), eina\+\_\+iterator\+\_\+foreach(), and eina\+\_\+iterator\+\_\+free().



Referenced by edje\+\_\+color\+\_\+class\+\_\+list(), and edje\+\_\+text\+\_\+class\+\_\+list().

\hypertarget{group__Eina__Hash__Group_ga7a119b7c8261a4d1026f3b7fcad13eca}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+list\+\_\+append@{eina\+\_\+hash\+\_\+list\+\_\+append}}
\index{eina\+\_\+hash\+\_\+list\+\_\+append@{eina\+\_\+hash\+\_\+list\+\_\+append}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+list\+\_\+append}]{\setlength{\rightskip}{0pt plus 5cm}void eina\+\_\+hash\+\_\+list\+\_\+append (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga7a119b7c8261a4d1026f3b7fcad13eca}


Append data to an \hyperlink{group__Eina__List__Group_ga3295e1210efea1fb0fd6acbf3cbc1f29}{Eina\+\_\+\+List} inside a hash. 

This function is identical to the sequence of calling \hyperlink{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{eina\+\_\+hash\+\_\+find()}, \hyperlink{group__Eina__List__Group_ga92ec14d1a1040a361c4d8cd0ab7b0ecc}{eina\+\_\+list\+\_\+append()}, \hyperlink{group__Eina__Hash__Group_ga53fd5f171289d63c5d8532bb28434cb3}{eina\+\_\+hash\+\_\+set()}, but with one fewer required hash lookup. 
\begin{DoxyParams}{Parameters}
{\em hash} & The hash table \\
\hline
{\em key} & The key associated with the data \\
\hline
{\em data} & The data to append to the list \\
\hline
\end{DoxyParams}
\begin{DoxySince}{Since}
1.\+10 
\end{DoxySince}


References \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::data, eina\+\_\+list\+\_\+append(), \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key, and \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key\+\_\+length.

\hypertarget{group__Eina__Hash__Group_ga7381144c09108de9fa9a8e67c281d289}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+list\+\_\+prepend@{eina\+\_\+hash\+\_\+list\+\_\+prepend}}
\index{eina\+\_\+hash\+\_\+list\+\_\+prepend@{eina\+\_\+hash\+\_\+list\+\_\+prepend}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+list\+\_\+prepend}]{\setlength{\rightskip}{0pt plus 5cm}void eina\+\_\+hash\+\_\+list\+\_\+prepend (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga7381144c09108de9fa9a8e67c281d289}


Prepend data to an \hyperlink{group__Eina__List__Group_ga3295e1210efea1fb0fd6acbf3cbc1f29}{Eina\+\_\+\+List} inside a hash. 

This function is identical to the sequence of calling \hyperlink{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{eina\+\_\+hash\+\_\+find()}, \hyperlink{group__Eina__List__Group_ga9f35bfc7c5b798014c3e0a74bc6f39ad}{eina\+\_\+list\+\_\+prepend()}, \hyperlink{group__Eina__Hash__Group_ga53fd5f171289d63c5d8532bb28434cb3}{eina\+\_\+hash\+\_\+set()}, but with one fewer required hash lookup. 
\begin{DoxyParams}{Parameters}
{\em hash} & The hash table \\
\hline
{\em key} & The key associated with the data \\
\hline
{\em data} & The data to prepend to the list \\
\hline
\end{DoxyParams}
\begin{DoxySince}{Since}
1.\+10 
\end{DoxySince}


References \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::data, eina\+\_\+list\+\_\+append(), eina\+\_\+list\+\_\+prepend(), \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key, and \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key\+\_\+length.

\hypertarget{group__Eina__Hash__Group_gabb0157184bfef0302709e2d351446e7f}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+list\+\_\+remove@{eina\+\_\+hash\+\_\+list\+\_\+remove}}
\index{eina\+\_\+hash\+\_\+list\+\_\+remove@{eina\+\_\+hash\+\_\+list\+\_\+remove}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+list\+\_\+remove}]{\setlength{\rightskip}{0pt plus 5cm}void eina\+\_\+hash\+\_\+list\+\_\+remove (
\begin{DoxyParamCaption}
\item[{{\bf Eina\+\_\+\+Hash} $\ast$}]{hash, }
\item[{const void $\ast$}]{key, }
\item[{const void $\ast$}]{data}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_gabb0157184bfef0302709e2d351446e7f}


Remove data from an \hyperlink{group__Eina__List__Group_ga3295e1210efea1fb0fd6acbf3cbc1f29}{Eina\+\_\+\+List} inside a hash. 

This function is identical to the sequence of calling \hyperlink{group__Eina__Hash__Group_ga45703d00fbabffc86e6836ffe98a4c92}{eina\+\_\+hash\+\_\+find()}, \hyperlink{group__Eina__List__Group_ga7c0c6e07aa592a1cb2e010049a718035}{eina\+\_\+list\+\_\+remove()}, \hyperlink{group__Eina__Hash__Group_ga53fd5f171289d63c5d8532bb28434cb3}{eina\+\_\+hash\+\_\+set()}, but with one fewer required hash lookup. 
\begin{DoxyParams}{Parameters}
{\em hash} & The hash table \\
\hline
{\em key} & The key associated with the data \\
\hline
{\em data} & The data to remove from the list \\
\hline
\end{DoxyParams}
\begin{DoxySince}{Since}
1.\+10 
\end{DoxySince}


References \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::data, eina\+\_\+list\+\_\+remove(), \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key, and \+\_\+\+Eina\+\_\+\+Hash\+\_\+\+Tuple\+::key\+\_\+length.

\hypertarget{group__Eina__Hash__Group_ga3a8434dd0fe7446af605c75e05e8eff0}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+superfast@{eina\+\_\+hash\+\_\+superfast}}
\index{eina\+\_\+hash\+\_\+superfast@{eina\+\_\+hash\+\_\+superfast}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+superfast}]{\setlength{\rightskip}{0pt plus 5cm}int eina\+\_\+hash\+\_\+superfast (
\begin{DoxyParamCaption}
\item[{const char $\ast$}]{key, }
\item[{int}]{len}
\end{DoxyParamCaption}
)}\label{group__Eina__Hash__Group_ga3a8434dd0fe7446af605c75e05e8eff0}


Paul Hsieh (\href{http://www.azillionmonkeys.com/qed/hash.html}{\tt http\+://www.\+azillionmonkeys.\+com/qed/hash.\+html}) hash function used by Web\+Core (\href{http://webkit.org/blog/8/hashtables-part-2/}{\tt http\+://webkit.\+org/blog/8/hashtables-\/part-\/2/}) 


\begin{DoxyParams}{Parameters}
{\em key} & The key to hash \\
\hline
{\em len} & The length of the key \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The hash value 
\end{DoxyReturn}


Referenced by eina\+\_\+hash\+\_\+string\+\_\+small\+\_\+new(), eina\+\_\+hash\+\_\+string\+\_\+superfast\+\_\+new(), and eina\+\_\+hash\+\_\+stringshared\+\_\+new().

\hypertarget{group__Eina__Hash__Group_ga558f01dbe075fb0a6c45001e57419c63}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+djb2@{eina\+\_\+hash\+\_\+djb2}}
\index{eina\+\_\+hash\+\_\+djb2@{eina\+\_\+hash\+\_\+djb2}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+djb2}]{\setlength{\rightskip}{0pt plus 5cm}static int eina\+\_\+hash\+\_\+djb2 (
\begin{DoxyParamCaption}
\item[{const char $\ast$}]{key, }
\item[{int}]{len}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [static]}}\label{group__Eina__Hash__Group_ga558f01dbe075fb0a6c45001e57419c63}


Hash function first reported by Dan Bernstein many years ago in comp.\+lang.\+c. 


\begin{DoxyParams}{Parameters}
{\em key} & The key to hash \\
\hline
{\em len} & The length of the key \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The hash value 
\end{DoxyReturn}


Referenced by eina\+\_\+file\+\_\+close(), and eina\+\_\+hash\+\_\+string\+\_\+djb2\+\_\+new().

\hypertarget{group__Eina__Hash__Group_gaa0995ca588bd9508f53f722aaa6ee9b3}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+djb2\+\_\+len@{eina\+\_\+hash\+\_\+djb2\+\_\+len}}
\index{eina\+\_\+hash\+\_\+djb2\+\_\+len@{eina\+\_\+hash\+\_\+djb2\+\_\+len}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+djb2\+\_\+len}]{\setlength{\rightskip}{0pt plus 5cm}static int eina\+\_\+hash\+\_\+djb2\+\_\+len (
\begin{DoxyParamCaption}
\item[{const char $\ast$}]{key, }
\item[{int $\ast$}]{plen}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [static]}}\label{group__Eina__Hash__Group_gaa0995ca588bd9508f53f722aaa6ee9b3}


Hash function first reported by Dan Bernstein many years ago in comp.\+lang.\+c. 


\begin{DoxyParams}{Parameters}
{\em key} & The key to hash \\
\hline
{\em plen} & The length of the key \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The hash value 
\end{DoxyReturn}
\hypertarget{group__Eina__Hash__Group_gaeceefc13a4baf86ceac4f963f221fa8b}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+int32@{eina\+\_\+hash\+\_\+int32}}
\index{eina\+\_\+hash\+\_\+int32@{eina\+\_\+hash\+\_\+int32}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+int32}]{\setlength{\rightskip}{0pt plus 5cm}static int eina\+\_\+hash\+\_\+int32 (
\begin{DoxyParamCaption}
\item[{const unsigned int $\ast$}]{pkey, }
\item[{int}]{len}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [static]}}\label{group__Eina__Hash__Group_gaeceefc13a4baf86ceac4f963f221fa8b}


Hash function from \href{http://www.concentric.net/~Ttwang/tech/inthash.htm}{\tt http\+://www.\+concentric.\+net/$\sim$\+Ttwang/tech/inthash.\+htm}. 


\begin{DoxyParams}{Parameters}
{\em pkey} & The key to hash \\
\hline
{\em len} & The length of the key \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The hash value 
\end{DoxyReturn}


Referenced by eina\+\_\+hash\+\_\+int32\+\_\+new(), and eina\+\_\+hash\+\_\+pointer\+\_\+new().

\hypertarget{group__Eina__Hash__Group_ga59af62e37bbdab2cf63f49295fd57213}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+int64@{eina\+\_\+hash\+\_\+int64}}
\index{eina\+\_\+hash\+\_\+int64@{eina\+\_\+hash\+\_\+int64}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+int64}]{\setlength{\rightskip}{0pt plus 5cm}static int eina\+\_\+hash\+\_\+int64 (
\begin{DoxyParamCaption}
\item[{const unsigned long long int $\ast$}]{pkey, }
\item[{int}]{len}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [static]}}\label{group__Eina__Hash__Group_ga59af62e37bbdab2cf63f49295fd57213}


Hash function from \href{http://www.concentric.net/~Ttwang/tech/inthash.htm}{\tt http\+://www.\+concentric.\+net/$\sim$\+Ttwang/tech/inthash.\+htm}. 


\begin{DoxyParams}{Parameters}
{\em pkey} & The key to hash \\
\hline
{\em len} & The length of the key \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The hash value 
\end{DoxyReturn}


Referenced by eina\+\_\+file\+\_\+map\+\_\+key\+\_\+hash(), eina\+\_\+hash\+\_\+int64\+\_\+new(), and eina\+\_\+hash\+\_\+pointer\+\_\+new().

\hypertarget{group__Eina__Hash__Group_ga66870993e96429900f8ceeadd6f2cadf}{}\index{Hash Table@{Hash Table}!eina\+\_\+hash\+\_\+murmur3@{eina\+\_\+hash\+\_\+murmur3}}
\index{eina\+\_\+hash\+\_\+murmur3@{eina\+\_\+hash\+\_\+murmur3}!Hash Table@{Hash Table}}
\subsubsection[{eina\+\_\+hash\+\_\+murmur3}]{\setlength{\rightskip}{0pt plus 5cm}static int eina\+\_\+hash\+\_\+murmur3 (
\begin{DoxyParamCaption}
\item[{const char $\ast$}]{key, }
\item[{int}]{len}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [static]}}\label{group__Eina__Hash__Group_ga66870993e96429900f8ceeadd6f2cadf}


Hash function from \href{http://sites.google.com/site/murmurhash/}{\tt http\+://sites.\+google.\+com/site/murmurhash/}. 


\begin{DoxyParams}{Parameters}
{\em key} & The key to hash \\
\hline
{\em len} & The length of the key \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The hash value 
\end{DoxyReturn}
