- Pharo-dev - lists.pharo.org

[Pharo-project] condenseChanges problem

by Pavel Krivanek

Hi, I created a special on the CI server and it seems that we are not able to condense changes. See https://ci.lille.inria.fr/pharo/job/Pharo%201.4%20condenseChanges/5/console -- Pavel

Aug. 1, 2011

Re: [Pharo-project] Coral and read-eval-loop ?

by StÃ©phane Ducasse

yes it does. Stef On Jul 31, 2011, at 10:58 PM, Alexandre Bergel wrote: > Hi! > > I often use ruby when I wish to realize some arithmetic operating without leaving my xterm. I haven't tried Coral, but does it offer a read-eval-loop? a bit like in scheme or shell script? > > Cheers, > Alexandre > -- > _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: > Alexandre Bergel http://www.bergel.eu > ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. > > > > > >

Aug. 1, 2011

[Pharo-project] [update 1.4] #14068

by Marcus Denker

14068 ----- Issue 4563: should not we remove deprecated 1.2 ? http://code.google.com/p/pharo/issues/detail?id=4563 -- Marcus Denker -- http://marcusdenker.de

Aug. 1, 2011

[Pharo-project] [update 1.4] #14067

by Marcus Denker

14067 ----- Issue 4566: SUnit: Fix for tagging expectedFailure using pragmas http://code.google.com/p/pharo/issues/detail?id=4566 Issue 4570: adding bitString to SmallInteger http://code.google.com/p/pharo/issues/detail?id=4570 Issue 4561: Monticello GUI is broken http://code.google.com/p/pharo/issues/detail?id=4561 -- Marcus Denker -- http://marcusdenker.de

Aug. 1, 2011

Re: [Pharo-project] [squeak-dev] identityHash bits not incremented for new objects?

by Mariano Martinez Peck

Hi Igor. Does the same test work correctlly in a interpreter VM? because I can see: ObjectMemory >> newObjectHash "Answer a new 16-bit pseudo-random number for use as an identity hash." lastHash := 13849 + (27181 * lastHash) bitAnd: 65535. ^ lastHash In which case, it seems that every new hash will be different than the previous one. But NewObjectMemory >> newObjectHash "Derive the new object hash from the allocation pointer. This is less costly than using lastHash because it avoids the read-modify-write cycle to update lastHash. Since the size of eden is a power of two and larger than the hash range this provides a well-distributed and fairly random set of values." <inline: true> ^freeStart >> BytesPerWord so...I have no idea, but maybe for two consequently allocated objects, the instVar freeStart can remain with the same value ? On Mon, Aug 1, 2011 at 8:43 AM, Igor Stasenko <siguctua(a)gmail.com> wrote: > I found that #testBecomeIdentityHash sometimes failing, sometimes not. > > It seems like VM 'forgets' to produce different identityHash bits for > two consequently allocated objects, > while test assumes that they are always different. > > If i insert a statement (see the code), test no longer fails. > > testBecomeIdentityHash > "Note. The identity hash of both objects seems to change after the > become:" > > | a b c d | > > a := 'ab' copy. > b := 'cd' copy. > > >>> [ b identityHash = a identityHash ] whileTrue: [ b := b copy ]. > > c := a. > d := b. > > a become: b. > > self > assert: a identityHash = c identityHash; > assert: b identityHash = d identityHash; > deny: a identityHash = b identityHash. > > A simple piece of code reveals the problem: > > (1 to: 20) collect: [:i | > 'ab' copy basicIdentityHash ] #(954 954 955 955 956 956 957 957 958 > 958 959 959 960 960 961 961 962 962 963 963) > > > -- > Best regards, > Igor Stasenko AKA sig. > > -- Mariano http://marianopeck.wordpress.com

Aug. 1, 2011

[Pharo-project] identityHash bits not incremented for new objects?

by Igor Stasenko

