On Mon, Jan 05, 2004 at 10:04:01PM -0500, David Manura wrote:
So, there seems like three main ways out there to implement string
interpolation:
- use tied hashes
- use source filtering (e.g. Filter::Simple)
- use a function call on a list (e.g. as done with SQL::Interpolate
with
* david nicol [EMAIL PROTECTED] [2004-01-06 20:03]:
I'm also safe from the implementation needing the flock bits if
it uses them. I don't know that they do, but I also don't know
that they don't.
You're also safe because tieing and locking is not an atomic
operation, and some DBM libraries
a web service that provides atomic advisory locking would be
pretty easy to write.
For that matter so would a datagram service, and that would be
more efficient.
Requests would include:
resource-ID-string
a character string uniquely identifying
what is
