It depends The right answer is it depends. If you are writing audio/video data for instance, if you crowbar it into a human readable format, it won’t be very readable! And word documents are the classic example where people have wished they were human readable, so more flexible, and by moving to XML MS are … Read more
The solution that fully meets my needs would be SHC – a free tool, or CCsh a commercial tool. Both compile shell scripts to C, which then can be compiled using a C compiler. Links about SHC: https://github.com/neurobin/shc http://www.datsi.fi.upm.es/~frosal/ http://www.downloadplex.com/Linux/System-Utilities/Shell-Tools/Download-shc_70414.html Links about CCsh: http://www.comeaucomputing.com/faqs/ccshlit.html
Just check the bits in turn: List<Integer> bits(int num) { List<Integer> setBits = new ArrayList<>(); for (int i = 1; num != 0; ++i, num >>>= 1) { if ((num & 1) != 0) setBits.add(i); } return setBits; } Online Demo 6 [2, 3] 7 [1, 2, 3] 8 [4]
So, as a response to comments. The correct way to store a 36-char UUID as binary(16) is to perform the insert in a manner like: INSERT INTO sometable (UUID) VALUES (UNHEX(REPLACE(“3f06af63-a93c-11e4-9797-00505690773f”, “-“,””))) UNHEX because an UUID is already a hexed value. We trim (REPLACE) the dashes in the statement to bring the length down to … Read more
Binary collation compares your string exactly as strcmp() in C would do, if characters are different (be it just case or diacritics difference). The downside of it that the sort order is not natural. An example of unnatural sort order (as in “binary” is) : A,B,a,b Natural sort order would be in this case e.g … Read more
In university I learned it this way: Multiply by two take decimal as the digit take the fraction as the starting point for the next step repeat until you either get to 0 or a periodic number read the number starting from the top – the first result is the first digit after the comma … 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
Just change your code to: string yourByteString = Convert.ToString(byteArray[20], 2).PadLeft(8, ‘0’); // produces “00111111”
There’s a method called Markov Chains. Scan a few model files of both kinds and for each byte value from 0 to 255 gather stats (basically probability) of a subsequent value. This will give you a 64Kb (256×256) profile you can compare your runtime files against (within a % threshold). Supposedly, this is how browsers’ … Read more
It works best if you provide a mask. That way you specify how far to sign extend. >>> bin(-27 & 0b1111111111111111) ‘0b1111111111100101’ Or perhaps more generally: def bindigits(n, bits): s = bin(n & int(“1″*bits, 2))[2:] return (“{0:0>%s}” % (bits)).format(s) >>> print bindigits(-31337, 24) 111111111000010110010111 In basic theory, the actual width of the number is a … Read more