Edit task to support extra info

haskell
Oystein Kristoffer Tveit 2020-09-07 12:24:30 +02:00
parent 7dee70d3c6
commit ed529016bb
1 changed files with 38 additions and 6 deletions

View File

@ -1,14 +1,46 @@
# Known bug:
# The program will not accept a name consisting of a single name and a single surname
# when the surname only consists of the capital letters IVXLCDM and it will wrongly accept
# a surname consisting of those letters as Roman numerals. In order to fix, some more
# complex regex logic is needed.
import re
capitalize = lambda name: name.capitalize()
PREPOSITION_LIST = ['von', 'van', 'de', 'di']
PREPOSITION_LIST.extend(list(map(capitalize, PREPOSITION_LIST)))
SUFFIX_PATTERN = '[sj]r\.?'
ROMAN_NUMERAL_PATTERN = '[IVXLCDM]+\.?'
hasSuffix = lambda word: re.match(SUFFIX_PATTERN, word, re.IGNORECASE) is not None
hasRomanNumerals = lambda word: re.match(ROMAN_NUMERAL_PATTERN, word) is not None
def getName():
while True:
name = input('Jeg heter: ')
if (' ' in name):
return name.split(' ')
names = name.split(' ')
if not (len(names) == 2 and (hasSuffix(names[-1]) or hasRomanNumerals(names[-1]))):
return names
print('Putt et mellomrom mellom fornavn og etternavn')
capitalize = lambda name: name.capitalize()
names = list(map(capitalize, getName()))
firstNames = ' '.join(names[:-1])
lastName=names[-1]
firstNames = names[:-1]
lastNames=[names[-1]]
print(f'The name is {lastName}, {firstNames} {lastName}')
moveLastFirstNameToLastNames = lambda: lastNames.insert(0, firstNames.pop())
if hasSuffix or hasRomanNumerals:
moveLastFirstNameToLastNames()
hasPreposition = firstNames[-1] in PREPOSITION_LIST and len(firstNames) != 1
if hasPreposition:
moveLastFirstNameToLastNames()
lastNamesString = ' '.join(lastNames)
firstNamesString = ' '.join(firstNames)
print(f'The name is {lastNamesString}, {firstNamesString} {lastNamesString}')