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

[Pharo-project] Issue 3329 in pharo: Object>>closeTo:
by pharo＠googlecode.com April 7, 2011

April 7, 2011

Status: Accepted Owner: alexandre.bergel Labels: Milestone-1.3 New issue 3329 by alexandre.bergel: Object>>closeTo: http://code.google.com/p/pharo/issues/detail?id=3329 closeTo: is used to compare floats. closeTo: is defined on Object, which really does not make sense.

1 3

[Pharo-project] Issue 3435 in pharo: Don't draw transparent fillStules
by pharo＠googlecode.com April 7, 2011

April 7, 2011

Status: FixedWaitingToBePharoed Owner: stephane.ducasse Labels: Milestone-1.3 New issue 3435 by stephane.ducasse: Don't draw transparent fillStules http://code.google.com/p/pharo/issues/detail?id=3435 don't draw transparent fillStyles. Needed by Tweak. Imported from OpenCobalt =============== Diff against Morphic-ul.490 =============== Item was changed: ----- Method: Canvas>>fillRectangle:fillStyle:borderStyle: (in category 'drawing-rectangles') ----- fillRectangle: aRectangle fillStyle: aFillStyle borderStyle: aBorderStyle "Fill the given rectangle." + aFillStyle isTransparent ifFalse:[ + self fillRectangle: (aRectangle insetBy: aBorderStyle width) fillStyle: aFillStyle]. + aBorderStyle ifNil:[^self]. + aBorderStyle width <= 0 ifTrue:[^self]. + aBorderStyle frameRectangle: aRectangle on: self + ! - self fillRectangle: (aRectangle insetBy: aBorderStyle width) fillStyle: aFillStyle. - aBorderStyle frameRectangle: aRectangle on: self!

1 1

[Pharo-project] Issue 3392 in pharo: Class finder should probably use a different editor
by pharo＠googlecode.com April 7, 2011

April 7, 2011

Status: Accepted Owner: rydier Labels: Milestone-1.3 New issue 3392 by rydier: Class finder should probably use a different editor http://code.google.com/p/pharo/issues/detail?id=3392 The editor used is a TextEditor, yet the class finder should be smalltalk aware (to f.ex. be able to use OCompletion without having a model accessor) See discussion at http://forum.world.st/Issue-3385-in-pharo-TextEditor-doest-not-understand-m… and the related resolution for 1.2 at http://code.google.com/p/pharo/issues/detail?id=3385

1 1

Re: [Pharo-project] Issue 2755 in pharo: Image Save loses Form's color [black becomes transparent]
by pharo＠googlecode.com April 7, 2011

April 7, 2011

Updates: Labels: -Milestone-1.2 Milestone-1.3 Comment #12 on issue 2755 by stephane.ducasse: Image Save loses Form's color [black becomes transparent] http://code.google.com/p/pharo/issues/detail?id=2755 (No comment was entered for this change.)

1 1

Re: [Pharo-project] Issue 2454 in pharo: decompiler fix
by pharo＠googlecode.com April 7, 2011

April 7, 2011

Comment #3 on issue 2454 by marcus.denker: decompiler fix http://code.google.com/p/pharo/issues/detail?id=2454 Next action: - take the code here and make a .cs or Slice out of it

1 4

Re: [Pharo-project] Issue 1907 in pharo: Set with nil
by pharo＠googlecode.com April 7, 2011

April 7, 2011

Updates: Cc: -niko.schwarz -oscar.nierstrasz Labels: Milestone-1.3 Comment #21 on issue 1907 by stephane.ducasse: Set with nil http://code.google.com/p/pharo/issues/detail?id=1907 (No comment was entered for this change.)

1 2

[Pharo-project] Issue 3345 in pharo: findBinary: from Cuis as integrated in Squeak
by pharo＠googlecode.com April 5, 2011

April 5, 2011

