Complex list management with an extremely versatile interface. Built-in sorting (with abstract variants), finding, iteration, and element manipulation. Supports const-interface elements. Transparent 'virtual array storage' (VAS) for large element types
Be the first to post a text review of CList C++ List Library. Rate and review a project by clicking thumbs up or thumbs down in the right column.
1.5.4 - *Release 1.5* [ 08 March 2009 ] This release contains a few additional functions and a fix to 'f_bind_convert_shadow'. 'clist' now has the 'keep_all_duplicated' and 'keep_only_duplicates' functions, plus functor counterparts for both. 'keep_all_duplicated' is similar to 'keep_only_duplicated', except all occurrences of the duplicate values are kept. In other words, all elements that aren't duplicated are removed. 'keep_only_duplicates' is the same as 'keep_all_duplicated', except the first occurrence of the duplicated values are removed, also. 'keep_only_duplicates' and 'remove_duplicates' called on separate copies of the same list should therefore contain exactly the same elements as the original list. The 'f_bind_convert_shadow' functor-binding function had differing signatures between the declaration and definition, which is now corrected.
1.5.4 - *Release 1.5* [ 08 March 2009 ] This release contains a few additional functions and a fix to 'f_bind_convert_shadow'. 'clist' now has the 'keep_all_duplicated' and 'keep_only_duplicates' functions, plus functor counterparts for both. 'keep_all_duplicated' is similar to 'keep_only_duplicated', except all occurrences of the duplicate values are kept. In other words, all elements that aren't duplicated are removed. 'keep_only_duplicates' is the same as 'keep_all_duplicated', except the first occurrence of the duplicated values are removed, also. 'keep_only_duplicates' and 'remove_duplicates' called on separate copies of the same list should therefore contain exactly the same elements as the original list. The 'f_bind_convert_shadow' functor-binding function had differing signatures between the declaration and definition, which is now corrected.
1.5.3 - *Release 1.5* [ 11 February 2009 ] This release contains a fix to the 'fe_find*' functions. Previously, they wouldn't take the current index into account and would therefore return the incorrect positional values if the index was non-zero.
1.5.3 - *Release 1.5* [ 11 February 2009 ] This release contains a fix to the 'fe_find*' functions. Previously, they wouldn't take the current index into account and would therefore return the incorrect positional values if the index was non-zero.
CList is a powerful C++ template library intended for complex list data manipulation. It features various unique capabilities such as: the ability to sort, find, and add data using functors; the ability to sort referencing external data (also reversible); and the ability to restrict element modification using a 'const' element-type modifier. This minor release of CList contains only one change. The change is to optimize preallocated lists when using Virtual Array Storage (VAS.) CList will preallocate all elements when setting a fixed maximum size for the list. Prior to this release, VAS lists would allocate the actual elements ahead of time. I've modified the implementation slightly so that only the element pointers are allocated ahead of time; the actual elements are allocated when they're added to the list and are deallocated when they're removed. This should improve performance, especially with large lists of large elements. The Resourcerver Project (http://resourcerver.sourceforge.net/) has had 8 releases since the last release of CList, all containing the most up-to-date version of CList. So far I haven't had a single failure or bug resulting from CList in that project (otherwise I'd have released an update!) Please let me know if you have any questions, comments, or suggestions regarding any of my projects. Thanks for taking an interest in my work! Kevin P. Barry
Be the first person to add a text review.
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
Thanks for your rating!
Would you also like to write a review?
Thanks for your review!
Get credit for your review by logging in via OpenID. Click your account provider: