You can use `Digest::MD5` from the Ruby standard library for this.

    irb(main):001:0&gt; require &#39;digest/md5&#39;
    =&gt; true
    irb(main):002:0&gt; Digest::MD5.hexdigest(&#39;foobar&#39;)
    =&gt; &quot;3858f62230ac3c915f300c664312c63f&quot;

And one more thing: MD5 is a hash algorithm. You don&#39;t &quot;encrypt&quot; anything with a hash algorithm.

I&#39;m using Python 2.6 on Linux. What is the fastest way:

* to determine which partition contains a given directory or file?
  
  For example, suppose that `/dev/sda2` is mounted on `/home`, and `/dev/mapper/foo` is mounted on `/home/foo`. From the string `&quot;/home/foo/bar/baz&quot;` I would like to recover the pair `(&quot;/dev/mapper/foo&quot;, &quot;home/foo&quot;)`.

* and then, to get usage statistics of the given partition? For example, given `/dev/mapper/foo` I would like to obtain the size of the partition and the free space available (either in bytes or approximately in megabytes).

Find size and free space of the filesystem containing a given file

I&#39;m looking for the documentation of all the syntax and built-in functions in C, but I can&#39;t find any site online which seems like an **ultimate official source of standard C knowledge**.

Apart from the [famous book by Kernighan and Ritchie][1], isn&#39;t there any online C specification? Maybe there is, and I don&#39;t know how to find it. Or maybe the problem is that I don&#39;t exactly know what I&#39;m looking for.


  [1]: http://en.wikipedia.org/wiki/The_C_Programming_Language_%28book%29

Is there something like the official C documentation?

How can I encrypt a string with MD5 in Rails 3.0 ?
`pass = MD5.hexdigest(pass)`  in a model yields `uninitialized constant MyModel::MD5`



RoR - MD5 generation

<p>How can I encrypt a string with MD5 in Rails 3.0 ?
<code>pass = MD5.hexdigest(pass)</code>  in a model yields <code>uninitialized constant MyModel::MD5</code></p>


I&#39;ve installed RubyInstaller on Windows and I&#39;m running [IMAP Sync][1] but I need to use it to sync hundreds of accounts. If I could pass these variables to it via command line I could automate the whole process better.


    # Source server connection info.
    SOURCE_NAME = &#39;username@example.com&#39;
    SOURCE_HOST = &#39;mail.example.com&#39;
    SOURCE_PORT = 143
    SOURCE_SSL  = false
    SOURCE_USER = &#39;username&#39;
    SOURCE_PASS = &#39;password&#39;
    
    # Destination server connection info.
    DEST_NAME = &#39;username@gmail.com&#39;
    DEST_HOST = &#39;imap.gmail.com&#39;
    DEST_PORT = 993
    DEST_SSL  = true
    DEST_USER = &#39;username@gmail.com&#39;
    DEST_PASS = &#39;password&#39;




  [1]: http://wonko.com/post/ruby_script_to_sync_email_from_any_imap_server_to_gmail


Pass variables to Ruby script via command line

Using Mongoid. Unfortunately, Mongoid does not allow for selecting unique / distinct! 
Have gotten these results. As you can see, there are 7 results. If you look carefully (at user_id), there are only 2 users.

    [
      #&lt;Activity _id: 4cea6c4572357e00fa00011a, created_at: 2010-11-22 13:12:37 UTC, updated_at: 2010-11-22 13:12:37 UTC, action: &quot;Attend&quot;, user_id: BSON::ObjectId(&#39;4cea2fb872357e00fa000025&#39;), artist_id: nil, media_id: BSON::ObjectId(&#39;4cea447472357e00fa00009a&#39;)&gt;, 
      #&lt;Activity _id: 4cea6c3072357e00fa000116, created_at: 2010-11-22 13:12:16 UTC, updated_at: 2010-11-22 13:12:16 UTC, action: &quot;Attend&quot;, user_id: BSON::ObjectId(&#39;4cea2fb872357e00fa000025&#39;), artist_id: nil, media_id: BSON::ObjectId(&#39;4cea447472357e00fa00009a&#39;)&gt;, 
      #&lt;Activity _id: 4cea6bdd72357e00fa00010d, created_at: 2010-11-22 13:10:53 UTC, updated_at: 2010-11-22 13:10:53 UTC, action: &quot;Attend&quot;, user_id: BSON::ObjectId(&#39;4cea2fb872357e00fa000025&#39;), artist_id: nil, media_id: BSON::ObjectId(&#39;4cea447472357e00fa00009a&#39;)&gt;, 
      #&lt;Activity _id: 4cea46df72357e00fa0000a4, created_at: 2010-11-22 10:33:03 UTC, updated_at: 2010-11-22 10:33:03 UTC, action: &quot;Attend&quot;, user_id: BSON::ObjectId(&#39;4cea2fb872357e00fa000025&#39;), artist_id: nil, media_id: BSON::ObjectId(&#39;4cea447472357e00fa00009a&#39;)&gt;, 
      #&lt;Activity _id: 4cea40c572357e00fa00006f, created_at: 2010-11-22 10:07:01 UTC, updated_at: 2010-11-22 10:07:01 UTC, action: &quot;Attend&quot;, user_id: BSON::ObjectId(&#39;4cea2fb872357e00fa000025&#39;), artist_id: nil, media_id: BSON::ObjectId(&#39;4cea3c8b72357e00fa00005e&#39;)&gt;, 
      #&lt;Activity _id: 4cea3ca172357e00fa000062, created_at: 2010-11-22 09:49:21 UTC, updated_at: 2010-11-22 09:49:21 UTC, action: &quot;Attend&quot;, user_id: BSON::ObjectId(&#39;4cea39b772357e00fa000046&#39;), artist_id: nil, media_id: BSON::ObjectId(&#39;4cea3c8b72357e00fa00005e&#39;)&gt;, 
      #&lt;Activity _id: 4cea344a72357e00fa00003f, created_at: 2010-11-22 09:13:46 UTC, updated_at: 2010-11-22 09:13:46 UTC, action: &quot;Attend&quot;, user_id: BSON::ObjectId(&#39;4cea2fb872357e00fa000025&#39;), artist_id: nil, media_id: BSON::ObjectId(&#39;4cea306c72357e00fa000031&#39;)&gt;
    ] 

I was looking at [this][1], and was thinking I could do something similar so that my array would now look like this:

    [
      #&lt;Activity _id: 4cea6c4572357e00fa00011a, created_at: 2010-11-22 13:12:37 UTC, updated_at: 2010-11-22 13:12:37 UTC, action: &quot;Attend&quot;, user_id: BSON::ObjectId(&#39;4cea2fb872357e00fa000025&#39;), artist_id: nil, media_id: BSON::ObjectId(&#39;4cea447472357e00fa00009a&#39;)&gt;, 
      #&lt;Activity _id: 4cea3ca172357e00fa000062, created_at: 2010-11-22 09:49:21 UTC, updated_at: 2010-11-22 09:49:21 UTC, action: &quot;Attend&quot;, user_id: BSON::ObjectId(&#39;4cea39b772357e00fa000046&#39;), artist_id: nil, media_id: BSON::ObjectId(&#39;4cea3c8b72357e00fa00005e&#39;)&gt;
    ]

I&#39;m not concerned which combination of results are extracted. As long as I have unique user_id&#39;s in the result set. Anyone know how this can be achieved?

  [1]: https://stackoverflow.com/questions/181091/how-do-i-get-the-unique-elements-from-an-array-of-hashes-in-ruby

How do I get unique elements in this array?

How is the conditional operator (`? :`) used in Ruby?

For example, is this correct?

    &lt;% question = question.size &gt; 20 ? question.question.slice(0, 20)+&quot;...&quot; : question.question %&gt;

How do I use the conditional operator (? :) in Ruby?

My input hash: `h = { &quot;a&quot; =&gt; 20, &quot;b&quot; =&gt; 30, &quot;c&quot; =&gt; 10 }`


Ascending sort: `h.sort {|a,b| a[1]&lt;=&gt;b[1]}   #=&gt; [[&quot;c&quot;, 10], [&quot;a&quot;, 20], [&quot;b&quot;, 30]]`


But, I need `[[&quot;b&quot;, 30], [&quot;a&quot;, 20], [&quot;c&quot;, 10]]`

How is can we make it work the other way around, what does `&lt;=&gt;` mean?

Descending sort by value of a Hash in Ruby

How do I describe an enumeration column in a Rails 3 migration?

I need a reversible hash function (obviously the input will be much smaller in size than the output) that maps the input to the output in a random-looking way. Basically, I want a way to transform a number like &quot;123&quot; to a larger number like &quot;9874362483910978&quot;, but not in a way that will preserve comparisons, so it must not be always true that, if x1 &gt; x2, f(x1) &gt; f(x2) (but neither must it be always false).

The use case for this is that I need to find a way to transform small numbers into larger, random-looking ones. They don&#39;t actually need to be random (in fact, they need to be deterministic, so the same input always maps to the same output), but they do need to *look* random (at least when base64encoded into strings, so shifting by Z bits won&#39;t work as similar numbers will have similar MSBs).

Also, easy (fast) calculation and reversal is a plus, but not required.

I don&#39;t know if I&#39;m being clear, or if such an algorithm exists, but I&#39;d appreciate any and all help!

Reversible hash function?

Is there is a way how to add hash # to my URL without redirect?


Add a fragment to the URL without causing a redirect?

Is there a method to calculate something like general &quot;similarity score&quot; of a string? In a way that I am not comparing two strings together but rather I get some number (hash) for each string that can later tell me that two strings are or are not similar. Two similar strings should have similar (close) hashes.

Let&#39;s consider these strings and scores as an example:

    Hello world                1000
    Hello world!               1010
    Hello earth                1125
    Foo bar                    3250
    FooBarbar                  3750
    Foo Bar!                   3300
    Foo world!                 2350

You can see that **Hello world!** and **Hello world** are similar and their scores are close to each other.

This way, finding the most similar strings to a given string would be done by subtracting given strings score from other scores and then sorting their absolute value.

String similarity score/hash

I&#39;m storing the user password on the db as a sha1 hash.

Unfortunately I&#39;m getting strange answers.

I&#39;m storing the string as this:

    MessageDigest cript = MessageDigest.getInstance(&quot;SHA-1&quot;);
                  cript.reset();
                  cript.update(userPass.getBytes(&quot;utf8&quot;));
                  this.password = new String(cript.digest());

I wanted something like this --&gt;

aff --&gt; &quot;0c05aa56405c447e6678b7f3127febde5c3a9238&quot;

rather than

aff --&gt; �V@\D~fx����\:�8


Java calculate hex representation of a SHA-1 digest of a String

I have a simple android client which needs to &#39;talk&#39; to a simple C# HTTP listener. I want to provide a basic level of authentication by passing username/password in POST requests.

MD5 hashing is trivial in C# and provides enough security for my needs but I can&#39;t seem to find how to do this at the android end.

EDIT: Just to address the concerns raised about MD5 weakness - the C# server runs on the PCs of the users of my android client. In many cases, they&#39;ll be accessing the server using wi-fi on their own LANs but, at their own risk, they may choose to access it from the internet. Also the service on the server needs to use pass-through for the MD5 to a 3rd party application I have no control over.

MD5 hashing in Android

In the [Flickr API docs][1], you need to find the MD5 sum of a string to generate the `[api_sig]` value.

How does one go about generating an MD5 sum from a string? 

Flickr&#39;s example:

string: `000005fab4534d05api_key9a0554259914a86fb9e7eb014e4e5d52permswrite`

MD5 sum: `a02506b31c1cd46c2e0b6380fb94eb3d`


  [1]: http://www.flickr.com/services/api/auth.howto.web.html

How to get MD5 sum of a string using python?

I want to compute an md5 hash not of a string, but of an entire data structure.  I understand the mechanics of a way to do this (dispatch on the type of the value, canonicalize dictionary key order and other randomness, recurse into sub-values, etc).  But it seems like the kind of operation that would be generally useful, so I&#39;m surprised I need to roll this myself.  

Is there some simpler way in Python to achieve this?

UPDATE: pickle has been suggested, and it&#39;s a good idea, but pickling doesn&#39;t canonicalize dictionary key order:

    &gt;&gt;&gt; import cPickle as pickle
    &gt;&gt;&gt; import hashlib, random 
    &gt;&gt;&gt; for i in range(10):
    ...  k = [i*i for i in range(1000)]
    ...  random.shuffle(k)
    ...  d = dict.fromkeys(k, 1)
    ...  p = pickle.dumps(d)
    ...  print hashlib.md5(p).hexdigest()
    ...
    51b5855799f6d574c722ef9e50c2622b
    43d6b52b885f4ecb4b4be7ecdcfbb04e
    e7be0e6d923fe1b30c6fbd5dcd3c20b9
    aebb2298be19908e523e86a3f3712207
    7db3fe10dcdb70652f845b02b6557061
    43945441efe82483ba65fda471d79254
    8e4196468769333d170b6bb179b4aee0
    951446fa44dba9a1a26e7df9083dcadf
    06b09465917d3881707a4909f67451ae
    386e3f08a3c1156edd1bd0f3862df481

Computing an md5 hash of a data structure

&gt; **Possible Duplicate:**  
&gt; [Generate a Hash from string in Javascript/jQuery](https://stackoverflow.com/questions/7616461/generate-a-hash-from-string-in-javascript-jquery)  

&lt;!-- End of automatically inserted text --&gt;

Can anyone suggest a simple (i.e. tens of lines of code, not hundreds of lines) hash function written in (browser-compatible) JavaScript?  Ideally I&#39;d like something that, when passed a string as input, produces something similar to the 32 character hexadecimal string that&#39;s the typical output of MD5, SHA1, etc.  It doesn&#39;t have to be cryptographically secure, just reasonably resistant to collisions.  (My initial use case is URLs, but I&#39;ll probably want to use it on other strings in the future.)

Simple (non-secure) hash function for JavaScript?

As I want to use Google maps in my application, I need the debug certificates&#39; MD5 fingerprint. I tried following.: 

(Here I copied the debug.keystore file from C:\Documents and Settings\Administrator\.android in bin folder)

    C:\Program Files\Java\jdk1.7.0\bin&gt;keytool -list -alias androiddebugkey -keystore debug.keystore -storepass android -keypass android

But got the following results:

    androiddebugkey, May 27, 2011, PrivateKeyEntry,Certificate fingerprint (SHA1): &quot;some code&quot;

However that is not working to get MAP API key. Is SHA1 is same as MD5?

What should I do to get the MD5 certificate?

How can I get the MD5 fingerprint from Java&#39;s keytool, not only SHA-1?

I&#39;m trying to get the SHA256 of a string in Android.

Here is the PHP code that I want to match:

    echo bin2hex(mhash(MHASH_SHA256,&quot;asdf&quot;));
    //outputs &quot;f0e4c2f76c58916ec258f246851bea091d14d4247a2fc3e18694461b1816e13b&quot;

Now, in Java, I&#39;m trying to do the following:

     
                String password=&quot;asdf&quot;
                MessageDigest digest=null;
		try {
			digest = MessageDigest.getInstance(&quot;SHA-256&quot;);
		} catch (NoSuchAlgorithmException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
	       digest.reset();
	       try {
			Log.i(&quot;Eamorr&quot;,digest.digest(password.getBytes(&quot;UTF-8&quot;)).toString());
		} catch (UnsupportedEncodingException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

But this prints out: &quot;a42yzk3axdv3k4yh98g8&quot;

What did I do wrong here?

------------------------------------------------------
Solution thanks to erickson:

     

     Log.i(&quot;Eamorr&quot;,bin2hex(getHash(&quot;asdf&quot;)));

     public byte[] getHash(String password) {
	       MessageDigest digest=null;
		try {
			digest = MessageDigest.getInstance(&quot;SHA-256&quot;);
		} catch (NoSuchAlgorithmException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
	       digest.reset();
	       return digest.digest(password.getBytes());
	 }
	static String bin2hex(byte[] data) {
		return String.format(&quot;%0&quot; + (data.length*2) + &quot;X&quot;, new BigInteger(1, data));
	}



How can I calculate the SHA-256 hash of a string in Android?

I am trying to use the library [DigestUtils][1] in Android 2.3.1 using JDK 1.6, however I get the following error when executing the app:

`Could not find method org.apache.commons.codec.binary.Hex.encodeHexString, referenced from method org.apache.commons.codec.digest.DigestUtils.shaHex`

Here you have the stacktrace:

    02-03 10:25:45.153: I/dalvikvm(1230): Could not find method org.apache.commons.codec.binary.Hex.encodeHexString, referenced from method org.apache.commons.codec.digest.DigestUtils.shaHex
    02-03 10:25:45.153: W/dalvikvm(1230): VFY: unable to resolve static method 329: Lorg/apache/commons/codec/binary/Hex;.encodeHexString ([B)Ljava/lang/String;
    02-03 10:25:45.153: D/dalvikvm(1230): VFY: replacing opcode 0x71 at 0x0004
    02-03 10:25:45.153: D/dalvikvm(1230): VFY: dead code 0x0007-0008 in Lorg/apache/commons/codec/digest/DigestUtils;.shaHex ([B)Ljava/lang/String;
    02-03 10:25:45.163: D/AndroidRuntime(1230): Shutting down VM
    02-03 10:25:45.163: W/dalvikvm(1230): threadid=1: thread exiting with uncaught exception (group=0x40015560)
    02-03 10:25:45.173: E/AndroidRuntime(1230): FATAL EXCEPTION: main
    02-03 10:25:45.173: E/AndroidRuntime(1230): java.lang.NoSuchMethodError: org.apache.commons.codec.binary.Hex.encodeHexString
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at org.apache.commons.codec.digest.DigestUtils.md5Hex(DigestUtils.java:226)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at com.caumons.trainingdininghall.ConnectionProfileActivity.onCreate(ConnectionProfileActivity.java:20)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at android.app.Instrumentation.callActivityOnCreate(Instrumentation.java:1047)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:1586)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:1638)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at android.app.ActivityThread.access$1500(ActivityThread.java:117)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at android.app.ActivityThread$H.handleMessage(ActivityThread.java:928)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at android.os.Handler.dispatchMessage(Handler.java:99)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at android.os.Looper.loop(Looper.java:123)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at android.app.ActivityThread.main(ActivityThread.java:3647)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at java.lang.reflect.Method.invokeNative(Native Method)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at java.lang.reflect.Method.invoke(Method.java:507)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:839)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:597)
    02-03 10:25:45.173: E/AndroidRuntime(1230):     at dalvik.system.NativeStart.main(Native Method)

The line of code which causes the exception is:

`String hash = DigestUtils.shaHex(&quot;textToHash&quot;);`

I have executed the same code in a Java class outside Android and it works! So, I do not know why when working with Android it does not work... I put the libraty inside a new libs/ folder in my app and updated the BuildPath to use it. If I try to use md5 instead of sha1 I get the same exception. Any help would be appreciated! Thank you.

**UPDATE:**

As this is a very active question, I&#39;ve changed the accepted answer in favour of @DA25, as his solution is straightforward and the high number of upvotes prove that it works.

  [1]: http://commons.apache.org/codec/apidocs/org/apache/commons/codec/digest/DigestUtils.html

Method not found using DigestUtils in Android

I have written a simple Java class to generate the hash values of the Windows Calculator file.  I am using `Windows 7 Professional with SP1`.  I have tried `Java 6.0.29` and `Java 7.0.03`.  Can someone tell me why I am getting different hash values from Java versus (many!) external utilities and/or websites?  Everything external matches with each other, only Java is returning different results.

    import java.io.File;
    import java.io.FileInputStream;
    import java.io.FileNotFoundException;
    import java.io.IOException;
    import java.util.LinkedHashMap;
    import java.util.Map;
    import java.util.Map.Entry;
    import java.util.zip.CRC32;
    import java.security.DigestInputStream;
    import java.security.MessageDigest;
    import java.security.NoSuchAlgorithmException;
    
    public class Checksum 
    {
        private static int size = 65536;
        private static File calc = new File(&quot;C:/Windows/system32/calc.exe&quot;);
    
        /*
            C:\Windows\System32\calc.exe (verified via several different utilities)
            ----------------------------
            CRC-32b = 8D8F5F8E
            MD5     = 60B7C0FEAD45F2066E5B805A91F4F0FC
            SHA-1   = 9018A7D6CDBE859A430E8794E73381F77C840BE0
            SHA-256 = 80C10EE5F21F92F89CBC293A59D2FD4C01C7958AACAD15642558DB700943FA22
            SHA-384 = 551186C804C17B4CCDA07FD5FE83A32B48B4D173DAC3262F16489029894FC008A501B50AB9B53158B429031B043043D2
            SHA-512 = 68B9F9C00FC64DF946684CE81A72A2624F0FC07E07C0C8B3DB2FAE8C9C0415BD1B4A03AD7FFA96985AF0CC5E0410F6C5E29A30200EFFF21AB4B01369A3C59B58
        
    
            Results from this class
            -----------------------
            CRC-32  = 967E5DDE
            MD5     = 10E4A1D2132CCB5C6759F038CDB6F3C9
            SHA-1   = 42D36EEB2140441B48287B7CD30B38105986D68F
            SHA-256 = C6A91CBA00BF87CDB064C49ADAAC82255CBEC6FDD48FD21F9B3B96ABF019916B    
        */    
    
        public static void main(String[] args)throws Exception {
            Map&lt;String, String&gt; hashes = getFileHash(calc);
            for (Map.Entry&lt;String, String&gt; entry : hashes.entrySet()) {
                System.out.println(String.format(&quot;%-7s = %s&quot;, entry.getKey(), entry.getValue()));
            }
        }
        
        private static Map&lt;String, String&gt; getFileHash(File file) throws NoSuchAlgorithmException, IOException {
            Map&lt;String, String&gt; results = new LinkedHashMap&lt;String, String&gt;();
    
            if (file != null &amp;&amp; file.exists()) {
                CRC32 crc32 = new CRC32();
                MessageDigest md5 = MessageDigest.getInstance(&quot;MD5&quot;);
                MessageDigest sha1 = MessageDigest.getInstance(&quot;SHA-1&quot;);
                MessageDigest sha256 = MessageDigest.getInstance(&quot;SHA-256&quot;);
                
                FileInputStream fis = new FileInputStream(file);
                byte data[] = new byte[size];
                int len = 0;
                while ((len = fis.read(data)) != -1) {
                    crc32.update(data, 0, len);
                    md5.update(data, 0, len);
                    sha1.update(data, 0, len);
                    sha256.update(data, 0, len);
                }
                fis.close();
    
                results.put(&quot;CRC-32&quot;, toHex(crc32.getValue()));
                results.put(md5.getAlgorithm(), toHex(md5.digest()));
                results.put(sha1.getAlgorithm(), toHex(sha1.digest()));
                results.put(sha256.getAlgorithm(), toHex(sha256.digest()));
            }
            return results;
        }
    
        private static String toHex(byte[] bytes) {
            String result = &quot;&quot;;
            if (bytes != null) {
                StringBuilder sb = new StringBuilder(bytes.length * 2);
                for (byte element : bytes) {
                    if ((element &amp; 0xff) &lt; 0x10) {
                        sb.append(&quot;0&quot;);
                    }
                    sb.append(Long.toString(element &amp; 0xff, 16));
                }
                result = sb.toString().toUpperCase();
            }
            return result;
        }
    
        private static String toHex(long value) {
            return Long.toHexString(value).toUpperCase();
        }
    
    }

Content Type	Original Author	Original Content on Stackoverflow
Question	Mithun Sreedharan	View Question on Stackoverflow
Solution 1 - Ruby	joschi	View Answer on Stackoverflow

RoR - MD5 generation

Ruby Problem Overview

Ruby Solutions

Solution 1 - Ruby

Is there something like the official C documentation?

Find size and free space of the filesystem containing a given file

Attributions