It is obviously a false positive - I build the exes from scratch every day. No option to exclude a folder from scanning? I haven't use an AV for some years, the last one was Windows Defender, and it had such an option. If I had any intention to earn money with my coding, I would sue the hell out of ...

Post code, MrSwiss. If you are still a coder...

I updated my library algo QSort() , see Fast and powerful string sort . The trick with the conversion table gave it a 2.8x speed boost - thanks a lot, Juergen! As mentioned earlier, it's a stable merge sort, and it has a number of other features, such as sorting by column (for spreadsheets), sorting...

Down to a few errors, using uppercase and no -asm att: *** compiling TmpFb.bas with -w all -Wc -O3 -s console *** Juergen\FB64\inc\array.bi(715) error 1: Argument count mismatch, found ')' in 'function = fb_ArraySort( byval ap, byval sa, byval t, byval cp, byval ai.p, byval ai.li, byval n)' Juergen\...

*** compiling TmpFb.bas with -w all -asm att -Wc -O3 -s console *** C:\Juergen\FB64\inc\array.bi(715) error 1: Argument count mismatch, found ')' in 'function = fb_ArraySort( byval ap, byval sa, byval t, byval cp, byval ai.p, byval ai.li, byval n)' C:\Juergen\FB64\inc\array.bi(1844) error 58: Type ...

jj2007 just pulled out, a shoe full of mud, in another thread and reacts, as expected, with a deeply hurt, overinflated ego, like a petulant child Damn, sometimes I desperately miss the icons here! Thanks anyways, you made my day :lol: :lol: Btw when was the last time that you gave us useful code? ...

i've actually been working on an in-place merge for about a week. seems my brain wants me to solve this one. My version took a bit longer, actually; and yesterday I threw out the call to StringsDiffer() and implemented Juergen's table solution instead (see Aug 06, 2019 9:30). Much faster for the ca...

1 - JK IS attempting to add new features 2 - it is his desire; he is making the effort and not doing it in secret and is inviting the community to help 3 - he has been sensitive to advice and criticism from others - trying to follow any rules suggested to him You should all be applauding him. I can...

Well, JK has code that answers the OP's question. Looks very relevant. What do you offer, other than your "32-bit is obsolete" bla bla?

I am fine-tuning my mergesort, now down to 0.6 seconds on a Core i5 ;-)

MrSwiss wrote:FBC 64 should be "top priority"

Yes, for everybody who regularly needs to allocate more than 2GB of memory.

4.) You cannot just compile from fbc_34.exe or fbc_64.exe! You must run fbc.exe in it´s regular environment. That is you must first rename fbc.exe, fbrt0.o, libfb.a and libfbmt.a or backup them, where they are located on your machine. Then you must copy fbc_32.exe to fbc.exe, where your original fb...

gcc version 8.1.0 (2018) Juergen\fbc-array\new\ustring.bi(53) error 28: Expected pointer in 'TYPE DWSTR extends wstring' Juergen\fbc-array\new\array.bi(487) error 41: Variable not declared, fb_ArrayCalcPos in 'i = fb_ArrayCalcPos(byval p, byval pptr)' Juergen\fbc-array\new\array.bi(511) error 9: Ex...

I found a pointer method for quicksort and adapted it accordingly. Now less than .8 seconds for a million. For case-insensitive strings, that is pretty fast indeed! I have downloaded jK's work and I am trying the binaries, but unfortunately I am encountering snags (cannot find .bi files) Same probl...

Juergen, it's difficult to compare them. As explained above, QSort() is a stable mergesort, not a quicksort (despite of the name). But I agree that C compilers have improved a lot, sometimes there is no difference at all between C and assembly. Still, we normally beat the CRT ;-) jj2007 Your .exe we...