libguile/strorder.c

   1 /*      Copyright (C) 1995, 1996, 1999, 2000 Free Software Foundation, Inc.
   2  *
   3  * This program is free software; you can redistribute it and/or modify
   4  * it under the terms of the GNU General Public License as published by
   5  * the Free Software Foundation; either version 2, or (at your option)
   6  * any later version.
   7  *
   8  * This program is distributed in the hope that it will be useful,
   9  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  11  * GNU General Public License for more details.
  12  *
  13  * You should have received a copy of the GNU General Public License
  14  * along with this software; see the file COPYING.  If not, write to
  15  * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
  16  * Boston, MA 02111-1307 USA
  17  *
  18  * As a special exception, the Free Software Foundation gives permission
  19  * for additional uses of the text contained in its release of GUILE.
  20  *
  21  * The exception is that, if you link the GUILE library with other files
  22  * to produce an executable, this does not by itself cause the
  23  * resulting executable to be covered by the GNU General Public License.
  24  * Your use of that executable is in no way restricted on account of
  25  * linking the GUILE library code into it.
  26  *
  27  * This exception does not however invalidate any other reasons why
  28  * the executable file might be covered by the GNU General Public License.
  29  *
  30  * This exception applies only to the code released by the
  31  * Free Software Foundation under the name GUILE.  If you copy
  32  * code from other Free Software Foundation releases into a copy of
  33  * GUILE, as the General Public License permits, the exception does
  34  * not apply to the code that you add in this way.  To avoid misleading
  35  * anyone as to the status of such modified files, you must delete
  36  * this exception notice from them.
  37  *
  38  * If you write modifications of your own for GUILE, it is your choice
  39  * whether to permit this exception to apply to your modifications.
  40  * If you do not wish that, delete this exception notice.  */
  41
  42 /* Software engineering face-lift by Greg J. Badros, 11-Dec-1999,
  43    gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */
  44 \f
  45
  46 #include <stdio.h>
  47 #include "libguile/_scm.h"
  48 #include "libguile/chars.h"
  49 #include "libguile/strings.h"
  50 #include "libguile/symbols.h"
  51
  52 #include "libguile/validate.h"
  53 #include "libguile/strorder.h"
  54 \f
  55
  56 SCM_DEFINE1 (scm_string_equal_p, "string=?", scm_tc7_rpsubr,
  57              (SCM s1, SCM s2),
  58              "Lexicographic equality predicate; \n"
  59              "Returns @t{#t} if the two strings are the same length and contain the same\n"
  60              "characters in the same positions, otherwise returns @t{#f}. (r5rs)\n\n"
  61              "@samp{String-ci=?} treats\n"
  62              "upper and lower case letters as though they were the same character, but\n"
  63              "@samp{string=?} treats upper and lower case as distinct characters.")
  64 #define FUNC_NAME s_scm_string_equal_p
  65 {
  66   register scm_sizet i;
  67   register unsigned char *c1, *c2;
  68   SCM_VALIDATE_ROSTRING (1,s1);
  69   SCM_VALIDATE_ROSTRING (2,s2);
  70
  71   i = SCM_ROLENGTH (s2);
  72   if (SCM_ROLENGTH (s1) != i)
  73     {
  74       return SCM_BOOL_F;
  75     }
  76   c1 = SCM_ROUCHARS (s1);
  77   c2 = SCM_ROUCHARS (s2);
  78   while (0 != i--)
  79     if (*c1++ != *c2++)
  80       return SCM_BOOL_F;
  81   return SCM_BOOL_T;
  82 }
  83 #undef FUNC_NAME
  84
  85 SCM_DEFINE1 (scm_string_ci_equal_p, "string-ci=?", scm_tc7_rpsubr,
  86              (SCM s1, SCM s2),
  87              "Case-insensitive string equality predicate; returns @t{#t} if\n"
  88              "the two strings are the same length and their component characters\n"
  89              "match (ignoring case) at each position; otherwise returns @t{#f}. (r5rs)")
  90 #define FUNC_NAME s_scm_string_ci_equal_p
  91 {
  92   register scm_sizet i;
  93   register unsigned char *c1, *c2;
  94   SCM_VALIDATE_ROSTRING (1,s1);
  95   SCM_VALIDATE_ROSTRING (2,s2);
  96
  97   i = SCM_ROLENGTH (s2);
  98   if (SCM_ROLENGTH (s1) != i)
  99     {
 100       return SCM_BOOL_F;
 101     }
 102   c1 = SCM_ROUCHARS (s1);
 103   c2 = SCM_ROUCHARS (s2);
 104   while (0 != i--)
 105     if (scm_upcase(*c1++) != scm_upcase(*c2++))
 106       return SCM_BOOL_F;
 107   return SCM_BOOL_T;
 108 }
 109 #undef FUNC_NAME
 110
 111 SCM_DEFINE1 (scm_string_less_p, "string<?", scm_tc7_rpsubr,
 112              (SCM s1, SCM s2),
 113              "Lexicographic ordering predicate; returns @t{#t} if @var{s1}\n"
 114              "is lexicographically less than @var{s2}.  (r5rs)")
 115 #define FUNC_NAME s_scm_string_less_p
 116 {
 117   register scm_sizet i, len, s2len;
 118   register unsigned char *c1, *c2;
 119   register int c;
 120
 121   SCM_VALIDATE_ROSTRING (1,s1);
 122   SCM_VALIDATE_ROSTRING (2,s2);
 123   len = SCM_ROLENGTH (s1);
 124   s2len = SCM_ROLENGTH (s2);
 125   if (len>s2len) len = s2len;
 126   c1 = SCM_ROUCHARS (s1);
 127   c2 = SCM_ROUCHARS (s2);
 128
 129   for (i = 0;i<len;i++) {
 130     c = (*c1++ - *c2++);
 131     if (c>0)
 132       return SCM_BOOL_F;
 133     if (c<0)
 134       return SCM_BOOL_T;
 135   }
 136   {
 137     SCM answer;
 138     answer = SCM_BOOL(s2len != len);
 139     return answer;
 140   }
 141 }
 142 #undef FUNC_NAME
 143
 144 SCM_DEFINE1 (scm_string_leq_p, "string<=?", scm_tc7_rpsubr,
 145              (SCM s1, SCM s2),
 146              "Lexicographic ordering predicate; returns @t{#t} if @var{s1}\n"
 147              "is lexicographically less than or equal to @var{s2}.  (r5rs)")
 148 #define FUNC_NAME s_scm_string_leq_p
 149 {
 150   return SCM_BOOL_NOT (scm_string_less_p (s2, s1));
 151 }
 152 #undef FUNC_NAME
 153
 154 SCM_DEFINE1 (scm_string_gr_p, "string>?", scm_tc7_rpsubr,
 155              (SCM s1, SCM s2),
 156              "Lexicographic ordering predicate; returns @t{#t} if @var{s1}\n"
 157              "is lexicographically greater than @var{s2}.  (r5rs)")
 158 #define FUNC_NAME s_scm_string_gr_p
 159 {
 160   return scm_string_less_p (s2, s1);
 161 }
 162 #undef FUNC_NAME
 163
 164 SCM_DEFINE1 (scm_string_geq_p, "string>=?", scm_tc7_rpsubr,
 165              (SCM s1, SCM s2),
 166              "Lexicographic ordering predicate; returns @t{#t} if @var{s1}\n"
 167              "is lexicographically greater than or equal to @var{s2}.  (r5rs)")
 168 #define FUNC_NAME s_scm_string_geq_p
 169 {
 170   return SCM_BOOL_NOT (scm_string_less_p (s1, s2));
 171 }
 172 #undef FUNC_NAME
 173
 174 SCM_DEFINE1 (scm_string_ci_less_p, "string-ci<?", scm_tc7_rpsubr,
 175              (SCM s1, SCM s2),
 176              "Case insensitive lexicographic ordering predicate; \n"
 177              "returns @t{#t} if @var{s1} is lexicographically less than\n"
 178              "@var{s2} regardless of case.  (r5rs)")
 179 #define FUNC_NAME s_scm_string_ci_less_p
 180 {
 181   register scm_sizet i, len, s2len;
 182   register unsigned char *c1, *c2;
 183   register int c;
 184   SCM_VALIDATE_ROSTRING (1,s1);
 185   SCM_VALIDATE_ROSTRING (2,s2);
 186   len = SCM_ROLENGTH (s1);
 187   s2len = SCM_ROLENGTH (s2);
 188   if (len>s2len) len = s2len;
 189   c1 = SCM_ROUCHARS (s1);
 190   c2 = SCM_ROUCHARS (s2);
 191   for (i = 0;i<len;i++) {
 192     c = (scm_upcase(*c1++) - scm_upcase(*c2++));
 193     if (c>0) return SCM_BOOL_F;
 194     if (c<0) return SCM_BOOL_T;
 195   }
 196   return SCM_BOOL(s2len != len);
 197 }
 198 #undef FUNC_NAME
 199
 200 SCM_DEFINE1 (scm_string_ci_leq_p, "string-ci<=?", scm_tc7_rpsubr,
 201              (SCM s1, SCM s2),
 202              "Case insensitive lexicographic ordering predicate; \n"
 203              "returns @t{#t} if @var{s1} is lexicographically less than\n"
 204              "or equal to @var{s2} regardless of case.  (r5rs)")
 205 #define FUNC_NAME s_scm_string_ci_leq_p
 206 {
 207   return SCM_BOOL_NOT (scm_string_ci_less_p (s2, s1));
 208 }
 209 #undef FUNC_NAME
 210
 211 SCM_DEFINE1 (scm_string_ci_gr_p, "string-ci>?", scm_tc7_rpsubr,
 212              (SCM s1, SCM s2),
 213              "Case insensitive lexicographic ordering predicate; \n"
 214              "returns @t{#t} if @var{s1} is lexicographically greater than\n"
 215              "@var{s2} regardless of case.  (r5rs)")
 216 #define FUNC_NAME s_scm_string_ci_gr_p
 217 {
 218   return scm_string_ci_less_p (s2, s1);
 219 }
 220 #undef FUNC_NAME
 221
 222 SCM_DEFINE1 (scm_string_ci_geq_p, "string-ci>=?", scm_tc7_rpsubr,
 223              (SCM s1, SCM s2),
 224              "Case insensitive lexicographic ordering predicate; \n"
 225              "returns @t{#t} if @var{s1} is lexicographically greater than\n"
 226              "or equal to @var{s2} regardless of case.  (r5rs)")
 227 #define FUNC_NAME s_scm_string_ci_geq_p
 228 {
 229   return SCM_BOOL_NOT (scm_string_ci_less_p (s1, s2));
 230 }
 231 #undef FUNC_NAME
 232
 233 \f
 234
 235 void
 236 scm_init_strorder ()
 237 {
 238 #include "libguile/strorder.x"
 239 }
 240
 241
 242 /*
 243   Local Variables:
 244   c-file-style: "gnu"
 245   End:
 246 */