Squeak-dev January 2012

squeak-dev@lists.squeakfoundation.org

65 participants
121 discussions

Start a nNew thread

Live Ruby on rails tutorial sites
by Lawson English 23 Jan '12

23 Jan '12

This is the kind of thing that seaside needs to have to attract more people. http://railsforzombies.org/ Lawson

1 0

The Trunk: Kernel-ul.666.mcz
by commits＠source.squeak.org 23 Jan '12

23 Jan '12

Levente Uzonyi uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-ul.666.mcz ==================== Summary ==================== Name: Kernel-ul.666 Author: ul Time: 23 January 2012, 3:19:39.301 am UUID: 7a3266d0-57d3-3149-992f-5d3a6959c043 Ancestors: Kernel-nice.665 - Fixed Integer >> #isPowerOfTwo which returned true for 0. Added optimized versions to Integer's subclasses. - Updated MethodDictionary class >> #sizeFor: to be error resistant if the semantics of #asLargerPowerOfTwo would change. =============== Diff against Kernel-nice.665 =============== Item was changed: ----- Method: Integer>>isPowerOfTwo (in category 'testing') ----- isPowerOfTwo "Return true if the receiver is an integral power of two." + + ^self strictlyPositive and: [ (self bitAnd: self - 1) = 0 ]! - ^ (self bitAnd: self-1) = 0! Item was added: + ----- Method: LargeNegativeInteger>>isPowerOfTwo (in category 'testing') ----- + isPowerOfTwo + "Return true if the receiver is an integral power of two. Optimized version." + + ^false! Item was added: + ----- Method: LargePositiveInteger>>isPowerOfTwo (in category 'testing') ----- + isPowerOfTwo + "Return true if the receiver is an integral power of two. Optimized version." + + | size | + 1 to: (size := self digitLength) do: [ :index | + | digit | + (digit := self digitAt: index) = 0 ifFalse: [ + ^size = index and: [ digit isPowerOfTwo ] ] ]. + ^false! Item was changed: ----- Method: MethodDictionary class>>sizeFor: (in category 'sizing') ----- sizeFor: numberOfElements "Return the minimum capacity of a dictionary that can hold numberOfElements elements. At least 25% of the array must be empty and the return value must be a power of 2." + ^(numberOfElements * 4 // 3 max: 1) asLargerPowerOfTwo! - ^(numberOfElements * 4 // 3) asLargerPowerOfTwo max: 1! Item was added: + ----- Method: SmallInteger>>isPowerOfTwo (in category 'testing') ----- + isPowerOfTwo + "Return true if the receiver is an integral power of two. Optimized version." + + ^self > 0 and: [ (self bitAnd: self - 1) = 0 ]!

1 0

The Trunk: KernelTests-ul.213.mcz
by commits＠source.squeak.org 23 Jan '12

23 Jan '12

Levente Uzonyi uploaded a new version of KernelTests to project The Trunk: http://source.squeak.org/trunk/KernelTests-ul.213.mcz ==================== Summary ==================== Name: KernelTests-ul.213 Author: ul Time: 23 January 2012, 3:22:22.122 am UUID: 15536b29-64a8-7343-8668-bce592e0c78b Ancestors: KernelTests-nice.212 - Fixed and enhanced IntegerTest >> #testIsPowerOfTwo. - Removed IntegerTest >> #testIsPowerOfTwoM6873, because #testIsPowerOfTwo now includes the same checks. =============== Diff against KernelTests-nice.212 =============== Item was changed: ----- Method: IntegerTest>>testIsPowerOfTwo (in category 'tests - basic') ----- testIsPowerOfTwo + | powersOfTwo nonPowersOfTwo | + powersOfTwo := (0 to: 100) collect: [ :each | + 2 raisedTo: each ]. + nonPowersOfTwo := (powersOfTwo collect: [ :each | each negated ]), + #(0 3 -3 5 -5 6 -6 7 -7 9 -9 10 -10 100 -100 1000 -1000 12345678 -12345678 1234567890 -1234567890 12345678901234567890 -12345678901234567890). + powersOfTwo do: [ :each | + self assert: each isPowerOfTwo ]. + nonPowersOfTwo do: [ :each | + self deny: each isPowerOfTwo ]! - self assert: (0 isPowerOfTwo). - self assert: (1 isPowerOfTwo). - self assert: (2 isPowerOfTwo). - self deny: (3 isPowerOfTwo). - self assert: (4 isPowerOfTwo). - ! Item was removed: - ----- Method: IntegerTest>>testIsPowerOfTwoM6873 (in category 'tests - basic') ----- - testIsPowerOfTwoM6873 - "This is a non regression test for http://bugs.squeak.org/view.php?id=6873" - - self deny: ((1 to: 80) anySatisfy: [:n | (2 raisedTo: n) negated isPowerOfTwo]) - description: 'A negative integer cannot be a power of two'.!

