Packages November 2010

packages@lists.squeakfoundation.org

1 participants
285 discussions

The Trunk: Monticello-ul.407.mcz
by commits＠source.squeak.org 08 Nov '10

08 Nov '10

Levente Uzonyi uploaded a new version of Monticello to project The Trunk: http://source.squeak.org/trunk/Monticello-ul.407.mcz ==================== Summary ==================== Name: Monticello-ul.407 Author: ul Time: 7 November 2010, 10:48:58.903 pm UUID: 484d9469-2489-2445-bff4-610bfb986a00 Ancestors: Monticello-ul.406 - fix: If the #diffsWithPrettyPrint preference was enabled, then MCPatchBrowser couldn't diff scripts (postscript, preamble, etc.) =============== Diff against Monticello-ul.406 =============== Item was added: + ----- Method: MCDefinition>>actualClass (in category 'accessing') ----- + actualClass + + ^nil!

1 0

The Trunk: Monticello-ul.407.mcz
by commits＠source.squeak.org 08 Nov '10

08 Nov '10

1 0

The Trunk: CollectionsTests-ul.175.mcz
by commits＠source.squeak.org 07 Nov '10

07 Nov '10

Levente Uzonyi uploaded a new version of CollectionsTests to project The Trunk: http://source.squeak.org/trunk/CollectionsTests-ul.175.mcz ==================== Summary ==================== Name: CollectionsTests-ul.175 Author: ul Time: 7 November 2010, 3:17:19.921 am UUID: 4b82952d-1507-5249-ba8a-9f93a4aaa9f9 Ancestors: CollectionsTests-ul.174 - integrated tests for WeakSet from http://bugs.squeak.org/view.php?id=7350 =============== Diff against CollectionsTests-ul.174 =============== Item was added: + ----- Method: WeakSetTest>>testAddIncludesSizeReclaim (in category 'testing') ----- + testAddIncludesSizeReclaim + | ws o2 o3 | + o2 := 1/2. + o3 := '123' copy. + ws := WeakSet new. + ws add: o2. + ws add: o3. + self assert: ws size = 2. + self assert: (ws includes: o2). + self assert: (ws includes: o3). + + "inclusion test does use equality, not identity" + self assert: (ws includes: o3 copy) description: 'WeakSet are not WeakIdentitySet'. + + "only one copy is added" + ws add: o3 copy. + self assert: ws size = 2. + + "reclame objects so that slots of ws are nilled out" + o2 := o3 := nil. + Smalltalk garbageCollect. + self deny: (ws includes: 1/2). + self deny: (ws includes: '123' copy). + + "fast #size is not updated automatically by dead object reclamation + But there is a slowSize trying to tell the truth" + self assert: ws slowSize = 0.! Item was added: + ----- Method: WeakSetTest>>testCollisions (in category 'testing') ----- + testCollisions + + | ws o1 o2 o5 on remember forget | + + "create a weak set" + ws := WeakSet new: 15. + + "select some fractions wanting same place in ws array" + o1 := (2 to: 100) select: [:i | (ws scanFor: 1 / i) == 1]. + o2 := (2 to: 100) select: [:i | (ws scanFor: 1 / i) == 2]. + o5 := (2 to: 100) select: [:i | (ws scanFor: 1 / i) == 5]. + on := (2 to: 100) select: [:i | (ws scanFor: 1 / i) == (ws array size - 1)]. + + "Add some fractions to the weak set, and remember a pointer for a few of them" + remember := OrderedCollection new. + forget := OrderedCollection new. + ws add: (remember add: 1 / o1 first). + ws add: (forget add: 1 / on second). + ws add: (forget add: 1 / o1 second). + ws add: (forget add: 1 / o5 second). + ws add: (forget add: 1 / o2 second). + ws add: (forget add: 1 / o1 third). + ws add: (remember add: 1 / o2 first). + ws add: (forget add: 1 / o5 third). + ws add: (forget add: 1 / on third). + ws add: (remember add: 1 / o2 fourth). + ws add: (remember add: 1 / on first). + ws add: (remember add: 1 / o5 first). + + "forget and reclaim all entries but those in remember" + forget := nil. + Smalltalk garbageCollect. + + remember do: [:m | self assert: (ws includes: m)]. + ws add: 1/on second. + remember do: [:m | self assert: (ws includes: m)]. + + ws add: (remember add: 1 / o1 fourth). + ws add: (remember add: 1 / on fourth). + remember remove: (ws remove: (1 / o5 first)). + remember remove: (ws remove: (1 / on first)). + remember remove: (ws remove: (1 / o2 first)). + remember remove: (ws remove: (1 / o1 first)). + remember do: [:m | self assert: (ws includes: m)]. + ws add: 1/on second. + ws add: 1/o5 second. + remember do: [:m | self assert: (ws includes: m)]. + ! Item was added: + ----- Method: WeakSetTest>>testDoDontIterateOnReclaimedObjects (in category 'testing') ----- + testDoDontIterateOnReclaimedObjects + + | ws o1 o2 size | + ws := WeakSet new. + 2 to: 20 do: [:i | ws add: 1 / i]. + + o1 := 3.0. + o2 := 4.0. + ws add: o1; add: o2. + + "Reclaim memory" + Smalltalk garbageCollect. + + size := 0. + ws do: [:each | + size := size + 1. + self deny: each isNil]. + + self assert: size = 2! Item was added: + ----- Method: WeakSetTest>>testGrowWhenNecessary (in category 'testing') ----- + testGrowWhenNecessary + | ws objs initialSize | + objs := (2 to: 20) collect: [:i | 1 / i]. + ws := WeakSet new: 5. + initialSize := ws array size. + 1 to: objs size do: [:k | ws add: (objs at: k)]. + self assert: ws array size > initialSize + description: 'The WeakSet grown because not enough room were preallocated'.! Item was added: + ----- Method: WeakSetTest>>testIncludesNil (in category 'testing') ----- + testIncludesNil + + | ws | + ws := WeakSet new. + self deny: (ws includes: nil). + + "After reclamation, should not includes nil: nil counts for nothing" + ws add: 1/2. + ws add: 1/3. + Smalltalk garbageCollect. + self deny: (ws includes: nil).!

