- [OT] Re: std::wstring considered useless - 2 Updates
- segmented_array et al now on GitHub - 1 Update
- Onwards and upwards - 1 Update
- parameter passing in C++ - 1 Update
| "Öö Tiib" <ootiib@hot.ee>: Jan 18 03:12PM -0800 On Monday, 18 January 2016 23:09:07 UTC+2, Cholo Lennon wrote: > times after 2000). In advance of that "dead", I switched my developments > to WTL in 2003. In 2005 I changed my domain to multi platform server > programming. After that I've never touched MFC code again. MFC did look rather awful year 2000. Icons and toolbar buttons were 16 color. Result looked like 1994 app. If I remember correctly that lasted until 2008 when MFC was updated. Meanwhile some of MS own software did have colorful look. Most developers did therefore dump MFC and rare did ever look back. |
| JiiPee <no@notvalid.com>: Jan 18 11:29PM On 18/01/2016 21:08, Cholo Lennon wrote: > platform server programming. After that I've never touched MFC code > again. > Regards Well its the main way to make windows programs in VS2015 |
| Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk>: Jan 18 11:12PM All your favourite sausages can now be found on GitHub including segmented_array. https://github.com/FlibbleMr/neolib "A segmented_array is a container implemented as both a linked list and a red-black tree of fixed sized segments (vecarray arrays). Being a segmented array (as opposed to a normal flat array) its elements are not stored contiguously in memory but are contiguous within a segment. Compared to a std::vector or std::deque it performs considerably better at inserting/erasing elements at any point in the controlled sequence. Random access performs well being O(lg N) complexity so performs considerably better than std::list. push_back() and pop_back() are O(lg N) complexity. Single element insert() and erase(), push_front() and pop_front() are also O(lg N) complexity (an example which illustrates this). The performance of multiple element insert() and erase() is linear in the number of items inserted/erased." /Flibble |
| "Öö Tiib" <ootiib@hot.ee>: Jan 18 02:45PM -0800 On Monday, 18 January 2016 22:44:43 UTC+2, red floyd wrote: > Wind River VxWorks 6 could actually debug code at the UML level. > It was a pain in the ass, and you had to use their toolset, but > it was doable. First time I did see running diagrams was 1987 Soviet Union in one of cities that were called Sverdlovsk back then for conspiracy (it is now likely Yekaterinburg). Students in university there did a research project that involved making tools (like editors and debuggers) for a programming language whose code was diagrams. It worked and looked beautiful from afar or as printed out. Also they could round-trip translate it into Pascal and back. Now that Pascal code felt more compact and easier to follow than those diagrams. So I was sort of impressed that they did such a beautiful thing but wasn't impressed about usefulness of the result. I have seen similar things later again but like always ... first impression counts. ;) |
| Juha Nieminen <nospam@thanks.invalid>: Jan 18 10:04AM > ::std::string eval( ::std::vector< ::std::string >arguments ) > { ::std::string & head = arguments.at( 0 ); ... } Take containers by value only if you really need a deep copy of it, for whatever reason. If not, then take it by const reference. Only take it by non-const reference if the function is supposed to modify it. Taking it as an rvalue reference is a bit of a special case. Often you want to do it only if you are perfect-forwarding it to something that might take it by reference or by value, or if the function itself wants a copy of it, moving it if possible (as is the case eg. in move constructors and move assignment operators). --- news://freenews.netfront.net/ - complaints: news@netfront.net --- |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.lang.c+++unsubscribe@googlegroups.com. |
No comments:
Post a Comment