The Annoyance Filter.pdf - Fourmilab

§33 ANNOYANCE-FILTER FAST DICTIONARY 37
}
double d;
is .read (reinterpret cast〈char ∗〉(&s), sizeof s);
u int16 t filler ;
is .read (reinterpret cast〈char ∗〉(&filler ), sizeof filler );
/∗ Two byte filler for alignment ∗/
if (s ≡ doubleSize ) {
is .read (reinterpret cast〈char ∗〉(&d), sizeof d);
}
if ((s ≠ doubleSize ) ∨ (d ≠ fastDictionaryFloatingTest )) {
cerr ≪ "Fast␣dictionary␣file␣" ≪ fname ≪
"␣was␣created␣on␣a␣machine␣with␣incompatible␣floating␣point␣format." ≪ endl ;
regen ( );
goto fdlbail ;
}
is .read (reinterpret cast〈char ∗〉(&totalSize ), sizeof totalSize );
is .read (reinterpret cast〈char ∗〉(&hashTableOffset ), sizeof hashTableOffset );
is .read (reinterpret cast〈char ∗〉(&hashTableBuckets ), sizeof hashTableBuckets );
is .read (reinterpret cast〈char ∗〉(&wordTableSize ), sizeof wordTableSize );
#ifdef HAVE_MMAP
dblock = reinterpret cast〈unsigned char ∗〉(dp) + is .tellg ( );
#else
u int32 t fdsize = (hashTableBuckets ∗ sizeof (u int32 t )) + wordTableSize ;
try {
dblock = new unsigned char[fdsize ];
}
catch(bad alloc)
{
cerr ≪ "Unable␣to␣allocate␣memory␣for␣fast␣dictionary.";
return false ;
}
is .read (reinterpret cast〈char ∗〉(dblock ), fdsize );
is .close ( );
#endif
hashTable = reinterpret cast 〈 u int32 t ∗> (dblock );
wordTable = dblock + (hashTableBuckets ∗ sizeof (u int32 t ));
if (verbose ) {
cerr ≪ "Loaded␣fast␣dictionary␣from␣" ≪ fname ≪ "." ≪ endl ;
}
return true ; }