Re: working with byte arrays
From: J French (erewhon_at_nowhere.uk)
Date: 11/13/04
- Next message: Mike D Sutton: "Re: How to Write a Function return an Array"
- Previous message: EricLun: "How to Write a Function return an Array"
- In reply to: Peter: "Re: working with byte arrays"
- Next in thread: Mark Alexander Bertenshaw: "Re: working with byte arrays"
- Reply: Mark Alexander Bertenshaw: "Re: working with byte arrays"
- Messages sorted by: [ date ] [ thread ]
Date: Sat, 13 Nov 2004 11:17:18 +0000 (UTC)
On Sat, 13 Nov 2004 10:31:29 +0100, "Peter" <-> wrote:
>Thanks, Rick
>I like this solution because it is simple and easy, Thanks again
>I haven't make any performance tests yet but I could think that it would be
>faster than my current solution because the whole comparisson is done inside
>InstrB(no VB loop is running).
>Thanks for the hint to check the size of the arrays, in my project all
>bytearrays start at index 0 therefore I just need to concentrate on Ubound.
One thing you will find is that when compiled (not in the IDE) VB
Loops on Byte Arrays are /astonishingly/ fast
I found this when comparing timing on my Delphi file sorting DLLs, to
my amazement using callbacks to VB was pretty much the same speed as
pure Delphi - and Delphi is often virtually unbeatable, even in ASM as
it uses an optimizing compiler.
- Next message: Mike D Sutton: "Re: How to Write a Function return an Array"
- Previous message: EricLun: "How to Write a Function return an Array"
- In reply to: Peter: "Re: working with byte arrays"
- Next in thread: Mark Alexander Bertenshaw: "Re: working with byte arrays"
- Reply: Mark Alexander Bertenshaw: "Re: working with byte arrays"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
