July 2010 - Pharo-dev - lists.pharo.org

[Pharo-project] Comparing floats
by Alexandre Bergel July 26, 2010

July 26, 2010

Hi! In one of my test, I want to check the equality of an array of floats. The following goes yellow: self assert: (service outgoingLinks collect: #bandwidth) asArray = #(0.876846926482685 14.7478812578828). But this one goes green: self assert: (service outgoingLinks collect: #bandwidth) asArray printString = '#(0.876846926482685 14.7478812578828)' . Any idea how I can avoid a conversion to strings? In JUnit, there is assertEquals(double, double, delta). Where delta is an approximation. Cheers, Alexandre -- _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: Alexandre Bergel http://www.bergel.eu ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.

2 2

[Pharo-project] Invalid utf8 input detected: now what?
by Schwab,Wilhelm K July 25, 2010

July 25, 2010

Hello all, I got an error (on Ubuntu 9.10) trying open an old text file that I created on Windows some time ago. The encoding (if gedit's save-as dialog can be trusted??) is Western ISO-8859-15; resaving as utf8 lets me read it. So, is Pharo working by design? Did I do the correct/only thing needed to read the file? What should I be asking? Is there anything I can do to turn this into a useful test/debugging example? Bill

6 10

[Pharo-project] Time Machine
by laurent laffont July 24, 2010

July 24, 2010

Hi, >From a discussion I had with Kent Beck about Continuous Testing / Autotest (see http://pharocasts.blogspot.com/2010/07/live-testing-with-autotest.html ), I would like to add a kind of Time Machine for Smalltalk code in Autotest. When a test fails, what I really want to know is why. Sometimes a test fails and I don't know why. So I have to go through a debugging session which distracts me from what I've been coding. So an idea is to diff backtrace before and after the test fails: - revert to last green - replay the test and save the trace - forward to current test and run (test fails) - compare execution paths in order to see the consequence of last change How would you do this ? Where should I look for materials which can help me coding this ? Cheers, Laurent Laffont http://pharocasts.blogspot.com/ http://magaloma.blogspot.com/

4 6

[Pharo-project] Symbol >> #asClass ?
by Philippe Marschall July 24, 2010

July 24, 2010

Hi VAST has an #asClass method on Symbol that does more or less this: Symbol >> #asClass ^ Smalltalk at: self This can be quite handy if you want to refer to a class that is not there a compile time, eg. Metacello. Think: #ConfigurationOfSeaside30 asClass load Cheers Philippe

7 17

[Pharo-project] Smalltalks 2010 Research Track: Call for Papers
by Andres Valloud July 24, 2010

July 24, 2010

** PLEASE EXCUSE US IF YOU RECEIVE MULTIPLE COPIES ** CALL FOR PAPERS SMALLTALKS 2010 4th Argentinian Smalltalk Conference Research Track: Call for Papers November 11th â 13th, 2010 Important dates: Submission (Hard Deadline): September 7th, 2010 (Argentinian time: UTC/GMT -3 hours). Notification of acceptance: October 6th, 2010. Camera Ready Submission: October 20th, 2010. --------------------------------------------------------------------------------- Conference Site: Universidad TecnolÃ³gica Nacional (UTN), ConcepciÃ³n del Uruguay (Entre RÃos, Argentina) In the past three years the Smalltalks series of conferences (www.fast.org.ar) have been a lively forum on Smalltalk-based software technologies that attracted over more than 200 people from both academia and industry for three days. During the first three conferences, the industrial partners showed the applicability of Smalltalk in business, while researches (both students and professors) showed their advances and didactic uses of Smalltalk. The presented approaches and methodologies concerned the language, its implementation technology, its programming tools as well as the software development culture it supports. This year the accepted papers not only will be available in the website but also the best ranked ones will be published in a special edition of Elsevier COMLAN Journal. Thus, we invite to submit papers in the research track on original scientific research conducted in and/or for Smalltalk in general. Topics of interest include, but are not restricted to: â¢ Aspects, Aspect Languages and Applications. â¢ Ambient Intelligence, Ubiquitous / Pervasive Computing and Embedded Systems. â¢ Compilation Technology, Optimization, Virtual Machines. â¢ Educational Material. â¢ Language Engineering, Extensions. â¢ Model Driven Engineering / Development. â¢ Meta-Modeling, Reflection and Meta-programming. â¢ Programming in the Large, Design, Architectures and Components. â¢ Programming Environments, Browsers, User Interfaces, UI Frameworks. â¢ Reasoning About Code (Analysis, Refactoring, Type Inference, Metrics). â¢ Team Management. â¢ Testing, Extreme Programming / Practices. â¢ Web Services, Internet Applications, Event-driven Programming. â¢ Experience Reports. Important dates: Submission (Hard Deadline): September 7th, 2010 (Argentinian time: UTC/GMT -3 hours). Notification of acceptance: October 6th, 2010. Camera Ready Submission: October 20th, 2010. Papers: Papers should be written in English, in pdf-format and not exceed 15 pages (including references and figures), using Elsevier journal format. Templates for LaTeX formats can be found at http://www.elsevier.com/wps/find/authorsview.authors/elsart Papers must be submitted through the EasyChair submission web site at http://www.easychair.org/conferences/?conf=smalltalks10 The accepted papers will be digitally available in the conference website. From accepted papers, selected ones will be published in a special edition of Elsevier COMLAN Journal. Papers submitted must not have been previously published and must not be under review for publication elsewhere. Papers must strictly adhere to submission guidelines. If you have questions, please send an e-mail to Marcus Denker and Gabriela ArÃ©valo to smalltalks2010-chair(a)fast.org.ar using [Smalltalks2010-RT] as a tag in the e-mail subject. Program Committee -------------------------- â¢ Alexandre Bergel (DCC, Universidad de Chile, Chile) â¢ Noury Bouraqadi (Ecole des Mines, Douai, France) â¢ Gilad Bracha (Ministry of Truth, USA) â¢ Johan Brichau (Inceptive.be, Belgium) â¢ Johan Fabry (DCC, Universidad de Chile, Chile) â¢ Alejandro Fernandez (LIFIA - Facultad de InformÃ¡tica â UNLP, Argentina) â¢ Tudor Girba (Sw-eng. Software Engineering GmbH, Switzerland) â¢ Andy Kellens (SOFT, Vrije Universiteit Brussels, Belgium) â¢ Michele Lanza (University of Lugano, Switzerland) â¢ Adrian Lienhard (SCG, University of Bern, Switzerland) â¢ Damien Pollet (INRIA / UniversitÃ© de Lille 1, France) â¢ Lukas Renggli (SCG, University of Bern, Switzerland) â¢ David RÃ¶thlisberger (SCG, University of Bern, Switzerland) â¢ Tom Van Cutsem (SOFT, Vrije Universeit Brussels, Belgium) Program Chairs -------------------- â¢ Marcus Denker (INRIA, Lille, France) â¢ Gabriela ArÃ©valo (Universidad Austral, Buenos Aires, Argentina) .

1 0

[Pharo-project] [update 1.2] #12065
by StÃ©phane Ducasse July 23, 2010

July 23, 2010

12065 ----- - Issue 2654: ChangeList ENH from eliot.

1 0

[Pharo-project] Object-oriented reengineering patterns :)
by StÃ©phane Ducasse July 23, 2010

July 23, 2010

In changeList browseCurrentVersionsOfSelections "Opens a message-list browser on the current in-memory versions of all methods that are currently seleted" | aList | aList := OrderedCollection new. Cursor read showWhile: [ 1 to: changeList size do: [:i | (listSelections at: i) ifTrue: [ | aClass aChange | aChange := changeList at: i. (aChange type = #method and: [(aClass := aChange methodClass) notNil and: [aClass includesSelector: aChange methodSelector]]) contentsDiffedFromCurrent "Answer the contents diffed forward from current (in-memory) method version" | aChange aClass | listIndex = 0 ifTrue: [^ '']. aChange := changeList at: listIndex. (aChange type == #method and: [(aClass := aChange methodClass) notNil and: [aClass includesSelector: aChange methodSelector]]) ifTrue: destroyCurrentCodeOfSelections "Actually remove from the system any in-memory methods with class and selector identical to items current selected. This may seem rather arcane but believe me it has its great uses, when trying to split out code. To use effectively, first file out a change set that you wish to split off. Then open a ChangeList browser on that fileout. Now look through the methods, and select any of them which you want to remove completely from the system, then issue this command. For those methods where you have made changes to pre-existing versions, of course, you won't want to remove them from the system, so use this mechanism with care!" | aClass aChange aList | aList := OrderedCollection new. 1 to: changeList size do: [:index | (listSelections at: index) ifTrue: [aChange := changeList at: index. (aChange type = #method and: [(aClass := aChange methodClass) notNil and: [aClass includesSelector: aChange methodSelector]]) ifTrue: and a couple more.... I like old design. It is sweet and you feel cool when you fix it. Stef

1 0

[Pharo-project] About validating the result of RBParser >> parseMethod:
by Fernando olivero July 23, 2010

July 23, 2010

I have a question about validating a methodNode, suppose we have the following: parsedNode := RBParser parseMethod: 'test ^ self add: anUnbindedVariable'. Is there a way of checking the health/validity of the parsedNode? I couldn't find any behavior in RBMethodNode or related classes. Lukas, do you have an idea is i could run any Lint rule? My idea is to provide a method editor morph, that prevents from accepting invalid sources, and informs the user any problems detected with the edited code. Thanks, Fernando

4 10

[Pharo-project] Another RB engine change
by Fernando olivero July 23, 2010

July 23, 2010

Hi Lukas, here is another change in the RB engine package. RBClass>>realName: aSymbol self realClass: (Smalltalk at: aSymbol) => self realClass: (Smalltalk globals at: aSymbol) Fernando

4 3

[Pharo-project] Literal array with evaluated value of stmts, vars etc..
by Sudhakar Krishnamachari July 23, 2010

July 23, 2010

Would this be of interest in general... I have always wanted a more capable literal array than what we have now.. #( 123 23 'das' ) whynot: #( 'ac'->23 2->'casd' myVar1) ... evaluates to a collection.. so I just tried this out with a BlockClosure: asArray | stmts anArray | stmts := self decompile statements. anArray := Array new: stmts size. stmts doWithIndex: [ :eaNode :indx| | start end value| start := (eaNode asString indexOf: ${)+1. end := (eaNode asString lastIndexOf: $})-1. value := Compiler evaluate: (eaNode asString copyFrom: start to: end) for: self receiver logged: false. anArray at: indx put: value]. ^anArray So we could do: ['abc'->123. 'def'->456. 'efg'->789. 'hij'->123. 'klm'->456.] asArray. [self checkThisUsingKeywordMethod: 'abc' with:'efg'. localVar1. instanceVar1 ] asArray to yield arrays.. not neat, I would much rather prefer the literals do their job their way... but works.. for the narrow set I have tried so far.. Any comments.. -Skrish

6 19