Friday, December 2, 2016

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

legalize+jeeves@mail.xmission.com (Richard): Dec 02 10:06PM

[Please do not mail me a copy of your followup]
 
"Alf P. Steinbach" <alf.p.steinbach+usenet@gmail.com> spake the secret code
 
>[...] And also, to introduce the syntax to more people. :)
 
Yes. Gratuitous use of new syntax.
--
"The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline>
The Terminals Wiki <http://terminals-wiki.org>
The Computer Graphics Museum <http://computergraphicsmuseum.org>
Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>
ruben safir <ruben@mrbrklyn.com>: Dec 02 05:39PM -0500

On 12/01/2016 03:23 PM, Mr Flibble wrote:
>> [/code]
 
> Without balancing your tree is as good as useless; your post was totally
> pointless.
 
not true
ruben safir <ruben@mrbrklyn.com>: Dec 02 05:45PM -0500

On 12/01/2016 04:34 PM, Richard wrote:
> It's why we write ++i instead of i = i + 1 and if (predicate) instead
> of if (predicate == true). In both cases, the former is simpler and
> expresses the exact same semantics.
 
no, actually
Ian Collins <ian-news@hotmail.com>: Dec 03 11:48AM +1300

On 12/ 3/16 11:45 AM, ruben safir wrote:
>> of if (predicate == true). In both cases, the former is simpler and
>> expresses the exact same semantics.
 
> no, actually
 
How so?
 
--
Ian
ruben safir <ruben@mrbrklyn.com>: Dec 02 05:49PM -0500

On 12/02/2016 05:48 PM, Ian Collins wrote:
>> no, actually
 
> How so?
 
 
it is undefined on the order of evaluation
Melzzzzz <mel@zzzzz.com>: Dec 02 10:09PM +0100

On Fri, 2 Dec 2016 19:17:08 +0000
 
> AFAIK quicksort will not work with linked lists; try merge sort
> instead.
 
Quick sort will work with linked lists alright if swap is value based.
Anyway I have found that algorithms that change order of linked list
nodes are bad for cache efficiency on x86.
Surprisingly quick sort that uses just bidirectional iterator is quite
efficient on x86. So that it is much faster then std libs merge sort.
 
 
 
 
--
press any key to continue or any other to quit
Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk>: Dec 02 09:26PM

On 02/12/2016 21:09, Melzzzzz wrote:
> nodes are bad for cache efficiency on x86.
> Surprisingly quick sort that uses just bidirectional iterator is quite
> efficient on x86. So that it is much faster then std libs merge sort.
 
O(n) is never "quite efficient".
 
/Flibble
Melzzzzz <mel@zzzzz.com>: Dec 02 10:37PM +0100

On Fri, 2 Dec 2016 21:26:46 +0000
> > merge sort.
 
> O(n) is never "quite efficient".
 
> /Flibble
 
Try it out. It is not that bad at all is you go from beginning from one
side and from end of array on the other side. Surprisingly finding out
pivot is not slow at all if list nodes are successive.
 
 
--
press any key to continue or any other to quit
Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk>: Dec 02 09:41PM

On 02/12/2016 21:37, Melzzzzz wrote:
 
> Try it out. It is not that bad at all is you go from beginning from one
> side and from end of array on the other side. Surprisingly finding out
> pivot is not slow at all if list nodes are successive.
 
I am sure what you are saying is fine if n is small however n isn't
always small.
 
/Flibble
xerofoify <xerofoify@gmail.com>: Dec 02 01:47PM -0800

On Friday, December 2, 2016 at 1:14:46 PM UTC-5, xerofoify wrote:
> 181 qSortrecursive(p->next_, h);
> 182 }
> 183 }
 
I am wondering how to write quicksort by swapping the Nodes themselves not the data. So was wondering how to do that and make the above quicksort work.
ruben safir <ruben@mrbrklyn.com>: Dec 02 05:38PM -0500

On 12/02/2016 04:47 PM, xerofoify wrote:
> I am wondering how to write quicksort by swapping the Nodes themselves not the data. So was wondering how to do that and make the above quicksort work.
 
 
that is standard in every text book. Go look
bleachbot <bleachbot@httrack.com>: Dec 02 09:03PM +0100

bleachbot <bleachbot@httrack.com>: Dec 02 10:04PM +0100

bleachbot <bleachbot@httrack.com>: Dec 02 10:09PM +0100

bleachbot <bleachbot@httrack.com>: Dec 02 10:29PM +0100

bleachbot <bleachbot@httrack.com>: Dec 02 11:00PM +0100

udpbot <bleachbot@httrack.com>: Dec 02 11:07PM +0100

bleachbot <bleachbot@httrack.com>: Dec 02 11:08PM +0100

Ramine <ramine@1.1>: Dec 02 05:08PM -0500

Hello,
 
About my previous enhancement to C++
 
If you say to me that pure functions of Lisp and Haskel are pure
functions , but with my previous implementation you still can
by error forget to put your global variables that is
shared by threads in the properties that can not be accessed
by the object or in there respective global queues, i will say that
my implementation easy the job for us, because defining what is shared
and putting it in the properties that can not be accessed from the
object is easy and is as easy as making an error on sequential
programming, so in my opinion this level of security can be tolerated in
Object oriented programming without using Functional programming, other
than that we also have Transactional memory that is composable and easy
to use to solve our parallel programming problems in Object oriented
programming.
 
 
Thank you,
Amine Moulay Ramdane.
RELIABLE VENDOR <no_email@invalid.invalid>: Dec 02 10:07PM

