Adding upstream version 0.11.2.upstream/0.11.2

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 96 insertions, 0 deletions

diff --git a/test/drive_shlexer.cc b/test/drive_shlexer.cc
new file mode 100644
index 0000000..fe6f15f
--- /dev/null
+++ b/test/drive_shlexer.cc
@@ -0,0 +1,96 @@
+/**
+ * Copyright (c) 2015, Timothy Stack
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * * Redistributions of source code must retain the above copyright notice, this
+ * list of conditions and the following disclaimer.
+ * * 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.
+ * * Neither the name of Timothy Stack nor the names of its contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
+ * EXPRESS 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 THE REGENTS OR CONTRIBUTORS 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.
+ */
+
+#include <stdlib.h>
+
+#include "config.h"
+#include "shlex.hh"
+
+using namespace std;
+
+const char* ST_TOKEN_NAMES[] = {
+    "err",
+    "wsp",
+    "esc",
+    "dst",
+    "den",
+    "sst",
+    "sen",
+    "ref",
+    "qrf",
+    "til",
+};
+
+int
+main(int argc, char* argv[])
+{
+    if (argc < 2) {
+        fprintf(stderr, "error: expecting an argument to parse\n");
+        exit(EXIT_FAILURE);
+    }
+
+    shlex lexer(argv[1], strlen(argv[1]));
+    string_fragment cap;
+    shlex_token_t token;
+
+    printf("    %s\n", argv[1]);
+    while (lexer.tokenize(cap, token)) {
+        int lpc;
+
+        printf("%s ", ST_TOKEN_NAMES[(int) token]);
+        for (lpc = 0; lpc < cap.sf_end; lpc++) {
+            if (lpc == cap.sf_begin) {
+                fputc('^', stdout);
+            } else if (lpc == (cap.sf_end - 1)) {
+                fputc('^', stdout);
+            } else if (lpc > cap.sf_begin) {
+                fputc('-', stdout);
+            } else {
+                fputc(' ', stdout);
+            }
+        }
+        printf("\n");
+    }
+
+    lexer.reset();
+    std::string result;
+    if (lexer.eval(result, map<string, string>())) {
+        printf("eval -- %s\n", result.c_str());
+    }
+    lexer.reset();
+    std::vector<std::string> sresult;
+    if (lexer.split(sresult, map<string, string>())) {
+        printf("split:\n");
+        for (size_t lpc = 0; lpc < sresult.size(); lpc++) {
+            printf("  %zu -- %s\n", lpc, sresult[lpc].c_str());
+        }
+    }
+
+    return EXIT_SUCCESS;
+}