myvar = ENV[‘MY_VAR’] || ‘foobar’ N.B. This is slightly incorrect (if the hash can contain the value nil) but since ENV contains just strings it is probably good enough.
An example : import ( “crypto/sha1” “encoding/base64” ) func (ms *MapServer) storee(bv []byte) { hasher := sha1.New() hasher.Write(bv) sha := base64.URLEncoding.EncodeToString(hasher.Sum(nil)) … } In this example I make a sha from a byte array. You can get the byte array using bv := []byte(myPassword) Of course you don’t need to encode it in base64 if … Read more
Just try it: >>> hash((1,2,3)) 2528502973977326415 >>> hash([1,2,3]) Traceback (most recent call last): File “<stdin>”, line 1, in <module> TypeError: unhashable type: ‘list’ >>> hash(frozenset((1,2,3))) -7699079583225461316 >>> hash(set((1,2,3))) Traceback (most recent call last): File “<stdin>”, line 1, in <module> TypeError: unhashable type: ‘set’ So you can get hash of tuple and frozenset since the are … Read more
Here’s a straight forward implementation of the md5sum command that computes and displays the MD5 of the file specified on the command-line. It needs to be linked against the OpenSSL library (gcc md5.c -o md5 -lssl) to work. It’s pure C, but you should be able to adapt it to your C++ application easily enough. … Read more
What you describe is called a collision. Collisions necessarily exist, since SHA-1 accepts many more distinct messages as input that it can produce distinct outputs (SHA-1 may eat any string of bits up to 2^64 bits, but outputs only 160 bits; thus, at least one output value must pop up several times). This observation is … Read more
You can have it cleaner, clearer and faster, all at once! Like this: h.sort_by {|k,v| v}.reverse I benchmarked timings on 3000 iterations of sorting a 1000-element hash with random values, and got these times: h.sort {|x,y| -(x[1]<=>y[1])} — 16.7s h.sort {|x,y| y[1] <=> x[1]} — 12.3s h.sort_by {|k,v| -v} — 5.9s h.sort_by {|k,v| v}.reverse — … Read more
%hash = map { $_ => 1 } @array; It’s not as short as the “@hash{@array} = …” solutions, but those ones require the hash and array to already be defined somewhere else, whereas this one can take an anonymous array and return an anonymous hash. What this does is take each element in the … Read more
Here is a simple approach with a 256 bit image-hash (MD5 has 128 bit) resize the picture to 16×16 pixel reduce colors to black/white (which equals true/false in this console output) read the boolean values into List<bool> – this is the hash Code: public static List<bool> GetHash(Bitmap bmpSource) { List<bool> lResult = new List<bool>(); //create … Read more
You can use Digest::MD5 from the Ruby standard library for this. irb(main):001:0> require ‘digest/md5’ => true irb(main):002:0> Digest::MD5.hexdigest(‘foobar’) => “3858f62230ac3c915f300c664312c63f” And one more thing: MD5 is a hash algorithm. You don’t “encrypt” anything with a hash algorithm.
Thanks for michalk’s comment. The short answer is: The “digest” is a hash of the manifest, introduced in Docker registry v2. The image ID is a hash of the local image JSON configuration.