國立虎尾科技大學 |

The Joys of Hashing = Hash Table Programming with C /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Joys of Hashing/ by Thomas Mailund.
其他題名:	Hash Table Programming with C /
作者:	Mailund, Thomas.
面頁冊數:	XI, 206 p. 72 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Programming languages (Electronic computers). -
電子資源:	https://doi.org/10.1007/978-1-4842-4066-3
ISBN:	9781484240663

The Joys of Hashing = Hash Table Programming with C /
Mailund, Thomas.

The Joys of HashingHash Table Programming with C /[electronic resource] :by Thomas Mailund. - 1st ed. 2019. - XI, 206 p. 72 illus.online resource.

1. The Joys of Hashing -- 2. Hash Keys, Indices and Collisions -- 3. Collision Resolution, Load Factor and Performance -- 4. Resizing -- 5. Adding Application Keys and Valuse -- 6. Heuristic Hash Functions -- 7. Universal Hashing -- 8. Conclusions.

Build working implementations of hash tables, written in the C programming language. This book starts with simple first attempts devoid of collision resolution strategies, and moves through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. Hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations. The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments. You will: Master the basic ideas behind hash tables Carry out collision resolution, including strategies for handling collisions and their consequences for performance Resize or grow and shrink tables as needed Store values by handling when values must be stored with keys to make general sets and maps.

ISBN: 9781484240663

Standard No.: 10.1007/978-1-4842-4066-3doiSubjects--Topical Terms:

1127615
Programming languages (Electronic computers).

LC Class. No.: QA76.7-76.73

Dewey Class. No.: 005.13

The Joys of Hashing = Hash Table Programming with C /
LDR:02679nam a22004095i 4500 001 1008049
003 DE-He213
005 20200702025302.0
007 cr nn 008mamaa
008 210106s2019 xxu| s |||| 0|eng d
020 $a 9781484240663 $9 978-1-4842-4066-3
024 7 $a 10.1007/978-1-4842-4066-3 $2 doi
035 $a 978-1-4842-4066-3
050 4 $a QA76.7-76.73
050 4 $a QA76.76.C65
072 7 $a UMX $2 bicssc
072 7 $a COM051010 $2 bisacsh
072 7 $a UMX $2 thema
072 7 $a UMC $2 thema
082 0 4 $a 005.13 $2 23
100 1 $a Mailund, Thomas. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1140758
245 1 4 $a The Joys of Hashing $h [electronic resource] : $b Hash Table Programming with C / $c by Thomas Mailund.
250 $a 1st ed. 2019.
264 1 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2019.
300 $a XI, 206 p. 72 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 1. The Joys of Hashing -- 2. Hash Keys, Indices and Collisions -- 3. Collision Resolution, Load Factor and Performance -- 4. Resizing -- 5. Adding Application Keys and Valuse -- 6. Heuristic Hash Functions -- 7. Universal Hashing -- 8. Conclusions.
520 $a Build working implementations of hash tables, written in the C programming language. This book starts with simple first attempts devoid of collision resolution strategies, and moves through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. Hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations. The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments. You will: Master the basic ideas behind hash tables Carry out collision resolution, including strategies for handling collisions and their consequences for performance Resize or grow and shrink tables as needed Store values by handling when values must be stored with keys to make general sets and maps.
650 0 $a Programming languages (Electronic computers). $3 1127615
650 0 $a Computer programming. $3 527822
650 1 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 2 4 $a Programming Techniques. $3 669781
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9781484240656
776 0 8 $i Printed edition: $z 9781484240670
856 4 0 $u https://doi.org/10.1007/978-1-4842-4066-3
912 $a ZDB-2-CWD
912 $a ZDB-2-SXPC
950 $a Professional and Applied Computing (SpringerNature-12059)
950 $a Professional and Applied Computing (R0) (SpringerNature-43716)