Gallery异步加载当前页图片

/* * Copyright 2010 Beijing Joyhoo Information Technology Co.,LTD. All Rights Reserved. */ package com.my; import android.util.Log; /** * <p>Title: </p> * <p>Description: </p> * @author doulj * @version 1.0 * @since 2011-3-14 */ class MyHash { /**//** * 鍔犳硶hash * @param key 瀛楃涓? * @param prime 涓?釜璐ㄦ暟 * @return hash缁撴灉 */ public static int additiveHash(String key, int prime) { int hash, i; for (hash = key.length(), i = 0; i < key.length(); i++) hash += key.charAt(i); return (hash % prime); } /**//** * 鏃嬭浆hash * @param key 杈撳叆瀛楃涓? * @param prime 璐ㄦ暟 * @return hash鍊? */ public static int rotatingHash(String key, int prime) { int hash, i; for (hash=key.length(), i=0; i<key.length(); ++i) hash = (hash<<4)^(hash>>28)^key.charAt(i); return (hash % prime); // return (hash ^ (hash>>10) ^ (hash>>20)); } // 鏇夸唬锛? // 浣跨敤锛歨ash = (hash ^ (hash>>10) ^ (hash>>20)) & mask; // 鏇夸唬锛歨ash %= prime; /**//** * MASK鍊硷紝闅忎究鎵句竴涓?锛屾渶濂芥槸璐ㄦ暟 */ static int M_MASK = 0x8765fed1; /**//** * 涓?涓?釜hash * @param key 杈撳叆瀛楃涓? * @return 杈撳嚭hash鍊? */ public static int oneByOneHash(String key) { int hash, i; for (hash=0, i=0; i<key.length(); ++i) { hash += key.charAt(i); hash += (hash << 10); hash ^= (hash >> 6); } hash += (hash << 3); hash ^= (hash >> 11); hash += (hash << 15); // return (hash & M_MASK); return hash; } /**//** * Bernstein's hash * @param key 杈撳叆瀛楄妭鏁扮粍 * @param level 鍒濆hash甯搁噺 * @return 缁撴灉hash */ public static int bernstein(String key) { int hash = 0; int i; for (i=0; i<key.length(); ++i) hash = 33*hash + key.charAt(i); return hash; } // /**///// Pearson's Hash // char pearson(char[]key, ub4 len, char tab[256]) // { // char hash; // ub4 i; // for (hash=len, i=0; i<len; ++i) // hash=tab[hash^key[i]]; // return (hash); // } /**///// CRC Hashing锛岃绠梒rc,鍏蜂綋浠ｇ爜瑙佸叾浠? // ub4 crc(char *key, ub4 len, ub4 mask, ub4 tab[256]) // { // ub4 hash, i; // for (hash=len, i=0; i<len; ++i) // hash = (hash >> 8) ^ tab[(hash & 0xff) ^ key[i]]; // return (hash & mask); // } /**//** * Universal Hashing */ public static int universal(char[]key, int mask, int[] tab) { int hash = key.length, i, len = key.length; for (i=0; i<(len<<3); i+=8) { char k = key[i>>3]; if ((k&0x01) == 0) hash ^= tab[i+0]; if ((k&0x02) == 0) hash ^= tab[i+1]; if ((k&0x04) == 0) hash ^= tab[i+2]; if ((k&0x08) == 0) hash ^= tab[i+3]; if ((k&0x10) == 0) hash ^= tab[i+4]; if ((k&0x20) == 0) hash ^= tab[i+5]; if ((k&0x40) == 0) hash ^= tab[i+6]; if ((k&0x80) == 0) hash ^= tab[i+7]; } return (hash & mask); } /**//** * Zobrist Hashing */ public static int zobrist( char[] key,int mask, int[][] tab) { int hash, i; for (hash=key.length, i=0; i<key.length; ++i) hash ^= tab[i][key[i]]; return (hash & mask); } // LOOKUP3 // 瑙丅ob Jenkins(3).c鏂囦欢 // 32浣岶NV绠楁硶 static int M_SHIFT = 0; /**//** * 32浣嶇殑FNV绠楁硶 * @param data 鏁扮粍 * @return int鍊? */ public static int FNVHash(byte[] data) { int hash = (int)2166136261L; for(byte b : data) hash = (hash * 16777619) ^ b; if (M_SHIFT == 0) return hash; return (hash ^ (hash >> M_SHIFT)) & M_MASK; } /**//** * 鏀硅繘鐨?2浣岶NV绠楁硶1 * @param data 鏁扮粍 * @return int鍊? */ public static int FNVHash1(byte[] data) { final int p = 16777619; int hash = (int)2166136261L; for(byte b:data) hash = (hash ^ b) * p; hash += hash << 13; hash ^= hash >> 7; hash += hash << 3; hash ^= hash >> 17; hash += hash << 5; return hash; } /**//** * 鏀硅繘鐨?2浣岶NV绠楁硶1 * @param data 瀛楃涓? * @return int鍊? */ public static int FNVHash1(String data) { final int p = 16777619; int hash = (int)2166136261L; for(int i=0;i<data.length();i++) hash = (hash ^ data.charAt(i)) * p; hash += hash << 13; hash ^= hash >> 7; hash += hash << 3; hash ^= hash >> 17; hash += hash << 5; return hash; } /**//** * Thomas Wang鐨勭畻娉曪紝鏁存暟hash */ public static int intHash(int key) { key += ~(key << 15); key ^= (key >>> 10); key += (key << 3); key ^= (key >>> 6); key += ~(key << 11); key ^= (key >>> 16); return key; } /**//** * RS绠楁硶hash * @param str 瀛楃涓? */ public static int RSHash(String str) { int b = 378551; int a = 63689; int hash = 0; for(int i = 0; i < str.length(); i++) { hash = hash * a + str.charAt(i); a = a * b; } return (hash & 0x7FFFFFFF); } /**//* End Of RS Hash Function */ /**//** * JS绠楁硶 */ public static int JSHash(String str) { int hash = 1315423911; for(int i = 0; i < str.length(); i++) { hash ^= ((hash << 5) + str.charAt(i) + (hash >> 2)); } return (hash & 0x7FFFFFFF); } /**//* End Of JS Hash Function */ /**//** * PJW绠楁硶 */ public static int PJWHash(String str) { int BitsInUnsignedInt = 32; int ThreeQuarters = (BitsInUnsignedInt * 3) / 4; int OneEighth = BitsInUnsignedInt / 8; int HighBits = 0xFFFFFFFF << (BitsInUnsignedInt - OneEighth); int hash = 0; int test = 0; for(int i = 0; i < str.length();i++) { hash = (hash << OneEighth) + str.charAt(i); if((test = hash & HighBits) != 0) { hash = (( hash ^ (test >> ThreeQuarters)) & (~HighBits)); } } return (hash & 0x7FFFFFFF); } /**//* End Of P. J. Weinberger Hash Function */ /**//** * ELF绠楁硶 */ public static int ELFHash(String str) { int hash = 0; int x = 0; for(int i = 0; i < str.length(); i++) { hash = (hash << 4) + str.charAt(i); if((x = (int)(hash & 0xF0000000L)) != 0) { hash ^= (x >> 24); hash &= ~x; } } return (hash & 0x7FFFFFFF); } /**//* End Of ELF Hash Function */ /**//** * BKDR绠楁硶 */ public static int BKDRHash(String str) { int seed = 131; // 31 131 1313 13131 131313 etc.. int ha