114 ptr = ptr->next;

115 }

116 i++;

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

118 i = 'a' - 'A';

150 {

151 j = 0;

152 i++;

153 }

154

330 if (inputAbs < BYTE_MULTIPLIERS[i])

331 break;

332 i++;

333 }

334 i--;

128 foreach (object item in a) {

129 Assert(item.Equals(values[i]));

130 i++;

131 }

132 Assert(i == values.Length);

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 }

171 $item = self::parseTransactionItem($value);

172 $items[$i] = $item;

173 $i++;

174 }

175 } else {

379 z = true;

380 }

381 i++;

382 }

383 return z;

395 z = true;

396 }

397 i++;

398 }

399 return z;

158 rawfmts[i].fmt = pinfo->format;

159 rawfmts[i].buftype = fmt->buffer_type;

160 i++;

161

162 if (pinfo->num_planes > MAX_PLANES)

133 b, 10, Timeout.Infinite);

134 timers.Add (t);

135 i++;

136 t.Dispose ();

137 }

65 result[i]=rs.getString(j);

66 j++;

67 i++;

68 }

69 }

121 j++;

122 }

123 i++;

124 }

125 }

174 j++;

175 }

176 i++;

177 }

178 }

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

138 filenames[i][ent_len] = 0;

139 if (*t == 0) {

140 i++;

141 break;

142 }

241 debug(i + " copying 8 bytes");

242 copy(8);

243 i++;

244 break;

245 case 1 : // Utf8

375

376 list_for_each_entry(network, &ieee->network_list, list) {

377 i++;

378 if((stop-ev)<200)

379 {

279 x = Spring.sum(x, Spring.width(component));

280 rowHeight = Spring.max(rowHeight, Spring.height(component));

281 i++;

282 }

283 y = Spring.sum(y, rowHeight);

153 if (add.testBit(i)) {

154 bArr[i - 1] = (byte) (bigInteger.testBit(i) ? -1 : 1);

155 i++;

156 }

157 i++;

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)

83 $lang_item->lang = $lang['locale']; // Save this for use in nav_menu_link_attributes

84 $lang_item->classes = $lang['classes'];

85 $lang_item->menu_order += $offset + $i++;

86 $new_items[] = $lang_item;

87 }

201 return i;

202

203 i++;

204 }

205

218 return i;

219

220 i++;

221 }

222

197 return i;

198 }

199 i++;

200 }

201 return OSIP_UNDEFINED_ERROR; /* not found */

238 foreach ($this->session as $key => $val) {

239 $this->assertEquals($attributes[$key], $val);

240 $i++;

241 }

242

310

311 foreach ($values as $style => $value) {

312 $base = $pad + $width * $i++;

313

314 if ($value == 0) {

33 {

34 s[i] = static_cast<char>( styler[ start + i ] );

35 i++;

36 }

37 s[ i ] = '\0';

209 // put one on the token. we do *not* exit the quoted text.

210 sb.append(nextLine.charAt(i+1));

211 i++;

212 }else{

213 inQuotes = !inQuotes;

40 continue;

41 stateIndexes.put(s, ci);

42 ci++;

43 }

44 return stateIndexes;

83 if (s == graphState)

84 result.data[ci] = 1;

85 ci++;

86 }

87 return result;

144 continue;

145 d_pi.setEntry(i, i, d.getEntry(ci));

146 ci++;

147 }

148 return d_pi;

34 */

35 if (round && (val_uf & 0x80000000))

36 val_ui++;

37 return (int)val_ui;

38 }

28 $i=0;

29 Do{

30 $i++;

31 $jedinecnyNazev = $friendlyName.($i>1?"-$i":"").".$pripona";

32 }While( file_exists("../zbozi/obrazky/$jedinecnyNazev") );

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;

209 $prefix = ($i == 0) ? '' : '&';

210 $str .= $prefix . $key . '=' . $val;

211 $i++;

212 }

213

196 return false;

197 }

198 i++;

199 currPosition += currStringLength;

200 }

218 {

219 sentence += vecPair[i+1].first + "/" + vecPair[i+1].second + " ";

220 i++;

221 }

