Chapter 5 语句
5-1 语句基础
语句的常见类别
-
表达式语句:表达式后加分号;
int x; x = 3;
-
空语句
;
-
复合语句(语句体):由大括号组成,无需在结尾加分号,形成独立的域(语句域)
int x = 2; { int x = 3; x = x + 1; std::cout << x; }
顺序语句与非顺序语句
-
顺序语句
int x = 0; ++x; int y = 6; --y;
- 从语义上按照先后顺序执行
- 实际的执行顺序可能会由于编译器优化、硬件乱序执行发生变化
- 与硬件流水线紧密结合,执行效率较高
-
非顺序语句
- 在执行过程中引入跳转,从而产生复杂的变化
- 分支预测错误可能会导致执行性能降低
-
goto
int main() { int x = 3; if (x) goto label; x = x + 1; label: return 0; }
具有若干限制:
- 不能跨函数跳转;
- 向前跳转时不能越过对象初始化语句
int main() { int x = 3; goto label; // 前向跳转 int y = 4; label: y = y + 1; }
后向跳转可能会导致对象的销毁或重新初始化
bool flag = true; label: int x = 3; if (flag) { flag = false; goto label; }
goto 本质上对应了汇编语言中的跳转指令
-
缺乏结构性含义;
-
容易造成逻辑混乱;
-
除特殊情况外,应避免使用。
5-2 分支语句
if语句
if (条件) true分支语句
if (条件) true分支语句 else false分支语句
int main()
{
int x = -1;
if (x > 2)
{
int y = 3 * x;
std::cout << y << '\n';
}
else
{
if (x > 0)
std::cout << "x > 0\n";
else
std::cout << "x <= 0\n";
}
}
else会与最近的if相匹配
if V.S. constexpr if——运行期与编译器分支
int main()
{
constexpr int grade = 80;
if constexpr (grade < 60) // 肯定不会被执行,会直接注释掉
{
std::cout << "fail\n";
}
else
{
std::cout << "pass\n";
if constexpr (grade == 100)
{
std::cout << "excellent!\n"
}
else
{
std::cout << "not bad\n";
}
}
}
带初始化的if
int x = 3;
//希望执行if后,y被删除
{
int y = x * 3;
if (y > 100)
{
}
else
{
}
}//不利于阅读
if (int y = x * 3; y > 100)
{
}
else
{
}
int y = 4;//与上述y不冲突
switch语句
int x = 3;
switch (x + 1)
std::cout << "Hello\n";
case/default标签
int x;
std::cin >> x;
switch (x)
{
case 3:
std::cout << "Hello\n"; // fall through
[[fallthrough]];
case 4:
std::cout << "World\n";
break;
default:
std::cout << "China\n";
break;
}
//case后面跟常量表达式, 用于匹配switch 中的条件,匹配时执行后续的代码
// 可以使用break跳出当前的switch执行
case和default中定义对象需要加大括号
int x;
std::cin >> x;
switch (x)
{
case 3:
{
int y = 4;
std::cout << "Hello\n"; // fall through
break;
}
case 4:
std::cout << "World\n";
break;
default:
std::cout << "China\n";
break;
}
[[fallthrough]]属性
相比if:
- 分支描述能力较弱;
- 在一些情况下能够更好地优化。
5-3 循环语句
while
while (条件) 语句
int x = 3;
while (x)
{
std::cout << x << std::endl;
--x;
}
注意:在while条件部分不包含额外的初始化内容
do-while
do 语句 while (表达式)
do
{
std::cout << x << std::endl;
--x;
}while(x); // do-while不支持初始化变量
for
for (初始化语句 条件; 迭代表达式) 语句
for (int x = 0; x < 5; ++x)
{
std::cout << x << std::endl;
}
int main()
{
for (int i, *p = &i; i < 9; i +=2)
{
}
}
基于范围的for循环
for (范围声明 : 范围表达式)
# include <iostream>
# include <vector>
int main()
{
std::vector<int> arr{1,2,3,4,5};
for (int v : arr)
{
std::cout << v << '\n';
}
}
break/continue
break:导致循环/switch跳出
continue:跳过整个循环体剩余 的部分
如果要跳出多重嵌套循环,可以考虑使用goto语句
5-4 达夫设备
int main()
{
constexpr size_t buffer_count = 10000;
std::vector<size_t> buffer(buffer_count);
for (size_t i = 0; i < buffer_count; ++i)
{
buffer[i] = i;
}
size_t max_valude = buffer[0];
for (size_t i = 0; i < buffer_count; i += 8)
{
max_value = (max_valude>buffer[i]) ? max_value : buffer[i];
max_value = (max_valude>buffer[i+1]) ? max_value : buffer[i+1];
max_value = (max_valude>buffer[i+2]) ? max_value : buffer[i+2];
max_value = (max_valude>buffer[i+3]) ? max_value : buffer[i+3];
max_value = (max_valude>buffer[i+4]) ? max_value : buffer[i+4];
max_value = (max_valude>buffer[i+5]) ? max_value : buffer[i+5];
max_value = (max_valude>buffer[i+6]) ? max_value : buffer[i+6];
max_value = (max_valude>buffer[i+7]) ? max_value : buffer[i+7];
}// 这一块的逻辑通过循环进行遍历,结果没有问题,处理速度也相对较快,但for循环内部的迭代表达式和条件比较慢,成本高 ---> 循环展开
std::cout << max_value << std::endl;
}
如果buffer_count是10001(不能被8整除)怎么办?
- 方案1:
int main()
{
constexpr size_t buffer_count = 10000;
std::vector<size_t> buffer(buffer_count);
for (size_t i = 0; i < buffer_count; ++i)
{
buffer[i] = i;
}
size_t max_valude = buffer[0];
for (size_t i = 0; i < buffer_count; i += 8)
{
max_value = (max_valude>buffer[i]) ? max_value : buffer[i];
max_value = (max_valude>buffer[i+1]) ? max_value : buffer[i+1];
max_value = (max_valude>buffer[i+2]) ? max_value : buffer[i+2];
max_value = (max_valude>buffer[i+3]) ? max_value : buffer[i+3];
max_value = (max_valude>buffer[i+4]) ? max_value : buffer[i+4];
max_value = (max_valude>buffer[i+5]) ? max_value : buffer[i+5];
max_value = (max_valude>buffer[i+6]) ? max_value : buffer[i+6];
max_value = (max_valude>buffer[i+7]) ? max_value : buffer[i+7];
}
for(size_t i = buffer_count / 8 * 8;i < buffer_count; ++i)
{
max_value = (max_value > buffer[i]) ? max_value : buffer[i];
} // 解决方案不是那么好
std::cout << max_value << std::endl;
}
- 方案2:
int main()
{
constexpr size_t buffer_count = 10000;
std::vector<size_t> buffer(buffer_count);
for (size_t i = 0; i < buffer_count; ++i)
{
buffer[i] = i;
}
size_t max_valude = buffer[0];
auto ptr = buffer.begin();
for (size_t i = 0; i < buffer_count; i += 8)
{
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
}
switch (buffer_count % 8)
{
case 7: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 6: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 5: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 4: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 3: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 2: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 1: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;
}
std::cout << max_value << std::endl;
}
- 方案3:
int main()
{
constexpr size_t buffer_count = 10000;
std::vector<size_t> buffer(buffer_count);
for (size_t i = 0; i < buffer_count; ++i)
{
buffer[i] = i;
}
size_t max_valude = buffer[0];
auto ptr = buffer.begin();
switch (buffer_count % 8)
{
case 0: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 7: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 6: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 5: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 4: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 3: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 2: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 1: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;
}
for (size_t i = 0; i < (buffer_count - 1) / 8; ++i)
{
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
max_value = (max_valude > *ptr) ? max_value : *ptr;
++ptr;
}
std::cout << max_value << std::endl;
}
- 方案4:
int main()
{
constexpr size_t buffer_count = 10000;
std::vector<size_t> buffer(buffer_count);
for (size_t i = 0; i < buffer_count; ++i)
{
buffer[i] = i;
}
size_t max_valude = buffer[0];
auto ptr = buffer.begin();
size_t i = 0;
switch (buffer_count % 8)
for (; i < (buffer_count + 7) / 8; ++i)
{[[fallthrough]];
case 0: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 7: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 6: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 5: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 4: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 3: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 2: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;[[fallthrough]];
case 1: max_value = (max_valude > *ptr) ? max_value : *ptr;++ptr;
}
std::cout << max_value << std::endl;
}