• Main Page
  • Related Pages
  • Data Structures
  • Files
  • File List
  • Globals

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 "case.h"
00065 #include <stdlib.h>
00066 #include <assert.h>
00067 #include <err.h>
00068 
00069 
00070 void
00071 lcase(register char *cp)
00072 {
00073     if (cp) {
00074         while (*cp) {
00075             *cp = LOWER_CASE(*cp);
00076             cp++;
00077         }
00078     }
00079 }
00080 
00081 void
00082 ucase(register char *cp)
00083 {
00084     if (cp) {
00085         while (*cp) {
00086             *cp = UPPER_CASE(*cp);
00087             cp++;
00088         }
00089     }
00090 }
00091 
00092 int32
00093 strcmp_nocase(const char *str1, const char *str2)
00094 {
00095     char c1, c2;
00096 
00097     if (str1 == str2)
00098         return 0;
00099     if (str1 && str2) {
00100         for (;;) {
00101             c1 = *(str1++);
00102             c1 = UPPER_CASE(c1);
00103             c2 = *(str2++);
00104             c2 = UPPER_CASE(c2);
00105             if (c1 != c2)
00106                 return (c1 - c2);
00107             if (c1 == '\0')
00108                 return 0;
00109         }
00110     }
00111     else
00112         return (str1 == NULL) ? -1 : 1;
00113 
00114     return 0;
00115 }
00116 
00117 int32
00118 strncmp_nocase(const char *str1, const char *str2, size_t len)
00119 {
00120     char c1, c2;
00121 
00122     if (str1 && str2) {
00123         size_t n;
00124 
00125         for (n = 0; n < len; ++n) {
00126             c1 = *(str1++);
00127             c1 = UPPER_CASE(c1);
00128             c2 = *(str2++);
00129             c2 = UPPER_CASE(c2);
00130             if (c1 != c2)
00131                 return (c1 - c2);
00132             if (c1 == '\0')
00133                 return 0;
00134         }
00135     }
00136     else
00137         return (str1 == NULL) ? -1 : 1;
00138 
00139     return 0;
00140 }

Generated on Fri Jan 14 2011 for SphinxBase by  doxygen 1.7.1