diff options
| author | Mukund Sivaraman <muks@banu.com> | 2008-05-24 13:35:49 +0530 |
|---|---|---|
| committer | Mukund Sivaraman <muks@banu.com> | 2008-05-24 13:35:49 +0530 |
| commit | 249d4b7f3355236e1e1490d2cffe6eccb95d1a42 (patch) | |
| tree | f86eec687b9363467a53915fcab4e741b157baae /src/hashmap.c | |
| parent | b441485b5e869cef1b1edd043decec8f0bd7eb00 (diff) | |
| download | tinyproxy-249d4b7f3355236e1e1490d2cffe6eccb95d1a42.tar.gz tinyproxy-249d4b7f3355236e1e1490d2cffe6eccb95d1a42.zip | |
Updated copyright, license notices in source code
The notices have been changed to a more GNU look. Documentation
comments have been separated from the copyright header. I've tried to
keep all copyright notices intact. Some author contact details have
been updated.
Diffstat (limited to '')
| -rw-r--r-- | src/hashmap.c | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/src/hashmap.c b/src/hashmap.c index c060c60..6185dcf 100644 --- a/src/hashmap.c +++ b/src/hashmap.c @@ -1,14 +1,5 @@ -/* $Id: hashmap.c,v 1.17 2005-08-15 03:54:31 rjkaes Exp $ - * - * A hashmap implementation. The keys are case-insensitive NULL terminated - * strings, and the data is arbitrary lumps of data. Copies of both the - * key and the data in the hashmap itself, so you must free the original - * key and data to avoid a memory leak. The hashmap returns a pointer - * to the data when a key is searched for, so take care in modifying the - * data as it's modifying the data stored in the hashmap. (In other words, - * don't try to free the data, or realloc the memory. :) - * - * Copyright (C) 2002 Robert James Kaes (rjkaes@users.sourceforge.net) +/* tinyproxy - A fast light-weight HTTP proxy + * Copyright (C) 2002 Robert James Kaes <rjkaes@users.sourceforge.net> * * 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 @@ -20,9 +11,18 @@ * 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-1307 USA + * 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. + */ + +/* A hashmap implementation. The keys are case-insensitive NULL terminated + * strings, and the data is arbitrary lumps of data. Copies of both the + * key and the data in the hashmap itself, so you must free the original + * key and data to avoid a memory leak. The hashmap returns a pointer + * to the data when a key is searched for, so take care in modifying the + * data as it's modifying the data stored in the hashmap. (In other words, + * don't try to free the data, or realloc the memory. :) */ #include "tinyproxy.h" @@ -377,7 +377,7 @@ hashmap_return_entry(hashmap_t map, hashmap_iter iter, char **key, void **data) /* * Searches for _any_ occurrences of "key" within the hashmap. - * + * * Returns: negative upon an error * zero if no key is found * count found |