{"id":1048,"date":"2011-01-21T15:47:16","date_gmt":"2011-01-21T20:47:16","guid":{"rendered":"http:\/\/bitpost.com\/news\/?p=1048"},"modified":"2022-08-26T14:04:38","modified_gmt":"2022-08-26T18:04:38","slug":"cross-platform-c-sorted_vector-derived-from-stdvector","status":"publish","type":"post","link":"https:\/\/bitpost.com\/news\/2011\/cross-platform-c-sorted_vector-derived-from-stdvector\/","title":{"rendered":"Cross-platform C++ sorted_vector derived from std::vector"},"content":{"rendered":"

Here<\/a> is my published reusable c++ code, which includes a version of a sorted vector that I’ve been using for years. It may not be academically sterile C++, I’m more interested in getting things done, and I had to crank out some new functionality needed for my upcoming media manager. But it should be solid production code. It glues together std::vector with std::sort, std::lower_bound, etc., which is a pretty fscking logical thing to do – who wants to redo that every time you have data to manage? :> My favorite part is the find_it_or_fail() function, the only real extension of functionality. Basically, it extends lower_bound() in a logical way, so you either get a hit, or failure (indicated by returning vector::end()). There are also versions of member functions with predicate function parameters, to help you use it with vectors of object pointers, which isn’t exactly straightforward in C++. Let me know if it seems useful or sucky. :><\/p>\n

Reusable STLContainers code<\/a><\/center>
<\/center>
old wiki copy of sorted_vector<\/a><\/center><\/p>\n","protected":false},"excerpt":{"rendered":"

Here is my published reusable c++ code, which includes a version of a sorted vector that I’ve been using for years. It may not be academically sterile C++, I’m more interested in getting things done, and I had to crank out some new functionality needed for my upcoming media manager. But it should be solid […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[22],"tags":[31,29,30],"class_list":["post-1048","post","type-post","status-publish","format-standard","hentry","category-cpp","tag-data-structures","tag-sorted_vector","tag-stl"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t