Squeak-dev October 2016

squeak-dev@lists.squeakfoundation.org

40 participants
114 discussions

The Trunk: KernelTests-nice.312.mcz
by commits＠source.squeak.org 20 Oct '16

20 Oct '16

Nicolas Cellier uploaded a new version of KernelTests to project The Trunk: http://source.squeak.org/trunk/KernelTests-nice.312.mcz ==================== Summary ==================== Name: KernelTests-nice.312 Author: nice Time: 20 September 2016, 11:02:44.892325 pm UUID: 20bb751e-7ac1-4e91-8437-9f2cdcb8df5c Ancestors: KernelTests-mt.311 ClassBuilder tests for half and double word variable subclasses =============== Diff against KernelTests-mt.311 =============== Item was added: + ----- Method: ClassBuilderTest>>makeDoubleWordVariableSubclassOf: (in category 'utilities') ----- + makeDoubleWordVariableSubclassOf: aClass + ^ aClass variableDoubleWordSubclass: self subClassName + instanceVariableNames: '' + classVariableNames: '' + poolDictionaries: '' + category: self categoryNameForTemporaryClasses! Item was added: + ----- Method: ClassBuilderTest>>makeHalfWordVariableSubclassOf: (in category 'utilities') ----- + makeHalfWordVariableSubclassOf: aClass + ^ aClass variableHalfWordSubclass: self subClassName + instanceVariableNames: '' + classVariableNames: '' + poolDictionaries: '' + category: self categoryNameForTemporaryClasses! Item was changed: ----- Method: ClassBuilderTest>>testByteVariableSubclass (in category 'testing - format') ----- testByteVariableSubclass "Ensure that the invariants for superclass/subclass format are preserved" baseClass := Object variableByteSubclass: self baseClassName instanceVariableNames: '' classVariableNames: '' poolDictionaries: '' category: self categoryNameForTemporaryClasses. [ subClass := self makeNormalSubclassOf: baseClass. self deny: (subClass isPointers). self assert: (subClass isVariable). self deny: (subClass isWeak). self assert: (subClass isBytes). + self deny: (subClass isWords). + self deny: (subClass isHalfWords). + self deny: (subClass isDoubleWords). subClass removeFromSystem. "pointer classes" self should:[self makeIVarsSubclassOf: baseClass] raise: Error. self should:[self makeVariableSubclassOf: baseClass] raise: Error. self should:[self makeWeakSubclassOf: baseClass] raise: Error. "bit classes" subClass := self makeByteVariableSubclassOf: baseClass. self deny: (subClass isPointers). self assert: (subClass isVariable). self deny: (subClass isWeak). self assert: (subClass isBytes). + self deny: (subClass isWords). + self deny: (subClass isHalfWords). + self deny: (subClass isDoubleWords). subClass removeFromSystem. self should:[self makeWordVariableSubclassOf: baseClass] raise: Error. + self should:[self makeHalfWordVariableSubclassOf: baseClass] raise: Error. + self should:[self makeDoubleWordVariableSubclassOf: baseClass] raise: Error. ] ensure:[self cleanup].! Item was added: + ----- Method: ClassBuilderTest>>testDoubleWordVariableSubclass (in category 'testing - format') ----- + testDoubleWordVariableSubclass + "Ensure that the invariants for superclass/subclass format are preserved" + baseClass := Object variableDoubleWordSubclass: self baseClassName + instanceVariableNames: '' + classVariableNames: '' + poolDictionaries: '' + category: self categoryNameForTemporaryClasses. + [ + subClass := self makeNormalSubclassOf: baseClass. + self deny: (subClass isPointers). + self assert: (subClass isVariable). + self assert: (subClass isDoubleWords). + self deny: (subClass isWeak). + self deny: (subClass isBytes). + self deny: (subClass isHalfWords). + self deny: (subClass isWords). + subClass removeFromSystem. + + "pointer classes" + self should:[self makeIVarsSubclassOf: baseClass] raise: Error. + self should:[self makeVariableSubclassOf: baseClass] raise: Error. + self should:[self makeWeakSubclassOf: baseClass] raise: Error. + + "bit classes" + self should:[self makeByteVariableSubclassOf: baseClass] raise: Error. + self should:[self makeHalfWordVariableSubclassOf: baseClass] raise: Error. + self should:[self makeWordVariableSubclassOf: baseClass] raise: Error. + subClass := self makeDoubleWordVariableSubclassOf: baseClass. + self deny: (subClass isPointers). + self assert: (subClass isVariable). + self assert: (subClass isDoubleWords). + self deny: (subClass isWeak). + self deny: (subClass isBytes). + self deny: (subClass isHalfWords). + self deny: (subClass isWords). + subClass removeFromSystem. + ] ensure:[self cleanup].! Item was added: + ----- Method: ClassBuilderTest>>testHalfWordVariableSubclass (in category 'testing - format') ----- + testHalfWordVariableSubclass + "Ensure that the invariants for superclass/subclass format are preserved" + baseClass := Object variableHalfWordSubclass: self baseClassName + instanceVariableNames: '' + classVariableNames: '' + poolDictionaries: '' + category: self categoryNameForTemporaryClasses. + [ + subClass := self makeNormalSubclassOf: baseClass. + self deny: (subClass isPointers). + self assert: (subClass isVariable). + self assert: (subClass isHalfWords). + self deny: (subClass isWeak). + self deny: (subClass isBytes). + self deny: (subClass isWords). + self deny: (subClass isDoubleWords). + subClass removeFromSystem. + + "pointer classes" + self should:[self makeIVarsSubclassOf: baseClass] raise: Error. + self should:[self makeVariableSubclassOf: baseClass] raise: Error. + self should:[self makeWeakSubclassOf: baseClass] raise: Error. + + "bit classes" + self should:[self makeByteVariableSubclassOf: baseClass] raise: Error. + self should:[self makeWordVariableSubclassOf: baseClass] raise: Error. + self should:[self makeDoubleWordVariableSubclassOf: baseClass] raise: Error. + subClass := self makeHalfWordVariableSubclassOf: baseClass. + self deny: (subClass isPointers). + self assert: (subClass isVariable). + self assert: (subClass isHalfWords). + self deny: (subClass isWeak). + self deny: (subClass isBytes). + self deny: (subClass isWords). + self deny: (subClass isDoubleWords). + subClass removeFromSystem. + ] ensure:[self cleanup].! Item was changed: ----- Method: ClassBuilderTest>>testWordVariableSubclass (in category 'testing - format') ----- testWordVariableSubclass "Ensure that the invariants for superclass/subclass format are preserved" baseClass := Object variableWordSubclass: self baseClassName instanceVariableNames: '' classVariableNames: '' poolDictionaries: '' category: self categoryNameForTemporaryClasses. [ subClass := self makeNormalSubclassOf: baseClass. self deny: (subClass isPointers). self assert: (subClass isVariable). + self assert: (subClass isWords). self deny: (subClass isWeak). self deny: (subClass isBytes). + self deny: (subClass isHalfWords). + self deny: (subClass isDoubleWords). subClass removeFromSystem. "pointer classes" self should:[self makeIVarsSubclassOf: baseClass] raise: Error. self should:[self makeVariableSubclassOf: baseClass] raise: Error. self should:[self makeWeakSubclassOf: baseClass] raise: Error. "bit classes" self should:[self makeByteVariableSubclassOf: baseClass] raise: Error. + self should:[self makeHalfWordVariableSubclassOf: baseClass] raise: Error. + self should:[self makeDoubleWordVariableSubclassOf: baseClass] raise: Error. subClass := self makeWordVariableSubclassOf: baseClass. self deny: (subClass isPointers). self assert: (subClass isVariable). + self assert: (subClass isWords). self deny: (subClass isWeak). self deny: (subClass isBytes). + self deny: (subClass isHalfWords). + self deny: (subClass isDoubleWords). subClass removeFromSystem. ] ensure:[self cleanup].!

