Newsgroup: comp.lang.c++
Subject: Brand new C++ container released
From: Mr Flibble <flibbleREMOVE_THIS_AND_THIS@...>
Date: Wed, 05 Mar 2014 00:41:37 +0000
A brand new C++ container called "segmented_array" has been released
which offers fast insert/erase anywhere in a controlled sequence:
http://ift.tt/1f4Vl3V
It performs better than its closest competition (avl_array).
Example timings:
std::vector random erase: 17.1273 seconds
std::deque random erase: 17.6862 seconds
std::list random erase: 24.1854 seconds
mkr::avl_array random erase: 0.1263 seconds
neolib::segmented_array (1) random erase: 0.3113 seconds
neolib::segmented_array (2) random erase: 0.1370 seconds
neolib::segmented_array (3) random erase: 0.1206 seconds
neolib::segmented_array (4) random erase: 0.1198 seconds
std::vector random insert: 73.9902 seconds
std::deque random insert: 25.0955 seconds
std::list random insert: 52.6922 seconds
mkr::avl_array random insert: 0.1513 seconds
neolib::segmented_array (1) random insert: 0.2608 seconds
neolib::segmented_array (2) random insert: 0.1170 seconds
neolib::segmented_array (3) random insert: 0.1158 seconds
neolib::segmented_array (4) random insert: 0.1636 seconds
std::vector random access: 0.0055 seconds
std::deque random access: 0.0095 seconds
std::list random access: 60.9293 seconds
mkr::avl_array random access: 0.0850 seconds
neolib::segmented_array (1) random access: 0.1100 seconds
neolib::segmented_array (2) random access: 0.0470 seconds
neolib::segmented_array (3) random access: 0.0352 seconds
neolib::segmented_array (4) random access: 0.0278 seconds
std::vector sequential access: 0.0019 seconds
std::deque sequential access: 0.0026 seconds
std::list sequential access: 0.0133 seconds
mkr::avl_array sequential access: 0.0138 seconds
neolib::segmented_array (1) sequential access: 0.0180 seconds
neolib::segmented_array (2) sequential access: 0.0032 seconds
neolib::segmented_array (3) sequential access: 0.0028 seconds
neolib::segmented_array (4) sequential access: 0.0027 seconds
std::vector sort: 0.0242 seconds
std::deque sort: 0.0491 seconds
std::list sort: 0.0980 seconds
mkr::avl_array sort: 0.7306 seconds
neolib::segmented_array (1) sort: 0.6190 seconds
neolib::segmented_array (2) sort: 0.0579 seconds
neolib::segmented_array (3) sort: 0.0494 seconds
neolib::segmented_array (4) sort: 0.0452 seconds
/Flibble
Subject: Brand new C++ container released
From: Mr Flibble <flibbleREMOVE_THIS_AND_THIS@...>
Date: Wed, 05 Mar 2014 00:41:37 +0000
A brand new C++ container called "segmented_array" has been released
which offers fast insert/erase anywhere in a controlled sequence:
http://ift.tt/1f4Vl3V
It performs better than its closest competition (avl_array).
Example timings:
std::vector random erase: 17.1273 seconds
std::deque random erase: 17.6862 seconds
std::list random erase: 24.1854 seconds
mkr::avl_array random erase: 0.1263 seconds
neolib::segmented_array (1) random erase: 0.3113 seconds
neolib::segmented_array (2) random erase: 0.1370 seconds
neolib::segmented_array (3) random erase: 0.1206 seconds
neolib::segmented_array (4) random erase: 0.1198 seconds
std::vector random insert: 73.9902 seconds
std::deque random insert: 25.0955 seconds
std::list random insert: 52.6922 seconds
mkr::avl_array random insert: 0.1513 seconds
neolib::segmented_array (1) random insert: 0.2608 seconds
neolib::segmented_array (2) random insert: 0.1170 seconds
neolib::segmented_array (3) random insert: 0.1158 seconds
neolib::segmented_array (4) random insert: 0.1636 seconds
std::vector random access: 0.0055 seconds
std::deque random access: 0.0095 seconds
std::list random access: 60.9293 seconds
mkr::avl_array random access: 0.0850 seconds
neolib::segmented_array (1) random access: 0.1100 seconds
neolib::segmented_array (2) random access: 0.0470 seconds
neolib::segmented_array (3) random access: 0.0352 seconds
neolib::segmented_array (4) random access: 0.0278 seconds
std::vector sequential access: 0.0019 seconds
std::deque sequential access: 0.0026 seconds
std::list sequential access: 0.0133 seconds
mkr::avl_array sequential access: 0.0138 seconds
neolib::segmented_array (1) sequential access: 0.0180 seconds
neolib::segmented_array (2) sequential access: 0.0032 seconds
neolib::segmented_array (3) sequential access: 0.0028 seconds
neolib::segmented_array (4) sequential access: 0.0027 seconds
std::vector sort: 0.0242 seconds
std::deque sort: 0.0491 seconds
std::list sort: 0.0980 seconds
mkr::avl_array sort: 0.7306 seconds
neolib::segmented_array (1) sort: 0.6190 seconds
neolib::segmented_array (2) sort: 0.0579 seconds
neolib::segmented_array (3) sort: 0.0494 seconds
neolib::segmented_array (4) sort: 0.0452 seconds
/Flibble
via Usenet Forums - Usenet Search,Free Usenet - comp.lang.c++ http://ift.tt/1hICWiq
View all the progranning help forums at:
http://ift.tt/1dP9txN
No comments:
Post a Comment