X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/7d28d93b90eedd2a49da8b9b990296669e46d05c..992c3a8621f205aedc022a0d5a5d3fc7bb75e6a1:/include/xbt/functional.hpp diff --git a/include/xbt/functional.hpp b/include/xbt/functional.hpp index b8695631a1..9509d49aa8 100644 --- a/include/xbt/functional.hpp +++ b/include/xbt/functional.hpp @@ -1,4 +1,4 @@ -/* Copyright (c) 2015-2020. The SimGrid Team. All rights reserved. */ +/* Copyright (c) 2015-2022. The SimGrid Team. All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it * under the terms of the license (GNU LGPL) which comes with this package. */ @@ -37,11 +37,10 @@ public: } void operator()() const { - const int argc = args_->size(); std::vector args = *args_; std::vector argv(args.size() + 1); // argv[argc] is nullptr std::transform(begin(args), end(args), begin(argv), [](std::string& s) { return &s.front(); }); - code_(argc, argv.data()); + code_(static_cast(args.size()), argv.data()); } }; @@ -77,11 +76,10 @@ constexpr auto apply(F&& f, Tuple&& t, std::index_sequence) template constexpr auto apply(F&& f, Tuple&& t) -> decltype( simgrid::xbt::bits::apply(std::forward(f), std::forward(t), - std::make_index_sequence::type>::value>())) + std::make_index_sequence>::value>())) { - return simgrid::xbt::bits::apply( - std::forward(f), std::forward(t), - std::make_index_sequence::type>::value>()); + return simgrid::xbt::bits::apply(std::forward(f), std::forward(t), + std::make_index_sequence>::value>()); } template class Task; @@ -99,8 +97,8 @@ class Task { struct whatever {}; // Union used for storage: - using TaskUnion = typename std::aligned_union<0, void*, std::pair, - std::pair>::type; + using TaskUnion = + typename std::aligned_union_t<0, void*, std::pair, std::pair>; // Is F suitable for small buffer optimization? template @@ -127,7 +125,7 @@ class Task { move_function move; }; - TaskUnion buffer_; + TaskUnion buffer_ = {}; const TaskVtable* vtable_ = nullptr; void clear() @@ -151,7 +149,7 @@ public: if (that.vtable_ && that.vtable_->move) that.vtable_->move(buffer_, that.buffer_); else - std::memcpy(static_cast(&buffer_), static_cast(&that.buffer_), sizeof(buffer_)); + std::memcpy(&buffer_, &that.buffer_, sizeof(buffer_)); vtable_ = std::move(that.vtable_); that.vtable_ = nullptr; } @@ -162,16 +160,14 @@ public: if (that.vtable_ && that.vtable_->move) that.vtable_->move(buffer_, that.buffer_); else - std::memcpy(static_cast(&buffer_), static_cast(&that.buffer_), sizeof(buffer_)); + std::memcpy(&buffer_, &that.buffer_, sizeof(buffer_)); vtable_ = std::move(that.vtable_); that.vtable_ = nullptr; return *this; } private: - template - typename std::enable_if()>::type - init(F code) + template typename std::enable_if_t()> init(F task_code) { const static TaskVtable vtable { // Call: @@ -197,11 +193,11 @@ private: src_code->~F(); } }; - new(&buffer_) F(std::move(code)); + new (&buffer_) F(std::move(task_code)); vtable_ = &vtable; } - template typename std::enable_if()>::type init(F code) + template typename std::enable_if_t()> init(F task_code) { const static TaskVtable vtable { // Call: @@ -219,7 +215,7 @@ private: // Move: nullptr }; - *reinterpret_cast(&buffer_) = new F(std::move(code)); + *reinterpret_cast(&buffer_) = new F(std::move(task_code)); vtable_ = &vtable; }