Report a bug
If you spot a problem with this page, click here to create a Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using a local clone.


Compiler implementation of the D programming language

http: //

Walter Bright,
bool combineSpellerResult(ref void* p, ref int cost, void* np, int ncost);
combine a new result from the spell checker to find the one with the closest symbol with respect to the cost defined by the search function Input/Output: p best found spelling (NULL if none found yet) cost cost of p (INT_MAX if none found yet)

Input: np new found spelling (NULL if none found) ncost cost of np if non-NULL

true if the cost is less or equal 0 false otherwise
void* speller(const(char)* seed, scope dg_speller_t dg, const(char)* charset);
Looks for correct spelling. Currently only looks a 'distance' of one from the seed[]. This does an exhaustive search, so can potentially be very slow.

Input: seed wrongly spelled word dg search delegate charset character set

NULL no correct spellings found void* value returned by dg() for first possible correct spelling