1 | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
---|
2 | /* ***** BEGIN LICENSE BLOCK *****
|
---|
3 | * Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
---|
4 | *
|
---|
5 | * The contents of this file are subject to the Mozilla Public License Version
|
---|
6 | * 1.1 (the "License"); you may not use this file except in compliance with
|
---|
7 | * the License. You may obtain a copy of the License at
|
---|
8 | * http://www.mozilla.org/MPL/
|
---|
9 | *
|
---|
10 | * Software distributed under the License is distributed on an "AS IS" basis,
|
---|
11 | * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
---|
12 | * for the specific language governing rights and limitations under the
|
---|
13 | * License.
|
---|
14 | *
|
---|
15 | * The Original Code is mozilla.org code.
|
---|
16 | *
|
---|
17 | * The Initial Developer of the Original Code is
|
---|
18 | * Netscape Communications Corporation.
|
---|
19 | * Portions created by the Initial Developer are Copyright (C) 1998
|
---|
20 | * the Initial Developer. All Rights Reserved.
|
---|
21 | *
|
---|
22 | * Contributor(s):
|
---|
23 | *
|
---|
24 | * Alternatively, the contents of this file may be used under the terms of
|
---|
25 | * either of the GNU General Public License Version 2 or later (the "GPL"),
|
---|
26 | * or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
---|
27 | * in which case the provisions of the GPL or the LGPL are applicable instead
|
---|
28 | * of those above. If you wish to allow use of your version of this file only
|
---|
29 | * under the terms of either the GPL or the LGPL, and not to allow others to
|
---|
30 | * use your version of this file under the terms of the MPL, indicate your
|
---|
31 | * decision by deleting the provisions above and replace them with the notice
|
---|
32 | * and other provisions required by the GPL or the LGPL. If you do not delete
|
---|
33 | * the provisions above, a recipient may use your version of this file under
|
---|
34 | * the terms of any one of the MPL, the GPL or the LGPL.
|
---|
35 | *
|
---|
36 | * ***** END LICENSE BLOCK ***** */
|
---|
37 |
|
---|
38 | #include "nsCRT.h"
|
---|
39 | #include "nsString.h"
|
---|
40 | #include "plstr.h"
|
---|
41 | #include <stdlib.h>
|
---|
42 |
|
---|
43 | // The return from strcmp etc is only defined to be postive, zero or
|
---|
44 | // negative. The magnitude of a non-zero return is irrelevant.
|
---|
45 | PRIntn sign(PRIntn val) {
|
---|
46 | if (val == 0)
|
---|
47 | return 0;
|
---|
48 | else {
|
---|
49 | if (val > 0)
|
---|
50 | return 1;
|
---|
51 | else
|
---|
52 | return -1;
|
---|
53 | }
|
---|
54 | }
|
---|
55 |
|
---|
56 |
|
---|
57 | // Verify that nsCRT versions of string comparison routines get the
|
---|
58 | // same answers as the native non-unicode versions. We only pass in
|
---|
59 | // iso-latin-1 strings, so the comparison must be valid.
|
---|
60 | static void Check(const char* s1, const char* s2, PRIntn n)
|
---|
61 | {
|
---|
62 | PRIntn clib = PL_strcmp(s1, s2);
|
---|
63 | PRIntn clib_n = PL_strncmp(s1, s2, n);
|
---|
64 | PRIntn clib_case = PL_strcasecmp(s1, s2);
|
---|
65 | PRIntn clib_case_n = PL_strncasecmp(s1, s2, n);
|
---|
66 |
|
---|
67 | nsAutoString t1,t2;
|
---|
68 | t1.AssignWithConversion(s1);
|
---|
69 | t2.AssignWithConversion(s2);
|
---|
70 | const PRUnichar* us1 = t1.get();
|
---|
71 | const PRUnichar* us2 = t2.get();
|
---|
72 |
|
---|
73 | PRIntn u2 = nsCRT::strcmp(us1, us2);
|
---|
74 | PRIntn u2_n = nsCRT::strncmp(us1, us2, n);
|
---|
75 |
|
---|
76 | NS_ASSERTION(sign(clib) == sign(u2), "strcmp");
|
---|
77 | NS_ASSERTION(sign(clib_n) == sign(u2_n), "strncmp");
|
---|
78 | }
|
---|
79 |
|
---|
80 | struct Test {
|
---|
81 | const char* s1;
|
---|
82 | const char* s2;
|
---|
83 | PRIntn n;
|
---|
84 | };
|
---|
85 |
|
---|
86 | static Test tests[] = {
|
---|
87 | { "foo", "foo", 3 },
|
---|
88 | { "foo", "fo", 3 },
|
---|
89 |
|
---|
90 | { "foo", "bar", 3 },
|
---|
91 | { "foo", "ba", 3 },
|
---|
92 |
|
---|
93 | { "foo", "zap", 3 },
|
---|
94 | { "foo", "za", 3 },
|
---|
95 |
|
---|
96 | { "bar", "foo", 3 },
|
---|
97 | { "bar", "fo", 3 },
|
---|
98 |
|
---|
99 | { "bar", "foo", 3 },
|
---|
100 | { "bar", "fo", 3 },
|
---|
101 | };
|
---|
102 | #define NUM_TESTS int((sizeof(tests) / sizeof(tests[0])))
|
---|
103 |
|
---|
104 | int main()
|
---|
105 | {
|
---|
106 | Test* tp = tests;
|
---|
107 | for (int i = 0; i < NUM_TESTS; i++, tp++) {
|
---|
108 | Check(tp->s1, tp->s2, tp->n);
|
---|
109 | }
|
---|
110 |
|
---|
111 | return 0;
|
---|
112 | }
|
---|