I found that #testBecomeIdentityHash sometimes failing, sometimes not. It seems like VM 'forgets' to produce different identityHash bits for two consequently allocated objects, while test assumes that they are always different. If i insert a statement (see the code), test no longer fails. testBecomeIdentityHash "Note. The identity hash of both objects seems to change after the become:" | a b c d | a := 'ab' copy. b := 'cd' copy. >>> [ b identityHash = a identityHash ] whileTrue: [ b := b copy ]. c := a. d := b. a become: b. self assert: a identityHash = c identityHash; assert: b identityHash = d identityHash; deny: a identityHash = b identityHash. A simple piece of code reveals the problem: (1 to: 20) collect: [:i | 'ab' copy basicIdentityHash ] #(954 954 955 955 956 956 957 957 958 958 959 959 960 960 961 961 962 962 963 963) -- Best regards, Igor Stasenko AKA sig.

Aug. 1, 2011

[Pharo-project] Coral and read-eval-loop ?

by Alexandre Bergel

Hi! I often use ruby when I wish to realize some arithmetic operating without leaving my xterm. I haven't tried Coral, but does it offer a read-eval-loop? a bit like in scheme or shell script? Cheers, Alexandre -- _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: Alexandre Bergel http://www.bergel.eu ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.

July 31, 2011

[Pharo-project] SmallHarbour sprint

by laurent laffont

Hi, there will be a Small Harbour (http://smallharbour.org - a public fork of SeasideHosting codebase) on Tuesday 2 August, from 11h to 18h (Paris time). You can participate using Skype and TeamViewer. If you can come "for real", Romain and I will be at the Gallice CafÃ© (http://www.gallicecafe.com/) Cran-Gevrier (France, near Annecy). Actually the main goal is to setup the first public server for alpha testers Other goals: - add the possibility to create an account and deploy a template pier image in one click - nice theme - code cleaning - some VM stuff Send me email if you want to participate. Cheers, Laurent Laffont - @lolgzs <http://twitter.com/#!/lolgzs> Pharo Smalltalk Screencasts: http://www.pharocasts.com/ Blog: http://magaloma.blogspot.com/ Developer group: http://cara74.seasidehosting.st

July 31, 2011

Re: [Pharo-project] Users of #become:

by StÃ©phane Ducasse

open a ticket :) and this is probably because because one arrived after the other. I do not remember the history on that part. Stef > just checked senders of #become: > and found multiple places where it would be better to use #becomeForward: > > CompiledMethod>>putSource:fromParseNode:inFile:withPreamble: > MethodDictionary>>compact , grow, rehash , removeAll, removeKey:ifAbsent: > > SmalltalkImage>>recreateSpecialObjectsArray > > -- > Best regards, > Igor Stasenko AKA sig. >

July 31, 2011

Re: [Pharo-project] add: message declared in Collection

by Schwab,Wilhelm K

I *assume* it is a lesser-of-evils decision, drawing attention to the need to create an appropriate implementation for an offending collection and letting explicitly opt-out, classes for which #add: does not make sense. Done correctly, one is informed that #add: is deliberately not available or that the class in question needs to be fixed. Just a guess... Bill ________________________________________ From: pharo-project-bounces(a)lists.gforge.inria.fr [pharo-project-bounces(a)lists.gforge.inria.fr] On Behalf Of dimacamp [dimacamp(a)hotmail.com] Sent: Saturday, July 30, 2011 5:19 PM To: pharo-project(a)lists.gforge.inria.fr Subject: [Pharo-project] add: message declared in Collection Does anyone know why the #add: message is declared in Collection as subclassResponsibility if then some subclasses need to cancel the message raising a shouldNotImplement exception? Why isn't just declared in the classes that really should answer that message? Thanks. Diego. -- View this message in context: http://forum.world.st/add-message-declared-in-Collection-tp3706883p3706883.… Sent from the Pharo Smalltalk mailing list archive at Nabble.com.

July 31, 2011