Packages August 2010

packages@lists.squeakfoundation.org

1 participants
276 discussions

The Trunk: System-nice.365.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

Nicolas Cellier uploaded a new version of System to project The Trunk: http://source.squeak.org/trunk/System-nice.365.mcz ==================== Summary ==================== Name: System-nice.365 Author: nice Time: 28 August 2010, 11:04:20.183 pm UUID: 1bf5db4f-8a26-4a8b-b5e8-1341c113f4db Ancestors: System-nice.364 Boost non primitive version of SecureHashAlgorithm by about 33% with these two simple things: 1) replace ThirtyTwoBitRegister>>load: postCondition with a cheaper preCondition 2) provide two instance creation message to avoid loading ThirtyTwoBitRegister value twice Last, remove a useless ThirtyTwoBitRegister copy, though it does not make much difference. =============== Diff against System-nice.364 =============== Item was changed: ----- Method: SecureHashAlgorithm>>expandedBlock: (in category 'private') ----- expandedBlock: aByteArray "Convert the given 64 byte buffer into 80 32-bit registers and answer the result." | out src v | out := Array new: 80. src := 1. 1 to: 16 do: [:i | + out at: i put: (ThirtyTwoBitRegister fromByteArray: aByteArray at: src). - out at: i put: (ThirtyTwoBitRegister new loadFrom: aByteArray at: src). src := src + 4]. 17 to: 80 do: [:i | v := (out at: i - 3) copy. v bitXor: (out at: i - 8); bitXor: (out at: i - 14); bitXor: (out at: i - 16); leftRotateBy: 1. out at: i put: v]. ^ out ! Item was changed: ----- Method: SecureHashAlgorithm>>initializeTotals (in category 'private') ----- initializeTotals "Initialize totalA through totalE to their seed values." "total registers for use when primitives are absent" + totalA := ThirtyTwoBitRegister fromInteger: 16r67452301. + totalB := ThirtyTwoBitRegister fromInteger: 16rEFCDAB89. + totalC := ThirtyTwoBitRegister fromInteger: 16r98BADCFE. + totalD := ThirtyTwoBitRegister fromInteger: 16r10325476. + totalE := ThirtyTwoBitRegister fromInteger: 16rC3D2E1F0. - totalA := ThirtyTwoBitRegister new load: 16r67452301. - totalB := ThirtyTwoBitRegister new load: 16rEFCDAB89. - totalC := ThirtyTwoBitRegister new load: 16r98BADCFE. - totalD := ThirtyTwoBitRegister new load: 16r10325476. - totalE := ThirtyTwoBitRegister new load: 16rC3D2E1F0. self initializeTotalsArray. ! Item was changed: ----- Method: SecureHashAlgorithm class>>initialize (in category 'class initialization') ----- initialize "SecureHashAlgorithm initialize" "For the curious, here's where these constants come from: #(2 3 5 10) collect: [:x | ((x sqrt / 4.0) * (2.0 raisedTo: 32)) truncated hex]" + K1 := ThirtyTwoBitRegister fromInteger: 16r5A827999. + K2 := ThirtyTwoBitRegister fromInteger: 16r6ED9EBA1. + K3 := ThirtyTwoBitRegister fromInteger: 16r8F1BBCDC. + K4 := ThirtyTwoBitRegister fromInteger: 16rCA62C1D6. - K1 := ThirtyTwoBitRegister new load: 16r5A827999. - K2 := ThirtyTwoBitRegister new load: 16r6ED9EBA1. - K3 := ThirtyTwoBitRegister new load: 16r8F1BBCDC. - K4 := ThirtyTwoBitRegister new load: 16rCA62C1D6. ! Item was changed: ----- Method: ThirtyTwoBitRegister>>load: (in category 'accessing') ----- load: anInteger "Set my contents to the value of given integer." + (anInteger positive and: [anInteger digitLength <= 4]) - low := anInteger bitAnd: 16rFFFF. - hi := (anInteger bitShift: -16) bitAnd: 16rFFFF. - self asInteger = anInteger ifFalse: [self error: 'out of range: ', anInteger printString]. + low := anInteger bitAnd: 16rFFFF. + hi := (anInteger bitShift: -16) bitAnd: 16rFFFF ! Item was added: + ----- Method: ThirtyTwoBitRegister class>>fromInteger: (in category 'instance creation') ----- + fromInteger: aPositiveInteger + "Answer a new instance whose initial contents is copied from aPositiveInteger. + It is required that aPositiveInteger has no more than 32 bits." + + ^ self basicNew load: aPositiveInteger + ! Item was changed: ----- Method: SecureHashAlgorithm>>processBuffer: (in category 'private') ----- processBuffer: aByteArray "Process given 64-byte buffer, accumulating the results in totalA through totalE." | a b c d e w tmp | self primHasSecureHashPrimitive ifTrue: [^ self processBufferUsingPrimitives: aByteArray] ifFalse: [totals := nil]. "initialize registers a through e from the current totals" a := totalA copy. b := totalB copy. c := totalC copy. d := totalD copy. e := totalE copy. "expand and process the buffer" w := self expandedBlock: aByteArray. 1 to: 80 do: [:i | tmp := (a copy leftRotateBy: 5) += (self hashFunction: i of: b with: c with: d); += e; += (w at: i); += (self constantForStep: i). e := d. d := c. + c := b leftRotateBy: 30. - c := b copy leftRotateBy: 30. b := a. a := tmp]. "add a through e into total accumulators" totalA += a. totalB += b. totalC += c. totalD += d. totalE += e. ! Item was added: + ----- Method: ThirtyTwoBitRegister class>>fromByteArray:at: (in category 'instance creation') ----- + fromByteArray: aByteArray at: startIndex + "Answer a new instance whose initial contents is copied from next four bytes from aByteArray starting at startIndex.. + Convention is Most Significant Byte first (aka big endian)." + + ^ self basicNew loadFrom: aByteArray at: startIndex + ! Item was changed: ----- Method: SecureHashAlgorithm>>hashInteger:seed: (in category 'public') ----- hashInteger: aPositiveInteger seed: seedInteger "Hash the given positive integer. The integer to be hashed should have 512 or fewer bits. This entry point is used in the production of random numbers" | buffer dstIndex | "Initialize totalA through totalE to their seed values." + totalA := ThirtyTwoBitRegister + fromInteger: ((seedInteger bitShift: -128) bitAnd: 16rFFFFFFFF). + totalB := ThirtyTwoBitRegister + fromInteger: ((seedInteger bitShift: -96) bitAnd: 16rFFFFFFFF). + totalC := ThirtyTwoBitRegister + fromInteger: ((seedInteger bitShift: -64) bitAnd: 16rFFFFFFFF). + totalD := ThirtyTwoBitRegister + fromInteger: ((seedInteger bitShift: -32) bitAnd: 16rFFFFFFFF). + totalE := ThirtyTwoBitRegister + fromInteger: (seedInteger bitAnd: 16rFFFFFFFF). - totalA := ThirtyTwoBitRegister new - load: ((seedInteger bitShift: -128) bitAnd: 16rFFFFFFFF). - totalB := ThirtyTwoBitRegister new - load: ((seedInteger bitShift: -96) bitAnd: 16rFFFFFFFF). - totalC := ThirtyTwoBitRegister new - load: ((seedInteger bitShift: -64) bitAnd: 16rFFFFFFFF). - totalD := ThirtyTwoBitRegister new - load: ((seedInteger bitShift: -32) bitAnd: 16rFFFFFFFF). - totalE := ThirtyTwoBitRegister new - load: (seedInteger bitAnd: 16rFFFFFFFF). self initializeTotalsArray. "pad integer with zeros" buffer := ByteArray new: 64. dstIndex := 0. aPositiveInteger digitLength to: 1 by: -1 do: [:i | buffer at: (dstIndex := dstIndex + 1) put: (aPositiveInteger digitAt: i)]. "process that one block" self processBuffer: buffer. ^ self finalHash !

