December 2016 - Pharo-dev - lists.pharo.org

Re: [Pharo-dev] Image start-up hooks

by Sven Van Caekenberghe

Hi Michel, > On 13 Dec 2016, at 10:25, Michel Onoff <michel.onoff(a)web.de> wrote: > > Hi, > > is there a way to register arbitrary code to be run at image start-up and shutdown? > > Thanks > Michel Sure, that is possible and common. Have a look at the 'system startup' protocol of TBehavior (as implemented by classes) and look for the startUp & shutDownmessages. There is also the 'snapshot and quit' protocol of SmalltalkImage with messages like addDeferredStartupAction: and addToStartUpList: In newer Pharo images (5+ I think), SessionManager is your friend, a cleaner rewrite. Sven

Dec. 13, 2016

Image start-up hooks

by Michel Onoff

Hi, is there a way to register arbitrary code to be run at image start-up and shutdown? Thanks Michel

Dec. 13, 2016

Re: [Pharo-dev] RBPattern matching dynamic array expressions

by John Brant

> On Dec 11, 2016, at 1:06 PM, Yuriy Tymchuk <yuriy.tymchuk(a)me.com> wrote: > > Hi John, > > thank you for our reply it is really helpful. > > Can you please also spend a bit of your time to talk about the âpermissiveness" of the pattern syntax. For example the string '`.head `.@tailâ is parsed into a message node with selector `.@tail and a receiver variable node `.head. To my knowledge this is not a valid syntax as the names that have a dot in the beginning should become matchers for statements. Also for example if you write `#@literal the list marker is not doing anything when combines with the literal pound as far as I know, and some people are confused about this, were the any reason why this is not simply rising a syntax error? > The @ in a literal can make sense when you are matching inside of a literal array: (RBParser parseRewriteExpression: '#(`#@a 1 `#@b)') match: (RBParser parseExpression: '#(2 1 3 4)') inContext: Dictionary new As for the permissiveness, I built the rewriter to be used internally for the refactorings so I wasnât too concerned about that when it was built. Only after using the rewrites internally and seeing how useful they were, did we decide to surface them to the user. The rewriter was easier to build without all of the validation checks since we could just extend the existing parser to check for pattern tokens in a few places. If you add the validation to the parser, then youâll need to override several methods to check for valid input. Another validation approach is to validate the tree after it has been created. I think Niall Ross did this for the VA Smalltalk rewriter about a decade ago. Using this approach one can also validate the replacement expression only references patterns defined in the search expression. I think this is probably the best way to add validation. BTW, the scanner actually allows any characters between the initial backquote and the first letter character, so you can have `!@#$%^&*()0987654321~`<>?,./{}|[]\a for a pattern variable name. The code only processes the first modifier characters that it knows about. For the example above, since it doesnât know how to process the ! modifier character, it stops looking so the pattern above will only match a variable node. If I was defining the pattern modifiers again using the prefix backquote like is done in the existing RB, I think I would make `name match anything (so you didnât need to add an @ so often since that is the most common case), and add a | to signify a variable match (e.g., `|var) â although the bar character may be too easily confused with a lower case L. Lists, @, could become * or + or {2,3} to look like regexs. For example, you could have a pattern like this: | `|{3,}temps | `.*Statement This would match sequence nodes with 3 or more temps and 0 or more statements. In SmaCC, I took the approach to spell out what I wanted. The patterns begin and end with a backquote. For example, if I wanted a list, instead of using a special @ character, I would send the #beList message (e.g., `name{beList}`). These can be combined/cascaded: `name{beList; testBlock: [:nodes | â¦ do something to test the nodes â¦]}`. While some can understand and use these pattern rewrites, I donât know if they will ever be easy enough for most people to use. Instead I think some other interface should be built for these people. For example, I can envision a system where a user provides an sample of something to find. The system would build some potential patterns and find potential matches, and then the user would look at the matches and tell the tool which were valid or not. After a few iterations, hopefully the tool has figured out the pattern the user wanted. John Brant

Dec. 12, 2016

Re: [Pharo-dev] [ANN] Pharo Association has a new Website!

by Marcus Denker

