Click here to Skip to main content
15,566,065 members

Comments by veen_rp (Top 15 by date)

veen_rp 22-Jan-16 8:29am View    
I leave this solution in because of the use of linq that was new to me. But this is not a solution. See my follow-up 3 in the original post
veen_rp 22-Jan-16 8:18am View    
I tried this out myself. Though elegant, the execution is slow!! In fact much slower than my initial code. See the update of my original question for the timing of processing 3,506,820 byte arrays like this...
veen_rp 22-Jan-16 1:44am View    
I picked answer 1 and 4 but thanks for the reactions of everyone. I tested out the code of phil.o and it surely works in C#. I'm working now on the conversion to VB.NET which is not trivial because the bit shift operators work a bit differently for the two languages (for those interested: I will combine phil.o extensions with the Unpack function from F.Xaver in solution 4 but not use the BitConverter class for reasons of Endianess. I will post my wrap up in VB.NET here once I got the VB bitshi(f)t going. Tnx!!
veen_rp 21-Jan-16 12:19pm View    
True. I'm in the middle of testing stuff out. Let you know what the result is (any month now...)
veen_rp 21-Jan-16 6:51am View    
This looks good as well, I'll try it out. Though I think, having to combine BitConverter with Endianness, I'm better of with solution 1. Thanks anyway!