Home/ Questions/Q 9319577
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-19T03:25:11+00:00

I have an in-memory byte[] and need to locate the offset where 13 and

  • 0

I have an in-memory byte[] and need to locate the offset where 13 and 10 are. I will then use the following to extract that line:

 String oneLine = Encoding.ASCII.GetString(bytes, 0, max);

What is the fastest way to search for the two bytes on a x64 bit computer? ..and convert it to a string?

Is there anything I can do other than iterating through each byte, scanning for 13 and then scan for 10? 

// Disclaimer: 
// This is just for my curiosity.  Perhaps I'll gain a better understanding of
// how .NET interfaces with RAM, the CPU instructions related to comparisons, etc.
//  
// I don't suspect a performance problem, but I do suspect a lack of understanding
// (on my part) on how C# does low-level operations.
Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Not sure if it will be ‘the fastest way’ but you can look at Boyer-Moore algorithm to find the indexes of the required values.

    Have a look at this SO thread Search longest pattern in byte array in C#

    Boyer-Moore would be better than a linear array traversal because it can skip elements depending on the length of you ‘needle’ and it gets better as the ‘haystack’ gets bigger. HTH.

    • 0