{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.manongdao.com/data/attach/logo/logo.png', '推荐 成全新的幸福 的问题《Which Jenkins Hash Algorithm is used for the HASH8》','https://www.manongdao.com/q-886921.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
I need to implement the hash8 function, or simulate its input/output in Java. Netezza's brief documentation says that hash8 implements Jenkins Algorithm, but there are multiple algorithms/revisions with that name.
I am wondering which Jenkins algorithm/revision (one-at-a-time/lookup2/lookup3/SpookyHash) does hash8 use? Some of these hash algorithms also require a seed value. How can I get that? Any suggestions are welcomed.