1 0

The Trunk: System-nice.364.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

Nicolas Cellier uploaded a new version of System to project The Trunk: http://source.squeak.org/trunk/System-nice.364.mcz ==================== Summary ==================== Name: System-nice.364 Author: nice Time: 28 August 2010, 9:47:42.86 pm UUID: 4318cbfe-643c-434c-92f6-274f7cfc387e Ancestors: System-cbc.363 Apply cosmetic refactorings described at http://lists.squeakfoundation.org/pipermail/squeak-dev/2008-July/130162.html Essentially reuse some existing Integer bit twiddling rather than re-inventing them. =============== Diff against System-cbc.363 =============== Item was changed: ----- Method: DigitalSignatureAlgorithm>>logOfLargestPowerOfTwoDividing: (in category 'private') ----- logOfLargestPowerOfTwoDividing: aPositiveInteger "Answer the base-2 log of the largest power of two that divides the given integer. For example, the largest power of two that divides 24 is 8, whose log base-2 is 3. Do this efficiently even when the given number is a large integer. Assume that the given integer is > 0." + "DigitalSignatureAlgorithm new logOfLargestPowerOfTwoDividing: (32 * 3)" - "DigitalSignatureAlgorithm new largestPowerOfTwoDividing: (32 * 3)" + ^aPositiveInteger lowBit - 1! - | digitIndex power d | - digitIndex := (1 to: aPositiveInteger digitLength) detect: [:i | (aPositiveInteger digitAt: i) ~= 0]. - power := (digitIndex - 1) * 8. - d := aPositiveInteger digitAt: digitIndex. - [d odd] whileFalse: [ - power := power + 1. - d := d bitShift: -1]. - ^ power - ! Item was changed: ----- Method: ThirtyTwoBitRegister>>leftRotateBy: (in category 'accumulator ops') ----- leftRotateBy: bits "Rotate my contents left by the given number of bits, retaining exactly 32 bits." "Details: Perform this operation with as little LargeInteger arithmetic as possible." | bitCount s1 s2 newHi | + "ensure bitCount is in range [0..31]" - "ensure bitCount is in range [0..32]" bitCount := bits \\ 32. - bitCount < 0 ifTrue: [bitCount := bitCount + 32]. - bitCount > 16 ifTrue: [ s1 := bitCount - 16. s2 := s1 - 16. newHi := ((low bitShift: s1) bitAnd: 16rFFFF) bitOr: (hi bitShift: s2). low := ((hi bitShift: s1) bitAnd: 16rFFFF) bitOr: (low bitShift: s2). hi := newHi] ifFalse: [ s1 := bitCount. s2 := s1 - 16. newHi := ((hi bitShift: s1) bitAnd: 16rFFFF) bitOr: (low bitShift: s2). low := ((low bitShift: s1) bitAnd: 16rFFFF) bitOr: (hi bitShift: s2). hi := newHi] ! Item was changed: ----- Method: DigitalSignatureAlgorithm>>inverseOf:mod: (in category 'large integer arithmetic') ----- inverseOf: x mod: n "Answer the inverse of x modulus n. That is, the integer y such that (x * y) \\ n is 1. Both x and n must be positive, and it is assumed that x < n and that x and n are integers." "Details: Use the extended Euclidean algorithm, Schneier, p. 247." + | v u u1 u2 u3 t1 t2 t3 tmp | - | v u k u1 u2 u3 t1 t2 t3 tmp | ((x <= 0) or: [n <= 0]) ifTrue: [self error: 'x and n must be greater than zero']. x >= n ifTrue: [self error: 'x must be < n']. v := x. u := n. + (x even and: [n even]) ifTrue: [self error: 'no inverse']. - k := 0. - [x even and: [n even and: [u > 0]]] whileTrue: [ "eliminate common factors of two" - k := k + 1. - u := u bitShift: -1. - v := v bitShift: -1]. u1 := 1. u2 := 0. u3 := u. t1 := v. t2 := u - 1. t3 := v. [ [u3 even ifTrue: [ ((u1 odd) or: [u2 odd]) ifTrue: [ u1 := u1 + v. u2 := u2 + u]. u1 := u1 bitShift: -1. u2 := u2 bitShift: -1. u3 := u3 bitShift: -1]. ((t3 even) or: [u3 < t3]) ifTrue: [ tmp := u1. u1 := t1. t1 := tmp. tmp := u2. u2 := t2. t2 := tmp. tmp := u3. u3 := t3. t3 := tmp]. u3 even and: [u3 > 0]] whileTrue: ["loop while u3 is even"]. [((u1 < t1) or: [u2 < t2]) and: [u1 > 0]] whileTrue: [ u1 := u1 + v. u2 := u2 + u]. u1 := u1 - t1. u2 := u2 - t2. u3 := u3 - t3. t3 > 0] whileTrue: ["loop while t3 > 0"]. [u1 >= v and: [u2 >= u]] whileTrue: [ u1 := u1 - v. u2 := u2 - u]. - u1 := u1 bitShift: k. - u2 := u2 bitShift: k. - u3 := u3 bitShift: k. - u3 = 1 ifFalse: [self error: 'no inverse']. ^ u - u2 ! Item was changed: ----- Method: DigitalSignatureAlgorithm>>isProbablyPrime: (in category 'large integer arithmetic') ----- isProbablyPrime: p "Answer true if p is prime with very high probability. Such a number is sometimes called an 'industrial grade prime'--a large number that is so extremely likely to be prime that it can assumed that it actually is prime for all practical purposes. This implementation uses the Rabin-Miller algorithm (Schneier, p. 159)." | iterations factor pMinusOne b m r a j z couldBePrime | iterations := 50. "Note: The DSA spec requires >50 iterations; Schneier says 5 are enough (p. 260)" "quick elimination: check for p divisible by a small prime" SmallPrimes ifNil: [ "generate list of small primes > 2" SmallPrimes := Integer primesUpTo: 2000. SmallPrimes := SmallPrimes copyFrom: 2 to: SmallPrimes size]. factor := SmallPrimes detect: [:f | (p \\ f) = 0] ifNone: [nil]. factor ifNotNil: [^ p = factor]. pMinusOne := p - 1. b := self logOfLargestPowerOfTwoDividing: pMinusOne. + m := pMinusOne bitShift: b negated. - m := pMinusOne // (2 raisedTo: b). "Assert: pMinusOne = m * (2 raisedTo: b) and m is odd" Transcript show: ' Prime test pass '. r := Random new. 1 to: iterations do: [:i | Transcript show: i printString; space. a := (r next * 16rFFFFFF) truncated. j := 0. z := (a raisedTo: m modulo: p) normalize. couldBePrime := z = 1. [couldBePrime] whileFalse: [ z = 1 ifTrue: [Transcript show: 'failed!!'; cr. ^ false]. "not prime" z = pMinusOne ifTrue: [couldBePrime := true] ifFalse: [ (j := j + 1) < b ifTrue: [z := (z * z) \\ p] ifFalse: [Transcript show: 'failed!!'; cr. ^ false]]]]. "not prime" Transcript show: 'passed!!'; cr. ^ true "passed all tests; probably prime" !

