https://doku.sergev.org/ 2026-04-07T00:33:44+00:00 https://doku.sergev.org/ https://doku.sergev.org/lib/tpl/dokuwiki/images/favicon.ico text/html 2006-06-17T21:09:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://doku.sergev.org/hash/conflicts?rev=1150578546&do=diff Collisions of hash functions RS 8c36aef3: silicon gnat__cgi__cookie__cookie_table__table_conversions__to_pointerXnnb 633e1b15: tailgate roundup 6a0db76c: __ti30TimeGreaterOrEqualPrimitiveObj FSErrorListSize 5e793508: косолапит ipRegLocalMcast 5e282b5e: оттрубивший shellClassRec 737a82d3: прогиб nodeListRest__24SelectByClassNodeListObjR11EvalContextR11Interpreter 14243765: рассортировавший header_complex_add_data 564f8cf6: с… text/html 2022-05-16T05:24:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://doku.sergev.org/hash/efficiency-en?rev=1652678646&do=diff Hash Function Efficiency (This article is also available in Russian) In article of Arash Partow "General Purpose Hash Function Algorithms" several 32-bit algorithms are reviewed: * rs --- simple hash function from Robert Sedgwicks book 'Algorithms in C' * js --- bitwise hash function by Justin Sobel * pjw --- text/html 2022-05-16T05:24:12+00:00 Anonymous (anonymous@undisclosed.example.com) https://doku.sergev.org/hash/efficiency?rev=1652678652&do=diff Эффективность хэш-функций (Есть вариант этой статьи на английском языке) В статье Arash Partow "General Purpose Hash Function Algorithms" приведены восемь вариантов 32-битных хэш-функций: * rs --- простая хэш-функция из книги Роберта Седжвика text/html 2008-06-05T17:54:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://doku.sergev.org/hash/sources?rev=1212688471&do=diff General purpose hash function algorithms library Variants RS--AP are taken from Arash Partow collection: <http://www.partow.net/programming/hashfunctions>. RS Hash Function unsigned int RSHash (char *str, unsigned int len) { unsigned int b = 378551; unsigned int a = 63689; unsigned int hash = 0; unsigned int i = 0; for (i = 0; i < len; str++, i++) { hash = hash * a + (unsigned char)(*str); a = a * b; } return hash; }