SphinxBase 0.6

src/libsphinxbase/util/case.c

00001 /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
00002 /* ====================================================================
00003  * Copyright (c) 1999-2004 Carnegie Mellon University.  All rights
00004  * reserved.
00005  *
00006  * Redistribution and use in source and binary forms, with or without
00007  * modification, are permitted provided that the following conditions
00008  * are met:
00009  *
00010  * 1. Redistributions of source code must retain the above copyright
00011  *    notice, this list of conditions and the following disclaimer. 
00012  *
00013  * 2. Redistributions in binary form must reproduce the above copyright
00014  *    notice, this list of conditions and the following disclaimer in
00015  *    the documentation and/or other materials provided with the
00016  *    distribution.
00017  *
00018  * This work was supported in part by funding from the Defense Advanced 
00019  * Research Projects Agency and the National Science Foundation of the 
00020  * United States of America, and the CMU Sphinx Speech Consortium.
00021  *
00022  * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND 
00023  * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
00024  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00025  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
00026  * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
00027  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
00028  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 
00029  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
00030  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
00031  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
00032  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00033  *
00034  * ====================================================================
00035  *
00036  */
00037 /*
00038  * case.c -- Upper/lower case conversion routines
00039  *
00040  * **********************************************
00041  * CMU ARPA Speech Project
00042  *
00043  * Copyright (c) 1999 Carnegie Mellon University.
00044  * ALL RIGHTS RESERVED.
00045  * **********************************************
00046  * 
00047  * HISTORY
00048  * $Log: case.c,v $
00049  * Revision 1.7  2005/06/22 02:58:54  arthchan2003
00050  * Added  keyword
00051  *
00052  * Revision 1.3  2005/03/30 01:22:48  archan
00053  * Fixed mistakes in last updates. Add
00054  *
00055  * 
00056  * 18-Jun-97    M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon
00057  *              Added strcmp_nocase.  Moved UPPER_CASE and LOWER_CASE definitions to .h.
00058  * 
00059  * 16-Feb-97    M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon
00060  *              Created.
00061  */
00062 
00063 
00064 #include <stdlib.h>
00065 #include <assert.h>
00066 
00067 #include "sphinxbase/case.h"
00068 #include "sphinxbase/err.h"
00069 
00070 
00071 void
00072 lcase(register char *cp)
00073 {
00074     if (cp) {
00075         while (*cp) {
00076             *cp = LOWER_CASE(*cp);
00077             cp++;
00078         }
00079     }
00080 }
00081 
00082 void
00083 ucase(register char *cp)
00084 {
00085     if (cp) {
00086         while (*cp) {
00087             *cp = UPPER_CASE(*cp);
00088             cp++;
00089         }
00090     }
00091 }
00092 
00093 int32
00094 strcmp_nocase(const char *str1, const char *str2)
00095 {
00096     char c1, c2;
00097 
00098     if (str1 == str2)
00099         return 0;
00100     if (str1 && str2) {
00101         for (;;) {
00102             c1 = *(str1++);
00103             c1 = UPPER_CASE(c1);
00104             c2 = *(str2++);
00105             c2 = UPPER_CASE(c2);
00106             if (c1 != c2)
00107                 return (c1 - c2);
00108             if (c1 == '\0')
00109                 return 0;
00110         }
00111     }
00112     else
00113         return (str1 == NULL) ? -1 : 1;
00114 
00115     return 0;
00116 }
00117 
00118 int32
00119 strncmp_nocase(const char *str1, const char *str2, size_t len)
00120 {
00121     char c1, c2;
00122 
00123     if (str1 && str2) {
00124         size_t n;
00125 
00126         for (n = 0; n < len; ++n) {
00127             c1 = *(str1++);
00128             c1 = UPPER_CASE(c1);
00129             c2 = *(str2++);
00130             c2 = UPPER_CASE(c2);
00131             if (c1 != c2)
00132                 return (c1 - c2);
00133             if (c1 == '\0')
00134                 return 0;
00135         }
00136     }
00137     else
00138         return (str1 == NULL) ? -1 : 1;
00139 
00140     return 0;
00141 }