222 vecSentence.push_back(sentence);

341 return i;

342 else

343 i++;

344 }

345 }

170 substr($adv, -1, 1) = $i;

171 substr($adv_name, -1, 1) = $i;

172 $i++;

173 }

174 }

146 int i = 0;

147 do {

148 i++;

149 if (i > 100) {

150 break;

100 rm = .5 + ((encoderLeft.get() - encoderRight.get()) / SCALE);

101 tankDrive((-1*lm), (-1*rm));

102 i++;

103 }

104 tankDrive(0, 0);

148

149 Thread.Sleep (1000);

150 i++;

151 }

152

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 }

223 var i = 0;

224 while (i < 5) {

225 i++;

226 out += opts[Math.floor(Math.random() * opts.length)];

227 }

247 () =>

248 {

249 i++;

250 return new MyD(() => { d++; });

251 },

268 () =>

269 {

270 i++;

271 return new MyD(() => { d++; });

272 },

293 () =>

294 {

295 i++;

296 return new MyD(() => { d++; });

297 },

315 p_LED[i] = p_LED[i + 1];

316 p_LED[i] = CRGB(0, 0, 0);

317 i++;

318 if (y > 1)

319 {

475 p_LED[i] = p_LED[i + 1];

476 p_LED[i] = CRGB(0, 0, 0);

477 i++;

478 if (x > 1)

479 {

67 szCurrentEntry[i] = '\0';

68 }

69 i++;

70 }

71 // If this is one of the entries we are looking for

79 return false;

80 }

81 i++;

82 if ( ( szInput[i] == '\0' ) || ( szInput[i] == '\n' ) || ( szInput[i] == '#' ) ) {

83 // Reset the file pointer to the start of the file

90 while ( szInput[i] != '#' && szInput[i] != '\n' && szInput[i] != '\0' ) {

91 szTemp[j] = szInput[i];

92 i++;

93 j++;

94 }

104 foreach ($pager as $book) {

105 $this->assertEquals('Book' . $i, $book->getTitle(), 'getIterator() returns an iterator');

106 $i++;

107 }

108 $this->assertEquals(4, $i, 'getIterator() uses the results collection');

117 foreach ($pager as $book) {

118 $this->assertEquals('Book' . $i, $book->getTitle(), 'getIterator() returns an iterator');

119 $i++;

120 }

121 $this->assertEquals(4, $i, 'getIterator() uses the results collection');

124 foreach ($pager as $book) {

125 $this->assertEquals('Book' . $i, $book->getTitle());

126 $i++;

127 }

128 $this->assertEquals(4, $i, 'getIterator() can be called several times');

125 printf(" Failure\n");

126

127 i++;

128 }

129

194 printf( ": %s\n", strerror( errno ) );

195

196 i++;

197 }

198

47 /* First find the field to associate to */

48 while (isspace(str[i]))

49 i++;

50 s = i;

51 while (isalnum(str[i]) || str[i] == '_')

52 i++;

53 len = i - s;

54 if (!len)

65 *pf = field;

66 while (isspace(str[i]))

67 i++;

68 if (str[i] != '=')

69 return -EINVAL;

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)

66 $binds[':name'.$i] = $data[0];

67 $binds[':id'.$i] = $data[1];

68 $i++;

69 }

70 $sql .= $values;

45 trigger.id = S.guid("ks-switchable");

46 }

47 i++;

48 });

49 i = 0;

53 panel.setAttribute("aria-hidden", activeIndex == i ? "false" : "true");

54 panel.setAttribute("aria-labelledby", t.id);

55 i++;

56 });

57

416 bufcolumn[j] = newCol + columnDiff;

417 columnDiff = nextColDiff;

418 i++;

419 }

420

284 while (x + i < 0)

285 {

286 i++;

287 }

288 for (int j = -1; j < 2; j++)

123 if(code[i] == corner[0])

124 {

125 i++;

126 bool found = true;

127 for(int j = 1; found && j < 4; j++, i++)

60 }

61 dbg("arg[%i] '%s'", i, argv[i]);

62 i++;

63 }

64 argv[i] = NULL;