Status: FixedWaitingToBePharoed Owner: stephane.ducasse Labels: Milestone-1.3 Difficulty-Easy New issue 3345 by stephane.ducasse: findBinary: from Cuis as integrated in Squeak http://code.google.com/p/pharo/issues/detail?id=3345 It would be nice to have a look at that and write some tests Levente Uzonyi uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-ul.408.mcz ==================== Summary ==================== Name: Collections-ul.408 Author: ul Time: 17 November 2010, 12:25:59.364 pm UUID: 1520a654-9c34-734d-ae16-a600d1a2b948 Ancestors: Collections-ul.407 - findBinary* enhancements from Cuis. =============== Diff against Collections-ul.407 =============== Item was changed: ----- Method: SequenceableCollection>>findBinary: (in category 'enumerating') ----- findBinary: aBlock "Search for an element in the receiver using binary search. The argument aBlock is a one-element block returning 0 - if the element is the one searched for <0 - if the search should continue in the first half >0 - if the search should continue in the second half If no matching element is found, raise an error. Examples: + #(1 3 5 7 11 15 23) findBinary: [ :arg | 11 - arg ] - #(1 3 5 7 11 15 23) findBinary:[:arg| 11 - arg] " + ^self findBinary: aBlock do: [ :found | found ] ifNone: [ self errorNotFound: aBlock ]! - ^self findBinary: aBlock ifNone: [self errorNotFound: aBlock]! Item was added: + ----- Method: SequenceableCollection>>findBinary:do:ifNone: (in category 'enumerating') ----- + findBinary: aBlock do: actionBlock ifNone: exceptionBlock + "Search for an element in the receiver using binary search. + The argument aBlock is a one-element block returning + 0 - if the element is the one searched for + <0 - if the search should continue in the first half + >0 - if the search should continue in the second half + If found, evaluate actionBlock with the found element as argument + If no matching element is found, evaluate exceptionBlock, + with the 'bounding' elements (or nil) as optional arguments. + Examples: + #(1 3 5 7 11 15 23) + findBinary: [ :arg | 11 - arg ] + do: [ :found | found ] + ifNone: [ :a :b | ('between: ', {a. b} printString) ] + #(1 3 5 7 11 15 23) + findBinary: [ :arg | 12 - arg ] + do: [ :found | found ] + ifNone: [ :a :b | ('between: ', {a. b} printString) ] + #(1 3 5 7 11 15 23) + findBinary: [ :arg | 0.5 - arg ] + do: [ :found | found ] + ifNone: [ :a :b | ('between: ', {a. b} printString) ] + #(1 3 5 7 11 15 23) + findBinary: [ :arg | 25 - arg ] + do: [ :found | found ] + ifNone: [ :a :b | ('between: ',{a. b} printString) ] + " + ^self + findBinaryIndex: aBlock + do: [ :foundIndex | actionBlock value: (self at: foundIndex) ] + ifNone: [ :prevIndex :nextIndex | + exceptionBlock + cull: (prevIndex > 0 ifTrue: [ self at: prevIndex ]) + cull: (nextIndex <= self size ifTrue: [ self at: nextIndex ]) ]! Item was changed: ----- Method: SequenceableCollection>>findBinary:ifNone: (in category 'enumerating') ----- findBinary: aBlock ifNone: exceptionBlock "Search for an element in the receiver using binary search. The argument aBlock is a one-element block returning 0 - if the element is the one searched for <0 - if the search should continue in the first half >0 - if the search should continue in the second half + If no matching element is found, evaluate exceptionBlock, + with the 'bounding' elements (or nil) as optional arguments." + + ^self findBinary: aBlock do: [ :found | found ] ifNone: exceptionBlock! - If no matching element is found, evaluate exceptionBlock." - | index low high test item | - low := 1. - high := self size. - [index := high + low // 2. - low > high] whileFalse:[ - test := aBlock value: (item := self at: index). - test = 0 - ifTrue:[^item] - ifFalse:[test > 0 - ifTrue: [low := index + 1] - ifFalse: [high := index - 1]]]. - ^exceptionBlock value! Item was changed: ----- Method: SequenceableCollection>>findBinaryIndex: (in category 'enumerating') ----- findBinaryIndex: aBlock "Search for an element in the receiver using binary search. The argument aBlock is a one-element block returning 0 - if the element is the one searched for <0 - if the search should continue in the first half >0 - if the search should continue in the second half If no matching element is found, raise an error. Examples: + #(1 3 5 7 11 15 23) findBinaryIndex: [ :arg | 11 - arg ] - #(1 3 5 7 11 15 23) findBinaryIndex:[:arg| 11 - arg] " + ^self findBinaryIndex: aBlock do: [ :found | found ] ifNone: [ self errorNotFound: aBlock]! - ^self findBinaryIndex: aBlock ifNone: [self errorNotFound: aBlock]! Item was added: + ----- Method: SequenceableCollection>>findBinaryIndex:do:ifNone: (in category 'enumerating') ----- + findBinaryIndex: aBlock do: actionBlock ifNone: exceptionBlock + "Search for an element in the receiver using binary search. + The argument aBlock is a one-element block returning + 0 - if the element is the one searched for + <0 - if the search should continue in the first half + >0 - if the search should continue in the second half + If found, evaluate actionBlock with the index as argument + If no matching element is found, evaluate exceptionBlock, + with the indexes of the 'bounding' elements as optional + arguments. Warning: Might give invalid indexes, see + examples below. + Examples: + #(1 3 5 7 11 15 23) + findBinaryIndex: [ :arg | 11 - arg ] + do: [ :found | found ] + ifNone: [ :a :b | ('between: ', {a. b} printString)] + #(1 3 5 7 11 15 23) + findBinaryIndex: [ :arg | 12 - arg ] + do: [ :found | found ] + ifNone: [ :a :b | ('between: ', {a. b} printString) ] + #(1 3 5 7 11 15 23) d + findBinaryIndex: [ :arg | 0.5 - arg ] + do: [ :found | found ] + ifNone: [ :a :b | ('between: ', {a. b} printString) ] + #(1 3 5 7 11 15 23) + findBinaryIndex: [ :arg | 25 - arg ] + do: [ :found | found ] + ifNone: [ :a :b | ('between: ',{a. b} printString) ] + " + | index low high | + low := 1. + high := self size. + [ + index := high + low // 2. + low > high ] whileFalse: [ + | test | + test := aBlock value: (self at: index). + test = 0 + ifTrue: [ ^actionBlock value: index ] + ifFalse: [ test > 0 + ifTrue: [ low := index + 1 ] + ifFalse: [ high := index - 1 ] ] ]. + ^exceptionBlock cull: high cull: low! Item was changed: ----- Method: SequenceableCollection>>findBinaryIndex:ifNone: (in category 'enumerating') ----- findBinaryIndex: aBlock ifNone: exceptionBlock "Search for an element in the receiver using binary search. The argument aBlock is a one-element block returning 0 - if the element is the one searched for <0 - if the search should continue in the first half >0 - if the search should continue in the second half + If no matching element is found, evaluate exceptionBlock, + with the indexes of the 'bounding' elements as optional + arguments. Warning: Might give invalid indexes." + + ^self findBinaryIndex: aBlock do: [ :found | found ] ifNone: exceptionBlock! - If no matching element is found, evaluate exceptionBlock." - | index low high test | - low := 1. - high := self size. - [index := high + low // 2. - low > high] whileFalse:[ - test := aBlock value: (self at: index). - test = 0 - ifTrue:[^index] - ifFalse:[test > 0 - ifTrue: [low := index + 1] - ifFalse: [high := index - 1]]]. - ^exceptionBlock value!

