A quick search turns up some interesting looking ones.
TRE will do regex AND approximate matching
https://en.wikipedia.org/wiki/TRE_%28computing%29
https://github.com/laurikari/tre/
Small:
https://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Levenshtein_distance#C
http://www.chokkan.org/software/simstring/
Overkill:
http://flamingo.ics.uci.edu/
On 12/18/2015 12:29 PM, Tomasz Wlostowski wrote:
On 18.12.2015 19:25, Jon Evans wrote:
Here's a quick example using an open-source JavaScript library and a
list of some XMEGA parts I copied from digikey :-)
https://jsfiddle.net/o7ms290j/embedded/result/
Wow, that's cool. Does anyone know a similar thing in C++?
Tom
_______________________________________________
Mailing list: https://launchpad.net/~kicad-developers
Post to : [email protected]
Unsubscribe : https://launchpad.net/~kicad-developers
More help : https://help.launchpad.net/ListHelp
_______________________________________________
Mailing list: https://launchpad.net/~kicad-developers
Post to : [email protected]
Unsubscribe : https://launchpad.net/~kicad-developers
More help : https://help.launchpad.net/ListHelp
