July 2019 - Pharo-users - lists.pharo.org

Re: [Pharo-users] (no subject)

by EVELYN CUSI LOPEZ

Sorry, I'm working with Artefact not artifacts El lun., 15 jul. 2019 a las 15:25, EVELYN CUSI LOPEZ (<cusi.evelyn(a)gmail.com>) escribiÃ³: > Hi all, > > I'm working with artifacts, but I got an error. I have a pdf's generator > which works very well, but recently I discovered that it has problems with > special characters, specifically this: "Ä" since if some text has this > symbol the pdf is generated in white, I tried some encodings to the text > between them UTF8, Latin1, Latin2 and with these encodings the pdf manages > to generate well; however the character does not look like it should look > (It can be appear like this Ã or Ã¦). Does anyone know how to solve this > problem? > > Thanks very much, > Evelyn >

July 15, 2019

(no subject)

by EVELYN CUSI LOPEZ

Hi all, I'm working with artifacts, but I got an error. I have a pdf's generator which works very well, but recently I discovered that it has problems with special characters, specifically this: "Ä" since if some text has this symbol the pdf is generated in white, I tried some encodings to the text between them UTF8, Latin1, Latin2 and with these encodings the pdf manages to generate well; however the character does not look like it should look (It can be appear like this Ã or Ã¦). Does anyone know how to solve this problem? Thanks very much, Evelyn

July 15, 2019

Re: [Pharo-users] Testing "Weekly Digest" for GitHub

by Marcus Denker

Somehow it did not make a report this sundayâ¦ to debug. > On 8 Jul 2019, at 10:49, Marcus Denker <marcus.denker(a)inria.fr> wrote: > > Hi, > > There is a ProBot that creates an issue with a weekly summary. > > By installing it for testing, we got the first report: > > Weekly Digest (1 July, 2019 - 8 July, 2019) > https://github.com/pharo-project/pharo/issues/381 > > > I will do some fine-tuning (e.g. disable commits and star-gazers) later. > We then can let it run for some weeks and see if it is useful or not. > > Marcus

July 15, 2019

[ANN] Pharo Newsletter June 2019

by Marcus Denker

The Pharo Newsletter for June 2019 was send to subscribers. It is now available online: https://mailchi.mp/pharo/pharo-newsletter-june-2019 Find all the older newsletters in the archive: http://newsletter.pharo.org. You can subscribe to get the newsletter to get it as soon as is released. The July newsletter will be out soon (this week) Marcus

July 15, 2019

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

by Alexandre Bergel

Thanks for your detailed answers Cheers, Alexandre > On Jul 12, 2019, at 8:49 AM, Richard O'Keefe <raoknz(a)gmail.com> wrote: > > Search trees (which come in many varieties) are good for collections in which > adding, deleting, and lookup are interleaved, where there is an order on the > elements (if used as a set) or the keys (if used as a dictionary). So are > hash tables. But (balanced) search trees have guaranteed O(lg n) worst case > time, which hash tables do not. And search trees let you enumerate their > contents in ascending or descending order, at any time. And search trees can > support queries like > - tell me all the elements {<, <=, >, >=} x > - tell me all the elements between L and U > - tell me the next element (before,after) x > > My Smalltalk library includes Sorted{Set,Bag,Dictionary} implemented as splay trees. > Some time I must try an alternative. > in time O(lg n + number of answers). > > On Thu, 11 Jul 2019 at 04:53, Alexandre Bergel via Pharo-users <pharo-users(a)lists.pharo.org <mailto:pharo-users@lists.pharo.org>> wrote: > Hello Smiljana, > > Thanks for having written down this document. I am not expert in algorithm, so I would consider myself a simple user. I have developed complex software for some times and I have never seen the need of having a binary search tree. I guess this is probably partly because of my lack of expertise in binary search tree and partly because experts in binary search trees assume that people know what it is about and in what it is useful. > > My question is, when should a programmer ever need to use binary search tree? Can you add some examples on what these trees are good for, and how an average programmer should look into it. I think this will be a valuable and easy way to expand your blog. > > Cheers, > Alexandre > >> On Jul 7, 2019, at 5:12 PM, Smiljana Knezev <smilja.knezev(a)gmail.com <mailto:smilja.knezev@gmail.com>> wrote: >> >> Dear all, >> >> I've written about implementing binary search trees: https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinP… <https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinP…> >> >> Feedback and opinions is always welcome :) >> >> Best regards, >> Smiljana Knezev >

