soft and program: Digest for comp.programming.threads@googlegroups.com

comp.programming.threads@googlegroups.com

Google Groups

Topic digest
View all topics

[Modération JNTP] Annulation de <pcffqb$bfv$1@dont-email.me> - 22 Updates
Fastest Sorting Algorithm. Ever! - 1 Update
My new "invention" that is a fully scalable algorithm is finished and is coming soon.. - 1 Update

[Modération JNTP] Annulation de <pcffqb$bfv$1@dont-email.me>

Elephant Man <conanospamic@gmail.com>: Oct 26 05:06PM

Article d'annulation émis par un modérateur JNTP via Nemo.

Elephant Man <conanospamic@gmail.com>: Oct 26 05:07PM

Article d'annulation émis par un modérateur JNTP via Nemo.

Elephant Man <conanospamic@gmail.com>: Oct 26 05:08PM

Article d'annulation émis par un modérateur JNTP via Nemo.

Elephant Man <conanospamic@gmail.com>: Oct 26 05:02PM

Article d'annulation émis par un modérateur JNTP via Nemo.

Elephant Man <conanospamic@gmail.com>: Oct 26 05:03PM

Article d'annulation émis par un modérateur JNTP via Nemo.

Elephant Man <conanospamic@gmail.com>: Oct 26 09:30PM

Article d'annulation émis par un modérateur JNTP via Nemo.

Fastest Sorting Algorithm. Ever!

Horizon68 <horizon@horizon.com>: Oct 26 02:30PM -0700

Hello,

Read this:

I have come accross this indian programmer, look at his following
video that prove that the fastest sorting algorithm time complexity
is n*log(n):

Fastest Sorting Algorithm. Ever!

https://www.youtube.com/watch?v=4Q72kbwyEmk

I have also "invented" my following Parallel Sort Library that is
powerful, read about it and download it from here:

https://sites.google.com/site/scalable68/parallel-sort-library

Thank you,
Amine Moulay Ramdane.

My new "invention" that is a fully scalable algorithm is finished and is coming soon..

Horizon68 <horizon@horizon.com>: Oct 26 12:04PM -0700

Hello...

My new "invention" that is a fully scalable algorithm is finished and is
coming soon..

I have just today enhanced "much" more my "invention" of a scalable
algorithms of a scalable reference counting with efficient support for
weak references, i think i am the only one who has invented this
scalable algorithm, because it is the only one who is suited for
non-garbage collecting languages such as C++ and Rust and Delphi, my
previous algorithm was not completely scalable, because the first object
that is reference counted was not scalable(it is just the first), but
today i have just made my algorithm "fully" scalable on manycores and
multicores and NUMA systems by using a clever scalable algorithms, so i
think i will "sell" my invention that is my scalable reference counting
algorithm with efficient support for weak references and its
implementation to Microsoft or to Google or to Intel or Embarcadero

Andf about memory safety and memory leaks in programming languages..

Memory safety is the state of being protected from various software bugs
and security vulnerabilities when dealing with memory access, such as
buffer overflows and dangling pointers.

I am also working with Delphi and FreePascal and C++, and as you have
noticed i have invented a scalable reference counting with efficient
support for weak references that is really powerful, read about it and
download it from here(it is the Delphi and FreePascal implementation):

https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references

And you have to understand that this invention of mine solves
the problem of dangling pointers and it solves the problem of memory
leaks and this reference counting of mine is also "scalable", and i
think that this invention of mine is the only one that you will find,
and you will not find it in C++ and you will not find it in Rust.

Also Delphi and FreePascal solve more the out of bounds in arrays and
strings like this by making range checks enabled:

In the {$R+} state, all array and string-indexing expressions are
verified as being within the defined bounds, and all assignments to
scalar and subrange variables are checked to be within range. **If a
range check fails, an ERangeError exception is raised (or the program is
terminated if exception handling is not enabled).

Range Checks is OFF by default. To enable it, you can add this directive
to your code:

{$RANGECHECKS ON}

You can use also generic (template) style containers for bound checking,
my following writing to understand more:

About C++ and Delphi and FreePascal generic (template) style containers..

Generics.Collections of Delphi and FreePascal for generic (template)
style containers that you can download from here:

https://github.com/maciej-izak/generics.collections

TList of Generics.Collections of Delphi and FreePascal is implemented
the same as STL C++ Vectors: they are array-based. And since data
structureS are the same then also performance should be comparable.

So I've done a small test between Tlist of Generics.Collections of
Delphi and FreePascal and C++ vector, it's an addition of 3000000
records of 16 byte length, in one loop, here is the results:

Tlist time = 344ms
Vector time = 339ms

It seems they are the same, the test use only the function ( List.add ,
vector.push_back).

STL vectors with the at() and Delphi TList of Generics.Collections of
Delphi and FreePascal perform bounds checking.

So i think that with my invention above and with all my other inventions
that are my scalable algorithms and there implementations and such in
C++ and Delphi and FreePascal that you will find
in my following website, Delphi and FreePascal have become powerful:

https://sites.google.com/site/scalable68/

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.programming.threads+unsubscribe@googlegroups.com.

soft and program

Saturday, October 27, 2018

Digest for comp.programming.threads@googlegroups.com - 24 updates in 3 topics

No comments:

Blog Archive

About Me