mirror of
https://git.savannah.gnu.org/git/guile.git
synced 2025-05-29 00:10:21 +02:00
(SCM_NUM2{SIZE,PTRDIFF,SHORT,USHORT,BITS,UBITS,INT,UINT}[_DEF]): new macros. * unif.h: type renaming: scm_array -> scm_array_t scm_array_dim -> scm_array_dim_t the old names are deprecated, all in-Guile uses changed. * tags.h (scm_ubits_t): new typedef, representing unsigned scm_bits_t. * stacks.h: type renaming: scm_info_frame -> scm_info_frame_t scm_stack -> scm_stack_t the old names are deprecated, all in-Guile uses changed. * srcprop.h: type renaming: scm_srcprops -> scm_srcprops_t scm_srcprops_chunk -> scm_srcprops_chunk_t the old names are deprecated, all in-Guile uses changed. * gsubr.c, procs.c, print.c, ports.c, read.c, rdelim.c, ramap.c, rw.c, smob.c, sort.c, srcprop.c, stacks.c, strings.c, strop.c, strorder.c, strports.c, struct.c, symbols.c, unif.c, values.c, vectors.c, vports.c, weaks.c: various int/size_t -> size_t/scm_bits_t changes. * random.h: type renaming: scm_rstate -> scm_rstate_t scm_rng -> scm_rng_t scm_i_rstate -> scm_i_rstate_t the old names are deprecated, all in-Guile uses changed. * procs.h: type renaming: scm_subr_entry -> scm_subr_entry_t the old name is deprecated, all in-Guile uses changed. * options.h (scm_option_t.val): unsigned long -> scm_bits_t. type renaming: scm_option -> scm_option_t the old name is deprecated, all in-Guile uses changed. * objects.c: various long -> scm_bits_t changes. (scm_i_make_class_object): flags: unsigned long -> scm_ubits_t * numbers.h (SCM_FIXNUM_BIT): deprecated, renamed to SCM_I_FIXNUM_BIT. * num2integral.i.c: new file, multiply included by numbers.c, used to "templatize" the various integral <-> num conversion routines. * numbers.c (scm_mkbig, scm_big2num, scm_adjbig, scm_normbig, scm_copybig, scm_2ulong2big, scm_dbl2big, scm_big2dbl): deprecated. (scm_i_mkbig, scm_i_big2inum, scm_i_adjbig, scm_i_normbig, scm_i_copybig, scm_i_short2big, scm_i_ushort2big, scm_i_int2big, scm_i_uint2big, scm_i_long2big, scm_i_ulong2big, scm_i_bits2big, scm_i_ubits2big, scm_i_size2big, scm_i_ptrdiff2big, scm_i_long_long2big, scm_i_ulong_long2big, scm_i_dbl2big, scm_i_big2dbl, scm_short2num, scm_ushort2num, scm_int2num, scm_uint2num, scm_bits2num, scm_ubits2num, scm_size2num, scm_ptrdiff2num, scm_num2short, scm_num2ushort, scm_num2int, scm_num2uint, scm_num2bits, scm_num2ubits, scm_num2ptrdiff, scm_num2size): new functions. * modules.c (scm_module_reverse_lookup): i, n: int -> scm_bits_t.x * load.c: change int -> size_t in various places (where the variable is used to store a string length). (search-path): call scm_done_free, not scm_done_malloc. * list.c (scm_ilength): return a scm_bits_t, not long. some other {int,long} -> scm_bits_t changes. * hashtab.c: various [u]int -> scm_bits_t changes. scm_ihashx_closure -> scm_ihashx_closure_t (and made a typedef). (scm_ihashx): n: uint -> scm_bits_t use scm_bits2num instead of scm_ulong2num. * gsubr.c: various int -> scm_bits_t changes. * gh_data.c (gh_scm2double): no loss of precision any more. * gh.h (gh_str2scm): len: int -> size_t (gh_{get,set}_substr): start: int -> scm_bits_t, len: int -> size_t (gh_<num>2scm): n: int -> scm_bits_t (gh_*vector_length): return scm_[u]size_t, not unsigned long. (gh_length): return scm_bits_t, not unsigned long. * fports.h: type renaming: scm_fport -> scm_fport_t the old name is deprecated, all in-Guile uses changed. * fports.c (fport_fill_input): count: int -> scm_bits_t (fport_flush): init_size, remaining, count: int -> scm_bits_t * debug.h (scm_lookup_cstr, scm_lookup_soft, scm_evstr): removed those prototypes, as the functions they prototype don't exist. * fports.c (default_buffer_size): int -> size_t (scm_fport_buffer_add): read_size, write_size: int -> scm_bits_t default_size: int -> size_t (scm_setvbuf): csize: int -> scm_bits_t * fluids.c (n_fluids): int -> scm_bits_t (grow_fluids): old_length, i: int -> scm_bits_t (next_fluid_num, scm_fluid_ref, scm_fluid_set_x): n: int -> scm_bits_t (scm_c_with_fluids): flen, vlen: int -> scm_bits_t * filesys.c (s_scm_open_fdes): changed calls to SCM_NUM2LONG to the new and shiny SCM_NUM2INT. * extensions.c: extension -> extension_t (and made a typedef). * eval.h (SCM_IFRAME): cast to scm_bits_t, not int. just so there are no nasty surprises if/when the various deeply magic tag bits move somewhere else. * eval.c: changed the locals used to store results of SCM_IFRAME, scm_ilength and such to be of type scm_bits_t (and not int/long). (iqq): depth, edepth: int -> scm_bits_t (scm_eval_stack): int -> scm_bits_t (SCM_CEVAL): various vars are not scm_bits_t instead of int. (check_map_args, scm_map, scm_for_each): len: long -> scm_bits_t i: int -> scm_bits_t * environments.c: changed the many calls to scm_ulong2num to scm_ubits2num. (import_environment_fold): proc_as_ul: ulong -> scm_ubits_t * dynwind.c (scm_dowinds): delta: long -> scm_bits_t * debug.h: type renaming: scm_debug_info -> scm_debug_info_t scm_debug_frame -> scm_debug_frame_t the old names are deprecated, all in-Guile uses changed. (scm_debug_eframe_size): int -> scm_bits_t * debug.c (scm_init_debug): use scm_c_define instead of the deprecated scm_define. * continuations.h: type renaming: scm_contregs -> scm_contregs_t the old name is deprecated, all in-Guile uses changed. (scm_contregs_t.num_stack_items): size_t -> scm_bits_t (scm_contregs_t.num_stack_items): ulong -> scm_ubits_t * continuations.c (scm_make_continuation): change the type of stack_size form long to scm_bits_t. * ports.h: type renaming: scm_port_rw_active -> scm_port_rw_active_t (and made a typedef) scm_port -> scm_port_t scm_ptob_descriptor -> scm_ptob_descriptor_t the old names are deprecated, all in-Guile uses changed. (scm_port_t.entry): int -> scm_bits_t. (scm_port_t.line_number): int -> long. (scm_port_t.putback_buf_size): int -> size_t. * __scm.h (long_long, ulong_long): deprecated (they pollute the global namespace and have little value besides that). (SCM_BITS_LENGTH): new, is the bit size of scm_bits_t (i.e. of an SCM handle). (ifdef spaghetti): include sys/types.h and sys/stdtypes.h, if they exist (for size_t & ptrdiff_t) (scm_sizet): deprecated. * Makefile.am (noinst_HEADERS): add num2integral.i.c
592 lines
18 KiB
C
592 lines
18 KiB
C
/* Copyright (C) 1995,1996,1998,1999,2000,2001 Free Software Foundation, 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, 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 software; see the file COPYING. If not, write to
|
||
* the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
|
||
* Boston, MA 02111-1307 USA
|
||
*
|
||
* As a special exception, the Free Software Foundation gives permission
|
||
* for additional uses of the text contained in its release of GUILE.
|
||
*
|
||
* The exception is that, if you link the GUILE library with other files
|
||
* to produce an executable, this does not by itself cause the
|
||
* resulting executable to be covered by the GNU General Public License.
|
||
* Your use of that executable is in no way restricted on account of
|
||
* linking the GUILE library code into it.
|
||
*
|
||
* This exception does not however invalidate any other reasons why
|
||
* the executable file might be covered by the GNU General Public License.
|
||
*
|
||
* This exception applies only to the code released by the
|
||
* Free Software Foundation under the name GUILE. If you copy
|
||
* code from other Free Software Foundation releases into a copy of
|
||
* GUILE, as the General Public License permits, the exception does
|
||
* not apply to the code that you add in this way. To avoid misleading
|
||
* anyone as to the status of such modified files, you must delete
|
||
* this exception notice from them.
|
||
*
|
||
* If you write modifications of your own for GUILE, it is your choice
|
||
* whether to permit this exception to apply to your modifications.
|
||
* If you do not wish that, delete this exception notice. */
|
||
|
||
/* Software engineering face-lift by Greg J. Badros, 11-Dec-1999,
|
||
gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */
|
||
|
||
|
||
|
||
#include "libguile/_scm.h"
|
||
#include "libguile/alist.h"
|
||
#include "libguile/hash.h"
|
||
#include "libguile/eval.h"
|
||
#include "libguile/vectors.h"
|
||
|
||
#include "libguile/validate.h"
|
||
#include "libguile/hashtab.h"
|
||
|
||
|
||
SCM
|
||
scm_c_make_hash_table (scm_bits_t k)
|
||
{
|
||
return scm_c_make_vector (k, SCM_EOL);
|
||
}
|
||
|
||
|
||
SCM
|
||
scm_hash_fn_get_handle (SCM table, SCM obj,
|
||
scm_bits_t (*hash_fn) (),
|
||
SCM (*assoc_fn) (),
|
||
void *closure)
|
||
#define FUNC_NAME "scm_hash_fn_get_handle"
|
||
{
|
||
scm_bits_t k;
|
||
SCM h;
|
||
|
||
SCM_VALIDATE_VECTOR (1, table);
|
||
if (SCM_VECTOR_LENGTH (table) == 0)
|
||
return SCM_BOOL_F;
|
||
k = hash_fn (obj, SCM_VECTOR_LENGTH (table), closure);
|
||
if (k >= SCM_VECTOR_LENGTH (table))
|
||
scm_out_of_range ("hash_fn_get_handle", scm_ulong2num (k));
|
||
h = assoc_fn (obj, SCM_VELTS (table)[k], closure);
|
||
return h;
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM
|
||
scm_hash_fn_create_handle_x (SCM table, SCM obj, SCM init,
|
||
scm_bits_t (*hash_fn) (),
|
||
SCM (*assoc_fn) (),
|
||
void *closure)
|
||
#define FUNC_NAME "scm_hash_fn_create_handle_x"
|
||
{
|
||
scm_bits_t k;
|
||
SCM it;
|
||
|
||
SCM_ASSERT (SCM_VECTORP (table), table, SCM_ARG1, "hash_fn_create_handle_x");
|
||
if (SCM_VECTOR_LENGTH (table) == 0)
|
||
SCM_MISC_ERROR ("void hashtable", SCM_EOL);
|
||
|
||
k = hash_fn (obj, SCM_VECTOR_LENGTH (table), closure);
|
||
if (k >= SCM_VECTOR_LENGTH (table))
|
||
scm_out_of_range ("hash_fn_create_handle_x", scm_ulong2num (k));
|
||
SCM_REDEFER_INTS;
|
||
it = assoc_fn (obj, SCM_VELTS (table)[k], closure);
|
||
if (SCM_NIMP (it))
|
||
{
|
||
SCM_REALLOW_INTS;
|
||
return it;
|
||
}
|
||
{
|
||
SCM new_bucket;
|
||
SCM old_bucket;
|
||
old_bucket = SCM_VELTS (table)[k];
|
||
new_bucket = scm_acons (obj, init, old_bucket);
|
||
SCM_VELTS(table)[k] = new_bucket;
|
||
SCM_REALLOW_INTS;
|
||
return SCM_CAR (new_bucket);
|
||
}
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM
|
||
scm_hash_fn_ref (SCM table, SCM obj, SCM dflt,
|
||
scm_bits_t (*hash_fn) (),
|
||
SCM (*assoc_fn) (),
|
||
void *closure)
|
||
{
|
||
SCM it = scm_hash_fn_get_handle (table, obj, hash_fn, assoc_fn, closure);
|
||
if (SCM_CONSP (it))
|
||
return SCM_CDR (it);
|
||
else
|
||
return dflt;
|
||
}
|
||
|
||
|
||
|
||
|
||
SCM
|
||
scm_hash_fn_set_x (SCM table, SCM obj, SCM val,
|
||
scm_bits_t (*hash_fn) (),
|
||
SCM (*assoc_fn) (),
|
||
void * closure)
|
||
{
|
||
SCM it;
|
||
|
||
it = scm_hash_fn_create_handle_x (table, obj, SCM_BOOL_F, hash_fn, assoc_fn, closure);
|
||
SCM_SETCDR (it, val);
|
||
return val;
|
||
}
|
||
|
||
|
||
|
||
|
||
|
||
SCM
|
||
scm_hash_fn_remove_x (SCM table, SCM obj,
|
||
scm_bits_t (*hash_fn) (),
|
||
SCM (*assoc_fn) (),
|
||
SCM (*delete_fn) (),
|
||
void *closure)
|
||
{
|
||
scm_bits_t k;
|
||
SCM h;
|
||
|
||
SCM_ASSERT (SCM_VECTORP (table), table, SCM_ARG1, "hash_fn_remove_x");
|
||
if (SCM_VECTOR_LENGTH (table) == 0)
|
||
return SCM_EOL;
|
||
k = hash_fn (obj, SCM_VECTOR_LENGTH (table), closure);
|
||
if (k >= SCM_VECTOR_LENGTH (table))
|
||
scm_out_of_range ("hash_fn_remove_x", scm_ulong2num (k));
|
||
h = assoc_fn (obj, SCM_VELTS (table)[k], closure);
|
||
SCM_VELTS(table)[k] = delete_fn (h, SCM_VELTS(table)[k]);
|
||
return h;
|
||
}
|
||
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hashq_get_handle, "hashq-get-handle", 2, 0, 0,
|
||
(SCM table, SCM key),
|
||
"This procedure returns the @code{(key . value)} pair from the\n"
|
||
"hash table @var{table}. If @var{table} does not hold an\n"
|
||
"associated value for @var{key}, @code{#f} is returned.\n"
|
||
"Uses @code{eq?} for equality testing.")
|
||
#define FUNC_NAME s_scm_hashq_get_handle
|
||
{
|
||
return scm_hash_fn_get_handle (table, key, scm_ihashq, scm_sloppy_assq, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM_DEFINE (scm_hashq_create_handle_x, "hashq-create-handle!", 3, 0, 0,
|
||
(SCM table, SCM key, SCM init),
|
||
"This function looks up @var{key} in @var{table} and returns its handle.\n"
|
||
"If @var{key} is not already present, a new handle is created which\n"
|
||
"associates @var{key} with @var{init}.")
|
||
#define FUNC_NAME s_scm_hashq_create_handle_x
|
||
{
|
||
return scm_hash_fn_create_handle_x (table, key, init, scm_ihashq, scm_sloppy_assq, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM_DEFINE (scm_hashq_ref, "hashq-ref", 2, 1, 0,
|
||
(SCM table, SCM key, SCM dflt),
|
||
"Look up @var{key} in the hash table @var{table}, and return the\n"
|
||
"value (if any) associated with it. If @var{key} is not found,\n"
|
||
"return @var{default} (or @code{#f} if no @var{default} argument\n"
|
||
"is supplied). Uses @code{eq?} for equality testing.")
|
||
#define FUNC_NAME s_scm_hashq_ref
|
||
{
|
||
if (SCM_UNBNDP (dflt))
|
||
dflt = SCM_BOOL_F;
|
||
return scm_hash_fn_ref (table, key, dflt, scm_ihashq, scm_sloppy_assq, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hashq_set_x, "hashq-set!", 3, 0, 0,
|
||
(SCM table, SCM key, SCM val),
|
||
"Find the entry in @var{table} associated with @var{key}, and\n"
|
||
"store @var{value} there. Uses @code{eq?} for equality testing.")
|
||
#define FUNC_NAME s_scm_hashq_set_x
|
||
{
|
||
return scm_hash_fn_set_x (table, key, val, scm_ihashq, scm_sloppy_assq, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hashq_remove_x, "hashq-remove!", 2, 0, 0,
|
||
(SCM table, SCM key),
|
||
"Remove @var{key} (and any value associated with it) from\n"
|
||
"@var{table}. Uses @code{eq?} for equality tests.")
|
||
#define FUNC_NAME s_scm_hashq_remove_x
|
||
{
|
||
return scm_hash_fn_remove_x (table, key, scm_ihashq, scm_sloppy_assq,
|
||
scm_delq_x, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hashv_get_handle, "hashv-get-handle", 2, 0, 0,
|
||
(SCM table, SCM key),
|
||
"This procedure returns the @code{(key . value)} pair from the\n"
|
||
"hash table @var{table}. If @var{table} does not hold an\n"
|
||
"associated value for @var{key}, @code{#f} is returned.\n"
|
||
"Uses @code{eqv?} for equality testing.")
|
||
#define FUNC_NAME s_scm_hashv_get_handle
|
||
{
|
||
return scm_hash_fn_get_handle (table, key, scm_ihashv, scm_sloppy_assv, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM_DEFINE (scm_hashv_create_handle_x, "hashv-create-handle!", 3, 0, 0,
|
||
(SCM table, SCM key, SCM init),
|
||
"This function looks up @var{key} in @var{table} and returns its handle.\n"
|
||
"If @var{key} is not already present, a new handle is created which\n"
|
||
"associates @var{key} with @var{init}.")
|
||
#define FUNC_NAME s_scm_hashv_create_handle_x
|
||
{
|
||
return scm_hash_fn_create_handle_x (table, key, init, scm_ihashv,
|
||
scm_sloppy_assv, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM_DEFINE (scm_hashv_ref, "hashv-ref", 2, 1, 0,
|
||
(SCM table, SCM key, SCM dflt),
|
||
"Look up @var{key} in the hash table @var{table}, and return the\n"
|
||
"value (if any) associated with it. If @var{key} is not found,\n"
|
||
"return @var{default} (or @code{#f} if no @var{default} argument\n"
|
||
"is supplied). Uses @code{eqv?} for equality testing.")
|
||
#define FUNC_NAME s_scm_hashv_ref
|
||
{
|
||
if (SCM_UNBNDP (dflt))
|
||
dflt = SCM_BOOL_F;
|
||
return scm_hash_fn_ref (table, key, dflt, scm_ihashv, scm_sloppy_assv, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hashv_set_x, "hashv-set!", 3, 0, 0,
|
||
(SCM table, SCM key, SCM val),
|
||
"Find the entry in @var{table} associated with @var{key}, and\n"
|
||
"store @var{value} there. Uses @code{eqv?} for equality testing.")
|
||
#define FUNC_NAME s_scm_hashv_set_x
|
||
{
|
||
return scm_hash_fn_set_x (table, key, val, scm_ihashv, scm_sloppy_assv, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM_DEFINE (scm_hashv_remove_x, "hashv-remove!", 2, 0, 0,
|
||
(SCM table, SCM key),
|
||
"Remove @var{key} (and any value associated with it) from\n"
|
||
"@var{table}. Uses @code{eqv?} for equality tests.")
|
||
#define FUNC_NAME s_scm_hashv_remove_x
|
||
{
|
||
return scm_hash_fn_remove_x (table, key, scm_ihashv, scm_sloppy_assv,
|
||
scm_delv_x, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hash_get_handle, "hash-get-handle", 2, 0, 0,
|
||
(SCM table, SCM key),
|
||
"This procedure returns the @code{(key . value)} pair from the\n"
|
||
"hash table @var{table}. If @var{table} does not hold an\n"
|
||
"associated value for @var{key}, @code{#f} is returned.\n"
|
||
"Uses @code{equal?} for equality testing.")
|
||
#define FUNC_NAME s_scm_hash_get_handle
|
||
{
|
||
return scm_hash_fn_get_handle (table, key, scm_ihash, scm_sloppy_assoc, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM_DEFINE (scm_hash_create_handle_x, "hash-create-handle!", 3, 0, 0,
|
||
(SCM table, SCM key, SCM init),
|
||
"This function looks up @var{key} in @var{table} and returns its handle.\n"
|
||
"If @var{key} is not already present, a new handle is created which\n"
|
||
"associates @var{key} with @var{init}.")
|
||
#define FUNC_NAME s_scm_hash_create_handle_x
|
||
{
|
||
return scm_hash_fn_create_handle_x (table, key, init, scm_ihash, scm_sloppy_assoc, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM_DEFINE (scm_hash_ref, "hash-ref", 2, 1, 0,
|
||
(SCM table, SCM key, SCM dflt),
|
||
"Look up @var{key} in the hash table @var{table}, and return the\n"
|
||
"value (if any) associated with it. If @var{key} is not found,\n"
|
||
"return @var{default} (or @code{#f} if no @var{default} argument\n"
|
||
"is supplied). Uses @code{equal?} for equality testing.")
|
||
#define FUNC_NAME s_scm_hash_ref
|
||
{
|
||
if (SCM_UNBNDP (dflt))
|
||
dflt = SCM_BOOL_F;
|
||
return scm_hash_fn_ref (table, key, dflt, scm_ihash, scm_sloppy_assoc, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hash_set_x, "hash-set!", 3, 0, 0,
|
||
(SCM table, SCM key, SCM val),
|
||
"Find the entry in @var{table} associated with @var{key}, and\n"
|
||
"store @var{value} there. Uses @code{equal?} for equality\n"
|
||
"testing.")
|
||
#define FUNC_NAME s_scm_hash_set_x
|
||
{
|
||
return scm_hash_fn_set_x (table, key, val, scm_ihash, scm_sloppy_assoc, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hash_remove_x, "hash-remove!", 2, 0, 0,
|
||
(SCM table, SCM key),
|
||
"Remove @var{key} (and any value associated with it) from\n"
|
||
"@var{table}. Uses @code{equal?} for equality tests.")
|
||
#define FUNC_NAME s_scm_hash_remove_x
|
||
{
|
||
return scm_hash_fn_remove_x (table, key, scm_ihash, scm_sloppy_assoc,
|
||
scm_delete_x, 0);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
|
||
typedef struct scm_ihashx_closure_t
|
||
{
|
||
SCM hash;
|
||
SCM assoc;
|
||
SCM delete;
|
||
} scm_ihashx_closure_t;
|
||
|
||
|
||
|
||
static scm_bits_t
|
||
scm_ihashx (SCM obj, scm_bits_t n, scm_ihashx_closure_t *closure)
|
||
{
|
||
SCM answer;
|
||
SCM_DEFER_INTS;
|
||
answer = scm_apply (closure->hash,
|
||
SCM_LIST2 (obj, scm_bits2num (n)),
|
||
SCM_EOL);
|
||
SCM_ALLOW_INTS;
|
||
return SCM_INUM (answer);
|
||
}
|
||
|
||
|
||
|
||
static SCM
|
||
scm_sloppy_assx (SCM obj, SCM alist, scm_ihashx_closure_t *closure)
|
||
{
|
||
SCM answer;
|
||
SCM_DEFER_INTS;
|
||
answer = scm_apply (closure->assoc,
|
||
SCM_LIST2 (obj, alist),
|
||
SCM_EOL);
|
||
SCM_ALLOW_INTS;
|
||
return answer;
|
||
}
|
||
|
||
|
||
|
||
|
||
static SCM
|
||
scm_delx_x (SCM obj, SCM alist, scm_ihashx_closure_t *closure)
|
||
{
|
||
SCM answer;
|
||
SCM_DEFER_INTS;
|
||
answer = scm_apply (closure->delete,
|
||
SCM_LIST2 (obj, alist),
|
||
SCM_EOL);
|
||
SCM_ALLOW_INTS;
|
||
return answer;
|
||
}
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hashx_get_handle, "hashx-get-handle", 4, 0, 0,
|
||
(SCM hash, SCM assoc, SCM table, SCM key),
|
||
"This behaves the same way as the corresponding\n"
|
||
"@code{-get-handle} function, but uses @var{hash} as a hash\n"
|
||
"function and @var{assoc} to compare keys. @code{hash} must be\n"
|
||
"a function that takes two arguments, a key to be hashed and a\n"
|
||
"table size. @code{assoc} must be an associator function, like\n"
|
||
"@code{assoc}, @code{assq} or @code{assv}.")
|
||
#define FUNC_NAME s_scm_hashx_get_handle
|
||
{
|
||
scm_ihashx_closure_t closure;
|
||
closure.hash = hash;
|
||
closure.assoc = assoc;
|
||
return scm_hash_fn_get_handle (table, key, scm_ihashx, scm_sloppy_assx,
|
||
(void *)&closure);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
SCM_DEFINE (scm_hashx_create_handle_x, "hashx-create-handle!", 5, 0, 0,
|
||
(SCM hash, SCM assoc, SCM table, SCM key, SCM init),
|
||
"This behaves the same way as the corresponding\n"
|
||
"@code{-create-handle} function, but uses @var{hash} as a hash\n"
|
||
"function and @var{assoc} to compare keys. @code{hash} must be\n"
|
||
"a function that takes two arguments, a key to be hashed and a\n"
|
||
"table size. @code{assoc} must be an associator function, like\n"
|
||
"@code{assoc}, @code{assq} or @code{assv}.")
|
||
#define FUNC_NAME s_scm_hashx_create_handle_x
|
||
{
|
||
scm_ihashx_closure_t closure;
|
||
closure.hash = hash;
|
||
closure.assoc = assoc;
|
||
return scm_hash_fn_create_handle_x (table, key, init, scm_ihashx,
|
||
scm_sloppy_assx, (void *)&closure);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hashx_ref, "hashx-ref", 4, 1, 0,
|
||
(SCM hash, SCM assoc, SCM table, SCM key, SCM dflt),
|
||
"This behaves the same way as the corresponding @code{ref}\n"
|
||
"function, but uses @var{hash} as a hash function and\n"
|
||
"@var{assoc} to compare keys. @code{hash} must be a function\n"
|
||
"that takes two arguments, a key to be hashed and a table size.\n"
|
||
"@code{assoc} must be an associator function, like @code{assoc},\n"
|
||
"@code{assq} or @code{assv}.\n"
|
||
"\n"
|
||
"By way of illustration, @code{hashq-ref table key} is\n"
|
||
"equivalent to @code{hashx-ref hashq assq table key}.")
|
||
#define FUNC_NAME s_scm_hashx_ref
|
||
{
|
||
scm_ihashx_closure_t closure;
|
||
if (SCM_UNBNDP (dflt))
|
||
dflt = SCM_BOOL_F;
|
||
closure.hash = hash;
|
||
closure.assoc = assoc;
|
||
return scm_hash_fn_ref (table, key, dflt, scm_ihashx, scm_sloppy_assx,
|
||
(void *)&closure);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
|
||
SCM_DEFINE (scm_hashx_set_x, "hashx-set!", 5, 0, 0,
|
||
(SCM hash, SCM assoc, SCM table, SCM key, SCM val),
|
||
"This behaves the same way as the corresponding @code{set!}\n"
|
||
"function, but uses @var{hash} as a hash function and\n"
|
||
"@var{assoc} to compare keys. @code{hash} must be a function\n"
|
||
"that takes two arguments, a key to be hashed and a table size.\n"
|
||
"@code{assoc} must be an associator function, like @code{assoc},\n"
|
||
"@code{assq} or @code{assv}.\n"
|
||
"\n"
|
||
" By way of illustration, @code{hashq-set! table key} is\n"
|
||
"equivalent to @code{hashx-set! hashq assq table key}.")
|
||
#define FUNC_NAME s_scm_hashx_set_x
|
||
{
|
||
scm_ihashx_closure_t closure;
|
||
closure.hash = hash;
|
||
closure.assoc = assoc;
|
||
return scm_hash_fn_set_x (table, key, val, scm_ihashx, scm_sloppy_assx,
|
||
(void *)&closure);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
SCM
|
||
scm_hashx_remove_x (SCM hash, SCM assoc, SCM delete, SCM table, SCM obj)
|
||
{
|
||
scm_ihashx_closure_t closure;
|
||
closure.hash = hash;
|
||
closure.assoc = assoc;
|
||
closure.delete = delete;
|
||
return scm_hash_fn_remove_x (table, obj, scm_ihashx, scm_sloppy_assx, scm_delx_x, 0);
|
||
}
|
||
|
||
static SCM
|
||
fold_proc (void *proc, SCM key, SCM data, SCM value)
|
||
{
|
||
return scm_apply (SCM_PACK (proc), SCM_LIST3 (key, data, value), SCM_EOL);
|
||
}
|
||
|
||
SCM_DEFINE (scm_hash_fold, "hash-fold", 3, 0, 0,
|
||
(SCM proc, SCM init, SCM table),
|
||
"An iterator over hash-table elements.\n"
|
||
"Accumulates and returns a result by applying PROC successively.\n"
|
||
"The arguments to PROC are \"(key value prior-result)\" where key\n"
|
||
"and value are successive pairs from the hash table TABLE, and\n"
|
||
"prior-result is either INIT (for the first application of PROC)\n"
|
||
"or the return value of the previous application of PROC.\n"
|
||
"For example, @code{(hash-fold acons () tab)} will convert a hash\n"
|
||
"table into an a-list of key-value pairs.\n")
|
||
#define FUNC_NAME s_scm_hash_fold
|
||
{
|
||
SCM_VALIDATE_PROC (1,proc);
|
||
SCM_VALIDATE_VECTOR (3,table);
|
||
return scm_internal_hash_fold (fold_proc, (void *) SCM_UNPACK (proc), init, table);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
SCM
|
||
scm_internal_hash_fold (SCM (*fn) (), void *closure, SCM init, SCM table)
|
||
{
|
||
scm_bits_t i, n = SCM_VECTOR_LENGTH (table);
|
||
SCM result = init;
|
||
for (i = 0; i < n; ++i)
|
||
{
|
||
SCM ls = SCM_VELTS (table)[i], handle;
|
||
while (!SCM_NULLP (ls))
|
||
{
|
||
SCM_ASSERT (SCM_CONSP (ls),
|
||
table, SCM_ARG1, s_scm_hash_fold);
|
||
handle = SCM_CAR (ls);
|
||
SCM_ASSERT (SCM_CONSP (handle),
|
||
table, SCM_ARG1, s_scm_hash_fold);
|
||
result = fn (closure, SCM_CAR (handle), SCM_CDR (handle), result);
|
||
ls = SCM_CDR (ls);
|
||
}
|
||
}
|
||
return result;
|
||
}
|
||
|
||
|
||
|
||
|
||
void
|
||
scm_init_hashtab ()
|
||
{
|
||
#ifndef SCM_MAGIC_SNARFER
|
||
#include "libguile/hashtab.x"
|
||
#endif
|
||
}
|
||
|
||
/*
|
||
Local Variables:
|
||
c-file-style: "gnu"
|
||
End:
|
||
*/
|