Glossygloss
0.2
Glossygloss is set of classes to use several data structure as Tree or hash table.
|
Go to the source code of this file.
Classes | |
class | Dictionnaire |
Functions | |
bool | triPair (const pair< string, int > &first, const pair< string, int > &second) |
template<> | |
unsigned | computehash< string > (string element) |
Dictionnaire utilisant une Hashtable
This source code is protected by the French intellectual property law.
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; version 2 of the License.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
$Date$ 2014/03/27 $Rev$ 0.2 $Author$ Benjamin Sientzoff & François Hallereau $URL$ http://www.github.com/blasterbug
unsigned computehash< string > | ( | string | element | ) |
Fonction pour calculer les clés de hashage de string
bool triPair | ( | const pair< string, int > & | first, |
const pair< string, int > & | second | ||
) |
Fonction qui permet de trier un container de pairs construit avec des strings et des entiers. Le critère de tri est l'ordre naturel sur les entiers appliqué à l'entier de la pair.
[in] | first | la première pair à comparer |
[in] | second | la seconde pair à comparer |
[out] | bool | vrai si first>seconde sinon faux |