Container tracking app by adm0001 Streamline your logistics operations with a container tracking application. Track the movement of your shipments in real time, ensuring transparency and efficiency throughout the supply chain. Get instant updates on container status, location, and estimated arrival times. Simplify the management of your cargo and enhance collaboration with shipping partners, empowering you to stay ahead in the global marketplace. This is a real-time and live feeding direct to your workstation computers, laptops, or even you mobile devices. Once it is activated, will work as an alarm signal if the infrastructure is compromised, works a camera too, and real-time feeding as well. Anything out the normality, you receive an alert and your track feeding, and footage. The vessels admins will be informed on the emergency too. There is in fact a significant difference for the vector without pre allocation, that is 20% faster than with the previous version. Indeed, since it knows that the operation cannot throw it can use a faster path for reallocation and still guarantees its exception safety. Overall, for insertions, the vector and deque are the fastest for small types and the list is the fastest for the very large types. colony offers a medium performance on this benchmark but is quite stable for different data types. When you know the size of the collection, you should always use reserve() on vectors. Moreover, if you can use noexcept operations, you should always do it since it can significantly speedup the vector performance. Empace: The next operation is very similar to the first except that we use emplace insertions instead of pushes. As expected, there is no difference between push_back and emplace_back for trivial types. The preallocated vector is the fastest container, followed by the deque and then significantly slower are the colony and vector without preallocation. However, here is a very large difference between the push version and the emplace version. Indeed, it is much slower. This may seem hard to believe that emplace is slower than normal insert since it should be at least as fast, and generally faster. This in fact due to the version of GCC that is still using Copy-On-Write for string. Therefore, the previous version was much faster because the copies were not done since the string was not modified and this saved a lot of time in that case. However, this is an artificial case since a collection filled of all the same string is not highly likely in practice. Generally, I think it's better to use Small-StringOptimization than Copy-On-Write and now COW is not allowed by the standard anymore in C+ +11. Overall, for the tested types, emplace should have exactly the same performance as normal
push_back. Except for the special case of COW for GCC that should not happen anymore if you use a recent compiler and C++11. Fill front The next benchmark is again a fill benchmark but elements are inserted at the front of the container. Since colony is unordered, it's removed from the benchmark. This benchmark is mostly used because this is the worst case for vector.
The app and device can be added anywhere the owner of the goodies desired, inside or outside the container
Early stages of development, but it will continuing sending signal and footage even if sinks.
// Copyright (c) 2019 // Distributed under adm0001 // (See accompanying file LICENSE r4c =======================================================================
#include <random> #include <array> #include <vector> #include <list> #include <algorithm> #include <deque> #include <thread> #include <iostream> #include <cstdint> #include <typeinfo> #include <memory> #include <set> #include <unordered_set> #include "plf_timsort.h" #include "plf_colony.h" #include "bench.hpp" #include "policies.hpp" namespace { template<typename T> constexpr bool is_trivial_of_size(std::size_t size){ return std::is_trivial<T>::value && sizeof(T) == size; } template<typename T> constexpr bool is_non_trivial_of_size(std::size_t size){ return !std::is_trivial<T>::value && sizeof(T) == size && std::is_copy_constructible<T>::value && std::is_copy_assignable<T>::value && std::is_move_constructible<T>::value && std::is_move_assignable<T>::value; } template<typename T>
template<typename T> constexpr bool is_non_trivial_nothrow_movable(){ return !std::is_trivial<T>::value && std::is_nothrow_move_constructible<T>::value && std::is_nothrow_move_assignable<T>::value; } template<typename T> constexpr bool is_non_trivial_non_nothrow_movable(){ return !std::is_trivial<T>::value && std::is_move_constructible<T>::value && std::is_move_assignable<T>::value && !std::is_nothrow_move_constructible<T>::value && !std::is_nothrow_move_assignable<T>::value; } template<typename T> constexpr bool is_non_trivial_non_movable(){ return !std::is_trivial<T>::value && std::is_copy_constructible<T>::value && std::is_copy_assignable<T>::value && !std::is_move_constructible<T>::value && !std::is_move_assignable<T>::value; } template<typename T> constexpr bool is_small(){ return sizeof(T) <= sizeof(std::size_t); } } //end of anonymous namespace // tested types // trivial type with parametrized size
// trivial type with parametrized size template<int N> struct Trivial { std::size_t a; std::array<unsigned char, N-sizeof(a)> b; bool operator<(const Trivial &other) const { return a < other.a; } }; template<> struct Trivial<sizeof(std::size_t)> { std::size_t a; bool operator<(const Trivial &other) const { return a < other.a; } }; // non trivial, quite expensive to copy but easy to move (noexcept not set) class NonTrivialStringMovable { private: std::string data{"some pretty long string to make sure it is not optimized with SSO"}; public: std::size_t a{0}; NonTrivialStringMovable() = default; NonTrivialStringMovable(std::size_t a): a(a) {} ~NonTrivialStringMovable() = default; bool operator<(const NonTrivialStringMovable &other) const { return a < other.a; } }; // non trivial, quite expensive to copy but easy to move (with noexcept) class NonTrivialStringMovableNoExcept { private: std::string data{"some pretty long string to make sure it is not optimized with SSO"}; public: std::size_t a{0}; NonTrivialStringMovableNoExcept() = default; NonTrivialStringMovableNoExcept(std::size_t a): a(a) {} NonTrivialStringMovableNoExcept(const NonTrivialStringMovableNoExcept &) = default; NonTrivialStringMovableNoExcept(NonTrivialStringMovableNoExcept &&) noexcept = default;
default; ~NonTrivialStringMovableNoExcept() = default; NonTrivialStringMovableNoExcept &operator=(const NonTrivialStringMovableNoExcept &) = default; NonTrivialStringMovableNoExcept &operator=(NonTrivialStringMovableNoExcept &&other) noexcept { std::swap(data, other.data); std::swap(a, other.a); return *this; } bool operator<(const NonTrivialStringMovableNoExcept &other) const { return a < other.a; } }; // non trivial, quite expensive to copy and move template<int N> class NonTrivialArray { public: std::size_t a = 0; private: std::array<unsigned char, N-sizeof(a)> b; public: NonTrivialArray() = default; NonTrivialArray(std::size_t a): a(a) {} ~NonTrivialArray() = default; bool operator<(const NonTrivialArray &other) const { return a < other.a; } }; // type definitions for testing and invariants check using TrivialSmall = Trivial<8>;
static_assert(is_trivial_of_size<TrivialSmall>(8),
"Invalid type"); using TrivialMedium = Trivial<32>;
static_assert(is_trivial_of_size<TrivialMedium>(32),
"Invalid type"); using TrivialLarge = Trivial<128>;
static_assert(is_trivial_of_size<TrivialLarge>(128),
"Invalid type"); using TrivialHuge
= Trivial<1024>;
static_assert(is_trivial_of_size<TrivialHuge>(1024),
"Invalid type"); using TrivialMonster = Trivial<4*1024>;
static_assert(is_trivial_of_size<TrivialMonster>(4*1024), "Invalid type"); static_assert(is_non_trivial_nothrow_movable<NonTrivialStringMovableNoExcept>(), "Invalid type"); static_assert(is_non_trivial_non_nothrow_movable<NonTrivialStringMovable>(), "Invalid type"); using NonTrivialArrayMedium = NonTrivialArray<32>; static_assert(is_non_trivial_of_size<NonTrivialArrayMedium>(32), "Invalid type"); // Define all benchmarks template<typename T> struct bench_fill_back { static void run(){ new_graph<T>("fill_back", "us"); auto sizes = { 100000, 200000, 300000, 400000, 500000, 600000, 700000, 800000, 900000, 1000000 }; bench<std::vector<T>, microseconds, Empty, FillBack>("vector", sizes); bench<std::list<T>, microseconds, Empty, FillBack>("list", sizes); bench<std::deque<T>, microseconds, Empty, FillBack>("deque", sizes); bench<std::vector<T>, microseconds, Empty, ReserveSize, FillBack>("vector_reserve", sizes); bench<plf::colony<T>, microseconds, Empty, InsertSimple>("colony", sizes); bench<plf::colony<T>, microseconds, Empty, ReserveSize, InsertSimple>("colony_reserve", sizes); bench<plf::colony<T,std::allocator<T>, unsigned int>, microseconds, Empty, InsertSimple>("colony", sizes); bench<plf::colony<T,std::allocator<T>, unsigned int>, microseconds, Empty, ReserveSize, InsertSimple>("colony_reserve", sizes); } }; template<typename T>
struct bench_emplace_back { static void run(){ new_graph<T>("emplace_back", "us"); auto sizes = { 100000, 200000, 300000, 400000, 500000, 600000, 700000, 800000, 900000, 1000000 }; bench<std::vector<T>, microseconds, Empty, EmplaceBack>("vector", sizes); bench<std::list<T>, microseconds, Empty, EmplaceBack>("list", sizes); bench<std::deque<T>, microseconds, Empty, EmplaceBack>("deque", sizes); bench<plf::colony<T>, microseconds, Empty, EmplaceInsertSimple>("colony", sizes); bench<std::vector<T>, microseconds, Empty, ReserveSize, EmplaceBack>("vector_reserve", sizes); bench<plf::colony<T>, microseconds, Empty, ReserveSize, EmplaceInsertSimple>("colony_reserve", sizes); } }; template<typename T> struct bench_fill_front { static void run(){ new_graph<T>("fill_front", "us"); auto sizes = { 10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000 }; // it is too slow with bigger data types if(is_small<T>()){ bench<std::vector<T>, microseconds, Empty, FillFront>("vector", sizes); } bench<std::list<T>, microseconds, Empty, FillFront>("list", sizes); bench<std::deque<T>, microseconds, Empty, FillFront>("deque", sizes); // colony is unordered } }; template<typename T> struct bench_emplace_front {
static void run(){ new_graph<T>("emplace_front", "us"); auto sizes = { 10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000 }; // it is too slow with bigger data types if(is_small<T>()){ bench<std::vector<T>, microseconds, Empty, EmplaceFront>("vector", sizes); } bench<std::list<T>, microseconds, Empty, EmplaceFront>("list", sizes); bench<std::deque<T>, microseconds, Empty, EmplaceFront>("deque", sizes); // colony is unordered } }; template<typename T> struct bench_linear_search { static void run(){ new_graph<T>("linear_search", "us"); auto sizes = {1000, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000, 10000}; bench<std::vector<T>, microseconds, FilledRandom, Find>("vector", sizes); bench<std::list<T>, microseconds, FilledRandom, Find>("list", sizes); bench<std::deque<T>, microseconds, FilledRandom, Find>("deque", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, Find>("colony", sizes); } }; template<typename T> struct bench_random_insert { static void run(){ new_graph<T>("random_insert", "ms"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000}; bench<std::vector<T>, milliseconds, FilledRandom, Insert>("vector", sizes);
bench<std::list<T>, milliseconds, FilledRandom, Insert>("list", sizes); bench<std::deque<T>, milliseconds, FilledRandom, Insert>("deque", sizes); // colony is unordered } }; template<typename T> struct bench_random_remove { static void run(){ new_graph<T>("random_remove", "us"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000}; bench<std::vector<T>, microseconds, FilledRandom, Erase>("vector", sizes); bench<std::list<T>, microseconds, FilledRandom, Erase>("list", sizes); bench<std::deque<T>, microseconds, FilledRandom, Erase>("deque", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, Erase>("colony", sizes); bench<std::vector<T>, microseconds, FilledRandom, RemoveErase>("vector_rem", sizes); bench<std::list<T>, microseconds, FilledRandom, RemoveErase>("list_rem", sizes); bench<std::deque<T>, microseconds, FilledRandom, RemoveErase>("deque_rem", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, RemoveErase>("colony_rem", sizes); } }; template<typename T> struct bench_sort { static void run(){ new_graph<T>("sort", "ms"); auto sizes = {100000, 200000, 300000, 400000, 500000, 600000, 700000, 800000, 900000, 1000000}; bench<std::vector<T>, milliseconds, FilledRandom, Sort>("vector", sizes); bench<std::list<T>, milliseconds, FilledRandom, Sort>("list", sizes); bench<std::deque<T>, milliseconds, FilledRandom, Sort>("deque", sizes); bench<plf::colony<T>, milliseconds, FilledRandomInsert, Sort>("colony", sizes); bench<plf::colony<T>, milliseconds, FilledRandomInsert, TimSort>("colony_timsort",
sizes); } }; template<typename T> struct bench_destruction { static void run(){ new_graph<T>("destruction", "us"); auto sizes = {100000, 200000, 300000, 400000, 500000, 600000, 700000, 800000, 900000, 1000000}; bench<std::vector<T>, microseconds, SmartFilled, SmartDelete>("vector", sizes); bench<std::list<T>, microseconds, SmartFilled, SmartDelete>("list", sizes); bench<std::deque<T>, microseconds, SmartFilled, SmartDelete>("deque", sizes); bench<plf::colony<T>, microseconds, SmartFilled, SmartDelete>("colony", sizes); } }; template<typename T> struct bench_number_crunching { static void run(){ new_graph<T>("number_crunching", "ms"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000}; bench<std::vector<T>, milliseconds, Empty, RandomSortedInsert>("vector", sizes); bench<std::list<T>, milliseconds, Empty, RandomSortedInsert>("list", sizes); bench<std::deque<T>, milliseconds, Empty, RandomSortedInsert>("deque", sizes); // colony is unordered } }; template<typename T> struct bench_erase_1 { static void run(){ new_graph<T>("erase1", "us"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000,
100000}; bench<std::vector<T>, microseconds, FilledRandom, RandomErase1>("vector", sizes); bench<std::list<T>, microseconds, FilledRandom, RandomErase1>("list", sizes); bench<std::deque<T>, microseconds, FilledRandom, RandomErase1>("deque", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, RandomErase1>("colony", sizes); } }; template<typename T> struct bench_erase_10 { static void run(){ new_graph<T>("erase10", "us"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000}; bench<std::vector<T>, microseconds, FilledRandom, RandomErase10>("vector", sizes); bench<std::list<T>, microseconds, FilledRandom, RandomErase10>("list", sizes); bench<std::deque<T>, microseconds, FilledRandom, RandomErase10>("deque", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, RandomErase10>("colony", sizes); } }; template<typename T> struct bench_erase_25 { static void run(){ new_graph<T>("erase25", "us"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000}; bench<std::vector<T>, microseconds, FilledRandom, RandomErase25>("vector", sizes); bench<std::list<T>, microseconds, FilledRandom, RandomErase25>("list", sizes); bench<std::deque<T>, microseconds, FilledRandom, RandomErase25>("deque", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, RandomErase25>("colony", sizes); } };
template<typename T> struct bench_erase_50 { static void run(){ new_graph<T>("erase50", "us"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000}; bench<std::vector<T>, microseconds, FilledRandom, RandomErase50>("vector", sizes); bench<std::list<T>, microseconds, FilledRandom, RandomErase50>("list", sizes); bench<std::deque<T>, microseconds, FilledRandom, RandomErase50>("deque", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, RandomErase50>("colony", sizes); } }; template<typename T> struct bench_traversal { static void run(){ new_graph<T>("traversal", "us"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000}; bench<std::vector<T>, microseconds, FilledRandom, Iterate>("vector", sizes); bench<std::list<T>, microseconds, FilledRandom, Iterate>("list", sizes); bench<std::deque<T>, microseconds, FilledRandom, Iterate>("deque", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, Iterate>("colony", sizes); } }; template<typename T> struct bench_write { static void run(){ new_graph<T>("write", "us"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000}; bench<std::vector<T>, microseconds, FilledRandom, Write>("vector", sizes);
bench<std::list<T>, microseconds, FilledRandom, Write>("list", sizes); bench<std::deque<T>, microseconds, FilledRandom, Write>("deque", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, Write>("colony", sizes); } }; template<typename T> struct bench_find { static void run(){ new_graph<T>("find", "us"); auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000}; bench<std::vector<T>, microseconds, FilledRandom, Find>("vector", sizes); bench<std::list<T>, microseconds, FilledRandom, Find>("list", sizes); bench<std::deque<T>, microseconds, FilledRandom, Find>("deque", sizes); bench<plf::colony<T>, microseconds, FilledRandomInsert, Find>("colony", sizes); } }; //Launch the benchmark template<typename ...Types> void bench_all(){ bench_types<bench_fill_back,
Types...>();
bench_types<bench_emplace_back, bench_types<bench_fill_front,
Types...>();
Types...>();
bench_types<bench_emplace_front,
Types...>();
bench_types<bench_linear_search,
Types...>();
bench_types<bench_write,
Types...>();
bench_types<bench_random_insert,
Types...>();
bench_types<bench_random_remove, bench_types<bench_sort,
Types...>();
Types...>();
bench_types<bench_destruction,
Types...>();
bench_types<bench_erase_1,
Types...>();
bench_types<bench_erase_10,
Types...>();
bench_types<bench_erase_25,
Types...>();
bench_types<bench_erase_50,
Types...>();
// The following are really slow so run only for limited set of data bench_types<bench_find,
TrivialSmall, TrivialMedium, TrivialLarge>();
bench_types<bench_number_crunching, TrivialSmall, TrivialMedium>(); } int main(){ //Launch all the graphs bench_all, NonTrivialArray<32> >(); //Generate the graphs/adm0001<return 0;