Date: 29 Mar 2002 18:58:44 -0800 From: swear@blarg.net (Gary W. Swearingen) To: Terry Lambert <tlambert2@mindspring.com> Cc: Ilia Chipitsine <ilia@cgu.chel.su>, questions@FreeBSD.ORG, hackers@FreeBSD.ORG Subject: Re: perfomance and regular expressions Message-ID: <iy4riydamz.riy@localhost.localdomain> In-Reply-To: <3CA4FC84.BAB5B698@mindspring.com> References: <Pine.BSF.4.10.10203292117510.1096-100000@jane.poka.net> <3CA4FC84.BAB5B698@mindspring.com>
next in thread | previous in thread | raw e-mail | index | archive | help
Terry Lambert <tlambert2@mindspring.com> writes: > That said, if you feel a moral imperative to save and load > precompiled regular expressions. you can do it by serializing > the structure contents to disk, and then reading them back in. It'd be best to use Terry's single process idea, but if I was going to do the precomiled thing, I'd consider finding a way to get those structures translated into my programming language and compile it into the binary. (And there may be some way to leave it binary, depending on your language.) But with memory and disks being what they are today, this scheme might not be worth the trouble. Anybody know any languages that allow compile-time (and/or link-time) computations using (most of?) the same language? I've often desired the feature. (I suppose some preprocessor like m4 could handle some of it.) To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-questions" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?iy4riydamz.riy>