Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | OCTADE <news0@octade.net> |
|---|---|
| Newsgroups | alt.flashback |
| Subject | [archive] PERFECT PANGRAM HASH : Anagram Hash Function |
| Date | 2026-08-17 19:04 +0000 |
| Organization | bofh.team Usenet service |
| Message-ID | <11606jr$mlt4$1@paganini.bofh.team> (permalink) |
PERFECT PANGRAM HASH : Anagram Hash Function Byrl Raze Buckbriar A pangram is a sentence or phrase that contains each letter of an alphabet or character set at least once. A perfect pangram is an anagram of the alphabet which contains each letter exactly once. Pangram hash generates a perfect pangram hash digest consisting of a anagram permutation of a character set. Each character in the output is unique and non-repeating. Below is purely procedural source code written in the FreePascal programming language. Instructions and explanatory comments are located in the source code. A plain text source file is embedded in the PDF document. Additional resource files are also embedded in the PDF file. https://archive.org/details/perfect_pangram_hash_anagram_hash_function
Back to alt.flashback | Previous | Next | Find similar | Unroll thread
[archive] PERFECT PANGRAM HASH : Anagram Hash Function OCTADE <news0@octade.net> - 2026-08-17 19:04 +0000
csiph-web