May 2013 - Pharo-dev - lists.pharo.org

Re: [Pharo-project] Zeroconf and Windows: recommended environment?

by Camillo Bruni

On 2013-05-05, at 10:43, "phil(a)highoctane.be" <phil(a)highoctane.be> wrote: > I am using MobaXterm (http://mobaxterm.mobatek.net/) on Windows to have a > Unix-like environment. > > Thing is that the shell there is bash but all utilities (like unzip etc) > are based on busybox (http://www.busybox.net/) > > This means that not all options are available. > > Also, the $OS variable looks like to give Windows_NT, which then leads to > the "Unsupported OS" message (for the VM for example). > > What is the environment you guys do use for testing those scripts on > Windows (Windows 7 in my case)? we run everything under mingw, but I can add (yet) another switch to test for windows. Currently I check already for *windows* *mingw* and we can add *cygwin* or maybe I should just use *win*? :) => can you open a bug report? I'll look into it later this day

May 5, 2013

[Pharo-project] Zeroconf and OS string

by phil＠highoctane.be

on Mobaxterm the output of uname -a is [Philippe.DELLGFX] â uname -a CYGWIN_NT-6.1-WOW64 DELLGFX 1.7.17(0.262/5/3) 2012-10-28 12:24 i686 GNU/Linux Clearly no Windows in there. Phil

May 5, 2013

[Pharo-project] Zeroconf and Windows: recommended environment?

by phil＠highoctane.be

I am using MobaXterm (http://mobaxterm.mobatek.net/) on Windows to have a Unix-like environment. Thing is that the shell there is bash but all utilities (like unzip etc) are based on busybox (http://www.busybox.net/) This means that not all options are available. Also, the $OS variable looks like to give Windows_NT, which then leads to the "Unsupported OS" message (for the VM for example). What is the environment you guys do use for testing those scripts on Windows (Windows 7 in my case)? Thanks in advance, Phil

May 5, 2013

[Pharo-project] How to "fix" "broken" mcz files?

by Holger Hans Peter Freyther

Hi, when I port a project to GNU Smalltalk I tend to use the snapshot/*.st and convert it. Now with some MCZ versions of Aida/Iliad this is failing because the fileout is broken. The fileout is broken in a way that at some point (without a BOM) the creator started to use UCS-4 (or such) for the strings. This can be seen here[1] and either manually extracting the source and using FileStream>>#fileIn: or by using the MczInstaller on the mcz file (which is not working on the snapshot of the MCDefinition) the import will fail. Is this a known/fixed problem with Monticello/Pharo? Is there a way to re-create the source.st from the snapshot of the MCDefinitions? thanks holger [1] http://www.squeaksource.com/IliadDev/Iliad-Core0.9.1-SebastienAudier.5.mcz

May 5, 2013

[Pharo-project] NeoCSV skip fields

by Sean P. DeNigris

| reader | FileStream fileNamed: fileName do: [ :file | "skip headers" file nextLine; nextLine; nextLine. reader := NeoCSVReader on: file. reader separator: Character tab; recordClass: MyClass; addField: #name:; "throw away" addField: #name:; addField: #type:; "throw away" addField: #type:; "throw away" addField: #type: converter: [ :str | MyOtherClass on: str ]; addFloatField: #balance:; addField: #ignore:; addField: #ignore:; addField: #ignore:; addField: #ignore:. ^ reader upToEnd. ]. To ignore fields, I'm passing a selector that will be overwritten later on in the parsing, but that doesn't work with the last fields, so I had to add a special setter to my domain object to ignore those - yuck! Is there a feature like this built into NeoCSV? Thanks :) ----- Cheers, Sean -- View this message in context: http://forum.world.st/NeoCSV-skip-fields-tp4685751.html Sent from the Pharo Smalltalk mailing list archive at Nabble.com.

May 5, 2013

[Pharo-project] PluggableListMorph never receives ctrl/cmd keys

by Sean P. DeNigris

If you put a breakpoint in ScrollPane>>#scrollByKeyboard:, and then type a key into a DropListMorph, the breakpoint will hit unless you were holding down ctrl or cmd. Since the purpose of the method is to check "event controlKeyPressed or:[event commandKeyPressed]", this obviously is no bueno. ----- Cheers, Sean -- View this message in context: http://forum.world.st/PluggableListMorph-never-receives-ctrl-cmd-keys-tp468… Sent from the Pharo Smalltalk mailing list archive at Nabble.com.

May 5, 2013

[Pharo-project] [regression reporter]regression occurred

by no-reply＠ci.inria.fr

https://ci.inria.fr/pharo/job/Pharo-3.0-Update-Step-2-Validation/./label=wi… 3 regressions found. Tests.Release.ReleaseTest.testObsoleteBehaviors Tests.Release.ReleaseTest.testObsoleteClasses Tests.System.OSEnvironmentTest.testAtPut

May 4, 2013

[Pharo-project] [update 3.0] #30103

by Marcus Denker

May 4, 2013

Re: [Pharo-project] [update 3.0] #30086

by Sean P. DeNigris

mmimica wrote > How about a 2.0 backport? As much as you all know I love backporting, in this case it's probably not a good place to apply resources. The changes are deep and it's been broken for years. ----- Cheers, Sean -- View this message in context: http://forum.world.st/update-3-0-30086-tp4685125p4685701.html Sent from the Pharo Smalltalk mailing list archive at Nabble.com.

May 4, 2013

Re: [Pharo-project] How to Debug :D

by Frank Shearar

It's not CPS, but it is a bit like a hand-rolled limited tail call elimination. frank On 4 May 2013 19:02, stephane ducasse <stephane.ducasse(a)free.fr> wrote: > Thanks. This is CSP passing style? I thought it was different. > Now going to eat and after I will digest that. > Thanks for the snippet. > > Stef > >> A trampoline looks like this: >> >> Foo >> trampoline: initialValue into: aUnaryBlock >> | v | >> v := [initialValue]. >> [v isBlock] whileTrue: [v := aUnaryBlock value: v value]. >> ^ v. >> >> and then used: >> >> | f factorial | >> factorial := 1. >> f := Foo new. >> f trampoline: 10 into: [ :n | >> n <= 0 >> ifTrue: [factorial] >> ifFalse: [factorial := factorial * n. [n - 1]]]. >> >> The important thing is that the block returns a value for the base >> case/cases of the recursion, and a block that, when evaluated, will >> yield the next value on which to recurse. (So the block replaces the >> recursive call.) >> >> The trampoline thus turns the recursive algorithm into an iteration. >> >> frank >> >> On 4 May 2013 17:42, stephane ducasse <stephane.ducasse(a)free.fr> wrote: >>> can you explain? >>> Because I read something like that olong time ago and I forgot >>> >>> On May 4, 2013, at 5:41 PM, Frank Shearar <frank.shearar(a)gmail.com> wrote: >>> >>> So use a trampoline. Then you can define your recursion naturally, in >>> constant stack space. >>> >>> frank >>> >>> On 04 May 2013, at 16:08, stephane ducasse <stephane.ducasse(a)free.fr> wrote: >>> >>> I understand why he wants that :) >>> no stack explosionâ¦ >>> >>> Stef >>> >>> On May 4, 2013, at 12:37 PM, ClÃ©ment Bera <bera.clement(a)gmail.com> wrote: >>> >>> To be more precise, for the method : >>> >>> foo >>> ^ 1 + 2 >>> >>> AST will be : >>> ^ >>> \ >>> + >>> / \ >>> 1 2 >>> >>> AST Interpreter, to interpret ^, will do something like : >>> start interpret ^ >>> interpret subnode of ^ >>> start interpret + >>> interpret subnodes of + >>> interpret 1 >>> interpret 2 >>> interpret + with subnodes interpretation result >>> end interpret + >>> interpret ^ with subnode interpretation result >>> end interpret ^ >>> >>> Igor would like to have a flatten AST that would be in an array like : >>> #( 1 2 + ^ ) >>> Then you can interpret it with a loop >>> [currentASTNode hasNextNode] whileTrue: [ self interpret: currentASTNode >>> nextNode ]. >>> And interpretation looks like : >>> interpret 2 >>> interpret 1 >>> interpret + with two precedent results on stack >>> interpret ^ with precedent result on stack >>> >>> 2013/5/4 ClÃ©ment Bera <bera.clement(a)gmail.com> >>>> >>>> 2013/5/4 stephane ducasse <stephane.ducasse(a)free.fr> >>>>> >>>>> >>>>> On May 4, 2013, at 1:04 AM, Igor Stasenko <siguctua(a)gmail.com> wrote: >>>>> >>>>>> Did i said already that i don't like how ASTInterpreter implemented? :) >>>>> >>>>> >>>>> We will let perfection for later :) >>>> >>>> >>>> It is not a question of perfection or so. >>>> >>>> Igor does not like that we interpret recursively the AST instead of with a >>>> loop (ASTInterpreter>>interpret: calls itself again and again). He would >>>> like to have a flatten-AST-interpreter, with a loop like: >>>> >>>> [currentASTNode hasNextNode] whileTrue: [ self interpret: currentASTNode >>>> nextNode ]. >>>> >>>> But Camillo and I don't want that because it interprets a flatten AST, >>>> not a tree. >>>> >>>>> >>>>>> >>>>>> Nevertheless, it is useful.. and this case clearly demonstrates that. >>>>>> >>>>>> On 4 May 2013 00:14, Clara Allende <clari.allende(a)gmail.com> wrote: >>>>>>> This is great news! Are you going to publish the code? it will come in >>>>>>> handy >>>>>>> for my summer of code :D >>>>>>> >>>>>> >>>>>> Camillo has the image >>>>>> >>>>>>> >>>>>>> On 3 May 2013 03:21, stephane ducasse <stephane.ducasse(a)free.fr> >>>>>>> wrote: >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> Begin forwarded message: >>>>>>>> >>>>>>>> From: Camillo Bruni <camillobruni(a)gmail.com> >>>>>>>> Subject: [Lsehub-staff] How to Debug :D >>>>>>>> Date: May 2, 2013 6:22:06 PM GMT+02:00 >>>>>>>> To: RMoD private list <lsehub-staff(a)lists.gforge.inria.fr> >>>>>>>> Reply-To: RMoD private list <lsehub-staff(a)lists.gforge.inria.fr> >>>>>>>> >>>>>>>> Igor: Camillo can you help me debugging this strange athens rendering >>>>>>>> bug >>>>>>>> Cami: sure >>>>>>>> >>>>>>>> Igor: where do you think the bug is? The green path jumps if I change >>>>>>>> the >>>>>>>> Y coordinate and it shouldn't... >>>>>>>> Cami: no clue... >>>>>>>> >>>>>>>> Igor: Any clue how to get to the bug? >>>>>>>> Cami: let's use the ASTInterpreter to interpret two methods with >>>>>>>> different >>>>>>>> transformation matrices and see when they diverge. >>>>>>>> >>>>>>>> Result: >>>>>>>> ------- >>>>>>>> - after 1h comparing AST Debugger is ready >>>>>>>> - we run the two traces, they do NOT diverge => ???? >>>>>>>> >>>>>>>> Conclusion: >>>>>>>> ----------- >>>>>>>> Cairo, which was chosen as reference, did not properly draw the >>>>>>>> path!!! >>>>>>>> >>>>>>>> So we should publish the code of the ComparingInterpreter a bit and >>>>>>>> we >>>>>>>> can use it for a few more tasks in Pharo ;) >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>> >>>>>> >>>>>> >>>>>> >>>>>> -- >>>>>> Best regards, >>>>>> Igor Stasenko. >>>>>> >>>>> >>>>> >>>> >>>> >>> >>> >>> >>> -- >>> ClÃ©ment BÃ©ra >>> Mate Virtual Machine Engineer >>> BÃ¢timent B 40, avenue Halley 59650 Villeneuve d'Ascq >>> >>> >>> >> > >

May 4, 2013