197 return i;

198 }

199 i++;

200 }

201 return OSIP_UNDEFINED_ERROR; /* not found */

90 return i;

91 }

92 i++;

93 } while ( i != 0 ); /* because i is UShort! */

94

191 return i;

192 }

193 i++;

194 } while ( i != 0 ); /* because i is UShort! */

195

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

315

316 ofsi++;

317 }

318 }

463 Clear(nname);

464 Printf(nname,"%s%d",name,i);

465 i++;

466 }

467 Replace(ndecl, name, nname, DOH_REPLACE_ID);

173 {

174 gblOps.w = atoi (argv[i + 1]);

175 i++;

176 }

177 break;

180 {

181 gblOps.h = atoi (argv[i + 1]);

182 i++;

183 }

184 break;

187 {

188 gblOps.bpp = atoi (argv[i + 1]);

189 i++;

190 }

191 break;

427 GivError::throw_error(

428 GivBadFormat("VectorDom<T,Dense>::read: syntax error no ','"));

429 i++;

430 fin >> std::ws >> Tmp;

431 fin >> std::ws; fin.get(ch);

240 if (pAttrib->QueryDoubleValue(&dval)==TIXML_SUCCESS) printf( " d=%1.1f", dval);

241 printf( "\n" );

242 i++;

243 pAttrib=pAttrib->Next();

244 }

724 if (pAttrib->QueryDoubleValue(&dval)==TIXML_SUCCESS) printf( " d=%1.1f", dval);

725 printf( "\n" );

726 i++;

727 pAttrib=pAttrib->Next();

728 }

146 ifp = ifld;

147 while (i < sizeof(hdrbuf) && (*p = tolower(*ifp))) {

148 i++;

149 p++;

150 ifp++;

475 ox += step;

476

477 i++;

478 }

479 }

493 if (strcmp(name, imageMap[i].name) == 0)

494 return(imageMap[i].image);

495 i++;

496 }

497

142 i = 0;

143 while(dh_types[i] != NULL){

144 i++;

145 j++;

146 }

153 j = 0;

154 while(dh_types[i] != NULL){

155 i++;

156 j++;

157 }

164 j = 0;

165 while(dh_types[i] != NULL){

166 i++;

167 j++;

168 }

221 /* fprintf(stderr, "%d %d %d -> %d %d %d -> %d\n", r, g, b, rr, gg, bb, h );*/

222 first = (struct hash_ink *) malloc( sizeof(struct hash_ink));

223 /* arr[h]->x = i++; */

224 cur = first;

225 cur->next = 0;

142 for (; it!=_map.end(); ++it) {

143 s << "&PIC" << it.key() << "_DATA,";

144 i++;

145 if ( (i%10)==0 ) s << endl;

146 }

104

105 while (i < len && subject.charAt(i) >= '0' && subject.charAt(i) <= '9') {

106 i++;

107 }

108

55 iterator_base<I> operator+(int j) const { return i+j; }

56 iterator_base<I>& operator++() { return ++i; }

57 iterator_base<I> operator++(int) { return i++; }

58 iterator_base<I>& operator+=(int j) { return i+=j; }

59 iterator_base<I> operator-(int j) const { return i-j; }

364 didAdd(i, object);

365 didChange();

366 i++;

367 }

368

534 sdp_attribute_free(attr);

535 } else

536 i++;

537 }

538 return OSIP_SUCCESS;

547 sdp_attribute_free(attr);

548 } else

549 i++;

550 }

551 return OSIP_SUCCESS;

572 sdp_attribute_free(attr);

573 } else

574 i++;

575 }

576 } else if ((attr = osip_list_get(&sdp->a_attributes, pos_attr)) != NULL) {

273 }else{

274 if((tag == 0)&& (st == 1)){

275 buf[i] = ch; i++;

276 }else{

277 tagBuf[j] = ch; j++;

337 }else{

338 if((tag == 0)&& (st == 1)){

339 buf[i] = ch; i++;

340 }else{

341 tagBuf[j] = ch; j++;

425 }else{

426 if((tag == 0)&& (st == 1)){

427 buf[i] = ch; i++;

428 }else{

429 tagBuf[j] = ch; j++;

288 }

289 } else {

290 i++;

291 }

292 }

324 }

