don't have a big problem with it.
Tom
--
Tom Hughes ([EMAIL PROTECTED])
http://www.compton.nu/
...Somehow, somewhere along the line, this town lost its pride.
136 for some thoughts on how this issue can be resolved when
multiple iterators are needed.
Tom
--
Tom Hughes ([EMAIL PROTECTED])
http://www.compton.nu/
...The early worm gets the bird.
on it without realising it.
As far as I can tell reset %x currently tries to reset any
variables which start with either % or x even though no variable
can start with %...
Tom
--
Tom Hughes ([EMAIL PROTECTED])
http://www.compton.nu/
...I can't remember where I parked my Hard Disk
functions on sorted arrays
I would have thought the obvious way to handle a sorted map would
be to keep it as a balanced tree instead of a hash internally - that
way you don't need to keep sorting it when you access it.
Of course it does make key access O(lg n) instead of O(1).
Tom
--
Tom Hugh
e actually come up with a way to solve your problem
of modifying the hash during the iteration so that I can make my
implicit iterator strategy work again... I'm planning to write it
up as an internals RFC over the weekend.
Tom
--
Tom Hughes ([EMAIL PROTECTED])
http://www.compton.nu/
...Do unto o
things
use iterators instead of creating large temporary lists.
Tom
--
Tom Hughes ([EMAIL PROTECTED])
http://www.compton.nu/
...I'm so close to hell I can almost see Vegas!
but try it on 50,000 keys.. ACK, time for a coffee break.
It may not be helping that a list of the 5 keys is implicitly
constructed by that syntax. If we get iterator support in perl6 then
that should hopefully make it somewhat more efficient.
Tom
--
Tom Hughes ([EMAIL PROTEC
not necessarily conflict with the
above - the core might spot the xxx: scheme and try and load
an xxx.pm from some well known path and hand off the open to
that module.
Tom
--
Tom Hughes ([EMAIL PROTECTED])
http://www.compton.nu/
...Let He who taketh the Plunge Remember to return it by Tuesday.
In message [EMAIL PROTECTED]
Tom Hughes [EMAIL PROTECTED] wrote:
The suggested syntax does not necessarily conflict with the
above - the core might spot the xxx: scheme and try and load
an xxx.pm from some well known path and hand off the open to
that module.
To follow up
big or little. I can't remember which off the top
of my head.
You may be getting confused here with the middle-endian system
used by the PDP machines which goes 3412 or something rather than
the 1234 or 4321 that most machines use.
Tom
--
Tom Hughes ([EMAIL PROTECTED])
http://www.compton.nu
sort the
dates to whatever accuracy you want by comparing each of the
first n elements in turn for some value of n defined bu the
accuracy you want.
Tom
--
Tom Hughes ([EMAIL PROTECTED])
http://www.compton.nu/
...If we left the bones out it wouldn't be crunchy.
to your RFC on the matter ;-)
Tom
--
Tom Hughes ([EMAIL PROTECTED])
http://www.compton.nu/
? :-)
This is what Miranda calls zipwith. Combined with reduce
you can do things like scalar products very simply:
reduce(plus, zipwith(multiply, list1, list2))
Note that Miranda actually calls reduce fold though - well
actually foldl or foldr depending on which end of the list
you start at.
Tom
--
Tom
13 matches
Mail list logo