1 0

The Trunk: Monticello-nice.650.mcz
by commits＠source.squeak.org 20 Oct '16

20 Oct '16

Nicolas Cellier uploaded a new version of Monticello to project The Trunk: http://source.squeak.org/trunk/Monticello-nice.650.mcz ==================== Summary ==================== Name: Monticello-nice.650 Author: nice Time: 20 October 2016, 9:40:29.118416 pm UUID: a672602e-278e-4480-b569-362600f892da Ancestors: Monticello-nice.649, Monticello-eem.649 Merge eem.649 and nice.649 for 16bits and 64bits integer array. Adopt Eliot's "DoubleByte" rather than "HalfWord" =============== Diff against Monticello-nice.649 =============== Item was changed: ----- Method: MCClassDefinition>>kindOfSubclass (in category 'printing') ----- kindOfSubclass type = #normal ifTrue: [^' subclass: ']. type = #variable ifTrue: [^' variableSubclass: ']. type = #bytes ifTrue: [^' variableByteSubclass: ']. type = #compiledMethod ifTrue: [^' variableByteSubclass: ' ]. + type = #shorts ifTrue: [^' variableDoubleByteSubclass: ']. - type = #shorts ifTrue: [^' variableHalfWordSubclass: ']. type = #words ifTrue: [^' variableWordSubclass: ']. type = #longs ifTrue: [^' variableDoubleWordSubclass: ']. type = #weak ifTrue: [^' weakSubclass: ' ]. type = #ephemeron ifTrue: [^' ephemeronSubclass: ' ]. type = #immediate ifTrue: [^' immediateSubclass: ' ]. self error: 'Unrecognized class type' ! Item was changed: ----- Method: MCStReader>>typeOfSubclass: (in category 'as yet unclassified') ----- typeOfSubclass: aSymbol #( (subclass: normal) (variableSubclass: variable) (variableByteSubclass: bytes) + (variableDoubleByteSubclass: shorts) - (variableHalfWordSubclass: shorts) (variableWordSubclass: words) (variableDoubleWordSubclass: longs) (weakSubclass: weak) (ephemeronSubclass: ephemeron) (immediateSubclass: immediate) ) do: [:ea | ea first = aSymbol ifTrue: [^ ea second]]. self error: 'Unrecognized class definition'!

