https://github.com/innerjoin/cpp-testat2

KWIC algorithm implementation
https://github.com/innerjoin/cpp-testat2

Last synced: about 16 hours ago
JSON representation

KWIC algorithm implementation

• Host: GitHub
• URL: https://github.com/innerjoin/cpp-testat2
• Owner: innerjoin
• Created: 2015-11-11T14:30:40.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2015-12-14T07:46:52.000Z (almost 9 years ago)
• Last Synced: 2023-02-26T13:03:29.271Z (over 1 year ago)
• Language: C++
• Homepage:
• Size: 6.84 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# CPP-Testat2

My personal solution for the second 'Testat' @ HSR Hochschule für Technik Rapperswil. There is still room for some improvement, but that this solution can be considered save to pass the review.

# Reqirements

From Parnas [ Parnas72 ] we have a concise definition of the Keyword in Context problem:

> The KWIC index system accepts an ordered set of lines, each line is an ordered set of words, and each word is an ordered set of characters. Any line may be "circularly shifted" by repeatedly removing the first word and appending it at the end of the line. The KWIC index system outputs a listing of all circular shifts of all lines in alphabetical order. 

Write a program kwic that reads lines from standard input and creates the variations of the line where each word is in front once. Output the stored lines in sorted order, so that you can see, how the words are used in context.

Example input:

> this is a test 


> this is another test

result:

> a test this is 


> another test this is 


> is a test this 


> is another test this 


> test this is a 


> test this is another 


> this is a test 


> this is another test 


### Tipps:

  - use algorithms rotate or rotate_copy to generate the word lists for each line.

  - You must use your word class from ExW6 to be able to ignore punctuation and case of the letters.

  - Use the appropriate data structures to achieve the result without unnecessary code or loops.

  - In addition to the test of your word class you can also separate your logic into independently testable functions, provide the tests and your main() function.