Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

My EasyList for Delphi and Freepascal was updated to version 1.5..

1 view
Skip to first unread message

Amine Moulay Ramdane

unread,
Oct 3, 2020, 4:29:03 PM10/3/20
to
Hello..


My EasyList for Delphi and Freepascal was updated to version 1.5..

Now you can set the inside dynamic-array of EasyList object by using the SetArray() method, you can pass it another dynamic-array from outside TEasyList object.

Also you can get the inside dynamic-array by using the GetArray() method.

I have also included my MapReduce library inside The zip file,
please look at my test1.pas demo inside the zip file so that
to understand how my EasyList works and how to use my MapReduce Library
with EasyList and how to use SetArray() and GetArray() methods of my EasyList.

You can read about and download my EasyList version 1.5 from my website here:

https://sites.google.com/site/scalable68/easylist-for-delphi-and-freepascal

More precision about my software Libraries..

About scalable higher-order functions like Map, Reduce and Filter..

MapReduce is a pattern introduced in 2004 in the paper “MapReduce: Simplified Data Processing on Large Clusters,” by Jeffrey Dean and Sanjay Ghemawat (https://research.google.com/archive/mapreduce-osdi04.pdf), so here is my new invention in form of a Library: I will soon implement parallel and scalable higher-order functions like Map, Reduce and Filter, so it will be a very powerful library.

And i have already implemented a serial(i mean not parallel) Library
of higher-order functions like Map, Reduce and Filter:

You can read about it and download it from my website here:

https://sites.google.com/site/scalable68/delphi-library-that-implements-higher-order-functions-like-map-reduce-and-filter

About my Threadpool with priorities that scales very well..

And you can also use my serial Library of higher-order functions like Map, Reduce and Filter with my following invention of my Threadpool with priorities that scales very well (that also supports a ParallelFor() that scales very well), so read about it in my following smart thoughts to understand:

https://community.idera.com/developer-tools/general-development/f/getit-and-third-party/73133/about-productivity

Also i have already invented and implemented my following powerful parallel sort library, you can read about it and download it from my
website here:

https://sites.google.com/site/scalable68/parallel-sort-library-that-is-more-efficient

I have just tested my above parallel sort library that is more efficient, and i have just noticed that it works well with my serial Library of higher-order functions like Map, Reduce and Filter, i mean
you can pass it the generic TArray<pointer> by casting it.


Thank you,
Amine Moulay Ramdane.



0 new messages