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

Re: [Pharo-users] SortedCollection>>reverse answers an inconsistent object in Pharo 6

by Richard O'Keefe

Let me offer a simple example. #(a a) isSortedBy: [:x :y | (x <= y) not] is false, while #(a a) isSortedBy: [:x :y | y <= x] is true. On 24 April 2018 at 02:43, Erik Stel <erik.stel(a)gmail.com> wrote: > Richard, > > Can you explain me what you mean by "sortBlock is supposed to act like > #<="? > Isn't it up to the developer to decide what the logic should be? I simply > used #<= because #> might not have been implemented for all relevant > classes, but would otherwise have chosen #> as a means to get the > 'reversal' > of #<=. > > Your solution is not resulting in the behaviour I would expect it. Adding > elements which are compared equally, but still have a different value, do > not get added in the same position. In the examples below I use > Associations, since it compares on the key only (for #<= comparison). > > Consider a regular SortedCollection with default sortBlock (set > explicitly): > | aCollection | > aCollection := SortedCollection sortBlock: [ :a :b | a <= b ]. > {#k->'Some'. #k->'Value'. #k->'Or'. #k->'Other'} do: [ :each | aCollection > add: each ]. > aCollection. > "a SortedCollection(#k->'Some' #k->'Value' #k->'Or' #k->'Other')" > > When I create a SortedCollection with your code's sortBlock reversed I get: > | aCollection | > aCollection := SortedCollection sortBlock: [ :a :b | b <= a ]. > {#k->'Some'. #k->'Value'. #k->'Or'. #k->'Other'} do: [ :each | aCollection > add: each ]. > aCollection. > "a SortedCollection(#k->'Some' #k->'Value' #k->'Or' #k->'Other')" > > The order of the result is the same in both situations. What I would expect > is the result you get from the sortBlock I suggested: > | aCollection | > aCollection := SortedCollection sortBlock: [ :a :b | (a <= b) not ]. > {#k->'Some'. #k->'Value'. #k->'Or'. #k->'Other'} do: [ :each | aCollection > add: each ]. > aCollection. > "a SortedCollection(#k->'Other' #k->'Or' #k->'Value' #k->'Some')" > > This last result is the reversal of the original result. > > (side note) > IF in the above #addAll: was used instead of the repeated #add:, things > might be different again. Since the #addAll: implementation would on some > occasions (when size of receiver vs size of added elements is certain > ratio) > add the elements at the end and then perform a #reSort. With values being > compared as equal, the order will be decided by the order they were added. > So the result of #addAll: depends on the collection sizes. This might not > be > what a user would expect ;-). > > > > -- > Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html > >

April 24, 2018

UFFI and autoRelease

by Serge Stinckwich

I'm using autoRelease on some FFIOpaqueObject instances. I need to test some behavior when I delete explicitly one of these objects. âHow to remove these objects from the finalization list, in order they are not freed two times. Something like ignoreFinalization ? -- Serge Stinckwich UMI UMMISCO 209 (SU/IRD/UY1) "Programs must be written for people to read, and only incidentally for machines to execute."http://www.doesnotunderstand.org/

April 24, 2018

Re: [Pharo-users] SortedCollection>>reverse answers an inconsistent object in Pharo 6

by Richard O'Keefe

"sortBlock is supposed to act like #<=" means "for every triple of elements x y z that might be in the collection, b(x,x) is true b(x,y) is Boolean b(x,y) | b(y,x) b(x,y) & b(y,z) implies b(x,z)." The first condition distinguishes it from #< . In particular, if you want to sort a sequence of *identical* elements, the sortBlock must satisfy b(x,x). There are other predicates around that act like <= in the relevant sense: >= for example. But #beginsWith: and #endsWith: don't satisfy dichotomy. On 24 April 2018 at 02:43, Erik Stel <erik.stel(a)gmail.com> wrote: > Richard, > > Can you explain me what you mean by "sortBlock is supposed to act like > #<="? > Isn't it up to the developer to decide what the logic should be? I simply > used #<= because #> might not have been implemented for all relevant > classes, but would otherwise have chosen #> as a means to get the > 'reversal' > of #<=. > > Your solution is not resulting in the behaviour I would expect it. Adding > elements which are compared equally, but still have a different value, do > not get added in the same position. In the examples below I use > Associations, since it compares on the key only (for #<= comparison). > > Consider a regular SortedCollection with default sortBlock (set > explicitly): > | aCollection | > aCollection := SortedCollection sortBlock: [ :a :b | a <= b ]. > {#k->'Some'. #k->'Value'. #k->'Or'. #k->'Other'} do: [ :each | aCollection > add: each ]. > aCollection. > "a SortedCollection(#k->'Some' #k->'Value' #k->'Or' #k->'Other')" > > When I create a SortedCollection with your code's sortBlock reversed I get: > | aCollection | > aCollection := SortedCollection sortBlock: [ :a :b | b <= a ]. > {#k->'Some'. #k->'Value'. #k->'Or'. #k->'Other'} do: [ :each | aCollection > add: each ]. > aCollection. > "a SortedCollection(#k->'Some' #k->'Value' #k->'Or' #k->'Other')" > > The order of the result is the same in both situations. What I would expect > is the result you get from the sortBlock I suggested: > | aCollection | > aCollection := SortedCollection sortBlock: [ :a :b | (a <= b) not ]. > {#k->'Some'. #k->'Value'. #k->'Or'. #k->'Other'} do: [ :each | aCollection > add: each ]. > aCollection. > "a SortedCollection(#k->'Other' #k->'Or' #k->'Value' #k->'Some')" > > This last result is the reversal of the original result. > > (side note) > IF in the above #addAll: was used instead of the repeated #add:, things > might be different again. Since the #addAll: implementation would on some > occasions (when size of receiver vs size of added elements is certain > ratio) > add the elements at the end and then perform a #reSort. With values being > compared as equal, the order will be decided by the order they were added. > So the result of #addAll: depends on the collection sizes. This might not > be > what a user would expect ;-). > > > > -- > Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html > >

