注意:本文内容适用于 Tmux 2.3 及以上的版本,但是绝大部分的特性低版本也都适用,鼠标支持、VI 模式、插件管理在低版本可能会与本文不兼容。
启动新会话:
tmux [new -s 会话名 -n 窗口名]
恢复会话:
| #include <tuple> | |
| #include <type_traits> | |
| template <class T, class... TArgs> | |
| decltype(void(T{std::declval<TArgs>()...}), std::true_type{}) | |
| test_is_braces_constructible(int); | |
| template <class, class...> | |
| std::false_type | |
| test_is_braces_constructible(...); |
| // :copyright: (c) 2017 Alex Huszagh. | |
| // :license: MIT. | |
| /** | |
| * Cartesian product algorithm. | |
| * | |
| * Lazily calculates the cartesian product from a container of containers, | |
| * of either linear (array, vector, set, unordered_set) or associative | |
| * (map, unordered_map, multimap, unordered_multimap) containers. | |
| * | |
| * The code can be used as follows: |