Sort of. at a high level pseudo code view
I have a file of things
the user inputs a list of things
for each thing the user inputs it finds all reference in the file of things
To put it plainly if you are familiar with Princeton's word net db/files I
am searching the words in a user inputted
*@pregexp{^@a}* is read as *(pregexp "^" a)* [you can test this by
evaluating the quoted form, '*@pregexp{^@a}* ], but the function pregexp
expects a single string as its first argument (and, apparently, a function
or #f as its optional second argument).
More generally, the body part of an
On Fri, Oct 28, 2016 at 3:24 PM, Ken MacKenzie wrote:
> In a future version of what I am working on I see regex being an excellent
> solution. My search is against a file I load into a list at program
> initialization. However for other parts of this to load a list based
In a future version of what I am working on I see regex being an excellent
solution. My search is against a file I load into a list at program
initialization. However for other parts of this to load a list based on a
partial file filtered with regex may be a better solution.
There is also
4 matches
Mail list logo