April 24, 2018

Re: [Pharo-users] Right repo for TaskIt and features?

by Santiago Bragagnolo

Hi Holger! I respond in *bold* On Tue, 24 Apr 2018 at 12:00 Holger Freyther <holger(a)freyther.de> wrote: > Hey! > > I look into using Taskit for a new development and wondered about some > features. What is the right upstream repository? *The main repo so far is https://github.com/sbragagnolo/taskit <https://github.com/sbragagnolo/taskit>* > What are the goals to get builds greens? *Don't have really a strategy yet, I did not have time to check on them. I can put my hands on it for a while and come up with a plan on that * > I wondered if somebody thought of remote task execution? > ** If by remote calls you mean through REST Api's or things like that, no yet. but is easy to use as: * *[ service call ] schedule. * *or* *result := [ service call ] future * ** If what you mean is to execute a program on the underlying operative system, we have a already a way to do it for linux (not tested on mac, but it may work there) * *result := [ :spec | * * spec* * command: 'bash';* * option: '-c';* * argument: command ] asOSTask future.* *The result deployed on the future is the stdout of the process .* *The text on the exception, the one on stderr of the process. * *Is based on OSSubProcess, it does not work properly with long stdout. * ** If what you mean is the execution of code deployed on other images, earlier versions of taskit had this feature, based on OSProcess, but we are not really ready for doing it for real. We need to be able to define if an image is suitable or not to run a command. * **If you mean something else, I would need more information :).* > What I am missing is handling for overload. E.g. before queuing too many > tasks I would prefer an exception to be raised (or the task > blocking/slowing down). Signalling an exception is probably more reasonable > as one task could queue another task (while >>#value is being executed...). > What are the plans here? I can mitigate by always using futures and using > >>#waitForCompletion:.. > **For raising exceptions on too much tasks you only need to set a custom made kind of queue. I don't think this is the way we want to go. Since there is not much to do in the case of 'too much tasks scheduled'. Is easy to try later from a do-it, but from an application point of view, is too much. * *For dealing with the sharing of resources, we have implemented the worker pools abstractions. * *When you do [ action ] schedule / [ action ] future, both created tasks are scheduled into the default runner. The default runner is a working pool with a default 'poolSizeMax' on 4, meaning, limit 4 processes working over the tasks. (this is a dynamic configuration, you can change it by * *TKTConfiguration runner poolMaxSize: 20. )* > > Are there ideas how to add remote task scheduling? Maybe use Seamless for > it? *Since you speak about seamless here, i suppose two different images, doesn't matter where. * *It's not a bad idea to go seamless, but i did not go through the first restriction of remote executions (if the remote image can or not execute the task and if both images share the same semantic for the execution), then i did not yet checked on which communication platform to use for it * > Have workers connect to the scheduler? Other ideas? *what do you mean by connection to the scheduler? The workers we use do not know their pools, if that is what you mean. * > Who would have time to review an approach and the code? *You can send it to me, Disclaimer, i am going on vacations for a while tomorrow* *Nice to know your interests! * *cheers.* *Santiago* > > cheers > holger >

April 24, 2018

Re: [Pharo-users] Proper way to file in code

by Sven Van Caekenberghe

