May 2012 - Pharo-users - lists.pharo.org

Re: [Pharo-users] [Pharo-consortium] We need your successes

by StÃ©phane Ducasse

Thanks Hilaire for this cool one :) https://gforge.inria.fr/frs/download.php/30761/drgeo-teaser.pdf I should do one for http://www.synectique.eu Stef

May 12, 2012

We need your Pharo successes

by StÃ©phane Ducasse

Hi everybody We really want to build a "vitrine" showroom of Pharo and we would you to participate. We want to build a web page with all these successes and show them to the world. :) We would like to get from you a three slides document: slide one: a sexy picture and a teaser / who you are. slide two: what is it how cool is it. slide three: what cool pharo techno you used or developed. If you have two successes then do two set of slides. So can you please send us these three slides. We would like to present them during the Pharo conf and after put them on the web. Stef and marcus.

May 11, 2012

Re: [Pharo-users] [ANN] LRUDictionary

by Norbert Hartl

Am 11.05.2012 um 16:48 schrieb Sven Van Caekenberghe: > Hi Norbert, > > On 11 May 2012, at 14:51, Norbert Hartl wrote: > >> I like to announce a tiny utility I did for my last project. It is only a single class that basically works like LRUCache internally but on the outside it is more like a dictionary. And it has no factory block. >> >> If you don't know LRUCache, it's a fixed size dictionary that sorts its elements by usage in a "Least Recently Used" fashion. Meaning the last used element is put in front and the least used at the end. Elements get discarded at the end if space is full. >> >> Apart from #at: that is provided by LRUCache , LRUDictionary implements to following methods >> >> at:ifAbsent: >> at:ifAbsentPut: >> at:ifPresent: >> at:put: >> removeAt: >> removeKey: >> removeKey:ifAbsent >> >> It is available here >> >> MCHttpRepository >> location: 'http://source.selfish.org/mc/misc' >> user: '' >> password: '' >> >> Blog article is here >> >> http://norbert.hartl.name/blog/lrudictionary/ >> >> hope you like it, >> >> Norbert > > This code strikes me as less than optimal: > > putInFront: anObject fromIndex: aNumber > values > replaceFrom: 2 > to: aNumber > with: (values first: aNumber - 1). > values at: 1 put: anObject. > ^ anObject > > #first: does a copy no ? > > #replaceFrom:to:with:startingAt: can do in place shifting, if you are careful. > I would also optimize for the case when the object is already in front. Sven, to be honest I didn't think about it. The part you are mentioning I took straight from LRUCache without doubting its usefulness. Everything you say makes sense to me. But I need to think first before saying anything useful :) > > But even then, all this shifting on each #at: access is a bit costly for a cache, no ? > The alternative, working with timestamps is also not that elegant and maybe also not faster. > Did you consider it ? Compare performance ? Of course the shifting is costly. I use it as a cache for outoging rest calls that does http and deserializes data. From that point of view it's no question. It accelerates immensly and the costs are leveraged easily. The timestamp approach needs to be tested. But I think you are right. It sounds much better to have to scan the array if an old element has to be removed instead of every access. Norbert

May 11, 2012

We need your successes

by StÃ©phane Ducasse

Hi everybody We really want to build a "vitrine" showroom of Pharo and we would you to participate. We want to build a web page with all these successes and show it to the world. :) We would like to get from you a three slides document: slide one: a sexy picture and a teaser / who you are. slide two: what is it how cool is it. slide three: what cool pharo techno you used or developed. I did a bad one using DrGeo to give you an idea. So can you please send us these three slides. We would like to present them during the Pharo conf and after put them on the web. Stef and marcus.

May 11, 2012

Re: [Pharo-users] [ANN] LRUDictionary

by Sven Van Caekenberghe

Hi Norbert, On 11 May 2012, at 14:51, Norbert Hartl wrote: > I like to announce a tiny utility I did for my last project. It is only a single class that basically works like LRUCache internally but on the outside it is more like a dictionary. And it has no factory block. > > If you don't know LRUCache, it's a fixed size dictionary that sorts its elements by usage in a "Least Recently Used" fashion. Meaning the last used element is put in front and the least used at the end. Elements get discarded at the end if space is full. > > Apart from #at: that is provided by LRUCache , LRUDictionary implements to following methods > > at:ifAbsent: > at:ifAbsentPut: > at:ifPresent: > at:put: > removeAt: > removeKey: > removeKey:ifAbsent > > It is available here > > MCHttpRepository > location: 'http://source.selfish.org/mc/misc' > user: '' > password: '' > > Blog article is here > > http://norbert.hartl.name/blog/lrudictionary/ > > hope you like it, > > Norbert This code strikes me as less than optimal: putInFront: anObject fromIndex: aNumber values replaceFrom: 2 to: aNumber with: (values first: aNumber - 1). values at: 1 put: anObject. ^ anObject #first: does a copy no ? #replaceFrom:to:with:startingAt: can do in place shifting, if you are careful. I would also optimize for the case when the object is already in front. But even then, all this shifting on each #at: access is a bit costly for a cache, no ? The alternative, working with timestamps is also not that elegant and maybe also not faster. Did you consider it ? Compare performance ? Sven

