January 2018 - Pharo-users - lists.pharo.org

Re: [Pharo-users] [ANN] PharoLauncher v1.1 released!

by Serge Stinckwich

Thank you Christophe for this wonderful work ! On Tue, Jan 16, 2018 at 9:46 PM, Christophe Demarey < christophe.demarey(a)inria.fr> wrote: > Hi all, > > I just released *PharoLauncher 1.1*. There are now 64-bits versions for > Mac and Linux. Jenkins build is now managed through a Jenkins file. > > Here is the changelog (details on https://github.com/pharo- > project/pharo-launcher/issues): > New features: > #66 new command: import an image into the launcher default image folder > #65 new command: remove a template from "Downloaded templates" > #64 new command: create a local template from an image and remove the image > #57 new option: run an image from a login shell to inherit from shell > startup scripts to set up environment variables. > #54 It is now possible to run an image anywhere on your file system if you > click "launch" and no image is selected > #23 Pharo Launcher now has an "about" box giving its description, version > and a link to the bug tracker. > Improvements: > #62 Pharo Launcher should not load default Pharo settings > #51 Pharo Launcher now sets the current directory to the directory > containing the image (was the VM directory). Avoid confusions in Pharo 7 > images. > Bux fixes: > #60 hardReset option causes troubles to PharoLauncher > #56 #, was sent to nil > #55 Display name of Pharo 7 images unusable > #52 Cannot open a Pharo 2 image > #47 Cannot run pharo 50 pre-Spur images > > You can get platform bundles from files.pharo.org: > http://files.pharo.org/pharo-launcher/1.1/ > > Regards, > Christophe. > -- Serge Stinckwich UMI UMMISCO 209 (IRD/UPMC/UY1) "Programs must be written for people to read, and only incidentally for machines to execute."http://www.doesnotunderstand.org/

Jan. 17, 2018

[ANN] PharoLauncher v1.1 released!

by Christophe Demarey

Hi all, I just released PharoLauncher 1.1. There are now 64-bits versions for Mac and Linux. Jenkins build is now managed through a Jenkins file. Here is the changelog (details on https://github.com/pharo-project/pharo-launcher/issues) New features: #66 new command: import an image into the launcher default image folder #65 new command: remove a template from "Downloaded templates" #64 new command: create a local template from an image and remove the image #57 new option: run an image from a login shell to inherit from shell startup scripts to set up environment variables. #54 It is now possible to run an image anywhere on your file system if you click "launch" and no image is selected #23 Pharo Launcher now has an "about" box giving its description, version and a link to the bug tracker. Improvements: #62 Pharo Launcher should not load default Pharo settings #51 Pharo Launcher now sets the current directory to the directory containing the image (was the VM directory). Avoid confusions in Pharo 7 images. Bux fixes: #60 hardReset option causes troubles to PharoLauncher #56 #, was sent to nil #55 Display name of Pharo 7 images unusable #52 Cannot open a Pharo 2 image #47 Cannot run pharo 50 pre-Spur images You can get platform bundles from files.pharo.org <http://files.pharo.org/>: http://files.pharo.org/pharo-launcher/1.1/ Regards, Christophe.

Jan. 16, 2018

Re: [Pharo-users] How to declare a do:[] loop for a matrix to read and acces its elements?

by Ben Coman

On 16 January 2018 at 22:05, Photon <nico-braun(a)live.de> wrote: > That looks ideed cool thanx Nicolai for the hint. > > @Ben du you have an idea how to store the prevoius generations? I case > something cool happens and you want to rewind to have a closer look In a well designed app, you'd have "grid" instance variable instead of "cellsAlive" so then it could be something like... LifeGrid >> storeGeneration generations ifNil: [generations := OrderedCollection new]. generations add: grid copy. but perhaps manipulating a single grid in-place causes complications and you are better off replacing the whole grid each generation. Then you don't need the #copy. cheers -ben

Jan. 16, 2018

Re: [Pharo-users] How to declare a do:[] loop for a matrix to read and acces its elements?

by Photon

That looks ideed cool thanx Nicolai for the hint. @Ben du you have an idea how to store the prevoius generations? I case something cool happens and you want to rewind to have a closer look -- Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html

Jan. 16, 2018

Re: [Pharo-users] How to declare a do:[] loop for a matrix to read and acces its elements?

by Ben Coman

@nicolai, Thx for the cool tip. #eightNeighbors is new to me and I was curious to try it. So below is one way to have Life with it. For conciseness of this post, please excuse that I've roughly used booleans directly as grid elements rather a nicely encapsulated Cell object. Object subclass: #LifeGrid instanceVariableNames: 'size cellsAlive' LifeGrid >> initialize size := 4. cellsAlive := Dictionary new. 1 to: size do: [:x| 1 to: size do: [:y| cellsAlive at: (x@y) put: false ] ] LifeGrid >> turnAliveAt: location cellsAlive at: location put: true LifeGrid >> aliveAt: location ^ cellsAlive at: location ifPresent: [ :isAlive | isAlive ] ifAbsent: [ false ] LifeGrid >> countNeighboursAt: location ^ (location eightNeighbors select: [ :neighbour | self aliveAt: neighbour ]) size Testing from Playground... grid := LifeGrid new. grid countNeighboursAt: 2@2. "==>0" grid turnAliveAt: 1@1. grid countNeighboursAt: 2@2. "==>1" grid turnAliveAt: 3@3. grid countNeighboursAt: 2@2. "==>2" grid countNeighboursAt: 1@2. "==>1" cheers -ben On 16 January 2018 at 05:47, Nicolai Hess <nicolaihess(a)gmail.com> wrote: > > > 2018-01-15 18:04 GMT+01:00 Photon <nico-braun(a)live.de>: >> >> when I call the countNeighbours method i get an error: the block wants two >> arguments but I pass only one. >> This is probally because i want to pass x y but only really pass x wich >> ends >> up being a cell and not the index. >> >> I still have trouble thinking it trough. The indicieDo: method seems to >> make >> the matrix bigger?! I don`t quite understand it. > > > It should not, and looking at the implementation, it just iterates with two > loops 1 to number of rows times 1 to number of columns and calls your > block argument with the pair of indexes. > >> >> >> There must be an easy way to to figure out if the suroundings are alive or >> not. I mean its all there what I need and in my mind its so easy to >> discribe >> it with normal words. But to tell the machine witth syntax is another >> thing >> really :/ > > > About the surroundings, there is a nice method in Point > Point>>eightNeighbors, that gives you the coordinates of the eight > surrounding fields > for example: > (5@7) eightNeighbors "{(6@7). (6@8). (5@8). (4@8). (4@7). (4@6). (5@6). > (6@6)}" > > with this method and if you iterate through all pairs of indices of the > matrix, you can > do your computation for every point, but you have to take care about the > points that don't > have valid matrix indices for some of their neighbours (like 0@0, the left > and top neighbours > may actually "on the other side of the matrix"). But you can take a look at > SequenceableCollection>>atWrap: how it deals with "wrapping around". > > > >> >> >> what if i selected only one element with do:[] and let its tell me its >> idices. I store them in a temp object and then I check outside the block >> the >> neighbours and add to the counter. Once this is done I repeat as many >> times >> as their elements in the matrix?

Jan. 16, 2018

Re: [Pharo-users] How to declare a do:[] loop for a matrix to read and acces its elements?

by Photon

Thank for your answer. Those are awesome tips :) If you read my posts in the forum you should be able to read what I wrote. Its because whenever I insert raw text it gets deletet right away and I have to edit the post and put it back in. Anyways in my last post you see how i did it. I think you are also refering to that. I know using 2d matrix/ array is a a waste. Maybe when I start to refactory this game I try to focus on you aprooach. Sounds good. One could even use a 1d container like a list. Im not sure is the gameworld should grow inifitly. In the ruleset on wikipedia there is a fixed board size. The smallest one is 3*3 but I could implement is as one possible size to select from. To the part that i would only need to check certain cells I think I have to check all of them because they could get born in the next generation even tho they were never alive nor dead. Thng I wanted to improve here was that i do not need to check all the 6 neighbours. As soon as neighboars equals 4 the cell is dead for sure and there is no need to check further. Couls save at max half the time beauce only half the checks are made. -- Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html

Jan. 16, 2018

Re: [Pharo-users] Set Rounding mode for IEEE floating point operations

by Serge Stinckwich

On Mon, Jan 15, 2018 at 12:27 PM, Steffen MÃ¤rcker <merkste(a)web.de> wrote: > Hi, > > is there any way to set the rounding mode for IEEE floating point > operations? Maybe something like > > Double roundToMinusInfWhile: [... code goes here ...]Double >> roundToZeroWhile: [... more code here ...] >> > > If not, is it possible to add this behavior, e.g., via a custom primitive? > > âThis might interesting to have something like that for PolyMath, but I'm a little worried of subtle consequences that might appear in UI if you use points for examples.â -- Serge Stinckwich UMI UMMISCO 209 (IRD/UPMC/UY1) "Programs must be written for people to read, and only incidentally for machines to execute."http://www.doesnotunderstand.org/

Jan. 16, 2018

Re: [Pharo-users] ZnClient POST then GET of different URL path, GET has POST's entity

by Sven Van Caekenberghe

Hi Paul, Your analysis is correct: #resetEntity is (by default) only called before executing HEAD and DELETE methods and not (by default) before a GET (nor a PUT or POST). The reason is that ZnClient is (also) a builder to construct requests. One of the features of the builder is that it lets you do multiple requests to the same server (or resource) where you might have lots of options configured. It also lets you build up the entity that you want to sent along. More specifically, HTML forms using an applicationFormUrlEncodedEntity and a GET are supported through #formAt:* - see for example #testGetForm. The issue you raised is the consequence of preferring the latter as a works-out-of-the-box vs. your surprise it-sends-and-older-entity with a GET. I can't immediately see how to solve both by default. Both manually calling #resetEntity or configuring #autoResetEntityMethods: are options/solutions. For example, here is how my main/internal API client sets up its re-usable ZnClient instance: setUpHttpClient ^ ZnClient new clientId: 'T3clnt'; host: self connectionSpec host; port: self connectionSpec port; accept: ZnMimeType applicationJson; logLevel: 2; enforceAcceptContentType: true; autoResetEntityMethods: #(#HEAD #DELETE #GET); contentReader: [ :entity | self parseJson: entity ]; contentWriter: [ :data | self asJsonEntity: data ]; yourself I change the reset entity default because I know I never use the form option. HTH, Sven > On 16 Jan 2018, at 01:47, PAUL DEBRUICKER <pdebruic(a)gmail.com> wrote: > > > Hi - > > Should #resetEntity be called automatically for long lived sessions ? I see that it is called automatically for HEAD and DELETE methods. > > > If you do a > > |client | > client:=ZnClient new. > client get: 'http://example.com/getPath' > client inspect > client post: 'http://example.com' contents:'My Contents' > client inspect. > client get: 'http://example.com/getPath' > client inspect. > client close. > > > and then look at the changed headers between the first and last GET you can see that the body from the POST was sent in the 2nd GET request. I can't think of a time when you'd want that, generally. > > Maybe it would be better to make keeping the entity around as the exception in all cases and ask for it specifically when you want it. I'm not sure of the answer I was just surprised by the behavior and can definitely send #resetEntity for my use case. > > > Paul

Jan. 16, 2018

Re: [Pharo-users] How to declare a do:[] loop for a matrix to read and acces its elements?

by Richard O'Keefe

PS: note that a matrix representation of the Life world (a) wastes a ton of space, (b) wastes a ton of time if you iterate over all the cells (because most of them are irrelevant), (c) is awkward to grow, and (d) has problems at the edges (which should not exist). In C or C++ I would not dream of using a rectangular matrix for Life. I might possibly use a quad tree, but I'd probably stick with a set of points. On 16 January 2018 at 19:41, Richard O'Keefe <raoknz(a)gmail.com> wrote: > I'm reading this in gmail. After "this method work:" I see a gap with > nothing visible. > After "wich looks like this" there is again a gap with nothing visible. > > Recalling that the Life universe is an *infinite* two-dimensional space, > you want a data > structure that naturally grows to be as big as it needs to be and no > bigger. I ran across > a similar problem last year. A Dictionary[Integer->Dictionary[Integer->State]] > turned > out to work very well. You could also use a Dictionary[Point[Integer,Integer] > -> State] > which would be logically simpler. The key idea is that you don't want to > iterate over > all the cells, only the cells which are live. Now the states in Life are > very simple, > so the data structure you want is actually a Set[Point[Integer,Integer]]. > The only > cells that can change state are the live cells and the dead (not present > in the set) that > are king-wise adjacent to a live cell. So you will be doing something > like > candidates := Bag new. > dyingCells := Set new. > liveCells do: [:each | > n := 0. > each kingwiseNeighboursDo: [:neighbour | > (liveCells includes: neighbour) > ifTrue: [n := n + 1] > ifFalse: [candidates add: Bag]] > (n between: 2 and: 3) ifFalse: [dyingCells add: each]. > liveCells removeAll: dyingCells. > candidates valuesAndCounts keysAndValuesDo: [:each :count | > count = 3 ifTrue: [liveCells add: each]]. > WARNING: This code has not been tested. > > On 16 January 2018 at 03:29, Photon <nico-braun(a)live.de> wrote: > >> Hello folks, >> >> I am trying since yesterday to make a game of life implemenation work. It >> looks all ok so far but in can`t figure out the final steps. I think I get >> the logic I have to use and if I imagine the code in C++ for example it >> would be pretty much straight forward. But with pharo I got trouble >> telling >> the machine what I want. >> >> In short I`m trying to make this method work: >> >> >> >> I wrote a test wich looks like this: >> >> >> >> I want to go trough each element of the matrix(cells), check its >> surounding >> cells if they are alive, and set its counter if there are any living >> neighbours. It should move like this through the whole matrix to set the >> neighbour counter for each element. >> >> In this method i just tried the implement the topLeft check yet but I >> think >> you get the idea. You can look at the comment in the top section it shows >> where the neighbour indexes are. >> >> I tried so many things by now, did research read methods of the >> superclasses >> but I can`t make it work. >> I woud be really glad if someone gave me a little hint. What is wrong >> here? >> >> >> >> -- >> Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html >> >> >

Jan. 16, 2018

Re: [Pharo-users] How to declare a do:[] loop for a matrix to read and acces its elements?

by Richard O'Keefe

I'm reading this in gmail. After "this method work:" I see a gap with nothing visible. After "wich looks like this" there is again a gap with nothing visible. Recalling that the Life universe is an *infinite* two-dimensional space, you want a data structure that naturally grows to be as big as it needs to be and no bigger. I ran across a similar problem last year. A Dictionary[Integer->Dictionary[Integer->State]] turned out to work very well. You could also use a Dictionary[Point[Integer,Integer] -> State] which would be logically simpler. The key idea is that you don't want to iterate over all the cells, only the cells which are live. Now the states in Life are very simple, so the data structure you want is actually a Set[Point[Integer,Integer]]. The only cells that can change state are the live cells and the dead (not present in the set) that are king-wise adjacent to a live cell. So you will be doing something like candidates := Bag new. dyingCells := Set new. liveCells do: [:each | n := 0. each kingwiseNeighboursDo: [:neighbour | (liveCells includes: neighbour) ifTrue: [n := n + 1] ifFalse: [candidates add: Bag]] (n between: 2 and: 3) ifFalse: [dyingCells add: each]. liveCells removeAll: dyingCells. candidates valuesAndCounts keysAndValuesDo: [:each :count | count = 3 ifTrue: [liveCells add: each]]. WARNING: This code has not been tested. On 16 January 2018 at 03:29, Photon <nico-braun(a)live.de> wrote: > Hello folks, > > I am trying since yesterday to make a game of life implemenation work. It > looks all ok so far but in can`t figure out the final steps. I think I get > the logic I have to use and if I imagine the code in C++ for example it > would be pretty much straight forward. But with pharo I got trouble telling > the machine what I want. > > In short I`m trying to make this method work: > > > > I wrote a test wich looks like this: > > > > I want to go trough each element of the matrix(cells), check its surounding > cells if they are alive, and set its counter if there are any living > neighbours. It should move like this through the whole matrix to set the > neighbour counter for each element. > > In this method i just tried the implement the topLeft check yet but I think > you get the idea. You can look at the comment in the top section it shows > where the neighbour indexes are. > > I tried so many things by now, did research read methods of the > superclasses > but I can`t make it work. > I woud be really glad if someone gave me a little hint. What is wrong here? > > > > -- > Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html > >

Jan. 16, 2018