Tommi Prami

Can someone build release version of GExperts with patched D12, with current sources?

If can, could you share it for testing. 

11 hours ago, Achim Kalwa said:

It is a bug in Delphi 12 (and also Patch 1): https://quality.embarcadero.com/browse/RSP-42675, reported 3 month ago.

You need to unload the project and load it again when switching from debug to release or vice versa.

Please all vote for this. Vote seems up still...

-Tee-

5 hours ago, dummzeuch said:

The error message implies that the package format is not the expected one. Did you by chance already install the Delphi 12.1 update? Maybe there is something wrong with the package that comes with that update.

Updated D12, did not check is this 12.1 or 12.0 Fix1 

But update is installed.

-Tee-

[dcc32 Fatal Error] GX_About.pas(8): E2213 Bad packaged unit format: c:\program files (x86)\embarcadero\studio\23.0\lib\Win32\release\rtl.dcp.Winapi.Windows - Expected version: 36.0, Windows Unicode(x86) Found version: 95.84, Unk(CIL)

I think I've never seen this error. Debug version builds just fine.

-Tee-

20 hours ago, ErikT said:

 

type
  TPingThread = class(TThread)
  private
...
  public
    constructor Create(AOwner : TComponent; OwnIP : in_addr; FromIP : Byte; ToIP : Byte); reintroduce;
    destructor Destroy; override; // <---- Add override to the destructor

 

On 1/1/2024 at 4:10 PM, TurboMagic said:

Now I wanted to migrate it to a newer version (currently 3.0, but at the end 4.x is planned).

 

Skip 4.x, and go directly to the FB5. From

point of your app, FB4.x and FB5 are more than less the same, only minor ODS version change, form 13.0 to 13.1, so no new data types etc.

If scared of new release, wait for couple of weeks/months to see is there something needed to fix (that you care about).

If there is valid reason not to go to the FB5, I would for sure to skip FB3 at least, would jump directly to the FB 4.0.4.. Also I would try to avoid setting data type compatibility mode to some to the old version, I would just fix DB and code, should not take too long.

On 1/1/2024 at 4:10 PM, TurboMagic said:

This is a problem already discussed in German DP:
https://www.delphipraxis.net/214354-backup-problem-nach-umstellung-auf-v3-0-embedded.html
but the hints I got from there weren't working yet or not exactly how I wanted things to work.

 

Embedded needs exclusive access to the DB, so you need to close all connections to the DB, at the App and external Db tools etc. Not sure that is this the problem tough, because I saw no error message, and did not go through the german forum thoroughly.

-Tee-

22 minutes ago, sjordi said:

Still no native iOS deployment?

Not sure. maybe better to ask at Firebird mailing list.

-Tee-

And Firebird 5.0 is out...

https://firebirdsql.org/en/news/firebird-5-0-0-is-released/

Release notes: https://firebirdsql.org/file/documentation/release_notes/html/en/5_0/rlsnotes50.html
Firebird 5.0 Language Reference: https://firebirdsql.org/file/documentation/html/en/refdocs/fblangref50/firebird-50-language-reference.html
Download: https://firebirdsql.org/en/firebird-5-0/

-Tee-

55 minutes ago, Attila Kovacs said:

For me it sounds like an indexing task, store the data to the integer and not the opposite.

I don't quite follow, could you elaborate a bit?

1 hour ago, David Heffernan said:

Surely this could be done using regular expressions

Most likely.

9 hours ago, Clément said:

The SQL would be very simple:

 

It sure would be handy and easy, with more than all features needed. I am afraid that it also would be too slow and too much resource overhead,

There will be easily thousands of data structure populations and searches can raise millions even more.

-Tee-

17 minutes ago, Clément said:

How low is you range. Can you use a simple array?

 

A[1]:=1;

A[2]:=1;

A[3]:=1;

...

A[7]:=-1; // Non existing range

...

A[102]:=2;

A[103]:=2;

....

A[149]:=2;

A[150]:=2;

 

All elements must have a value. 

 

 

 

Very small ranges that would be simple lookup. I think I have to realistically be mentally prepared upper bounds of few hundreds of  thousands, Maybe even millions.

Most case it will be 100k or less..

But anyhow, interesting take on this. Thanks...

-Tee-

Just to point it out:

I am looking for ideas how to make it fast and simple etc... 

I made simple proof of concept. Make some Unit Tests for it some point- If there is better idea, easy to test that then.

@Uwe Raabe made very simple implementation indeed. 
 

