diff options
Diffstat (limited to 'libguile/strorder.c')
-rw-r--r-- | libguile/strorder.c | 57 |
1 files changed, 31 insertions, 26 deletions
diff --git a/libguile/strorder.c b/libguile/strorder.c index adea5de92..22f60db49 100644 --- a/libguile/strorder.c +++ b/libguile/strorder.c @@ -56,11 +56,13 @@ SCM_DEFINE1 (scm_string_equal_p, "string=?", scm_tc7_rpsubr, (SCM s1, SCM s2), "Lexicographic equality predicate; \n" - "Returns @t{#t} if the two strings are the same length and contain the same\n" - "characters in the same positions, otherwise returns @t{#f}. (r5rs)\n\n" - "@samp{String-ci=?} treats\n" - "upper and lower case letters as though they were the same character, but\n" - "@samp{string=?} treats upper and lower case as distinct characters.") + "Returns @code{#t} if the two strings are the same length and\n" + "contain the same characters in the same positions, otherwise\n" + "returns @code{#f}. (r5rs)\n\n" + "The procedure @code{string-ci=?} treats upper and lower case\n" + "letters as though they were the same character, but\n" + "@code{string=?} treats upper and lower case as distinct\n" + "characters.") #define FUNC_NAME s_scm_string_equal_p { scm_sizet length; @@ -92,9 +94,10 @@ SCM_DEFINE1 (scm_string_equal_p, "string=?", scm_tc7_rpsubr, SCM_DEFINE1 (scm_string_ci_equal_p, "string-ci=?", scm_tc7_rpsubr, (SCM s1, SCM s2), - "Case-insensitive string equality predicate; returns @t{#t} if\n" - "the two strings are the same length and their component characters\n" - "match (ignoring case) at each position; otherwise returns @t{#f}. (r5rs)") + "Case-insensitive string equality predicate; returns @code{#t}\n" + "if the two strings are the same length and their component\n" + "characters match (ignoring case) at each position; otherwise\n" + "returns @code{#f}. (r5rs)") #define FUNC_NAME s_scm_string_ci_equal_p { scm_sizet length; @@ -150,8 +153,8 @@ string_less_p (SCM s1, SCM s2) SCM_DEFINE1 (scm_string_less_p, "string<?", scm_tc7_rpsubr, (SCM s1, SCM s2), - "Lexicographic ordering predicate; returns @t{#t} if @var{s1}\n" - "is lexicographically less than @var{s2}. (r5rs)") + "Lexicographic ordering predicate; returns @code{#t} if\n" + "@var{s1} is lexicographically less than @var{s2}. (r5rs)") #define FUNC_NAME s_scm_string_less_p { SCM_VALIDATE_STRING (1, s1); @@ -164,8 +167,9 @@ SCM_DEFINE1 (scm_string_less_p, "string<?", scm_tc7_rpsubr, SCM_DEFINE1 (scm_string_leq_p, "string<=?", scm_tc7_rpsubr, (SCM s1, SCM s2), - "Lexicographic ordering predicate; returns @t{#t} if @var{s1}\n" - "is lexicographically less than or equal to @var{s2}. (r5rs)") + "Lexicographic ordering predicate; returns @code{#t} if\n" + "@var{s1} is lexicographically less than or equal to @var{s2}.\n" + "(r5rs)") #define FUNC_NAME s_scm_string_leq_p { SCM_VALIDATE_STRING (1, s1); @@ -178,8 +182,8 @@ SCM_DEFINE1 (scm_string_leq_p, "string<=?", scm_tc7_rpsubr, SCM_DEFINE1 (scm_string_gr_p, "string>?", scm_tc7_rpsubr, (SCM s1, SCM s2), - "Lexicographic ordering predicate; returns @t{#t} if @var{s1}\n" - "is lexicographically greater than @var{s2}. (r5rs)") + "Lexicographic ordering predicate; returns @code{#t} if\n" + "@var{s1} is lexicographically greater than @var{s2}. (r5rs)") #define FUNC_NAME s_scm_string_gr_p { SCM_VALIDATE_STRING (1, s1); @@ -192,8 +196,9 @@ SCM_DEFINE1 (scm_string_gr_p, "string>?", scm_tc7_rpsubr, SCM_DEFINE1 (scm_string_geq_p, "string>=?", scm_tc7_rpsubr, (SCM s1, SCM s2), - "Lexicographic ordering predicate; returns @t{#t} if @var{s1}\n" - "is lexicographically greater than or equal to @var{s2}. (r5rs)") + "Lexicographic ordering predicate; returns @code{#t} if\n" + "@var{s1} is lexicographically greater than or equal to\n" + "@var{s2}. (r5rs)") #define FUNC_NAME s_scm_string_geq_p { SCM_VALIDATE_STRING (1, s1); @@ -230,8 +235,8 @@ string_ci_less_p (SCM s1, SCM s2) SCM_DEFINE1 (scm_string_ci_less_p, "string-ci<?", scm_tc7_rpsubr, (SCM s1, SCM s2), - "Case insensitive lexicographic ordering predicate; \n" - "returns @t{#t} if @var{s1} is lexicographically less than\n" + "Case insensitive lexicographic ordering predicate;\n" + "returns @code{#t} if @var{s1} is lexicographically less than\n" "@var{s2} regardless of case. (r5rs)") #define FUNC_NAME s_scm_string_ci_less_p { @@ -245,8 +250,8 @@ SCM_DEFINE1 (scm_string_ci_less_p, "string-ci<?", scm_tc7_rpsubr, SCM_DEFINE1 (scm_string_ci_leq_p, "string-ci<=?", scm_tc7_rpsubr, (SCM s1, SCM s2), - "Case insensitive lexicographic ordering predicate; \n" - "returns @t{#t} if @var{s1} is lexicographically less than\n" + "Case insensitive lexicographic ordering predicate;\n" + "returns @code{#t} if @var{s1} is lexicographically less than\n" "or equal to @var{s2} regardless of case. (r5rs)") #define FUNC_NAME s_scm_string_ci_leq_p { @@ -260,9 +265,9 @@ SCM_DEFINE1 (scm_string_ci_leq_p, "string-ci<=?", scm_tc7_rpsubr, SCM_DEFINE1 (scm_string_ci_gr_p, "string-ci>?", scm_tc7_rpsubr, (SCM s1, SCM s2), - "Case insensitive lexicographic ordering predicate; \n" - "returns @t{#t} if @var{s1} is lexicographically greater than\n" - "@var{s2} regardless of case. (r5rs)") + "Case insensitive lexicographic ordering predicate;\n" + "returns @code{#t} if @var{s1} is lexicographically greater\n" + "than @var{s2} regardless of case. (r5rs)") #define FUNC_NAME s_scm_string_ci_gr_p { SCM_VALIDATE_STRING (1, s1); @@ -275,9 +280,9 @@ SCM_DEFINE1 (scm_string_ci_gr_p, "string-ci>?", scm_tc7_rpsubr, SCM_DEFINE1 (scm_string_ci_geq_p, "string-ci>=?", scm_tc7_rpsubr, (SCM s1, SCM s2), - "Case insensitive lexicographic ordering predicate; \n" - "returns @t{#t} if @var{s1} is lexicographically greater than\n" - "or equal to @var{s2} regardless of case. (r5rs)") + "Case insensitive lexicographic ordering predicate;\n" + "returns @code{#t} if @var{s1} is lexicographically greater\n" + "than or equal to @var{s2} regardless of case. (r5rs)") #define FUNC_NAME s_scm_string_ci_geq_p { SCM_VALIDATE_STRING (1, s1); |