Duplicate code is one of the most pungent code smells. A rule that is often used is to re-structure code once it is duplicated in three or more places.
Common duplication problems, and corresponding solutions are:
1 | <?php |
||
17 | class GeoFixer |
||
18 | { |
||
19 | use TranslitTrait; |
||
20 | use LevenshteinAlgorithmTrait; |
||
21 | |||
22 | protected $strict = false; |
||
23 | protected $first_letters = false; |
||
24 | protected $full_settlements = false; |
||
25 | |||
26 | /** |
||
27 | * @param $word |
||
28 | * @param $search_array |
||
29 | * |
||
30 | * @return string |
||
31 | */ |
||
32 | 23 | public function findSimilarWord($word, $search_array) |
|
51 | |||
52 | /** |
||
53 | * @param $region |
||
54 | * |
||
55 | * @return bool|mixed |
||
56 | */ |
||
57 | 8 | public function findFiasRegion($region) |
|
58 | { |
||
59 | 8 | $regions = new RegionsDatabaseQuery(); |
|
60 | 8 | $regions = $regions->getRegions(); |
|
61 | |||
62 | 8 | if (is_integer($this->first_letters)) { |
|
63 | 2 | $regions = $regions->firstLetters(substr($region, 0, $this->first_letters)); |
|
64 | } |
||
65 | |||
66 | 8 | $regions = $regions->findAll(); |
|
67 | |||
68 | 8 | $titles = []; |
|
69 | 8 | $regions_with_codes = []; |
|
70 | |||
71 | 8 | foreach ($regions as $v) { |
|
72 | 8 | $regions_with_codes[$v['title']] = $v['code']; |
|
73 | 8 | $titles[] = $v['title']; |
|
74 | } |
||
75 | |||
76 | 8 | $result = $this->findSimilarWord($region, $titles); |
|
77 | |||
78 | 8 | return $result ? $regions_with_codes[$result] : false; |
|
79 | } |
||
80 | |||
81 | /** |
||
82 | * @param $city |
||
83 | * @param $region_code |
||
84 | * |
||
85 | * @return bool|mixed |
||
86 | */ |
||
87 | 4 | View Code Duplication | public function findFiasSettlements($city, $region_code) |
88 | { |
||
89 | 4 | $settlements = new SettlementsDatabaseQuery(); |
|
90 | 4 | $settlements = $settlements->getSettlements()->regionCode($region_code)->addressLevel(); |
|
91 | |||
92 | 4 | if (is_integer($this->first_letters)) { |
|
93 | 1 | $settlements = $settlements->firstLetters(substr($city, 0, $this->first_letters)); |
|
94 | } |
||
95 | |||
96 | 4 | $settlements = $settlements->findAll(); |
|
97 | |||
98 | 4 | $titles = []; |
|
99 | 4 | $settlements_with_id = []; |
|
100 | |||
101 | 4 | foreach ($settlements as $v) { |
|
102 | 4 | $settlements_with_id[$v['title']] = $v['address_id']; |
|
103 | 4 | $titles[] = $v['title']; |
|
104 | } |
||
105 | |||
106 | 4 | $result = $this->findSimilarWord($city, $titles); |
|
107 | |||
108 | 4 | return $result ? $settlements_with_id[$result] : false; |
|
109 | } |
||
110 | |||
111 | /** |
||
112 | * @param $city |
||
113 | * @param $region_code |
||
114 | * |
||
115 | * @return bool|mixed |
||
116 | */ |
||
117 | 4 | public function findKladrSettlements($city, $region_code) |
|
118 | { |
||
119 | 4 | $settlements = new SettlementsDatabaseQuery(); |
|
120 | 4 | $settlements = $settlements->getSettlements()->regionCode($region_code)->addressLevel(); |
|
121 | |||
122 | 4 | if (is_integer($this->first_letters)) { |
|
123 | 1 | $settlements = $settlements->firstLetters(substr($city, 0, $this->first_letters)); |
|
124 | } |
||
125 | |||
126 | 4 | $settlements = $settlements->findAll(); |
|
127 | |||
128 | 4 | $titles = []; |
|
129 | 4 | $settlements_with_id = []; |
|
130 | |||
131 | 4 | foreach ($settlements as $v) { |
|
132 | 4 | $settlements_with_id[$v['title']] = $v['code']; |
|
133 | 4 | $titles[] = $v['title']; |
|
134 | } |
||
135 | |||
136 | 4 | $result = $this->findSimilarWord($city, $titles); |
|
137 | |||
138 | 4 | if (!$result) { |
|
139 | 1 | return false; |
|
140 | } |
||
141 | 3 | if (is_null($settlements_with_id[$result])) { |
|
142 | return false; |
||
143 | } |
||
144 | |||
145 | 3 | return $settlements_with_id[$result]; |
|
146 | } |
||
147 | |||
148 | /** |
||
149 | * @param $street |
||
150 | * @param $city_id |
||
151 | * |
||
152 | * @return bool|mixed |
||
153 | */ |
||
154 | 3 | View Code Duplication | public function findFiasStreets($street, $city_id) |
155 | { |
||
156 | 3 | $streets = new StreetsDatabaseQuery(); |
|
157 | 3 | $streets = $streets->getStreets()->parentId($city_id)->addressLevel(); |
|
158 | |||
159 | 3 | if (is_integer($this->first_letters)) { |
|
160 | 1 | $streets = $streets->firstLetters(substr($street, 0, $this->first_letters)); |
|
161 | } |
||
162 | |||
163 | 3 | $streets = $streets->findAll(); |
|
164 | |||
165 | 3 | $titles = []; |
|
166 | 3 | $streets_with_id = []; |
|
167 | |||
168 | 3 | foreach ($streets as $v) { |
|
169 | 3 | $streets_with_id[$v['title']] = $v['address_id']; |
|
170 | 3 | $titles[] = $v['title']; |
|
171 | } |
||
172 | |||
173 | 3 | $result = $this->findSimilarWord($street, $titles); |
|
174 | |||
175 | 3 | return $result ? $streets_with_id[$result] : false; |
|
176 | } |
||
177 | |||
178 | /** |
||
179 | * @param $street |
||
180 | * @param $city_code |
||
181 | * |
||
182 | * @return bool|mixed |
||
183 | */ |
||
184 | 3 | public function findKladrStreets($street, $city_code) |
|
185 | { |
||
186 | 3 | $streets = new StreetsDatabaseQuery(); |
|
187 | 3 | $city = new SettlementsDatabaseQuery(); |
|
188 | 3 | $city_id = $city->getSettlements()->addressLevel(true)->kladrCode($city_code)->findOne(); |
|
189 | 3 | if ($city_id) { |
|
190 | 3 | $city_id = $city_id['address_id']; |
|
191 | } else { |
||
192 | return false; |
||
193 | } |
||
194 | 3 | $streets = $streets->getStreets()->parentId($city_id)->addressLevel(); |
|
195 | |||
196 | 3 | if (is_integer($this->first_letters)) { |
|
197 | 1 | $streets = $streets->firstLetters(substr($street, 0, $this->first_letters)); |
|
198 | } |
||
199 | |||
200 | 3 | $streets = $streets->findAll(); |
|
201 | |||
202 | 3 | $titles = []; |
|
203 | 3 | $streets_with_id = []; |
|
204 | |||
205 | 3 | foreach ($streets as $v) { |
|
206 | 3 | $streets_with_id[$v['title']] = $v['code']; |
|
207 | 3 | $titles[] = $v['title']; |
|
208 | } |
||
209 | |||
210 | 3 | $result = $this->findSimilarWord($street, $titles); |
|
211 | |||
212 | 3 | if (!$result) { |
|
213 | 1 | return false; |
|
214 | } |
||
215 | 2 | if (is_null($streets_with_id[$result])) { |
|
216 | return false; |
||
217 | } |
||
218 | |||
219 | 2 | return $streets_with_id[$result]; |
|
220 | } |
||
221 | |||
222 | /** |
||
223 | * @param $house |
||
224 | * @param $street_id |
||
225 | * |
||
226 | * @return bool |
||
227 | */ |
||
228 | 4 | public function findFiasHouses($house, $street_id, $building = false) |
|
229 | { |
||
230 | 4 | $house_id = new HousesDatabaseQuery(); |
|
231 | 4 | $house_id = $house_id->getHouses()->addressId($street_id)->houseNumber($house); |
|
232 | |||
233 | 4 | if ($building != false) { |
|
234 | 2 | $house_id = $house_id->building($building); |
|
235 | } |
||
236 | |||
237 | 4 | $house_id = $house_id->findOne(); |
|
238 | |||
239 | 4 | return $house_id ? $house_id['house_id'] : false; |
|
240 | } |
||
241 | |||
242 | /** |
||
243 | * Включаем строгий режим поиска |
||
244 | * |
||
245 | * @param bool $strict |
||
246 | */ |
||
247 | 23 | public function isStrict($strict = false) |
|
251 | |||
252 | |||
253 | /** |
||
254 | * Сколько первых букв должны совпадать при поиске по базам ФИАС |
||
255 | * |
||
256 | * (теоретически, снизит кол-во слов, которые придется обрабатывать алгоритмом и тем самым увеличит скорость работы, но может не найти слово, если первые буквы не совпадают |
||
257 | * из-за опечатки или префиксов) |
||
258 | * |
||
259 | * @param bool $count |
||
260 | */ |
||
261 | 20 | public function isFirstLetters($count = false) |
|
262 | { |
||
263 | 20 | if (is_int($count)) { |
|
264 | 6 | $this->first_letters = $count; |
|
265 | } |
||
266 | 20 | } |
|
267 | |||
268 | /** |
||
269 | * Только города, или города и поселения |
||
270 | * |
||
271 | * @param bool $is_full |
||
272 | */ |
||
273 | 8 | public function isFullSettlements($is_full = false) |
|
277 | } |
||
278 |
When comparing two booleans, it is generally considered safer to use the strict comparison operator.