aboutsummaryrefslogtreecommitdiffhomepage
path: root/parser.h
diff options
context:
space:
mode:
authorGravatar ridiculousfish <corydoras@ridiculousfish.com>2012-01-29 22:06:58 -0800
committerGravatar ridiculousfish <corydoras@ridiculousfish.com>2012-01-29 22:06:58 -0800
commit3b8a4e56b0af8461f0f2f4c9469aba0e5a7536ba (patch)
tree6c8421d0c496d9e22fbfc2da07a0d22d50800373 /parser.h
parent966cd6a8ca5f4fa2257f8baa9ccc5a173762658b (diff)
A bunch of work to move towards a sane memory model in job_t
Diffstat (limited to 'parser.h')
-rw-r--r--parser.h6
1 files changed, 3 insertions, 3 deletions
diff --git a/parser.h b/parser.h
index 8c111e1e..0d6cec3c 100644
--- a/parser.h
+++ b/parser.h
@@ -236,7 +236,7 @@ class parser_t {
int current_tokenizer_pos;
/** List of called functions, used to help prevent infinite recursion */
- std::vector<wcstring> forbidden_function;
+ wcstring_list_t forbidden_function;
/** String index where the current job started. */
int job_start_pos;
@@ -395,7 +395,7 @@ class parser_t {
inside of a conditional block. This is to remove some possibilities
of infinite recursion.
*/
- void forbid_function( wchar_t *function );
+ void forbid_function( const wcstring &function );
/**
Undo last call to parser_forbid_function().
*/
@@ -417,7 +417,7 @@ class parser_t {
\param s the string to test
\param min_match is the minimum number of characters that must match in a long style option, i.e. the longest common prefix between --help and any other option. If less than 3, 3 will be assumed.
*/
- int is_help( wchar_t *s, int min_match ) const;
+ int is_help( const wchar_t *s, int min_match ) const;
/**
Returns the file currently evaluated by the parser. This can be