Feature: Wild Card Pattern Matching

[RicardoRibeiroRodrigues]

Summary of Change

This pull request implements a wildcard pattern matching algorithm, providing regular expression matching with support for the . and * wildcard characters. The . matches any single character, while * matches zero or more of the preceding element. The matching covers the entire input string, ensuring it fully aligns with the pattern.

Motivation

This feature offers a flexible and efficient way to perform pattern matching using basic wildcard characters, which is particularly useful in various text processing tasks.

Time Complexity

The time complexity of the WildCardMatcher is O(n*m), where n is the length of the input string and m is the length of the pattern.

• I have performed a self-review of my code
• My code follows the style guidelines of this project
• I have added tests that prove my fix is effective or that my feature works
• New and existing unit tests pass locally with my changes
• Comments in areas I changed are up to date
• I have added comments to hard-to-understand areas of my code
• I have made corresponding changes to the README.md

[codecov]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 94.96%. Comparing base (5c09c0e) to head (8362a50).
Report is 1 commits behind head on master.

Additional details and impacted files

@@           Coverage Diff           @@
##           master     #470   +/-   ##
=======================================
  Coverage   94.96%   94.96%           
=======================================
  Files         239      240    +1     
  Lines       10108    10156   +48     
  Branches     1432     1441    +9     
=======================================
+ Hits         9599     9645   +46     
+ Misses        392      391    -1     
- Partials      117      120    +3     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

[siriak]

Looks good, thanks!