6da879de22
include/ 2005-03-27 Gabriel Dos Reis <gdr@integrable-solutions.net> * md5.h: Remove definition and uses of __P. * dyn-string.h: Remove uses of PARAMS. * fibheap.h: Likewise. * floatformat.h: Likewise. * hashtab.h: Likewise. libiberty/ 2005-03-27 Gabriel Dos Reis <gdr@integrable-solutions.net> Convert libiberty to use ISO C prototype style 4/n. * hashtab.c (higher_prime_index, hash_pointer, eq_pointer, htab_size, htab_elements, htab_mod_1, htab_mod, htab_mod_m2, htab_create_alloc, htab_set_functions_ex, htab_create, htab_try_create, htab_delete, htab_empty, find_empty_slot_for_expand, htab_expand, htab_find_with_hash, htab_find, htab_find_slot_with_hash, htab_find_slot, htab_remove_elt, htab_remove_elt_with_hash, htab_clear_slot, htab_traverse_noresize, htab_traverse, htab_collisions, htab_hash_string, iterative_hash): Use ISO C prototype. * hex.c (hex_init): Likewise. * index.c (index): Likewise. * insque.c (insque, remque): Likewise. * lbasename.c (lbasename): Likewise. * lrealpath.c (lrealpath): Likewise. * make-relative-prefix.c (save_string, split_directories, free_split_directories, make_relative_prefix): Likewise. * make-temp-file.c (try, choose_tmpdir, make_temp_file): Likewise. * md5.c (md5_init_ctx, md5_read_ctx, md5_finish_ctx, md5_stream, md5_buffer, md5_process_bytes, md5_process_block): Likewise. * memchr.c (memchr): Likewise. * memcpy.c (memcpy): Likewise. * memmove.c (memmove): Likewise. * gettimeofday.c (gettimeofday): Likewise. * getruntime.c (get_run_time): Likewise. * getpwd.c (getpwd, getpwd): Likewise. * getpagesize.c (getpagesize): Likewise. * getopt1.c (getopt_long, getopt_long_only, main): Likewise. * getopt.c (my_index, exchange, _getopt_initialize, _getopt_internal, getopt, main): Likewise. * getcwd.c (getcwd): Likewise. * fnmatch.c (fnmatch): Likewise. * floatformat.c (floatformat_always_valid, floatformat_i387_ext_is_valid, get_field, floatformat_to_double, put_field, floatformat_from_double, floatformat_is_valid, ieee_test, main): Likewise. * fibheap.c (fibheap_new, fibnode_new, fibheap_compare, fibheap_comp_data, fibheap_insert, fibheap_min, fibheap_min_key, fibheap_union, fibheap_extract_min, fibheap_replace_key_data, fibheap_replace_key, fibheap_replace_data, fibheap_delete_node, fibheap_delete, fibheap_empty, fibheap_extr_min_node, fibheap_ins_root, fibheap_rem_root, fibheap_consolidate, fibheap_link, fibheap_cut, fibheap_cascading_cut, fibnode_insert_after, fibnode_remove): Likewise. * ffs.c (ffs): Likewise. * fdmatch.c (fdmatch): Likewise. * dyn-string.c (dyn_string_init, dyn_string_new, dyn_string_delete, dyn_string_release, dyn_string_resize, dyn_string_clear, dyn_string_copy, dyn_string_copy_cstr, dyn_string_prepend, dyn_string_prepend_cstr, dyn_string_insert, dyn_string_insert_cstr, dyn_string_insert_char, dyn_string_append, dyn_string_append_cstr, dyn_string_append_char, dyn_string_substring, dyn_string_eq): Likewise. From-SVN: r97113
87 lines
2.8 KiB
C
87 lines
2.8 KiB
C
/* A Fibonacci heap datatype.
|
|
Copyright 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
|
|
Contributed by Daniel Berlin (dan@cgsoftware.com).
|
|
|
|
This file is part of GCC.
|
|
|
|
GCC 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, or (at your option)
|
|
any later version.
|
|
|
|
GCC 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 GCC; see the file COPYING. If not, write to
|
|
the Free Software Foundation, 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
/* Fibonacci heaps are somewhat complex, but, there's an article in
|
|
DDJ that explains them pretty well:
|
|
|
|
http://www.ddj.com/articles/1997/9701/9701o/9701o.htm?topic=algoritms
|
|
|
|
Introduction to algorithms by Corman and Rivest also goes over them.
|
|
|
|
The original paper that introduced them is "Fibonacci heaps and their
|
|
uses in improved network optimization algorithms" by Tarjan and
|
|
Fredman (JACM 34(3), July 1987).
|
|
|
|
Amortized and real worst case time for operations:
|
|
|
|
ExtractMin: O(lg n) amortized. O(n) worst case.
|
|
DecreaseKey: O(1) amortized. O(lg n) worst case.
|
|
Insert: O(2) amortized. O(1) actual.
|
|
Union: O(1) amortized. O(1) actual. */
|
|
|
|
#ifndef _FIBHEAP_H_
|
|
#define _FIBHEAP_H_
|
|
|
|
#include "ansidecl.h"
|
|
|
|
typedef long fibheapkey_t;
|
|
|
|
typedef struct fibheap
|
|
{
|
|
size_t nodes;
|
|
struct fibnode *min;
|
|
struct fibnode *root;
|
|
} *fibheap_t;
|
|
|
|
typedef struct fibnode
|
|
{
|
|
struct fibnode *parent;
|
|
struct fibnode *child;
|
|
struct fibnode *left;
|
|
struct fibnode *right;
|
|
fibheapkey_t key;
|
|
void *data;
|
|
#if defined (__GNUC__) && (!defined (SIZEOF_INT) || SIZEOF_INT < 4)
|
|
__extension__ unsigned long int degree : 31;
|
|
__extension__ unsigned long int mark : 1;
|
|
#else
|
|
unsigned int degree : 31;
|
|
unsigned int mark : 1;
|
|
#endif
|
|
} *fibnode_t;
|
|
|
|
extern fibheap_t fibheap_new (void);
|
|
extern fibnode_t fibheap_insert (fibheap_t, fibheapkey_t, void *);
|
|
extern int fibheap_empty (fibheap_t);
|
|
extern fibheapkey_t fibheap_min_key (fibheap_t);
|
|
extern fibheapkey_t fibheap_replace_key (fibheap_t, fibnode_t,
|
|
fibheapkey_t);
|
|
extern void *fibheap_replace_key_data (fibheap_t, fibnode_t,
|
|
fibheapkey_t, void *);
|
|
extern void *fibheap_extract_min (fibheap_t);
|
|
extern void *fibheap_min (fibheap_t);
|
|
extern void *fibheap_replace_data (fibheap_t, fibnode_t, void *);
|
|
extern void *fibheap_delete_node (fibheap_t, fibnode_t);
|
|
extern void fibheap_delete (fibheap_t);
|
|
extern fibheap_t fibheap_union (fibheap_t, fibheap_t);
|
|
|
|
#endif /* _FIBHEAP_H_ */
|