Keyword search

[swapnalshahil]

Description

Keyword search - Implementation of keyword search to get all the cases that have the searched keyword. Create API which will give all the cases which include the "searched keyword". (this will help in the front-end part) API: http://127.0.0.1:5000/keyword/search method = POST { "keyword": "word" }

Fixes #193

Type of change

• [ ] Bug fix (non-breaking change which fixes an issue)
• [x] New feature (non-breaking change which adds functionality)
• [ ] Breaking change (fix or feature that would cause existing functionality to not work as expected)
• [ ] This change requires a documentation update

How Has This Been Tested?

POSTMAN

Checklist:

• [x] My code follows the style guidelines of this project
• [x] I have performed a self-review of my own code
• [x] I have commented my code, particularly in hard-to-understand areas
• [ ] I have made corresponding changes to the documentation
• [x] My changes generate no new warnings
• [ ] 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
• [ ] Any dependent changes have been merged and published in downstream modules

[swapnalshahil]

@shivanshu1333 sir! Please review. 🙂

[swapnalshahil]

Description

Implement keyword search from cases. Create API which will give the path if searched keyword present in a particular data. (this will help in the front-end part)

API: http://127.0.0.1:5000/keyword//search

method = ["POST"] { "case_name": "Case1", "keyword": "word" }

Fixes: #194

Type of change

• [x] Bug fix (non-breaking change which fixes an issue)
• [x] New feature (non-breaking change which adds functionality)
• [ ] Breaking change (fix or feature that would cause existing functionality to not work as expected)
• [ ] This change requires a documentation update

How Has This Been Tested?

POSTMAN

Checklist:

• [x] My code follows the style guidelines of this project
• [x] I have performed a self-review of my own code
• [x] I have commented my code, particularly in hard-to-understand areas
• [ ] I have made corresponding changes to the documentation
• [x] My changes generate no new warnings
• [ ] 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
• [ ] Any dependent changes have been merged and published in downstream modules

[swapnalshahil]

@shivanshu1333 sir! I read about different algorithms to get optimal methods for keyword search. Here are some: m is the length of the pattern, n the length of the searchable text

1. Rabin Karp algorithm - > Time complexity : average Θ(n + m),worst Θ((n−m)m) and Space O(1)
2. KMP algorithm -> Time complexity: Θ(n) and Space Θ(m)
3. Boyer Moore string search algo. -> Time complexity : best Ω(n/m),worst O(mn) and Space Θ(k)
4. Two-way string match algo. -> Time complexity : O(n+m) and space O(1)

These are some mostly used algorithms. However, from Python 3.10, the algorithm was updated to use an enhanced version of the Crochemore and Perrin's Two-Way string matching algorithm.

(source) https://github.com/python/cpython/blob/main/Objects/stringlib/stringlib_find_two_way_notes.txt

PS: I think I used the same method which is efficient and in @python.🙂

[swapnalshahil]

@shivanshu1333 sir I am having python linter by Microsoft in my vs code.

[shivanshuraj1333]

Can you please try to fix it?

[swapnalshahil]

Now I think it's good!