Packages February 2013

packages@lists.squeakfoundation.org

1 participants
180 discussions

The Trunk: CollectionsTests-nice.198.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

Nicolas Cellier uploaded a new version of CollectionsTests to project The Trunk: http://source.squeak.org/trunk/CollectionsTests-nice.198.mcz ==================== Summary ==================== Name: CollectionsTests-nice.198 Author: nice Time: 24 February 2013, 6:12:35.434 pm UUID: a4c370ec-5ddf-469a-aae4-1eb8c6d4fc02 Ancestors: CollectionsTests-fbs.197 Diminish excessive usage of ReadWriteStream =============== Diff against CollectionsTests-fbs.197 =============== Item was changed: ----- Method: CollectionTest>>testAsStringOnDelimiter (in category 'testing') ----- testAsStringOnDelimiter | delim | delim := ', '. {OrderedCollection new. Set new.} do: [ :coll | | oneItemStream emptyStream multiItemStream | + emptyStream := String new writeStream. - emptyStream := ReadWriteStream on: ''. coll asStringOn: emptyStream delimiter: delim. self assert: emptyStream contents = ''. coll add: 1. + oneItemStream := String new writeStream. - oneItemStream := ReadWriteStream on: ''. coll asStringOn: oneItemStream delimiter: delim. self assert: oneItemStream contents = '1'. coll add: 2; add: 3. + multiItemStream := String new writeStream. - multiItemStream := ReadWriteStream on: ''. coll asStringOn: multiItemStream delimiter: ', '. self assert: multiItemStream contents = '1, 2, 3'.]! Item was changed: ----- Method: CollectionTest>>testAsStringOnDelimiterLast (in category 'testing') ----- testAsStringOnDelimiterLast | delim last | delim := ', '. last := ' & '. {OrderedCollection new. Set new.} do: [ :coll | | multiItemStream emptyStream oneItemStream | + emptyStream := String new writeStream. - emptyStream := ReadWriteStream on: ''. coll asStringOn: emptyStream delimiter: delim last: last. self assert: emptyStream contents = ''. coll add: 1. + oneItemStream := String new writeStream. - oneItemStream := ReadWriteStream on: ''. coll asStringOn: oneItemStream delimiter: delim last: last. self assert: oneItemStream contents = '1'. coll add: 2; add: 3. + multiItemStream := String new writeStream. - multiItemStream := ReadWriteStream on: ''. coll asStringOn: multiItemStream delimiter: ', ' last: last. self assert: multiItemStream contents = '1, 2 & 3'.]! Item was changed: ----- Method: CollectionTest>>testPrintOnDelimiter (in category 'testing') ----- testPrintOnDelimiter | delim | delim := ', '. {OrderedCollection new. Set new.} do: [ :coll | | emptyStream oneItemStream multiItemStream | + emptyStream := String new writeStream. - emptyStream := ReadWriteStream on: ''. coll printOn: emptyStream delimiter: delim. self assert: emptyStream contents = ''. coll add: 1. + oneItemStream := String new writeStream. - oneItemStream := ReadWriteStream on: ''. coll printOn: oneItemStream delimiter: delim. self assert: oneItemStream contents = '1'. coll add: 2; add: 3. + multiItemStream := String new writeStream. - multiItemStream := ReadWriteStream on: ''. coll printOn: multiItemStream delimiter: ', '. self assert: multiItemStream contents = '1'', ''2'', ''3'.]! Item was changed: ----- Method: CollectionTest>>testPrintOnDelimiterLast (in category 'testing') ----- testPrintOnDelimiterLast | delim last | delim := ', '. last := ' & '. {OrderedCollection new. Set new.} do: [ :coll | | emptyStream oneItemStream multiItemStream | + emptyStream := String new writeStream. - emptyStream := ReadWriteStream on: ''. coll printOn: emptyStream delimiter: delim last: last. self assert: emptyStream contents = ''. coll add: 1. + oneItemStream := String new writeStream. - oneItemStream := ReadWriteStream on: ''. coll printOn: oneItemStream delimiter: delim last: last. self assert: oneItemStream contents = '1'. coll add: 2; add: 3. + multiItemStream := String new writeStream. - multiItemStream := ReadWriteStream on: ''. coll printOn: multiItemStream delimiter: ', ' last: last. self assert: multiItemStream contents = '1'', ''2'' & ''3'.]!

1 0

The Trunk: KernelTests-nice.245.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

