How can you print 200 unique numbers between 0 and 99?! Difficult indeed, especially with integers! Another little problem: Dim MyInt() As DWORD ; tested pseudo code For_ ct=0 To 999 ; load a unique random number between 1000 and 1999 into the array Rand(1000, 2000, MyInt(ct), unique) Next ArraySor...

(if you know that it is local, you can reduce the timeout with -w <ms>) Thanks. I had tested that before and saw no effect. Now I retried, and got it to work (no idea what was different...). Interesting: - without any wait interval (no "-w"), the answer is "host cannot be reached&quo...

Is this a demo why code should be thoroughly tested for T+T?

You can't expect people to maintain 2 systems and two compilers before they post some code. You can expect people who post here in the Tips & Tricks section that they compile their code at least with standard Gas, Gcc32 and Gcc64. It's only a mouseclick or a keystroke away, right? People who co...

Multiplication is costly (and division is much worse).

deltarho[1859] wrote:Actually, I did not write that

Sorry, I quoted badly - of course, I support the spirit of your comment.

deltarho[1859] wrote:don't post your code without including an explanation

Exactly. And don't post code that isn't thoroughly tested. This code compiles in 32-bit land but then throws exceptions, definitely no good for the Tips & Tricks section.

dodicat wrote:Here is a string variety.

What do you mean with "string variety"? The lookup code? It's blazingly fast, nice idea...

coderJeff wrote:specify a low optimization level

That distorts the result in favour of the "naked" assembly routines. What often works instead is to fake an interest in the results generated in the loop by adding them up and displaying the sum after the loop has finished.

Assembly version, it's pretty fast. That's an understatement, it's almost three times as fast as mine ;-) function dup8bits naked cdecl ( byval x as ulong ) as ulong 'CoderJeff asm #ifdef __FB_64BIT__ .align 16 #ifdef __FB_LINUX__ mov rax, rdi #else mov rax, rcx #endif #else .align 4 mov eax, [esp+...

dodicat wrote:You should reset t for Badidea B

Done, thanks.

Duplicate bits 0->00, 1->11. Example: 1001 0001 -> 11000011 00000011 What's wrong with assembly? You want it fast, right? function duplicate naked cdecl (byval inbyte as long) as integer asm .align 4 mov edx, [esp+4] xor eax, eax mov ecx, -1073741824 L0: rol ecx, 2 shr edx, 1 je L1 jnc L0 or eax, e...

deltarho[1859] wrote:nobody is as dumb as me.

So you think you are unique?? No way...

dodicat wrote:You want it in FreeBASIC code, then use the freeBASIC website to tell you.
(As a bonus you get an IP address)

Hey, that works much better than IcmpSendEcho, even for my 'TheOtherNotebook'! Thanxalot, dodicat...

xbgtc wrote:thanks but I'm aware of ping but wanna see if there's a coding way

There is: IcmpSendEcho