1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
* Copyright (c) 1995-2004 Carnegie Mellon University. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* This work was supported in part by funding from the Defense Advanced
* Research Projects Agency and the National Science Foundation of the
* United States of America, and the CMU Sphinx Speech Consortium.
*
* THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND
* ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
* NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* ====================================================================
*
*/
/**
* @file strfuncs.h
* @brief Miscellaneous useful string functions
*/
#ifndef __SB_STRFUNCS_H__
#define __SB_STRFUNCS_H__
#include <stdarg.h>
/* Win32/WinCE DLL gunk */
#include <sphinxbase/sphinxbase_export.h>
#include <sphinxbase/prim_type.h>
#ifdef __cplusplus
extern "C" {
#endif
#if 0
/* Fool Emacs. */
}
#endif
/**
* Concatenate a NULL-terminated argument list of strings, returning a
* newly allocated string.
**/
SPHINXBASE_EXPORT
char *string_join(const char *base, ...);
/**
* Which end of a string to operate on for string_trim().
*/
enum string_edge_e {
STRING_START, /**< Beginning of string. */
STRING_END, /**< End of string. */
STRING_BOTH /**< Both ends of string. */
};
/**
* Remove whitespace from a string, modifying it in-place.
*
* @param string string to trim, contents will be modified.
* @param which one of STRING_START, STRING_END, or STRING_BOTH.
*/
SPHINXBASE_EXPORT
char *string_trim(char *string, enum string_edge_e which);
/**
* Locale independent version of atof().
*
* This function behaves like atof() in the "C" locale. Switching
* locale in a threaded program is extremely uncool, therefore we need
* this since we pass floats as strings in 1000 different places.
*/
SPHINXBASE_EXPORT
double atof_c(char const *str);
/* FIXME: Both of these string splitting functions basically suck. I
have attempted to fix them as best I can. (dhuggins@cs, 20070808) */
/**
* Convert a line to an array of "words", based on whitespace separators. A word
* is a string with no whitespace chars in it.
* Note that the string line is modified as a result: NULL chars are placed after
* every word in the line.
* Return value: No. of words found; -1 if no. of words in line exceeds n_wptr.
*/
SPHINXBASE_EXPORT
int32 str2words (char *line, /**< In/Out: line to be parsed. This
string will be modified! (NUL
characters inserted at word
boundaries) */
char **wptr, /**< In/Out: Array of pointers to
words found in line. The array
must be allocated by the caller.
It may be NULL in which case the
number of words will be counted.
This allows you to allcate it to
the proper size, e.g.:
n = str2words(line, NULL, 0);
wptr = ckd_calloc(n, sizeof(*wptr));
str2words(line, wptr, n);
*/
int32 n_wptr /**< In: Size of wptr array, ignored
if wptr == NULL */
);
/**
* Yet another attempt at a clean "next-word-in-string" function. See arguments below.
* @return Length of word returned, or -1 if nothing found.
* This allows you to scan through a line:
*
* <pre>
* while ((n = nextword(line, delim, &word, &delimfound)) >= 0) {
* ... do something with word ..
* word[n] = delimfound;
* line = word + n;
* }
* </pre>
*/
SPHINXBASE_EXPORT
int32 nextword (char *line, /**< Input: String being searched for next word.
Will be modified by this function (NUL characters inserted) */
const char *delim, /**< Input: A word, if found, must be delimited at either
end by a character from this string (or at the end
by the NULL char) */
char **word,/**< Output: *word = ptr within line to beginning of first
word, if found. Delimiter at the end of word replaced
with the NULL char. */
char *delimfound /**< Output: *delimfound = original delimiter found at the end
of the word. (This way, the caller can restore the
delimiter, preserving the original string.) */
);
#ifdef __cplusplus
}
#endif
#endif /* __SB_STRFUNCS_H__ */
|
