PageRenderTime 453ms queryFilters 1ms Sphinxql 342ms app.CodeModel.GetByIds 16ms findMatchingLines 40ms GetByIds 56ms meta 0ms repositoryFilters 41ms languageFilters 40ms sourceFilters 14ms

7,704,234 results for 'i++' (453 ms)

Source

Language

Repository

stlgeom.cpp https://bitbucket.org/lge/gmsh.git | C++ | 3,506 lines
25  mesh.ClearFaceDescriptors();
26  for (int i = 1; i <= geom.GetNOFaces(); i++)
27    mesh.AddFaceDescriptor (FaceDescriptor (i, 1, 0, 0));
119  int cons = 1;
120  for (i = 1; i <= GetNT(); i++)
121    {
135
136  for (i = 1; i <= GetNT(); i++)
137    {
144  int lp1,lp2;
145  for (i = 1; i <= GetNT(); i++)
146    {
192
193  for (i = 1; i <= nt; i++)
194    {
bisect.cpp https://bitbucket.org/lge/gmsh.git | C++ | 4,071 lines
49    { 
50      for (int i = 0; i < 4; i++) { faceedges[i] = 255; }
51    }
55  {
56    for(int i=0; i<4; i++)
57      ost << mt.pnums[i] << " ";
61    ost << "faceedges = ";
62    for(int i=0; i<4; i++)
63      ost << int(mt.faceedges[i]) << " ";
70  {
71    for(int i=0; i<4; i++)
72      ost >> mt.pnums[i];
87
88    for(int i=0; i<4; i++)
89      {
PViewVertexArrays.cpp https://bitbucket.org/lge/gmsh.git | C++ | 1,501 lines
30  int id[8] = {i0, i1, i2, i3, i4, i5, i6, i7};
31  for(int i = 0; i < nb; i++){
32    if(val[id[i]][0] > vmax)      val[id[i]][0] = vmax;
140  numComp2 = numComp;
141  for(int i = 0; i < numNodes; i++)
142    for(int j = 0; j < numComp; j++)
156    numComp2 = data2->getNumComponents(opt->timeStep, ient, iele);
157    for(int i = 0; i < numNodes; i++)
158      for(int j = 0; j < numComp2; j++)
184  for(int k = 0; k < numNodes; k++) {
185    for(int i = 0; i < 3; i++) values[i] = xyz[k][i];
186    for(int i = 0; i < std::min(numComp, 9); i++) values[3 + i] = vals[k][i];
187    if(opt->genRaiseEvaluator->eval(values, res))
188      for(int i = 0; i < 3; i++)
189        xyz[k][i] += opt->genRaiseFactor * res[i];
CommandLine.cpp https://bitbucket.org/lge/gmsh.git | C++ | 826 lines
148        CTX::instance()->batch = -99;
149        i++;
150      }
151      else if(!strcmp(argv[i] + 1, "onelab")) {
152        i++;
153        if(argv[i] && argv[i + 1] && argv[i + 1][0] != '-'){
164      else if(!strcmp(argv[i] + 1, "lol")) {
165        i++;
166        if(argv[i] && argv[i + 1] && argv[i + 1][0] != '-'){
173      else if(!strcmp(argv[i] + 1, "socket")) {
174        i++;
175        if(argv[i])
175        if(argv[i])
176          Msg::InitializeOnelab("GmshRemote", argv[i++]);
177        else
IntArrays.java https://bitbucket.org/gidiko/gridapp.git | Java | 1,386 lines
43	System.arraycopy(data, 0, dataShuffled, 0, size);
44	for (int i = 0; i < size; i++) {
45	    int target = i + (int)(Math.random() * (size - i));
65	int[] dataPermuted = new int[n];
66	for (int i = 0; i < n; i++) {
67	    dataPermuted[i] = data[map[i]];
87	Arrays.sort(xsorted);
88	for (int i = 0; i < size; i++) {
89	    int pos = Arrays.binarySearch(xsorted, x[i]);
95	Arrays.sort(ysorted);
96	for (int i = 0; i < size; i++) {
97	    int pos = Arrays.binarySearch(ysorted, y[i]);
99	}
100	for (int i = 0; i < size; i++) {
101	    map[i] = xranks[iyranks[i]];
DoubleArrays.java https://bitbucket.org/gidiko/gridapp.git | Java | 1,433 lines
44		System.arraycopy(data, 0, dataShuffled, 0, size);
45		for (int i = 0; i < size; i++) {
46			int target = i + (int)(Math.random() * (size - i));
66		double[] dataPermuted = new double[n];
67		for (int i = 0; i < n; i++) {
68			dataPermuted[i] = data[map[i]];
94		double[] data = new double[n];
95		for(int i = 0; i < n; i++) {
96			data[i] = Math.random();
110		double[][] data = new double[m][n];
111		for(int i = 0; i < m; i++) {
112			data[i] = random(n);
126		Set set = new HashSet<Double>();
127		for (int i = 0; i < n; i++) {
128			set.add(data[i]);
Type1CFont.java https://bitbucket.org/maxgoebel/examtool.git | Java | 1,190 lines
93        int partsloc = 0;
94        for (int i = 0; i < data.length; i++) {
95            int d = ((int) data[i]) & 0xff;
216        int n = 0;
217        for (int i = 0; i < len; i++) {
218            n = (n << 8) | (((int) data[pos++]) & 0xff);
418                System.out.print("CMD= "+num+", args=");
419                for (int i=0; i<stackptr; i++) {
420                System.out.print(" "+stack[i]);
445                int ncodes = readByte ();
446                for (int i = 1; i < ncodes + 1; i++) {
447                    int idx = readByte () & 0xff;
452                int p = 1;
453                for (int i = 0; i < nranges; i++) {
454                    int start = readByte ();
sparse_matrix.hpp https://bitbucket.org/amaalej/pcl.git | C++ Header | 970 lines
86      else                Resize( M.rows );
87      for( int i=0 ; i<rows ; i++ )
88      {
96      int e = 0;
97      for( int i=0 ; i<rows ; i++ ) e += int( rowSizes[i] );
98      return e;
104      else                Resize( M.rows );
105      for( int i=0 ; i<rows ; i++ )
106      {
138      if( fwrite( rowSizes , sizeof( int ) , rows , fp )!=rows ) return false;
139      for( int i=0 ; i<rows ; i++ ) if( fwrite( (*this)[i] , sizeof( MatrixEntry< T > ) , rowSizes[i] , fp )!=rowSizes[i] ) return false;
140      return true;
148      if( fread( rowSizes , sizeof( int ) , rows , fp )!=rows ) return false;
149      for( int i=0 ; i<rows ; i++ )
150      {
cpia2_core.c https://bitbucket.org/altlc/wive-rtnl-ralink-rt305x-routers-firmware-amod.git | C | 2,523 lines
583		int i;
584		for (i = 0; i < cmd->reg_count; i++) {
585			if((cmd->req_mode & 0x0c) == CAMERAACCESS_TYPE_BLOCK)
819	 ***/
820	for (i = 0; i < 50; i++) {
821		cpia2_do_command(cam, CPIA2_CMD_GET_PW_CONTROL,
849	int i;
850	for (i = 0; i <= 50; i++) {
851		/* Read system status */
906
907	for (i = 0; i < PATCH_DATA_SIZE; i++) {
908		for (j = 0; j < patch_data[i].count; j++) {
1172	if (image_type == VIDEOSIZE_CIF) {
1173		cmd.buffer.registers[i++].value =
1174		    (u8) (CPIA2_VC_VC_FORMAT_UFIRST |
PropertySet_Test.java https://bitbucket.org/markjenkins/libreoffice_ubuntu-debian-fixes.git | Java | 1,678 lines
52        try {
53        r[i++]= cl.test_convertPropertyValue();
54        }catch(java.lang.Exception e){
54        }catch(java.lang.Exception e){
55            i++;
56        }
74        try {
75            r[i++]= cl.test_setPropertyValueNoBroadcast();
76        }catch(java.lang.Exception e){
76        }catch(java.lang.Exception e){
77            i++;
78        }
102            ret=  cl.getPropertyValue("PropBoolA");
103            r[i++]= ((Boolean) ret).equals( value);
104            value= new Character('A');
InterfaceContainer_Test.java https://bitbucket.org/markjenkins/libreoffice_ubuntu-debian-fixes.git | Java | 967 lines
82
83        r[i++]= cont.size() == 0;
84        r[i++]= cont.add(obj1);
84        r[i++]= cont.add(obj1);
85        r[i++]= cont.size() == 1;
86        r[i++]= cont.add(obj1); // add the same object again
86        r[i++]= cont.add(obj1); // add the same object again
87        r[i++]= cont.size() == 2;
88        r[i++]= cont.add(proxyObj3TypeProv);
88        r[i++]= cont.add(proxyObj3TypeProv);
89        r[i++]= cont.size() == 3;
90        r[i++]= cont.isEmpty() ? false: true;
91        cont.clear();
92        r[i++]= cont.size() == 0;
93        r[i++]= cont.isEmpty();
clsCreateProfile.cs https://bitbucket.org/VahidN/rhabot2.git | C# | 1,744 lines
70
71                for (i = 10; i < 15; i++)
72                    GlobalSettings.TalentList.Add(new ISXBotHelper.Talents.clsPTalent("Improved Mark of the Wild", i));
73                GlobalSettings.TalentList.Add(new ISXBotHelper.Talents.clsPTalent("Furor", 15));
74                for (i = 16; i <= 20; i++)
75                    GlobalSettings.TalentList.Add(new ISXBotHelper.Talents.clsPTalent("Naturalist", i));
75                    GlobalSettings.TalentList.Add(new ISXBotHelper.Talents.clsPTalent("Naturalist", i));
76                for (i = 21; i <= 23; i++)
77                    GlobalSettings.TalentList.Add(new ISXBotHelper.Talents.clsPTalent("Natural Shapeshifter", i));
78                GlobalSettings.TalentList.Add(new ISXBotHelper.Talents.clsPTalent("Omen of Clarity", 24));
79                for (i = 25; i <= 29; i++)
80                    GlobalSettings.TalentList.Add(new ISXBotHelper.Talents.clsPTalent("Ferocity", i));
80                    GlobalSettings.TalentList.Add(new ISXBotHelper.Talents.clsPTalent("Ferocity", i));
81                for (i = 30; i <= 32; i++)
82                    GlobalSettings.TalentList.Add(new ISXBotHelper.Talents.clsPTalent("Feral Instinct", i));
jtag.c https://bitbucket.org/morfic/trinity_four.git | C | 1,177 lines
74	case 0:
75		state[i++] = dbg_read(DBGBVR0);
76		state[i++] = dbg_read(DBGBCR0);
78	case 1:
79		state[i++] = dbg_read(DBGBVR1);
80		state[i++] = dbg_read(DBGBCR1);
82	case 2:
83		state[i++] = dbg_read(DBGBVR2);
84		state[i++] = dbg_read(DBGBCR2);
86	case 3:
87		state[i++] = dbg_read(DBGBVR3);
88		state[i++] = dbg_read(DBGBCR3);
90	case 4:
91		state[i++] = dbg_read(DBGBVR4);
92		state[i++] = dbg_read(DBGBCR4);
orcemulateopcodes.c https://bitbucket.org/jingtao/orc.git | C | 5,373 lines
66
67  for (i = 0; i < n; i++) {
68    /* 0: loadb */
93
94  for (i = 0; i < n; i++) {
95    /* 0: loadb */
122
123  for (i = 0; i < n; i++) {
124    /* 0: loadb */
151
152  for (i = 0; i < n; i++) {
153    /* 0: loadb */
180
181  for (i = 0; i < n; i++) {
182    /* 0: loadb */
dumb32.conf https://bitbucket.org/lcirvin/cse465-project.git | Config | 1,435 lines
34	while (c < 0x7f)	// ..to TILDE
35		charset[i++] = c++;
36	c = 0xa0;		// from NO-BREAK SPACE
37	while (c < 0x378)	// ..to GREEK SMALL LETTER PAMPHYLIAN DIGAMMA
38		charset[i++] = c++;
39	c = 0x37a;		// from GREEK YPOGEGRAMMENI
40	while (c < 0x37f)	// ..to GREEK QUESTION MARK
41		charset[i++] = c++;
42	c = 0x384;		// from GREEK TONOS
43	while (c < 0x38b)	// ..to GREEK CAPITAL LETTER IOTA WITH TONOS
44		charset[i++] = c++;
45	c = 0x38e;		// from GREEK CAPITAL LETTER UPSILON WITH TONOS
46	while (c < 0x3a2)	// ..to GREEK CAPITAL LETTER RHO
47		charset[i++] = c++;
48	c = 0x3a3;		// from GREEK CAPITAL LETTER SIGMA
dumb16.conf https://bitbucket.org/lcirvin/cse465-project.git | Config | 1,079 lines
34	while (c < 0x7f)	// ..to TILDE
35		charset[i++] = c++;
36	c = 0xa0;		// from NO-BREAK SPACE
37	while (c < 0x378)	// ..to GREEK SMALL LETTER PAMPHYLIAN DIGAMMA
38		charset[i++] = c++;
39	c = 0x37a;		// from GREEK YPOGEGRAMMENI
40	while (c < 0x37f)	// ..to GREEK QUESTION MARK
41		charset[i++] = c++;
42	c = 0x384;		// from GREEK TONOS
43	while (c < 0x38b)	// ..to GREEK CAPITAL LETTER IOTA WITH TONOS
44		charset[i++] = c++;
45	c = 0x38e;		// from GREEK CAPITAL LETTER UPSILON WITH TONOS
46	while (c < 0x3a2)	// ..to GREEK CAPITAL LETTER RHO
47		charset[i++] = c++;
48	c = 0x3a3;		// from GREEK CAPITAL LETTER SIGMA
altivec.igen https://bitbucket.org/codefirex/toolchain_gdb.git | Unknown | 2,360 lines
83	  vr_busy &= model_ptr->vr_busy;
84	  for(i = 0; i < 32; i++) {
85	    if (((1 << i) & vr_busy) != 0) {
96	if (vr_mask) {
97	  for(i = 0; i < 32; i++) {
98	    if (((1 << i) & vr_mask) != 0) {
103	if (cr_mask) {
104	  for(i = 0; i < 8; i++) {
105	    if (((1 << i) & cr_mask) != 0) {
410	j = addr & 0xf;
411	for (i = 0; i < 16; i++)
412	  if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
425	j = 0x10 - (addr & 0xf);
426	for (i = 0; i < 16; i++)
427	  if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
linux-x86-low.c https://bitbucket.org/codefirex/toolchain_gdb.git | C | 3,217 lines
1442  buf[i++] = 0x41; buf[i++] = 0x53; /* push %r11 */
1443  buf[i++] = 0x41; buf[i++] = 0x52; /* push %r10 */
1444  buf[i++] = 0x41; buf[i++] = 0x51; /* push %r9 */
1525  buf[i++] = 0x41; buf[i++] = 0x5c; /* pop %r12 */
1526  buf[i++] = 0x41; buf[i++] = 0x5d; /* pop %r13 */
1527  buf[i++] = 0x41; buf[i++] = 0x5e; /* pop %r14 */
1527  buf[i++] = 0x41; buf[i++] = 0x5e; /* pop %r14 */
1528  buf[i++] = 0x41; buf[i++] = 0x5f; /* pop %r15 */
1529  buf[i++] = 0x58; /* pop %rax */
2157  i = 0;
2158  buf[i++] = 0x48;  buf[i++] = 0xb8; /* mov $<n>,%rax */
2159  memcpy (&buf[i], &num, sizeof (num));
2786    {
2787      buf[i++] = 0x31; buf[i++] = 0xdb; /* xor %ebx,%ebx */
2788    }
rts51x_scsi.c https://bitbucket.org/bradfa/linux.git | C | 2,148 lines
329		RTS51X_DEBUGP("");
330		for (i = 0; i < srb->cmd_len && i < 16; i++)
331			RTS51X_DEBUGPN(" %02x", srb->cmnd[i]);
582			data_size = 0x68;
583		buf[i++] = 0x67;	/* Mode Data Length */
584	} else {
587			data_size = 0x6C;
588		buf[i++] = 0x00;	/* Mode Data Length (MSB) */
589		buf[i++] = 0x6A;	/* Mode Data Length (LSB) */
595			support_format = 1;
596			buf[i++] = 0x40;
597		} else if (CHK_MSPRO(ms_card)) {
598			support_format = 1;
599			buf[i++] = 0x20;
600		} else {
ixgbe_ethtool.c https://bitbucket.org/bradfa/linux.git | C | 3,013 lines
490	regs_buff[34] = IXGBE_READ_REG(hw, IXGBE_FCTTV(3));
491	for (i = 0; i < 8; i++) {
492		switch (hw->mac.type) {
509	/* Receive DMA */
510	for (i = 0; i < 64; i++)
511		regs_buff[53 + i] = IXGBE_READ_REG(hw, IXGBE_RDBAL(i));
511		regs_buff[53 + i] = IXGBE_READ_REG(hw, IXGBE_RDBAL(i));
512	for (i = 0; i < 64; i++)
513		regs_buff[117 + i] = IXGBE_READ_REG(hw, IXGBE_RDBAH(i));
513		regs_buff[117 + i] = IXGBE_READ_REG(hw, IXGBE_RDBAH(i));
514	for (i = 0; i < 64; i++)
515		regs_buff[181 + i] = IXGBE_READ_REG(hw, IXGBE_RDLEN(i));
515		regs_buff[181 + i] = IXGBE_READ_REG(hw, IXGBE_RDLEN(i));
516	for (i = 0; i < 64; i++)
517		regs_buff[245 + i] = IXGBE_READ_REG(hw, IXGBE_RDH(i));
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21