false69 Changes to Ranges Library  ranges::shift_left() / ranges::shift_right() Shifts the elements in a range left or right  E.g.: std::vector v{ "a", "b", "c", "d", "e"};// "a", "b" std::ranges::shift_left(v, 2); // "c", "d", "e", "", "" std::ranges::shift_right(v, 1); // "", "c", "d", "e", ""70 Changes to Ranges Library  ranges::to(): Ranges Library  Several folding algorithms: ranges::fold_left(), fold_left_first(), fold_right(), fold_right_last(), fold_left_with_iter(), and fold_left_first_with_iter()  E.g.: std::vector v{ 11

horizontal-align o margin o margin-top o margin-right o margin-bottom o margin-left o width o height o min-width o min-height o padding o padding-top o padding-right o padding-bottom o padding-left o visibility

forward_list now return size_type instead of void, the number of removed elements  shift_left() and shift_right() added to , shifts elements in a range  erase() and erase_if() for all containers remove

的时间指的是 读一个缓存行（ 64 字节）所花费的时间。 • 根据计算： 125/64*4≈8 • 即从主内存读取一次 float 花费 8 个 cycle ， 符合小彭老师的经验公式。 • “right” 和“ wrong” 指的是分支预测是否成功。 多少计算量才算多？ • 看右边的 func ，够复杂了吧？也只是勉勉强强超过一 点内存的延迟了，但在 6 个物理核心上并行加速后， 还是变成