In Ring 1.27 (GitHub) - Automatic HashTable usage when we Access List Items by String Index

[Mahmoud Fayed]

Hello

Today we did a little update to Ring lists implementation in Ring 1.27 so Ring VM can do Automatic HashTable usage when we Access List Items by String Index.

Feature that we talk about:  Lists — Ring 1.26.0 documentation 

So, using aList["mykey"] will enable Ring VM to create an internal HashTable to use in finding the key if the aList items ["key",vValue] count is greater than 8.

This will provide performance improvements in programs that needs fast search (instead of using Sort() and BinarySearch() functions or using another extension written in C/C++) 

Sample: ring/samples/General/FindAnadromes/process3.ring at master · ring-lang/ring

Thanks for Bert, Ilir, Azzeddine & Celement for pointing to this issue and discussing it, your feedback are the reason behind this important improvement.

Greetings,

Mahmoud 

   

[Bert Mariani]

Hello Mahmoud

Thanks for implementing the Hash Table List

And the attached sample.

Its a lot faster than plain list by magnitudes.

Regards

Bert Mariani

[Carlos Miguel FARIAS]

When will version 1.27 be released?

Greetings from Argentina

--

---
You received this message because you are subscribed to the Google Groups "The Ring Programming Language" group.
To unsubscribe from this group and stop receiving emails from it, send an email to ring-lang+...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/ring-lang/50e04ee7-5e12-4331-bb00-23f2bcaad6een%40googlegroups.com.

[Mahmoud Fayed]

Hello Bert

>> "Thanks for implementing the Hash Table List And the attached sample. Its a lot faster than plain list by magnitudes."

You are welcome :D

Greetings,

Mahmoud

[Mahmoud Fayed]

Hello Carlos

>> "When will version 1.27 be released?  Greetings from Argentina"

Thank you very much :D

It will be released very soon (During the next 30 days)

Greetings,

Mahmoud