1 0

The Trunk: CollectionsTests-ul.175.mcz
by commits＠source.squeak.org 07 Nov '10

07 Nov '10

1 0

The Trunk: CollectionsTests-ul.175.mcz
by commits＠source.squeak.org 07 Nov '10

07 Nov '10

1 0

The Trunk: Collections-ul.403.mcz
by commits＠source.squeak.org 07 Nov '10

07 Nov '10

Levente Uzonyi uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-ul.403.mcz ==================== Summary ==================== Name: Collections-ul.403 Author: ul Time: 7 November 2010, 1:55:55.898 am UUID: 7f81b384-8004-cd44-81e0-9b294d999c8a Ancestors: Collections-ul.402 - merged Collection's #fold: and #reduce: (it's a bit faster than the original versions :)) - reimplemented Bag >> #sum to fix http://bugs.squeak.org/view.php?id=6560 =============== Diff against Collections-ul.402 =============== Item was changed: ----- Method: Bag>>sum (in category 'math functions') ----- sum "Faster than the superclass implementation when you hold many instances of the same value (which you probably do, otherwise you wouldn't be using a Bag)." + + | sum first | + first := true. + contents keysAndValuesDo: [ :value :count | + first + ifTrue: [ sum := value * count. first := false ] + ifFalse: [ sum := sum + (value * count) ] ]. + first ifTrue: [ self errorEmptyCollection ]. - | sum | - sum := 0. - contents keysAndValuesDo: [:value :count | sum := sum + (value * count)]. ^sum! Item was changed: ----- Method: Collection>>fold: (in category 'enumerating') ----- fold: binaryBlock "Evaluate the block with the first two elements of the receiver, then with the result of the first evaluation and the next element, and so on. Answer the result of the final evaluation. If the receiver is empty, raise an error. If the receiver has a single element, answer that element." "#('if' 'it' 'is' 'to' 'be' 'it' 'is' 'up' 'to' 'me') fold: [:a :b | a, ' ', b]" + ^self reduce: binaryBlock! - | firstValue nextValue | - firstValue := nextValue := Object new. "something that can't be in the receiver" - self do: - [:each | - nextValue := firstValue == nextValue - ifTrue: [each] - ifFalse: [binaryBlock value: nextValue value: each]]. - ^nextValue == firstValue - ifTrue: [self errorEmptyCollection] - ifFalse: [nextValue]! Item was changed: ----- Method: Collection>>reduce: (in category 'enumerating') ----- reduce: binaryBlock "Apply the argument, binaryBlock cumulatively to the elements of the receiver. For sequenceable collections the elements will be used in order, for unordered collections the order is unspecified." | first nextValue | - self emptyCheck. first := true. + self do: [ :each | + first + ifTrue: [ nextValue := each. first := false ] + ifFalse: [ nextValue := binaryBlock value: nextValue value: each ] ]. + first ifTrue: [ self errorEmptyCollection ]. - self do:[:each| - first ifTrue:[nextValue := each. first := false] - ifFalse:[nextValue := binaryBlock value: nextValue value: each]]. ^nextValue!

