114 ptr = ptr->next;

115 }

116 i++;

117 if( 'A'+i == '[' )

118 i = 'a' - 'A';

150 {

151 j = 0;

152 i++;

153 }

154

189 if (strlen($HexChar) == 1) $HexChar = "0" . $HexChar;

190 if (($this -> FromCharset == "gsm0338") && ($HexChar == '1B')){

191 $i++;

192 $HexChar .= strtoupper(dechex(ord($StringToChange[$i])));

193 }

60 $found_delimiter = false;

61 // Find first interesting character, several strpos seem to be faster than simple loop in php:

62 //while (($i < $len) && (strpos('\'";#-/', $buffer[$i]) === FALSE)) $i++;

63 //if ($i == $len) break;

64 $oi = $i;

140 break;

141 }

142 $i++;

143 // Aren't we at the end?

144 if ($finished && $i == $len) {

189 }

190 }

191 $i++;

192 }

193 // Skip last char

209 if (strcmp(cur->name, prev->name) != 0)

210 {

211 i++;

212 if (i != j)

213 a->array[i] = a->array[j];

271 if (!iface->name) break;

272

273 i++;

274

275 if (iface->private_size > 0)

107 {

108 ((TaskType)typesListModel.getElementAt(i)).save(i);

109 i++;

110 }

111 TaskListPlugin.pruneTaskListProperties(i);

134 name, pattern, sample, ignoreCase, iconPath));

135

136 i++;

137 }

138 return listModel;

125 for (Object obj : this) {

126 result[i] = obj;

127 i++;

128 }

129 return result;

145 for (Object obj : this) {

146 a[i] = (T) obj;

147 i++;

148 }

149 return a;

356 l = l->next;

357 }

358 i++;

359 }

360 }

617 while ( i < EMax_nested_blocks + 1 ) {

618 free_symbol_list(i);

619 i++;

620 }

621 }

127 mismatch = true;

128 }

129 i++;

130 }

131

98 if (f < NF && hfile)

99 printf(" ") > hfile

100 i++; f++;

101 }

102 if (oparen && hfile)

150 if (f < NF && hfile)

151 printf(" ") > hfile

152 i++; f++;

153 }

154 if (oparen && hfile)

292 filenames[i][ent_len] = 0;

293 if (*t == 0) {

294 i++;

295 break;

296 }

81 {

82 yield return i.ToString(CultureInfo.InvariantCulture);

83 i++;

84 }

85 }

136 }

137

138 i++;

139 }

140

434 bufcolumn[j] = newCol + columnDiff;

435 columnDiff = nextColDiff;

436 i++;

437 }

438

102 if ( i < length ) {

103 count++;

104 i++;

105 }

106 } //while

256 j++;

257 }

258 i++;

259 }

260

170 (*bfn_new)[number_bi] = f;

171 (*bi_new)[number_bi] = bi_table[table_map];

172 number_bi++;

173 }

174 }

104 local[i].func = raccess_guess_ ## func_suffix; \

105 local[i].type = FT_RFork_Rule_ ## type_suffix; \

106 i++;

107 #define CONST_FT_RFORK_RULE_ARRAY_END }

108

116 for (Node<E> node = getFirstNode(); node != null; node = node.getNext()) {

117 if (i == index) return node.getItem();

118 i++;

119 }

120

129 eventIdList.Add(eventToCreateIdList[i]);

130 }

131 i++;

132 }

133 return eventIdList;

157 {

158 DeleteEvent(connectionInformation, eventToDeleteIdList[i]);

159 i++;

160 }

161 }

112 t[numtri].n2 = ttemp[i].n2;

113 t[numtri].n3 = ttemp[i].n3;

114 numtri++;

115 }

116 }

90 drawingContext.Close();

91

92 this.currentI++;

93

94 if (this.currentI >= this.columns)

316 tss.chpho[ofsi].psta = psta;

317

318 ofsi++;

319 }

320 }

510 if (id[0] == id_iter[0] && strcmp(id, id_iter) == 0)

511 return i;

512 i++;

513 link = link->next;

514 }

140 for (MetaAssociation a : c.getAssociations()) {

141 if (a.getInverseAssociation() == null) {

142 bi++;

143 } else {

144 uni++;

128 int i = i0+1, j = i1;

129 while ((j-i) > 1) {

130 while (i != j && ints[i] <= pivot) i++;

131 while (i != j && ints[j] > pivot) j--;

132 if (i != j) swap(ints,i,j);

224 }

225

226 i++;

227 }

228

427 }