-Tee-

18 hours ago, Kas Ob. said:

I really hate that !, "no range no value" does sound like undefined behavior.

Meaning "No value given to the Container". If not added value, there can't be any it has... 

Most likely I'll return defined value, but that is just implementation detail.

-Tee-

26 minutes ago, Kas Ob. said:

so to recap what i get you have non-overlapped integer ranges in a list, and want to implement the best solution to check for an integer to get its range if exist, right ?

I think exactly that.

integer ranges like
1-5: 1
15-40: 1

102-150: 2

and if I search for:
 1 -> I'll get that range exists and get also associated value 1
 7 -> No range, and no value
 149 -> Range exists and associated value 2 returned

code could be something like:
 

if FRanges.Contains(1, LRangeValue) then
begin
  case LRangeValue of
    1: HandleRangeType1; 
    2: HandleRangeType2;
  end;
end;

Hello,

Was looking for what is out there and Interval tree etc has too much functionality than I need, but still might be way to go, not sure.

I have ranges of integer, which do not overlap, and are inherently in right order while adding. In which I need to search if the given more than  less random integer falls in any of those ranges, and retrive what type of the range is (Currently there is only two distinct types, and of course the state when integer value is not found in any of the ranges.) List would have 0-couple hundred of ranges at max, usually low numbers.

That's why I was thinking that balancing of the tree structures while adding might be unwanted overhead.

Was thinking using list that could use list, adn starts are in ascending order, and binary search, but was thinking how to binary search something that most likely is not in the list. Now that I write it out, have to just compare two items and/or is it first/last at the list, quite complex compare but nothing too bad, I think). For the list I was thinking that is there list implementation that can be marked as sorted without doing actual sort operation and would have binary search that could have custom compare that I could find the start of the range, maybe end of the range in the dictionary with start as a key.

As you can see, I am not sure how this would be smart to implement.

On 12/29/2020 at 5:38 PM, Slappy said:

Do you have any idea why the installation gets stuck on "Installing library Parnassus CodeEditor..." ?

 

I tried install it like 10 times and never finished installation, it dow=es not matter whether I run IDE in admin mode or not, it is always the same.

UAC lurking in the task bar, asking for installation permission? 

Been hit by that few times....

-Tee-

14 hours ago, Brandon Staggs said:

The comments on that readme explicitly state it's not complete. However, it also says Argon2 is not fully documented and isn't as good as bcrypt, both of which are really odd things to say.

I take it as the BCrypt is better if run it one second or shoter period. . Whats actually the point of Argon2 that you run it long, and use much resources, to make it hard for brute force attack, even with GPU farms.

31 minutes ago, PeaShooter_OMO said:

Why is it difficult to implement? Or shall I rather say; what about it makes it difficult to implement?

There is couple implementations. like: https://github.com/JackTrapper/argon2-for-delphi

Have not tested them tough...

-Tee-

13 minutes ago, Kas Ob. said:

Hi,

Not sure what is your question is, but from what Arnaud wrote and where did he mentioned the salting, i can expand on this, 

Used word Salt as to ask in different words. But your explanation, I think answered question. It is not about adding "salt" to beginning but padding to end.

I would think that is the job for the AES library, not for individual programmer using the library.  Kind would hope that best practices would be used as default, and if need something else, lets say receive data from 3rd party system, then you can change behavior.

-Tee-

13 minutes ago, Arnaud Bouchez said:

- there is also a need for 16-bytes padding of the encoded output - here Pkcs7 seems the de-facto standard.

What do you mean here actually. Add "salt" to the data to be crypted or to the crypted it result data?

and why is 16 bytes important, or it is 16 bytes or more, or any multiple of n bytes?

Thank you all,

Now I've ported the code from PPL to OTL, and next I'll polish it a bit and just use it, or maybe tune it a bit,. As is, it's good enough what it does...

-Tee-

54 minutes ago, Primož Gabrijelčič said:

Use it's .OnStop function (async) or .OnStopInvoke (synchronized to the owner thread).

Thanks... I'll look into that...

That seems too obvious now, hopefully in few minutes also 😄 🙂

-Tee-

How I can wait for the ForEach to finish, if I use the NoWait-pattern?

Could not figure that out yet.

-Tee-

Tried to add .NoWait to ForEach call, and did infinite loop processing messages after that it'll start more than one "task" parallel.

IOmniParallelLoop does not contain flag that I could wait for, that would be nice... (As I saw in some demo maybe in future, IsDone etc...)

-Tee-