139 app!=setting.apps.end(); app++) {

140 printf(" apps[%02d]='%s'\n", i, app->c_str());

141 i++;

142 }

143 i=0;

144 for (vector<Reject>::const_iterator reject=setting.reject.begin();

145 reject!=setting.reject.end(); reject++) {

146 i++;

147 printf(" reject[%02d]=('%s','%s','%s')\n", i, reject->file.c_str(),

148 reject->name.c_str(), reject->comment.c_str());

49 regionsToFilter.remove(i);

50 else

51 i++;

52 }

53 }

102 }

103

104 i++;

105 }

106 }

274 ?>

275 <?

276 $i++;

277

278 } // end while loop

103 }

104 else {

105 i++;

106 }

107 }

296 return_value.replace( pos, what.size(), with );

297 pos = return_value.find( what, pos );

298 i++;

299 }

300

100

101 String s3 = matcher.group(1);

102 int i1 = s3 != null ? Integer.parseInt(s3) - 1 : i++;

103

104 if (i1 < this.e.length) {

284

285 bptr += 8; // point to next line in blocks !

286 yi++;

287 if ( yi == 8 )

288 {

443 rowtoblock(bptr,workrow,w8);// block <- workrow ; back in the blocks

444

445 yi++;

446 bptr += 8; // point to next line in blocks !

447 if ( yi == 8 )

136 }

137

138 i++;

139 }

140

174 for ( CListIter<int, 0> iter(*this); !iter.IsPastEnd(); iter.MoveToNext() ) {

175 aulPointers[i] = ((ULONG)&*iter)-iNodeOffset;

176 i++;

177 }

178

81 {

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

83 i++;

84 }

85 }

371 if (toupper(f1[i])!=toupper(f2[i]))

372 return NO;

373 i++;

374 }

375 return (YESNO) (f1[i]==f2[i]);

204 int i=0, n=N(s), val=0;

205 if (n==0) return 0;

206 if (s[0]=='-') i++;

207 while (i<n) {

208 if (s[i]<'0') break;

210 val *= 10;

211 val += (int) (s[i]-'0');

212 i++;

213 }

214 if (s[0]=='-') val=-val;

283 int i=0, n=N(s);

284 if (n==0) return false;

285 if (s[i]=='+') i++;

286 if (s[i]=='-') i++;

295 int i=0, n=N(s);

296 if (n==0) return false;

297 if (s[i]=='+') i++;

298 if (s[i]=='-') i++;

232

233 private void skip() {

234 while (i < keys.length && keys[i] == Integer.MIN_VALUE) i++;

235 }

236 }

65 $sessions .= "$row[0]|";

66 }

67 $i++;

68 }

69 $sessions = preg_replace("/\|$/",'',$sessions);

110 }

111

112 $i++;

113 }

114

146 echo "| $G$LIVE_stations_FORMAT[$i]$EG | $G$LIVE_sessions_FORMAT[$i]$EG | $G$channel$EG | $G$number_dialed$EG | $G$start_time$EG | $G$call_time_MS$EG |\n";

147

148 $i++;

149 }

150

102 if ( i < length ) {

103 count++;

104 i++;

105 }

106 } //while

149 return false;

150 } else {

151 i++;

152 }

153 }

215 if (gstrsub(entry->d_name, "mirror_metadata.") == 0){

216 gstrcpy(&revs[i], entry->d_name);

217 i++;

218 };

219 };

239 if (pattern[pati] == (data[di] & mask[pati]))

240 {

241 pati++;

242 }

243 else if (pattern[pati] != (data[di] & mask[pati]))

250 }

251

252 di++;

253

254 if (pati == pattern.Length)

120 while (i < N && j < M && orig[i].equals(rev[j]))

121 {

122 i++;

123 j++;

124 }

125 }

126 else {

127 i++;

128 }

129 }

55 || c == '\r' || c == ' ' || c == ';')

56 {

57 i++;

58 continue;

59 }

81 // NAME=VALUE

82 nameEnd = i;

83 i++;

84 if (i == headerLen)

85 {

97 else

98 {

99 i++;

100 }

101

76 int i=0;

77 while( one.regionMatches( 0, two, 0, i ) )

78 i++;

79 return one.substring(0, i-1);

80 }

