chrislit /
abydos
| Conditions | 36 |
| Total Lines | 133 |
| Code Lines | 95 |
| Lines | 0 |
| Ratio | 0 % |
| Tests | 78 |
| CRAP Score | 36 |
| Changes | 0 | ||
Small methods make your code easier to understand, in particular if combined with a good name. Besides, if your method is small, finding a good name is usually much easier.
For example, if you find yourself adding comments to a method's body, this is usually a good sign to extract the commented part to a new method, and use the comment as a starting point when coming up with a good name for this new method.
Commonly applied refactorings include:
If many parameters/temporary variables are present:
Complex classes like abydos.phonetic._caverphone.Caverphone.encode() often do a lot of different things. To break such a class down, we need to identify a cohesive component within that class. A common approach to find such a component is to look for fields/methods that share the same prefixes, or suffixes.
Once you have determined the fields that belong together, you can apply the Extract Class refactoring. If the component makes sense as a sub-class, Extract Subclass is also a candidate, and is often faster.
| 1 | # -*- coding: utf-8 -*- |
||
| 41 | 1 | def encode(self, word, version=2): |
|
| 42 | """Return the Caverphone code for a word. |
||
| 43 | |||
| 44 | :param str word: the word to transform |
||
| 45 | :param int version: the version of Caverphone to employ for encoding |
||
| 46 | (defaults to 2) |
||
| 47 | :returns: the Caverphone value |
||
| 48 | :rtype: str |
||
| 49 | |||
| 50 | >>> pe = Caverphone() |
||
| 51 | >>> pe.encode('Christopher') |
||
| 52 | 'KRSTFA1111' |
||
| 53 | >>> pe.encode('Niall') |
||
| 54 | 'NA11111111' |
||
| 55 | >>> pe.encode('Smith') |
||
| 56 | 'SMT1111111' |
||
| 57 | >>> pe.encode('Schmidt') |
||
| 58 | 'SKMT111111' |
||
| 59 | |||
| 60 | >>> pe.encode('Christopher', 1) |
||
| 61 | 'KRSTF1' |
||
| 62 | >>> pe.encode('Niall', 1) |
||
| 63 | 'N11111' |
||
| 64 | >>> pe.encode('Smith', 1) |
||
| 65 | 'SMT111' |
||
| 66 | >>> pe.encode('Schmidt', 1) |
||
| 67 | 'SKMT11' |
||
| 68 | """ |
||
| 69 | 1 | word = word.lower() |
|
| 70 | 1 | word = ''.join(c for c in word if c in self._lc_set) |
|
| 71 | |||
| 72 | 1 | def _squeeze_replace(word, char): |
|
| 73 | """Convert strings of char in word to one instance of new_char.""" |
||
| 74 | 1 | while char * 2 in word: |
|
| 75 | 1 | word = word.replace(char * 2, char) |
|
| 76 | 1 | return word.replace(char, char.upper()) |
|
| 77 | |||
| 78 | # the main replacement algorithm |
||
| 79 | 1 | if version != 1 and word[-1:] == 'e': |
|
| 80 | 1 | word = word[:-1] |
|
| 81 | 1 | if word: |
|
| 82 | 1 | if word[:5] == 'cough': |
|
| 83 | 1 | word = 'cou2f' + word[5:] |
|
| 84 | 1 | if word[:5] == 'rough': |
|
| 85 | 1 | word = 'rou2f' + word[5:] |
|
| 86 | 1 | if word[:5] == 'tough': |
|
| 87 | 1 | word = 'tou2f' + word[5:] |
|
| 88 | 1 | if word[:6] == 'enough': |
|
| 89 | 1 | word = 'enou2f' + word[6:] |
|
| 90 | 1 | if version != 1 and word[:6] == 'trough': |
|
| 91 | 1 | word = 'trou2f' + word[6:] |
|
| 92 | 1 | if word[:2] == 'gn': |
|
| 93 | 1 | word = '2n' + word[2:] |
|
| 94 | 1 | if word[-2:] == 'mb': |
|
| 95 | 1 | word = word[:-1] + '2' |
|
| 96 | 1 | for src, tar in ( |
|
| 97 | ('cq', '2q'), |
||
| 98 | ('ci', 'si'), |
||
| 99 | ('ce', 'se'), |
||
| 100 | ('cy', 'sy'), |
||
| 101 | ('tch', '2ch'), |
||
| 102 | ('c', 'k'), |
||
| 103 | ('q', 'k'), |
||
| 104 | ('x', 'k'), |
||
| 105 | ('v', 'f'), |
||
| 106 | ('dg', '2g'), |
||
| 107 | ('tio', 'sio'), |
||
| 108 | ('tia', 'sia'), |
||
| 109 | ('d', 't'), |
||
| 110 | ('ph', 'fh'), |
||
| 111 | ('b', 'p'), |
||
| 112 | ('sh', 's2'), |
||
| 113 | ('z', 's'), |
||
| 114 | ): |
||
| 115 | 1 | word = word.replace(src, tar) |
|
| 116 | 1 | if word[0] in self._lc_v_set: |
|
| 117 | 1 | word = 'A' + word[1:] |
|
| 118 | 1 | for vowel in 'aeiou': |
|
| 119 | 1 | word = word.replace(vowel, '3') |
|
| 120 | 1 | if version != 1: |
|
| 121 | 1 | word = word.replace('j', 'y') |
|
| 122 | 1 | if word[:2] == 'y3': |
|
| 123 | 1 | word = 'Y3' + word[2:] |
|
| 124 | 1 | if word[:1] == 'y': |
|
| 125 | 1 | word = 'A' + word[1:] |
|
| 126 | 1 | word = word.replace('y', '3') |
|
| 127 | 1 | for src, tar in (('3gh3', '3kh3'), ('gh', '22'), ('g', 'k')): |
|
| 128 | 1 | word = word.replace(src, tar) |
|
| 129 | |||
| 130 | 1 | for char in 'stpkfmn': |
|
| 131 | 1 | word = _squeeze_replace(word, char) |
|
| 132 | |||
| 133 | 1 | word = word.replace('w3', 'W3') |
|
| 134 | 1 | if version == 1: |
|
| 135 | 1 | word = word.replace('wy', 'Wy') |
|
| 136 | 1 | word = word.replace('wh3', 'Wh3') |
|
| 137 | 1 | if version == 1: |
|
| 138 | 1 | word = word.replace('why', 'Why') |
|
| 139 | 1 | if version != 1 and word[-1:] == 'w': |
|
| 140 | 1 | word = word[:-1] + '3' |
|
| 141 | 1 | word = word.replace('w', '2') |
|
| 142 | 1 | if word[:1] == 'h': |
|
| 143 | 1 | word = 'A' + word[1:] |
|
| 144 | 1 | word = word.replace('h', '2') |
|
| 145 | 1 | word = word.replace('r3', 'R3') |
|
| 146 | 1 | if version == 1: |
|
| 147 | 1 | word = word.replace('ry', 'Ry') |
|
| 148 | 1 | if version != 1 and word[-1:] == 'r': |
|
| 149 | 1 | word = word[:-1] + '3' |
|
| 150 | 1 | word = word.replace('r', '2') |
|
| 151 | 1 | word = word.replace('l3', 'L3') |
|
| 152 | 1 | if version == 1: |
|
| 153 | 1 | word = word.replace('ly', 'Ly') |
|
| 154 | 1 | if version != 1 and word[-1:] == 'l': |
|
| 155 | 1 | word = word[:-1] + '3' |
|
| 156 | 1 | word = word.replace('l', '2') |
|
| 157 | 1 | if version == 1: |
|
| 158 | 1 | word = word.replace('j', 'y') |
|
| 159 | 1 | word = word.replace('y3', 'Y3') |
|
| 160 | 1 | word = word.replace('y', '2') |
|
| 161 | 1 | word = word.replace('2', '') |
|
| 162 | 1 | if version != 1 and word[-1:] == '3': |
|
| 163 | 1 | word = word[:-1] + 'A' |
|
| 164 | 1 | word = word.replace('3', '') |
|
| 165 | |||
| 166 | # pad with 1s, then extract the necessary length of code |
||
| 167 | 1 | word += '1' * 10 |
|
| 168 | 1 | if version != 1: |
|
| 169 | 1 | word = word[:10] |
|
| 170 | else: |
||
| 171 | 1 | word = word[:6] |
|
| 172 | |||
| 173 | 1 | return word |
|
| 174 | |||
| 212 |
Loading history...