How about this. Of course the arguments and return types of DoSomething, etc., can be anything you like. class Program { [Flags] public enum CheckType { Form = 1, QueryString = 2, TempData = 4, } private static bool DoSomething(IEnumerable cln) { Console.WriteLine(“DoSomething”); return true; } private static bool DoSomethingElse(IEnumerable cln) { Console.WriteLine(“DoSomethingElse”); return true; … Read more
Editor’s note: this is not actually what compilers do, and gives the wrong answer for large positive integers ending with 9, starting with div10(1073741829) = 107374183 not 107374182 (Godbolt). It is exact for inputs smaller than 0x40000005, though, which may be sufficient for some uses. Compilers (including MSVC) do use fixed-point multiplicative inverses for constant … Read more
What you are seeing is a marketing stunt. Since non-technical people don’t know the difference between Metric Meg, Gig, etc. against the binary Meg, Gig, etc. marketers for storage will use the Metric calculation, thus 1000 Bytes == 1 KiloByte. This can cause issues with development or highly technical people so you get the idea … Read more
The reason why you can’t see it in terminal is because bit values are non printable characters. Lets insert following values: INSERT INTO `my_table` (`ID`, `enabled`) VALUES (1,b’1′),(2,b’0′); Then select them to file: mysql> SELECT * FROM my_table INTO OUTFILE ‘/tmp/my_table.txt’ FIELDS TERMINATED BY ‘,’ ENCLOSED BY ‘”‘ LINES TERMINATED BY ‘\n’; First lets view … Read more
Let me assume that negative value is represented using two’s complement. In this case, -i can be calculated as (~i)+1 (flip bits, then add 1). For example, let me consider i = 44. Then, in binary, i = 0000 0000 0000 0000 0000 0000 0010 1100 ~i = 1111 1111 1111 1111 1111 1111 1101 … Read more
This method will generate all integers with exactly N ‘1’ bits. From https://graphics.stanford.edu/~seander/bithacks.html#NextBitPermutation Compute the lexicographically next bit permutation Suppose we have a pattern of N bits set to 1 in an integer and we want the next permutation of N 1 bits in a lexicographical sense. For example, if N is 3 and the … Read more
The standard way to do division is by implementing binary long-division. This involves subtraction, so as long as you don’t discount this as not a bit-wise operation, then this is what you should do. (Note that you can of course implement subtraction, very tediously, using bitwise logical operations.) In essence, if you’re doing Q = … Read more
The ~ unary operator is bitwise negation. If you need fewer bits than what fits in an int then you’ll need to mask it with & after the fact.
In python 2.7+ there is a int.bit_length() method: >>> a = 100 >>> a.bit_length() 7
Using bitwise operations on strings (characters) Convert letter to lowercase: OR by space => (x | ‘ ‘) Result is always lowercase even if letter is already lowercase eg. (‘a’ | ‘ ‘) => ‘a’ ; (‘A’ | ‘ ‘) => ‘a’ Convert letter to uppercase: AND by underline => (x & ‘_’) Result is always … Read more