1 0

The Trunk: Monticello-nice.649.mcz
by commits＠source.squeak.org 20 Oct '16

20 Oct '16

Nicolas Cellier uploaded a new version of Monticello to project The Trunk: http://source.squeak.org/trunk/Monticello-nice.649.mcz ==================== Summary ==================== Name: Monticello-nice.649 Author: nice Time: 20 September 2016, 11:05:23.764791 pm UUID: 21077de5-41b3-4bd4-99ee-93cb5aca0301 Ancestors: Monticello-mt.648 Support for half and double word variable subclasses =============== Diff against Monticello-mt.648 =============== Item was changed: ----- Method: MCClassDefinition>>kindOfSubclass (in category 'printing') ----- kindOfSubclass type = #normal ifTrue: [^' subclass: ']. type = #variable ifTrue: [^' variableSubclass: ']. type = #bytes ifTrue: [^' variableByteSubclass: ']. type = #compiledMethod ifTrue: [^' variableByteSubclass: ' ]. + type = #shorts ifTrue: [^' variableHalfWordSubclass: ']. type = #words ifTrue: [^' variableWordSubclass: ']. + type = #longs ifTrue: [^' variableDoubleWordSubclass: ']. type = #weak ifTrue: [^' weakSubclass: ' ]. type = #ephemeron ifTrue: [^' ephemeronSubclass: ' ]. type = #immediate ifTrue: [^' immediateSubclass: ' ]. self error: 'Unrecognized class type' ! Item was changed: ----- Method: MCStReader>>typeOfSubclass: (in category 'as yet unclassified') ----- typeOfSubclass: aSymbol #( (subclass: normal) (variableSubclass: variable) (variableByteSubclass: bytes) + (variableHalfWordSubclass: shorts) (variableWordSubclass: words) + (variableDoubleWordSubclass: longs) (weakSubclass: weak) (ephemeronSubclass: ephemeron) (immediateSubclass: immediate) ) do: [:ea | ea first = aSymbol ifTrue: [^ ea second]]. self error: 'Unrecognized class definition'!

1 0

sorting array-like collections
by Eliot Miranda 20 Oct '16

20 Oct '16

