X-Git-Url: http://git.madism.org/?p=apps%2Fmadmutt.git;a=blobdiff_plain;f=hash.h;h=2e3f98de28837fddad4cf2ec704edac0c51785bf;hp=d91c264d55bd5496aff5cabe21417df5fa0e02e8;hb=21595f98b7c8132f99abb9fee60ecdce31fc980f;hpb=df70e07e24add1869bcc9b7af2277d9d0c09a281

diff --git a/hash.h b/hash.h
index d91c264..2e3f98d 100644
--- a/hash.h
+++ b/hash.h
@@ -1,46 +1,43 @@
 /*
+ * Copyright notice from original mutt:
  * Copyright (C) 1996-2000 Michael R. Elkins <me@mutt.org>
  *
- *     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; either version 2 of the License, or
- *     (at your option) any later version.
- * 
- *     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., 59 Temple Place - Suite 330, Boston, MA  02111, USA.
+ * This file is part of mutt-ng, see http://www.muttng.org/.
+ * It's licensed under the GNU General Public License,
+ * please see the file GPL in the top level source directory.
  */
 
 #ifndef _HASH_H
 #define _HASH_H
 
 struct hash_elem {
-  const char *key;
-  void *data;
-  struct hash_elem *next;
+    const char *key;
+    void *data;
+    struct hash_elem *next;
 };
 
 typedef struct {
-  int nelem, curnelem;
-  struct hash_elem **table;
+    int nelem, curnelem;
+    struct hash_elem **table;
 } HASH;
 
-#define hash_find(table, key) hash_find_hash(table, hash_string ((unsigned char *)key, table->nelem), key)
+#define hash_find(table, key) \
+    hash_find_hash(table, hash_string((unsigned char *)key, table->nelem), key)
 
-#define hash_delete(table,key,data,destroy) hash_delete_hash(table, hash_string ((unsigned char *)key, table->nelem), key, data, destroy)
+#define hash_delete(table,key,data,destroy) \
+    hash_delete_hash(table, hash_string((unsigned char *)key, table->nelem), key, data, destroy)
 
-HASH *hash_create (int nelem);
-int hash_string (const unsigned char *s, int n);
-int hash_insert (HASH * table, const char *key, void *data, int allow_dup);
-HASH *hash_resize (HASH * table, int nelem);
-void *hash_find_hash (const HASH * table, int hash, const char *key);
-void hash_delete_hash (HASH * table, int hash, const char *key,
-                       const void *data, void (*destroy) (void *));
-void hash_destroy (HASH ** hash, void (*destroy) (void *));
+HASH *hash_create(int nelem);
+int hash_string(const unsigned char *s, int n);
+int hash_insert(HASH * table, const char *key, void *data, int allow_dup);
+HASH *hash_resize(HASH * table, int nelem);
+void *hash_find_hash(const HASH *table, int hash, const char *key);
+void hash_delete_hash(HASH * table, int hash, const char *key,
+                      const void *data, void (*destroy) (void *));
+void hash_destroy(HASH ** hash, void (*destroy) (void *));
+
+void hash_map(HASH* table,
+              void (*mapfunc) (const char* key, void* data, unsigned long more),
+              unsigned long more);
 
 #endif