Feature BRE_FR_066 visualisation
Feature-ID: BRE_FR_066
Category: definitions
Feature-Name: longest match
Feature-Explanation: The search for a matching sequence starts at the beginning of a string and stops when the first sequence matching the expression is found, where "first" is defined to mean "begins earliest in the string". If a pattern permits a variable number of matching characters and thus there is more than one such sequence starting at that point, the longest such sequence is matched.
Source: Extracted from: IEEE Std 1003.1™-2017 (Revision of IEEE Std 1003.1-2008), 9.1 - matched \
ID | Search text | Regex pattern | Expected Output* |
---|---|---|---|
AKT_RE_DEF_001 | TST_DS_008 | "(wee | week)(knights |
AKT_RE_DEF_002 | abbbc | bb*' | {1}, {{bbb}} |
Documentation - Features for visualisation
Acceptance Criteria:
-
All acceptance criteria are fulfilled -
Diagramm displays the Regex right -
The right number of Matches and the right matches are shown
Definition of Done:
-
All Code ist commented (Docblocks, English) -
The unit tests were written, executed and passed (includes old code that is used) -
Every acceptance cirteria have at least a test case associated -
Has been peer-reviewed -
Documentation is updated -
The user interface is according to the design -
Acceptance of stakeholder
Edited by Kristian Joerns