Linux Manuals

std::experimental::filesystem::copy – std::experimental::filesystem::copy Synopsis Defined in header<experimental / filesystem> void copy(const path &from, const path &to); (1)(filesystem TS) void copy(const path &from, const path &to, error_code &ec); void copy(const path &from, const path &to, copy_options options); (2)(filesystem TS) void copy(const path &from, const path &to, copy_options options, error_code &ec); Copies files and directories, with a…

std::experimental::filesystem::canonical – std::experimental::filesystem::canonical Synopsis Defined in header<experimental / filesystem> path canonical(const path &p, const path &base = current_path()); (1)(filesystem TS) path canonical(const path &p, error_code &ec); (2)(filesystem TS) path canonical(const path &p, const path &base, error_code &ec); (3)(filesystem TS) Converts path p to a canonical absolute path, i.e. an absolute path that has no dot,…

std::experimental::filesystem::begin(recursive_directory_iterator),std::experimental::filesystem::end(recursive_directory_iterator) – std::experimental::filesystem::begin(recursive_directory_iterator),std::experimental::filesystem::end(recursive_directory_iterator) Synopsis recursive_directory_iterator begin( recursive_directory_iterator iter ); (1) (filesystem TS) recursive_directory_iterator end( const recursive_directory_iterator& ); (2) (filesystem TS) 1) Returns iter unchanged 2) Returns a default-constructed recursive_directory_iterator, which serves as the end iterator. The argument is ignored. These non-member functions enable the use of recursive_directory_iterators with range-based for loops. Parameters iter – a…

std::experimental::filesystem::begin(directory_iterator),std::experimental::filesystem::end(directory_iterator) – std::experimental::filesystem::begin(directory_iterator),std::experimental::filesystem::end(directory_iterator) Synopsis directory_iterator begin( directory_iterator iter ); (1) (filesystem TS) directory_iterator end( const directory_iterator& ); (2) (filesystem TS) 1) Returns iter unchanged 2) Returns a default-constructed directory_iterator, which serves as the end iterator. The argument is ignored. These non-member functions enable the use of directory_iterators with range-based for loops. Parameters iter – a…

std::experimental::filesystem::absolute,std::experimental::filesystem::system_complete – std::experimental::filesystem::absolute,std::experimental::filesystem::system_complete Synopsis Defined in header<experimental / filesystem> path absolute(const path &p, const path &base = current_path()); (1)(filesystem TS) path system_complete(const path &p); (2)(filesystem TS) path system_complete(const path &p, error_code &ec); 1) Returns absolute path of p relative to base according to the following rules:       * If p has both root name and root…

std::experimental::erased_type – std::experimental::erased_type Synopsis Defined in header <experimental/utility> struct erased_type { }; (library fundamentals TS) The struct erased_type is an empty struct that serves as a placeholder for a type in situations where the actual type is determined at runtime. For example, in classes that use type-erased_allocators, the nested typedef allocator_type is an alias for…

std::experimental::erase_if(std::vector) – std::experimental::erase_if(std::vector) Synopsis Defined in header<experimental / vector> template <class T, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::vector<T, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container.Equivalent to c.erase(std::remove_if(c.begin(), c.end(), pred), c.end()); Parameters c – container from which to erase pred – predicate that determines…

std::experimental::erase_if(std::unordered_set) – std::experimental::erase_if(std::unordered_set) Synopsis Defined in header<experimental / unordered_set> template <class Key, class Hash, class KeyEqual, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::unordered_set<Key, Hash, KeyEqual, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container. Equivalent to for (auto i = c.begin(), last = c.end(); i !=…

std::experimental::erase_if(std::unordered_multiset) – std::experimental::erase_if(std::unordered_multiset) Synopsis Defined in header<experimental / unordered_set> template <class Key, class Hash, class KeyEqual, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::unordered_multiset<Key, Hash, KeyEqual, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container. Equivalent to for (auto i = c.begin(), last = c.end(); i !=…

std::experimental::erase_if(std::unordered_multimap) – std::experimental::erase_if(std::unordered_multimap) Synopsis Defined in header<experimental / unordered_map> template <class Key, class T, class Hash, class KeyEqual, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::unordered_multimap<Key, T, Hash, KeyEqual, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container. Equivalent to for (auto i = c.begin(), last =…

std::experimental::erase_if(std::unordered_map) – std::experimental::erase_if(std::unordered_map) Synopsis Defined in header<experimental / unordered_map> template <class Key, class T, class Hash, class KeyEqual, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::unordered_map<Key, T, Hash, KeyEqual, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container. Equivalent to for (auto i = c.begin(), last =…

std::experimental::erase_if(std::set) – std::experimental::erase_if(std::set) Synopsis Defined in header<experimental / set> template <class Key, class Compare, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::set<Key, Compare, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container. Equivalent to for (auto i = c.begin(), last = c.end(); i != last;) { if…

std::experimental::erase_if(std::multiset) – std::experimental::erase_if(std::multiset) Synopsis Defined in header<experimental / set> template <class Key, class Compare, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::multiset<Key, Compare, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container. Equivalent to for (auto i = c.begin(), last = c.end(); i != last;) { if…

std::experimental::erase_if(std::multimap) – std::experimental::erase_if(std::multimap) Synopsis Defined in header<experimental / map> template <class Key, class T, class Compare, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::multimap<Key, T, Compare, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container. Equivalent to for (auto i = c.begin(), last = c.end(); i !=…

std::experimental::erase_if(std::map) – std::experimental::erase_if(std::map) Synopsis Defined in header<experimental / map> template <class Key, class T, class Compare, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::map<Key, T, Compare, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container. Equivalent to for (auto i = c.begin(), last = c.end(); i !=…

std::experimental::erase_if(std::list) – std::experimental::erase_if(std::list) Synopsis Defined in header<experimental / list> template <class T, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::list<T, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container.Equivalent to c.remove_if(pred); Parameters c – container from which to erase pred – predicate that determines which elements should…

std::experimental::erase_if(std::forward_list) – std::experimental::erase_if(std::forward_list) Synopsis Defined in header<experimental / forward_list> template <class T, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::forward_list<T, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container.Equivalent to c.remove_if(pred); Parameters c – container from which to erase pred – predicate that determines which elements should…

std::experimental::erase_if(std::deque) – std::experimental::erase_if(std::deque) Synopsis Defined in header<experimental / deque> template <class T, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::deque<T, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container.Equivalent to c.erase(std::remove_if(c.begin(), c.end(), pred), c.end()); Parameters c – container from which to erase pred – predicate that determines…

std::experimental::erase_if(std::basic_string) – std::experimental::erase_if(std::basic_string) Synopsis Defined in header<experimental / string> template <class CharT, class Traits, class Alloc, class Pred> (library fundamentals TS v2) void erase_if(std::basic_string<CharT, Traits, Alloc> &c, Pred pred); Erases all elements that satisfy the predicate pred from the container.Equivalent to c.erase(std::remove_if(c.begin(), c.end(), pred), c.end()); Parameters c – container from which to erase pred –…

std::experimental::erase(std::vector) – std::experimental::erase(std::vector) Synopsis Defined in header<experimental / vector> template <class T, class A, class U> (library fundamentals TS v2) void erase(std::vector<T, A> &c, const U &value); Erases all elements that compare equal to value from the container.Equivalent to c.erase(std::remove(c.begin(), c.end(), value), c.end()); Parameters c – container from which to erase value – value to…