- Pharo-dev - lists.pharo.org

moose 4.9

by Tudor Girba

We are happy to announce version 4.9 of the Moose Suite: http://moosetechnology.org/download/4.9 This is a minor release still based on Pharo 2.0. The differences from Moose 4.8 are: The Mondrian engine was removed. The transition to Roassal is now complete. - Small fixes in Roassal layouts and rendering. - Small fix in FAMIX regarding manipulation of accesses. - Small visual fix in Glamour for rendering splitters in tables. A list of issues addressed in this release can be found at: http://code.google.com/p/moose-technology/issues/list?can=1&q=status=Fixed%… The Moose Suite 4.9 comes for each platform as a separate bundle: - Moose Suite 4.9 for Mac https://dl.dropboxusercontent.com/u/18323746/Moose/moose_suite_4_9-mac.zip - Moose Suite 4.9 for Windows https://dl.dropboxusercontent.com/u/18323746/Moose/moose_suite_4_9-win.zip - Moose Suite 4.9 for Linux https://dl.dropboxusercontent.com/u/18323746/Moose/moose_suite_4_9-linux.zip The Moose Suite 4.9 can also be loaded in a Pharo 2.0 image either from the Configuration Browser, or by executing the following script: Gofer new smalltalkhubUser: 'Moose' project: 'Moose'; package: 'ConfigurationOfMoose'; load. ((Smalltalk at: #ConfigurationOfMoose) project version: '4.9-snapshot') load

Oct. 30, 2013

Re: [Pharo-dev] Slides of my Lecture this morning..

by HernÃ¡n Morales Durand

I really liked it. Thank you Marcus. HernÃ¡n 2013/10/29 Marcus Denker <marcus.denker(a)inria.fr> > Hi, > > I am just visiting Jordi Delgado in Barcelona and I gave a lecture in his > course this morning. > âAdvanced Reflection in Pharoâ, this is meant to be a lecture after an > introduction to standard > Smalltalk reflection. > > SlideShare > http://www.slideshare.net/MarcusDenker/lecture-27685035 > > PDF > http://marcusdenker.de/talks/13BarcelonaLecture/ > > > Marcus >

Oct. 30, 2013

Re: [Pharo-dev] [Pharo-users] Pharo Sprint in Buenos Aires Nov 7th

by HernÃ¡n Morales Durand

What is the agenda? I would like to create UI visually. Any interest on this? HernÃ¡n 2013/10/29 Gisela Decuzzi <giseladecuzzi(a)gmail.com> > Hello, we are organizing a Pharo Sprint in Bs As: > > When: November 7th, starting at 10:00 am > Where: 10 Pines (Av Leandro N. Alem 693 5Â°B) > > >

Oct. 30, 2013

Re: [Pharo-dev] About BitBlt current -> BitBlt (Fuel)

by Max Leske

Bleeding edge only: Name: Fuel-MaxLeske.787 Author: MaxLeske Time: 29 October 2013, 11:41:05.948727 pm UUID: 2199a684-70e6-4dee-b3f1-ee389d959aed Ancestors: Fuel-MarianoMartinezPeck.775, Fuel-MaxLeske.786 merging tips from 3.0 development and fuel repo On 29.10.2013, at 19:56, Max Leske <maxleske(a)gmail.com> wrote: > Thanks Mariano, Iâll look at that. > > On 29.10.2013, at 15:39, Mariano Martinez Peck <marianopeck(a)gmail.com> wrote: > >> Max, we use a primitive from BitBtl to perform writing of word-like instances (Bitmaps etc). It makes writing word objects way faster. >> Check the method #copyWordObjectToBuffer: aWordObject and its senders. >> >> Cheers, >> >> >> >> On Tue, Oct 29, 2013 at 6:55 AM, Max Leske <maxleske(a)gmail.com> wrote: >> Stef, what exactly is the influence on Fuel? I looked at the changes of your slice and couldnât find anythingâ¦ >> >> Max >> >> >> On 25.10.2013, at 16:26, StÃ©phane Ducasse <stephane.ducasse(a)inria.fr> wrote: >> >> > Hi >> > >> > I just pushed a change cleaning some strange usage. >> > BitBlt was sometimes invoked via BitBlt current (which just returned the BitBlt class). >> > Apparently in Squeak they removed it too. >> > >> > Now it touches Fuel so Fuel guys can you merge on your side too? >> > >> > https://pharo.fogbugz.com/f/cases/12009/BitBlt-current-BitBlt >> > >> > Stef >> >> >> >> >> >> -- >> Mariano >> http://marianopeck.wordpress.com >

