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
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
See Source File
$(DMDSRC root/_speller.d)
Copyright (c) 1999-2016 by Digital Mars, All Rights Reserved
Compiler implementation of the D programming language http://dlang.org