Mercurial > hg > xemacs-beta
view netinstall/hash.cc @ 1701:a1e328407366
[xemacs-hg @ 2003-09-20 01:14:24 by youngs]
2003-09-20 James LewisMoss <dres@lewismoss.org>
* console-impl.h (struct console_methods): add third arg to list_fonts
* objects.c (Flist_fonts): Add third arg to list-fonts: maxnumber
* objects-gtk.c (gtk_list_fonts): Add third (ignored) arg for
maxnumber.
* objects-msw.c (mswindows_list_fonts): Add third (ignored) arg for
maxnumber.
* objects-tty.c (tty_list_fonts): Add third (ignored) arg for
maxnumber.
* objects-x.c (x_list_fonts): Add third arg to specify the maximum
fonts recieved from the server.
2003-09-20 James LewisMoss <dres@lewismoss.org>
* font-menu.el (font-menu-max-number): New variable to specify
the maximum recieved fonts.
* x-font-menu.el (x-reset-device-font-menus): Use new variable
(font-menu-max-number) to list-fonts.
author | youngs |
---|---|
date | Sat, 20 Sep 2003 01:14:30 +0000 |
parents | 3078fd1074e8 |
children |
line wrap: on
line source
/* * Copyright (c) 2000, Red Hat, Inc. * * 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. * * A copy of the GNU General Public License can be found at * http://www.gnu.org/ * * Written by DJ Delorie <dj@cygnus.com> * */ /* Simple hash class for install.cc */ #include "win32.h" #include <stdlib.h> #include <string.h> #include "hash.h" class hash_internals { public: char **keys; int numkeys; int maxkeys; int prev_index; }; hash::hash () { h = new hash_internals; h->numkeys = 0; h->maxkeys = 10; h->keys = (char **) malloc (h->maxkeys * sizeof (char *)); h->prev_index = 0; } hash::~hash () { free (h->keys); free (h); } void hash::add (char *string) { int i; for (i=0; i<h->numkeys; i++) if (strcmp (h->keys[i], string) == 0) return; if (h->numkeys >= h->maxkeys) { h->maxkeys += 10; h->keys = (char **) realloc (h->keys, h->maxkeys * sizeof (char *)); } h->keys[h->numkeys] = _strdup (string); h->numkeys ++; } int hash::has (char *string) { int i; for (i=0; i<h->numkeys; i++) if (strcmp (h->keys[i], string) == 0) return 1; return 0; } char * hash::enumerate (char *prev) { if (prev == 0) h->prev_index = -1; h->prev_index ++; if (h->prev_index >= h->numkeys) return 0; return h->keys[h->prev_index]; } static int CDECL rev_len (const void *va, const void *vb) { char *a = *(char **)va; char *b = *(char **)vb; return strcmp (b, a); } void hash::reverse_sort () { qsort (h->keys, h->numkeys, sizeof (h->keys[0]), rev_len); }