Nicolas Cellier uploaded a new version of KernelTests to project The Trunk: http://source.squeak.org/trunk/KernelTests-nice.245.mcz ==================== Summary ==================== Name: KernelTests-nice.245 Author: nice Time: 24 February 2013, 5:34:23.518 pm UUID: 2a95d1b1-1e90-45e5-9b95-7f5e8a7cf92f Ancestors: KernelTests-nice.244 Reduce the number of hardcoded constants used by #raisedTo:modulo: tests too. =============== Diff against KernelTests-nice.244 =============== Item was changed: ----- Method: IntegerTest>>testMontgomeryMultiplication (in category 'testing - arithmetic') ----- testMontgomeryMultiplication | a m mInv | m := 15485863. + mInv := m montgomeryDigitBase - ((m bitAnd: m montgomeryDigitMax) reciprocalModulo: m montgomeryDigitBase). + a := (m montgomeryDigitBase raisedTo: m montgomeryNumberOfDigits) \\ m. - mInv := 256 - ((m bitAnd: 255) reciprocalModulo: 256). - a := (256 raisedTo: m digitLength) \\ m. #(483933 3871465 8951195) do: [:s | (s montgomeryTimes: a modulo: m mInvModB: mInv) ifNotNil: [:s1 | | s2 sa ssa | self assert: s = s1. sa := s montgomeryTimes: (a * a \\ m) modulo: m mInvModB: mInv. self assert: sa = (s * a \\ m). ssa := sa montgomeryTimes: sa modulo: m mInvModB: mInv. self assert: ssa = (s * s * a \\ m). s2 := ssa montgomeryTimes: 1 modulo: m mInvModB: mInv. self assert: s2 = (s * s \\ m)]].!

1 0

The Trunk: KernelTests-nice.245.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

1 0

The Trunk: KernelTests-nice.245.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

1 0

The Trunk: Kernel-nice.741.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

