8

I need a C# implementation of something similar with ByteBuffer from Java. Methods of interest - .remaining() - returns the number of elements between the current position and the limit. - .array() - .clear() - .put(byte[], int, int)

I started something with MemoryStream.. but no clear(), and a lot of improvisation Also, i found a c# implementation on Koders: http://www.koders.com/csharp/fid2F8CB1B540E646746D3ADCB2B0AC867A0A8DCB06.aspx?s=socket#L2.. which I will use.. but maybe you guys know something better

Marc
  • 16,170
  • 20
  • 76
  • 119
pulancheck1988
  • 2,024
  • 3
  • 28
  • 46

3 Answers3

33

MemoryStream can do everything you want:

  • .array() => .ToArray()
  • .clear() => .SetLength(0)
  • .put(byte[], int, int) => .Write(byte[], int, int)
  • .remaining() => .Length - .Position

If you want, you can create extension methods for Clear and Remaining:

public static class MemoryStreamExtensions
{
    public static void Clear(this MemoryStream stream)
    {
        stream.SetLength(0);
    }

    public static int Remaining(this MemoryStream stream)
    {
        return stream.Length - stream.Position;
    }
}
Thomas Levesque
  • 286,951
  • 70
  • 623
  • 758
3

MemoryStream should have everything you are looking for. Combined with BinaryWriter to write different data types.

var ms = new MemoryStream();
ms.SetLength(100);

long remaining = ms.Length - ms.Position; //remaining()

byte[] array = ms.ToArray(); //array()

ms.SetLength(0); //clear()

ms.Write(buffer, index, count); //put(byte[], int, int)
Will
  • 10,013
  • 9
  • 45
  • 77
-4

Are you looking for a Queue<T>?

http://msdn.microsoft.com/en-us/library/7977ey2c.aspx

For some of the methods that Queue doesn't support, it might be easy enough to write a custom class that wraps a Queue.

Kendall Frey
  • 43,130
  • 20
  • 110
  • 148