1 0

The Trunk: System-nice.364.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

1 0

The Trunk: System-nice.364.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

1 0

The Trunk: Morphic-nice.462.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

Nicolas Cellier uploaded a new version of Morphic to project The Trunk: http://source.squeak.org/trunk/Morphic-nice.462.mcz ==================== Summary ==================== Name: Morphic-nice.462 Author: nice Time: 28 August 2010, 1:07:41.985 am UUID: 46f84d84-81fc-1d47-adb1-8ab7f029b8a9 Ancestors: Morphic-ul.461 Minor #ifNil: simplification from Cuis correct #lastSelection though never sent =============== Diff against Morphic-ul.461 =============== Item was changed: ----- Method: ScrollBar>>waitForDelay1:delay2: (in category 'scroll timing') ----- waitForDelay1: delay1 delay2: delay2 "Return true if an appropriate delay has passed since the last scroll operation. The delay decreases exponentially from delay1 to delay2." | now scrollDelay | + timeOfLastScroll ifNil: [self resetTimer]. "Only needed for old instances" - timeOfLastScroll isNil ifTrue: [self resetTimer]. "Only needed for old instances" now := Time millisecondClockValue. (scrollDelay := currentScrollDelay) isNil ifTrue: [scrollDelay := delay1 "initial delay"]. currentScrollDelay := scrollDelay * 9 // 10 max: delay2. "decrease the delay" timeOfLastScroll := now. ^true! Item was changed: ----- Method: GrafPort>>copyBits (in category 'copying') ----- copyBits "Override copybits to do translucency if desired" (combinationRule >= 30 and: [combinationRule <= 31]) + ifTrue: [ + self copyBitsTranslucent: (alpha ifNil: [255])] - ifTrue: - [alpha isNil - ifTrue: [self copyBitsTranslucent: 255] - ifFalse: [self copyBitsTranslucent: alpha]] ifFalse: [super copyBits]! Item was changed: ----- Method: Morph>>colorString: (in category 'printing') ----- colorString: aColor + aColor ifNil: [^'nil']. - aColor isNil ifTrue: [^'nil']. Color colorNames do: [:colorName | aColor = (Color perform: colorName) ifTrue: [^'Color ' , colorName]]. ^aColor storeString! Item was changed: ----- Method: PluggableListMorph>>doubleClick: (in category 'events') ----- doubleClick: event | index | + doubleClickSelector ifNil: [^super doubleClick: event]. - doubleClickSelector isNil ifTrue: [^super doubleClick: event]. index := self rowAtLocation: event position. index = 0 ifTrue: [^super doubleClick: event]. "selectedMorph ifNil: [self setSelectedMorph: aMorph]." ^ self model perform: doubleClickSelector! Item was changed: ----- Method: Morph>>formerOwner: (in category 'dropping/grabbing') ----- formerOwner: aMorphOrNil + aMorphOrNil + ifNil: [self removeProperty: #formerOwner] + ifNotNil: [self setProperty: #formerOwner toValue: aMorphOrNil]! - aMorphOrNil isNil - ifTrue: [self removeProperty: #formerOwner] - ifFalse: [self setProperty: #formerOwner toValue: aMorphOrNil]! Item was changed: ----- Method: PolygonMorph>>computeNextToEndPoints (in category 'smoothing') ----- computeNextToEndPoints | pointAfterFirst pointBeforeLast | pointAfterFirst := nil. self lineSegmentsDo: [:p1 :p2 | + pointAfterFirst ifNil: [pointAfterFirst := p2 asIntegerPoint]. - pointAfterFirst isNil ifTrue: [pointAfterFirst := p2 asIntegerPoint]. pointBeforeLast := p1 asIntegerPoint]. curveState at: 2 put: pointAfterFirst. curveState at: 3 put: pointBeforeLast! Item was changed: ----- Method: Morph>>formerPosition: (in category 'dropping/grabbing') ----- formerPosition: formerPosition + formerPosition + ifNil: [self removeProperty: #formerPosition] + ifNotNil: [self setProperty: #formerPosition toValue: formerPosition]! - formerPosition isNil - ifTrue: [self removeProperty: #formerPosition] - ifFalse: [self setProperty: #formerPosition toValue: formerPosition]! Item was changed: ----- Method: PluggableTextMorph>>getText (in category 'model access') ----- getText "Retrieve the current model text" | newText | + getTextSelector ifNil: [^Text new]. - getTextSelector isNil ifTrue: [^Text new]. newText := model perform: getTextSelector. newText ifNil: [^Text new]. ^newText shallowCopy! Item was changed: ----- Method: PasteUpMorph>>world (in category 'structure') ----- world + worldState ifNil: [^super world]. - worldState isNil ifTrue: [^super world]. ^self! Item was changed: ----- Method: PluggableTextMorph>>getSelection (in category 'model access') ----- getSelection "Answer the model's selection interval." + getSelectionSelector ifNil: [^1 to: 0]. "null selection" - getSelectionSelector isNil ifTrue: [^1 to: 0]. "null selection" ^model perform: getSelectionSelector! Item was changed: ----- Method: MenuMorph>>lastSelection (in category 'accessing') ----- lastSelection "Return the label of the last selected item or nil." + ^selectedItem ifNotNil: [selectedItem selector]! - selectedItem isNil ifTrue: [^selectedItem selector] ifFalse: [^nil]! Item was changed: ----- Method: MenuItemMorph>>contentString: (in category 'accessing') ----- contentString: aString + aString + ifNil: [self removeProperty: #contentString] + ifNotNil: [self setProperty: #contentString toValue: aString]! - aString isNil - ifTrue: [self removeProperty: #contentString] - ifFalse: [self setProperty: #contentString toValue: aString]! Item was changed: ----- Method: MorphicAlarm>>value: (in category 'evaluating') ----- value: anArgument | nArgs | numArgs ifNil:[numArgs := selector numArgs]. nArgs := arguments ifNil:[0] ifNotNil:[arguments size]. nArgs = numArgs ifTrue:[ "Ignore extra argument" ^self value]. + ^arguments + ifNil: [ receiver perform: selector with: anArgument] + ifNotNil: [ receiver perform: selector withArguments: (arguments copyWith: anArgument)]! - ^arguments isNil - ifTrue: [receiver perform: selector with: anArgument] - ifFalse: [receiver perform: selector withArguments: (arguments copyWith: anArgument)]! Item was changed: ----- Method: MorphExtension>>privateOtherProperties: (in category 'accessing - other properties') ----- + privateOtherProperties: anIdentityDictionary - privateOtherProperties: anIndentityDictionary "private - change the receiver's otherProperties" + otherProperties := anIdentityDictionary ! - otherProperties := anIndentityDictionary ! Item was changed: ----- Method: PluggableListMorph>>getCurrentSelectionIndex (in category 'model access') ----- getCurrentSelectionIndex "Answer the index of the current selection." + getIndexSelector ifNil: [^0]. - getIndexSelector isNil ifTrue: [^0]. ^model perform: getIndexSelector! Item was changed: ----- Method: TextEditor>>replaceSelectionWith: (in category 'accessing') ----- replaceSelectionWith: aText "Remember the selection text in UndoSelection. Deselect, and replace the selection text by aText. Remember the resulting selectionInterval in UndoInterval and PriorInterval. Set up undo to use UndoReplace." + beginTypeInBlock ifNotNil: [^self zapSelectionWith: aText]. "called from old code" - beginTypeInBlock ~~ nil ifTrue: [^self zapSelectionWith: aText]. "called from old code" UndoSelection := self selection. self zapSelectionWith: aText. self undoer: #undoReplace! Item was changed: ----- Method: HaloMorph>>containsPoint: (in category 'geometry testing') ----- containsPoint: aPoint "This method is overridden so that, once up, the handles will stay up as long as the mouse is within the box that encloses all the handles even if it is not over any handle or over its owner." + ^target + ifNil: [super containsPoint: aPoint] + ifNotNil: [false]! - target isNil ifTrue: [^super containsPoint: aPoint] ifFalse: [^false]! Item was changed: ----- Method: TextMorph>>privateMoveBy: (in category 'geometry') ----- privateMoveBy: delta super privateMoveBy: delta. + editor + ifNil: [ paragraph ifNotNil: [paragraph moveBy: delta]] + ifNotNil: [ + "When moving text with an active editor, save and restore all state." - editor isNil - ifTrue: [paragraph ifNotNil: [paragraph moveBy: delta]] - ifFalse: - ["When moving text with an active editor, save and restore all state." - paragraph moveBy: delta. self installEditorToReplace: editor]! Item was changed: ----- Method: PluggableButtonMorph>>getModelState (in category 'private') ----- getModelState "Answer the result of sending the receiver's model the getStateSelector message." + ^ getStateSelector + ifNil: [false] + ifNotNil: [model perform: getStateSelector]! - ^ getStateSelector isNil - ifTrue: [false] - ifFalse: [model perform: getStateSelector]!