325 } else {

326 i++;

327 }

328 }

360 }

361 } else {

362 i++;

363 }

364 }

645 {

646 res[i] = TermFPFlexSample(t, &p);

647 i++;

648 }

649

242 while(list)

243 {

244 i++;

245 list = list->next;

246 }

166 i.ToString(), change.Error.Message);

167 }

168 i++;

169 }

170 }

118 int i = 0;

119 while (keySet.contains(i)) {

120 i++;

121 }

122 return i;

61 if (pass == 2)

62 uni[unilen] = utf8[i];

63 i++;

64 } else if (i + 1 < utf8len &&

65 (utf8[i] & 0xE0) == 0xC0 &&

166 if (pass == 2)

167 uni[unilen] = utf8[i];

168 i++;

169 }

170 }

152 // of the current range

153 item->second = from.addDays( -1 );

154 i++;

155 }

156 }

33 if ( set != NULL ) {

34 while ( !BER_BVISNULL( &set[ i ] ) ) {

35 i++;

36 }

37 }

126 Dequeue(i);

127 leftV += bords[i].val;

128 i++;

129 }

130 midV = RemainingValAt(cur);

132 rightV += bords[i].val;

133 Enqueue(bords[i].other);

134 i++;

135 }

136

658 if (list == link)

659 return i;

660 i++;

661 list = list->next;

662 }

673 if (list->data == data)

674 return i;

675 i++;

676 list = list->next;

677 }

460 l_key[i] = in_key[i];

461 #endif

462 i++;

463 }

464

330 mpz_set_ui (ret[i], 0);

331 }

332 i++;

333 }

334 }

365 mpz_set_ui (ret[i], 0);

366 }

367 i++;

368 }

369 }

520 {

521 mpz_set (tmp[5 * h - 2 + i], tmp[3 * h - 1 + i]);

522 i++;

523 }

524

187 }

188

189 i++;

190 current_node = axiom_node_get_next_sibling(current_node, Environment::getEnv());

191 }

56 while (str[i] != '\0') {

57 str[i] = (char) toupper ((int) str[i]);

58 i++;

59 }

60 return str;

193 if ((unsigned char)s[i] == '^') {

194 if (i < s.length()) {

195 i++;

196 switch((unsigned char)s[i]) {

197 case '^': break; /* quoted... keep going */

342 if ((unsigned char)s[i] == '^') {

343 if (i < s.length()) {

344 i++;

345 if ((unsigned char)s[i] == '^') j++;

346 } else j ++; /* ??? */

360 if ((unsigned char)s[i] == '^') {

361 if (i < s.length()) {

362 i++;

363 if ((unsigned char)s[i] == '^') j++;

364 } else k ++; /* ??? */

123 }

124 else {

125 i++;

126 }

127 }

95 value.c_str() );

96 }

97 i++;

98 base = 16;

99 } else {

107 value.c_str() );

108 }

109 i++;

110 base = 16;

111 }

656 Sint32 i, j;

657 i = countTempo;

658 i++;

659 if (i > 20)

660 {

485 switch(*str++)

486 {

487 case '0': dcSetIn(c_on, i, 1); dcSetIn(c_dc, i, 1); i++; break;

488 case '1': dcSetIn(c_on, i, 2); dcSetIn(c_dc, i, 2); i++; break;

489 case '-': dcSetIn(c_on, i, 3); dcSetIn(c_dc, i, 3); i++; break;

490 case '\0': return 0;

491 }

496 switch(*str)

497 {

498 case '0': dcSetOut(c_on, i, 0); dcSetOut(c_dc, i, 0); i++; break;

499 case '1': dcSetOut(c_on, i, 1); dcSetOut(c_dc, i, 0); i++; break;

500 case '2': dcSetOut(c_on, i, 0); dcSetOut(c_dc, i, 1); i++; break;

501 case '-': dcSetOut(c_on, i, 0); dcSetOut(c_dc, i, 1); i++; break;

128 last;

129 }

130 $i++;

131 }

132

169 for my $plugin (@{ $self->{PIPELINE} }) {

170 return $i if $plugin == $old_p;

171 $i++;

172 }

173

202 last;

203 }

204 $i++;

205 }

206

391 images=images->previous;

392 for (i=0; images != (Image *) NULL; images=images->next)