Nicolas Cellier uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-nice.741.mcz ==================== Summary ==================== Name: Kernel-nice.741 Author: nice Time: 24 February 2013, 5:32:56.978 pm UUID: 15a282b0-84ac-4723-b44c-7dd91e9aebf0 Ancestors: Kernel-eem.740 Reduce the number of hardcoded constants used by #raisedTo:modulo: This will enable smooth transition to next generation of LargeIntegersPlugin. =============== Diff against Kernel-eem.740 =============== Item was added: + ----- Method: Integer>>montgomeryDigitBase (in category 'private') ----- + montgomeryDigitBase + "Answer the base used by Montgomery algorithm." + ^1 << self montgomeryDigitLength! Item was added: + ----- Method: Integer>>montgomeryDigitLength (in category 'private') ----- + montgomeryDigitLength + "Answer the number of bits composing a digit in Montgomery algorithm. + Primitive use either 8 or 32 bits digits" + <primitive: 'primMontgomeryDigitLength' module:'LargeIntegers'> + ^8 "Legacy plugin which did not have this primitive did use 8 bits digits"! Item was added: + ----- Method: Integer>>montgomeryDigitMax (in category 'private') ----- + montgomeryDigitMax + "Answer the maximum value of a digit used in Montgomery algorithm." + + ^1 << self montgomeryDigitLength - 1! Item was added: + ----- Method: Integer>>montgomeryNumberOfDigits (in category 'private') ----- + montgomeryNumberOfDigits + "Answer the number of montgomery digits required to represent the receiver." + ^self digitLength * 8 + (self montgomeryDigitLength - 1) // self montgomeryDigitLength! Item was changed: ----- Method: Integer>>montgomeryRaisedTo:times:modulo:mInvModB: (in category 'private') ----- montgomeryRaisedTo: n times: y modulo: m mInvModB: mInv "Private - do a Montgomery exponentiation of self modulo m. The operation is equivalent to (self/y raisedTo: n)*y \\ m, + with y is (b raisedTo: m montgomeryNumberOfDigits), + with (m bitAnd: b-1) * mInv \\ b = (b-1) + with b = self montgomeryDigitBase (either 1<<8 or 1<<32)" - with y is (256 raisedTo: m digitLength), - with (m bitAnd: 255) * mInv \\ 256 = 255." | pow j k w index oddPowersOfSelf square | "Precompute powers of self for odd bit patterns xxxx1 up to length w + 1. The width w is chosen with respect to the total bit length of n, such that each bit pattern will on average be encoutered P times in the whole bit sequence of n. This costs (2 raisedTo: w) multiplications, but more will be saved later (see below)." k := n highBit. w := (k highBit - 1 >> 1 min: 16) max: 1. oddPowersOfSelf := Array new: 1 << w. oddPowersOfSelf at: 1 put: (pow := self). square := self montgomeryTimes: self modulo: m mInvModB: mInv. 2 to: oddPowersOfSelf size do: [:i | pow := oddPowersOfSelf at: i put: (pow montgomeryTimes: square modulo: m mInvModB: mInv)]. "Now exponentiate by searching precomputed bit patterns with a sliding window" pow := y. [k > 0] whileTrue: [pow := pow montgomeryTimes: pow modulo: m mInvModB: mInv. "Skip bits set to zero (the sliding window)" (n bitAt: k) = 0 ifFalse: ["Find longest odd bit pattern up to window length (w + 1)" j := k - w max: 1. [j < k and: [(n bitAt: j) = 0]] whileTrue: [j := j + 1]. "We found a bit pattern of length k-j+1; perform the square powers for each bit (same cost as bitwise algorithm); compute the index of this bit pattern in the precomputed powers." index := 0. [k > j] whileTrue: [pow := pow montgomeryTimes: pow modulo: m mInvModB: mInv. index := index << 1 + (n bitAt: k). k := k - 1]. "Perform a single multiplication for the whole bit pattern. This saves up to (k-j) multiplications versus a naive algorithm operating bit by bit" pow := pow montgomeryTimes: (oddPowersOfSelf at: index + 1) modulo: m mInvModB: mInv]. k := k - 1]. ^pow! Item was changed: ----- Method: Integer>>montgomeryTimes:modulo:mInvModB: (in category 'private') ----- montgomeryTimes: a modulo: m mInvModB: mInv "Answer the result of a Montgomery multiplication + self * a * (b raisedTo: m montgomeryNumberOfDigits) inv \\ m - self * a * (256 raisedTo: m digitLength) inv \\ m NOTE: it is assumed that: + self montgomeryNumberOfDigits <= m montgomeryNumberOfDigits + a montgomeryNumberOfDigits <= m montgomeryNumberOfDigits + mInv * m \\ b = (-1 \\ b) = (b-1) (this implies m odd) + where b = self montgomeryDigitBase - self digitLength <= m digitLength - a digitLength <= m digitLength - mInv * m \\ 256 = (-1 \\ 256) = 255 (this implies m odd) Answer nil in case of absent plugin or other failure." <primitive: 'primMontgomeryTimesModulo' module:'LargeIntegers'> ^nil! Item was changed: ----- Method: Integer>>raisedTo:modulo: (in category 'mathematical functions') ----- raisedTo: n modulo: m "Answer the modular exponential. Note: this implementation is optimized for case of large integers raised to large powers." | a s mInv | n = 0 ifTrue: [^1]. (self >= m or: [self < 0]) ifTrue: [^self \\ m raisedTo: n modulo: m]. n < 0 ifTrue: [^(self reciprocalModulo: m) raisedTo: n negated modulo: m]. (n < 4096 or: [m even]) ifTrue: ["Overhead of Montgomery method might cost more than naive divisions, use naive" ^self slidingLeftRightRaisedTo: n modulo: m]. + mInv := self montgomeryDigitBase - ((m bitAnd: self montgomeryDigitMax) reciprocalModulo: self montgomeryDigitBase). - mInv := 256 - ((m bitAnd: 255) reciprocalModulo: 256). + "Initialize the result to R=self montgomeryDigitModulo raisedTo: m montgomeryNumberOfDigits" + a := (1 bitShift: m montgomeryNumberOfDigits * m montgomeryDigitLength) \\ m. - "Initialize the result to R=256 raisedTo: m digitLength" - a := (1 bitShift: m digitLength*8) \\ m. "Montgomerize self (multiply by R)" (s := self montgomeryTimes: (a*a \\ m) modulo: m mInvModB: mInv) ifNil: ["No Montgomery primitive available ? fallback to naive divisions" ^self slidingLeftRightRaisedTo: n modulo: m]. "Exponentiate self*R" a := s montgomeryRaisedTo: n times: a modulo: m mInvModB: mInv. "Demontgomerize the result (divide by R)" ^a montgomeryTimes: 1 modulo: m mInvModB: mInv!