> On 24 Apr 2018, at 11:52, Guillermo Polito <guillermopolito(a)gmail.com> wrote: > > Hi, > > I think the more proper API to use is > > CodeImporter evaluateFileNamed: '/path/to/my/file.st'. > > Check CodeImporter class side for more options (streams, strings...). > > CodeImporter is there for already 3/4 years I think. The idea is that filing in is not a file responsibility. Yeah, but then you should change it to no longer use the deprecated FileStream ;-) See CodeImporter class>>#fileNamed: > Guille > > On Mon, Apr 23, 2018 at 10:35 PM, Hilaire <hilaire(a)drgeo.eu> wrote: > That's a plan! > > I realized from my code I was already using a mix of the new and old world. It will be nice to get rid of the antic one to reduce the confusion when manipulating file. > > Thanks > > Le 22/04/2018 Ã 20:12, Sven Van Caekenberghe a Ã©crit : > It is not hard at all, just start from FileSystem (i.e. FileReference, FileLocator, etc, ..) and open your streams from there and you are good. I guess the FileSystem from the Deep into Pharo book is a good start. > > From a user perspective, the changes are not that big. If something is not clear, you can always ask. > > -- > Dr. Geo > http://drgeo.eu > > > > > > > -- > > Guille Polito > Research Engineer > > Centre de Recherche en Informatique, Signal et Automatique de Lille > CRIStAL - UMR 9189 > French National Center for Scientific Research - http://www.cnrs.fr > > Web: http://guillep.github.io > Phone: +33 06 52 70 66 13

April 24, 2018

Right repo for TaskIt and features?

by Holger Freyther

Hey! I look into using Taskit for a new development and wondered about some features. What is the right upstream repository? What are the goals to get builds greens? I wondered if somebody thought of remote task execution? What I am missing is handling for overload. E.g. before queuing too many tasks I would prefer an exception to be raised (or the task blocking/slowing down). Signalling an exception is probably more reasonable as one task could queue another task (while >>#value is being executed...). What are the plans here? I can mitigate by always using futures and using >>#waitForCompletion:.. Are there ideas how to add remote task scheduling? Maybe use Seamless for it? Have workers connect to the scheduler? Other ideas? Who would have time to review an approach and the code? cheers holger

April 24, 2018

Re: [Pharo-users] Proper way to file in code

by Guillermo Polito

Hi, I think the more proper API to use is CodeImporter evaluateFileNamed: '/path/to/my/file.st'. Check CodeImporter class side for more options (streams, strings...). CodeImporter is there for already 3/4 years I think. The idea is that filing in is not a file responsibility. Guille On Mon, Apr 23, 2018 at 10:35 PM, Hilaire <hilaire(a)drgeo.eu> wrote: > That's a plan! > > I realized from my code I was already using a mix of the new and old > world. It will be nice to get rid of the antic one to reduce the confusion > when manipulating file. > > Thanks > > Le 22/04/2018 Ã 20:12, Sven Van Caekenberghe a Ã©crit : > >> It is not hard at all, just start from FileSystem (i.e. FileReference, >> FileLocator, etc, ..) and open your streams from there and you are good. I >> guess the FileSystem from the Deep into Pharo book is a good start. >> >> From a user perspective, the changes are not that big. If something is >> not clear, you can always ask. >> > > -- > Dr. Geo > http://drgeo.eu > > > > -- Guille Polito Research Engineer Centre de Recherche en Informatique, Signal et Automatique de Lille CRIStAL - UMR 9189 French National Center for Scientific Research - *http://www.cnrs.fr <http://www.cnrs.fr>* *Web:* *http://guillep.github.io* <http://guillep.github.io> *Phone: *+33 06 52 70 66 13

April 24, 2018

Re: [Pharo-users] Proper way to file in code

by Hilaire

That's a plan! I realized from my code I was already using a mix of the new and old world. It will be nice to get rid of the antic one to reduce the confusion when manipulating file. Thanks Le 22/04/2018 Ã 20:12, Sven Van Caekenberghe a Ã©critÂ : > It is not hard at all, just start from FileSystem (i.e. FileReference, FileLocator, etc, ..) and open your streams from there and you are good. I guess the FileSystem from the Deep into Pharo book is a good start. > > From a user perspective, the changes are not that big. If something is not clear, you can always ask. -- Dr. Geo http://drgeo.eu

April 23, 2018

Re: [Pharo-users] treemap of memory use for an object?

by phil＠highoctane.be

I do.not know about variable sizes but I've made a treemap of database table size grouped by some grouping. I'll fetch the code and post it when home. Phil On Mon, Apr 23, 2018, 19:42 PAUL DEBRUICKER <pdebruic(a)gmail.com> wrote: > Hi, > > With Roassal is it possible to make a treemap ( > https://en.wikipedia.org/wiki/Treemapping) of the memory use of an object > and its instVars? > > > I have a leak and am not sure where and its not one or two objects > AFAIK.... > > > Thanks > > > Paul > >

April 23, 2018

treemap of memory use for an object?

by PAUL DEBRUICKER

Hi, With Roassal is it possible to make a treemap (https://en.wikipedia.org/wiki/Treemapping) of the memory use of an object and its instVars? I have a leak and am not sure where and its not one or two objects AFAIK.... Thanks Paul

April 23, 2018