CLASSIC VENDOR WITH UNTRACEABLE SHIPPING AND PACKAGING METHOD. PAINKILLERS
AVAILABLE FOR SALE, ALONG SIDE MEDICAL MARIJUANA FOR DEPRESSION, CANCER,
CHRONIC PAIN, INSOMNIA ETC.
 
You can get a hold of me through email, text or call:
Email: topcaliberstocks@protonmail.com OR
Tel = Call/Text: +1(469) 249 2518
 
I am glad you are taking your time to go through my listing, and you should
be glad you did because you clicked on the right vendor, and you should be
rest assured that all your medical, pain, anxiety and addiction problems
will be taking care of without you stressing a muscle.
 
I will not try had to tell you what I am or what am not, instead, I will
put few names of the NUMEROUS medications I have below, and if you don't
see what you need please, contact me still with the name of the medication
you need and I will get back to you with every details you need.
 
#ayurvedic urea in powder
#Lemon Quaaludes 714
#Etaqualone powder Etaqualone pills
#Xanax 1 mg Upjohn footbals
#XANAX 1 mg (blue Ksalol)
#Xanax SR 2 mg (brand Upjohn)
# Xanax 2 mg (Pfizer LongBars)
#Valium 10 mg Bensedine
#AMBIEN (Zolpidem, Stilnox)
#Lorazepam 2.5 mg (Ativan)
#Clonazepam 2 mg (Rivotril)
#Nitrazeoam 5 mg (Nipam)
#Bromazepam 6 mg (Lexotan)
#Apaurine 10 mg (blue valium)
#aderall generic: amphetamine salt combo
#arimidex chemical name: anastrozole
30 pills
#adderall xr 10mg capsules 30 capsules
#codeine 30/500mg
#demerol (meperidine hcl) caps
#diazepam
#dilaudid
#soma -generic-
#ketalar injection
#ritalin
#flexeril (cyclobenzaprine) merck tabs
#hydrocodone 10mg/500mg 60tabs
#roxicodone 30mg (physicians tc)
#clonazepam (klonopin)
#fentanyl brand name: #duragesic 5-12 12.5 mcg/hr patches box
#oxycontin
#methadone
#seconal (chemical name-secobarbital)
#oxycodone-apap (wattson labs)
#vailum
#cialis
#vicoprofen (generic:hydrocodone-ibuprofen)
#hydrocodone-ibuprofen (brand name:vicoprofen)
#suboxone
#subutex
 
SERIOUS BUYERS ONLY. SAMPLE HUNTERS PLEASE EXCUSE
 
Do not hesitate to call me ANYTIME, and I will respond diligently. I will
also be open and glad to help you out with any medical problem you might be
facing and give you some advice.
 
The aim of every businessman is to maximize profit, and I am no exception.
But my second aim is to make sure all those who cannot get their hands on a
script to get what ever they need and be satisfied. Also, if there is a
medication you need but you are unable to walk into a store and get it
because of one reason or the other, then worry no more just contact me and
leave the rest to our conversation.
 
Again my contact is:
Email: topcaliberstocks@protonmail.com OR
Tel = Call/Text: +1(469) 249 2518
 
Thank you
Ramine <ramine@1.1>: Dec 02 05:00PM -0500

Hello.......
 
About my previous enhancement to C++
 
If you say to me that pure functions of Lisp and Haskel are pure
functions , but with my previous implementation you still can
by error forget to put your global variables that is
shared by threads in the properties that can not be accessed
by the object or in there repective global queues, i will say that
my implementation easy the job for us, because defining what is shared
and putting it in the properties that can not be accessed from the
object is easy and is as easy as making an error on sequential
programming, so in my opinion this level of security can be tolerated in
Object oriented programming without using Functional programming, other
than that we also have Transactional memory that is composable and easy
to use to solve our parallel progrmming problems in Object oriented
progrmming.
 
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Dec 02 03:03PM -0500

On 12/2/2016 2:54 PM, Mr Flibble wrote:
 
> Maybe someone should e-mail abuse@eternal-september.org to try and get
> this spambot turned off?
 
> /Flibble
 
Don't be stupid Flibble, i have explained to you what is good in Lisp
and Haskek an how to implement in C++ the Mvar like in Haskel to make
your C++ methods pure like in Lisp and use like a message passing
mechanism with queues to avoid race conditions like in Lisp and
Haskel.
 
 
Thank you,
Amine Moulay Ramdane.,
Melzzzzz <mel@zzzzz.com>: Dec 02 10:06PM +0100

On Fri, 2 Dec 2016 19:54:15 +0000
 
> Maybe someone should e-mail abuse@eternal-september.org to try and
> get this spambot turned off?
 
> /Flibble
 
you don't have to quote it as my news server already filters his
messages...
 
 
--
press any key to continue or any other to quit
"Christopher J. Pisz" <cpisz@austin.rr.com>: Dec 02 03:42PM -0600

On 12/2/2016 1:54 PM, Mr Flibble wrote:
 
> Maybe someone should e-mail abuse@eternal-september.org to try and get
> this spambot turned off?
 
> /Flibble
 
I elect Mr Fibble for the task.
Ramine <ramine@1.1>: Dec 02 04:29PM -0500

Hello,
 
About C++ and my following enhancement to it...
 
To be able to implement pure functions with Mvars of Haskel more cleanly
in C++, C++ must add properties that you can access only from the
constructor and can not be accessed from the methods of the object.
 
This way you will be able to implement more cleanly my following
implementation:
 
Here is how to implement pure functions with Mvars 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 , and other threads will block waiting
for the variables on there respective queues, 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.
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.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)