Hi All, sorted: for Array is OK, but for Array-like subclasses of ArrayedCollection it's suboptimal. For example: 32-bit Mac OS X 2.2GHz Core i7 MBP [| samples r samplesArray | samples := Bitmap new: 256 * 1024. r := Random new. 1 to: samples size do: [:i| samples at: i put: (r next * (1 << 32)) asInteger - 1]. samplesArray := samples asArray. (1 to: 3) collect: [:i| {[samples sorted] timeToRun. [samplesArray sorted] timeToRun}] #(#(266 243) #(293 239) #(413 247))] 64-bit Mac OS X 2.2GHz Core i7 MBP | samples r samplesArray | samples := Bitmap new: 256 * 1024. r := Random new. 1 to: samples size do: [:i| samples at: i put: (r next * (1 << 32)) asInteger - 1]. samplesArray := samples asArray. (1 to: 3) collect: [:i| {[samples sorted] timeToRun. [samplesArray sorted] timeToRun}] #(#(143 134) #(300 133) #(141 137)) My point is about the difference in sorting speed for Array vs Bitmap, but before that note that 64-bit is faster to sort because there are fewer 32-bit to LargePositiveInteger conversions, but the difference between the Bitmap vs Array sort is larger on 64-bit because the 64-bit generation scavenger has a performance problem (which is why I'm looking at the above, fixing the VM profiler to work for 64-bit address spaces). What's going on here is that Array's sorted: is Array>>#sorted: aSortBlockOrNil ^self copy sort: aSortBlockOrNil but for other subclasses of ArrayedCollection it is Collection>>#sorted: aSortBlockOrNil ^self asArray sort: aSortBlockOrNil so there is a slow copy of the Bitmap or ByteArray to an Array with equivalent elements, but a shallow copy (which is fast) in Array>>#sorted: to sort an Array. When you look at the timings above you can see that when a GC occurs due to the slow copy it takes much longer to sort the Bitmap, and that it always takes longer to sort the Bitmap than the Array. For many subclasses of ArrayedCollection, essentially everything other than the RunArrays and CompiledMethod, which are specialised, there is no need to convert to an Array, and a direct access to a shallow copy would work just as well. So shouldn't we instead implement this as ArrayedCollection>>#sorted: aSortBlockOrNil ^self copy sort: aSortBlockOrNil and in subclasses that are exceptions override as e.g. RunArray>>#sorted: aSortBlockOrNil ^self asArray sort: aSortBlockOrNil SparseLargeArray>>#sorted: aSortBlockOrNil something much cleverer.... ? _,,,^..^,,,_ best, Eliot

1 0

Daily Commit Log
by commits＠source.squeak.org 19 Oct '16

19 Oct '16

