|
|
1.1 root 1: .\" Copyright (c) 1990 The Regents of the University of California.
2: .\" All rights reserved.
3: .\"
4: .\" This code is derived from software contributed to Berkeley by
5: .\" Chris Torek.
6: .\"
7: .\" Redistribution and use in source and binary forms are permitted provided
8: .\" that: (1) source distributions retain this entire copyright notice and
9: .\" comment, and (2) distributions including binaries display the following
10: .\" acknowledgement: ``This product includes software developed by the
11: .\" University of California, Berkeley and its contributors'' in the
12: .\" documentation or other materials provided with the distribution and in
13: .\" all advertising materials mentioning features or use of this software.
14: .\" Neither the name of the University nor the names of its contributors may
15: .\" be used to endorse or promote products derived from this software without
16: .\" specific prior written permission.
17: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
18: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
19: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
20: .\"
21: .\" @(#)strcoll.3 5.3 (Berkeley) 6/24/90
22: .\"
23: .TH STRCOLL 3 "June 24, 1990"
24: .UC 4
25: .SH NAME
26: strcoll \- compare strings according to current collation
27: .SH SYNOPSIS
28: .nf
29: .ft B
30: #include <string.h>
31:
32: int
33: strcoll(const char *s1, const char *s2);
34: .ft R
35: .fi
36: .SH DESCRIPTION
37: .B Strcoll
38: compares null-terminated strings
39: .I s1
40: and
41: .I s2
42: according to the current locale collation
43: and returns an integer greater than, equal to, or less than 0,
44: according as
45: .I s1
46: is lexicographically greater than, equal to, or less than
47: .IR s2 .
48: .SH SEE ALSO
49: bcmp(3), memcmp(3), setlocale(3), strcasecmp(3), strcmp(3), strcoll(3),
50: strxfrm(3)
51: .SH STANDARDS
52: .B Strcoll
53: conforms to ANSI X3.159-1989 (``ANSI C'').
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.