1 1

[Pharo-project] Issue 3429 in pharo: Better Number performance
by pharo＠googlecode.com March 29, 2011

March 29, 2011

Status: FixedWaitingToBePharoed Owner: stephane.ducasse Labels: Milestone-1.3 New issue 3429 by stephane.ducasse: Better Number performance http://code.google.com/p/pharo/issues/detail?id=3429 Name: Kernel-ul.522 Author: ul Time: 8 December 2010, 4:08:19.384 am UUID: 6927b03c-21df-1746-9a0d-115b717a5e40 Ancestors: Kernel-ul.521 - implemented Fraction >> #negative and ScaledDecimal >> #negative for better performance. These methods don't allocate new objects. - reimplemented SmallInteger printing methods (printOn:base:*) without String allocation. They are as fast as the previous versions were for base 10. - reimplemented ScaledDecimal printing. It avoids object allocations and has better performance than the previous version. ScaledDecimals can also be printed without the scale part by using #printFractionAsDecimalOn:. =============== Diff against Kernel-ul.521 =============== Item was added: + ----- Method: Fraction>>negative (in category 'testing') ----- + negative + + ^numerator negative! Item was added: + ----- Method: ScaledDecimal>>negative (in category 'testing') ----- + negative + + ^fraction negative! Item was added: + ----- Method: ScaledDecimal>>printFractionAsDecimalOn: (in category 'printing') ----- + printFractionAsDecimalOn: stream + + | aFraction integerPart fractionPart | + fraction negative + ifFalse: [ aFraction := fraction ] + ifTrue: [ + aFraction := fraction negated. + stream nextPut: $- ]. + integerPart := aFraction truncated. + integerPart printOn: stream. + scale = 0 ifTrue: [ ^self ]. + stream nextPut: $.. + fractionPart := ((aFraction - integerPart) * (10 raisedToInteger: scale)) truncated. + fractionPart + printOn: stream + base: 10 + length: scale + padded: true! Item was changed: ----- Method: ScaledDecimal>>printOn: (in category 'printing') ----- + printOn: stream + + self + printFractionAsDecimalOn: stream; + printScaleOn: stream! - printOn: aStream - "Reimplementation - Object 'printing' method." - | aFraction tmpFractionPart | - self < 0 ifTrue: [aStream nextPut: $-]. - aFraction := fraction abs. - aStream nextPutAll: aFraction truncated printString. - scale = 0 ifTrue: [^ aStream nextPutAll: 's0']. - aStream nextPut: $.. - tmpFractionPart := aFraction fractionPart. - 1 to: scale - do: - [:dummy | - tmpFractionPart := tmpFractionPart * 10. - aStream nextPut: (Character digitValue: tmpFractionPart truncated). - tmpFractionPart := tmpFractionPart fractionPart]. - aStream nextPut: $s. - scale printOn: aStream! Item was added: + ----- Method: ScaledDecimal>>printScaleOn: (in category 'printing') ----- + printScaleOn: stream + + stream nextPut: $s. + scale printOn: stream! Item was changed: ----- Method: SmallInteger>>printOn:base: (in category 'printing') ----- + printOn: stream base: base - printOn: aStream base: b "Append a representation of this number in base b on aStream." + self printOn: stream base: base length: 0 padded: false! - self < 0 - ifTrue: [aStream nextPut: $-. - aStream nextPutAll: (self negated printStringBase: b). - ^self]. - - "allocating a String seems faster than streaming for SmallInteger" - aStream nextPutAll: (self printStringBase: b)! Item was added: + ----- Method: SmallInteger>>printOn:base:length:padded: (in category 'printing') ----- + printOn: stream base: base length: minimumLength padded: padWithZeroes + + | n numberOfDigits totalLength divisor | + self < 0 + ifTrue: [ + n := self negated. + totalLength := 1 ] + ifFalse: [ + n := self. + totalLength := 0 ]. + numberOfDigits := n numberOfDigitsInBase: base. + totalLength := totalLength + numberOfDigits. + padWithZeroes ifFalse: [ + [ totalLength < minimumLength ] whileTrue: [ + stream space. + totalLength := totalLength + 1 ] ]. + n = self ifFalse: [ stream nextPut: $- ]. + padWithZeroes ifTrue: [ + [ totalLength < minimumLength ] whileTrue: [ + stream nextPut: $0. + totalLength := totalLength + 1 ] ]. + divisor := (base raisedToInteger: numberOfDigits - 1). + [ divisor > 0 ] whileTrue: [ + | digit | + digit := n // divisor. + stream nextPut: ('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ' at: digit + 1). + n := n - (digit * divisor). + divisor := divisor // base ]! Item was changed: ----- Method: SmallInteger>>printOn:base:nDigits: (in category 'printing') ----- printOn: aStream base: b nDigits: n "Append a representation of this number in base b on aStream using nDigits. self must be positive." + self printOn: aStream base: b length: n padded: true! - "allocating a String seems faster than streaming for SmallInteger" - aStream nextPutAll: (self printStringBase: b nDigits: n)!

3 6

[Pharo-project] ProgressDisplay package released
by Ralph Boland March 29, 2011

March 29, 2011

I recently released the first draft of my package ProgressDisplay to SqueakSource. It is like SystemProgressMorph et. al. but with a lot of bells and whistles added. It is not a suitable replacement for SystemProgressMorph though because it is too large and specific for that. SystemProgressMorph could be made a subclass of one of its classes though. It is designed largely to meet my specific needs but since it's MIT anyone may use it, steal components, or move components of it to Squeak/Pharo. It has a utility class category with useful classes for things like array permutation generation and array multiset permutation generation, numeric partitioning of a number, and a class RangeList (which I will be expanding upon later). All of these classes will be removed when the package meant to contain them is ready (not soon). There are also a number of utility methods that could be stolen or put into Squeak/Pharo proper. It probably has lots of bugs, so bug reports appreciated. Comments on its function, design, and implementation most welcome. Proposals for improvements or extensions will be considered but no promises. If you need access to make changes let me know. If Levente Uzonyi likes it but feels compelled to rewrite it completely from scratch, thats okay too. :-) ONE OF MY REASONS FOR RELEASING IT IS BECAUSE OF A BUG I COULD NOT FIX. It is supposed to be possible to turn on the ability to catch user interrupts but when this feature is turned on and an interrupt generated while the progress bar is displayed the interrupt is caught but not processed until the progress bar closes. :-( Of course the interrupt was meant to be processed immediately. If anyone can tell me how to fix this bug (or better still send me the code or add the code to the package) that would be great! Regards, Ralph Boland -- Quantum Theory cannot save us from the tyranny of a deterministic universe but it does give God something to do

6 5

Re: [Pharo-project] Issue 453 in pharo: we need a way to fold a package into the system
by pharo＠googlecode.com March 27, 2011

March 27, 2011

Comment #4 on issue 453 by marianopeck: we need a way to fold a package into the system http://code.google.com/p/pharo/issues/detail?id=453 Actually, if you take a pharo dev 1.2, there are still 20 references to Preferences :(

1 5