393 i++;

394 return(i);

395 }

89 g_assert (value[i] != NULL);

90 g_assert_cmpstr (v, ==, value[i]);

91 i++;

92 v = va_arg (args, gchar*);

93 }

122 g_assert (value[i] != NULL);

123 g_assert_cmpstr (v, ==, value[i]);

124 i++;

125 v = va_arg (args, gchar*);

126 }

154 g_assert_cmpint (i, <, len);

155 g_assert_cmpint (value[i], ==, v);

156 i++;

157 v = va_arg (args, gint);

158 }

51 if(arr[i].length() == 0)

52 {

53 i++;

54 continue;

55 }

109 }

110 }

111 i++;

112 }

113 return (area[0] != 0 && city[0] != 0);

136 break;

137

138 i++;

139 }

140 return retnAreaInfo;

81 //==================================================

82 while (readBuff[i] <= ' ')

83 i++;

84

85 // Skip comments

101 //==================================================

102 while (readBuff[i] != 0 && readBuff[i] != '=')

103 i++;

104

105 // No equal sign then this is not a config line

110 // Skip while space after the equal sign

111 //==================================================

112 i++;

113 while (readBuff[i] <= ' ')

114 i++;

191 buffer.append(" nResult = 0; \n"); //$NON-NLS-1$

192 buffer.append(" } \n"); //$NON-NLS-1$

193 buffer.append(" i++; \n"); //$NON-NLS-1$

194 buffer.append(" b = (i + 2) * 4; \n"); //$NON-NLS-1$

195 buffer.append(" } while (i < 0); \n"); //$NON-NLS-1$

102 return false;

103 }

104 i++;

105 p++;

106 if (cc > 1)

223 vector <Sline_text>::iterator ii = my_vect_.begin ();

224 u_int16 i = 0;

225 while (i != my_old_cursor_.line) { i++; ii++; }

226 my_vect_.erase (ii, my_vect_.end ());

227

371 line_tmp.pos_x += (*my_font_) [ucd (i)].length ();

372 }

373 i++;

374 }

375

210 foreach ($roleChildParents as $roleParentId => $roleParent) {

211 $this->assertTrue("parent$i" === $roleParentId);

212 $i++;

213 }

214 $this->assertTrue($roleRegistry->inherits($roleChild, $roleParent1));

413 addEntry(entry);

414 if (entry.isWide())

415 i++;

416 }

417 }

109 safe_strncpy(p->digi_addr[p->ndigi],

110 token(&cp, ", \t\r\n"), 10);

111 p->ndigi++;

112 }

113

769 if ((ptr[1] == (ptr[0] + 1)) || (ptr[1] == (ptr[0] - 1)))

770 {

771 i++;

772 }

773 ptr++;

80 cmdinfo[i] = '\n';

81 }

82 i++;

83 }

84 cmdinfo[i] = '\n';

85 i++;

86 cmdinfo[i] = 0;

87 Cli_Printf("Following are the available show commands\n");

74

75 } else if (0 == strcmp ("--", Tcl_GetString (objv [i]))) {

76 i++;

77 break;

78 } else {

355 break;

356

357 ci++;

358 ca_string++;

359 }

557 )

558 {

559 ca_string_i++;

560 break;

561 }

601 )

602 {

603 ca_string_i++;

604 return(ca_string_i);

605 }

940 while ( ( i < MAX_BOARD )

941 && ( unread_notes( ch, &boards[i] ) == BOARD_NOACCESS ) )

942 i++;

943

944 if ( i == MAX_BOARD )

50 int i = 0;

51

52 while (wavetable[i].name) i++;

53 #endif

54

637 if (index == i)

638 return itCheckSum->ready;

639 i++;

640 }

641

658 if (index == i)

659 return itCheckSum->sum;

660 i++;

661 }

662

418 }

419

420 i++;

421 }

422

434 }

435

436 i++;

437 }

438 } else

358 fprintf(ascii, " %i",

359 i + info->typeinfo[types[k]]->pointoffset);

360 i++;

361 }

362 fprintf(ascii, "\n");

397 fprintf(ascii, " %i",

398 i + info->typeinfo[types[k]]->pointoffset);

399 i++;

400 }

401 fprintf(ascii, "\n");