166 int i = 0;

167 do {

168 i++;

169 if (i > 100) {

170 return t;

181 "vfs.browser.colors." + i + ".color",

182 Color.black)));

183 i++;

184 }

185 } //}}}

188 fireTableRowsDeleted(i, i);

189 }

190 i++;

191 }

192

83 Swig_mark_arg (i);

84 Swig_mark_arg (i + 1);

85 i++;

86 } else {

87 Swig_arg_error();

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

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

157 i++;

158 count++;

159 }

87 TEST_NATIVE_OBJECT(cx, item)

88 array->addObject(item);

89 i++;

90 }

91 cocos2d::CCMenu* ret = cocos2d::CCMenu::createWithArray(array);

146 TEST_NATIVE_OBJECT(cx, item)

147 array->addObject(item);

148 i++;

149 }

150 cocos2d::CCFiniteTimeAction* ret = cocos2d::CCSequence::create(array);

184 TEST_NATIVE_OBJECT(cx, item)

185 array->addObject(item);

186 i++;

187 }

188 cocos2d::CCFiniteTimeAction* ret = cocos2d::CCSpawn::create(array);

180 if (patterns[j].accepts(element, context)) {

181 if (i != j) return false;

182 i++;

183 break;

184 }

524 bufcolumn[j] = newCol + columnDiff;

525 columnDiff = nextColDiff;

526 i++;

527 }

528

749 buf.append(match.group(

750 digit - '0'));

751 i++;

752 }

753 else

763 else

764 buf.append(ch);

765 i++;

766 }

767 }

285 String uri = null;

286 do {

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

288 uri = jEdit.getProperty(prop);

289 if (uri == null) break;

245 family.equalsIgnoreCase("dialog"))

246 userFonts.add(f);

247 i++;

248 }

249

334 log( "--- change() - Adding(2): " + changeTo[ j ] );

335 buff.add( changeTo[ j ] );

336 i++;

337 }

338 // fix the current line, this may have change due to insertion or removal of lines

249 while (baseclass[i]) {

250 // cplus_inherit_members(baseclass[i],mode);

251 i++;

252 }

253 */

696 lbs_deb_net("mcast address %s:%pM added to filter\n", dev->name,

697 mc_list->dmi_addr);

698 i++;

699 }

700 netif_addr_unlock_bh(dev);

13 org = i;

14 while (i < size && src[i] != '\\')

15 i++;

16

17 if (likely(i > org)) {

47 case '/':

48 gh_buf_putc(ob, ch);

49 i++;

50 break;

51

79 //Log.log(Log.DEBUG,this,"Setting '"+name+"."+i+"' to '"+getItemAt(i)+"'");

80 jEdit.setProperty(name + "." + i, getItemAt(i).toString());

81 i++;

82 }

83 jEdit.unsetProperty(name + "." + i);

98 }

99 query = jEdit.getProperty(name + "." + i);

100 i++;

101 }

102 setSelectedItem("");

44 return;

45 }

46 i++;

47 }

48

60 int ii = 0;

61

62 c.AsyncWork( () => t.ScheduleTimer( ts, h => {ii++; c.AsyncWorkComplete();} ));

63 c.AsyncWork( () => t.ScheduleTimer( ts, h => {ii++;c.AsyncWorkComplete();} ));

113 return i;

114 if (!(SwigType_type(t) == T_VOID))

115 i++;

116 else

117 break;

128 int i = 0;

129 while (p) {

130 i++;

131 p = nextSibling(p);

132 }

325 );

326 }

327 child_i++;

328 child_box = json_data[child_i];

329 }

261 d = d * m_invDecay;

262 m_decayTime = m_decayTime + 0.1 * d; // appox interval call

263 i++;

264 }

265 }

335 *pos++ = rates_len - count;

336

337 for (i++; i < sband->n_bitrates; i++) {

338 if (BIT(i) & rates) {

339 int rate = sband->bitrates[i].bitrate;

399 Entry<String, String> entry = it.next();

400 items[i] = entry.getKey();

401 i++;

402 }

403

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