Leaderboard

Interesting what happens when the Vietnamese language is chosen. I created this issue 7 years ago, about another error that I had only seen on Vietnamese: https://quality.embarcadero.com/browse/RSP-16205 It could be related to your problem because my reported error is that TPath.GetTempPath fails in Vietnamese. PS. I don't understand Vietnamese, but we have customers from Vietnam and had to make a workaround for the issue.

I started taking a look into the problem, however it seems to be an issue deep in the Delphi runtime and it's a bit beyond me at the moment.

Right on both counts, Sherlock! While digesting all those very welcome suggestions, meantime I apologize for not making myself clearer and for confusing Find with IndexOf. For clarification, the list I want to sort will have no duplicates. At present, with no sorting, both lists are built sequentially by ADDing corresponding items, and later I have something like this: list1, list2: TStringList; s1, s2: string; ... s2 := list2 [ list1.IndexOf (s1) ] which works very well, but is slow. If I make list1 SORTED, the code above is much faster, but the answers are wrong, because the order of items in list1 has been changed by the sorting whereas list2 is the same as before. To get the benefit of speeding up, I want to re-order list2 to match the way list1 was reordered by the sorting. Taking up the idea of an index array (or list), the following might work, and slowness here wouldn't matter so much: Copy list1 to list1a list1.Sort // will ensure the collation order is compatible with TStringList.IndexOf Construct an index by comparing list1 and list1a Copy list2 to list2a Clear list2 and rebuild it sequentially using list2a and the index. But I need to examine the other proposals before doing anything else.

Instead of application you could use Google Sheets and Google Docs.

May be I got it wrong, but that sounds a bit like a request for pirating.

There's big difference between "buy and try to maintain and let it die after some time" and "make agreement and provide free version to legal customers" approaches. Considering the history, the latter is better

Came in the mail, got two copies, even though I only ordered one.

For anyone who struggles with py embeddable in the future, here are some working executables for you to troubleshoot with. Validate your python embeddable setup, confirm package installation and test your imports. FMX and VCL X64 compiled executables in the releases : Source code & sample "_pth" file is available in the GitHub Repo : https://github.com/SwiftExpat/ValidatePythonEmbeddable Usage: Click on browse DLL , this will set the dllname and path correctly and then allow you to adjust other component properties. Then load DLL PIP List Pip results can be confusing, so I have automated the PIP list command to ensure it runs from the embeddedable dist. More should be done for this, but this is a start and feel free to fork the repository or make suggestions.

Not sure if you find NextCloud too fat for your solution, I dont bother about its <= 100MB size ? Of course, this is so much more, than a simple note taker. But this is small, perfectly maintained, has smooth update process, gives full control over all aspects of sharing, accounts, and so on, has free apps, WebDAV support, offers an API access, runs on a simple, virtual PHP server ... Notes can be edited as MarkDown ( as one of the simplest options ), with Online editor and good-working Apps available. I'm still testing and dive deeper and deeper into NextCloud for my personal and private small teams, and this is veeeery smooth so far. Probably, you like and get more familiar with that too

2 is Stride parameter. However, it does not actually do what people think it does. It divides work in chunks that will run on same task effectively limiting number of threads used for running parallel for loop at a time. Default value of stride is 1 which means that each pass will run independently of others. If the stride is 2, then Max number will be divided with 2 and there will be Max/2 number of chunks - tasks. If the Stride is same as Max then all passes will run inside single task. Someone writing this code though that stride defines index increments, but that is not so. Procedure will still run for each index from lower bound to upper bound regardless of stride value and calculation of prime numbers will be run for index 1, 2, 3,...