743 nn = mixed_offset(np, nelems);

744 for (i = 0, n = 0; n < nn; n++) {

745 if (elements[n] != ibuf[n]) i++;

746 }

747 if (i) printf("%d differences in Mixed connectivity\n", i);

749 nn = (nelems + nfaces) << 2;

750 for (i = 0, n = 0; n < nn; n++) {

751 if (parent[n] != pbuf[n]) i++;

752 }

753 if (i) printf("%d differences in Mixed parent data\n", i);

435 else

436 {

437 i++;

438 }

439 }

486 else

487 {

488 i++;

489 }

490 }

836 if (++length == 9)

837 Sys_Error("Filename base of %s >8 chars", Str);

838 i++;

839 }

840 return VStr(*this, start, length);

100 low++;

101 if (list[j] > s2[i + 1])

102 hi++;

103 }

104

54 while (x*x > 2) {

55 x *= 0.5;

56 i++;

57 }

58

229 {

230 line << "\\";

231 i++;

232 }

233 else // if ( read[i+1] != 'n' )

234 {

235 line << "\n";

236 i++;

237 }

238 }

137 return 0;

138 }

139 i++;

140 }

141 cur = cur->next;

297 return 0;

298 }

299 i++;

300 }

301 cur = cur->next;

375 return 0;

376 }

377 i++;

378 }

379 cur = cur->next;

174

175 // Loop through the array and check each character

176 for (i++; i < length; i++) {

177 c = ch[i];

178

239 " public void test_2() {" + PMD.EOL +

240 " for (int i = 0; i < 1; i++) {" + PMD.EOL +

241 " i++;" + PMD.EOL +

242 " i = 8;" + PMD.EOL +

243 " }" + PMD.EOL +

582 " i = 5;" + PMD.EOL +

583 " }" + PMD.EOL +

584 " i++;" + PMD.EOL +

585 " } else if (i < 6) {" + PMD.EOL +

586 " i = 7;" + PMD.EOL +

122 }

123 while( isspace( styler.SafeGetCharAt( curPos + i ) ) ) {

124 i++;

125 if( ( curPos + i ) >= endPos ) return false;

126 }

253 int i = 0;

254 for (Node n = refNode; n!=null; n = n.getPreviousSibling()) {

255 i++;

256 }

257 fStartOffset = i-1;

292 int i = 0;

293 for (Node n = refNode; n!=null; n = n.getPreviousSibling()) {

294 i++;

295 }

296 fStartOffset = i;

331 int i = 0;

332 for (Node n = refNode; n!=null; n = n.getPreviousSibling()) {

333 i++;

334 }

335 fEndOffset = i-1;

949 my $i = 1;

950 while (my $x = $i) {

951 $i++;

952 redo if $i == 2;

953 cmp_ok($x,'==',1,"while/redo lexical life");

956 $i = 1;

957 until (! (my $x = $i)) {

958 $i++;

959 redo if $i == 2;

960 cmp_ok($x,'==',1,"until/redo lexical life");

962 }

963 for ($i = 1; my $x = $i; ) {

964 $i++;

965 redo if $i == 2;

966 cmp_ok($x,'==',1,"for/redo lexical life");

69 }

70 sum += pPages[i].dwSize;

71 i++;

72 }

73 if(pRetVal == 0)

454 && utf_s[i] == ascii_s[j])

455 {

456 i++;

457 n_match++;

458 }

119 if (s[i] == string_delimiter)

120 flag_string = set_flag_string(flag_string, i, s, s_length);

121 i++;

122 }

123 if (i == s_length)

377 d_ptr->_filterList.insert(k+j+1,QMessageAccountFilterPrivate::SortedMessageAccountFilterList());

378 d_ptr->_filterList[k+j+1] << d_ptr->_filterList[k+j];

379 i++;

380 }

381 d_ptr->_filterList[k+j] << other.d_ptr->_filterList[j];

386 }

387 }

388 i++;

389 }

390 d_ptr->_valid = d_ptr->_valid & other.d_ptr->_valid;

301 tuples[i].__init2__(e, f);

302 result->units[i] = &tuples[i];

303 i++;

304 }

305 }

334 tuples[i].units.push_back(g);

335 result->units[i] = &tuples[i];

336 i++;

337 }

338 }