428

429 i++;

430 }

431

540 }

541

542 i++;

543 }

544

32 i = 0;

33 arr.forEach(function(a) {

34 i++;

35 arr.push(a+3);

36 });

122 i = 0;

123 arr.some(function(a) {

124 i++;

125 arr.push(a+3);

126 return i > 3;

217 i = 0;

218 arr.every(function(a) {

219 i++;

220 arr.push(a+3);

221 return i <= 3;

73 resDigits[i] = val.digits[i] + val.sign;

74 // Copying the remaining unchanged digit

75 for (i++; i < val.numberLength; i++) {

76 resDigits[i] = val.digits[i];

77 }

144 if (i == iNeg) {

145 resDigits[i] = -negative.digits[i] & positive.digits[i];

146 i++;

147 }

148 int limit = Math.min(negative.numberLength, positive.numberLength);

185 }

186 if (digit == 0) {

187 for (i++; i < shorter.numberLength && (digit = ~(longer.digits[i] | shorter.digits[i])) == 0; i++)

188 ; // digit = ~longer.digits[i] & ~shorter.digits[i]

189 if (digit == 0) {

328 return false;

329 }

330 i++;

331 lhs_item = lhs->Next(lhs_item);

332 rhs_item = rhs->Next(rhs_item);

65 AFTER_STYLE_2 = i++, //Y

66 AFTER_STYLE_3 = i++, //L

67 AFTER_STYLE_4 = i++; //E

68

69

131 memset(_utarray_eltptr(a, (a)->i), 0, (a)->icd->sz); \

132 } \

133 (a)->i++; \

134 } while(0)

135

150 memcpy(_utarray_eltptr(a, 0), p, (a)->icd->sz); \

151 }; \

152 (a)->i++; \

153 } while(0)

154

166 memcpy(_utarray_eltptr(a, j), p, (a)->icd->sz); \

167 }; \

168 (a)->i++; \

169 } while(0)

170

511

512 if(emp->ObtTipo() == ADMINISTRADOR) {

513 i++;

514

515 salario = emp->Liquidacion();

551

552 if(emp->ObtTipo() == TACTICO) {

553 i++;

554

555 salario = emp->Liquidacion();

591

592 if(emp->ObtTipo() == OPERATIVO) {

593 i++;

594

595 salario = emp->Liquidacion();

332

333 for (iX = 0; iX < pData->iRowsize + pData->iPixelofs - pData->iFilterofs; iX++)

334 *pRawo++ = *pRawi++;

335

336 pData->iFilterofs = 0; /* indicate so ! */

401 {

402 iC = 4;

403 iB = *pRawi++;

404 iN = 0;

405 iS = 8;

451 {

452 iC = 2;

453 iB = *pRawi++;

454 iN = 0;

455 iS = 8;

129 while (true)

130 {

131 i++;

132 localCalendar3.add(1, 1);

133 break;

193 label163: arrayOfDate[i] = localCalendar2.getTime();

194 localCalendar2.setTimeInMillis(localCalendar2.getTimeInMillis() - 900000L);

195 i++;

196 break label73;

197 label188: arrayOfDate[i] = localCalendar2.getTime();

198 localCalendar2.setTimeInMillis(localCalendar2.getTimeInMillis() - 1800000L);

199 i++;

200 break label114;

201 }

474 for ( i = 0; value > 0; value = value >> 1)

475 {

476 i++;

477 }

478 return i;

24 arg++;

25 while (i <= pos && str[i] != ' ')

26 i++;

27 }

28 }

214

215 /* try next group */

216 gi++;

217 group = mali_cluster_get_group(cluster, gi);

218 }

219

220 /* try next cluster */

221 ci++;

222 cluster = mali_cluster_get_global_cluster(ci);

223 }

418

419 /* try next group */

420 gi++;

421 group = mali_cluster_get_group(cluster, gi);

422 }

175 int i = 0;

176 while (++pn[i] == 0 && i < WIDTH-1)

177 i++;

178 return *this;

179 }

192 int i = 0;

193 while (--pn[i] == -1 && i < WIDTH-1)

194 i++;

195 return *this;

196 }

127 * var i = 0;