Changes to Trunk (http://source.squeak.org/trunk.html) in the last 24 hours: http://lists.squeakfoundation.org/pipermail/packages/2016-October/069001.ht… Name: Kernel-tfel.1046 Ancestors: Kernel-eem.1045 Improve performance of large integer fallback code for multiplication and division with small integers, by avoiding recalculating SmallInteger>>digitLength a lot of times. (This yields a 3x speedup in some integer heavy shootout benchmarks like pidigits for RSqueak, where we don't have a LargeIntegers plugin) ============================================= http://lists.squeakfoundation.org/pipermail/packages/2016-October/069002.ht… Name: MonticelloConfigurations-bf.147 Ancestors: MonticelloConfigurations-pre.146 During update, log error instead of stopping. =============================================

1 0

The Trunk: MonticelloConfigurations-bf.147.mcz
by commits＠source.squeak.org 19 Oct '16

19 Oct '16

Bert Freudenberg uploaded a new version of MonticelloConfigurations to project The Trunk: http://source.squeak.org/trunk/MonticelloConfigurations-bf.147.mcz ==================== Summary ==================== Name: MonticelloConfigurations-bf.147 Author: bf Time: 19 October 2016, 9:30:22.470476 pm UUID: b1d019c1-7569-4ea8-8f6a-aac4b395beca Ancestors: MonticelloConfigurations-pre.146 During update, log error instead of stopping. =============== Diff against MonticelloConfigurations-pre.146 =============== Item was changed: ----- Method: MCConfiguration>>depsSatisfying:versionDo:displayingProgress: (in category 'private') ----- depsSatisfying: selectBlock versionDo: verBlock displayingProgress: progressString | count selectedVersions cleanWorkingCopies | self cacheAllFileNamesDuring: [ self repositories do: [ :eachRepository | MCRepositoryGroup default addRepository: eachRepository ]. "First, download selected versions" count := 0. selectedVersions := OrderedCollection new. self withProgress: progressString in: self dependencies do: [ :dep | | verName repo | verName := dep versionInfo name. self class extraProgressInfo ifTrue: [ ProgressNotification signal: '' extra: 'Downloading ' , verName ]. repo := self repositories detect: [ :eachRepository | eachRepository includesVersionNamed: verName ] ifNone: [ self logError: 'Version ' , verName , ' not found in any repository'. self logError: 'Aborting'. ^ count ]. (selectBlock value: dep) ifTrue: [ | version | version := self versionNamed: verName for: dep from: repo. version ifNil: [ self logError: 'Could not download version ' , verName , ' from ' , repo description. self logError: 'Aborting'. ^ count ]. dep package workingCopy newRepositoryGroupIfDefault. "fix old working copies" dep package workingCopy repositoryGroup addRepository: repo. selectedVersions add: version]]. "Then, process only those definitions that moved from one package to another, to avoid order dependence" cleanWorkingCopies := MCWorkingCopy allManagers reject: [ :wc | wc modified ]. MCReorganizationPreloader preloadMovesBetween: selectedVersions. "Finally, load/merge selected versions" self withProgress: progressString in: selectedVersions do: [ :version | self logUpdate: version package with: version. self class extraProgressInfo ifTrue: [ ProgressNotification signal: '' extra: 'Installing ' , version info name ]. verBlock value: version. count := count + 1 ]. "Clean up packages made dirty by MCReorganizationPreloader" + cleanWorkingCopies do: [ :wc | wc modified ifTrue: [[wc checkModified] on: Error do: [:ex | self logWarning: ex description] ]]. - cleanWorkingCopies do: [ :wc | wc modified ifTrue: [wc checkModified] ]. ]. ^ count!

1 0

Something like Woden for squeak (since the old OpenGL is not working anymore...)·
by Casimiro de Almeida Barreto 19 Oct '16

19 Oct '16

Is there something like Woden in squeak 5.1? OpenGL not working because B3DAccelerator is not build into current cogvm. Best regards, Casimiro -- The information contained in this message is confidential and intended to the recipients specified in the headers. If you received this message by error, notify the sender immediately. The unauthorized use, disclosure, copy or alteration of this message are strictly forbidden and subjected to civil and criminal sanctions. == This email may be signed using PGP key *ID: 0x4134A417*

3 3

The Trunk: Kernel-tfel.1046.mcz
by commits＠source.squeak.org 19 Oct '16

19 Oct '16

Tim Felgentreff uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-tfel.1046.mcz ==================== Summary ==================== Name: Kernel-tfel.1046 Author: tfel Time: 19 October 2016, 5:34:18.991659 pm UUID: 12ebf345-b919-2845-8147-56a8b2f4cae4 Ancestors: Kernel-eem.1045 Improve performance of large integer fallback code for multiplication and division with small integers, by avoiding recalculating SmallInteger>>digitLength a lot of times. (This yields a 3x speedup in some integer heavy shootout benchmarks like pidigits for RSqueak, where we don't have a LargeIntegers plugin) =============== Diff against Kernel-eem.1045 =============== Item was changed: ----- Method: Integer>>digitDiv:neg: (in category 'private') ----- digitDiv: arg neg: ng "Answer with an array of (quotient, remainder)." + | quo rem ql d div dh dnh dl qhi qlo j l hi lo r3 a t divDigitLength remDigitLength | - | quo rem ql d div dh dnh dl qhi qlo j l hi lo r3 a t | <primitive: 'primDigitDivNegative' module:'LargeIntegers'> arg = 0 ifTrue: [^ (ZeroDivide dividend: self) signal]. "TFEI added this line" l := self digitLength - arg digitLength + 1. l <= 0 ifTrue: [^ Array with: 0 with: self]. "shortcut against #highBit" d := 8 - arg lastDigit highBitOfByte. div := arg digitLshift: d. + divDigitLength := div digitLength + 1. + div := div growto: divDigitLength. - div := div growto: div digitLength + 1. "shifts so high order word is >=128" rem := self digitLshift: d. rem digitLength = self digitLength ifTrue: [rem := rem growto: self digitLength + 1]. + remDigitLength := rem digitLength. "makes a copy and shifts" quo := Integer new: l neg: ng. + dl := divDigitLength - 1. - dl := div digitLength - 1. "Last actual byte of data" ql := l. dh := div digitAt: dl. dnh := dl = 1 ifTrue: [0] ifFalse: [div digitAt: dl - 1]. 1 to: ql do: [:k | "maintain quo*arg+rem=self" "Estimate rem/div by dividing the leading to bytes of rem by dh." "The estimate is q = qhi*16+qlo, where qhi and qlo are nibbles." + j := remDigitLength + 1 - k. - j := rem digitLength + 1 - k. "r1 := rem digitAt: j." (rem digitAt: j) = dh ifTrue: [qhi := qlo := 15 "i.e. q=255"] ifFalse: ["Compute q = (r1,r2)//dh, t = (r1,r2)\\dh. Note that r1,r2 are bytes, not nibbles. Be careful not to generate intermediate results exceeding 13 bits." "r2 := (rem digitAt: j - 1)." t := ((rem digitAt: j) bitShift: 4) + ((rem digitAt: j - 1) bitShift: -4). qhi := t // dh. t := (t \\ dh bitShift: 4) + ((rem digitAt: j - 1) bitAnd: 15). qlo := t // dh. t := t \\ dh. "Next compute (hi,lo) := q*dnh" hi := qhi * dnh. lo := qlo * dnh + ((hi bitAnd: 15) bitShift: 4). hi := (hi bitShift: -4) + (lo bitShift: -8). lo := lo bitAnd: 255. "Correct overestimate of q. Max of 2 iterations through loop -- see Knuth vol. 2" r3 := j < 3 ifTrue: [0] ifFalse: [rem digitAt: j - 2]. [(t < hi or: [t = hi and: [r3 < lo]]) and: ["i.e. (t,r3) < (hi,lo)" qlo := qlo - 1. lo := lo - dnh. lo < 0 ifTrue: [hi := hi - 1. lo := lo + 256]. hi >= dh]] whileTrue: [hi := hi - dh]. qlo < 0 ifTrue: [qhi := qhi - 1. qlo := qlo + 16]]. "Subtract q*div from rem" l := j - dl. a := 0. + 1 to: divDigitLength do: - 1 to: div digitLength do: [:i | hi := (div digitAt: i) * qhi. lo := a + (rem digitAt: l) - ((hi bitAnd: 15) bitShift: 4) - ((div digitAt: i) * qlo). rem digitAt: l put: lo - (lo // 256 * 256). "sign-tolerant form of (lo bitAnd: 255)" a := lo // 256 - (hi bitShift: -4). l := l + 1]. a < 0 ifTrue: ["Add div back into rem, decrease q by 1" qlo := qlo - 1. l := j - dl. a := 0. + 1 to: divDigitLength do: - 1 to: div digitLength do: [:i | a := (a bitShift: -8) + (rem digitAt: l) + (div digitAt: i). rem digitAt: l put: (a bitAnd: 255). l := l + 1]]. + quo digitAt: ql + 1 - k put: (qhi bitShift: 4) - quo digitAt: quo digitLength + 1 - k put: (qhi bitShift: 4) + qlo]. rem := rem digitRshift: d bytes: 0 lookfirst: dl. ^ Array with: quo with: rem! Item was changed: ----- Method: Integer>>digitMultiply:neg: (in category 'private') ----- digitMultiply: arg neg: ng + | selfLen argLen prod prodLen carry digit k ab | - | prod prodLen carry digit k ab | <primitive: 'primDigitMultiplyNegative' module:'LargeIntegers'> + argLen := arg digitLength. + (argLen = 1 and: [(arg digitAt: 1) - (arg digitLength = 1 and: [(arg digitAt: 1) = 0]) ifTrue: [^ 0]. + selfLen := self digitLength. + (selfLen = 1 and: [(self digitAt: 1) - (self digitLength = 1 and: [(self digitAt: 1) = 0]) ifTrue: [^ 0]. + prodLen := selfLen + argLen. - prodLen := self digitLength + arg digitLength. prod := Integer new: prodLen neg: ng. "prod starts out all zero" + 1 to: selfLen do: [:i | (digit := self digitAt: i) ~= 0 - 1 to: self digitLength do: [:i | (digit := self digitAt: i) ~= 0 ifTrue: [k := i. carry := 0. "Loop invariant: 0<=carry<=0377, k=i+j-1" + 1 to: argLen do: - 1 to: arg digitLength do: [:j | ab := (arg digitAt: j) * digit + carry + (prod digitAt: k). carry := ab bitShift: -8. prod digitAt: k put: (ab bitAnd: 255). k := k + 1]. prod digitAt: k put: carry]]. ^ prod normalize!

1 0

anyone with admin rights to squeaksource that can help me?
by Robert Withers 19 Oct '16

19 Oct '16

I asked before if my password could be reset on squeaksource but I never heard anything back. Is anyone doing admin there or does anyone know who I could contact that may know or may be able to help me, off list? It would be beneficial to my effort. Kind regards, Rob

3 4

Wait, Squeak is a cat?
by Robert Withers 18 Oct '16

18 Oct '16

http://www.ted.com/talks/rachel_botsman_the_currency_of_the_new_economy_is_… :_)

1 0

← Newer
1
...
4
5
6
7
8
9
10
11
12
Older →