Squeak-dev January 2010

squeak-dev@lists.squeakfoundation.org

91 participants
425 discussions

How to beat Andreas at his own game
by Colin Putney 26 Jan '10

26 Jan '10

Hi all, With all the sound and fury we've had lately, I thought I'd make a suggestion for Keith, or anyone else who isn't happy with the way the Squeak community has been evolving lately. If you think about it, the Board really has power over one thing: the name "Squeak." Even that's mostly a social convention than anything - control of the squeak-related domain names and the moral authority that comes from having been elected by the community. All Andreas did was say, "hey everybody, I've set up a repository that you can commit to, and I plan to follow process X for releasing images based on what you submit." If you don't like process X, the way to persuade the community not to follow Andreas is to provide an alternative. Keith, it sounds to me like you've got clear ideas about what a better alternative would be, and have the tools realize that vision. To that end, I suggest the following steps: * Pick a name for your project. "StableSqueak" has been used already, but what about "SolidSqueak?" From a marketing perspective, you want to emphasize your commitment to compatibility. * Create a web site. No need for anything fancy, just put a page up at solidsqueak.org that explains the process you espouse. You've posted numerous explanations to this list, so it should be trivial to pull together something coherent. * Provide some infrastructure. This depends a bit on your process, but from what I understand you'll want an issue tracker. Maybe the existing Mantis database will serve, but you could create your own. Maybe you want a mailing list. All these things can be had for free from various places - lots of folks have found Google Code projects to work out well for Smalltalk, even though we don't really need their source-code repository. * Make releases. If I understand correctly, there's already a lot of work done, and Bob can automatically build images based on various versions of Squeak and incorporating a whole raft of fixes from Mantis. That's a great place to start. * Eat the dog food. Make your own work available through this process, both as an example of how it should be done and to work out the kinks. * Talk it up. When you produce new release images, post announcements on this list, make blog posts touting the fixes and new features that are included. Announce improvements to the process too - new releases of Bob or Sake, new integration proceedures, new base images supported etc. * Provide support. As folks become interested in what you're doing, they'll want to try things out. Answer questions about how to participate, encourage experimentation and be receptive to new ideas. Above all, try to help people use your system to achieve their own goals. After that they'll be happy to contribute back to the community you've created. If you think this sounds like a lot of work, well, yeah, it is. Leadership and community-building *is* a lot of work. Andreas has demonstrated that he's willing to work hard at it. The Seaside guys are doing that work, and so is the Pharo team. You've already put a lot of work into building out your tool set and articulating your vision, so you've obviously got what it takes. As the benefits of your process start to become clear, more and more of the community will follow your lead, and the trunk will languish, just as other failed initiatives have done over the years. You may find yourself elected to the board, and SolidSqueak folded back into Squeak proper, or simply that SolidSqueak is so successful that you don't really care what goes on with the board and their moribund process. Either way, you win. Colin

5 8

Brave New World
by keith 26 Jan '10

26 Jan '10

Dear All, I invite you to watch the following presentation. It was recommended by Eliot, thanks Eliot, and he is correct it is brilliant. I have watched it several times. Eliot wrote: > I suggest you do need to see http://www.ted.com/talks/lang/eng/clay_shirky_on_institutions_versus_collab… > and think about its implications. The current "institution" is an "obstacle" to progress, and both the "trunk" repository and the pharo team's approaches, are inherently exclusionary, generating only one product, under the guidance of the professional class of elite programmers, and celebrities we have elected etc. (you have to watch the talk). [that is why the bob process was proposed in the first place] We need, and have known for while that we need the equivalent of the printing press, the thing that actually facilitates chaos and creativity, that can then be co-ordinated in its diversity and creativity, rather than being controlled. We need to level the playing field for all of us, even the little guy, the below average, "way to the left" on the contribution curve contributors. What we really need as an essential starting point is actually the kernel image that we have talked about for so long. So thank you Juan Vuletich, thank you for your kernel image, I am sure it will go far. We just need a couple of tools for CUIS that will allow contributions at ANY level, and tools and infrastructure that can cope with forking if someone wants to be liberated from Juan's benevolent control of the kernel. Essentially I am proposing a paradigm shift from "centralized" scm, like subversion or CVS (aka trunk). and we need the equivalent of git/mercurial and bazaar, where development is decentralised and we can branch to our hearts content. So, welcome to the brave new world, built in Cuis. Keith

11 32

Daily Commit Log
by commits＠source.squeak.org 26 Jan '10

26 Jan '10

