1 /* Copyright (C) 1995,1996 Free Software Foundation, Inc.
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)
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.
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, 675 Mass Ave, Cambridge, MA 02139, USA.
17 * As a special exception, the Free Software Foundation gives permission
18 * for additional uses of the text contained in its release of GUILE.
20 * The exception is that, if you link the GUILE library with other files
21 * to produce an executable, this does not by itself cause the
22 * resulting executable to be covered by the GNU General Public License.
23 * Your use of that executable is in no way restricted on account of
24 * linking the GUILE library code into it.
26 * This exception does not however invalidate any other reasons why
27 * the executable file might be covered by the GNU General Public License.
29 * This exception applies only to the code released by the
30 * Free Software Foundation under the name GUILE. If you copy
31 * code from other Free Software Foundation releases into a copy of
32 * GUILE, as the General Public License permits, the exception does
33 * not apply to the code that you add in this way. To avoid misleading
34 * anyone as to the status of such modified files, you must delete
35 * this exception notice from them.
37 * If you write modifications of your own for GUILE, it is your choice
38 * whether to permit this exception to apply to your modifications.
39 * If you do not wish that, delete this exception notice.
48 SCM_PROC1 (s_string_equal_p
, "string=?", scm_tc7_rpsubr
, scm_string_equal_p
);
51 scm_string_equal_p (SCM s1
, SCM s2
)
54 scm_string_equal_p (s1
, s2
)
60 register char *c1
, *c2
;
61 SCM_ASSERT (SCM_NIMP (s1
) && SCM_ROSTRINGP (s1
), s1
, SCM_ARG1
, s_string_equal_p
);
62 SCM_ASSERT (SCM_NIMP (s2
) && SCM_ROSTRINGP (s2
), s2
, SCM_ARG2
, s_string_equal_p
);
64 i
= SCM_ROLENGTH (s2
);
65 if (SCM_ROLENGTH (s1
) != i
)
69 c1
= SCM_ROCHARS (s1
);
70 c2
= SCM_ROCHARS (s2
);
77 SCM_PROC1 (s_string_ci_equal_p
, "string-ci=?", scm_tc7_rpsubr
, scm_string_ci_equal_p
);
80 scm_string_ci_equal_p (SCM s1
, SCM s2
)
83 scm_string_ci_equal_p (s1
, s2
)
89 register unsigned char *c1
, *c2
;
90 SCM_ASSERT (SCM_NIMP (s1
) && SCM_ROSTRINGP (s1
), s1
, SCM_ARG1
, s_string_ci_equal_p
);
91 SCM_ASSERT (SCM_NIMP (s2
) && SCM_ROSTRINGP (s2
), s2
, SCM_ARG2
, s_string_ci_equal_p
);
92 i
= SCM_ROLENGTH (s2
);
93 if (SCM_ROLENGTH (s1
) != i
)
97 c1
= SCM_ROUCHARS (s1
);
98 c2
= SCM_ROUCHARS (s2
);
100 if (scm_upcase(*c1
++) != scm_upcase(*c2
++))
105 SCM_PROC1 (s_string_less_p
, "string<?", scm_tc7_rpsubr
, scm_string_less_p
);
108 scm_string_less_p (SCM s1
, SCM s2
)
111 scm_string_less_p (s1
, s2
)
116 register scm_sizet i
, len
, s2len
;
117 register unsigned char *c1
, *c2
;
120 SCM_ASSERT (SCM_NIMP (s1
) && SCM_ROSTRINGP (s1
), s1
, SCM_ARG1
, s_string_less_p
);
121 SCM_ASSERT (SCM_NIMP (s2
) && SCM_ROSTRINGP (s2
), s2
, SCM_ARG2
, s_string_less_p
);
122 len
= SCM_ROLENGTH (s1
);
123 s2len
= i
= SCM_ROLENGTH (s2
);
125 c1
= SCM_ROUCHARS (s1
);
126 c2
= SCM_ROUCHARS (s2
);
128 for (i
= 0;i
<len
;i
++) {
137 answer
= (s2len
!= len
) ? SCM_BOOL_T
: SCM_BOOL_F
;
142 SCM_PROC1 (s_string_leq_p
, "string<=?", scm_tc7_rpsubr
, scm_string_leq_p
);
145 scm_string_leq_p (SCM s1
, SCM s2
)
148 scm_string_leq_p (s1
, s2
)
153 return SCM_BOOL_NOT (scm_string_less_p (s2
, s1
));
156 SCM_PROC1 (s_string_gr_p
, "string>?", scm_tc7_rpsubr
, scm_string_gr_p
);
159 scm_string_gr_p (SCM s1
, SCM s2
)
162 scm_string_gr_p (s1
, s2
)
167 return scm_string_less_p (s2
, s1
);
170 SCM_PROC1 (s_string_geq_p
, "string>=?", scm_tc7_rpsubr
, scm_string_geq_p
);
173 scm_string_geq_p (SCM s1
, SCM s2
)
176 scm_string_geq_p (s1
, s2
)
181 return SCM_BOOL_NOT (scm_string_less_p (s1
, s2
));
184 SCM_PROC1 (s_string_ci_less_p
, "string-ci<?", scm_tc7_rpsubr
, scm_string_ci_less_p
);
187 scm_string_ci_less_p (SCM s1
, SCM s2
)
190 scm_string_ci_less_p (s1
, s2
)
195 register scm_sizet i
, len
, s2len
;
196 register unsigned char *c1
, *c2
;
198 SCM_ASSERT (SCM_NIMP (s1
) && SCM_ROSTRINGP (s1
), s1
, SCM_ARG1
, s_string_ci_less_p
);
199 SCM_ASSERT (SCM_NIMP (s2
) && SCM_ROSTRINGP (s2
), s2
, SCM_ARG2
, s_string_ci_less_p
);
200 len
= SCM_ROLENGTH (s1
);
201 s2len
= i
= SCM_ROLENGTH (s2
);
203 c1
= SCM_ROUCHARS (s1
);
204 c2
= SCM_ROUCHARS (s2
);
205 for (i
= 0;i
<len
;i
++) {
206 c
= (scm_upcase(*c1
++) - scm_upcase(*c2
++));
207 if (c
>0) return SCM_BOOL_F
;
208 if (c
<0) return SCM_BOOL_T
;
210 return (s2len
!= len
) ? SCM_BOOL_T
: SCM_BOOL_F
;
213 SCM_PROC1 (s_string_ci_leq_p
, "string-ci<=?", scm_tc7_rpsubr
, scm_string_ci_leq_p
);
216 scm_string_ci_leq_p (SCM s1
, SCM s2
)
219 scm_string_ci_leq_p (s1
, s2
)
224 return SCM_BOOL_NOT (scm_string_ci_less_p (s2
, s1
));
227 SCM_PROC1 (s_string_ci_gr_p
, "string-ci>?", scm_tc7_rpsubr
, scm_string_ci_gr_p
);
230 scm_string_ci_gr_p (SCM s1
, SCM s2
)
233 scm_string_ci_gr_p (s1
, s2
)
238 return scm_string_ci_less_p (s2
, s1
);
241 SCM_PROC1 (s_string_ci_geq_p
, "string-ci>=?", scm_tc7_rpsubr
, scm_string_ci_geq_p
);
244 scm_string_ci_geq_p (SCM s1
, SCM s2
)
247 scm_string_ci_geq_p (s1
, s2
)
252 return SCM_BOOL_NOT (scm_string_ci_less_p (s1
, s2
));
258 scm_init_strorder (void)
264 #include "strorder.x"