lily/scm-hash.cc

   1 /*
   2   This file is part of LilyPond, the GNU music typesetter.
   3
   4   Copyright (C) 1999--2010 Han-Wen Nienhuys <hanwen@xs4all.nl>
   5
   6   LilyPond is free software: you can redistribute it and/or modify
   7   it under the terms of the GNU General Public License as published by
   8   the Free Software Foundation, either version 3 of the License, or
   9   (at your option) any later version.
  10
  11   LilyPond is distributed in the hope that it will be useful,
  12   but WITHOUT ANY WARRANTY; without even the implied warranty of
  13   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14   GNU General Public License for more details.
  15
  16   You should have received a copy of the GNU General Public License
  17   along with LilyPond.  If not, see <http://www.gnu.org/licenses/>.
  18 */
  19
  20 #include "scm-hash.hh"
  21
  22 #include <cstdio>
  23 #include <algorithm>
  24 using namespace std;
  25
  26 #include "ly-smobs.icc"
  27
  28 /*
  29   Return: number of objects.
  30 */
  31 SCM
  32 copy_handle (void *closure, SCM handle)
  33 {
  34   SCM tab = (SCM) closure;
  35   scm_hashq_set_x (tab, scm_car (handle), scm_cdr (handle));
  36   return tab;
  37 }
  38
  39 static void
  40 copy_scm_hashes (SCM dest, SCM src)
  41 {
  42   scm_internal_hash_for_each_handle (  (SCM (*)(GUILE_ELLIPSIS)) &copy_handle, dest, src);
  43 }
  44
  45 Scheme_hash_table::Scheme_hash_table ()
  46 {
  47   hash_tab_ = SCM_EOL;
  48   smobify_self ();
  49   hash_tab_ = scm_c_make_hash_table (119);
  50 }
  51
  52 Scheme_hash_table::Scheme_hash_table (Scheme_hash_table const &src)
  53 {
  54   hash_tab_ = SCM_EOL;
  55   smobify_self ();
  56   copy (src);
  57 }
  58
  59 void
  60 Scheme_hash_table::copy (Scheme_hash_table const &src)
  61 {
  62   if (&src == this)
  63     return;
  64
  65   hash_tab_ = scm_c_make_hash_table (SCM_HASHTABLE_N_ITEMS(src.hash_tab_));
  66   copy_scm_hashes (hash_tab_, src.hash_tab_);
  67 }
  68
  69 Scheme_hash_table::~Scheme_hash_table ()
  70 {
  71 }
  72
  73 SCM
  74 Scheme_hash_table::mark_smob (SCM s)
  75 {
  76   Scheme_hash_table *me = (Scheme_hash_table *) SCM_CELL_WORD_1 (s);
  77   scm_gc_mark (me->hash_tab_);
  78   return SCM_EOL;
  79 }
  80
  81 int
  82 Scheme_hash_table::print_smob (SCM s, SCM p, scm_print_state*)
  83 {
  84   assert (unsmob (s));
  85   scm_puts ("#<Scheme_hash_table  ", p);
  86   Scheme_hash_table *me = (Scheme_hash_table *) SCM_CELL_WORD_1 (s);
  87   scm_display (me->hash_tab_, p);
  88   scm_puts ("> ", p);
  89   return 1;
  90 }
  91
  92 bool
  93 Scheme_hash_table::try_retrieve (SCM k, SCM *v){
  94
  95   SCM handle = scm_hashq_get_handle (hash_tab_, k);
  96   if (scm_is_pair (handle))
  97     {
  98       *v = scm_cdr (handle);
  99       return true;
 100     }
 101   else
 102     return false;
 103 }
 104
 105 bool
 106 Scheme_hash_table::contains (SCM k) const
 107 {
 108   return scm_is_pair (scm_hashq_get_handle (hash_tab_, k));
 109 }
 110
 111 void
 112 Scheme_hash_table::set (SCM k, SCM v)
 113 {
 114   assert (scm_is_symbol (k));
 115   SCM handle = scm_hashq_create_handle_x (hash_tab_, k, SCM_UNDEFINED);
 116   scm_set_cdr_x (handle, v);
 117 }
 118
 119 SCM
 120 Scheme_hash_table::get (SCM k) const
 121 {
 122   /* SCM_UNSPECIFIED will stick out like a sore thumb, hopefully.
 123   */
 124   return scm_hashq_ref (hash_tab_, k, SCM_UNSPECIFIED);
 125 }
 126
 127 void
 128 Scheme_hash_table::remove (SCM k)
 129 {
 130   scm_hashq_remove_x (hash_tab_, k);
 131 }
 132
 133 static SCM
 134 collect_handles (void * /* closure */,
 135                  SCM key,
 136                  SCM value,
 137                  SCM result)
 138 {
 139   return scm_acons(key, value, result);
 140 }
 141
 142 SCM
 143 Scheme_hash_table::to_alist () const
 144 {
 145   return scm_internal_hash_fold ((SCM (*)(GUILE_ELLIPSIS)) &collect_handles, NULL, SCM_EOL, hash_tab_);
 146 }
 147
 148 IMPLEMENT_SMOBS (Scheme_hash_table);
 149 IMPLEMENT_DEFAULT_EQUAL_P (Scheme_hash_table);