精华内容
下载资源
问答
  • 对比两张图片MD5

    万次阅读 2018-08-01 15:39:02
    图片上传的时候,通过对比两张图片MD5值,判断图片是否上传成功。

    图片上传的时候,通过对比两张图片的MD5值,判断图片是否上传成功。

    package com.kedacom.testdemo.javaTest;
    
    import java.io.File;
    import java.io.FileInputStream;
    import java.math.BigInteger;
    import java.security.MessageDigest;
    import java.util.HashMap;
    import java.util.Map;
    
    /**
     * @Dec :
     * @Author : Caowj
     * @Date : 2018/8/1 8:58
     */
    public class Test1 {
        /**
         * 获取单个文件的MD5值!
         *
         * @param file
         * @return
         */
        public static String getFileMD5(File file) {
            if (!file.isFile()) {
                return null;
            }
            MessageDigest digest = null;
            FileInputStream in = null;
            byte buffer[] = new byte[1024];
            int len;
            try {
                digest = MessageDigest.getInstance("MD5");
                in = new FileInputStream(file);
                while ((len = in.read(buffer, 0, 1024)) != -1) {
                    digest.update(buffer, 0, len);
                }
                in.close();
            } catch (Exception e) {
                e.printStackTrace();
                return null;
            }
            BigInteger bigInt = new BigInteger(1, digest.digest());
            String md5 = bigInt.toString(16);
            System.out.println("filePath:" + file.getPath() + "\nmd5:" + md5);
            return md5;
        }
    
        /**
         * 获取文件夹中文件的MD5值
         *
         * @param file
         * @param listChild ;true递归子目录中的文件
         * @return
         */
        public static Map<String, String> getDirMD5(File file, boolean listChild) {
            if (!file.isDirectory()) {
                return null;
            }
    //<filepath,md5>
            Map<String, String> map = new HashMap<String, String>();
            String md5;
            File files[] = file.listFiles();
            for (int i = 0; i < files.length; i++) {
                File f = files[i];
                if (f.isDirectory() && listChild) {
                    map.putAll(getDirMD5(f, listChild));
                } else {
                    md5 = getFileMD5(f);
                    if (md5 != null) {
                        map.put(f.getPath(), md5);
                    }
                }
            }
            return map;
        }
    
        public static void main(String[] args) {
    
    //        http://122.138.250.132:9900/file/ydzf/16/16000031/b64_MTYwMDAwMzFfMQ.jpg//问题图片
    
    //        String image1 = "C:\\Users\\kd\\Desktop\\b64_MTYwMDAwMzFfMQ.jpg.png";
    //        String image2 = "C:\\Users\\kd\\Desktop\\16000031_1.jpg";
    
            String image1 = "C:\\Users\\kd\\Desktop\\b64_MTYwMDAwMzFfMg.jpg";
            String image2 = "C:\\Users\\kd\\Desktop\\16000031_2.jpg";
    
            File file1 = new File(image1);
            File file2 = new File(image2);
            System.out.println(getFileMD5(file1).equals(getFileMD5(file2)));
    
            String s = file1.getPath();
            System.out.println(s);
        }
    }

    日志输出:

    filePath:C:\Users\kd\Desktop\zhcx\b64_MTYwMDAwMzFfMg.jpg
    md5:576b742dae427ab95478513744c368ad
    
    filePath:C:\Users\kd\Desktop\zhcx\16000031_2.jpg
    md5:576b742dae427ab95478513744c368ad
    true
    
    C:\Users\kd\Desktop\zhcx\b64_MTYwMDAwMzFfMg.jpg
    
    展开全文
  • 解决办法:获取图片MD5值来对比 如何使用? 1.对应页面引入对应的spark-md5.js //引入js const sMD5 = require('../../utils/spark-md5.js') //选择图片 获取图片MD5 wx.chooseImage({ success(res) { c.....

    问题: 上传同一张图片

    解决办法:获取图片MD5值来对比

    如何使用?

    1.对应页面引入对应的spark-md5.js

    //引入js
    const sMD5 = require('../../utils/spark-md5.js')
    
    
    
    //选择图片 获取图片MD5
     wx.chooseImage({
                success(res) {
                    console.log(res);
                    wx.getFileSystemManager().readFile({
                        filePath: res.tempFilePaths[0], //选择图片返回的相对路径
                        // encoding: 'binary', //编码格式
                        success: res => {
                            //成功的回调
                            console.log('data:image/png;base64,', res)
                            console.log(res.data)
                            let spark = new sMD5.ArrayBuffer();
                            spark.append(res.data);
                            let hexHash = spark.end(false);
                            console.log(hexHash)
                        }
                    })
                }
            })
    

    spark-md5.js源文件

    (function (factory) {
        if (typeof exports === 'object') {
            // Node/CommonJS
            module.exports = factory();
        } else if (typeof define === 'function' && define.amd) {
            // AMD
            define(factory);
        } else {
            // Browser globals (with support for web workers)
            var glob;
     
            try {
                glob = window;
            } catch (e) {
                glob = self;
            }
     
            glob.SparkMD5 = factory();
        }
    }(function (undefined) {
        'use strict';
     
        /*
         * Fastest md5 implementation around (JKM md5).
         * Credits: Joseph Myers
         *
         * @see http://www.myersdaily.org/joseph/javascript/md5-text.html
         * @see http://jsperf.com/md5-shootout/7
         */
     
        /* this function is much faster,
          so if possible we use it. Some IEs
          are the only ones I know of that
          need the idiotic second function,
          generated by an if clause.  */
        var add32 = function (a, b) {
            return (a + b) & 0xFFFFFFFF;
        },
            hex_chr = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'];
     
     
        function cmn(q, a, b, x, s, t) {
            a = add32(add32(a, q), add32(x, t));
            return add32((a << s) | (a >>> (32 - s)), b);
        }
     
        function md5cycle(x, k) {
            var a = x[0],
                b = x[1],
                c = x[2],
                d = x[3];
     
            a += (b & c | ~b & d) + k[0] - 680876936 | 0;
            a  = (a << 7 | a >>> 25) + b | 0;
            d += (a & b | ~a & c) + k[1] - 389564586 | 0;
            d  = (d << 12 | d >>> 20) + a | 0;
            c += (d & a | ~d & b) + k[2] + 606105819 | 0;
            c  = (c << 17 | c >>> 15) + d | 0;
            b += (c & d | ~c & a) + k[3] - 1044525330 | 0;
            b  = (b << 22 | b >>> 10) + c | 0;
            a += (b & c | ~b & d) + k[4] - 176418897 | 0;
            a  = (a << 7 | a >>> 25) + b | 0;
            d += (a & b | ~a & c) + k[5] + 1200080426 | 0;
            d  = (d << 12 | d >>> 20) + a | 0;
            c += (d & a | ~d & b) + k[6] - 1473231341 | 0;
            c  = (c << 17 | c >>> 15) + d | 0;
            b += (c & d | ~c & a) + k[7] - 45705983 | 0;
            b  = (b << 22 | b >>> 10) + c | 0;
            a += (b & c | ~b & d) + k[8] + 1770035416 | 0;
            a  = (a << 7 | a >>> 25) + b | 0;
            d += (a & b | ~a & c) + k[9] - 1958414417 | 0;
            d  = (d << 12 | d >>> 20) + a | 0;
            c += (d & a | ~d & b) + k[10] - 42063 | 0;
            c  = (c << 17 | c >>> 15) + d | 0;
            b += (c & d | ~c & a) + k[11] - 1990404162 | 0;
            b  = (b << 22 | b >>> 10) + c | 0;
            a += (b & c | ~b & d) + k[12] + 1804603682 | 0;
            a  = (a << 7 | a >>> 25) + b | 0;
            d += (a & b | ~a & c) + k[13] - 40341101 | 0;
            d  = (d << 12 | d >>> 20) + a | 0;
            c += (d & a | ~d & b) + k[14] - 1502002290 | 0;
            c  = (c << 17 | c >>> 15) + d | 0;
            b += (c & d | ~c & a) + k[15] + 1236535329 | 0;
            b  = (b << 22 | b >>> 10) + c | 0;
     
            a += (b & d | c & ~d) + k[1] - 165796510 | 0;
            a  = (a << 5 | a >>> 27) + b | 0;
            d += (a & c | b & ~c) + k[6] - 1069501632 | 0;
            d  = (d << 9 | d >>> 23) + a | 0;
            c += (d & b | a & ~b) + k[11] + 643717713 | 0;
            c  = (c << 14 | c >>> 18) + d | 0;
            b += (c & a | d & ~a) + k[0] - 373897302 | 0;
            b  = (b << 20 | b >>> 12) + c | 0;
            a += (b & d | c & ~d) + k[5] - 701558691 | 0;
            a  = (a << 5 | a >>> 27) + b | 0;
            d += (a & c | b & ~c) + k[10] + 38016083 | 0;
            d  = (d << 9 | d >>> 23) + a | 0;
            c += (d & b | a & ~b) + k[15] - 660478335 | 0;
            c  = (c << 14 | c >>> 18) + d | 0;
            b += (c & a | d & ~a) + k[4] - 405537848 | 0;
            b  = (b << 20 | b >>> 12) + c | 0;
            a += (b & d | c & ~d) + k[9] + 568446438 | 0;
            a  = (a << 5 | a >>> 27) + b | 0;
            d += (a & c | b & ~c) + k[14] - 1019803690 | 0;
            d  = (d << 9 | d >>> 23) + a | 0;
            c += (d & b | a & ~b) + k[3] - 187363961 | 0;
            c  = (c << 14 | c >>> 18) + d | 0;
            b += (c & a | d & ~a) + k[8] + 1163531501 | 0;
            b  = (b << 20 | b >>> 12) + c | 0;
            a += (b & d | c & ~d) + k[13] - 1444681467 | 0;
            a  = (a << 5 | a >>> 27) + b | 0;
            d += (a & c | b & ~c) + k[2] - 51403784 | 0;
            d  = (d << 9 | d >>> 23) + a | 0;
            c += (d & b | a & ~b) + k[7] + 1735328473 | 0;
            c  = (c << 14 | c >>> 18) + d | 0;
            b += (c & a | d & ~a) + k[12] - 1926607734 | 0;
            b  = (b << 20 | b >>> 12) + c | 0;
     
            a += (b ^ c ^ d) + k[5] - 378558 | 0;
            a  = (a << 4 | a >>> 28) + b | 0;
            d += (a ^ b ^ c) + k[8] - 2022574463 | 0;
            d  = (d << 11 | d >>> 21) + a | 0;
            c += (d ^ a ^ b) + k[11] + 1839030562 | 0;
            c  = (c << 16 | c >>> 16) + d | 0;
            b += (c ^ d ^ a) + k[14] - 35309556 | 0;
            b  = (b << 23 | b >>> 9) + c | 0;
            a += (b ^ c ^ d) + k[1] - 1530992060 | 0;
            a  = (a << 4 | a >>> 28) + b | 0;
            d += (a ^ b ^ c) + k[4] + 1272893353 | 0;
            d  = (d << 11 | d >>> 21) + a | 0;
            c += (d ^ a ^ b) + k[7] - 155497632 | 0;
            c  = (c << 16 | c >>> 16) + d | 0;
            b += (c ^ d ^ a) + k[10] - 1094730640 | 0;
            b  = (b << 23 | b >>> 9) + c | 0;
            a += (b ^ c ^ d) + k[13] + 681279174 | 0;
            a  = (a << 4 | a >>> 28) + b | 0;
            d += (a ^ b ^ c) + k[0] - 358537222 | 0;
            d  = (d << 11 | d >>> 21) + a | 0;
            c += (d ^ a ^ b) + k[3] - 722521979 | 0;
            c  = (c << 16 | c >>> 16) + d | 0;
            b += (c ^ d ^ a) + k[6] + 76029189 | 0;
            b  = (b << 23 | b >>> 9) + c | 0;
            a += (b ^ c ^ d) + k[9] - 640364487 | 0;
            a  = (a << 4 | a >>> 28) + b | 0;
            d += (a ^ b ^ c) + k[12] - 421815835 | 0;
            d  = (d << 11 | d >>> 21) + a | 0;
            c += (d ^ a ^ b) + k[15] + 530742520 | 0;
            c  = (c << 16 | c >>> 16) + d | 0;
            b += (c ^ d ^ a) + k[2] - 995338651 | 0;
            b  = (b << 23 | b >>> 9) + c | 0;
     
            a += (c ^ (b | ~d)) + k[0] - 198630844 | 0;
            a  = (a << 6 | a >>> 26) + b | 0;
            d += (b ^ (a | ~c)) + k[7] + 1126891415 | 0;
            d  = (d << 10 | d >>> 22) + a | 0;
            c += (a ^ (d | ~b)) + k[14] - 1416354905 | 0;
            c  = (c << 15 | c >>> 17) + d | 0;
            b += (d ^ (c | ~a)) + k[5] - 57434055 | 0;
            b  = (b << 21 |b >>> 11) + c | 0;
            a += (c ^ (b | ~d)) + k[12] + 1700485571 | 0;
            a  = (a << 6 | a >>> 26) + b | 0;
            d += (b ^ (a | ~c)) + k[3] - 1894986606 | 0;
            d  = (d << 10 | d >>> 22) + a | 0;
            c += (a ^ (d | ~b)) + k[10] - 1051523 | 0;
            c  = (c << 15 | c >>> 17) + d | 0;
            b += (d ^ (c | ~a)) + k[1] - 2054922799 | 0;
            b  = (b << 21 |b >>> 11) + c | 0;
            a += (c ^ (b | ~d)) + k[8] + 1873313359 | 0;
            a  = (a << 6 | a >>> 26) + b | 0;
            d += (b ^ (a | ~c)) + k[15] - 30611744 | 0;
            d  = (d << 10 | d >>> 22) + a | 0;
            c += (a ^ (d | ~b)) + k[6] - 1560198380 | 0;
            c  = (c << 15 | c >>> 17) + d | 0;
            b += (d ^ (c | ~a)) + k[13] + 1309151649 | 0;
            b  = (b << 21 |b >>> 11) + c | 0;
            a += (c ^ (b | ~d)) + k[4] - 145523070 | 0;
            a  = (a << 6 | a >>> 26) + b | 0;
            d += (b ^ (a | ~c)) + k[11] - 1120210379 | 0;
            d  = (d << 10 | d >>> 22) + a | 0;
            c += (a ^ (d | ~b)) + k[2] + 718787259 | 0;
            c  = (c << 15 | c >>> 17) + d | 0;
            b += (d ^ (c | ~a)) + k[9] - 343485551 | 0;
            b  = (b << 21 | b >>> 11) + c | 0;
     
            x[0] = a + x[0] | 0;
            x[1] = b + x[1] | 0;
            x[2] = c + x[2] | 0;
            x[3] = d + x[3] | 0;
        }
     
        function md5blk(s) {
            var md5blks = [],
                i; /* Andy King said do it this way. */
     
            for (i = 0; i < 64; i += 4) {
                md5blks[i >> 2] = s.charCodeAt(i) + (s.charCodeAt(i + 1) << 8) + (s.charCodeAt(i + 2) << 16) + (s.charCodeAt(i + 3) << 24);
            }
            return md5blks;
        }
     
        function md5blk_array(a) {
            var md5blks = [],
                i; /* Andy King said do it this way. */
     
            for (i = 0; i < 64; i += 4) {
                md5blks[i >> 2] = a[i] + (a[i + 1] << 8) + (a[i + 2] << 16) + (a[i + 3] << 24);
            }
            return md5blks;
        }
     
        function md51(s) {
            var n = s.length,
                state = [1732584193, -271733879, -1732584194, 271733878],
                i,
                length,
                tail,
                tmp,
                lo,
                hi;
     
            for (i = 64; i <= n; i += 64) {
                md5cycle(state, md5blk(s.substring(i - 64, i)));
            }
            s = s.substring(i - 64);
            length = s.length;
            tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
            for (i = 0; i < length; i += 1) {
                tail[i >> 2] |= s.charCodeAt(i) << ((i % 4) << 3);
            }
            tail[i >> 2] |= 0x80 << ((i % 4) << 3);
            if (i > 55) {
                md5cycle(state, tail);
                for (i = 0; i < 16; i += 1) {
                    tail[i] = 0;
                }
            }
     
            // Beware that the final length might not fit in 32 bits so we take care of that
            tmp = n * 8;
            tmp = tmp.toString(16).match(/(.*?)(.{0,8})$/);
            lo = parseInt(tmp[2], 16);
            hi = parseInt(tmp[1], 16) || 0;
     
            tail[14] = lo;
            tail[15] = hi;
     
            md5cycle(state, tail);
            return state;
        }
     
        function md51_array(a) {
            var n = a.length,
                state = [1732584193, -271733879, -1732584194, 271733878],
                i,
                length,
                tail,
                tmp,
                lo,
                hi;
     
            for (i = 64; i <= n; i += 64) {
                md5cycle(state, md5blk_array(a.subarray(i - 64, i)));
            }
     
            // Not sure if it is a bug, however IE10 will always produce a sub array of length 1
            // containing the last element of the parent array if the sub array specified starts
            // beyond the length of the parent array - weird.
            // https://connect.microsoft.com/IE/feedback/details/771452/typed-array-subarray-issue
            a = (i - 64) < n ? a.subarray(i - 64) : new Uint8Array(0);
     
            length = a.length;
            tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
            for (i = 0; i < length; i += 1) {
                tail[i >> 2] |= a[i] << ((i % 4) << 3);
            }
     
            tail[i >> 2] |= 0x80 << ((i % 4) << 3);
            if (i > 55) {
                md5cycle(state, tail);
                for (i = 0; i < 16; i += 1) {
                    tail[i] = 0;
                }
            }
     
            // Beware that the final length might not fit in 32 bits so we take care of that
            tmp = n * 8;
            tmp = tmp.toString(16).match(/(.*?)(.{0,8})$/);
            lo = parseInt(tmp[2], 16);
            hi = parseInt(tmp[1], 16) || 0;
     
            tail[14] = lo;
            tail[15] = hi;
     
            md5cycle(state, tail);
     
            return state;
        }
     
        function rhex(n) {
            var s = '',
                j;
            for (j = 0; j < 4; j += 1) {
                s += hex_chr[(n >> (j * 8 + 4)) & 0x0F] + hex_chr[(n >> (j * 8)) & 0x0F];
            }
            return s;
        }
     
        function hex(x) {
            var i;
            for (i = 0; i < x.length; i += 1) {
                x[i] = rhex(x[i]);
            }
            return x.join('');
        }
     
        // In some cases the fast add32 function cannot be used..
        if (hex(md51('hello')) !== '5d41402abc4b2a76b9719d911017c592') {
            add32 = function (x, y) {
                var lsw = (x & 0xFFFF) + (y & 0xFFFF),
                    msw = (x >> 16) + (y >> 16) + (lsw >> 16);
                return (msw << 16) | (lsw & 0xFFFF);
            };
        }
     
        // ---------------------------------------------------
     
        /**
         * ArrayBuffer slice polyfill.
         *
         * @see https://github.com/ttaubert/node-arraybuffer-slice
         */
     
        if (typeof ArrayBuffer !== 'undefined' && !ArrayBuffer.prototype.slice) {
            (function () {
                function clamp(val, length) {
                    val = (val | 0) || 0;
     
                    if (val < 0) {
                        return Math.max(val + length, 0);
                    }
     
                    return Math.min(val, length);
                }
     
                ArrayBuffer.prototype.slice = function (from, to) {
                    var length = this.byteLength,
                        begin = clamp(from, length),
                        end = length,
                        num,
                        target,
                        targetArray,
                        sourceArray;
     
                    if (to !== undefined) {
                        end = clamp(to, length);
                    }
     
                    if (begin > end) {
                        return new ArrayBuffer(0);
                    }
     
                    num = end - begin;
                    target = new ArrayBuffer(num);
                    targetArray = new Uint8Array(target);
     
                    sourceArray = new Uint8Array(this, begin, num);
                    targetArray.set(sourceArray);
     
                    return target;
                };
            })();
        }
     
        // ---------------------------------------------------
     
        /**
         * Helpers.
         */
     
        function toUtf8(str) {
            if (/[\u0080-\uFFFF]/.test(str)) {
                str = unescape(encodeURIComponent(str));
            }
     
            return str;
        }
     
        function utf8Str2ArrayBuffer(str, returnUInt8Array) {
            var length = str.length,
               buff = new ArrayBuffer(length),
               arr = new Uint8Array(buff),
               i;
     
            for (i = 0; i < length; i += 1) {
                arr[i] = str.charCodeAt(i);
            }
     
            return returnUInt8Array ? arr : buff;
        }
     
        function arrayBuffer2Utf8Str(buff) {
            return String.fromCharCode.apply(null, new Uint8Array(buff));
        }
     
        function concatenateArrayBuffers(first, second, returnUInt8Array) {
            var result = new Uint8Array(first.byteLength + second.byteLength);
     
            result.set(new Uint8Array(first));
            result.set(new Uint8Array(second), first.byteLength);
     
            return returnUInt8Array ? result : result.buffer;
        }
     
        function hexToBinaryString(hex) {
            var bytes = [],
                length = hex.length,
                x;
     
            for (x = 0; x < length - 1; x += 2) {
                bytes.push(parseInt(hex.substr(x, 2), 16));
            }
     
            return String.fromCharCode.apply(String, bytes);
        }
     
        // ---------------------------------------------------
     
        /**
         * SparkMD5 OOP implementation.
         *
         * Use this class to perform an incremental md5, otherwise use the
         * static methods instead.
         */
     
        function SparkMD5() {
            // call reset to init the instance
            this.reset();
        }
     
        /**
         * Appends a string.
         * A conversion will be applied if an utf8 string is detected.
         *
         * @param {String} str The string to be appended
         *
         * @return {SparkMD5} The instance itself
         */
        SparkMD5.prototype.append = function (str) {
            // Converts the string to utf8 bytes if necessary
            // Then append as binary
            this.appendBinary(toUtf8(str));
     
            return this;
        };
     
        /**
         * Appends a binary string.
         *
         * @param {String} contents The binary string to be appended
         *
         * @return {SparkMD5} The instance itself
         */
        SparkMD5.prototype.appendBinary = function (contents) {
            this._buff += contents;
            this._length += contents.length;
     
            var length = this._buff.length,
                i;
     
            for (i = 64; i <= length; i += 64) {
                md5cycle(this._hash, md5blk(this._buff.substring(i - 64, i)));
            }
     
            this._buff = this._buff.substring(i - 64);
     
            return this;
        };
     
        /**
         * Finishes the incremental computation, reseting the internal state and
         * returning the result.
         *
         * @param {Boolean} raw True to get the raw string, false to get the hex string
         *
         * @return {String} The result
         */
        SparkMD5.prototype.end = function (raw) {
            var buff = this._buff,
                length = buff.length,
                i,
                tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                ret;
     
            for (i = 0; i < length; i += 1) {
                tail[i >> 2] |= buff.charCodeAt(i) << ((i % 4) << 3);
            }
     
            this._finish(tail, length);
            ret = hex(this._hash);
     
            if (raw) {
                ret = hexToBinaryString(ret);
            }
     
            this.reset();
     
            return ret;
        };
     
        /**
         * Resets the internal state of the computation.
         *
         * @return {SparkMD5} The instance itself
         */
        SparkMD5.prototype.reset = function () {
            this._buff = '';
            this._length = 0;
            this._hash = [1732584193, -271733879, -1732584194, 271733878];
     
            return this;
        };
     
        /**
         * Gets the internal state of the computation.
         *
         * @return {Object} The state
         */
        SparkMD5.prototype.getState = function () {
            return {
                buff: this._buff,
                length: this._length,
                hash: this._hash
            };
        };
     
        /**
         * Gets the internal state of the computation.
         *
         * @param {Object} state The state
         *
         * @return {SparkMD5} The instance itself
         */
        SparkMD5.prototype.setState = function (state) {
            this._buff = state.buff;
            this._length = state.length;
            this._hash = state.hash;
     
            return this;
        };
     
        /**
         * Releases memory used by the incremental buffer and other additional
         * resources. If you plan to use the instance again, use reset instead.
         */
        SparkMD5.prototype.destroy = function () {
            delete this._hash;
            delete this._buff;
            delete this._length;
        };
     
        /**
         * Finish the final calculation based on the tail.
         *
         * @param {Array}  tail   The tail (will be modified)
         * @param {Number} length The length of the remaining buffer
         */
        SparkMD5.prototype._finish = function (tail, length) {
            var i = length,
                tmp,
                lo,
                hi;
     
            tail[i >> 2] |= 0x80 << ((i % 4) << 3);
            if (i > 55) {
                md5cycle(this._hash, tail);
                for (i = 0; i < 16; i += 1) {
                    tail[i] = 0;
                }
            }
     
            // Do the final computation based on the tail and length
            // Beware that the final length may not fit in 32 bits so we take care of that
            tmp = this._length * 8;
            tmp = tmp.toString(16).match(/(.*?)(.{0,8})$/);
            lo = parseInt(tmp[2], 16);
            hi = parseInt(tmp[1], 16) || 0;
     
            tail[14] = lo;
            tail[15] = hi;
            md5cycle(this._hash, tail);
        };
     
        /**
         * Performs the md5 hash on a string.
         * A conversion will be applied if utf8 string is detected.
         *
         * @param {String}  str The string
         * @param {Boolean} [raw] True to get the raw string, false to get the hex string
         *
         * @return {String} The result
         */
        SparkMD5.hash = function (str, raw) {
            // Converts the string to utf8 bytes if necessary
            // Then compute it using the binary function
            return SparkMD5.hashBinary(toUtf8(str), raw);
        };
     
        /**
         * Performs the md5 hash on a binary string.
         *
         * @param {String}  content The binary string
         * @param {Boolean} [raw]     True to get the raw string, false to get the hex string
         *
         * @return {String} The result
         */
        SparkMD5.hashBinary = function (content, raw) {
            var hash = md51(content),
                ret = hex(hash);
     
            return raw ? hexToBinaryString(ret) : ret;
        };
     
        // ---------------------------------------------------
     
        /**
         * SparkMD5 OOP implementation for array buffers.
         *
         * Use this class to perform an incremental md5 ONLY for array buffers.
         */
        SparkMD5.ArrayBuffer = function () {
            // call reset to init the instance
            this.reset();
        };
     
        /**
         * Appends an array buffer.
         *
         * @param {ArrayBuffer} arr The array to be appended
         *
         * @return {SparkMD5.ArrayBuffer} The instance itself
         */
        SparkMD5.ArrayBuffer.prototype.append = function (arr) {
            var buff = concatenateArrayBuffers(this._buff.buffer, arr, true),
                length = buff.length,
                i;
     
            this._length += arr.byteLength;
     
            for (i = 64; i <= length; i += 64) {
                md5cycle(this._hash, md5blk_array(buff.subarray(i - 64, i)));
            }
     
            this._buff = (i - 64) < length ? new Uint8Array(buff.buffer.slice(i - 64)) : new Uint8Array(0);
     
            return this;
        };
     
        /**
         * Finishes the incremental computation, reseting the internal state and
         * returning the result.
         *
         * @param {Boolean} raw True to get the raw string, false to get the hex string
         *
         * @return {String} The result
         */
        SparkMD5.ArrayBuffer.prototype.end = function (raw) {
            var buff = this._buff,
                length = buff.length,
                tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                i,
                ret;
     
            for (i = 0; i < length; i += 1) {
                tail[i >> 2] |= buff[i] << ((i % 4) << 3);
            }
     
            this._finish(tail, length);
            ret = hex(this._hash);
     
            if (raw) {
                ret = hexToBinaryString(ret);
            }
     
            this.reset();
     
            return ret;
        };
     
        /**
         * Resets the internal state of the computation.
         *
         * @return {SparkMD5.ArrayBuffer} The instance itself
         */
        SparkMD5.ArrayBuffer.prototype.reset = function () {
            this._buff = new Uint8Array(0);
            this._length = 0;
            this._hash = [1732584193, -271733879, -1732584194, 271733878];
     
            return this;
        };
     
        /**
         * Gets the internal state of the computation.
         *
         * @return {Object} The state
         */
        SparkMD5.ArrayBuffer.prototype.getState = function () {
            var state = SparkMD5.prototype.getState.call(this);
     
            // Convert buffer to a string
            state.buff = arrayBuffer2Utf8Str(state.buff);
     
            return state;
        };
     
        /**
         * Gets the internal state of the computation.
         *
         * @param {Object} state The state
         *
         * @return {SparkMD5.ArrayBuffer} The instance itself
         */
        SparkMD5.ArrayBuffer.prototype.setState = function (state) {
            // Convert string to buffer
            state.buff = utf8Str2ArrayBuffer(state.buff, true);
     
            return SparkMD5.prototype.setState.call(this, state);
        };
     
        SparkMD5.ArrayBuffer.prototype.destroy = SparkMD5.prototype.destroy;
     
        SparkMD5.ArrayBuffer.prototype._finish = SparkMD5.prototype._finish;
     
        /**
         * Performs the md5 hash on an array buffer.
         *
         * @param {ArrayBuffer} arr The array buffer
         * @param {Boolean}     [raw] True to get the raw string, false to get the hex one
         *
         * @return {String} The result
         */
        SparkMD5.ArrayBuffer.hash = function (arr, raw) {
            var hash = md51_array(new Uint8Array(arr)),
                ret = hex(hash);
     
            return raw ? hexToBinaryString(ret) : ret;
        };
     
        return SparkMD5;
    }));

     

    展开全文
  • 压缩过的图片,使用python md5转换,记录一下这个md5的数值,保存在本地,再之后执行压缩脚本的时候,先到该本地文件查看对应的文件名是否存在,如果存在,取出上次记录的md5数值,和本次需要压缩的图片md5数值进行对比,如果...

    项目需求:

    批量压缩图片用于h5游戏,随时会添加新的图片,也有可能会替换一些旧图,执行批量压缩脚本时,不要再去压缩已经压缩过的图片

    解决思路:

    压缩过的图片,使用python md5转换,记录一下这个md5的数值,保存在本地,再之后执行压缩脚本的时候,先到该本地文件查看对应的文件名是否存在,如果存在,取出上次记录的md5数值,和本次需要压缩的图片md5数值进行对比,如果md5数值相同,则跳过该图

    python 图片 md5代码如下:

    import hashlib
    from PIL import Image
    import numpy as np
    import os
    import os.path

    PathWorkspaceRoot = os.path.abspath(os.path.join(os.path.dirname(__file__), ".."))
    img=PathWorkspaceRoot+"\_pngcompress\common.png"
    fd = np.array(Image.open(img))
    fmd5 = hashlib.md5(fd)
    print("md5="+fmd5.hexdigest())

    转载于:https://www.cnblogs.com/czql/articles/10830814.html

    展开全文
  • 图片对比的一个思路是将文件转换为二进制文件流,然后对图片二进制流进行MD5编码,比对图片二进制流MD5编码的结果,不过该方法的缺点当同一图片使用不同的压缩算法进行存储后会失效; public static byte[] ...
    Java实现图片比对(1)-MD5方式
    图片对比的一个思路是将文件转换为二进制文件流,然后对图片二进制流进行MD5编码,比对图片二进制流MD5编码的结果,不过该方法的缺点当同一图片使用不同的压缩算法进行存储后会失效;
    public static byte[] getTuPianBytes(String name) {
    		File file = new File(name);
    		byte[] tuPianBytes = new byte[(int) file.length()];
    		InputStream in = null;
    		try {
    			in = new FileInputStream(file);
    			in.read(tuPianBytes);
    			in.close();
    		} catch (FileNotFoundException e) {
    			tuPianLog_NotSame.log("can not find file " + name);
    		} catch (IOException e) {
    			tuPianLog_NotSame.log("read picture error " + name);
    		}
    		return tuPianBytes;
    	}
    
    	private static byte[] getTuPianFromWeb(String urlAddress) {
    		URL url = null;
    		HttpURLConnection conn = null;
    		byte[] tuPianBytes = null;
    		try {
    			url = new URL(urlAddress);
    			conn = (HttpURLConnection) url.openConnection();
    			if (conn.getResponseCode() == 200) {
    				InputStream in = conn.getInputStream();
    				tuPianBytes = readStream(in);
    			} else if (conn.getResponseCode() == 500) {
    				throw new PictureNotFoundError("can not found #ADD# picture: "
    						+ urlAddress);
    			}
    		} catch (IOException ioE) {
    			ioE.printStackTrace();
    		} finally {
    			if (conn != null) {
    				conn.disconnect();
    				conn = null;
    			}
    			if (url != null) {
    				url = null;
    			}
    		}
    		return tuPianBytes;
    	}
    	
    	private static byte[] readStream(InputStream in) {
    		try {
    			ByteArrayOutputStream outstream = new ByteArrayOutputStream();
    			byte[] buffer = new byte[1024];
    			int length = -1;
    			while ((length = in.read(buffer)) != -1) {
    				outstream.write(buffer, 0, length);
    			}
    			outstream.close();
    			in.close();
    			return outstream.toByteArray();
    		} catch (Exception e) {
    			e.printStackTrace();
    			return null;
    		}
    	}
    
    	private static String getTuPianMD5(byte[] tuPianBytes) {
    		if (tuPianBytes == null) {
    			return "";
    		}
    		byte[] strTemp = tuPianBytes;
    		try {
    			MessageDigest digest = MessageDigest.getInstance("MD5");
    			digest.update(strTemp);
    			byte[] md = digest.digest();
    			int j = md.length;
    			char str[] = new char[j * 2];
    			int k = 0;
    			for (int i = 0; i < j; i++) {
    				byte byte0 = md[i];
    				str[k++] = hexDigits[byte0 >>> 4 & 0xf];
    				str[k++] = hexDigits[byte0 & 0xf];
    			}
    			return new String(str);
    		} catch (NoSuchAlgorithmException ignore) {
    			return null;
    		}
    	}
    展开全文
  • 图片对比的一个思路是将文件转换为二进制文件流,然后对图片二进制流进行MD5编码,比对图片二进制流MD5编码的结果,不过该方法的缺点当同一图片使用不同的压缩算法进行存储后会失效; [code="java"]...
  • 检测升级MD5校验zip下载文件实现思路是先从服务器自动检测更新zip包,如果有新版本,则立即下载...一个放入服务器端的报文中,另一个在代码中使用MD5检验,两边一对比,如果生成字串一致,那么即可说明文件是完整的。
  • 检测升级MD5校验zip下载文件实现思路是先从服务器自动检测更新zip包,如果有新版本,则立即...一个放入服务器端的报文中,另一个在代码中使用MD5检验,两边一对比,如果生成字串一致,那么即可说明文件是完整的。  
  • 阿里巴巴的图片识别模型包括OCR文字识别,以图比图,logo图形识别,图形深度特征(CNN深度卷积神经网络),图像局部特征的提取,MD5数值检测等多种复合算法,在阿里旗下不同的平台都有应用。比如手淘APP的拍图识别...
  • 本例子是一个应用升级下载的例子源码,比较有好的参考性,思路是先从服务器自动检测更新zip包,...一个放入服务器端的报文中,另一个在代码中使用MD5检验,两边一对比,如果生成字串一致,那么即可说明文件是完整的。
  • 我组产品包含大量音频和图片资源,MD5主要就用来检测这些资源文件的完整性。主要思路是:先计算出所有资源文件的MD5值,存到一个xml文件中,作为标准的MD5值。然后把这个xml文件放到我们的产品中,每次更新程序以后...
  • hashlib.md5判断两个图是否完全一样哈希算法:1.感知哈希算法;2.均值哈希算法;3.差值哈希算法灰度直方图:1.单通道直方图;2. 三通道直方图二、暴力方式1. 按像素比较# -*- coding: utf-8 -*-# !/usr/bin/...
  • 阿里巴巴的图片识别模型包括OCR文字识别,以图比图,logo图形识别,图形深度特征(CNN深度卷积神经网络),图像局部特征的提取,MD5数值检测等多种复合算法,在阿里旗下不同的平台都有应用。比如手淘APP的拍图识别...
  • 为什么用缓存 手动Web缓存 优势 劣势 WebView默认缓存 优势 劣势 手动加载Web缓存实战 打开WebView内置缓存机制实战 网页缓存 缓存构成 缓存模式5种 ...可以缓存更多的内容到本地,包括大的图片。 劣势 需
  • hashlib.md5判断两个图是否完全一样哈希算法:1.感知哈希算法;2.均值哈希算法;3.差值哈希算法灰度直方图:1.单通道直方图;2. 三通道直方图二、暴力方式1. 按像素比较# -*- coding: utf-8 -*-# !/usr/bin/...
  • dm5校检,对比前后文件的变化,此软件所有原版版权归软件开发商所有,主程序 HY_IDM5051_ljh.exe 的 MD5图片:HY_IDM5051_ljh_md5.gif
  • Android对象对比方法

    千次阅读 2013-11-21 10:47:37
    最近项目要用到图片对比,上网搜了一下。有2中方法! 第一种 Java实现图片比对(1)-MD5方式 这是地址:http://chenxu-8456.iteye.com/blog/1322014 你们可以看一下,我按照这个方法弄了一下。代码有个错误后来也...
  • 感知哈希不同于密码哈希(如md5云云),它对于相似特征的输入,会有相似的输出;而密码哈希,依赖于雪崩效应,对于非常微小的输入,都会有完全不同的输出。感知哈希算法被广泛应用于网络上的侵权查找,还有数字取证...
  • texturepacker图片打包偶然出现的错误

    千次阅读 2017-05-25 15:31:21
    发现tp打包图片的时候 偶尔会出现图片没任何改动 合图用图片对比工具跟以前版本比的结果一致 但是MD5值对不上的情况 而此时生成的plist又完全一样且MD5值也完全一样
  • 第一种 Java实现图片比对(1)-MD5方式 这是地址:http://chenxu-8456.iteye.com/blog/1322014 你们可以看一下,我按照这个方法弄了一下。代码有个错误后来也解决了...这里就不讲哪点错了,因为这个方法完全坑爹。...
  • 图片相识度比较

    2015-03-22 16:46:14
    最近项目要用到图片对比,上网搜了一下。有2中方法! 第一种 Java实现图片比对(1)-MD5方式 这是地址:http://chenxu-8456.iteye.com/blog/1322014 你们可以看一下,我按照这个方法弄了一下。代码有个错误后来也...
  • 对比出两个文本文件不同之处和相同之处(用一个TXT文件列出),MD5对比 批量文件加解密功能如下: 用任意字符数字对任意文件加解密 批量文件打包释放功能如下: 将多个文件打包成一个并且可以释放出来,可对打包文件内...
  • 对比一下会发现,前者中间是"blob",后者中间是"tree",猜想是不是与服务器端的存储方式有关?由于这不是此次课程的范围,希望知道的朋友给一个学习的线索,待...
  • vc++ 应用源码包_5

    热门讨论 2012-09-15 14:45:16
    MD5算法 MediaPlayer 视频播放的实现。 MFC 对话框 MP3 内部包含:mp3播放器Lrc歌词同步源程序代码分析、mp3播放器+支持歌词同步显示哦、简单音乐播放器。 mfc 解码 视频音频解码部分。 MFC_MultiSender_OVER ...
  • 1)web_server (1)web服务器 ... (2)基本信息回应 ...客户端下载资源,md5对比后,下载代码和图片资源 2)客户端 (1)游客登录 客户端选择游客快速登录,则本地生成guset_key (2)账号登录 用账号登录 (3)soc...
  • 因为现在做的是企业版的APP,不能保证用户不越狱,也...  在沙盒中我们可以读到自己程序的二进制,也可以读到资源文件签名文件,我们可以对其取md5值得到一个标记字符串,然后发给服务器,对比存储在服务器段的MD5...
  • jdk1.6访问https接口报错,jdk1.7访问正常,服务端jdk为1.7报错,对比正常访问密码套件不一样,可是我下载jce之后也没有用正常使用的是TLS,1.6使用的是MD5,如图:![图片说明]...

空空如也

空空如也

1 2 3 4 5
收藏数 81
精华内容 32
关键字:

md5图片对比