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

Re: [Pharo-dev] is the through working on the debugger?

by Marcus Denker

reported is only 10332 Issues when using âThrough" https://pharo.fogbugz.com/f/cases/10332 On 11 Dec 2013, at 10:01, StÃ©phane Ducasse <stephane.ducasse(a)inria.fr> wrote: > Hi guys > > with pavel we think that we found a bug on the through of the debugger (to jump inside a block). > Is it a well-known bug? > > Stef

Dec. 11, 2013

Re: [Pharo-dev] is the through working on the debugger?

by StÃ©phane Ducasse

False alert it is working. On Dec 11, 2013, at 10:01 AM, StÃ©phane Ducasse <stephane.ducasse(a)inria.fr> wrote: > Hi guys > > with pavel we think that we found a bug on the through of the debugger (to jump inside a block). > Is it a well-known bug? > > Stef

Dec. 11, 2013

is the through working on the debugger?

by StÃ©phane Ducasse

Hi guys with pavel we think that we found a bug on the through of the debugger (to jump inside a block). Is it a well-known bug? Stef

Dec. 11, 2013

self item returns a string

by StÃ©phane Ducasse

Hi ben Im trying to fix the problem of the finder putting too many string around the arguments. if you type 'a' . 'b' . 'ab' and example you will get '''a''' . '''b''' so I found that displayString self halt. ^ self item asString self item returns a byteString and item is not redefined in FinderNode I tried to change it to displayString ^ self item but self item is already '''a '''' the item on the node is already a '''a''''â¦. So I tried to check how the node were populated but I could not get childrenItems to work.

Dec. 11, 2013

Re: [Pharo-dev] MessageNotUnderstood: SmallInteger>>isEmpty

by Dario Trussardi

Ciao Eliot, > Hi Dario, > > > On Tue, Dec 10, 2013 at 8:12 AM, Dario Trussardi <dario.trussardi(a)tiscali.it> wrote: > Ciao, > > i work with a new Pharo 2.0 20628 image. > > I do first : > A) Gofer new url: 'http://smalltalkhub.com/mc/DiegoLont/QCMagritte/main'; package: 'ConfigurationOfQCMagritte'; load. > > and: > B) ((Smalltalk at: #ConfigurationOfQCMagritte) project version: '0.2') load: #( 'Demo' ). > > After some works the system when Fetching 1.0.2.1 of ConfigurationOfTwitteBootstrap > > erase the error: > > > SmallInteger(Object)>>doesNotUnderstand: #isEmpty > MetacelloMCVersionSpec>>resolveToLoadableSpecs:map: > MetacelloMCVersionSpec>>resolveToLoadableSpecs: > MetacelloMCVersionSpec>>expandToLoadableSpecNames: in Block: [:cache | ... > MetacelloPharoPlatform(MetacelloPlatform)>>stackCacheFor:cacheClass:at:doing: in Block: [:dict | ... > MetacelloPharoPlatform(MetacelloPlatform)>>useStackCacheDuring:defaultDictionary: in Block: [^ aBlock value: dict] > BlockClosure>>on:do: > MetacelloPharoPlatform(MetacelloPlatform)>>useStackCacheDuring:defaultDictionary: > MetacelloPharoPlatform(MetacelloPlatform)>>stackCacheFor:cacheClass:at:doing: > MetacelloPharoPlatform(MetacelloPlatform)>>stackCacheFor:at:doing: > MetacelloMCVersionSpec>>expandToLoadableSpecNames: > MetacelloMCVersion>>expandToLoadableSpecNames: > MetacelloMCProjectSpec>>relativeCurrentVersion in Block: [vrsn expandToLoadableSpecNames: (loadList := self...etc... > BlockClosure>>on:do: > MetacelloMCProjectSpec>>relativeCurrentVersion > MetacelloProjectReferenceSpec>>relativeCurrentVersion > MetacelloMCVersionSpec>>isPartiallyCurrentAgainst: in Block: [:prj | ... > MetacelloProjectReferenceSpec>>projectDo:packageDo:groupDo: > MetacelloMCVersionSpec>>specsNamed:projectDo:packageDo:groupDo: in Block: [:name | | pkgSpec | (pkgSpec := map... > Array(SequenceableCollection)>>do: > MetacelloMCVersionSpec>>specsNamed:projectDo:packageDo:groupDo: > MetacelloMCVersionSpec>>isPartiallyCurrentAgainst: > MetacelloMCVersionSpec>>isPartiallyCurrent > MetacelloMCProject(MetacelloProject)>>currentVersionAgainst: in Block: [:version | ... > Array(SequenceableCollection)>>do: > MetacelloMCProject(MetacelloProject)>>currentVersionAgainst: in Block: [:cache | ... > MetacelloPharoPlatform(MetacelloPlatform)>>stackCacheFor:cacheClass:at:doing: in Block: [:dict | ... > MetacelloPharoPlatform(MetacelloPlatform)>>useStackCacheDuring:defaultDictionary: in Block: [^ aBlock value: dict] > BlockClosure>>on:do: > MetacelloPharoPlatform(MetacelloPlatform)>>useStackCacheDuring:defaultDictionary: > > Any idea? > > I suspect you have an older, buggy, VM. What does the VM say to -version? How i can define the VM that the system used ? In the menu System / System Reported i found this: Virtual Machine --------------- /Users/dtr/Desktop/Pharo2.0.app/Contents/MacOS/Pharo NBCoInterpreter NativeBoost-CogPlugin-EstebanLorenzano.18 uuid: a53445f9-c0c0-4015-97a3-be7db8d9ed6b Mar 13 2013 NBCogit NativeBoost-CogPlugin-EstebanLorenzano.18 uuid: a53445f9-c0c0-4015-97a3-be7db8d9ed6b Mar 13 2013 git://gitorious .org/cogvm/blessed.git Commit: 412abef33cbed05cf1d75329e451d71c0c6aa5a7 Date: 2013-03-13 17:48:50 +0100 By: Esteban Lorenzano <estebanlm(a)gmail.com> Jenkins build #14535 Mac Cocoa Cog 5.8b12 21-Sep-10 >1B0534FA-246C-47C5-AB29-7A76C81CCDCB< VMMaker versionString git://gitorious.org/cogvm/blessed.git Commit: 412abef33cbed05cf1d75329e451d71c0c6aa5a7 Date: 2013-03-13 17:48:50 +0100 By: Esteban Lorenzano <estebanlm(a)gmail.com> Jenkins build #14535 NBCoInterpreter NativeBoost-CogPlugin-EstebanLorenzano.18 uuid: a53445f9-c0c0-4015-97a3-be7db8d9ed6b Mar 13 2013 NBCogit NativeBoost-CogPlugin-EstebanLorenzano.18 uuid: a53445f9-c0c0-4015-97a3-be7db8d9ed6b Mar 13 2013 It is significant ? In my MacBook i have run some Pharo version. For open the Pharo 2.0 i double click on the Pharo 2.0 icon on the desktop. Right ? Thanks, Dario > > Thanks, > > Dario > > -- > HTH, > Eliot

Dec. 11, 2013

Is it possible to load and display pdfs inside pharo ?

by kilon alios

I was wondering if there is a library to load and display or at least parse pdf files for pharo.

Dec. 11, 2013

Re: [Pharo-dev] Searchbar in the browser

by StÃ©phane Ducasse

No in fact this is about filtering classes directly without opening the finder >> Hi Stef, >> >> I am thinking about the -Point suggestion. Why this? Why not to use Cmd+f,cmd+c (find class), or shift+enter (spotlight)? > > Indeed we do not need it :) > >

Dec. 11, 2013

Re: [Pharo-dev] Searchbar in the browser

by StÃ©phane Ducasse

On Dec 10, 2013, at 11:42 PM, Juraj Kubelka <juraj.kubelka(a)gmail.com> wrote: > We can use any regular expression. For that reason I am thinking how to do the filter feature more apparent. Maybe a ghost text is enough. I will play with it. ghosttext is simple and working. > > Jura > > El 10-12-2013, a las 19:14, StÃ©phane Ducasse <stephane.ducasse(a)inria.fr> escribiÃ³: > >> I like it! >> use it all the time. I was not aware that we could use | >> >> >>> >>> El 10-12-2013, a las 9:12, Alexandre Bergel <alexandre.bergel(a)me.com> escribiÃ³: >>> >>>>> If I search for something, I always Shift-Enter and that works super. For the rest, there are menus and keyboard shortcuts. >>>> >>>> Actually, this is quite different. Shift-Enter this is for searching. The textfield in Nautilus is for filtering packages >>>> >>> >>> Yes, the package filter allows to see only packages you are interested. See the attachment. >>> Cheers, >>> Jura >>> >>> <Captura de pantalla 2013-12-10 a la(s) 18.24.33.png> >>> >>> >>>> Alexandre >>>> >>>> >>>> -- >>>> _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: >>>> Alexandre Bergel http://www.bergel.eu >>>> ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. >>>> >>>> >>>> >>>> >>> >> >

Dec. 11, 2013

Re: [Pharo-dev] [Spec] Non resizable window

by StÃ©phane Ducasse

Thanks! I will try to show a bug fixing action this afternoon and also how to handle/review bugs. Stef > For the morphic part > https://pharo.fogbugz.com/default.asp?12385 > and > for Spec > https://pharo.fogbugz.com/default.asp?12386 > > > Enjoy :P > > Ben > > On 10 Dec 2013, at 08:56, Roberto Minelli <roberto.minelli(a)usi.ch> wrote: > >> >> On Dec 10, 2013, at 8:11 AM, StÃ©phane Ducasse <stephane.ducasse(a)inria.fr> wrote: >> >>> >>> On Dec 10, 2013, at 7:49 AM, Roberto Minelli <roberto.minelli(a)usi.ch> wrote: >>> >>>> Hi, >>>> >>>> Is there any simple way to make a SpecWindow not resizable? >>> >>> No idea but we should be able to specify that in the spec >> >> +1 ;-) >> >>> >>>> >>>> Cheers, >>>> R >>>> >>> >>> >> >> >

Dec. 11, 2013

Re: [Pharo-dev] [ANN] Neo-Caching

by Tudor Girba

Great! I took a look at the code. It's simple and clean. Thanks a lot for this addition. It is highly needed. Cheers, Doru On Tue, Dec 10, 2013 at 11:58 PM, Sven Van Caekenberghe <sven(a)stfx.eu>wrote: > > On 10 Dec 2013, at 23:09, StÃ©phane Ducasse <stephane.ducasse(a)inria.fr> > wrote: > > > Sven thanks a lot > > How can we resist to push this in Pharo 30 :) > > That is the idea, and I will do it, but I would first like some > feedback/validation. > > > Stef > > > > On Dec 10, 2013, at 4:54 PM, Sven Van Caekenberghe <sven(a)stfx.eu> wrote: > > > >> Hi, > >> > >> Caching is an important technique to trade time (speed of execution) > for space (memory consumption) in computation. Used correctly, caching can > significantly improve an applicationâs performance. > >> > >> Given the key/value nature of a cache, a Dictionary is often the first > data structure used for implementing it. This is however not a good idea > since a simple Dictionary is unbounded by definition and can/will lead to > explosive cache growth. > >> > >> Quick and dirty hacks to turn a Dictionary into a least-recently-used > (LRU) and/or time-to-live (TTL) based limited cache are often incorrect and > inefficient. > >> > >> The LRUCache implementation currently in Pharo is too simple and not > efficient, being O(n) on its main operation. > >> > >> Pharo deserves and needs a good LRU/TTL cache implementation that > can/should be used uniformly in various places of the system and in code > built on top of it. That is why I implemented a proposal. > >> > >> Neo-Caching is an implementation of both a good LRU cache as well as a > TTL extension of it. The caches are easy to use, yet have a number of > interesting features. The implementation is properly O(1) on its main > operations and is 2 to 3 times faster than LRUCache. The package also > contains a double linked list implementation. The code comes with a full > set of unit tests. There are class and method comments and the code is easy > to read. > >> > >> The code (which has no dependencies) can be found here > >> > >> http://mc.stfx.eu/Neo > >> http://www.smalltalkhub.com/mc/SvenVanCaekenberghe/Neo/main > >> > >> There is only one package to load. The code has been written in Pharo > 3.0 but it should run on older versions as well. > >> > >> > >> Code > >> > >> > >> Letâs create a 16K ordered collection of keys that have some > repetitions in them with a reasonable distribution: > >> > >> data := Array streamContents: [ :out | > >> 1 to: 4096 do: [ :each | > >> each primeFactorsOn: out. > >> out nextPut: each ] ]. > >> data := data collect: [ :each | each asWords ]. > >> > >> By using #asWords the keys have better hash properties. Now, we put all > this in a cache: > >> > >> cache := NeoLRUCache new. > >> cache maximumWeight: 512. > >> cache factory: [ :key | key ]. > >> data do: [ :each | cache at: each ]. > >> cache. > >> > >> ==> a NeoLRUCache(#512 512/512 [ 1 ] [ :key | key ] 72%) > >> > >> We had a 72% hit ratio, which is good. The cache is of course full, > 512/512 with 512 entries (not necessarily the same thing, see further). > >> > >> We can now benchmark this: > >> > >> [ data do: [ :each | cache at: each ] ] bench. > >> > >> ==> '35.8 per second.â > >> > >> And compare it to LRUCache: > >> > >> cache := LRUCache size: 512 factory: [ :key | key ]. > >> > >> [ data do: [ :each | cache at: each ] ] bench. > >> > >> ==> '12.6 per second.â > >> > >> > >> Features > >> > >> > >> Instead of just counting the number of entries, which is the default > behaviour, the concept of weight is used to determine when a cache is full. > For each cached value, a block or selector is used to compute its weight. > When adding a new entry causes the weight to exceed a maximum, eviction of > the least recently used item(s) takes place, until the weight is again > below the maximum. > >> > >> cache > >> computeWeight: #sizeInMemory; > >> maximumWeight: 16*1024. > >> > >> Will keep the cache below 16Kb in real memory usage. This can be very > useful when caching various sized images or MC packages, for example. > >> > >> By default, no concurrent access protection takes place, but optionally > a semaphore for mutual exclusion can be used. This slows down access. > >> > >> cache useSemaphore. > >> > >> NeoTTLCache extends NeoLRUCache by maintaining a timestamp for each > cached value. Upon cache hit, there is a check to see if this timestamp is > not older than the allowed time to live. If so, the value is stale and will > be recomputed. > >> > >> (cache := NeoTTLCache new) > >> timeToLive: 10 minutes; > >> factory: [ :key | ZnEasy get: key ]; > >> maximumWeight: 32*1024; > >> computeWeight: #contentLength. > >> > >> cache at: âhttp://zn.stfx.eu/zn/numbers.txt'. > >> > >> ==> a ZnResponse(200 OK text/plain;charset=utf-8 71B) > >> > >> cache > >> > >> ==> a NeoTTLCache(#1 71/32768 #contentLength [ :key | ZnEasy get: key ] > 0% 0:00:10:00) > >> > >> Would be a simple HTTP cache, keeping resolved URLs in memory for 10 > minutes maximum before refreshing them. It uses #contentLength on > ZnResponse to compute the weight. You can see from the print string that > there is now 1 entry, while the weight is 17 bytes out of 32768. > >> > >> > >> These are the main points, please have a look at the code. Feedback is > welcome. > >> > >> Regards, > >> > >> Sven > >> > >> > > > > > > > -- www.tudorgirba.com "Every thing has its own flow"

Dec. 11, 2013