Changes to Trunk (http://source.squeak.org/trunk.html) in the last 24 hours: http://lists.squeakfoundation.org/pipermail/packages/2010-January/002490.ht… Name: Morphic-dtl.313 Ancestors: Morphic-dtl.312 Remove remaining dependencies on ST80-Editors from non-MVC packages. Remove explicit references to ST80 classes from ModalSystemWindow and various utility methods. ============================================= http://lists.squeakfoundation.org/pipermail/packages/2010-January/002491.ht… Name: ST80-dtl.88 Ancestors: ST80-dtl.87 Remove remaining dependencies on ST80-Editors from non-MVC packages. Remove explicit references to ST80 classes from ModalSystemWindow and various utility methods. ============================================= http://lists.squeakfoundation.org/pipermail/packages/2010-January/002492.ht… Name: System-dtl.240 Ancestors: System-dtl.239 Remove remaining dependencies on ST80-Editors from non-MVC packages. Remove explicit references to ST80 classes from ModalSystemWindow and various utility methods. ============================================= http://lists.squeakfoundation.org/pipermail/packages/2010-January/002493.ht… Name: Compiler-ul.116 Ancestors: Compiler-ar.115 - don't create a block in Dictionary >> #bindingOf: ============================================= http://lists.squeakfoundation.org/pipermail/packages/2010-January/002494.ht… Name: Kernel-ul.382 Ancestors: Kernel-dtl.381 In MethodDictionary - cosmetic changes: use #ifNotNil: if possible - ensure that #rehashWithoutBecome doesn't send #become:, making #rehashAllInstances a lot faster - ensure that #removeAll preserves the capacity - deprecated #methodArray, it's the same as #array - new comment for #new ============================================= http://lists.squeakfoundation.org/pipermail/packages/2010-January/002495.ht… Name: Collections-ul.282 Ancestors: Collections-nice.281 In the HashedCollection hierarchy: - cosmetic changes: use #ifNotNil: if possible - use unary symbols instead of blocks with a single unary send - removed unnecessary line from #atRandom - restored correct compatibility method for #fullCheck In Dictionary: - make sure that #associationsSelect: works with PluggableDictionary by using #copyEmpty instead of #species + #new - deprecated #keyForIdentity:, because it's similar to #keyAtIdentityValue:ifAbsent: In WeakKeyDictionary: - #rehash throws away nil keys, so we don't have to iterate twice over array - don't let the key go away in #noCheckNoGrowFillFrom: In WeakKeyToCollectionDictionary: - don't let the key go away in #noCheckNoGrowFillFrom: - removed #finalizeValues because it became same as super In WeakSet: - #do:after: doesn't skip the first element if anElement is nil - speed up #slowSize - don't rehash twice in #grow, just count the occupied slots first with #slowSize Other: - simplified a few KeyedSet's methods - added #collect: to PluggableDictionary (super doesn't copy the blocks) =============================================

1 0

The Trunk: Collections-ul.282.mcz
by commits＠source.squeak.org 25 Jan '10

25 Jan '10

Levente Uzonyi uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-ul.282.mcz ==================== Summary ==================== Name: Collections-ul.282 Author: ul Time: 25 January 2010, 10:56:13.924 pm UUID: 44962376-0c2e-ea4c-9fce-9fb056cd768b Ancestors: Collections-nice.281 In the HashedCollection hierarchy: - cosmetic changes: use #ifNotNil: if possible - use unary symbols instead of blocks with a single unary send - removed unnecessary line from #atRandom - restored correct compatibility method for #fullCheck In Dictionary: - make sure that #associationsSelect: works with PluggableDictionary by using #copyEmpty instead of #species + #new - deprecated #keyForIdentity:, because it's similar to #keyAtIdentityValue:ifAbsent: In WeakKeyDictionary: - #rehash throws away nil keys, so we don't have to iterate twice over array - don't let the key go away in #noCheckNoGrowFillFrom: In WeakKeyToCollectionDictionary: - don't let the key go away in #noCheckNoGrowFillFrom: - removed #finalizeValues because it became same as super In WeakSet: - #do:after: doesn't skip the first element if anElement is nil - speed up #slowSize - don't rehash twice in #grow, just count the occupied slots first with #slowSize Other: - simplified a few KeyedSet's methods - added #collect: to PluggableDictionary (super doesn't copy the blocks) =============== Diff against Collections-nice.281 =============== Item was changed: + ----- Method: IdentityDictionary>>keyAtValue:ifAbsent: (in category 'accessing') ----- - ----- Method: IdentityDictionary>>keyAtValue:ifAbsent: (in category 'private') ----- keyAtValue: value ifAbsent: exceptionBlock "Answer the key that is the external name for the argument, value. If there is none, answer the result of evaluating exceptionBlock." + ^super keyAtIdentityValue: value ifAbsent: exceptionBlock! - self associationsDo: - [:association | value == association value ifTrue: [^ association key]]. - ^ exceptionBlock value! Item was changed: ----- Method: Set>>noCheckNoGrowFillFrom: (in category 'private') ----- noCheckNoGrowFillFrom: anArray "Add the elements of anArray except nils to me assuming that I don't contain any of them, they are unique and I have more free space than they require." 1 to: anArray size do: [ :index | + (anArray at: index) ifNotNil: [ :object | - | object | - (object := anArray at: index) ifNotNil: [ array at: (self scanForEmptySlotFor: object) put: object ] ]! Item was changed: ----- Method: WeakSet>>noCheckNoGrowFillFrom: (in category 'private') ----- noCheckNoGrowFillFrom: anArray "Add the elements of anArray except nils and flag to me assuming that I don't contain any of them, they are unique and I have more free space than they require." tally := 0. 1 to: anArray size do: [ :index | + (anArray at: index) ifNotNil: [ :object | + object == flag ifFalse: [ - | object | - ((object := anArray at: index) == flag or: [ - object == nil ]) ifFalse: [ array at: (self scanForEmptySlotFor: object) put: object. + tally := tally + 1 ] ] ]! - tally := tally + 1 ] ]! Item was changed: ----- Method: WeakKeyDictionary>>finalizeValues: (in category 'finalization') ----- finalizeValues: finiObjects "Remove all associations with key == nil and value is in finiObjects. This method is folded with #rehash for efficiency." | oldArray | oldArray := array. array := Array new: oldArray size. tally := 0. + 1 to: array size do: [ :index | + (oldArray at: index) ifNotNil: [ :association | + association key ifNotNil: [ :key | "Don't let the key go away" + (finiObjects includes: association value) ifFalse: [ + array + at: (self scanForEmptySlotFor: key) + put: association. + tally := tally + 1 ] ] ] ]! - 1 to: array size do:[ :i | - | association | - (association := oldArray at: i) ifNotNil: [ - | key | - ((key := association key) == nil and: [ "Don't let the key go away" - finiObjects includes: association value ]) - ifFalse: [ - array - at: (self scanForEmptySlotFor: key) - put: association. - tally := tally + 1 ] ] ]! Item was changed: ----- Method: WeakSet>>grow (in category 'private') ----- grow "Grow the elements array if needed. Since WeakSets just nil their slots, a lot of the occupied (in the eyes of the set) slots are usually empty. Doubling size if unneeded can lead to BAD performance, therefore we see if reassigning the <live> elements to a Set of similiar size leads to a sufficiently (50% used here) empty set first" + tally // 2 < self slowSize + ifTrue: [ super grow ] + ifFalse: [ self rehash ] + ! - | oldTally | - oldTally := tally. - self rehash. - oldTally // 2 < tally ifTrue: [ super grow ]! Item was changed: ----- Method: WeakSet>>growTo: (in category 'private') ----- growTo: anInteger "Grow the elements array and reinsert the old elements" | oldElements | oldElements := array. + array := WeakArray new: anInteger withAll: flag. - array := WeakArray new: anInteger. - array atAllPut: flag. self noCheckNoGrowFillFrom: oldElements! Item was changed: ----- Method: HashedCollection>>atRandom: (in category 'accessing') ----- atRandom: aGenerator "Answer a random element of the receiver. Uses aGenerator which + should be kept by the user in a variable and used every time. Use + this instead of #atRandom for better uniformity of random numbers because - should be kept by the user in a variable and used every time. Use - this instead of #atRandom for better uniformity of random numbers because only you use the generator. Causes an error if self has no elements." + | rand | - self emptyCheck. rand := aGenerator nextInt: self size. + self doWithIndex: [ :each :index | + index = rand ifTrue: [ ^each ] ]! - self doWithIndex:[:each :ind | - ind = rand ifTrue:[^each]]. - ^ self errorEmptyCollection - ! Item was changed: ----- Method: KeyedSet>>member: (in category 'adding') ----- member: newObject "Include newObject as one of the receiver's elements, if already exists just return it" | index | newObject ifNil: [self error: 'Sets cannot meaningfully contain nil as an element']. index := self scanFor: (keyBlock value: newObject). + (array at: index) ifNotNil: [ :element | ^element ]. - (array at: index) ifNotNil: [^ array at: index]. self atNewIndex: index put: newObject. ^ newObject! Item was changed: + ----- Method: WeakSet>>add: (in category 'adding') ----- - ----- Method: WeakSet>>add: (in category 'public') ----- add: newObject "Include newObject as one of the receiver's elements, but only if not already present. Answer newObject" | index element | newObject ifNil: [self error: 'Sets cannot meaningfully contain nil as an element']. index := self scanFor: newObject. ((element := array at: index) == flag or: [ element == nil ]) ifTrue: [self atNewIndex: index put: newObject]. ^newObject! Item was changed: ----- Method: KeyedSet>>at:ifAbsent: (in category 'accessing') ----- at: key ifAbsent: aBlock "Answer the value associated with the key or, if key isn't found, answer the result of evaluating aBlock." + ^(array at: (self scanFor: key)) ifNil: [ aBlock value ]! - | obj | - obj := array at: (self scanFor: key). - obj ifNil: [^ aBlock value]. - ^ obj! Item was changed: + ----- Method: WeakSet>>includes: (in category 'testing') ----- - ----- Method: WeakSet>>includes: (in category 'public') ----- includes: anObject + ^(array at: (self scanFor: anObject)) + ifNil: [ false ] + ifNotNil: [ :object | object ~~ flag ]! - | element | - ^((element := array at: (self scanFor: anObject)) == flag or: [ element == nil ]) not! Item was changed: ----- Method: Dictionary>>noCheckNoGrowFillFrom: (in category 'private') ----- noCheckNoGrowFillFrom: anArray "Add the elements of anArray except nils to me assuming that I don't contain any of them, they are unique and I have more free space than they require." 1 to: anArray size do: [ :index | + (anArray at: index) ifNotNil: [ :association | - | object | - (object := anArray at: index) ifNotNil: [ array + at: (self scanForEmptySlotFor: association key) + put: association ] ]! - at: (self scanForEmptySlotFor: object key) - put: object ] ]! Item was changed: ----- Method: KeyedSet>>initialize: (in category 'private') ----- initialize: n + super initialize: n. + keyBlock := #key - keyBlock := [:element | element key]. ! Item was changed: ----- Method: WeakKeyDictionary>>keysDo: (in category 'accessing') ----- keysDo: aBlock "Evaluate aBlock for each of the receiver's keys." self associationsDo: [ :association | + (association key) ifNotNil: [ :key | "Don't let the key go away" - | key | - (key := association key) ifNotNil: [ "Don't let the key go away" aBlock value: key ] ].! Item was changed: ----- Method: Dictionary>>add: (in category 'adding') ----- add: anAssociation + | index | - | index element | index := self scanFor: anAssociation key. + (array at: index) - (element := array at: index) ifNil: [ self atNewIndex: index put: anAssociation ] + ifNotNil: [ :element | element value: anAssociation value ]. - ifNotNil: [ element value: anAssociation value ]. ^anAssociation! Item was changed: ----- Method: WeakSet>>do:after: (in category 'public') ----- do: aBlock after: anElement - | each startIndex | + | startIndex | + tally = 0 ifTrue: [ ^self ]. + startIndex := anElement + ifNil: [ 0 ] + ifNotNil: [ self scanFor: anElement ]. + startIndex + 1 to: array size do: [ :index | + (array at: index) ifNotNil: [ :object | + object == flag ifFalse: [ + aBlock value: object ] ] ]! - tally = 0 ifTrue: [^self]. - startIndex := anElement ifNil: [1] ifNotNil: - [self scanFor: anElement]. - startIndex + 1 to: array size do: - [:index | - ((each := array at: index) == nil or: [each == flag]) - ifFalse: [aBlock value: each] - ]! Item was changed: + ----- Method: WeakSet>>remove:ifAbsent: (in category 'removing') ----- - ----- Method: WeakSet>>remove:ifAbsent: (in category 'public') ----- remove: oldObject ifAbsent: aBlock | index | index := self scanFor: oldObject. (array at: index) == flag ifTrue: [ ^ aBlock value ]. array at: index put: flag. tally := tally - 1. self fixCollisionsFrom: index. ^oldObject! Item was changed: ----- Method: WeakKeyDictionary>>finalizeValues (in category 'finalization') ----- finalizeValues "remove all nil keys and rehash the receiver afterwards" - | assoc | - 1 to: array size do: [ :index | - (assoc := array at: index) ifNotNil: [ - assoc key ifNil: [ array at: index put: nil ] ] ]. self rehash! Item was changed: ----- Method: HashedCollection class>>goodPrimeAtLeast: (in category 'sizing') ----- goodPrimeAtLeast: lowerLimit "Answer the next good prime >= lowerlimit. If lowerLimit is larger than the largest known good prime, just make it odd." | primes low mid high prime | primes := self goodPrimes. low := 1. high := primes size. lowerLimit > (primes at: high) ifTrue: [ + ^lowerLimit bitOr: 1 ]. - ^lowerLimit even - ifTrue: [ lowerLimit + 1 ] - ifFalse: [ lowerLimit ] ]. [ high - low <= 1 ] whileFalse: [ mid := high + low // 2. prime := primes at: mid. prime = lowerLimit ifTrue: [ ^prime ]. prime < lowerLimit ifTrue: [ low := mid ] ifFalse: [ high := mid ] ]. (primes at: low) >= lowerLimit ifTrue: [ ^primes at: low ]. ^primes at: high! Item was changed: ----- Method: Dictionary>>at:put: (in category 'accessing') ----- at: key put: anObject "Set the value at key to be anObject. If key is not found, create a new entry for key and set is value to anObject. Answer anObject." + | index | - | index assoc | index := self scanFor: key. + (array at: index) + ifNil: [ self atNewIndex: index put: (Association key: key value: anObject) ] + ifNotNil: [ :association | association value: anObject ]. + ^anObject! - assoc := array at: index. - assoc - ifNil: [self atNewIndex: index put: (Association key: key value: anObject)] - ifNotNil: [assoc value: anObject]. - ^ anObject! Item was changed: ----- Method: KeyedSet>>keysSorted (in category 'accessing') ----- keysSorted + ^self keys sort! - | keys | - keys := SortedCollection new. - self do: [:item | keys add: (keyBlock value: item)]. - ^ keys! Item was changed: ----- Method: WeakSet>>slowSize (in category 'public') ----- slowSize "Careful!! Answer the maximum amount of elements in the receiver, not the exact amount" + | count | + count := 0. + 1 to: array size do: [ :index | + (array at: index) ifNotNil: [ :object | + object == flag ifFalse: [ + count := count + 1 ] ] ]. + ^tally := count! - tally := array inject: 0 into: - [:total :each | (each == nil or: [each == flag]) - ifTrue: [total] ifFalse: [total + 1]]. - ^tally! Item was changed: ----- Method: WeakKeyDictionary>>noCheckNoGrowFillFrom: (in category 'private') ----- noCheckNoGrowFillFrom: anArray "Add the elements of anArray except nils and flag to me assuming that I don't contain any of them, they are unique and I have more free space than they require." tally := 0. + 1 to: anArray size do:[ :index | + (anArray at: index) ifNotNil: [ :association | + association key ifNotNil: [ :key | "Don't let the key go away" + array + at: (self scanForEmptySlotFor: key) + put: association. + tally := tally + 1 ] ] ]! - 1 to: anArray size do:[ :i | - | association | - (association := anArray at: i) ifNotNil: [ - array - at: (self scanForEmptySlotFor: association key) - put: association. - tally := tally + 1 ] ]! Item was changed: ----- Method: WeakKeyToCollectionDictionary>>noCheckNoGrowFillFrom: (in category 'as yet unclassified') ----- noCheckNoGrowFillFrom: anArray "Add the elements of anArray except nils and associations with empty collections (or with only nils) to me assuming that I don't contain any of them, they are unique and I have more free space than they require." tally := 0. + 1 to: anArray size do: [ :index | + (anArray at: index) ifNotNil: [ :association | + association key ifNotNil: [ :key | "Don't let the key go away" + | cleanedValue | + (cleanedValue := association value copyWithout: nil) isEmpty + ifFalse: [ + association value: cleanedValue. + array + at: (self scanForEmptySlotFor: key) + put: association. + tally := tally + 1 ] ] ] ]! - 1 to: anArray size do:[ :i | - | association cleanedValue | - ((association := anArray at: i) == nil or: [ - (cleanedValue := association value copyWithout: nil) isEmpty ]) - ifFalse: [ - association value: cleanedValue. - array - at: (self scanForEmptySlotFor: association key) - put: association. - tally := tally + 1 ] ]! Item was changed: ----- Method: HashedCollection class>>rehashAll (in category 'initialization') ----- rehashAll "HashedCollection rehashAll" + self allSubclassesDo: #rehashAllInstances! - self allSubclassesDo: [ :each | each rehashAllInstances ]! Item was changed: ----- Method: HashedCollection>>fullCheck (in category 'compatibility') ----- fullCheck "This is a private method, formerly implemented in Set, that is no longer required. It is here for compatibility with external packages only." + "Keep array at least 1/4 free for decent hash behavior" + + array size * 3 < (tally * 4) ifTrue: [ self grow ]! - ^ self - ! Item was changed: ----- Method: KeyedSet>>noCheckNoGrowFillFrom: (in category 'private') ----- noCheckNoGrowFillFrom: anArray "Add the elements of anArray except nils to me assuming that I don't contain any of them, they are unique and I have more free space than they require." 1 to: anArray size do: [ :index | + (anArray at: index) ifNotNil: [ :object | - | object | - (object := anArray at: index) ifNotNil: [ array at: (self scanForEmptySlotFor: (keyBlock value: object)) put: object ] ]! Item was changed: ----- Method: Dictionary>>associationsSelect: (in category 'enumerating') ----- associationsSelect: aBlock "Evaluate aBlock with each of my associations as the argument. Collect into a new dictionary, only those associations for which aBlock evaluates to true." | newCollection | + newCollection := self copyEmpty. + self associationsDo: [ :each | + (aBlock value: each) ifTrue: [ newCollection add: each ] ]. - newCollection := self species new. - self associationsDo: - [:each | - (aBlock value: each) ifTrue: [newCollection add: each]]. ^newCollection! Item was changed: ----- Method: Dictionary>>associationsDo: (in category 'enumerating') ----- associationsDo: aBlock "Evaluate aBlock for each of the receiver's elements (key/value associations)." tally = 0 ifTrue: [ ^self]. 1 to: array size do: [ :index | + (array at: index) ifNotNil: [ :element | + aBlock value: element ] ]! - | each | - (each := array at: index) - ifNotNil: [ aBlock value: each ] ]! Item was changed: ----- Method: Set>>do: (in category 'enumerating') ----- do: aBlock tally = 0 ifTrue: [ ^self ]. 1 to: array size do: [ :index | + (array at: index) ifNotNil: [ :element | + aBlock value: element ] ]! - | each | - (each := array at: index) - ifNotNil: [ aBlock value: each ] ]! Item was changed: + ----- Method: Dictionary>>keyForIdentity: (in category 'accessing') ----- - ----- Method: Dictionary>>keyForIdentity: (in category 'testing') ----- keyForIdentity: anObject "If anObject is one of the values of the receive, return its key, else return nil. Contrast #keyAtValue: in which there is only an equality check, here there is an identity check" + self deprecated: 'Use #keyAtIdentityValue:ifAbsent:'. + ^self keyAtIdentityValue: anObject ifAbsent: nil! - self associationsDo: [:assoc | assoc value == anObject ifTrue: [^ assoc key]]. - ^ nil! Item was changed: + ----- Method: WeakSet>>do: (in category 'enumerating') ----- - ----- Method: WeakSet>>do: (in category 'public') ----- do: aBlock tally = 0 ifTrue: [ ^self ]. 1 to: array size do: [ :index | + (array at: index) ifNotNil: [ :object | + object == flag ifFalse: [ + aBlock value: object ] ] ]! - | each | - ((each := array at: index) == nil or: [ each == flag ]) - ifFalse: [ aBlock value: each ] ]! Item was changed: + ----- Method: WeakSet>>like: (in category 'accessing') ----- - ----- Method: WeakSet>>like: (in category 'public') ----- like: anObject "Answer an object in the receiver that is equal to anObject, nil if no such object is found. Relies heavily on hash properties" | element | ^(element := array at: (self scanFor: anObject)) == flag ifFalse: [ element ]! Item was changed: ----- Method: WeakKeyDictionary>>at:put: (in category 'accessing') ----- at: key put: anObject "Set the value at key to be anObject. If key is not found, create a new entry for key and set is value to anObject. Answer anObject." + | index | - | index element | key ifNil: [ ^anObject ]. index := self scanFor: key. + (array at: index) - (element := array at: index) ifNil: [ self atNewIndex: index put: (WeakKeyAssociation key: key value: anObject) ] + ifNotNil: [ :association | association value: anObject ]. - ifNotNil: [ element value: anObject ]. ^anObject! Item was changed: + ----- Method: WeakSet>>collect: (in category 'enumerating') ----- - ----- Method: WeakSet>>collect: (in category 'public') ----- collect: aBlock + + | newSet | - | each newSet | newSet := self species new: self size. + tally = 0 ifTrue: [ ^newSet ]. + 1 to: array size do: [ :index | + (array at: index) ifNotNil: [ :object | + object == flag ifFalse: [ + newSet add: (aBlock value: object) ] ] ]. - tally = 0 ifTrue: [^newSet ]. - 1 to: array size do: - [:index | - ((each := array at: index) == nil or: [each == flag]) - ifFalse: [newSet add: (aBlock value: each)] - ]. ^newSet! Item was changed: ----- Method: HashedCollection class>>rehashAllInstances (in category 'initialization') ----- rehashAllInstances "Do not use #allInstancesDo: because rehash may create new instances." + self allInstances do: #rehash! - self allInstances do: [ :each | each rehash ] ! Item was changed: + ----- Method: WeakSet>>size (in category 'accessing') ----- - ----- Method: WeakSet>>size (in category 'public') ----- size "Careful!! Answer the maximum amount of elements in the receiver, not the exact amount" ^tally! Item was added: + ----- Method: PluggableDictionary>>collect: (in category 'enumerating') ----- + collect: aBlock + "Evaluate aBlock with each of my values as the argument. Collect the resulting values into a collection that is like me. Answer with the new collection." + + | newCollection | + newCollection := (self species new: self size) + hashBlock: hashBlock; + equalBlock: equalBlock; + yourself. + self associationsDo: [ :each | + newCollection at: each key put: (aBlock value: each value) ]. + ^newCollection + + ! Item was removed: - ----- Method: WeakKeyToCollectionDictionary>>finalizeValues (in category 'as yet unclassified') ----- - finalizeValues - self rehash!

1 0

The Trunk: Kernel-ul.382.mcz
by commits＠source.squeak.org 25 Jan '10

25 Jan '10

Levente Uzonyi uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-ul.382.mcz ==================== Summary ==================== Name: Kernel-ul.382 Author: ul Time: 25 January 2010, 10:40:19.44 pm UUID: 0741847a-6bd5-c145-aa63-3c5e598d1742 Ancestors: Kernel-dtl.381 In MethodDictionary - cosmetic changes: use #ifNotNil: if possible - ensure that #rehashWithoutBecome doesn't send #become:, making #rehashAllInstances a lot faster - ensure that #removeAll preserves the capacity - deprecated #methodArray, it's the same as #array - new comment for #new =============== Diff against Kernel-dtl.381 =============== Item was changed: ----- Method: MethodDictionary>>postCopy (in category 'copying') ----- postCopy + array := array copy! - array := array shallowCopy! Item was changed: ----- Method: MethodDictionary>>rehashWithoutBecome (in category 'private') ----- rehashWithoutBecome + | newInstance | + newInstance := self species new: self basicSize - 1. "Make sure it has the same capacity" + 1 to: self basicSize do: [ :index | + (self basicAt: index) ifNotNil: [ :key | + newInstance at: key put: (array at: index) ] ]. + ^newInstance! - | newSelf | - newSelf := self species new: self size. - 1 to: self basicSize do: [ :i | - | key | - (key := self basicAt: i) ifNotNil: [ - newSelf at: key put: (array at: i) ] ]. - ^newSelf! Item was changed: ----- Method: MethodDictionary class>>new (in category 'instance creation') ----- new + "Create a new instance with 32 slots." - "change the default size to be a bit bigger to help reduce the number of #grows while filing in" ^self new: 16! Item was changed: ----- Method: MethodDictionary>>associationsDo: (in category 'enumeration') ----- associationsDo: aBlock tally = 0 ifTrue: [ ^self ]. 1 to: self basicSize do: [ :i | + (self basicAt: i) ifNotNil: [ :key | - | key | - (key := self basicAt: i) ifNotNil: [ aBlock value: (Association key: key value: (array at: i)) ] ]! Item was changed: ----- Method: MethodDictionary>>removeAll (in category 'removing') ----- removeAll "This provides a faster way than repeated become. a single become is still in use to prevent system crash." | newSelf | tally = 0 ifTrue: [^self]. + newSelf := self species new: self basicSize - 1. "This will preserve the capacity" - newSelf := self species new: self size. "This will preserve the capacity" self become: newSelf! Item was changed: ----- Method: MethodDictionary>>keysDo: (in category 'enumeration') ----- keysDo: aBlock tally = 0 ifTrue: [ ^self ]. 1 to: self basicSize do: [ :i | + (self basicAt: i) ifNotNil: [ :key | - | key | - (key := self basicAt: i) ifNotNil: [ aBlock value: key ] ]! Item was changed: ----- Method: MethodDictionary>>keysAndValuesDo: (in category 'enumeration') ----- keysAndValuesDo: aBlock "Enumerate the receiver with all the keys and values passed to the block" tally = 0 ifTrue: [^ self]. 1 to: self basicSize do: [ :i | + (self basicAt: i) ifNotNil: [ :key | - | key | - (key := self basicAt: i) ifNotNil: [ aBlock value: key value: (array at: i) ] ]! Item was changed: ----- Method: MethodDictionary>>grow (in category 'private') ----- grow | newSelf | newSelf := self species new: self basicSize. "This will double the size" 1 to: self basicSize do: [ :i | + (self basicAt: i) ifNotNil: [ :key | - | key | - (key := self basicAt: i) ifNotNil: [ newSelf at: key put: (array at: i) ] ]. self become: newSelf! Item was changed: ----- Method: MethodDictionary>>methodArray (in category 'private') ----- methodArray + + self deprecated: 'Use #array'. - ^array! Item was changed: ----- Method: MethodDictionary>>valuesDo: (in category 'enumeration') ----- valuesDo: aBlock tally = 0 ifTrue: [ ^self ]. 1 to: self basicSize do: [ :i | + (array at: i) ifNotNil: [ :value | - | value | - (value := array at: i) ifNotNil: [ aBlock value: value ] ]!

1 0

The Trunk: Compiler-ul.116.mcz
by commits＠source.squeak.org 25 Jan '10

25 Jan '10

Levente Uzonyi uploaded a new version of Compiler to project The Trunk: http://source.squeak.org/trunk/Compiler-ul.116.mcz ==================== Summary ==================== Name: Compiler-ul.116 Author: ul Time: 25 January 2010, 10:40:59.752 pm UUID: 29cfe126-9fa7-0149-9c25-e068d536b0b9 Ancestors: Compiler-ar.115 - don't create a block in Dictionary >> #bindingOf: =============== Diff against Compiler-ar.115 =============== Item was changed: ----- Method: Dictionary>>bindingOf: (in category '*Compiler') ----- bindingOf: varName + + ^self associationAt: varName ifAbsent: nil! - ^self associationAt: varName ifAbsent:[nil]!

1 0

Mac VM 5.4b2 ships
by John M McIntosh 25 Jan '10

25 Jan '10

I've push the latest cocoa based 32/64bit macintel/powerpc Squeak VM 5.4b2 There seemed to be a drawing problem, which pointed to an issue with the definition of drawRect:, this should be fixed. Fixed the open file dialog so that it only lets you open *.image files, versus *.changes Fixed an issue with leaking NSCursors on cursor changes. I altered the behaviour of the resize window box, now when you click it changes the cursor back to an arrow. Look for the VM in the regular places found via http://smalltalkconsulting.com/squeak.html or ftp://ftp.smalltalkconsulting.com/ or http://homepage.mac.com/johnmci/FileSharing.html Squeak 64-32 5.4b2.app.zip This *beta* VM runs in 32 or 64 bit mode on macIntel, and 32bit mode on powerpc to support Squeak 32bit images. Includes the freetype plugin, and requires os-x 10.5 or higher. -- =========================================================================== John M. McIntosh <johnmci(a)smalltalkconsulting.com> Twitter: squeaker68882 Corporate Smalltalk Consulting Ltd. http://www.smalltalkconsulting.com ===========================================================================

1 0

Pier user data stored in filesystem was Re: [squeak-dev] Cuis
by David Corking 25 Jan '10

25 Jan '10

On Mon, Jan 25, 2010 at 4:25 PM, keith wrote (on the squeak-dev list) : > pier keeps its data in image. I know the following info is unlikely to help your current application, but, in the interest of completeness, I will observe that at least one Pier application stores its user data in the host filesystem, not the image. That application is WikiServer (John McIntosh's cross-platform personal wiki for the iPhone) I only have superficial familiarity with Pier and WikiServer: as far as I can tell, the persistency code uses MAExternalFileModel, but sadly I can't guess if the effect is available to all Pier developers, or proprietary to WikiServer.

2 1

Re: [squeak-dev] Integer>>isPrime why reverting Knuth's algorithm P (probabilistic primality test) with iteration over division with even numbers?
by David T. Lewis 25 Jan '10

25 Jan '10

To follow up on this discussion from last month, I updated Squeak trunk such that LargePositiveInteger uses the probabilistic algorithm for #isPrime, and added method comments to explain. A couple of folks suggested this change, and Enrico concurred. It turns out that SmallInteger maxVal is a reasonable point at which to switch from use of #isPrime to #isProbablyPrime. On my system before the change: count := 1000. largeMin := SmallInteger maxVal + 1. "SmallInteger values up to maxVal" Time millisecondsToRun: [(SmallInteger maxVal - count to: SmallInteger maxVal) do: [:e | e isPrime]]. ==> 120 Time millisecondsToRun: [(SmallInteger maxVal - count to: SmallInteger maxVal) do: [:e | e isProbablyPrime]]. ==> 984 "LargePositiveInteger values just above SmallInteger maxVal" Time millisecondsToRun: [(largeMin to: largeMin + count) do: [:e | e isPrime]]. ==> 6599 Time millisecondsToRun: [(largeMin to: largeMin + count) do: [:e | e isProbablyPrime]]. ==> 714 After changing LargePositiveInteger>>isPrime, we have: "LargePositiveInteger values just above SmallInteger maxVal" Time millisecondsToRun: [(largeMin to: largeMin + count) do: [:e | e isPrime]]. ==> 719 So the implementation of LargePositiveInteger>>isPrime is now this: isPrime "Answer true if the receiver is a prime number. Use a probabilistic implementation that is much faster for large integers, and that is correct to an extremely high statistical level of confidence (effectively deterministic)." ^ self isProbablyPrime Thanks to Enrico for his patience ;-) Dave On Sat Dec 19 13:58:16 UTC 2009, Enrico Spinielli wrote: > > The original implementation is was has been renamed by ul to isProbablyPrime > Note that the probability is according to Knuth's words > > ...less than (1/4)^25 that such a 25-time-in-a-row procedure gives the wrong > information about its input. This is less than one chance in a quadrillion; > [...] > It's much more likely that our computer has dropped a bit in its > calculations, > due to hardware malfunctions or cosmic radiation, than that Algorithm P has > repeatedly guessed wrong! > > So 'probabilistic' in this case is very much deterministic! > For accessible rationale about the algoritm (and a non probabilistic better > one as well) > you can also see "1.2.6 Example: Testing for > Primality<http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-11.html#%_sec_1.2.6>" > in SICP. > A possible improvement could have been to keep a list of the first N > prime numbers (i.e. N=1000 or whatever integrer where gain in performance > and or memory) and resort to the probabilistic test if self > is greater than the bigger in the list. > > The value of original algorithm is all research and reasoning that went into > it from > Knuth et al. (note the order of growth is log(n), where n is the integer > under scrutiny) > The problem with the new implementation is that it goes thru testing numbers > which are > clearly not prime, 5, 15, 25, 35...just to mention multiples of 5. > It can possibly be faster for small integers hence the above possible > improvement suggestion...but for the rest it should be thrown away IMHO. > > Primality testing is very important for modern electronic communications, > i.e. encryption > and as such it has to be reliable and performant for big integers. > > Hope this clarifies > Bye > Enrico > PS: the comment in the code was explicit enough to allow to research for > the rationale about the algorithm...we should not fix what works > (well) > there are so many other fixes waiting... > On Sat, Dec 19, 2009 at 12:56 AM, David T. Lewis <lewis at mail.msen.com>wrote: > > > On Fri, Dec 18, 2009 at 05:25:45PM +0100, Enrico Spinielli wrote: > > > Hi all, > > > I am back to checking Squeak after quite a while and got latest trunk. > > > I looked after one of my contributions Integer>>isPrime > > > and I found my implementation of Algorithm P from Knuth's AOCP vol 2 > > > substituted by an iteration of dividing self by all even numbers starting > > > from 3 > > > and (correctly) stopping at self sqrtFloor. > > > This is IMHO a questionable/useless "improvement", not even looking to > > try > > > to implement the Sieve of Eratostene...! > > > > > > Again IMHO isPrime should be reverted back to what has been renamed > > > isProbablyPrime > > > > > > Not being anymore used to contribute I just signal it here... > > > > > > Hope it helps > > > Bye > > > -- > > > Enrico Spinielli > > > > Enrico, > > > > Is this your original implementation? > > > > > > isPrime > > "See isProbablyPrimeWithK:andQ: for the algoritm description." > > | k q | > > self <= 1 ifTrue: [^self error: 'operation undefined']. > > self even ifTrue: [^self = 2]. > > k := 1. > > > > q := self - 1 bitShift: -1. > > [q odd] whileFalse: > > [q := q bitShift: -1. > > k := k + 1]. > > > > 25 timesRepeat: [(self isProbablyPrimeWithK: k andQ: q) ifFalse: > > [^false]]. > > ^true > > > > It was recently changed as follows: > > > > > Name: Kernel-ul.305 > > > Author: ul > > > Time: 25 November 2009, 2:55:43.339 am > > > UUID: a95be01c-d87c-154b-bdc6-c582dafad80b > > > Ancestors: Kernel-nice.304 > > > > > > - added Integer >> #sqrtFloor, which returns the floor of the square root > > of the receiver. > > > - renamed Integer >> #isPrime to #isProbablyPrime. > > > - added Integer >> #isPrime which is implemented as a deterministic > > primality test > > > - both #isPrime and #isProbablyPrime return false for receivers <= 1 > > instead of raising an error > > > > Is this a reasonable change? > > > > Dave > > > >

4 9

Re: The Trunk: System-dtl.240.mcz
by Andreas Raab 25 Jan '10

25 Jan '10

BTW, it's *great* to see this stuff happening. Every week we're getting closer to have a reloadable MVC version; we're getting *really* close now. A few more weeks and we got it! Cheers, - Andreas commits(a)source.squeak.org wrote: > David T. Lewis uploaded a new version of System to project The Trunk: > http://source.squeak.org/trunk/System-dtl.240.mcz > > ==================== Summary ==================== > > Name: System-dtl.240 > Author: dtl > Time: 24 January 2010, 9:51:51.331 pm > UUID: 07a9ac80-78d7-4169-b608-df3d25e0aa35 > Ancestors: System-dtl.239 > > Remove remaining dependencies on ST80-Editors from non-MVC packages. > > Remove explicit references to ST80 classes from ModalSystemWindow and various utility methods. > > > =============== Diff against System-dtl.239 ===============

2 1

← Newer
1
2
3
4
5
6
7
8
...
43
Older →

Jump to page: