equal
deleted
inserted
replaced
239 this->signs.NeedResort(); |
239 this->signs.NeedResort(); |
240 this->BuildSignsList(); |
240 this->BuildSignsList(); |
241 this->SortSignsList(); |
241 this->SortSignsList(); |
242 |
242 |
243 /* By default pick the last entry */ |
243 /* By default pick the last entry */ |
244 const Sign *si = this->signs[this->signs.Length( |
244 const Sign *si = this->signs[this->signs.Length() - 1]; |
245 ) - 1]; |
|
246 |
245 |
247 for (uint i = 1; i < this->signs.Length(); i++) { |
246 for (uint i = 1; i < this->signs.Length(); i++) { |
248 if (this->cur_sign == this->signs[i]->index) { |
247 if (this->cur_sign == this->signs[i]->index) { |
249 si = this->signs[i - 1]; |
248 si = this->signs[i - 1]; |
250 break; |
249 break; |
263 this->signs.NeedResort(); |
262 this->signs.NeedResort(); |
264 this->BuildSignsList(); |
263 this->BuildSignsList(); |
265 this->SortSignsList(); |
264 this->SortSignsList(); |
266 |
265 |
267 /* By default pick the last entry */ |
266 /* By default pick the last entry */ |
268 const Sign *si = this->signs[this->signs.Length( |
267 const Sign *si = this->signs[this->signs.Length() - 1]; |
269 ) - 1]; |
|
270 |
268 |
271 for (uint i = 0; i < this->signs.Length() - 1; i++) { |
269 for (uint i = 0; i < this->signs.Length() - 1; i++) { |
272 if (this->cur_sign == this->signs[i]->index) { |
270 if (this->cur_sign == this->signs[i]->index) { |
273 si = this->signs[i + 1]; |
271 si = this->signs[i + 1]; |
274 break; |
272 break; |