GabrielTofvesson/MLAPI
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added allocating Finalize overload to BitWriter

Browse Source
This commit is contained in:
Albin Corén 2018-04-14 09:08:18 +01:00
parent 8e84391710
commit a588584673
1 changed files with 21 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
MLAPI/NetworkingManagerComponents/Binary/BitWriter.cs
View File

@ -1,6 +1,5 @@
using System; using System;
using System.Collections.Generic; using System.Collections.Generic;
using System.Diagnostics;
using System.Reflection; using System.Reflection;
using System.Runtime.InteropServices; using System.Runtime.InteropServices;
using System.Text; using System.Text;
@ -114,6 +113,26 @@ namespace MLAPI.NetworkingManagerComponents.Binary
foreach (T t1 in t) Push(signed ? (object)ZigZagEncode(t1 as long? ?? t1 as int? ?? t1 as short? ?? t1 as sbyte? ?? 0, size) : (object)t1); foreach (T t1 in t) Push(signed ? (object)ZigZagEncode(t1 as long? ?? t1 as int? ?? t1 as short? ?? t1 as sbyte? ?? 0, size) : (object)t1);
} }
public byte[] Finalize()
{
long bitCount = 0;
for (int i = 0; i < collect.Count; ++i) bitCount += collect[i] == null ? (8 - (bitCount % 8)) % 8 : GetBitCount(collect[i]);
byte[] buffer = new byte[((bitCount / 8) + (bitCount % 8 == 0 ? 0 : 1))];
long bitOffset = 0;
bool isAligned = true;
foreach (var item in collect)
if (item == null)
{
bitOffset += (8 - (bitOffset % 8)) % 8;
isAligned = true;
}
else Serialize(item, buffer, ref bitOffset, ref isAligned);
return buffer;
}
//The ref is not needed. It's purley there to indicate that it's treated as a reference inside the method.
public long Finalize(ref byte[] buffer) public long Finalize(ref byte[] buffer)
{ {
if(buffer == null) if(buffer == null)
@ -145,7 +164,7 @@ namespace MLAPI.NetworkingManagerComponents.Binary
public long GetFinalizeSize() public long GetFinalizeSize()
{ {
long bitCount = 0; long bitCount = 0;
for (int i = 0; i < collect.Count; ++i) bitCount += collect[i]==null ? (8 - (bitCount % 8)) % 8 : GetBitCount(collect[i]); for (int i = 0; i < collect.Count; ++i) bitCount += collect[i] == null ? (8 - (bitCount % 8)) % 8 : GetBitCount(collect[i]);
return ((bitCount / 8) + (bitCount % 8 == 0 ? 0 : 1)); return ((bitCount / 8) + (bitCount % 8 == 0 ? 0 : 1));
} }