Hierarchy

⤷

⤷

Basic Data
Data Element | TYP_P_REFA_AFFINITY1_EXCL |
Short Description | Affinity |
Data Type
Category of Dictionary Type | D | Domain |
Type of Object Referenced | No Information | |
Domain / Name of Reference Type | TYP_P_REFA_AFFINITY | |
Data Type | NUMC | Character string with only digits |
Length | 2 | |
Decimal Places | 0 | |
Output Length | 2 | |
Value Table |
Further Characteristics
Search Help: Name | ||
Search Help: Parameters | ||
Parameter ID | ||
Default Component name | ||
Change document | ||
No Input History | ||
Basic direction is set to LTR | ||
No BIDI Filtering |
Field Label
Length | Field Label | |
Short | 10 | Affinity |
Medium | 20 | Affinity |
Long | 35 | Affinity |
Heading | 40 | Affinity |
Documentation
Definition
The affinity determines the level of similarity to the word you want to find.
'Substring': The system excludes the code lines that contain the specified string as a substring.
'Word' (= distance 0): The system excludes the code lines that contain the specified string as a word. Words are substrings in the code lines that are separated by spaces. Commas and periods at the end of a code line are disregarded.
'Distance 1': The system excludes code lines that contain a word that differs from the word you want to find by a maximum of one character-based insertion/deletion/modification. The difference in characters to the words to be compared is 1.
'Distance 2': The system excludes code lines that contain a word that differs from the word you want to find by a maximum of two character-based insertions/deletions/modifications. The difference in characters to the words to be compared is 2.
'Regular expression': The system finds the code lines that satisfy the regular expression.
Note: Distance n between two words w1 and w2 means that the edit distance (Levenshtein distance) between w1 and w2 is n.
Use
Dependencies
Example
History
Last changed by/on | SAP | 20110908 |
SAP Release Created in | 710 |