1 0

The Trunk: Kernel-nice.741.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

1 0

The Trunk: Kernel-nice.741.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

1 0

The Trunk: Kernel-eem.740.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

Eliot Miranda uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-eem.740.mcz ==================== Summary ==================== Name: Kernel-eem.740 Author: eem Time: 23 February 2013, 5:42:23.379 pm UUID: 9dce4ab5-fac8-4dc8-bbb7-9f9ca5b37fc6 Ancestors: Kernel-fbs.739 Move the code to set the owning method of an AdditionalMethodState to the setter away from clients. Add an anti-sharing check. =============== Diff against Kernel-fbs.739 =============== Item was added: + ----- Method: AdditionalMethodState>>method (in category 'accessing') ----- + method + ^method! Item was changed: ----- Method: CompiledMethod>>copyWithTrailerBytes: (in category 'copying') ----- copyWithTrailerBytes: trailer "Testing: (CompiledMethod compiledMethodAt: #copyWithTrailerBytes:) tempNamesPut: 'copy end ' " + | copy end start | - | copy end start penultimateLiteral | start := self initialPC. end := self endPC. copy := trailer createMethod: end - start + 1 class: self class header: self header. 1 to: self numLiterals do: [:i | copy literalAt: i put: (self literalAt: i)]. - (penultimateLiteral := self penultimateLiteral) isMethodProperties ifTrue: - [copy penultimateLiteral: (penultimateLiteral copy - setMethod: copy; - yourself)]. start to: end do: [:i | copy at: i put: (self at: i)]. + copy postCopy. ^copy! Item was changed: ----- Method: CompiledMethod>>penultimateLiteral: (in category 'private') ----- penultimateLiteral: anObject + "Set the penultimate literal of the receiver, which holds either the + receiver's selector or its properties (which will hold the selector). + If it is an AdditionalMethodState set the state's ownership to this + method" - "Answer the penultimate literal of the receiver, which holds either - the receiver's selector or its properties (which will hold the selector)." | pIndex | + (pIndex := self numLiterals - 1) <= 0 ifTrue: + [self error: 'insufficient literals']. + self literalAt: pIndex put: anObject. + anObject isMethodProperties ifTrue: + [(anObject method ~~ nil + and: [anObject method ~~ self + and: [anObject method penultimateLiteral == anObject]]) ifTrue: + [self error: 'a method''s AdditionalMethodState should not be shared']. + anObject setMethod: self. + anObject pragmas do: [:p| p setMethod: self]]! - (pIndex := self numLiterals - 1) > 0 - ifTrue: [self literalAt: pIndex put: anObject] - ifFalse: [self error: 'insufficient literals']! Item was changed: ----- Method: CompiledMethod>>postCopy (in category 'copying') ----- postCopy | penultimateLiteral | (penultimateLiteral := self penultimateLiteral) isMethodProperties ifTrue: + [self penultimateLiteral: penultimateLiteral copy]! - [self penultimateLiteral: (penultimateLiteral copy - setMethod: self; - yourself). - self pragmas do: - [:p| p setMethod: self]]! Item was changed: ----- Method: CompiledMethod>>propertyValueAt:put: (in category 'accessing-pragmas & properties') ----- propertyValueAt: propName put: propValue "Set or add the property with key propName and value propValue. If the receiver does not yet have a method properties create one and replace the selector with it. Otherwise, either relace propValue in the method properties or replace method properties with one containing the new property." | propertiesOrSelector | (propertiesOrSelector := self penultimateLiteral) isMethodProperties ifFalse: + [self penultimateLiteral: (self class methodPropertiesClass - [self penultimateLiteral: ((self class methodPropertiesClass selector: propertiesOrSelector with: (Association key: propName asSymbol + value: propValue)). - value: propValue)) - setMethod: self; - yourself). ^propValue]. (propertiesOrSelector includesProperty: propName) ifTrue: [^propertiesOrSelector at: propName put: propValue]. self penultimateLiteral: (propertiesOrSelector copyWith: (Association + key: propName asSymbol + value: propValue)). - key: propName asSymbol - value: propValue)). ^propValue!

1 0

The Trunk: Kernel-eem.740.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

1 0

The Trunk: Kernel-eem.740.mcz
by commits＠source.squeak.org 24 Feb '13

24 Feb '13

1 0

← Newer
1
2
3
4
5
6
7
8
9
...
18
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 February 2013