May 11, 2012

Re: [Pharo-users] [Pharo-project] [ANN] LRUDictionary

by Norbert Hartl

I always forget to move stuff. I moved it to squeaksource http://ss3.gemstone.com/ss/lrudictionary.html Norbert Am 11.05.2012 um 14:51 schrieb Norbert Hartl: > I like to announce a tiny utility I did for my last project. It is only a single class that basically works like LRUCache internally but on the outside it is more like a dictionary. And it has no factory block. > > If you don't know LRUCache, it's a fixed size dictionary that sorts its elements by usage in a "Least Recently Used" fashion. Meaning the last used element is put in front and the least used at the end. Elements get discarded at the end if space is full. > > Apart from #at: that is provided by LRUCache , LRUDictionary implements to following methods > > at:ifAbsent: > at:ifAbsentPut: > at:ifPresent: > at:put: > removeAt: > removeKey: > removeKey:ifAbsent > > It is available here > > MCHttpRepository > location: 'http://source.selfish.org/mc/misc' > user: '' > password: '' > > Blog article is here > > http://norbert.hartl.name/blog/lrudictionary/ > > hope you like it, > > Norbert

May 11, 2012

[ANN] LRUDictionary

by Norbert Hartl

I like to announce a tiny utility I did for my last project. It is only a single class that basically works like LRUCache internally but on the outside it is more like a dictionary. And it has no factory block. If you don't know LRUCache, it's a fixed size dictionary that sorts its elements by usage in a "Least Recently Used" fashion. Meaning the last used element is put in front and the least used at the end. Elements get discarded at the end if space is full. Apart from #at: that is provided by LRUCache , LRUDictionary implements to following methods at:ifAbsent: at:ifAbsentPut: at:ifPresent: at:put: removeAt: removeKey: removeKey:ifAbsent It is available here MCHttpRepository location: 'http://source.selfish.org/mc/misc' user: '' password: '' Blog article is here http://norbert.hartl.name/blog/lrudictionary/ hope you like it, Norbert

May 11, 2012

student project: a simple recognizer

by stephane ducasse

Hi guys Here is a topic for somebody that would like to have fun with events. There is a javascript version and it would be cool to have a version for Pharo. http://depts.washington.edu/aimgroup/proj/dollar/ http://www.lifl.fr/~casiez/PJE/OneDollar.pdf It is probably close to Genie but at least the algorithms are clearly defined. Stef

May 10, 2012

Re: [Pharo-users] FYI: No JIT on Windows 8 for ARM - luajit - FreeLists

by GÃ¶ran Krampe

On 05/10/2012 12:59 PM, Sven Van Caekenberghe wrote: > Maybe it becomes time to switch to Linux for everything, > if only a nicely built 100% supported laptop existedâ¦ I recently bought a new laptop and after taking long hard looks at various Ultrabook variants I ended up with a Lenovo X220, and it runs Ubuntu 12.04 *perfectly*. This includes everything AFAIK. I blogged about it: http://goran.krampe.se/2012/04/14/going-lenovo/ In that blog post I mention 3G not unlocking in Ubuntu - but that actually works perfect too, had some glitch there. regards, GÃ¶ran

May 10, 2012

Re: [Pharo-users] FYI: No JIT on Windows 8 for ARM - luajit - FreeLists

by Igor Stasenko

On 10 May 2012 12:59, Sven Van Caekenberghe <sven(a)beta9.be> wrote: > That means no official CogVM then ? Both ARM and x86 seems to be > problematic. > Cog won't run on win8/arm.. who cares? :) > http://www.freelists.org/post/luajit/FYI-No-JIT-on-Windows-8-for-ARM > > Luckily I am not on Windows ;-) > Mac OS X is also moving slowly in the wrong direction of a couple of fronts. > Maybe it becomes time to switch to Linux for everything, > if only a nicely built 100% supported laptop existedâ¦ > yes, this tendency is strange as to me.. i don't know any valid argument to justify their decision (both apple and microsoft). > Sven > -- Best regards, Igor Stasenko.

May 10, 2012