554 return 0;

555 assert( i < p->nSize );

556 for ( i++; i < p->nSize; i++ )

557 p->pArray[i-1] = p->pArray[i];

558 p->nSize--;

302 if (!VectorDomainBase<Field>::_field.areEqual (i->second, *j))

303 return false;

304 i++;

305 }

306 else if (!VectorDomainBase<Field>::_field.isZero (*j))

325 if (!VectorDomainBase<Field>::_field.areEqual (i->second, *j))

326 return false;

327 i++;

328 }

329 else if (!VectorDomainBase<Field>::_field.isZero (*j))

376 if (!VectorDomainBase<Field>::_field.isZero (i->second))

377 return false;

378 i++;

379 }

380

751 }

752 }

753 i++;

754 p++;

755 q++;

791 }

792 }

793 i++;

794 p++;

795 q++;

847 p++;

848 q++;

849 i++;

850 }

851 if((!*q) && ((*p == WILDCARD) || (*p == ',')))

646 options |= 0x1 << i;

647 }

648 i++;

649 }

650

958 ii = 0;

959 if (nullcheck)

960 while (ii < nx && rowpix[ii] == nullvalue) ii++;

961

962 if (ii == nx) continue; /* hit end of row */

969

970 /***** find the 2nd valid pixel in row (which we will skip over) */

971 ii++;

972 if (nullcheck)

973 while (ii < nx && rowpix[ii] == nullvalue) ii++;

982

983 /***** find the 3rd valid pixel in row */

984 ii++;

985 if (nullcheck)

986 while (ii < nx && rowpix[ii] == nullvalue) ii++;

148 $result = newRV_noinc((SV*) myav);

149 sv_2mortal($result);

150 argvi++;

151 }

152 %typecheck(SWIG_TYPECHECK_VECTOR) vector<T> {

323 $result = newRV_noinc((SV*) myav);

324 sv_2mortal($result);

325 argvi++;

326 }

327 %typecheck(SWIG_TYPECHECK_VECTOR) vector<T> {

54 {

55 F_mpz_mpoly_set_coeff_ui(poly, 0, z_randint(1L << bits));

56 i++;

57 k++;

58 }

127 return value;

128 }

129 i++;

130 }

131 return ELContext.UNRESOLVABLE_RESULT;

199 return type;

200 }

201 i++;

202 }

203 return null;

267 return;

268 }

269 i++;

270 }

271 }

84 i = 0;

85 list_for_each_entry (brick, &volinfo->bricks, brick_list) {

86 i++;

87 if (i < idx)

88 continue;

753 strcat(brick_list, " ");

754

755 i++;

756 if ((volinfo->type == GF_CLUSTER_TYPE_NONE) ||

757 (volinfo->brick_count <= volinfo->dist_leaf_count))

922 }

923 brick = strtok_r (NULL, " \n", &saveptr);

924 i++;

925 volinfo->brick_count++;

926

90 if (l == size()) {

91 int i = 0;

92 while (i < size() && a[i] == get(i)) i++;

93 if (i == l) return this;

94 }

153 s->txwin[i].re += tmp[i].re * s->txwindowfunc[i];

154 s->txwin[i].im += tmp[i].im * s->txwindowfunc[i];

155 i++;

156 }

157 while (i < WindowLen) {

158 s->txwin[i].re = tmp[i].re * s->txwindowfunc[i];

159 s->txwin[i].im = tmp[i].im * s->txwindowfunc[i];

160 i++;

161 }

162

103 if (strcmp(argv[i], "-"))

104 oscap_text_set_text(title, argv[i]);

105 i++;

106 }

107

178 goto lab0;

179 }

180 i++;

181 if (i < num_points) goto lab0;

182 }

202 goto lab1;

203 }

204 i++;

205 if (i < num_points) goto lab1;

206 }

226 goto lab2;

227 }

228 i++;

229 if (i < num_points) goto lab2;

230 }