1 0

Daily Commit Log
by commits＠source.squeak.org 23 Jan '12

23 Jan '12

Changes to Trunk (http://source.squeak.org/trunk.html) in the last 24 hours: http://lists.squeakfoundation.org/pipermail/packages/2012-January/005165.ht… Name: Kernel-nice.644 Ancestors: Kernel-nice.642 Add Integer>>bitCount to count the bits set (to 1) in an Integer. ============================================= http://lists.squeakfoundation.org/pipermail/packages/2012-January/005166.ht… Name: Kernel-nice.665 Ancestors: Kernel-nice.664, Kernel-nice.644 merge Kernel-nice.644 Add Integer>>bitCount to count the bits set (to 1) in an Integer. ============================================= http://lists.squeakfoundation.org/pipermail/packages/2012-January/005167.ht… Name: KernelTests-nice.211 Ancestors: KernelTests-dtl.210 add a test for bitCount ============================================= http://lists.squeakfoundation.org/pipermail/packages/2012-January/005168.ht… Name: KernelTests-nice.212 Ancestors: KernelTests-nice.211 Add a few tests about fraction (denominator is allways positive and arithmetic results are automatically reduced) =============================================

1 0

Where would I report a bug in CrocquetGL?
by Hans-Martin Mosner 23 Jan '12

23 Jan '12

I found a minor bug in the Croquet OpenGL implementation (at http://www.squeaksource.com/CroquetGL). The method OpenGL>>#modelviewMatrix incorrectly uses GLModelview instead of GLModelviewMatrix, which results in incorrect behavior. Mantis does not have a category for this. Should I report it to Andreas directly? Cheers, Hans-Martin

3 2

space invaders in Smalltalk?
by Ralph Boland 22 Jan '12

22 Jan '12

I am looking at open source versions of space invaders games. I am contemplating making modifications to the game to make it more educational in a mathematical sort of way. I have found one version in Python but now I am wondering if there are any Smalltalk versions of space invaders or its variants. It would be more fun to do this in Smalltalk (preferably Squeak or Pharo) than in Python. Other interested parties welcome. Ralph Boland -- God flunked Intelligent Design

5 4

The Inbox: Kernel-nice.666.mcz
by commits＠source.squeak.org 22 Jan '12

22 Jan '12

A new version of Kernel was added to project The Inbox: http://source.squeak.org/inbox/Kernel-nice.666.mcz ==================== Summary ==================== Name: Kernel-nice.666 Author: nice Time: 22 January 2012, 7:21:56.763 pm UUID: 471545e4-437f-4366-bacb-3d86d68f0ba0 Ancestors: Kernel-nice.665, Kernel-nice.643 merge and correct Kernel-nice.643 (3/2)/(-3/4) was bogus Reminder: these changes should speed up mixed Integer-Fraction arithmetic (they avoid creating intermediate Fraction) =============== Diff against Kernel-nice.665 =============== Item was changed: ----- Method: Fraction>>- (in category 'arithmetic') ----- - aNumber "Answer the difference between the receiver and aNumber." + | n d d1 d2 | aNumber isFraction ifTrue: + [d := denominator gcd: aNumber denominator. + n := numerator * (d1 := aNumber denominator // d) - (aNumber numerator * (d2 := denominator // d)). + d1 := d1 * d2. + n := n // (d2 := n gcd: d). + (d := d1 * (d // d2)) = 1 ifTrue: [^ n]. + ^ Fraction numerator: n denominator: d]. - [^ self + aNumber negated]. ^ aNumber adaptToFraction: self andSend: #-! Item was changed: ----- Method: Fraction>>/ (in category 'arithmetic') ----- / aNumber "Answer the result of dividing the receiver by aNumber." + | d1 d2 | + aNumber isFraction ifTrue: + [d1 := numerator gcd: aNumber numerator. + d2 := denominator gcd: aNumber denominator. + (d2 = denominator and: [d1 = aNumber numerator abs]) + ifTrue: [^ numerator // d1 * (aNumber numerator copySignTo: aNumber denominator // d2)]. + ^ Fraction numerator: numerator // d1 * (aNumber denominator // d2) + denominator: denominator // d2 * (aNumber numerator // d1)]. - aNumber isFraction - ifTrue: [^self * aNumber reciprocal]. ^ aNumber adaptToFraction: self andSend: #/! Item was changed: ----- Method: Integer>>* (in category 'arithmetic') ----- * aNumber "Refer to the comment in Number * " aNumber isInteger ifTrue: [^ self digitMultiply: aNumber + neg: self negative == aNumber negative == false]. + aNumber isFraction + ifTrue: + [| n d | + n := self // (d := self gcd: aNumber denominator). + d := aNumber denominator // d. + ^d = 1 + ifTrue: [n * aNumber numerator] + ifFalse: [Fraction numerator: n * aNumber numerator denominator: d]]. - neg: self negative ~~ aNumber negative]. ^ aNumber adaptToInteger: self andSend: #*! Item was changed: ----- Method: Integer>>+ (in category 'arithmetic') ----- + aNumber "Refer to the comment in Number + " aNumber isInteger ifTrue: [self negative == aNumber negative ifTrue: [^ (self digitAdd: aNumber) normalize] ifFalse: [^ self digitSubtract: aNumber]]. + aNumber isFraction ifTrue: [^Fraction numerator: self * aNumber denominator + aNumber numerator denominator: aNumber denominator]. ^ aNumber adaptToInteger: self andSend: #+! Item was changed: ----- Method: Integer>>- (in category 'arithmetic') ----- - aNumber "Refer to the comment in Number - " aNumber isInteger ifTrue: [self negative == aNumber negative ifTrue: [^ self digitSubtract: aNumber] ifFalse: [^ (self digitAdd: aNumber) normalize]]. + aNumber isFraction ifTrue: [^Fraction numerator: self * aNumber denominator - aNumber numerator denominator: aNumber denominator]. ^ aNumber adaptToInteger: self andSend: #-! Item was changed: ----- Method: Integer>>/ (in category 'arithmetic') ----- / aNumber "Refer to the comment in Number / " | quoRem | aNumber isInteger ifTrue: [quoRem := self digitDiv: aNumber abs "*****I've added abs here*****" + neg: self negative == aNumber negative == false. - neg: self negative ~~ aNumber negative. (quoRem at: 2) = 0 ifTrue: [^ (quoRem at: 1) normalize] ifFalse: [^ (Fraction numerator: self denominator: aNumber) reduced]]. + aNumber isFraction + ifTrue: + [| n d | + n := self // (d := self gcd: aNumber numerator). + d := aNumber numerator // d. + ^d abs = 1 + ifTrue: [n * aNumber denominator * d] + ifFalse: [Fraction numerator: n * aNumber denominator denominator: d]]. ^ aNumber adaptToInteger: self andSend: #/!

1 0

The Trunk: KernelTests-nice.212.mcz
by commits＠source.squeak.org 22 Jan '12

22 Jan '12

Nicolas Cellier uploaded a new version of KernelTests to project The Trunk: http://source.squeak.org/trunk/KernelTests-nice.212.mcz ==================== Summary ==================== Name: KernelTests-nice.212 Author: nice Time: 22 January 2012, 7:16:17.891 pm UUID: aff99548-2cec-423c-8a00-861bc7073606 Ancestors: KernelTests-nice.211 Add a few tests about fraction (denominator is allways positive and arithmetic results are automatically reduced) =============== Diff against KernelTests-nice.211 =============== Item was added: + ----- Method: FractionTest>>testIntegerWholeDivision (in category 'tests - arithmetic') ----- + testIntegerWholeDivision + + self assert: 4 / (2/3) classAndValueEquals: 6. + + self assert: 4 / (-2/3) classAndValueEquals: -6. + + self assert: -4 / (-2/3) classAndValueEquals: 6. + + self assert: -4 / (2/3) classAndValueEquals: -6.! Item was added: + ----- Method: FractionTest>>testIntegerWholeMultiplication (in category 'tests - arithmetic') ----- + testIntegerWholeMultiplication + + self assert: 4 * (3/2) classAndValueEquals: 6. + + self assert: 4 * (-3/2) classAndValueEquals: -6. + + self assert: -4 * (-3/2) classAndValueEquals: 6. + + self assert: -4 * (3/2) classAndValueEquals: -6.! Item was changed: + ----- Method: FractionTest>>testReciprocal (in category 'tests - arithmetic') ----- - ----- Method: FractionTest>>testReciprocal (in category 'tests - sinuses') ----- testReciprocal self + assert: (1/2) reciprocal classAndValueEquals: 2; + assert: (3/4) reciprocal equals: (4/3); + assert: (-1/3) reciprocal classAndValueEquals: -3; + assert: (-3/5) reciprocal equals: (-5/3)! - assert: (1/2) reciprocal = 2; - assert: (3/4) reciprocal = (4/3); - assert: (-1/3) reciprocal = -3; - assert: (-3/5) reciprocal = (-5/3)! Item was added: + ----- Method: FractionTest>>testThatFractionDenominatorIsPositive (in category 'tests - invariants') ----- + testThatFractionDenominatorIsPositive + self assert: (-3 / 2) numerator negative description: 'a Fraction sign is allways carried by its numerator'. + self assert: (-3 / 2) denominator positive description: 'a Fraction denominator is allways positive'. + + self assert: (3 / -2) numerator negative description: 'a Fraction sign is allways carried by its numerator'. + self assert: (3 / -2) denominator positive description: 'a Fraction denominator is allways positive'. + + self assert: (-3 / -2) numerator positive description: 'two negative signs are simplified'. + self assert: (-3 / -2) denominator positive description: 'a Fraction denominator is allways positive'.! Item was added: + ----- Method: FractionTest>>testThatFractionIsReduced (in category 'tests - invariants') ----- + testThatFractionIsReduced + self assert: (4 / 6) numerator equals: 2. + self assert: (4 / 6) denominator equals: 3. + + self assert: (4 / 2) classAndValueEquals: 2. + + "Fraction class>>#numerator:denominator: does not automatically reduce the Fraction. + Since it does not guaranty above invariant, it must be used with care." + self assert: (Fraction numerator: 4 denominator: 6) numerator equals: 4. + self assert: (Fraction numerator: 4 denominator: 6) denominator equals: 6. + self assert: (Fraction numerator: 4 denominator: 6) reduced numerator equals: 2. + self assert: (Fraction numerator: 4 denominator: 6) reduced denominator equals: 3.! Item was added: + ----- Method: FractionTest>>testWholeDifference (in category 'tests - arithmetic') ----- + testWholeDifference + + self assert: (2/3) - (5/3) classAndValueEquals: -1.! Item was added: + ----- Method: FractionTest>>testWholeDivision (in category 'tests - arithmetic') ----- + testWholeDivision + + self assert: (3/2) / (3/4) classAndValueEquals: 2. + + self assert: (3/2) / (-3/4) classAndValueEquals: -2. + + self assert: (-3/2) / (-3/4) classAndValueEquals: 2. + + self assert: (-3/2) / (3/4) classAndValueEquals: -2.! Item was added: + ----- Method: FractionTest>>testWholeMultiplication (in category 'tests - arithmetic') ----- + testWholeMultiplication + + self assert: (3/2) * (4/3) classAndValueEquals: 2. + + self assert: (3/2) * (-4/3) classAndValueEquals: -2. + + self assert: (-3/2) * (-4/3) classAndValueEquals: 2. + + self assert: (-3/2) * (4/3) classAndValueEquals: -2.! Item was added: + ----- Method: FractionTest>>testWholeSum (in category 'tests - arithmetic') ----- + testWholeSum + + self assert: (5/3) + (1/3) classAndValueEquals: 2.!

1 0

The Trunk: KernelTests-nice.211.mcz
by commits＠source.squeak.org 22 Jan '12

22 Jan '12

Nicolas Cellier uploaded a new version of KernelTests to project The Trunk: http://source.squeak.org/trunk/KernelTests-nice.211.mcz ==================== Summary ==================== Name: KernelTests-nice.211 Author: nice Time: 22 January 2012, 6:23:15.639 pm UUID: 40d1bd19-43bc-4d6c-8a70-087bcb67059e Ancestors: KernelTests-dtl.210 add a test for bitCount =============== Diff against KernelTests-dtl.210 =============== Item was added: + ----- Method: IntegerTest>>testBitCount (in category 'tests - bitLogic') ----- + testBitCount + self assert: 2r0 bitCount equals: 0. + self assert: 2r1 bitCount equals: 1. + self assert: 2r101 bitCount equals: 2. + self assert: 2r1010000000000000000100000000000000000000000010000000000001001 bitCount equals: 6. + + 1 to: 100 do: [:i | + self assert: (2r1 << i) bitCount equals: 1. + self assert: (2r101 << i) bitCount equals: 2]. + + self should: [-2 bitCount] raise: Error description: 'Negative integers have an infinite number of leading 1 in two complement representation'.!

1 0

The Trunk: Kernel-nice.665.mcz
by commits＠source.squeak.org 22 Jan '12

22 Jan '12

Nicolas Cellier uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-nice.665.mcz ==================== Summary ==================== Name: Kernel-nice.665 Author: nice Time: 22 January 2012, 6:13:29.686 pm UUID: 3122f4bd-6c16-4919-9b90-47080e9365cb Ancestors: Kernel-nice.664, Kernel-nice.644 merge Kernel-nice.644 Add Integer>>bitCount to count the bits set (to 1) in an Integer. =============== Diff against Kernel-nice.664 =============== Item was added: + ----- Method: Integer>>bitCount (in category 'bit manipulation') ----- + bitCount + "Count the number of bits set to 1 in self" + + | bitCount | + self < 0 ifTrue: [self error: 'Cannot count bits of negative integers']. + bitCount := 0. + 1 to: self digitLength do: [:i | + bitCount := bitCount + (self digitAt: i) bitCountOfByte]. + ^bitCount! Item was added: + ----- Method: SmallInteger>>bitCountOfByte (in category 'bit manipulation') ----- + bitCountOfByte + "Count the number of bits set to 1 in a byte." + + ^#[0 1 1 2 1 2 2 3 1 2 2 3 2 3 3 4 1 2 2 3 2 3 3 4 2 3 3 4 3 4 4 5 1 2 2 3 2 3 3 4 2 3 3 4 3 4 4 5 2 3 3 4 3 4 4 5 3 4 4 5 4 5 5 6 1 2 2 3 2 3 3 4 2 3 3 4 3 4 4 5 2 3 3 4 3 4 4 5 3 4 4 5 4 5 5 6 2 3 3 4 3 4 4 5 3 4 4 5 4 5 5 6 3 4 4 5 4 5 5 6 4 5 5 6 5 6 6 7 1 2 2 3 2 3 3 4 2 3 3 4 3 4 4 5 2 3 3 4 3 4 4 5 3 4 4 5 4 5 5 6 2 3 3 4 3 4 4 5 3 4 4 5 4 5 5 6 3 4 4 5 4 5 5 6 4 5 5 6 5 6 6 7 2 3 3 4 3 4 4 5 3 4 4 5 4 5 5 6 3 4 4 5 4 5 5 6 4 5 5 6 5 6 6 7 3 4 4 5 4 5 5 6 4 5 5 6 5 6 6 7 4 5 5 6 5 6 6 7 5 6 6 7 6 7 7 8] at: self + 1 + + "Evaluate this expression to form above byte array: + ((0 to: 255) + collect: [:i | + | bitCount n | + n := i. + bitCount := 0. + [n = 0] + whileFalse: + [bitCount := bitCount + 1. + n := n bitAnd: n - 1]. + bitCount] + as: ByteArray)"!

1 0

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