Can anyone explain what this c# code does or give a C equalivent?

  • Context: C# 
  • Thread starter Thread starter hadi amiri 4
  • Start date Start date
  • Tags Tags
    Code Explain
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
5 replies · 2K views
hadi amiri 4
Messages
98
Reaction score
1
C# vs c !

Hello every body!

can anyone explain what this c# code does or give a C equalivent?

public static void Replace(ref byte b, int pos,
byte value)
{
b = (byte) (value == 1 ? b | (1 << pos)
: b & ~(1 << pos));
}

public static byte Extract(byte b, int pos) {
return (byte) ((b & (1 << pos)) >> pos);
}
 
Physics news on Phys.org


can anyone explain what this c# code does or give a C equalivent?

The C code is essentially identical to the C# code given. Just replace the "byte" type with "char", and change the first parameter of Replace from a reference to a pointer.
 


If you want to understand this I suggest you google "bitwise operator". These are the |, &, ~ sort of operators and the C bitwise operators are the same in C#.
 


These two functions are used for empadding and extracting the bits from a byte ,they are used for steganography with LSB method in 24-bit .bmp pics,i just wanted to kmow that how they work ,i mean with some examples.can anyone help?:biggrin:
 


Well they're just simple functions to treat a byte like an array of bits and get or set single bit values out. So if you say Replace(ref x, 4, 1) you are setting the 5th most significant bit of the x variable with "1".

Extract(b,pos) in english says shift a 1 value up by pos, bitwise-and the result by b, then shift the value back down by pos (so that the only possible end results are 0 and 1). Replace(b,pos,value) says take the value referenced as b and if the value is 1 then bitwise-or the value by 1 shifted up by pos, otherwise bitwise-and with a mask which is the NOT of 1-shifted-up-by-pos. This is all pretty basic stuff so again I urge you to read up on bitwise arithmetic. Basically any introduction to the subject will cover the stuff happening in these functions.