Transition to libbindgen sub-crate

- The root crate is the `bindgen` binary
- Rust-ify the test suite, no more subprocesses!
- Update Travis config to test both crates

1 files changed, 66 insertions, 0 deletions

diff --git a/libbindgen/src/regex_set.rs b/libbindgen/src/regex_set.rs
new file mode 100644
index 00000000..93130590
--- /dev/null
+++ b/libbindgen/src/regex_set.rs
@@ -0,0 +1,66 @@
+//! A type that represents the union of a set of regular expressions.
+
+use regex::Regex;
+use std::borrow::Borrow;
+
+// Yeah, I'm aware this is sorta crappy, should be cheaper to compile a regex
+// ORing all the patterns, I guess...
+
+/// A dynamic set of regular expressions.
+#[derive(Debug)]
+pub struct RegexSet {
+    items: Vec<Regex>,
+}
+
+impl RegexSet {
+    /// Is this set empty?
+    pub fn is_empty(&self) -> bool {
+        self.items.is_empty()
+    }
+
+    /// Extend this set with every regex in the iterator.
+    pub fn extend<I>(&mut self, iter: I)
+        where I: IntoIterator<Item = String>,
+    {
+        for s in iter.into_iter() {
+            self.insert(&s)
+        }
+    }
+
+    /// Insert a new regex into this set.
+    pub fn insert<S>(&mut self, string: &S)
+        where S: Borrow<str>,
+    {
+        let s = string.borrow();
+        match Regex::new(&format!("^{}$", s)) {
+            Ok(r) => {
+                self.items.push(r);
+            }
+            Err(err) => {
+                error!("Invalid pattern provided: {}, {:?}", s, err);
+            }
+        }
+    }
+
+    /// Does the given `string` match any of the regexes in this set?
+    pub fn matches<S>(&self, string: &S) -> bool
+        where S: Borrow<str>,
+    {
+        let s = string.borrow();
+        for r in &self.items {
+            if r.is_match(s) {
+                return true;
+            }
+        }
+
+        false
+    }
+}
+
+impl Default for RegexSet {
+    fn default() -> Self {
+        RegexSet {
+            items: vec![],
+        }
+    }
+}