* Orton, Yves yves.orton at de.mci.com [2003-11-12 17:00]:
/me feels silly
Ach, dont be.
The main reason I feel silly is that I just used Tie::IxHash yesterday.
I just never made the connection...
(darren)
--
There is not enough love in the world to squander it on anything by
human
Randy W. Sims:
Sounds like a set/multiset/bag structure.
I thought it sounded more like a sorted array, but I'm prepared to be
persuaded otherwise. (Primarily because I've already released the module
to CPAN. ;)
http://search.cpan.org/search?query=Setmode=all
Which of those were you thinking
Randy W. Sims:
Hmm, Jarkko has a nice set (err, no not those), but (and no not that
either) your module is the only one I see that uses a tied array to
implement a set;
Sorry, I should have been more explicit. I can't see any connection
between keeping something *sorted* specifically and
* Randy W. Sims [EMAIL PROTECTED] [2003-11-13 16:32]:
Hmm, Jarkko has a nice set (err, no not those), but (and no not that
either) [ ... ]
Randy.
Your name is very appropriate. :-)
--
Regards,
Aristotle
If you can't laugh at yourself, you don't take life seriously enough.
Simon Cozens writes:
I can't see any connection between keeping something *sorted*
specifically and having a set.
I think it depends what you're doing with duplicates. I haven't looked
at your module, but if you are leaving duplicate values in there
(consecutively, presumably) then I'm pretty
* at 13/11 17:16 + Fergal Daly said:
On Wed, Nov 12, 2003 at 05:17:28PM +, Simon Cozens wrote:
Randy W. Sims:
Sounds like a set/multiset/bag structure.
I thought it sounded more like a sorted array, but I'm prepared to be
persuaded otherwise. (Primarily because I've already
[EMAIL PROTECTED] (Struan Donald) writes:
However, if I am looking for a module that makes it easy for me to
have a sorted array I am not going to look at modules with Set in the
name.
The module's already uploaded, guys; the thread is dead.
--
There seems no plan because it is all plan.
Title: RE: Tie::Array::Sorted
* Simon Cozens simon at simon-cozens.org [2003-11-12 13:32]:
Is Tie::Array::Sorted a reasonable name for it, or would another one
be more obvious?
DB_File has a way to do this iirc.
But it is a shocking ommission if there isnt at least one other way. I
Simon Cozens wrote:
Hi. I'm about to write a module which presents an array in sorted order;
$a[0] will always be the least element by some comparator. Miraculously,
there doesn't seem to be such a beast on CPAN already.
Is Tie::Array::Sorted a reasonable name for it, or would another one be more
RE: Tie::Array::SortedHi Simon and others,
I agree that Tie::Array::Sorted is a good name.
But it is a shocking ommission if there isnt at least one other way. I
definately vote for
Tie::Array::Sorted, but It may be worth having a look at Tie::Hash::Sorted
and make
them compatible on some
* Bruno Negrao [EMAIL PROTECTED] [2003-11-12 18:47]:
Also, you could try to guess (via regexps) if the data to be
sorted is numeric or alphabetical and use the appropriate
subrouting to order it.
Bleah. This kind of second-guessing easily leads to surprises.
Being explicit is good.
--
be the least element by some comparator. Miraculously,
there doesn't seem to be such a beast on CPAN already.
Is Tie::Array::Sorted a reasonable name for it, or would another one be more
obvious?
s/Tie::// ?
Do I need to be concerned with how the module is implemented?
Presumably
12 matches
Mail list logo