128 * var signal = new Signal("navigation", function(wv, frame, request) {

129 * i++;

130 * if (i == 3)

131 * this.disconnect();

235 return array;

236 } else if (parser.getName().equals("item")) {

237 i++;

238 } else {

239 throw new XmlPullParserException("Expected " + endTag

531 while (i < N) {

532 XmlUtils.writeValueXml(val.get(i), null, out);

533 i++;

534 }

535

161 smart_str err = {0};

162

163 i++;

164

165 if (i > len) {

214 }

215

216 i++;

217

218 if (i > len) {

58 // For operator-assign operations save the lhs value before evaluating

59 // the rhs. This is correct Java behavior for postfix operations

60 // e.g. i=1; i+=i++; // should be 2 not 3

61 Object lhsValue = null;

62 if ( operator != ASSIGN ) // assign doesn't need the pre-value

214 #endif

215 dsp_delay();

216 i++;

217 }

218 }

445 #endif

446 dsp_delay();

447 i++;

448 }

449

154 s.lo = a.lo + b.lo;

155 if (s.lo < a.lo)

156 s.hi++;

157 return s;

158 }

70 if (usr.NivelTrabajo.NiveltrabajoId == 1)

71 resultado[i].isDefaultValue = false;

72 i++;

73 }

74 if (usr.NivelTrabajo.NiveltrabajoId == 1) resultado[0].isDefaultValue = true;

108 if (usr.NivelTrabajo.NiveltrabajoId == 1)

109 resultado[i].isDefaultValue = false;

110 i++;

111 }

112 if (usr.NivelTrabajo.NiveltrabajoId == 1) resultado[0].isDefaultValue = true;

183 if (usr.NivelTrabajo.NiveltrabajoId == 1)

184 resultado[i].isDefaultValue = false;

185 i++;

186 }

187 if (usr.NivelTrabajo.NiveltrabajoId == 1) resultado[0].isDefaultValue = true;

72 return 0;

73 }

74 i++;

75 }

76 }

117 return 0;

118 }

119 i++;

120 if(event.type == YAML_MAPPING_START_EVENT) {

121 if(!yaml_event_initialize(&events[i], &event)) {

128 return 0;

129 }

130 i++;

131 if(event.type == YAML_SCALAR_EVENT) {

132 if(!yaml_event_initialize(&events[i], &event)) {

196 for( double d : in1 ){

197 out[ i ] = d;

198 i++;

199 }

200 for( double d : in2 ) {

201 out[ i ] = d;

202 i++;

203 }

204

413 setEntry( e, i, pr );

414

415 i++;

416 }

417 for( int k = j+1; k <= n; k++ )

106 int i = 0;

107 do {

108 i++;

109 if (i > 100) {

110 break;

279 if (filldir(dirent, ".", 1, i, ino, DT_DIR) < 0)

280 goto out;

281 i++;

282 filp->f_pos++;

283 /* fall thru */

288 dp->parent->unique_id), DT_DIR) < 0)

289 goto out;

290 i++;

291 filp->f_pos++;

292 /* fall thru */

65 while (LogViewer.getProperty(key + delimiter + i) != null) {

66 LogViewer.setProperty(key + delimiter + i, null);

67 i++;

68 }

69 }

282 e = i;

283 } else if (comp == 0) {

284 i++;

285 b = e = i;

286 } else {

724 aliases.put(alias,jEdit.getProperty("console.shell.alias."

725 + i + ".expansion"));

726 i++;

727 } */

728 } //}}}

748 variables.put(varname,jEdit.getProperty("console.shell.variable."

749 + i + ".value"));

750 i++;

751 } */

752 } //}}}

64 AncestorButton button = (AncestorButton) getComponent(i);

65 button.setAncestor(new Ancestor(view, fileName, _vfs.getFileName(fileName)));

66 i++;

67 button.setEnabled(nb != i);

68 }

155 jEdit.setProperty("infoviewer.bookmarks.title." + count, b.title);

156 jEdit.setProperty("infoviewer.bookmarks.url." + count, b.url);

157 i++;

158 count++;

159 }

285 String uri = null;

286 do {

287 String prop = "xml.catalog." + i++;

288 uri = jEdit.getProperty(prop);

289 if (uri == null) break;

140 <span class="enscript-keyword">else</span>

141 printf(<span class="enscript-string">&quot;test %d ok\n&quot;</span>,i);

142 i++;

143 R++;

144 P++;

252 {

253 Assert.AreEqual(p.id, id + i);

254 i++;

255 }

256 Assert.AreEqual(i, count);

275 {

276 Assert.AreEqual(p.id, id + i + 5);

277 i++;

278 }

279

307 {

308 Assert.AreEqual(p.id, id + i + 5);

309 i++;

310 }

311