1 0

The Trunk: Collections-ul.403.mcz
by commits＠source.squeak.org 07 Nov '10

07 Nov '10

1 0

The Trunk: Collections-ul.403.mcz
by commits＠source.squeak.org 07 Nov '10

07 Nov '10

1 0

The Trunk: Kernel-ul.513.mcz
by commits＠source.squeak.org 07 Nov '10

07 Nov '10

Levente Uzonyi uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-ul.513.mcz ==================== Summary ==================== Name: Kernel-ul.513 Author: ul Time: 7 November 2010, 12:08:10.875 am UUID: 887f4907-c347-2e45-8d2e-dd7814ac4248 Ancestors: Kernel-ul.512 - DateAndTime startup enhancement from Cuis part 2 =============== Diff against Kernel-ul.512 =============== Item was changed: ----- Method: DateAndTime class>>initializeOffsets (in category 'initialize-release') ----- + initializeOffsets + | durationSinceEpoch secondsSinceMidnight nowSecs | + LastTick := 0. + nowSecs := self clock secondsWhenClockTicks. + LastMilliSeconds := self millisecondClockValue. + durationSinceEpoch := Duration + days: SqueakEpoch + hours: 0 + minutes: 0 + seconds: nowSecs. + DaysSinceEpoch := durationSinceEpoch days. + secondsSinceMidnight := (durationSinceEpoch - + (Duration + days: DaysSinceEpoch + hours: 0 + minutes: 0 + seconds: 0)) asSeconds. + MilliSecondOffset := secondsSinceMidnight * 1000 - LastMilliSeconds! - initializeOffsets - - | epochianSeconds secondsSinceMidnight nowSecs | - - LastTick := 0. - - nowSecs := self clock secondsWhenClockTicks. - LastMilliSeconds := self millisecondClockValue. - - epochianSeconds := Duration days: SqueakEpoch hours: 0 minutes: 0 seconds: nowSecs. - - DaysSinceEpoch := epochianSeconds days. - - secondsSinceMidnight := (epochianSeconds - (Duration days: DaysSinceEpoch hours: 0 minutes: 0 seconds: 0)) asSeconds. - - MilliSecondOffset := (secondsSinceMidnight * 1000 - LastMilliSeconds) - ! Item was changed: ----- Method: DateAndTime class>>milliSecondsSinceMidnight (in category 'squeak protocol') ----- milliSecondsSinceMidnight - | msm msClock | - - msClock := self millisecondClockValue. + "This is usually only during system startup..." + self waitForOffsets. - ( - msClock < LastMilliSeconds) - ifTrue:[ "rolled over" MilliSecondOffset := MilliSecondOffset + (SmallInteger maxVal // 2) + 1 ]. + msClock := self millisecondClockValue. + msClock < LastMilliSeconds ifTrue: [ "rolled over" + MilliSecondOffset := MilliSecondOffset + (SmallInteger maxVal // 2) + 1 ]. LastMilliSeconds := msClock. + [ + msm := msClock + MilliSecondOffset. + msm >= 86400000 ] whileTrue: [ + "next day" + LastTick := -1. + DaysSinceEpoch := DaysSinceEpoch + 1. + MilliSecondOffset := MilliSecondOffset - 86400000 ]. - - [ msm := msClock + MilliSecondOffset. - (msm >= 86400000) ] - whileTrue: [ "next day" - LastTick := -1. - DaysSinceEpoch := DaysSinceEpoch + 1. - MilliSecondOffset := MilliSecondOffset - 86400000 ]. - "day rolled over sanity check" + (LastTick = -1 and: [ + (Duration + days: SqueakEpoch + hours: 0 + minutes: 0 + seconds: self clock totalSeconds) days ~= DaysSinceEpoch ]) ifTrue: [ + self initializeOffsets. + ^ self milliSecondsSinceMidnight ]. + ^ msm.! - ((LastTick = -1) and: [ - (Duration days: SqueakEpoch hours: 0 minutes: 0 seconds: (self clock totalSeconds)) days ~= DaysSinceEpoch ]) - ifTrue: - [ self initializeOffsets. - ^ self milliSecondsSinceMidnight ]. - - ^msm - - - - ! Item was changed: ----- Method: DateAndTime class>>now (in category 'ansi protocol') ----- now | nanoTicks msm | nanoTicks := (msm := self milliSecondsSinceMidnight) * 1000000. (LastTick < nanoTicks) ifTrue: [ LastTick := nanoTicks. ^ self todayAtMilliSeconds: msm]. + LastTickSemaphore critical: [ - LastTickSemaphore critical: [ LastTick := LastTick + 1. ^ self todayAtNanoSeconds: LastTick] " [ 10000 timesRepeat: [ self now. ] ] timeToRun / 10000.0 . If calls to DateAndTime-c-#now are within a single millisecond the semaphore code to ensure that (self now <= self now) slows things down considerably by a factor of about 20. The actual speed of a single call to DateAndTime-now in milliseconds is demonstrated by the unguarded method below. [ 100000 timesRepeat: [ self todayAtMilliSeconds: (self milliSecondsSinceMidnight) ] ] timeToRun / 100000.0 . 0.00494 0.00481 0.00492 0.00495 "! Item was changed: ----- Method: DateAndTime class>>startUp: (in category 'initialize-release') ----- + startUp: resuming + resuming ifFalse: [ ^ self ]. + OffsetsAreValid := false. + [ + self initializeOffsets. + OffsetsAreValid := true + ] forkAt: Processor userInterruptPriority.! - startUp: resuming - - resuming ifFalse: [^ self]. - - [ self initializeOffsets ] fork. - - ! Item was changed: ----- Method: DateAndTime class>>todayAtMilliSeconds: (in category 'squeak protocol') ----- todayAtMilliSeconds: milliSecondsSinceMidnight + "This is usually only during system startup..." + self waitForOffsets. + ^ self basicNew setJdn: DaysSinceEpoch seconds: (milliSecondsSinceMidnight // 1000) nano: (milliSecondsSinceMidnight \\ 1000 * 1000000 ) offset: self localOffset " + [ 100000 timesRepeat: [ self fromMilliSeconds: self milliSecondsSinceMidnight. ] ] timeToRun. - [ 100000 timesRepeat: [ self fromMilliSeconds: self milliSecondsSinceMidnight. ] ] timeToRun. "! Item was changed: ----- Method: DateAndTime class>>todayAtNanoSeconds: (in category 'squeak protocol') ----- todayAtNanoSeconds: nanoSecondsSinceMidnight + "This is usually only during system startup..." + self waitForOffsets. + ^ self basicNew setJdn: DaysSinceEpoch seconds: (nanoSecondsSinceMidnight // 1000000000) nano: (nanoSecondsSinceMidnight \\ 1000000000 ) offset: self localOffset ! Item was added: + ----- Method: DateAndTime class>>waitForOffsets (in category 'initialize-release') ----- + waitForOffsets + OffsetsAreValid ifFalse: [ + [ + (Delay forSeconds: 1) wait. + OffsetsAreValid + ] whileFalse + ]!

1 0

The Trunk: Kernel-ul.513.mcz
by commits＠source.squeak.org 07 Nov '10

07 Nov '10

1 0

← Newer
1
...
20
21
22
23
24
25
26
...
29
Older →

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Packages November 2010