Oct. 29, 2013

Re: [Pharo-dev] Tests with multiple processes

by Norbert Hartl

Chris, Am 29.10.2013 um 22:35 schrieb Chris Muller <asqueaker(a)gmail.com>: > Testing with real sockets, across multiple images is the only way I > would trust my own networking programs. OSProcess makes that an easy, > one-click affair. > Agreed. That is what we do in addition. Iâm doing tests for the logic behind the network. So this more about mocking the end-to-end communication in order to make a proper set of business logic tests. Norbert > On Mon, Oct 28, 2013 at 5:50 PM, Norbert Hartl <norbert(a)hartl.name> wrote: >> Iâm working on project that deals with server to server communication. For the test suite it is necessary to simulate the two ends of the communication within one test. The problem is that in a single threaded environment you make a send call SC from server A to B but the response of B will happen before SC returned. That makes every state change the happens in A after SC bogus from a call flow perspective. >> >> There are two approaches that have their own problems. >> >> 1) Until now Iâm reordering parts of the call stack to simulate the return of a call before the actual call is sent. But now I have nested sends that make my simple approach not working anymore. I could elaborate my approach by using something like delimited continuations to make a less brittle approach to stack call reordering in order to cope with the problem. That would need some work and the stack in the debugger will look a little bit odd/confusing. >> >> 2.) The product will later have a dispatcher process that dispatches each send operation in its own process. That would solve one problem: the timing of when actions happen. But Iâm not sure if it will be easy to orchestrate actions in a way that I would call controlled in order to have reliable tests. >> >> Are there any approaches to simulate coroutines in a single thread environment or approaches to deal with multiple processes within one process? >> >> It is hard to explain and I hope my description of the problem is understandable >> >> thanks in advance, >> >> Norbert >

Oct. 29, 2013

Re: [Pharo-dev] How to change my user name

by Igor Stasenko

Author reset. should do the trick. On 29 October 2013 22:51, Nicolas Cellier < nicolas.cellier.aka.nice(a)gmail.com> wrote: > I was searching user username... > Finally I found Author fullName: 'Ego.Me' > That's 20 minutes less for Smalltalking :( > > > 2013/10/29 Nicolas Cellier <nicolas.cellier.aka.nice(a)gmail.com> > >> For some reasons, I am LucFabresse in the last Pharo 3.0 that I >> downloaded. >> I'd like to restore myself, where can I change the username? >> (I saw way too much code related...) >> >> The menu 'System>Switch User' of course does not work if it ever was the >> answer (PanelMorph does not understand layout:) >> >> I know what bleeding edge means, but all these little annoyances divert >> me from the contribution job I assigned to myself :( >> >> Nicolas >> > > -- Best regards, Igor Stasenko.

Oct. 29, 2013

Re: [Pharo-dev] How to change my user name

by Nicolas Cellier

I was searching user username... Finally I found Author fullName: 'Ego.Me' That's 20 minutes less for Smalltalking :( 2013/10/29 Nicolas Cellier <nicolas.cellier.aka.nice(a)gmail.com> > For some reasons, I am LucFabresse in the last Pharo 3.0 that I downloaded. > I'd like to restore myself, where can I change the username? > (I saw way too much code related...) > > The menu 'System>Switch User' of course does not work if it ever was the > answer (PanelMorph does not understand layout:) > > I know what bleeding edge means, but all these little annoyances divert me > from the contribution job I assigned to myself :( > > Nicolas >

Oct. 29, 2013

How to change my user name

by Nicolas Cellier

For some reasons, I am LucFabresse in the last Pharo 3.0 that I downloaded. I'd like to restore myself, where can I change the username? (I saw way too much code related...) The menu 'System>Switch User' of course does not work if it ever was the answer (PanelMorph does not understand layout:) I know what bleeding edge means, but all these little annoyances divert me from the contribution job I assigned to myself :( Nicolas

Oct. 29, 2013

Re: [Pharo-dev] Tests with multiple processes

by Chris Muller

Testing with real sockets, across multiple images is the only way I would trust my own networking programs. OSProcess makes that an easy, one-click affair. On Mon, Oct 28, 2013 at 5:50 PM, Norbert Hartl <norbert(a)hartl.name> wrote: > Iâm working on project that deals with server to server communication. For the test suite it is necessary to simulate the two ends of the communication within one test. The problem is that in a single threaded environment you make a send call SC from server A to B but the response of B will happen before SC returned. That makes every state change the happens in A after SC bogus from a call flow perspective. > > There are two approaches that have their own problems. > > 1) Until now Iâm reordering parts of the call stack to simulate the return of a call before the actual call is sent. But now I have nested sends that make my simple approach not working anymore. I could elaborate my approach by using something like delimited continuations to make a less brittle approach to stack call reordering in order to cope with the problem. That would need some work and the stack in the debugger will look a little bit odd/confusing. > > 2.) The product will later have a dispatcher process that dispatches each send operation in its own process. That would solve one problem: the timing of when actions happen. But Iâm not sure if it will be easy to orchestrate actions in a way that I would call controlled in order to have reliable tests. > > Are there any approaches to simulate coroutines in a single thread environment or approaches to deal with multiple processes within one process? > > It is hard to explain and I hope my description of the problem is understandable > > thanks in advance, > > Norbert

Oct. 29, 2013

Re: [Pharo-dev] Tests with multiple processes

by David T. Lewis

> On 29 October 2013 02:08, David T. Lewis <lewis(a)mail.msen.com> wrote: > >> I have some experience with this, not related to Smalltalk but maybe >> still relevant. I have worked with systems that were designed around >> networked message passing, implemented on platforms like MS-DOS with >> time >> slicing kernels, Series I, OS/2, etc. These systems were designed to >> operate >> with asynchronous message passing protocols. The asynchronous designs >> were >> intended to support primitive OS environments, including MS-DOS with >> software interrupts for multitasking. >> >> These are production-critical manufacturing applications, and in the >> course >> of modernizing them I have reimplemented the network protocols in Java >> and >> moved them to new computing platforms. Along the way I have found that >> the >> asynchronous designs could always be replaced by bidirectional >> send-receive >> transactions running in the context of a thread or process. Even the >> systems >> that appeared to be most complex have turned out to work perfectly well >> when modeled as synchronous send-receive transactions on a bidirectional >> communication channel. The software is much simpler to understand and >> debug >> when structured in this manner. >> >> My conclusion is that designing around asynchronous, loosely coupled >> channels sounds like a good idea, but in practice it leads to >> unnecessary >> complexity, and to systems that are difficult to debug and support. >> >> $0.02 >> >> Dave >> > > Example from my life: real-time voice over IP project. >>From very starting, it was designed as a bidirectional connection between > two peers. > Even though, that outgoing/incoming traffic was handled separately, the > model was still there > and treated as 'single conversation channel'. > > Later we wanted to introduce many-peer conversation and found that the > above bi-directional model simply > does not fits.. everything falls apart. > Simple example: you have 3 peers A, B , C. > So, you can represent is in this way: > A<->B , A<->C , B<->C, > or this: > A -> (B,C) > B -> (A, C) > C -> (A,B) > > The bidirectional model implies that you have symmetry in number of > outgoing and incoming channels (hence <->).. > and if you send data over one of them, only single node will receive it. > Logically, that leads to sending same data to two different channels. So, > at very beginning you nailing down > how the traffic is going to flow. > > With unidirectional model, as illustrated when you sending data over one > channel, > it will be delivered to all participants, and you don't have to do it > yourself - the transport layer handles it for you. > > The thing is, that the way how data gets to receivers is heavily depends > on > network topology: > imagine that two peers, B, C belong to same subnet, and latency between > them is miniscule comparing > to latency between A and one of them. The logical choice then should be to > route the signal from A > to either B or C and then broadcast from middle point to the listener > which > is left. > Not possible with bidirectional model, because A insists on having direct > socket connection with both B and C. > > Same goes for proxies: imagine that node A is connected via proxy.. > and not directly to nodes B and C.. that means that to deliver its voice > traffic to both of them it should > just send a single packet to proxy, and then proxy will broadcast it to > listeners. > Not going to happen with bidirectional model, A will still send two very > same packets to same proxy.. but with different destination > address. > > Or even, it could be, that receiving traffic from A to C goes faster via > B, > while sending traffic from C to A is faster to do directly.. > So try to fit that into bidirectional model of communication and see where > it goes. > > Yes, i agree it is easier to put everything into sequential bidirectional > model which makes everything so simple. > If it fits. But if its not, you should not even try to fit it.. > > My point is, that IP is inherently asynchronous and unidirectional. > You give an excellent counter example, and I agree with what you are saying. I am reminded of the quote attributed to Einstein, saying that things should be "as simple as possible but no simpler". For the examples that I gave, simple was good enough. But that is not the case for all such problems ;-) Dave

Oct. 29, 2013