[M3devel] STL algorithms? sort/unique?

[Daniel Alejandro Benavides D.]

Hi all:
to make a proposal we could consider several options, for grow able stacks and fine grained heaps, my approach is pure Baby Modula-3, for the former and Obliq-like objects for the latter.
But I'm no selling the idea to you guys! Just if someone could manage to make a proposal I support it.
Thanks in advance

--- El mar, 2/10/12, Dragiša Durić <dragisha at m3w.org> escribió:

De: Dragiša Durić <dragisha at m3w.org>
Asunto: Re: [M3devel] STL algorithms? sort/unique?
Para: "Jay K" <jay.krell at cornell.edu>
CC: "m3devel" <m3devel at elegosoft.com>
Fecha: martes, 2 de octubre, 2012 14:53

I don't need stack allocated object. 
I don't need to have lot's of big stacks in my multithreaded program. Can you implement growable stack? Is it worth your while?
I need even less a hassle of hand-selecting stack size, for threads where I need stack objects and other threads.
As Anthony said. At this time and age…  
I am sorry to even mention that, but maybe you just need C++? Or C++ without "a bit" of fat? Like..., 60% of language.
I think we just need even better collector that we currently have. One passing Mika's thread test :).
dd

On Sep 30, 2012, at 8:06 AM, Jay K wrote:
I don't just want UNTRACED OBJECT.I also want stack allocated objects.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://m3lists.elegosoft.com/pipermail/m3devel/attachments/20121002/10cd2a67/attachment-0002.html>