From 5203efbbcb7334a68116ba6d4d4bf3d2d1e2a175 Mon Sep 17 00:00:00 2001
From: robert-bor <bor.robert@gmail.com>
Date: Wed, 23 Sep 2015 20:56:24 +0200
Subject: [PATCH] Extra explanation on containsMatch

---
 README.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 6049dbf..93eee5a 100644
--- a/README.md
+++ b/README.md
@@ -122,7 +122,8 @@ finds.
     Emit firstMatch = trie.firstMatch("ababcbab");
 ```
 
-The firstMatch will now be "ababc" found at position 0.
+The firstMatch will now be "ababc" found at position 0. containsMatch just checks if there is a firstMatch and
+returns true if that is the case.
 
 If you just want the barebones Aho-Corasick algorithm (ie, no dealing with case insensitivity, overlaps and whole
  words) and you prefer to add your own handler to the mix, that is also possible.