539 while (i < *rank) {

540 if (shape[i] > 1)

541 i++;

542 else {

543 (*rank)--;

566 while (i < *rank) {

567 if (shape[i] > 1)

568 i++;

569 else {

570 (*rank)--;

341 optstruct->optval = cbf_copy_string(NULL,argv[ii+1],0);

342

343 ii++;

344

345 foundopt++;

367 optstruct->optval = cbf_copy_string(NULL,argv[ii+1],0);

368

369 ii++;

370

371 break;

445 optstruct->optval = cbf_copy_string(NULL,argv[ii+1],0);

446

447 ii++;

448

449 }

377 return;

378 }

379 i++;

380 }

381 break;

390 return;

391 }

392 i++;

393 }

394 break;

401 return;

402 }

403 i++;

404 }

405 break;

508 + static int i;

509 +

510 + return i++;

511 +}

512 +

88 else

89 candidate = operationName + ending + i;

90 i++;

91 }

92 return name;

164 else

165 candidate = operationName + ending + i;

166 i++;

167 }

168 return name;

222 break;

223 }

224 i++;

225 name = baseName + i;

226 }

303 buf.append(c);

304 }

305 i++;

306 }

307

332 buf.append(c);

333 }

334 i++;

335 }

336

484 c = charAt(i);

485

486 i++;

487

488 if(c == '\'' || c == '"'){ //ignore comments or multiline comments...

282 while (p < path->end) {

283 i = 1;

284 while ((path->bpath[p + i].code == ART_LINETO) || (path->bpath[p + i].code == ART_CURVETO)) i++;

285 new = gp_path_new_sized (i + 1);

286 memcpy (new->bpath, path->bpath + p, i * sizeof (ArtBpath));

30 for (Iterator<Integer> stream = this.buildIterator(); stream.hasNext();) {

31 stream.next();

32 i++;

33 }

34 assertEquals(8, i);

39 for (Iterator<Object> stream = this.buildIteratorUpcast(); stream.hasNext();) {

40 stream.next();

41 i++;

42 }

43 assertEquals(8, i);

48 for (Iterator<Integer> stream = this.buildInnerIterator(); stream.hasNext();) {

49 stream.next();

50 i++;

51 }

52 assertEquals(8, i);

261 // No overlap, insert between current and next element.

262 // Option 1 or 3

263 i++;

264 range = new Range;

265 range->start = offset;

279

280 // Fix next item, for next test

281 i++;

282 nextRange = ( i < last ) ? ranges_.at( i + 1 ) : 0;

283 merge = true;

135 maxOverlap = overlap;

136 }

137 i++;

138 }

139 }

199 maxbounds->attributes |= ci->attributes;

200 }

201 i++;

202 }

203 }

242 foreach($xml->entry as $author) {

243 $authorArray[$i] = new Picasa_Author($author);

244 $i++;

245 }

246

885 c = s[i];

886 while (IsWhiteSpace(c)) {

887 i++;

888 c = s[i];

889 }

891 if (c == '-') {

892 sign = -1;

893 i++;

894 c = s[i];

895 }

912 mul(a, a, 10);

913 add(a, a, cval);

914 i++;

915 c = s[i];

916 cval = CharToIntVal(c);

188 {

189 stroke_ids[i] = gimp_stroke_get_ID (cur_stroke);

190 i++;

191 }

192 }

96 falureActions[i] = scAction.Type;

97 falureActions[++i] = scAction.Delay;

98 i++;

99

100 if (scAction.Type == (int)SC_ACTION_TYPE.RebootComputer)

76 }

77 }

78 i++;

79 }

80 }

214 out += cur_char;

215 }

216 i++;

217 }

218 return out;

275 { // Have valid second byte of a surrogate pair

276 surrogate_pairs++;

277 i++;

278 }

279 }

324 break;

325 }

326 i++;

327 }

328 if (unaligned)

125 msg->sendReliable( gAgent.getRegion()->getHost() );

126 }

127 i++;

128 }

129

249 {

250 sortarray[i] = temp;

251 i++;

252 temp = temp->mListp;

253 }

533 /* check options */

534 if (strcmp(argv[ai], "+d") == 0) {

535 ai++;

536 dec_chars = 1;

537 } else if (strcmp(argv[ai], "-d") == 0) {

538 ai++;

539 dec_chars = 0;

540 }

681 fclose(fsource_fp);

682

683 ai++;

684 while (ai < argc) {

685 zstrcpy(&fmap, argv[ai]);

72 }

73 }

74 i++;

75 }

76 if (id == CSSMATCH_INVALID_MSG_TYPE)