July 15, 2019

Re: [Pharo-users] [ANN] MessageFlowBrowser for Pharo 7 and 8

by Esteban Maringolo

I like the soundtrack. If anything else must be added, subtitles is the first thing in the list. El vie., 12 de julio de 2019 08:59, Richard O'Keefe <raoknz(a)gmail.com> escribiÃ³: > Great tool. Helpful video. > One thing would improve the video: remove the sound track, or > replace it with spoken commentary. > > > On Fri, 12 Jul 2019 at 04:15, Torsten Bergmann <astares(a)gmx.de> wrote: > >> Hi, >> >> I updated my MessageFlowBrowser today to work on Pharo 7 and 8, see >> attached screenshot >> or youtube video on https://www.youtube.com/watch?v=DRd_bzGocQg >> >> It now also works in Calypso and you just need to right click on a method >> in the method >> pane or code pane and select "Message Flow" close to Senders, >> Implementors and other. >> >> You can load the tool using >> >> Metacello new >> repository: 'github://astares/Pharo-MessageFlowBrowser/src'; >> baseline: 'MessageFlowBrowser'; >> load >> >> I also now moved repo from >> >> http://www.smalltalkhub.com/#!/~TorstenBergmann/MessageFlowBrowser >> >> to the new location >> >> https://github.com/astares/Pharo-MessageFlowBrowser >> >> on GitHub for future development. >> >> Have fun, >> T. >> >>

July 12, 2019

Re: [Pharo-users] Test Completion has been added to Pharo 8 - please test!

by Myroslava Romaniuk

Aha ok! Please let us know if you have a specific example of when it fails. We removed completion for temp declaration but when using already declared temps, as far as i tested, it seems to work. So would be grateful for a counterexample. Best, Myroslava On Fri, 12 Jul 2019 at 16:50, Cyril Ferlicot <cyril.ferlicot(a)gmail.com> wrote: > On Wed, Jul 3, 2019 at 2:29 AM Myroslava Romaniuk via Pharo-users > <pharo-users(a)lists.pharo.org> wrote: > > > > Hi all, > > > > we added an intermediate version of the upcoming test completion to > Pharo 8, it would be cool if you tested it and let us know the results. > Here's a blog post about it - link, and here's a tweet I'd be grateful if > you shared - link so perhaps people who don't read the mailing list would > also see it. In the blog post you can find more info how to enable the > completion in the settings and details about the whole thing in general. If > something doesn't work, or if something works differently than it used to > in the old completion (both if you don't like it or perhaps if you prefer > it) let me know either replying here, on twitter, or submitting an issue > request directly for the github repository here - link. > > > > Hi, > > Since the new code completion is enable I have problem with variables > completion. > I saw it the most with temporary variables that are not proposed for > completion anymore. This is really annoying since I often have long > variables names to be explicit in my code :( > > I hope it can help you improve it :) > > > Thanks very much, > > Myroslava > > > > -- > Cyril Ferlicot > https://ferlicot.fr > -- Ð Ð¿Ð¾Ð²Ð°Ð³Ð¾Ñ, ÐÐ¸ÑÐ¾ÑÐ»Ð°Ð²Ð° Ð Ð¾Ð¼Ð°Ð½ÑÐº.

July 12, 2019

Re: [Pharo-users] Test Completion has been added to Pharo 8 - please test!

by Cyril Ferlicot

On Wed, Jul 3, 2019 at 2:29 AM Myroslava Romaniuk via Pharo-users <pharo-users(a)lists.pharo.org> wrote: > > Hi all, > > we added an intermediate version of the upcoming test completion to Pharo 8, it would be cool if you tested it and let us know the results. Here's a blog post about it - link, and here's a tweet I'd be grateful if you shared - link so perhaps people who don't read the mailing list would also see it. In the blog post you can find more info how to enable the completion in the settings and details about the whole thing in general. If something doesn't work, or if something works differently than it used to in the old completion (both if you don't like it or perhaps if you prefer it) let me know either replying here, on twitter, or submitting an issue request directly for the github repository here - link. > Hi, Since the new code completion is enable I have problem with variables completion. I saw it the most with temporary variables that are not proposed for completion anymore. This is really annoying since I often have long variables names to be explicit in my code :( I hope it can help you improve it :) > Thanks very much, > Myroslava -- Cyril Ferlicot https://ferlicot.fr

July 12, 2019

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

by Richard O'Keefe

Search trees (which come in many varieties) are good for collections in which adding, deleting, and lookup are interleaved, where there is an order on the elements (if used as a set) or the keys (if used as a dictionary). So are hash tables. But (balanced) search trees have guaranteed O(lg n) worst case time, which hash tables do not. And search trees let you enumerate their contents in ascending or descending order, at any time. And search trees can support queries like - tell me all the elements {<, <=, >, >=} x - tell me all the elements between L and U - tell me the next element (before,after) x My Smalltalk library includes Sorted{Set,Bag,Dictionary} implemented as splay trees. Some time I must try an alternative. in time O(lg n + number of answers). On Thu, 11 Jul 2019 at 04:53, Alexandre Bergel via Pharo-users < pharo-users(a)lists.pharo.org> wrote: > Hello Smiljana, > > Thanks for having written down this document. I am not expert in > algorithm, so I would consider myself a simple user. I have developed > complex software for some times and I have never seen the need of having a > binary search tree. I guess this is probably partly because of my lack of > expertise in binary search tree and partly because experts in binary search > trees assume that people know what it is about and in what it is useful. > > My question is, when should a programmer ever need to use binary search > tree? Can you add some examples on what these trees are good for, and how > an average programmer should look into it. I think this will be a valuable > and easy way to expand your blog. > > Cheers, > Alexandre > > On Jul 7, 2019, at 5:12 PM, Smiljana Knezev <smilja.knezev(a)gmail.com> > wrote: > > Dear all, > > I've written about implementing binary search trees: > https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinP… > > Feedback and opinions is always welcome :) > > Best regards, > Smiljana Knezev > > >

July 12, 2019

Re: [Pharo-users] [ANN] MessageFlowBrowser for Pharo 7 and 8

by Richard O'Keefe

Great tool. Helpful video. One thing would improve the video: remove the sound track, or replace it with spoken commentary. On Fri, 12 Jul 2019 at 04:15, Torsten Bergmann <astares(a)gmx.de> wrote: > Hi, > > I updated my MessageFlowBrowser today to work on Pharo 7 and 8, see > attached screenshot > or youtube video on https://www.youtube.com/watch?v=DRd_bzGocQg > > It now also works in Calypso and you just need to right click on a method > in the method > pane or code pane and select "Message Flow" close to Senders, Implementors > and other. > > You can load the tool using > > Metacello new > repository: 'github://astares/Pharo-MessageFlowBrowser/src'; > baseline: 'MessageFlowBrowser'; > load > > I also now moved repo from > > http://www.smalltalkhub.com/#!/~TorstenBergmann/MessageFlowBrowser > > to the new location > > https://github.com/astares/Pharo-MessageFlowBrowser > > on GitHub for future development. > > Have fun, > T. > >

July 12, 2019