private int getIntFromBitArray(BitArray bitArray) { if (bitArray.Length > 32) throw new ArgumentException(“Argument length shall be at most 32 bits.”); int[] array = new int[1]; bitArray.CopyTo(array, 0); return array[0]; }
Here you’ll understand it in a better way! tinyint: 1 byte, -128 to +127 / 0 to 255 (unsigned) smallint: 2 bytes, -32,768 to +32,767 / 0 to 65,535 (unsigned) mediumint: 3 bytes, -8,388,608 to 8,388,607 / 0 to 16,777,215 (unsigned) int/integer: 4 bytes, -2,147,483,648 to +2,147,483,647 / 0 to 4,294,967,295 (unsigned) bigint: 8 bytes, … Read more
If you want to mix Boolean and Int operation use an implicit as above but without creating a class: implicit def bool2int(b:Boolean) = if (b) 1 else 0 scala> false:Int res4: Int = 0 scala> true:Int res5: Int = 1 scala> val b=true b: Boolean = true scala> 2*b+1 res2: Int = 3
It’s simple. On the sender side, use Intent.putExtra: Intent myIntent = new Intent(A.this, B.class); myIntent.putExtra(“intVariableName”, intValue); startActivity(myIntent); On the receiver side, use Intent.getIntExtra: Intent mIntent = getIntent(); int intValue = mIntent.getIntExtra(“intVariableName”, 0);
No, the constant pool for numbers doesn’t work the same way as for strings. For strings, only compile-time constants are interned – whereas for the wrapper types for integer types, any boxing operation will always use the pool if it’s applicable for that value. So for example: int x = 10; int y = x … Read more
Using itertools.groupby() produces a concise but tricky implementation: import itertools def ranges(i): for a, b in itertools.groupby(enumerate(i), lambda pair: pair[1] – pair[0]): b = list(b) yield b[0][1], b[-1][1] print(list(ranges([0, 1, 2, 3, 4, 7, 8, 9, 11]))) Output: [(0, 4), (7, 9), (11, 11)]
Math.addExact throws exception on overflow Since Java 8 there is a set of methods in the Math class: toIntExact(long) addExact(int,int) subtractExact(int,int) multiplyExact(int,int) …and versions for long as well. Each of these methods throws ArithmeticException if overflow happens. Otherwise they return the proper result if it fits within the range. Example of addition: int x = … Read more
From this reference: An int was originally intended to be the “natural” word size of the processor. Many modern processors can handle different word sizes with equal ease. Also, this bit: On many (but not all) C and C++ implementations, a long is larger than an int. Today’s most popular desktop platforms, such as Windows … Read more
if(n > 0) return Math.ceil(n/3.0) * 3; else if( n < 0) return Math.floor(n/3.0) * 3; else return 3;
You could use a Regex to check that it is “^[01]+$” (or better, “^[01]{1,32}$”), and then use Convert? of course, exceptions are unlikely to be a huge problem anyway! Inelegant? maybe. But they work. Example (formatted for vertical space): static readonly Regex binary = new Regex(“^[01]{1,32}$”, RegexOptions.Compiled); static void Main() { Test(“”); Test(“01101”); Test(“123”); Test(“0110101101010110101010101010001010100011010100101010”); … Read more