Open nus-se-script opened 5 days ago
Thank you for your valuable feedback!
1) The flaw does not prevent the user from finding the desired client, hence it is unfair to say occasional inconvenience is caused.
2) The product works as specified in the UG/ DG.
3) We adopted the same principles as the teaching time (i.e. Applying an AND constraint on search keywords means the user will miss out on potentially useful search results unless they remember exactly the words they are looking for. But if an OR constraint is used, the user can retrieve results even if they mis-remember some of the search terms).
1) As the feature serves its intended purpose as specified in the UG and DG, rectifying it is less important than the work that has been done already. 2) The supposed 'better' implementation, could be a new feature, which will take more effort on top of the current implementation, reducing the effort available to spend on other more important tasks. 3) Software does not crash/ fail, user can still find desired client.
--
Approach to 'find' not ideal for large databases
Since your system is meant to help users to deal with "overwhelming client data", you may wish to make it possible for users to have a unique method of finding clients by name.
Since your users may wish to store a large number of clients' details, there may well be overlapping names.
Consider a case where there are 8 people with a common first name, “John”, 10 people with a common last name, “Tan”, and only 1 person with the name “John Tan”.
The user may wish to narrow the search from “John” to “John Tan” when looking for a specific individual for that name, but doing so actually expands the search. Thus, this approach makes it more time-consuming when the user already knows the full name of the contact he is looking for, but has no easy way to search for it among duplicate and common names.
Severity
Medium Reference – cs2103 bug severity levels
Desktop
[original: nus-cs2103-AY2425S1/pe-interim#3140] [original labels: severity.Medium type.FeatureFlaw]