(n: int, singular: str, plural: str | None = None)
| 92 | |
| 93 | |
| 94 | def plural(n: int, singular: str, plural: str | None = None) -> str: |
| 95 | if n == 1: |
| 96 | return singular |
| 97 | elif plural is not None: |
| 98 | return plural |
| 99 | else: |
| 100 | return singular + 's' |
| 101 | |
| 102 | |
| 103 | def count(n: int, word: str) -> str: |
no outgoing calls
searching dependent graphs…