int main()
{
boost::function<void (int)>fnx = [](int x) { std::cout << "lambda : x = " << x << std::endl;};
func6(1234, fnx);
return 0;
}
static double func4_6(const double x[], const int iResponse)
{
if (iResponse == 0)
return func4(x, iResponse);
else if (iResponse == 1)
return func6(x, iResponse);
else
error("bad iResponse");
return 0;
}
int main ()
{
int i[10], r;
i[0] = 0;
r = func0(0);
if (i[0])
link_error0();
i[1] = 0;
r = func1(0);
if (i[1])
link_error1();
i[2] = 0;
r = func2(0);
if (i[2])
link_error2();
i[3] = 0;
r = func3(0);
if (i[3])
link_error3();
i[4] = 0;
r = func4(0);
if (i[4])
link_error4();
i[5] = 0;
r = func5(0);
if (i[5])
link_error5();
i[6] = 0;
r = func6(0);
if (i[6])
link_error6();
i[7] = 0;
r = func7(0);
if (i[7])
link_error7();
return r;
}
void
func6_fdf (float x, void * p, float *y, float *yprime)
{
*y = func6 (x, p);
*yprime = 7.0 * pow (x - 1, 6.0);
}
void
func6_fdf (double x, void * p, double *y, double *yprime)
{
*y = func6 (x, p);
*yprime = 7.0 * pow (x - 1, 6.0);
}
int main(int argc, char* argv[]) {
int a = 10;
{
for(int idx = 0; idx < a; idx++) {
printf("7: idx=%d\n", idx);
}
for(int idx = 0; idx < a; idx++) {
idx++;
printf("8: idx=%d\n", idx);
}
for(int idx=a; idx>=0; --idx) {
printf("9: idx=%d\n", idx);
}
for(int idx=N; idx>0; idx--) {
printf("10: idx=%d\n", idx);
}
for(int idx=a; N>0; N--) {
printf("11: idx=%d\n", a);
}
for(a=15;a>=0;a-=3) {
printf("12: a=%d\n", a);
}
for(a=1;a<15;a+=3) {
printf("13: a=%d\n", a);
}
}
// example of loop with a complex condition expression
// in this case the loop is rewritten as a while loop
for(a=1;a < 10 && a > 0; a+=2) {
printf("14: a=%d\n", a);
}
// example of for loop with missing increment expression
for(a=0; a!=0; ) {
printf("15: a=%d\n", a);
}
printf("16: a=%d\n", a);
{
int end = 20;
int count;
for(a=0; a < end; a++) {
if(a > 10)
break;
}
count = a;
printf("17: count = %d\n", count);
for(a=end; a > 0 ; a--) {
if(a < 10)
break;
}
printf("18: a = %d\n", a);
}
func(a);
func2();
func3();
func4();
func5(a);
func6();
func7();
}
