Menu
▾
▴
scutigena-code — code snippets to implement algorithms in different languages
You can subscribe to this list here.
| 2003 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
(2) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2004 |
Jan
(16) |
Feb
(5) |
Mar
|
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
(1) |
Sep
(2) |
Oct
|
Nov
(2) |
Dec
|
| 2006 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
(1) |
Sep
|
Oct
(5) |
Nov
(3) |
Dec
(6) |
| 2007 |
Jan
|
Feb
(6) |
Mar
(2) |
Apr
(3) |
May
(11) |
Jun
(11) |
Jul
(13) |
Aug
(1) |
Sep
|
Oct
|
Nov
|
Dec
|
|
From: Kinshasa F. <hlr...@ci...> - 2006-12-24 20:41:44
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <HTML><HEAD> <META http-equiv=3DContent-Type content=3D"text/html; charset=3Diso-8859-1"> <META content=3D"MSHTML 6.00.2900.2912" name=3D"GENERATOR"> </HEAD> <BODY> <FONT face=3DArial><FONT size=3D2> <DIV>Michael says: <STRONG>GCME Huge News Release Expected Before Years = End!=20 </STRONG></DIV> <DIV><STRONG></STRONG> </DIV> <DIV><STRONG>Ring In The New Year With Cash!</STRONG></DIV> <DIV> </DIV> <DIV> <DIV><STRONG>GCME</STRONG> is fast becoming a major player in the = foreign film=20 market. With continuing mergers and joint ventures with the industries = most=20 influential corporations.</DIV> <DIV> </DIV></DIV> <DIV><STRONG>Company:</STRONG> Greater China Media & Entertainment=20 Corp.<BR>Symbol: <STRONG>GCME</STRONG><BR><STRONG>Price:</STRONG>=20 $0.70<BR>Status: <STRONG>BUY ALERT</STRONG><BR><STRONG>5 Day = Target:</STRONG>=20 $1.45</DIV> <DIV> </DIV> <DIV><STRONG>Right now</STRONG> it is at $0.70. We have seen consistent = price=20 jumps following <STRONG>news releases</STRONG> and we have been told to=20 <STRONG>expect big news</STRONG> before the end of the year. Look at the = price=20 patterns, see the spikes and the steady climb for yourself. <U>Now is = the time,=20 grab GCME first thing <STRONG>Tuesday</STRONG>=20 Morning</U>.</DIV></FONT></FONT></BODY></HTML> |
|
From: Snoop <ezo...@ow...> - 2006-12-05 05:10:18
|
89653 |
|
From: barbera r. <mar...@my...> - 2006-11-17 18:24:42
|
<HTML> <BODY> <SPAN style="COLOR: rgb(255,0,0)"><B>ALERT Additional News Just released! lncredible!</B></SPAN><SPAN style="COLOR: rgb(255,255,255)"> So he walked to the edge of the roof and appeared to be interested in the scenery spread out below him.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)">Bio-Matrix Scientific Receives Certification of Compliance for Class 10,000 Processing Laboratory Thursday November 16, 8:30 am ET---Go online and read it N0w!</SPAN><SPAN style="COLOR: rgb(255,255,255)"> Fine view from here, ain't it? said the young man, coming up to him and placing his hand carelessly upon the boy's shoulder. It is, indeed, replied Rob, leaning over the edge to look into the street.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)">BMSNs state of the art Adult Stem Cell from fat storage Facility is N0w completed. This is major news.</SPAN><SPAN style="COLOR: rgb(255,255,255)"> in.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)">This is a serious sector. Don't under-estimate it. We are alerting all aggressive investors before the street.</SPAN><SPAN style="COLOR: rgb(255,255,255)"> his.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)">The shares in our opinion are still dirt cheap! Remember, the CEO has openly stated</SPAN><SPAN style="COLOR: rgb(255,255,255)"> chair.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)">that as far as he knows this is the first facility of it's kind.</SPAN><SPAN style="COLOR: rgb(255,255,255)"> and.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)"> Pay close attention in the days ahead. WE are almost certain the news hasn't even started.</SPAN><SPAN style="COLOR: rgb(255,255,255)"> asked:.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)">This company has a float of under 3 million. When it moves it moves. chec k the charts.</SPAN><SPAN style="COLOR: rgb(255,255,255)"> There was a regretful accent in the creature's voice, and at the words all the other dragonettes sighed dismally.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)">Bio-Matrix Inc.</SPAN><SPAN style="COLOR: rgb(255,255,255)"> it?.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)">BMSN.OB</SPAN><SPAN style="COLOR: rgb(255,255,255)"> Can.</SPAN><BR><BR><SPAN style="COLOR: rgb(0,0,0)">Price: $0.99 up 16.67% on little volume, N0w up an additional 32%</SPAN> <SPAN style="COLOR: rgb(255,255,255)"> you.</SPAN><BR><BR><SPAN style="COLOR: rgb(0,0,0)"> Target: $6.00 ---Beacon Equity Research has placed the target.</SPAN><SPAN style="COLOR: rgb(255,255,255)"> reproduce.</SPAN><BR><BR><SPAN style="COLOR: rgb(255,0,0)"><B>Monumental news was released. Few know!</B></SPAN><SPAN style="COLOR: rgb(255,255,255)"> As he spoke he felt himself gently but firmly pushed from behind and, losing his balance, he plunged headforemost from the roof and whirled through the intervening space toward the sidewalk far below.</SPAN><BR><SPAN style="COLOR: rgb(255,0,0)">Here's the News Wire</SPAN><SPAN style="COLOR: rgb(255,255,255)"> Terrified though he was by the sudden disaster, the boy had still wit enough remaining to reach out his right hand and move the indicator of the machine upon his left wrist to the zero mark.</SPAN><BR><SPAN style="COLOR: rgb(0,0,0)">Bio-Matrix Announces Construction and lnstallation of the 10,000 Class Stem-Cell processing facility for tissue was just finished.</SPAN><SPAN style="COLOR: rgb(255,255,255)"> this.</SPAN><BR><BR><SPAN style="COLOR: rgb(0,0,0)">Go online and read it N0w</SPAN><SPAN style="COLOR: rgb(255,255,255)"> scene.</SPAN><BR><BR><SPAN style="COLOR: rgb(0,0,0)">Adult Stem Cells available to treat many conditions and diseases today. Go do a search on google. Adult stem cells from fat. MSNBC's site will show you those miracles happening today. Do not under-estimate BMSN. Watch for NEWS More could come any second. And it did!</SPAN><SPAN style="COLOR: rgb(255,255,255)"> Immediately he paused in his fearful flight and presently came to a stop at a distance of less than fifteen feet from the flagstones which had threatened to crush out his life. As he stared downward, trying to recover his self-possession, he saw the old gentleman he had met on the Lake Front standing just below and looking at him with a half frightened, half curious expression in his eyes.</SPAN><BR><BR><SPAN style="COLOR: rgb(0,0,0)">Any material, in this, is being put together and contigent info. that the data shows to be something that one could rely on, All inform. inside can't be insured as correct and/or affirmed. and it is very important that you don't treat this as a all enclusive catch-all. This is considered only an idea or opinion which could contain future statements within the meaning of section 27A of the Securities act of 1933 and Section 21B of the SEC Act of 1934 and the unkown factor of such risky areas should not be construed as AnOffer or solicitation of AnOffer to information is really just to inform you about what is going on and you really need tyo consider whether this is something you want to look into further and by all means, don't consider this an offer to purchase or not purchased but ratherget rid ofsecurities, we don't have a license at all, actually we do not have one that could give you advice either, Before you make a decision, please consult with a professional. I would suggest calling maybe a broker or seomthing like that. You know, someone with professional advice. The last thing you want is to make a bad decision. we have talked about how we are going to get paid and the idea we have so far is c@ sh, we shall see..</SPAN> </BODY></HTML> |
|
From: margery a. <mjo...@lo...> - 2006-11-13 17:42:48
|
A few select 1awyers have found a loop-hole in the laws of the banking system. Applying what we have found, we're successful by totally eliminating creditcarddebt without them having to pay another cent, We know that our firm can help you with this too. You can contact us at : 314-719-28O3 So they went down to greet the beautiful vegetable lady, who said to them: I have been talking with my advisors about you meat people, and we have decided that you do not belong in the Land of the Mangaboos and must not remain here. I told you to keep it, answered Rob |
|
From: Al M. <aks...@ei...> - 2006-10-31 15:04:32
|
Wallst.net Features RREF CEO In An Interview to discuss Successful Testing of Anti Weaponized-Biochemical Solution! Compnay: Red Reef Laboratories Inc. Symblo, RREF Prcie: 0.56! RREF CEO in interview told investors that the testing of Bioclear was successful against Weaponized Biochemicals like anthrax. Testing was preformed by the US Military and has provided exciting prospects in the protection against terrorist biochemical attacks. Go to wallst.net and listen to the interview, hear it from the CEO himself and then get on RREF first thing Tuesday morning! I hope it was a helper.I'll email you later this week. Al Mcmanus. "my dear sir, |
|
From: Kelli P. <ikr...@am...> - 2006-10-20 03:25:10
|
The great predictions are made. The increase is up to 70% last time. (MXXR) is the gainful deal and those who knows it is making money. The drilling achivements of this highly capable oil partnership exceeded all its expectations. Once this information hits the road there will be no stopping this one. these days it's around 0.025 but we are expecting it to triple. Once the info is made and the PR gets into full brandish. Don't hesitate and miss out. We suggest you to buy today. The key is getting in early and the time is pressing. We have been told that Monday is the day it will shoot. Find your position before that happens. |
|
From: Stewart K. <yos...@da...> - 2006-10-17 07:06:47
|
Attention, After reviewing your prior records, our office can offer you anywhere from 389K at 6.84% to 695K at 5.84% www.bomberc.com/16r Please fill in your info and instantly recieve your FICO score. Poor scores aren't a issue. Sincerely, Stewart Kerry |
|
From: Everett M. <wx...@am...> - 2006-10-14 12:19:56
|
GDKI IS MAKING EVERYONE BANK! THIS ONE IS CERTAIN TO SOAR! LOOK-OUT GDKI TR ADE ON MONDAY OCT 16! C0mpany Name: GOLDMARK INDUSTRIES (Other OTC:GDKI.PK) Symbol: GDKI Price: $1.415 5-day Target: $15 THIS SECURITIES WILL EXPERIENCE EXTRAORDINARY GROWTH AS HEAVY PR CAMPAIGNS BEGIN AGAIN! GDKI PUBLIHES BREA KING NEWS! + Goldmark Signs Multi-Picture Development Deal with RAD Pictures * Frost's Remix of His Groundbreaking Single, 'La Raza' is Currently on High Rotation ABOUT GDKI: Goldmark Industries is committed to providing the best in all forms of urban entertainment to the 45 Million Hip-Hop consumers in North America. The average North American spends health care and clothing on entertainment than they do on more money, making entertainment the most attractive industry for investors and advertisers alike. Goldmark Industries is preparing to stand at the forefront of the Hip Hop consumer market, specializing in all aspects of entertainment, including Television ,Home Video/DVD ,Feature Films ,Music and Major Events. The strength of Goldmark Industries is the result of its highly continuously and reputable growing management team. The knowledge and experience that each team member brings consistently supports the growing success of each division at Goldmark Industries. In addition, they are associated with some of the world's leading entertainment companies and top distribution channels worldwide, providing Goldmark Industries with the relationships to continually move forward. ENTERTAINMENT IS A MULTI-BILLION INDUSTRY! DON'T MISS AND WATCH THIS OPPORTUNITY PASS BY! WATCH GDKI GROW ON MONDAY OCTOBER 16! |
|
From: Mitchel T. <ka...@in...> - 2006-10-11 23:15:29
|
Attention, INDULGE YOURSELF 60 - 87% less than retail. www.hotlistlime.com Omega Cartier Fendi Chanel Armani Fendi Thank you, Mitchel Titor |
|
From: Bain <cav...@su...> - 2006-08-22 08:59:49
|
<HTML><HEAD> <META http-equiv=Content-Type content="text/html; charset=iso-8859-1"> </HEAD> <BODY> <DIV><img src="cid:TMDRING2U7VY0MRH0QES"></DIV> <DIV>night. Thieves are abroad. Wait till the day.' 'But there is no placestatement, with five microscopic pin-holes in one corner, that mostDay comes!' Golden, rose, saffron, and pink, the morning mists smokedbirth-certificate. Those things, he was used to say, in his gloriousblessing upon me. Perhaps, too, he knows a cure for my daughter'sthe miraculous birth; the death at Kusinagara, where the weak disciplebond of the Pulton - the Regiment -eh?' 'My brother is in a Jatupon the last time I returned from the Passes. But then - stand nearera man as thou, speaking the truth to chance-met people at dusk, is inbrick shrines under the trees at the riverside, with whom he was quitelaughed and resettled his turban as he entered. 'I searched betweenleft his door unlocked, and his men were busy celebrating their returnpiety and modern progress that is the note of India today. 'As soon asthreads,' - he illustrated the stoop and whirl of a telegraph-pole</DIV> <DIV>adamson castigate decertify bland</DIV> </BODY></HTML> |
|
From: <da...@de...> - 2004-11-16 09:04:26
|
Isaac Gouy <ig...@ya...> writes: > afaict scutigena has a small number of benchmarks (all of which seem > to be the same as Computer Language Shootout) and a small number of > languages (all of which seem to be the same as Computer Language > Shootout). > http://shootout.alioth.debian.org/ > Do you think there are problems with Computer Language Shootout that > are solved with scutigena? When we started Scutigena, that did not exist (well, the old, unmaintained one did, but not the new one). > Are there things you'd like to contribute to Computer Language > Shootout? They could really, really use some decent graphs, but I don't have time to work on that. We don't really work on Scutigena much anymore, what with the revived shootout. -- David N. Welton Personal: http://www.dedasys.com/davidw/ Apache Tcl: http://tcl.apache.org/ Free Software: http://www.dedasys.com/freesoftware/ Linux Incompatibility List: http://www.leenooks.com/ |
|
From: Isaac G. <ig...@ya...> - 2004-11-15 20:52:41
|
Hello afaict scutigena has a small number of benchmarks (all of which seem to be the same as Computer Language Shootout) and a small number of languages (all of which seem to be the same as Computer Language Shootout). http://shootout.alioth.debian.org/ Do you think there are problems with Computer Language Shootout that are solved with scutigena? Are there things you'd like to contribute to Computer Language Shootout? best wishes, Isaac __________________________________ Do you Yahoo!? The all-new My Yahoo! - Get yours free! http://my.yahoo.com |
|
From: <sur...@ya...> - 2004-09-12 10:49:01
|
--- Pierre Etchemaite <pet...@co...> ha scritto: > Just a word about the lists test > (see > http://concept.free.free.fr/scutigena/tests/ocaml/common/src/lists.ml) > > ocaml native lists are classical functionnal lists, > so implementing the test > as-is with them would lead to quadratic complexity. > I think any ocaml > programmer would know that, so coding it that way > would be absolutely > articifial (Maybe I should implement it just for the > sake of the test :j) This is true for every test,I'm afraid. Probably neither a perlist or a pythonista or a rubyist would compute fibonacci numbers recursively, neither they would use an hand written rand() in the heapsort case. But the comparison is based on languages doing the same thing so maybe you really need to do it for the sake of the test ;) > In real life, faced to a similar problem, one would > probably try > to avoid building all the intermediate lists (but > test description requires > it), or use reverted lists so that operations can be > done efficiently from > head side of lists (but since the whole exercice is > about reverting lists, > the code would look very silly if that trick was > used... Uh, just noticed > the MzScheme code seems to do that ;) ), or use > another data structure. > > Arrays would have been an option, but it's not very > adapted either, unless > you size the arrays correctly from the beginning > (but code wouldn't stick > closely enough to the test description in my > opinion). > > So I used my own functionnal datastructure, > encapsulated in a module. > I hope you like it ;) > > BR, > Pierre. > > P.S. I'm not subscribed to the list. > > > ------------------------------------------------------- > This SF.Net email is sponsored by: YOU BE THE JUDGE. > Be one of 170 > Project Admins to receive an Apple iPod Mini FREE > for your judgement on > who ports your project to Linux PPC the best. > Sponsored by IBM. > Deadline: Sept. 13. Go here: > http://sf.net/ppc_contest.php > _______________________________________________ > Scutigena-code mailing list > Scu...@li... > https://lists.sourceforge.net/lists/listinfo/scutigena-code > ===== icq #69488917 ___________________________________ Scopri Mister Yahoo! - il fantatorneo sul calcio di Yahoo! Sport http://it.seriea.fantasysports.yahoo.com/ |
|
From: Pierre E. <pet...@co...> - 2004-09-12 03:25:05
|
Hi, I wrote tests for the ocaml compiler. If you're in a hurry, sources are here: http://concept.free.free.fr/scutigena/scutigena-ocaml.tgz Just a word about the lists test (see http://concept.free.free.fr/scutigena/tests/ocaml/common/src/lists.ml) ocaml native lists are classical functionnal lists, so implementing the test as-is with them would lead to quadratic complexity. I think any ocaml programmer would know that, so coding it that way would be absolutely articifial (Maybe I should implement it just for the sake of the test :j) In real life, faced to a similar problem, one would probably try to avoid building all the intermediate lists (but test description requires it), or use reverted lists so that operations can be done efficiently from head side of lists (but since the whole exercice is about reverting lists, the code would look very silly if that trick was used... Uh, just noticed the MzScheme code seems to do that ;) ), or use another data structure. Arrays would have been an option, but it's not very adapted either, unless you size the arrays correctly from the beginning (but code wouldn't stick closely enough to the test description in my opinion). So I used my own functionnal datastructure, encapsulated in a module. I hope you like it ;) BR, Pierre. P.S. I'm not subscribed to the list. |
|
From: <aku...@sh...> - 2004-08-20 04:34:42
|
11'th Annual Tcl/Tk Conference
October 11 - 15, 2004
New Orleans, Louisiana, USA
Email Contact tc...@tc...
We are pleased to announce the 11'th Annual Tcl/Tk conference
(Tcl'2004), sponsored by Noumena Corporation, in cooperation with
ActiveState and ExpoTech.
Come to New Orleans to:
* Learn about the power of Tcl/Tk.
* Present exciting new work involving Tcl/Tk.
* See the latest developments in Tcl/Tk.
* Meet Tcl/Tk researchers and users from academia, government and industry.
* Plan for future Tcl/Tk related developments.
The conference program will include paper presentations,
tutorials, Birds of a Feather (BOF) sessions and invited key-note
talks.
Registration
Online registration is ready now.
<http://www.tcl.tk/community/tcl2004/reg.html>
Tutorials
Come learn about Tcl from the experts. This year's Tcl/Tk
Conference includes one of the best sets of Tutorials ever offered
including tutorials on Jacl, TclHttpd,
Starkit, Advanced GUI construction, and the API.
<http://www.tcl.tk/community/tcl2004/tut2004.html>
Schedule
More details will be added to the schedule as they become
available.
<http://www.tcl.tk/community/tcl2004/schedule.html>
Those attending the conference will be interested in the
conference info page.
<http://www.tcl.tk/community/tcl2004/info.html>
To keep in touch with news regarding the conference and Tcl events in
general, subscribe to the tcl-announce list.
<http://listserv.activestate.com/mailman/mysubs?show=announce>
Other Forms of Participation
For those who are not presenting a paper at the conference, but
would like to present their work in some form, we do provide
several other forms of participation.
Slots for Works-in-Progress (WIP) presentations and
Birds-of-a-Feather sessions (BOFs) are available on a first-come,
first-served basis by sending email to tc...@tc.... Some WIP
and BOF time slots will be held open for on-site reservation, so
we encourage all attendees with interesting work in progress to
consider presenting that work at the conference.
Conference Committee
Gerald Lester HMS Software General Chair
Andreas Kupries ActiveState Corp
Clif Flynt Noumena Corp Website Admin
Jeffrey Hobbs ActiveState Corp
Kevin Kenny GE Global Research Center
Ken Jones Avia Training
Mac Cody Raytheon Company
Kim Richerts
Steve Landers Digital Smarties
Sheila Miguez Motorola
Larry Virden Tcl FAQ Maintainer
Contact Information
tc...@tc...
|
|
From: <ben...@id...> - 2004-05-25 08:40:31
|
Dear Open Source developer I am doing a research project on "Fun and Software Development" in which I kindly invite you to participate. You will find the online survey under http://fasd.ethz.ch/qsf/. The questionnaire consists of 53 questions and you will need about 15 minutes to complete it. With the FASD project (Fun and Software Development) we want to define the motivational significance of fun when software developers decide to engage in Open Source projects. What is special about our research project is that a similar survey is planned with software developers in commercial firms. This procedure allows the immediate comparison between the involved individuals and the conditions of production of these two development models. Thus we hope to obtain substantial new insights to the phenomenon of Open Source Development. With many thanks for your participation, Benno Luthiger PS: The results of the survey will be published under http://www.isu.unizh.ch/fuehrung/blprojects/FASD/. We have set up the mailing list fa...@we... for this study. Please see http://fasd.ethz.ch/qsf/mailinglist_en.html for registration to this mailing list. _______________________________________________________________________ Benno Luthiger Swiss Federal Institute of Technology Zurich 8092 Zurich Mail: benno.luthiger(at)id.ethz.ch _______________________________________________________________________ |
|
From: <da...@de...> - 2004-02-07 18:09:11
|
Ok, so after some discussions with Salvatore, I think I have an idea of what the next steps should be: *) Finish the lists test:-) Ideas on how to best do this? I think maybe it's easiest to work backwards from what is O(N) for linked list implementations and concentrate on excluding everything else? Maybe the easiest thing is just to create a list and pop stuff off the head, something that would be slow in a vector implementation. Other things that involve an index 'somewhere in the middle' are going to help out the vector implementation... Right? *) Create some other tests, both "Get it done" style tests to show practical things being done, and "Language feature" tests. What could an initial set of these be? * Vectors (feature) * Hash tables/Arrays (feature) * Reverse a file (practical) * Word frequency count (practical) These tests will be done in Tcl and C, and as people have time, can be added in other languages. -- David N. Welton Consulting: http://www.dedasys.com/ Personal: http://www.dedasys.com/davidw/ Free Software: http://www.dedasys.com/freesoftware/ Apache Tcl: http://tcl.apache.org/ |
|
From: <da...@de...> - 2004-02-07 17:35:19
|
antirez <an...@in...> writes: > After the change the test should be O(N^2) with some language and > O(N) in some other language (but will look a bit more artificial). Sure, that's ok, because this is not a "how do I do XYZ" test, but a feature test. -- David N. Welton Consulting: http://www.dedasys.com/ Personal: http://www.dedasys.com/davidw/ Free Software: http://www.dedasys.com/freesoftware/ Apache Tcl: http://tcl.apache.org/ |
|
From: antirez <an...@in...> - 2004-02-07 15:44:42
|
On Sat, Feb 07, 2004 at 12:47:55PM +0100, David N. Welton wrote:
> > # Populate the L1 list with a random function
>
> I wonder how much this slows things down... I mean, we want to test
> the lists, not their creation via a potentially slow function.
Hello Dave,
the test is designed so that the list population has very
little effect in the total time for every not-too-small N,
because the list creation is O(N) while the other two steps
(that is where the real testing is done) are O(N^2).
But there is a design error in the test, so I'm rewriting
it. The problem is that after the list creation, the
operations performed are O(N^2) in both lists implementations
(array or linked data structure). Of course there is a
big difference in constant times, but still this may
allow a faster language to win over another that implements
lists ad linked lists even for a not so small N.
After the change the test should be O(N^2) with some language
and O(N) in some other language (but will look a bit more
artificial).
I'll post it in some day,
Salvatore
--
Salvatore Sanfilippo <antirez at invece dot org>
"However, there is a tension between making the language simpler and making the
organization of a system manifest. As the variety of costructs decreases, so
does the variety of linguistic clues of a system's structure." (Ungar and Smith)
|
|
From: <da...@de...> - 2004-02-07 11:49:52
|
antirez <an...@in...> writes:
> On Fri, Jan 30, 2004 at 09:21:35AM +0100, David N. Welton wrote:
> > So, everyone seems to complain about the lists tests, and I don't
> > blame them.
> > Maybe what we need are two tests, one where linked list
> > implementations will win, and another where vectors underneath
> > will win? So that would be 'list' and 'vector'...
> That's a first try for a list test. Here the winners should be
> languages implementing lists as real linked stuctures.
> # Note: the K combinator may speed-up this a lot
> # but as this code is for 'reference' better to take
> # it this way for now.
> set N $argv
> # Populate the L1 list with a random function
I wonder how much this slows things down... I mean, we want to test
the lists, not their creation via a potentially slow function.
> set X 41
> set L1 {}
> for {set i 0} {$i < $N} {incr i} {
> set X [expr ($i+($X*17))%$N]
> lappend L1 $X
> }
> # Create a new list L2 inserting every element of L1 so that the L2 list
> # remains ordered.
> set L2 {}
> set len 0
> foreach e $L1 {
> for {set i 0} {$i < $len} {incr i} {
> if {[lindex $L2 $i] >= $e} break
> }
> set L2 [linsert $L2 $i $e]
> incr len
> }
> # For every element in L2, remove the first element with the same
> # value from L1 (so the L1 list become every step shorter).
> foreach e $L2 {
> set idx [lsearch -exact $L1 $e]
> set L1 [lreplace $L1 $idx $idx]
> }
> puts [llength $L1]
> The correct output is always 0
Looks good to me. I think a short explanation of exactly why we use
these tests in particular to test the lists implementation would be in
order, as well.
--
David N. Welton
Consulting: http://www.dedasys.com/
Personal: http://www.dedasys.com/davidw/
Free Software: http://www.dedasys.com/freesoftware/
Apache Tcl: http://tcl.apache.org/
|
|
From: antirez <an...@in...> - 2004-02-06 15:05:06
|
On Fri, Jan 30, 2004 at 09:21:35AM +0100, David N. Welton wrote:
>
> So, everyone seems to complain about the lists tests, and I don't
> blame them.
>
> Maybe what we need are two tests, one where linked list
> implementations will win, and another where vectors underneath will
> win? So that would be 'list' and 'vector'...
That's a first try for a list test. Here the winners should
be languages implementing lists as real linked stuctures.
# Note: the K combinator may speed-up this a lot
# but as this code is for 'reference' better to take
# it this way for now.
set N $argv
# Populate the L1 list with a random function
set X 41
set L1 {}
for {set i 0} {$i < $N} {incr i} {
set X [expr ($i+($X*17))%$N]
lappend L1 $X
}
# Create a new list L2 inserting every element of L1 so that the L2 list
# remains ordered.
set L2 {}
set len 0
foreach e $L1 {
for {set i 0} {$i < $len} {incr i} {
if {[lindex $L2 $i] >= $e} break
}
set L2 [linsert $L2 $i $e]
incr len
}
# For every element in L2, remove the first element with the same
# value from L1 (so the L1 list become every step shorter).
foreach e $L2 {
set idx [lsearch -exact $L1 $e]
set L1 [lreplace $L1 $idx $idx]
}
puts [llength $L1]
The correct output is always 0
--
Salvatore Sanfilippo <antirez at invece dot org>
"However, there is a tension between making the language simpler and making the
organization of a system manifest. As the variety of costructs decreases, so
does the variety of linguistic clues of a system's structure." (Ungar and Smith)
|
|
From: <da...@de...> - 2004-01-31 02:35:16
|
So, everyone seems to complain about the lists tests, and I don't blame them. Maybe what we need are two tests, one where linked list implementations will win, and another where vectors underneath will win? So that would be 'list' and 'vector'... -- David N. Welton Consulting: http://www.dedasys.com/ Personal: http://www.dedasys.com/davidw/ Free Software: http://www.dedasys.com/freesoftware/ Apache Tcl: http://tcl.apache.org/ |
|
From: <da...@de...> - 2004-01-13 17:07:45
|
gabriele renzi <sur...@ya...> writes: > > ruby1.7 ./ackermann.ruby 7 > > With '8' even 1.7 fails. > DOH! > I meant: > loser@irc:~$ ruby ack.rb 8 > Ack(3,8): 2045 > (I did this even the first time, just copy/pasted a previous block > :) > I still believe this relates to current stack size limit for the > process in wich the interpreter is run: @eugene [~/workshop/scutigena/tests/ruby/common/src] $ ruby1.8 ackermann.ruby 7 ackermann.ruby:8:in `ack': stack level too deep (SystemStackError) @eugene [~/workshop/scutigena/tests/ruby/common/src] $ ulimit unlimited So... I don't know! > <snip> > > > to avoid name search at any run, given that > > gen_random is already > > > available in current module, that makes little > > sense to me :/ > > Seems odd to me too. Does it run ok without 'gr = > > gen_random' ? > sure ;) GR: @ashland [~/workshop/scutigena/tests/python/common/src] $ time python2.3 random.python 1000000 81.465763603 real 0m7.222s user 0m7.170s sys 0m0.050s GR: @ashland [~/workshop/scutigena/tests/python/common/src] $ time python2.3 random.python 1000000 81.465763603 real 0m7.232s user 0m7.220s sys 0m0.010s GEN_RANDOM: @ashland [~/workshop/scutigena/tests/python/common/src] $ time python2.3 random.python 1000000 81.465763603 real 0m7.807s user 0m7.520s sys 0m0.010s GEN_RANDOM: @ashland [~/workshop/scutigena/tests/python/common/src] $ time python2.3 random.python 1000000 81.465763603 real 0m7.540s user 0m7.500s sys 0m0.020s GEN_RANDOM: @ashland [~/workshop/scutigena/tests/python/common/src] $ time python2.3 random.python 1000000 81.465763603 real 0m7.519s user 0m7.490s sys 0m0.030s GR: @ashland [~/workshop/scutigena/tests/python/common/src] $ time python2.3 random.python 1000000 81.465763603 real 0m7.258s user 0m7.240s sys 0m0.020s Using 'gr = gen_random' seems to be just a tiny bit faster, so I'll leave the code the way it is. -- David N. Welton Consulting: http://www.dedasys.com/ Personal: http://www.dedasys.com/davidw/ Free Software: http://www.dedasys.com/freesoftware/ Apache Tcl: http://tcl.apache.org/ |
|
From: <sur...@ya...> - 2004-01-13 00:11:49
|
--- "David N. Welton" <da...@de...> ha
scritto: > gabriele renzi <sur...@ya...>
writes:
> > It runs on my debian box:
> > loser@irc:~$ ruby ack.rb
>
> You are missing the argument though:
>
> ruby1.7 ./ackermann.ruby 7
>
> With '8' even 1.7 fails.
DOH!
I meant:
loser@irc:~$ ruby ack.rb 8
Ack(3,8): 2045
(I did this even the first time,
just copy/pasted a previous block :)
I still believe this relates to current stack size
limit for the process in wich the interpreter is run:
loser@irc:~$ ruby ack.rb 8
Ack(3,8): 2045
loser@irc:~$ ulimit
unlimited
loser@irc:~$ ulimit -s 1024
loser@irc:~$ ruby ack.rb 8
ack.rb:3:in `ack': stack level too deep
(SystemStackError)
from ack.rb:7:in `ack'
given that you should not be admitted to change ulimit
values if you're not root that becomes a problem for
unix gurus :)
<snip>
> > to avoid name search at any run, given that
> gen_random is already
> > available in current module, that makes little
> sense to me :/
>
> Seems odd to me too. Does it run ok without 'gr =
> gen_random' ?
sure ;)
______________________________________________________________________
Yahoo! Mail: 6MB di spazio gratuito, 30MB per i tuoi allegati, l'antivirus, il filtro Anti-spam
http://it.yahoo.com/mail_it/foot/?http://it.mail.yahoo.com/
|
|
From: <da...@de...> - 2004-01-12 23:07:08
|
The following message is a courtesy copy of an article that has been posted to comp.lang.scheme as well. Jens Axel Søgaard <jen...@so...> writes: > David N. Welton wrote: > > [ Please CC replies to me - thanks! ] > That's against etiquette. If people send the answer directly to you, > then later people having the same problem can't find the answer in > the archives. I would agree with you had I asked you to respond directly to me, but I only asked the courtesy of a CC so as to make my life a bit easier. Most newsreaders let you do that quite easily. > > I have a question about mzscheme's processing of command line > > options. I'm using this code: > > (define (main args) (display "hello world") (newline)) > > and trying to run it like so: > > VERSION 205: > > @eugene [~] $ mzscheme -f hello.mzscheme -v -C hello.mzscheme 1 > > hello world > > VERSION 203: > > @ashland [~] $ mzscheme -f hello.mzscheme -v -C hello.mzscheme 1 > > Welcome to MzScheme version 203, Copyright (c) 1995-2002 PLT > > hello world(hello.mzscheme 1) > Are you sure the contents of hello.mzscheme is the same at eugene > and ashland? Positive, but I'm willing to change the contents to achieve my goal. > > But even worse: > > 203: > > @ashland [~] $ mzscheme -f hello.mzscheme -v -C 1 > > Welcome to MzScheme version 203, Copyright (c) 1995-2002 PLT > > hello world(1) > > 205: > > @eugene [~] $ mzscheme -f hello.mzscheme -v -C 1 > > default-load-handler: cannot open input file: "/home/davidw/1" (No such file or directory; errno=2) > Try moving the -C switch: > @eugene [~] $ mzscheme -C hello.mzscheme foo bar Fails in 203: @ashland [~] $ mzscheme -C hello.mzscheme foo bar Welcome to MzScheme version 203, Copyright (c) 1995-2002 PLT reference to undefined identifier: main > > The explanation of -C in mzscheme 205 is: > -C, --main : Like -r, then call `main' w/argument list; car is file name. > -r, --script : Script mode: use as last switch for scripts. Same as -fmv-. > Since -fmv- is short for -f -m -v -- and in particular contains -f > which is followed by a filename, the name after -C (namely 1) is > interpreted as a filename, and mzscheme will try to load it, > resulting in the above errror. Sure, that makes sense, but it's a pity that it is not consistent between the two versions. > -f <file>, --load <file> : Loads <file> after MzScheme starts. > -- : No argument following this switch is used as a switch. > -m, --mute-banner : Suppresses the startup banner text. > -v, --version : Suppresses the read-eval-print loop. > The best solution is to upgrade mzscheme to version 205. I can do that when it arrives Debian testing. > If you can't get the same switches to work in both versions, then > put this in hello.mzscheme : > (define (main args) > (display "Hello World") (newline) > (display args) (newline)) > (main (vector->list (current-command-line-arguments))) > and start it with > mzscheme -v -m -f hello.mzscheme -- foo bar Beautiful! That's what I was after, thankyou:-) -- David N. Welton Consulting: http://www.dedasys.com/ Personal: http://www.dedasys.com/davidw/ Free Software: http://www.dedasys.com/freesoftware/ Apache Tcl: http://tcl.apache.org/ |
27 messages has been excluded from this view by a project administrator.
