<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>SphinxBase: src/libsphinxbase/util/strfuncs.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">SphinxBase <span id="projectnumber">0.6</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('strfuncs_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/util/strfuncs.c</h1> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* ====================================================================</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (c) 1999-2006 Carnegie Mellon University. All rights</span>
<a name="l00004"></a>00004 <span class="comment"> * reserved.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00007"></a>00007 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00008"></a>00008 <span class="comment"> * are met:</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer. </span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer in</span>
<a name="l00015"></a>00015 <span class="comment"> * the documentation and/or other materials provided with the</span>
<a name="l00016"></a>00016 <span class="comment"> * distribution.</span>
<a name="l00017"></a>00017 <span class="comment"> *</span>
<a name="l00018"></a>00018 <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span>
<a name="l00019"></a>00019 <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span>
<a name="l00020"></a>00020 <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span>
<a name="l00021"></a>00021 <span class="comment"> *</span>
<a name="l00022"></a>00022 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span>
<a name="l00023"></a>00023 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span>
<a name="l00024"></a>00024 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00025"></a>00025 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span>
<a name="l00026"></a>00026 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span>
<a name="l00027"></a>00027 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span>
<a name="l00028"></a>00028 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span>
<a name="l00029"></a>00029 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span>
<a name="l00030"></a>00030 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span>
<a name="l00031"></a>00031 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span>
<a name="l00032"></a>00032 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00033"></a>00033 <span class="comment"> *</span>
<a name="l00034"></a>00034 <span class="comment"> * ====================================================================</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> */</span>
<a name="l00037"></a>00037 <span class="comment">/*</span>
<a name="l00038"></a>00038 <span class="comment"> * strfuncs.c -- String functions</span>
<a name="l00039"></a>00039 <span class="comment"> */</span>
<a name="l00040"></a>00040
<a name="l00041"></a>00041
<a name="l00042"></a>00042 <span class="preprocessor">#include <stdio.h></span>
<a name="l00043"></a>00043 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00044"></a>00044 <span class="preprocessor">#include <string.h></span>
<a name="l00045"></a>00045 <span class="preprocessor">#include <ctype.h></span>
<a name="l00046"></a>00046 <span class="preprocessor">#include <assert.h></span>
<a name="l00047"></a>00047 <span class="preprocessor">#include <stdarg.h></span>
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <span class="preprocessor">#include "sphinxbase/ckd_alloc.h"</span>
<a name="l00050"></a>00050 <span class="preprocessor">#include "sphinxbase/strfuncs.h"</span>
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="comment">/* Defined in dtoa.c */</span>
<a name="l00053"></a>00053 <span class="keywordtype">double</span> sb_strtod(<span class="keyword">const</span> <span class="keywordtype">char</span> *s00, <span class="keywordtype">char</span> **se);
<a name="l00054"></a>00054
<a name="l00055"></a>00055 <span class="keywordtype">double</span>
<a name="l00056"></a><a class="code" href="strfuncs_8h.html#ab708351fe7308551632a782bfad75a1e">00056</a> <a class="code" href="strfuncs_8h.html#ab708351fe7308551632a782bfad75a1e" title="Locale independent version of atof().">atof_c</a>(<span class="keywordtype">char</span> <span class="keyword">const</span> *str)
<a name="l00057"></a>00057 {
<a name="l00058"></a>00058 <span class="keywordflow">return</span> sb_strtod(str, NULL);
<a name="l00059"></a>00059 }
<a name="l00060"></a>00060
<a name="l00061"></a>00061 <span class="keywordtype">char</span> *
<a name="l00062"></a><a class="code" href="strfuncs_8h.html#a317522f23d291311e366de34ef86b777">00062</a> <a class="code" href="strfuncs_8h.html#a317522f23d291311e366de34ef86b777" title="Concatenate a NULL-terminated argument list of strings, returning a newly allocated string...">string_join</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *base, ...)
<a name="l00063"></a>00063 {
<a name="l00064"></a>00064 va_list args;
<a name="l00065"></a>00065 <span class="keywordtype">size_t</span> len;
<a name="l00066"></a>00066 <span class="keyword">const</span> <span class="keywordtype">char</span> *c;
<a name="l00067"></a>00067 <span class="keywordtype">char</span> *out;
<a name="l00068"></a>00068
<a name="l00069"></a>00069 va_start(args, base);
<a name="l00070"></a>00070 len = strlen(base);
<a name="l00071"></a>00071 <span class="keywordflow">while</span> ((c = va_arg(args, <span class="keyword">const</span> <span class="keywordtype">char</span> *)) != NULL) {
<a name="l00072"></a>00072 len += strlen(c);
<a name="l00073"></a>00073 }
<a name="l00074"></a>00074 len++;
<a name="l00075"></a>00075 va_end(args);
<a name="l00076"></a>00076
<a name="l00077"></a>00077 out = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(len, 1);
<a name="l00078"></a>00078 va_start(args, base);
<a name="l00079"></a>00079 strcpy(out, base);
<a name="l00080"></a>00080 <span class="keywordflow">while</span> ((c = va_arg(args, <span class="keyword">const</span> <span class="keywordtype">char</span> *)) != NULL) {
<a name="l00081"></a>00081 strcat(out, c);
<a name="l00082"></a>00082 }
<a name="l00083"></a>00083 va_end(args);
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="keywordflow">return</span> out;
<a name="l00086"></a>00086 }
<a name="l00087"></a>00087
<a name="l00088"></a>00088 <span class="keywordtype">char</span> *
<a name="l00089"></a><a class="code" href="strfuncs_8h.html#ac36a095632a4f16cf4e0fbcdb01de5ad">00089</a> <a class="code" href="strfuncs_8h.html#ac36a095632a4f16cf4e0fbcdb01de5ad" title="Remove whitespace from a string, modifying it in-place.">string_trim</a>(<span class="keywordtype">char</span> *<span class="keywordtype">string</span>, <span class="keyword">enum</span> <a class="code" href="strfuncs_8h.html#ab5c9ca15770a4bd3047705762b815df9" title="Which end of a string to operate on for string_trim().">string_edge_e</a> which)
<a name="l00090"></a>00090 {
<a name="l00091"></a>00091 <span class="keywordtype">size_t</span> len;
<a name="l00092"></a>00092
<a name="l00093"></a>00093 len = strlen(<span class="keywordtype">string</span>);
<a name="l00094"></a>00094 <span class="keywordflow">if</span> (which == <a class="code" href="strfuncs_8h.html#ab5c9ca15770a4bd3047705762b815df9a5e4d73e6ca445be10fa48351b9571125" title="Beginning of string.">STRING_START</a> || which == <a class="code" href="strfuncs_8h.html#ab5c9ca15770a4bd3047705762b815df9a4fcbb0fe16fa4aa48723ba3ba10c26dd" title="Both ends of string.">STRING_BOTH</a>) {
<a name="l00095"></a>00095 <span class="keywordtype">size_t</span> sub = strspn(<span class="keywordtype">string</span>, <span class="stringliteral">" \t\n\r\f"</span>);
<a name="l00096"></a>00096 <span class="keywordflow">if</span> (sub > 0) {
<a name="l00097"></a>00097 memmove(<span class="keywordtype">string</span>, <span class="keywordtype">string</span> + sub, len + 1 - sub);
<a name="l00098"></a>00098 len -= sub;
<a name="l00099"></a>00099 }
<a name="l00100"></a>00100 }
<a name="l00101"></a>00101 <span class="keywordflow">if</span> (which == <a class="code" href="strfuncs_8h.html#ab5c9ca15770a4bd3047705762b815df9a11f31598e50bf3cf1d0aa97d967bb9b9" title="End of string.">STRING_END</a> || which == <a class="code" href="strfuncs_8h.html#ab5c9ca15770a4bd3047705762b815df9a4fcbb0fe16fa4aa48723ba3ba10c26dd" title="Both ends of string.">STRING_BOTH</a>) {
<a name="l00102"></a>00102 <span class="keywordtype">long</span> sub = len;
<a name="l00103"></a>00103 <span class="keywordflow">while</span> (--sub >= 0)
<a name="l00104"></a>00104 <span class="keywordflow">if</span> (strchr(<span class="stringliteral">" \t\n\r\f"</span>, <span class="keywordtype">string</span>[sub]) == NULL)
<a name="l00105"></a>00105 <span class="keywordflow">break</span>;
<a name="l00106"></a>00106 <span class="keywordflow">if</span> (sub == -1)
<a name="l00107"></a>00107 <span class="keywordtype">string</span>[0] = <span class="charliteral">'\0'</span>;
<a name="l00108"></a>00108 <span class="keywordflow">else</span>
<a name="l00109"></a>00109 <span class="keywordtype">string</span>[sub+1] = <span class="charliteral">'\0'</span>;
<a name="l00110"></a>00110 }
<a name="l00111"></a>00111 <span class="keywordflow">return</span> string;
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113
<a name="l00114"></a>00114 int32
<a name="l00115"></a><a class="code" href="strfuncs_8h.html#a5b520fdebcca599db86faaf75a82173f">00115</a> <a class="code" href="strfuncs_8h.html#a5b520fdebcca599db86faaf75a82173f" title="Convert a line to an array of &quot;words&quot;, based on whitespace separators.">str2words</a>(<span class="keywordtype">char</span> *line, <span class="keywordtype">char</span> **ptr, int32 max_ptr)
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 int32 i, n;
<a name="l00118"></a>00118
<a name="l00119"></a>00119 n = 0; <span class="comment">/* #words found so far */</span>
<a name="l00120"></a>00120 i = 0; <span class="comment">/* For scanning through the input string */</span>
<a name="l00121"></a>00121 <span class="keywordflow">while</span> (1) {
<a name="l00122"></a>00122 <span class="comment">/* Skip whitespace before next word */</span>
<a name="l00123"></a>00123 <span class="keywordflow">while</span> (line[i] && isspace((<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>)line[i]))
<a name="l00124"></a>00124 ++i;
<a name="l00125"></a>00125 <span class="keywordflow">if</span> (!line[i])
<a name="l00126"></a>00126 <span class="keywordflow">break</span>;
<a name="l00127"></a>00127
<a name="l00128"></a>00128 <span class="keywordflow">if</span> (ptr != NULL && n >= max_ptr) {
<a name="l00129"></a>00129 <span class="comment">/*</span>
<a name="l00130"></a>00130 <span class="comment"> * Pointer array size insufficient. Restore NULL chars inserted so far</span>
<a name="l00131"></a>00131 <span class="comment"> * to space chars. Not a perfect restoration, but better than nothing.</span>
<a name="l00132"></a>00132 <span class="comment"> */</span>
<a name="l00133"></a>00133 <span class="keywordflow">for</span> (; i >= 0; --i)
<a name="l00134"></a>00134 <span class="keywordflow">if</span> (line[i] == <span class="charliteral">'\0'</span>)
<a name="l00135"></a>00135 line[i] = <span class="charliteral">' '</span>;
<a name="l00136"></a>00136
<a name="l00137"></a>00137 <span class="keywordflow">return</span> -1;
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="comment">/* Scan to end of word */</span>
<a name="l00141"></a>00141 <span class="keywordflow">if</span> (ptr != NULL)
<a name="l00142"></a>00142 ptr[n] = line + i;
<a name="l00143"></a>00143 ++n;
<a name="l00144"></a>00144 <span class="keywordflow">while</span> (line[i] && !isspace((<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>)line[i]))
<a name="l00145"></a>00145 ++i;
<a name="l00146"></a>00146 <span class="keywordflow">if</span> (!line[i])
<a name="l00147"></a>00147 <span class="keywordflow">break</span>;
<a name="l00148"></a>00148 <span class="keywordflow">if</span> (ptr != NULL)
<a name="l00149"></a>00149 line[i] = <span class="charliteral">'\0'</span>;
<a name="l00150"></a>00150 ++i;
<a name="l00151"></a>00151 }
<a name="l00152"></a>00152
<a name="l00153"></a>00153 <span class="keywordflow">return</span> n;
<a name="l00154"></a>00154 }
<a name="l00155"></a>00155
<a name="l00156"></a>00156
<a name="l00157"></a>00157 int32
<a name="l00158"></a><a class="code" href="strfuncs_8h.html#a41d9a59e4326b545bf1282401319f553">00158</a> <a class="code" href="strfuncs_8h.html#a41d9a59e4326b545bf1282401319f553" title="Yet another attempt at a clean &quot;next-word-in-string&quot; function.">nextword</a>(<span class="keywordtype">char</span> *line, <span class="keyword">const</span> <span class="keywordtype">char</span> *delim, <span class="keywordtype">char</span> **word, <span class="keywordtype">char</span> *delimfound)
<a name="l00159"></a>00159 {
<a name="l00160"></a>00160 <span class="keyword">const</span> <span class="keywordtype">char</span> *d;
<a name="l00161"></a>00161 <span class="keywordtype">char</span> *w;
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="comment">/* Skip past any preceding delimiters */</span>
<a name="l00164"></a>00164 <span class="keywordflow">for</span> (w = line; *w; w++) {
<a name="l00165"></a>00165 <span class="keywordflow">for</span> (d = delim; *d && (*d != *w); d++);
<a name="l00166"></a>00166 <span class="keywordflow">if</span> (!*d)
<a name="l00167"></a>00167 <span class="keywordflow">break</span>;
<a name="l00168"></a>00168 }
<a name="l00169"></a>00169 <span class="keywordflow">if</span> (!*w)
<a name="l00170"></a>00170 <span class="keywordflow">return</span> -1;
<a name="l00171"></a>00171
<a name="l00172"></a>00172 *word = w; <span class="comment">/* Beginning of word */</span>
<a name="l00173"></a>00173
<a name="l00174"></a>00174 <span class="comment">/* Skip until first delimiter char */</span>
<a name="l00175"></a>00175 <span class="keywordflow">for</span> (w++; *w; w++) {
<a name="l00176"></a>00176 <span class="keywordflow">for</span> (d = delim; *d && (*d != *w); d++);
<a name="l00177"></a>00177 <span class="keywordflow">if</span> (*d)
<a name="l00178"></a>00178 <span class="keywordflow">break</span>;
<a name="l00179"></a>00179 }
<a name="l00180"></a>00180
<a name="l00181"></a>00181 <span class="comment">/* Replace delimiter with NULL char, but return the original first */</span>
<a name="l00182"></a>00182 *delimfound = *w;
<a name="l00183"></a>00183 *w = <span class="charliteral">'\0'</span>;
<a name="l00184"></a>00184
<a name="l00185"></a>00185 <span class="keywordflow">return</span> (w - *word);
<a name="l00186"></a>00186 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>strfuncs.c</b> </li>
<li class="footer">Generated on Tue Apr 19 2011 for SphinxBase by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li>
</ul>
</div>
</body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
0b420d0fce195cf4115dc6a3be5c2da2
>
files
>
336