1 0

The Trunk: Morphic-nice.462.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

1 0

The Trunk: Morphic-nice.462.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

1 0

The Trunk: Network-ul.81.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

Levente Uzonyi uploaded a new version of Network to project The Trunk: http://source.squeak.org/trunk/Network-ul.81.mcz ==================== Summary ==================== Name: Network-ul.81 Author: ul Time: 27 August 2010, 11:42:58.099 pm UUID: ed4a64cf-2d3a-174f-858b-384a021ae828 Ancestors: Network-nice.80 - all VMs have finalization support, so there's no need to check for it anymore - Socket class >> #register: and #unregister: now returns the added/removed object =============== Diff against Network-nice.80 =============== Item was changed: ----- Method: Socket class>>register: (in category 'registry') ----- register: anObject + + ^self registry add: anObject! - WeakArray isFinalizationSupported ifFalse:[^anObject]. - self registry add: anObject! Item was changed: ----- Method: Socket class>>unregister: (in category 'registry') ----- unregister: anObject + + ^self registry remove: anObject ifAbsent: nil! - WeakArray isFinalizationSupported ifFalse:[^anObject]. - self registry remove: anObject ifAbsent:[]! Item was changed: ----- Method: Socket class>>registry (in category 'registry') ----- registry + + ^Registry ifNil: [ Registry := WeakRegistry new ]! - WeakArray isFinalizationSupported ifFalse:[^nil]. - ^Registry isNil - ifTrue:[Registry := WeakRegistry new] - ifFalse:[Registry].!

1 0

The Trunk: Network-ul.81.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

1 0

The Trunk: Network-ul.81.mcz
by commits＠source.squeak.org 28 Aug '10

28 Aug '10

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Packages August 2010