> On 8 Dec 2016, at 15:59, Marcus Denker <marcus.denker(a)inria.fr> wrote: > > >> >>> Accepting Bitcoin payments would be a plus ;-) (https://bitpay.com/tour <https://bitpay.com/tour>) >>> >> > > Hi, > > I have setup bitpay. This means we can now accept bitcoin, to pay by bitcoin, > for now please select âofflineâ payment and then send a mail to > association(a)pharo.org <mailto:association@pharo.org> > > and we will generate a bitcoin invoice. (we can integrate it a bit better later). > Hello, I now - added a link to donate by bitpay to https://association.pharo.org/Donate - added payments links to the invoice that the system generates for paying the membership. Marcus

Dec. 12, 2016

[pharo-project/pharo-core]

by GitHub

Branch: refs/tags/50765 Home: https://github.com/pharo-project/pharo-core

Dec. 12, 2016

[pharo-project/pharo-core] 2da393: 50765

by GitHub

Branch: refs/heads/5.0 Home: https://github.com/pharo-project/pharo-core Commit: 2da393a0b6aa8f06137bbfb92b7d35b0c02a8c30 https://github.com/pharo-project/pharo-core/commit/2da393a0b6aa8f06137bbfb9… Author: Jenkins Build Server <board(a)pharo-project.org> Date: 2016-12-12 (Mon, 12 Dec 2016) Changed paths: M Kernel.package/Delay.class/class/settings/delaySchedulerClass_.st A Kernel.package/ManifestKernel.class/class/code-critics/ruleRBBadMessageRuleV1FalsePositive.st R ScriptLoader50.package/ScriptLoader.class/instance/pharo - scripts/script50764.st A ScriptLoader50.package/ScriptLoader.class/instance/pharo - scripts/script50765.st R ScriptLoader50.package/ScriptLoader.class/instance/pharo - updates/update50764.st A ScriptLoader50.package/ScriptLoader.class/instance/pharo - updates/update50765.st M ScriptLoader50.package/ScriptLoader.class/instance/public/commentForCurrentUpdate.st Log Message: ----------- 50765 19435 Silently ignore loading DelayScheduler setting when its the same as existing (Pharo 5 backport) https://pharo.fogbugz.com/f/cases/19435 http://files.pharo.org/image/50/50765.zip

Dec. 12, 2016

Re: [Pharo-dev] Set internal array size

by Marcus Denker

> On 12 Dec 2016, at 14:32, Sven Van Caekenberghe <sven(a)stfx.eu> wrote: > > >> On 12 Dec 2016, at 18:29, Marcus Denker <marcus.denker(a)inria.fr> wrote: >> >> >>> On 1 Dec 2016, at 11:41, Christophe Demarey <christophe.demarey(a)inria.fr> wrote: >>> >>> >>>> Le 1 dÃ©c. 2016 Ã 15:04, Marcus Denker <marcus.denker(a)inria.fr> a Ã©crit : >>>> >>>> The idea that a set is always created with a minimal size is because we always add at least some elements >>> >>> not always. You know in some cases 80% of the time, your instances will have an empty Set and with some values for the remaining 20%. >>> If you check in Moose, you should find a lot this pattern. >> >> It would be interesting to play around with these thingsâ¦ the problem is that they are very context dependent, so there is lots >> of questions what to do (more a research topic than something one can solve nowâ¦). >> >> What we should do: >> >> -> the size should be 5, like it is for Dictionaries We need to unify the two version of the method that calculate the initial size. >> Issue tracker: https://pharo.fogbugz.com/f/cases/19458/unify-sizeFor-for-HashedCollection-… >> What we could do: >> >> -> provide a version of ânewâ that actually makes explicity a small array of size 1. For the case where the user knows that >> the Set will be empty most of the time. > > There could be an #empty class method for that. > And one could overwrite the #with: class method to create a singleton. https://pharo.fogbugz.com/f/cases/19459/add-empty-instance-creation-method <https://pharo.fogbugz.com/f/cases/19459/add-empty-instance-creation-method> (just the issues, no code) Marcus

Dec. 12, 2016

Re: [Pharo-dev] Set internal array size

by Sven Van Caekenberghe

> On 12 Dec 2016, at 18:29, Marcus Denker <marcus.denker(a)inria.fr> wrote: > > >> On 1 Dec 2016, at 11:41, Christophe Demarey <christophe.demarey(a)inria.fr> wrote: >> >> >>> Le 1 dÃ©c. 2016 Ã 15:04, Marcus Denker <marcus.denker(a)inria.fr> a Ã©crit : >>> >>> The idea that a set is always created with a minimal size is because we always add at least some elements >> >> not always. You know in some cases 80% of the time, your instances will have an empty Set and with some values for the remaining 20%. >> If you check in Moose, you should find a lot this pattern. > > It would be interesting to play around with these thingsâ¦ the problem is that they are very context dependent, so there is lots > of questions what to do (more a research topic than something one can solve nowâ¦). > > What we should do: > > -> the size should be 5, like it is for Dictionaries We need to unify the two version of the method that calculate the initial size. > > What we could do: > > -> provide a version of ânewâ that actually makes explicity a small array of size 1. For the case where the user knows that > the Set will be empty most of the time. There could be an #empty class method for that. And one could overwrite the #with: class method to create a singleton. > Marcus

Dec. 12, 2016

Re: [Pharo-dev] Set internal array size

by Marcus Denker

> On 1 Dec 2016, at 11:41, Christophe Demarey <christophe.demarey(a)inria.fr> wrote: > > >> Le 1 dÃ©c. 2016 Ã 15:04, Marcus Denker <marcus.denker(a)inria.fr> a Ã©crit : >> >> The idea that a set is always created with a minimal size is because we always add at least some elements > > not always. You know in some cases 80% of the time, your instances will have an empty Set and with some values for the remaining 20%. > If you check in Moose, you should find a lot this pattern. It would be interesting to play around with these thingsâ¦ the problem is that they are very context dependent, so there is lots of questions what to do (more a research topic than something one can solve nowâ¦). What we should do: -> the size should be 5, like it is for Dictionaries We need to unify the two version of the method that calculate the initial size. What we could do: -> provide a version of ânewâ that actually makes explicity a small array of size 1. For the case where the user knows that the Set will be empty most of the time. Marcus

Dec. 12, 2016

[pharo-project/pharo-core]

by GitHub

Branch: refs/tags/60324 Home: https://github.com/pharo-project/pharo-core

Dec. 12, 2016