PureBasic Forums - English

Very useful, it's short and readable (except the Russian comments, for me).Somehow the UTF8 BOM is missing in the version that I downloaded directly from github, I had to manually select UTF8 in the IDE, and then to copy & paste the raw version manually into the editor. Because it would be ...

Once I needed the implementation of the Radix Tree algorithm, but I did not find it under a free license, so I wrote my own option. This is absolutely free, do everything you want with him.
Github link: https://github.com/webarion/RadixTree

idle wrote: Wed Jan 15, 2025 10:40 pmsquint\Numkeys()

Then the result of squint3.3.pbi is different from the rest:

113930 keys in squint3.3.pbi
100000 keys in RadixTree.pb
100000 keys in Map

Link to test code: https://drive.google.com/file/d/16kSK7P ... drive_link

idle wrote: Wed Jan 15, 2025 9:18 pm Squint will tell you it's allocated size with squint\size()

Do you have a procedure for displaying the number of words recorded? For example, in Map this can be done through MapSize, and RadixTree also has something similar. I didn’t find anything similar with you, maybe I didn’t guess it myself.

Squint will tell you it's allocated size with squint\size()

Thanks for the advice! I'll watch this. But, unfortunately, I don’t yet know how to truly compare the memory occupied by the structures of these three algorithms. Your development has this tool, other versions do not have such a tool ...

I tested three algorithms and got the following result:

; For 100000 words (minimum of 20 tests):

; squint3.3.pbi
; Write Keys, Time: 183ms.
; Read Key, Time: 647ms. (1000000 cicles)
; Memory by resource monitor: 23676Kb (difference before adding and after adding)

; RadixTree.pb
; Write Keys ...

Later, I will write about tests.
Still, I think that if the license is so strict for a well-known algorithm such as RadixTree, then I will have to write my own version of this algorithm.

if you want a trie you can use squint3 it's lock free concurrent and is licensed as eclipse 2 so you can use it commercially
https://github.com/idle-PB/Squint3

Thank you for your answer! How different is Squint3 from RadixTree in terms of speed and memory footprint?


I Haven't done any ...

idle wrote: Mon Jan 13, 2025 8:41 pm if you want a trie you can use squint3 it's lock free concurrent and is licensed as eclipse 2 so you can use it commercially
https://github.com/idle-PB/Squint3

Thank you for your answer! How different is Squint3 from RadixTree in terms of speed and memory footprint?

Hello! I would like to use the RadixTree algorithm from the file RadixTree.pb
The question is: if I use this algorithm in my program, which is in no way associated with the PureBasic IDE, will my program be owned by Fantaisie Software under the LICENSE-FANTAISIE?

I tried to guess which encoding the data is being read in.
*x = UTF8("Внимание, этот тип данных может существовать только в ядре конструктора!")
DebuggerWarning(PeekS(*x, -1, #PB_Ascii))
FreeMemory(*x)
more
s$ = "Внимание, этот тип данных может существовать только в ядре конструктора!"
*x ...

1. Can you give me a code to check that is guaranteed to give the problem?
2. Check that the “Catalogs\Russian” files are in UTF-8 encoding.

I had the problem sometimes, but I put off researching the cause. Now I checked that my files were in Win1251 encoding. Now if you give me an example, I'll ...

I don't understand why DebuggerWarning doesn't support the Unicode string. Instead of a message there is a question mark ????????

You can also do the following before installing and cleaning the indicator:

Selects text, but not all occurrences. If it worked stably, it would be possible to add cleaning and some search settings (case sensitivity, whole word only, etc.). Access is now via file as direct search via Scintilla functions is not available.

This may happen because a text editor or IDE is ...