kodecocodes
diff --git a/Collapse file
‎Trie/Trie/Trie/Trie.swift‎
Copy file name to clipboardExpand all lines: Trie/Trie/Trie/Trie.swift
+6-3Lines changed: 6 additions & 3 deletions b/Collapse file
‎Trie/Trie/Trie/Trie.swift‎
Copy file name to clipboardExpand all lines: Trie/Trie/Trie/Trie.swift
+6-3Lines changed: 6 additions & 3 deletions
diff --git a/Collapse file
‎Trie/Trie/TrieTests/TrieTests.swift‎
Copy file name to clipboardExpand all lines: Trie/Trie/TrieTests/TrieTests.swift
+26-1Lines changed: 26 additions & 1 deletion b/Collapse file
‎Trie/Trie/TrieTests/TrieTests.swift‎
Copy file name to clipboardExpand all lines: Trie/Trie/TrieTests/TrieTests.swift
+26-1Lines changed: 26 additions & 1 deletion
@@ -117,9 +117,12 @@ extension Trie {
 
   /// Determines whether a word is in the trie.
   ///
-  /// - Parameter word: the word to check for
+  /// - Parameters:
+  ///   - word: the word to check for
+  ///   - matchPrefix: whether the search word should match
+  ///   if it is only a prefix of other nodes in the trie
   /// - Returns: true if the word is present, false otherwise.
-  func contains(word: String) -> Bool {
+  func contains(word: String, matchPrefix: Bool = false) -> Bool {
     guard !word.isEmpty else {
       return false
     }
@@ -130,7 +133,7 @@ extension Trie {
       }
       currentNode = childNode
     }
-    return currentNode.isTerminating
+    return matchPrefix || currentNode.isTerminating
   }
 
   /// Attempts to walk to the last node of a word.  The
 
@@ -167,7 +167,8 @@ class TrieTests: XCTestCase {
     let trieCopy = NSKeyedUnarchiver.unarchiveObject(withFile: filePath) as? Trie
     XCTAssertEqual(trieCopy?.count, trie.count)
   }
-
+  
+  /// Tests whether word prefixes are properly found and returned.
   func testFindWordsWithPrefix() {
     let trie = Trie()
     trie.insert(word: "test")
@@ -190,4 +191,28 @@ class TrieTests: XCTestCase {
     let wordsUpperCase = trie.findWordsWithPrefix(prefix: "Te")
     XCTAssertEqual(wordsUpperCase.sorted(), ["team", "test"])
   }
+
+  /// Tests whether word prefixes are properly detected on a boolean contains() check.
+  func testContainsWordMatchPrefix() {
+    let trie = Trie()
+    trie.insert(word: "test")
+    trie.insert(word: "another")
+    trie.insert(word: "exam")
+    let wordsAll = trie.contains(word: "", matchPrefix: true)
+    XCTAssertEqual(wordsAll, true)
+    let words = trie.contains(word: "ex", matchPrefix: true)
+    XCTAssertEqual(words, true)
+    trie.insert(word: "examination")
+    let words2 = trie.contains(word: "exam", matchPrefix: true)
+    XCTAssertEqual(words2, true)
+    let noWords = trie.contains(word: "tee", matchPrefix: true)
+    XCTAssertEqual(noWords, false)
+    let unicodeWord = "😬😎"
+    trie.insert(word: unicodeWord)
+    let wordsUnicode = trie.contains(word: "😬", matchPrefix: true)
+    XCTAssertEqual(wordsUnicode, true)
+    trie.insert(word: "Team")
+    let wordsUpperCase = trie.contains(word: "Te", matchPrefix: true)
+    XCTAssertEqual(wordsUpperCase, true)
+  }
 }
Original file line number	Diff line number	Diff line change
`@@ -117,9 +117,12 @@ extension Trie {`
`117`	`117`
`118`	`118`	`/// Determines whether a word is in the trie.`
`119`	`119`	`///`
`120`		`- /// - Parameter word: the word to check for`
	`120`	`+ /// - Parameters:`
	`121`	`+ /// - word: the word to check for`
	`122`	`+ /// - matchPrefix: whether the search word should match`
	`123`	`+ /// if it is only a prefix of other nodes in the trie`
`121`	`124`	`/// - Returns: true if the word is present, false otherwise.`
`122`		`- func contains(word: String) -> Bool {`
	`125`	`+ func contains(word: String, matchPrefix: Bool = false) -> Bool {`
`123`	`126`	`guard !word.isEmpty else {`
`124`	`127`	`return false`
`125`	`128`	`}`
`@@ -130,7 +133,7 @@ extension Trie {`
`130`	`133`	`}`
`131`	`134`	`currentNode = childNode`
`132`	`135`	`}`
`133`		`- return currentNode.isTerminating`
	`136`	`+ return matchPrefix \|\| currentNode.isTerminating`
`134`	`137`	`}`
`135`	`138`
`136`	`139`	`/// Attempts to walk to the last node of a word. The`