Digest for comp.lang.c++@googlegroups.com - 6 updates in 6 topics

comp.lang.c++@googlegroups.com

Google Groups

Topic digest
View all topics

• cmsg cancel <o1svav$ois$5@dont-email.me> - 1 Update
• Here is another solution in Object oriented programming - 1 Update
• Qucksort for Linked List - 1 Update
• Tutorial on threaded binary tree part 1: simple unthreaded tree - 1 Update
• Read again , i correct - 1 Update
• Here is how to implement pure functions of Haskel and Lisp in C++.. - 1 Update

cmsg cancel <o1svav$ois$5@dont-email.me>

bleachbot <bleachbot@httrack.com>: Dec 03 12:17AM +0100

Back to top

Here is another solution in Object oriented programming

Ramine <ramine@1.1>: Dec 02 06:17PM -0500 Hello.............   Here is another solution in Object oriented programming:   You can make all the objects type and datastructures etc. objects and wrap those objects with a scalable reader writer lock and use those objects as properties. This will reduce by much the risk of race conditions. So no need for pure functions and Mvars of Haskel or Lisp.     Thank you, Amine Moulay Ramdane.

Back to top

Qucksort for Linked List

xerofoify <xerofoify@gmail.com>: Dec 02 02:53PM -0800 No there isn't. They should how to create a linked list not quicksort by swapping nodes. Here's the complete question how do I get this to work for when I have iterators not to invalidate the data by swapping the nodes in order to implement quicksort by swapping nodes data. There are no examples online or in any textbook I can find. I am looking for actual code not pseduo code.

Back to top

Tutorial on threaded binary tree part 1: simple unthreaded tree

Ian Collins <ian-news@hotmail.com>: Dec 03 11:52AM +1300 On 12/ 3/16 11:49 AM, ruben safir wrote: >>> no, actually   >> How so?   > it is undefined on the order of evaluation   What is?   -- Ian

Back to top

Read again , i correct

Ramine <ramine@1.1>: Dec 02 04:09PM -0500 Hello..........   Here is how to implement pure functions of Haskel and Lisp in C++..   First you have to call a constructor that will put the global variables as pointers for example in there respective queues..   And after that each method that wants to access a global variable will take the global variable from the queue and copy it in a local variable and work with it locally, and after that it will put it back in its global queue , it's like message passing and it's like pure functions with Mvars in Haskel and this mechanism is good and will avoid race conditions in Object oriented programming.     For Deadlocks use this:   Use Lock Hierarchies to Avoid Deadlock   http://www.drdobbs.com/parallel/use-lock-hierarchies-to-avoid-deadlock/204801163     Thank you, Amine Moulay Ramdane.

Back to top

Here is how to implement pure functions of Haskel and Lisp in C++..

Ramine <ramine@1.1>: Dec 02 04:04PM -0500 Hello..........   Here is how to implement pure functions of Haskel and Lisp in C++..   Firt you have to call a constructor that will put the global variables as pointers for example in there respective queues..   And after that each method that wants to access a global variable will take the global variable from the queue and copy it in a local variable and work with it locally, and after that it will put it back in its global queue , it's like message passing and it's like pure functions with Mvars in Haskel and this mechanism is good and will avoid race conditions in Object oriented programming.     For Deadlocks use this:   Use Lock Hierarchies to Avoid Deadlock   http://www.drdobbs.com/parallel/use-lock-hierarchies-to-avoid-deadlock/204801163     Thank you, Amine Moulay Ramdane.

Back to top

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.