[Date Prev][Date Next][Thread Prev][Thread Next]
[Date Index]
[Thread Index]
- Subject: Re: [ANNOUNCE] WordGrinder 0.1
- From: David Given <dg@...>
- Date: Mon, 15 Oct 2007 22:01:17 +0100
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Aaron Brown wrote:
[...]
> Lua patterns aren't compiled; the pattern string itself is
> iterated through. (See the function "match" in lstrlib.c.)
Hmm. I'm generating some rather baroque patterns. For example, doing a search
for "Fnord" from the menu actually starts applying the pattern
"[Ff]%c*[Nn]%c*[Oo]%c*[Rr]%c*[Dd]" to the string data. (Style information is
stored in the string as control codes, hence the %cs.) Is that kind of thing
very inefficient to parse? Is there a better way of doing it?
- --
┌── ｄｇ＠ｃｏｗｌａｒｋ．ｃｏｍ ─── http://www.cowlark.com ───────────────────
│
│ "There does not now, nor will there ever, exist a programming language in
│ which it is the least bit hard to write bad programs." --- Flon's Axiom
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org
iD8DBQFHE9Ucf9E0noFvlzgRAtCdAJwLoj1rROHbqHxvCesFxwsPh7BgiQCghFt2
XjGn5mzM9z27FYJfLwoFHJA=
=0NFV
-----END PGP SIGNATURE-----
