Lajos Juhász

I used Default on record maybe once or twice. On the other side I rarely have a chance to use records. Nowdays it's almost always a class I am working with. Generally speaking, when it's important for readability I do like to initialize a variable/field/record just to have a cleare code when I have to revisit it.

In the event you should change the color of the font on canvas not the column.

As in the documentation it's going to be set in the paint event. Otherwise it's not guaranteed to be the same.

Google returns that usually this error message occurs when the Exchange server is low on disk space. In any case you should incorporate a delay. Nowdays servers usually has a hard limit how many e-mails you can send in an hour.

Most probably you've changed the Label1.StyledSettings property. I've tried with the default settings of the TLabel you cannot change the style from the code. In order to work you have to add: L.StyledSettings:=L.StyledSettings-[TStyledSetting.Style];

You can watch it on Youtube.

Could be Windows ASLR?

Yes of course. Also that they find no interest in publishing when we can expect a point release (including bug fixes). You bought what you bought (without support you get 0 bugfix) if there is a bug you're a developer and should write your code that will overcome the bugs. This is not acceptable for Windows but it's working as updates/new version from MS doesn't requires changes in the toolchain. On the other side mobile platforms with every new version require an update in the toolchain they cannot support new OS releases. If you're using Delphi for an application you just have to figure out your developing cycle without knowing when you can expect bug fixes or new version with updates that you could use.

No, there is no reason to publish it anymore.

I was able to register roughly 8 hours ago.

Why not? It's a priviledge to get access to some kind of "road map information". Their task is also to help to complete the version. This it's premium service of the customers towards the company!

You should place the nodes after a copy in a list, during the copy operation you have to skip those nodes.

In order to calculate the required space you can use windows API DrawTextEx with format option DT_CALCRECT.

I don't know please tell us. I have had a situation when I was unable to debug a package with one exe. Changed the application that is used for debugging (host application) then the break point worked every time. Next week I was able to debug with both applications.

You will have to wait for a future version of the Delphi. Maybe the new IDE will resolve this issue (or an improved LSP server).

you have a local variable fdc. Try self.fdc.Connected:= True;

This is an excellent suggestion. I doubt it is a must in Europe, I still receive sensitive information for other people in my e-mail account.

you should double check the path of the file the package tries to load. If the name of the dll is same for 32 and 64 bits there is always a possibility that windows first locates the 32 bit version.

You have to replace /local/path/file.jpg with your pdf file and type=application/pdf.

I wrote that in context that Asm has more than twice the rating of Delphi. I simply cannot believe that's true.

For me Assembly language makes no sense. I wonder in 2022 who is still coding using asm (I doubt it's used widely in windows applications).

If you are looking for the Registered Prodducts portal you can find it at https://my.embarcadero.com.

My point was with that Wikipedia link that modified algorithms have their names. Like in the link the variation to find the elemest with lowest index is called binary_search_leftmost and not binary_search. That's true, but most developers expect that if an implementation reference to an algorithm it will implement that algorithm and not something else. That was the whole point to name algorithms in matemathics and computer science. That no matter from where you learned an algorithm you know how it works.

This is the definition of the binary search: https://en.wikipedia.org/wiki/Binary_search_algorithm "The procedure may return any index whose element is equal to the target value, even if there are duplicate elements in the array. For example, if the array to be searched was {\displaystyle [1,2,3,4,4,5,6,7]}{\displaystyle [1,2,3,4,4,5,6,7]} and the target was {\displaystyle 4}4, then it would be correct for the algorithm to either return the 4th (index 3) or 5th (index 4) element. The regular procedure would return the 4th element (index 3) in this case. It does not always return the first duplicate (consider {\displaystyle [1,2,4,4,4,5,6,7]}{\displaystyle [1,2,4,4,4,5,6,7]} which still returns the 4th element). "

I doubt, this is by definition how Binary search works. To get the lowest index you just to iterate from the matched item and find the lowest index.