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, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
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.
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
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.
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. */
50 SCM_PROC1 (s_string_equal_p
, "string=?", scm_tc7_rpsubr
, scm_string_equal_p
);
53 scm_string_equal_p (s1
, s2
)
58 register unsigned char *c1
, *c2
;
59 SCM_ASSERT (SCM_NIMP (s1
) && SCM_ROSTRINGP (s1
), s1
, SCM_ARG1
, s_string_equal_p
);
60 SCM_ASSERT (SCM_NIMP (s2
) && SCM_ROSTRINGP (s2
), s2
, SCM_ARG2
, s_string_equal_p
);
62 i
= SCM_ROLENGTH (s2
);
63 if (SCM_ROLENGTH (s1
) != i
)
67 c1
= SCM_ROUCHARS (s1
);
68 c2
= SCM_ROUCHARS (s2
);
75 SCM_PROC1 (s_string_ci_equal_p
, "string-ci=?", scm_tc7_rpsubr
, scm_string_ci_equal_p
);
78 scm_string_ci_equal_p (s1
, s2
)
83 register unsigned char *c1
, *c2
;
84 SCM_ASSERT (SCM_NIMP (s1
) && SCM_ROSTRINGP (s1
), s1
, SCM_ARG1
, s_string_ci_equal_p
);
85 SCM_ASSERT (SCM_NIMP (s2
) && SCM_ROSTRINGP (s2
), s2
, SCM_ARG2
, s_string_ci_equal_p
);
86 i
= SCM_ROLENGTH (s2
);
87 if (SCM_ROLENGTH (s1
) != i
)
91 c1
= SCM_ROUCHARS (s1
);
92 c2
= SCM_ROUCHARS (s2
);
94 if (scm_upcase(*c1
++) != scm_upcase(*c2
++))
99 SCM_PROC1 (s_string_less_p
, "string<?", scm_tc7_rpsubr
, scm_string_less_p
);
102 scm_string_less_p (s1
, s2
)
106 register scm_sizet i
, len
, s2len
;
107 register unsigned char *c1
, *c2
;
110 SCM_ASSERT (SCM_NIMP (s1
) && SCM_ROSTRINGP (s1
), s1
, SCM_ARG1
, s_string_less_p
);
111 SCM_ASSERT (SCM_NIMP (s2
) && SCM_ROSTRINGP (s2
), s2
, SCM_ARG2
, s_string_less_p
);
112 len
= SCM_ROLENGTH (s1
);
113 s2len
= i
= SCM_ROLENGTH (s2
);
115 c1
= SCM_ROUCHARS (s1
);
116 c2
= SCM_ROUCHARS (s2
);
118 for (i
= 0;i
<len
;i
++) {
127 answer
= (s2len
!= len
) ? SCM_BOOL_T
: SCM_BOOL_F
;
132 SCM_PROC1 (s_string_leq_p
, "string<=?", scm_tc7_rpsubr
, scm_string_leq_p
);
135 scm_string_leq_p (s1
, s2
)
139 return SCM_BOOL_NOT (scm_string_less_p (s2
, s1
));
142 SCM_PROC1 (s_string_gr_p
, "string>?", scm_tc7_rpsubr
, scm_string_gr_p
);
145 scm_string_gr_p (s1
, s2
)
149 return scm_string_less_p (s2
, s1
);
152 SCM_PROC1 (s_string_geq_p
, "string>=?", scm_tc7_rpsubr
, scm_string_geq_p
);
155 scm_string_geq_p (s1
, s2
)
159 return SCM_BOOL_NOT (scm_string_less_p (s1
, s2
));
162 SCM_PROC1 (s_string_ci_less_p
, "string-ci<?", scm_tc7_rpsubr
, scm_string_ci_less_p
);
165 scm_string_ci_less_p (s1
, s2
)
169 register scm_sizet i
, len
, s2len
;
170 register unsigned char *c1
, *c2
;
172 SCM_ASSERT (SCM_NIMP (s1
) && SCM_ROSTRINGP (s1
), s1
, SCM_ARG1
, s_string_ci_less_p
);
173 SCM_ASSERT (SCM_NIMP (s2
) && SCM_ROSTRINGP (s2
), s2
, SCM_ARG2
, s_string_ci_less_p
);
174 len
= SCM_ROLENGTH (s1
);
175 s2len
= i
= SCM_ROLENGTH (s2
);
177 c1
= SCM_ROUCHARS (s1
);
178 c2
= SCM_ROUCHARS (s2
);
179 for (i
= 0;i
<len
;i
++) {
180 c
= (scm_upcase(*c1
++) - scm_upcase(*c2
++));
181 if (c
>0) return SCM_BOOL_F
;
182 if (c
<0) return SCM_BOOL_T
;
184 return (s2len
!= len
) ? SCM_BOOL_T
: SCM_BOOL_F
;
187 SCM_PROC1 (s_string_ci_leq_p
, "string-ci<=?", scm_tc7_rpsubr
, scm_string_ci_leq_p
);
190 scm_string_ci_leq_p (s1
, s2
)
194 return SCM_BOOL_NOT (scm_string_ci_less_p (s2
, s1
));
197 SCM_PROC1 (s_string_ci_gr_p
, "string-ci>?", scm_tc7_rpsubr
, scm_string_ci_gr_p
);
200 scm_string_ci_gr_p (s1
, s2
)
204 return scm_string_ci_less_p (s2
, s1
);
207 SCM_PROC1 (s_string_ci_geq_p
, "string-ci>=?", scm_tc7_rpsubr
, scm_string_ci_geq_p
);
210 scm_string_ci_geq_p (s1
, s2
)
214 return SCM_BOOL_NOT (scm_string_ci_less_p (s1
, s2
));
222 #include "strorder.x"