Squeak-dev November 2017

squeak-dev@lists.squeakfoundation.org

38 participants
198 discussions

The Trunk: System-tpr.974.mcz
by commits＠source.squeak.org 06 Nov '17

06 Nov '17

tim Rowledge uploaded a new version of System to project The Trunk: http://source.squeak.org/trunk/System-tpr.974.mcz ==================== Summary ==================== Name: System-tpr.974 Author: tpr Time: 6 November 2017, 2:58:41.610598 pm UUID: 361edb95-23ce-4ab1-b1c2-32b8382265c5 Ancestors: System-eem.973 Add as test for whether we are running on a slower system. Currently use an ARM cpu or SqueakJS as the discriminator, but future options might well include checking for Cog/Sista or even running an actual test and caching the result =============== Diff against System-eem.973 =============== Item was added: + ----- Method: SmalltalkImage>>isLowerPerformance (in category 'system attributes') ----- + isLowerPerformance + "Some operations - TestCases for example - need an idea of the typical performance of the system on which they are being performed. For now we will simply assert that running on an ARM cpu or as a SqueakJS instance is enough of a discriminator. Options for the future might also involve whether the vm is a full Cog or Sisata system, even actually measuring the performance at some point to be sure" + ^ (self platformSubtype beginsWith: 'arm') "Raspberry PI for example" + or: [self platformName = 'Web'] "SqueakJS"!

1 0

The Trunk: EToys-bp.312.mcz
by commits＠source.squeak.org 06 Nov '17

06 Nov '17

Bernhard Pieber uploaded a new version of EToys to project The Trunk: http://source.squeak.org/trunk/EToys-bp.312.mcz ==================== Summary ==================== Name: EToys-bp.312 Author: bp Time: 6 November 2017, 9:23:06.7401 pm UUID: 21d58392-9e50-4ce3-b26c-42b0d465cddf Ancestors: EToys-mt.311 Move method String>>#replaceHtmlCharRefs to the EToys package in order to break the inadvertently introduced dependency from Collections to EToys again =============== Diff against EToys-mt.311 =============== Item was added: + ----- Method: String>>replaceHtmlCharRefs (in category '*Etoys-internet') ----- + replaceHtmlCharRefs + + | pos ampIndex scIndex special specialValue outString outPos newOutPos | + + outString := String new: self size. + outPos := 0. + + pos := 1. + + [ pos <= self size ] whileTrue: [ + "read up to the next ampersand" + ampIndex := self indexOf: $& startingAt: pos ifAbsent: [0]. + + ampIndex = 0 ifTrue: [ + pos = 1 ifTrue: [ ^self ] ifFalse: [ ampIndex := self size+1 ] ]. + + newOutPos := outPos + ampIndex - pos. + outString + replaceFrom: outPos + 1 + to: newOutPos + with: self + startingAt: pos. + outPos := newOutPos. + pos := ampIndex. + + ampIndex <= self size ifTrue: [ + "find the $;" + scIndex := self indexOf: $; startingAt: ampIndex ifAbsent: [ self size + 1 ]. + + special := self copyFrom: ampIndex+1 to: scIndex-1. + specialValue := HtmlEntity valueOfHtmlEntity: special. + + specialValue + ifNil: [ + "not a recognized entity. wite it back" + scIndex > self size ifTrue: [ scIndex := self size ]. + + newOutPos := outPos + scIndex - ampIndex + 1. + outString + replaceFrom: outPos+1 + to: newOutPos + with: self + startingAt: ampIndex. + outPos := newOutPos.] + ifNotNil: [ + outPos := outPos + 1. + outString at: outPos put: specialValue isoToSqueak.]. + + pos := scIndex + 1. ]. ]. + + + ^outString copyFrom: 1 to: outPos!

1 0

The Trunk: Collections-bp.766.mcz
by commits＠source.squeak.org 06 Nov '17

06 Nov '17

Bernhard Pieber uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-bp.766.mcz ==================== Summary ==================== Name: Collections-bp.766 Author: bp Time: 6 November 2017, 9:21:14.115712 pm UUID: bdbd2235-fc3c-4754-b390-84ecd1b03efa Ancestors: Collections-bp.765 move method to the EToys package in order to break the introduces dependency from Collections to EToys again =============== Diff against Collections-bp.765 =============== Item was removed: - ----- Method: String>>replaceHtmlCharRefs (in category 'internet') ----- - replaceHtmlCharRefs - - | pos ampIndex scIndex special specialValue outString outPos newOutPos | - - outString := String new: self size. - outPos := 0. - - pos := 1. - - [ pos <= self size ] whileTrue: [ - "read up to the next ampersand" - ampIndex := self indexOf: $& startingAt: pos ifAbsent: [0]. - - ampIndex = 0 ifTrue: [ - pos = 1 ifTrue: [ ^self ] ifFalse: [ ampIndex := self size+1 ] ]. - - newOutPos := outPos + ampIndex - pos. - outString - replaceFrom: outPos + 1 - to: newOutPos - with: self - startingAt: pos. - outPos := newOutPos. - pos := ampIndex. - - ampIndex <= self size ifTrue: [ - "find the $;" - scIndex := self indexOf: $; startingAt: ampIndex ifAbsent: [ self size + 1 ]. - - special := self copyFrom: ampIndex+1 to: scIndex-1. - specialValue := HtmlEntity valueOfHtmlEntity: special. - - specialValue - ifNil: [ - "not a recognized entity. wite it back" - scIndex > self size ifTrue: [ scIndex := self size ]. - - newOutPos := outPos + scIndex - ampIndex + 1. - outString - replaceFrom: outPos+1 - to: newOutPos - with: self - startingAt: ampIndex. - outPos := newOutPos.] - ifNotNil: [ - outPos := outPos + 1. - outString at: outPos put: specialValue isoToSqueak.]. - - pos := scIndex + 1. ]. ]. - - - ^outString copyFrom: 1 to: outPos!

1 0

The Inbox: Collections-nice.766.mcz
by commits＠source.squeak.org 06 Nov '17

06 Nov '17

Nicolas Cellier uploaded a new version of Collections to project The Inbox: http://source.squeak.org/inbox/Collections-nice.766.mcz ==================== Summary ==================== Name: Collections-nice.766 Author: nice Time: 5 November 2017, 11:52:17.600192 pm UUID: 0008f12f-55e5-4c73-abcd-0e082a6013d1 Ancestors: Collections-bp.765 Revisit the SortFunction in the spirit of refactorings started by Denis Kudriashov in Pharo, but pushing them further. SortFunction are by nature composable. So make SortFunction abstract, and add different subclasses for different kind of composition. Add the ability of sorting by properties with an odd collator rather than default <=>, which was missing in original implementation Also add the ability to sort undefinedFirst as proposed by Denis. Reversing the direction is now implemented with a subclass. And the main SortFunction message is now collate:with: which must answer the collation order (-1,0,1). =============== Diff against Collections-bp.765 =============== Item was changed: ----- Method: BlockClosure>>ascending (in category '*Collections-Support-sorting') ----- ascending "Return a SortFunction around the receiver. If the receiver is a 2 arg block, it is assumed it will do the collation directly itself, returning -1, 0, or 1. If the receiver is a one arg block, it will be evaluated for each a and b and of the sort input, and the result of sending <=> to those will be used." + self numArgs = 1 ifTrue: [^PropertySortFunction property: self]. + self numArgs = 2 ifTrue: [^CollatorBlockFunction new collator: self]. + self error: 'a block for sorting should have 1 or 2 parameters'! - | function | - function := SortFunction ascend. - self numArgs = 1 ifTrue: [function monadicBlock: self]. - self numArgs = 2 ifTrue: [function collator: self]. - ^function! Item was added: + ----- Method: BlockClosure>>sortedWith: (in category '*Collections-Support-sorting') ----- + sortedWith: aSortFunction + "Return a SortFunction around the receiver. + The receiver is a one arg block. + It will be evaluated for each a and b and of the sort input, and answer the result of collating those with aSortFunction." + + self numArgs = 1 ifTrue: [^PropertySortFunction property: self sortedWith: aSortFunction asSortFunction]. + self error: 'a block for sorting should have 1 or 2 parameters'! Item was changed: SortFunction subclass: #ChainedSortFunction instanceVariableNames: 'next' classVariableNames: '' poolDictionaries: '' category: 'Collections-Support'! + !ChainedSortFunction commentStamp: 'nice 11/5/2017 22:35' prior: 0! - !ChainedSortFunction commentStamp: 'nice 3/13/2014 22:25' prior: 0! I add to my parent the idea of a "next" function to use when two objects are equal by my particular collator. Usage SortFunctions can be chained together in primary, secondary, tertiary, etc order using the comma method. Consider a sequence of customer objects, where each customer object responds to the messages firstName, lastName, and age. If we want to sort them lastName first, then firstName, and finally oldest first, we would use an expression like: customers sort: #lastName ascending, #firstName ascending, #age descending As noted in my super's comment, unary symbols or single arg blocks can be used. One can omit the the ascending methods on arguments (not the receiver), it will default blocks or symbols to be ascending if none is specified. In other words, the above expression could be simplified slightly as customers sort: #lastName ascending, #firstName, #age descending (note the missing ascending on the #firstName argument) Instance Variables + collator <SortFunction> the first SortFunction. + next <SortFunction> the next SortFunction to evaluate in the event the first results in equal values. - next <SortFunction> the next SortFunction to evaluate in the event my evaluator results in equal values. ! Item was changed: ----- Method: ChainedSortFunction>>, (in category 'converting') ----- , aSortFunction + ^self copy next: next , aSortFunction! - self next: next , aSortFunction! Item was added: + ----- Method: ChainedSortFunction>>collate:with: (in category 'evaluating') ----- + collate: anObject with: bObject + "Refinement of the parent behavior. If the result of my collator is 0, then pass on to the next variable to work it out." + + | result | + result := (collator collate: anObject with: bObject). + ^result isZero + ifTrue: [next collate: anObject with: bObject] + ifFalse: [result]! Item was removed: - ----- Method: ChainedSortFunction>>value:value: (in category 'evaluating') ----- - value: anObject value: bObject - "Refinement of the parent behavior. If the result of my collator is 0, then pass on to the next variable to work it out." - - | result | - result := (collator value: anObject value: bObject) * direction. - ^result isZero - ifTrue: [next value: anObject value: bObject] - ifFalse: [result < 0]! Item was added: + SortFunction subclass: #CollatorBlockFunction + instanceVariableNames: '' + classVariableNames: '' + poolDictionaries: '' + category: 'Collections-Support'! + + !CollatorBlockFunction commentStamp: 'nice 11/5/2017 22:57' prior: 0! + A CollatorBlockFunction is a special SortFunction using a dyadic block to collate objects. + + Instance Variables + + collator <Block> a dyadic block that must return a -1, 0, or 1.! Item was added: + ----- Method: CollatorBlockFunction>>collate:with: (in category 'evaluating') ----- + collate: value1 with: value2 + ^collator value: value1 value: value2! Item was removed: - ----- Method: Collection>>median (in category 'math functions') ----- - median - ^ self asSortedCollection median! Item was added: + SortFunction subclass: #DefaultSortFunction + instanceVariableNames: '' + classVariableNames: 'UniqueInstance' + poolDictionaries: '' + category: 'Collections-Support'! + + !DefaultSortFunction commentStamp: 'nice 11/5/2017 21:45' prior: 0! + A DefaultSortFunction is a collator using the default <=> operator. + It is known to work on String and Magnitude. + + ! Item was added: + ----- Method: DefaultSortFunction class>>new (in category 'instance creation') ----- + new + ^UniqueInstance ifNil: [self basicNew initialize]! Item was added: + ----- Method: DefaultSortFunction>>collate:with: (in category 'evaluating') ----- + collate: value1 with: value2 + ^value1 <=> value2! Item was added: + ----- Method: DefaultSortFunction>>initialize (in category 'initailize-release') ----- + initialize + collator := #<=>! Item was added: + SortFunction subclass: #PropertySortFunction + instanceVariableNames: 'property' + classVariableNames: '' + poolDictionaries: '' + category: 'Collections-Support'! + + !PropertySortFunction commentStamp: 'nice 11/5/2017 22:36' prior: 0! + A PropertySortFunction is a SortFunction for sorting by a specific property. + + Instance Variables + collator <SortFunction> the SortFunction to be used for sorting the properties + property <Symbol | Block> a valuable returning the value of property for objects to be sorted! Item was added: + ----- Method: PropertySortFunction class>>property: (in category 'instance creation') ----- + property: aValuable + ^self new property: aValuable! Item was added: + ----- Method: PropertySortFunction class>>property:sortedWith: (in category 'instance creation') ----- + property: aValuable sortedWith: aSortFunction + ^self new property: aValuable; collator: aSortFunction! Item was added: + ----- Method: PropertySortFunction>>collate:with: (in category 'evaluating') ----- + collate: value1 with: value2 + ^collator collate: (property value: value1) with: (property value: value2)! Item was added: + ----- Method: PropertySortFunction>>property: (in category 'initailize-release') ----- + property: aValuable + property := aValuable! Item was added: + ----- Method: PropertySortFunction>>undefinedFirst (in category 'converting') ----- + undefinedFirst + "apply on the property" + ^self class + property: property + sortedWith: (UndefinedSortFunction new collator: collator) undefinedFirst! Item was added: + ----- Method: PropertySortFunction>>undefinedLast (in category 'converting') ----- + undefinedLast + "apply on the property" + ^self class + property: property + sortedWith: (UndefinedSortFunction new collator: collator) undefinedLast! Item was added: + SortFunction subclass: #ReverseSortFunction + instanceVariableNames: '' + classVariableNames: '' + poolDictionaries: '' + category: 'Collections-Support'! + + !ReverseSortFunction commentStamp: 'nice 11/5/2017 22:40' prior: 0! + A ReverseSortFunction is reversing the order of original sortFunction + + Instance Variables + collator <SortFunction> the original SortFunction. + ! Item was added: + ----- Method: ReverseSortFunction>>collate:with: (in category 'evaluating') ----- + collate: value1 with: value2 + ^(collator collate: value1 with: value2) negated! Item was added: + ----- Method: ReverseSortFunction>>toggleDirection (in category 'converting') ----- + toggleDirection + ^collator! Item was added: + ----- Method: ReverseSortFunction>>undefinedFirst (in category 'converting') ----- + undefinedFirst + "apply on the original" + ^collator undefinedFirst toggleDirection! Item was added: + ----- Method: ReverseSortFunction>>undefinedLast (in category 'converting') ----- + undefinedLast + "apply on the original" + ^collator undefinedLast toggleDirection! Item was changed: Object subclass: #SortFunction + instanceVariableNames: 'collator' - instanceVariableNames: 'direction collator' classVariableNames: '' poolDictionaries: '' category: 'Collections-Support'! + !SortFunction commentStamp: 'nice 11/5/2017 22:52' prior: 0! - !SortFunction commentStamp: 'nice 3/13/2014 22:24' prior: 0! I am intended to be used in place of two arg sort blocks. Usage In the following example, an ascending SortFunction is created based on the result of the #first message send to each object. #(#(1 2) #(2 3) #(0 0)) sorted: #first ascending. To sort by the #last element, but descending, the following would be used: #(#(1 2) #(2 3) #(0 0)) sorted: #last descending. One can use blocks as well. The following sorts in descending order, the sub elements based on the sum of their values. | sumBlock | sumBlock := [:sequence | sequence inject: 0 into: [:sum :each | sum + each]]. #(#(1 2) #(2 3) #(0 0)) sorted: sumBlock descending. One can even use 2 arg blocks, for those cases where the function isn't expressible with objects that respond to < and =. The only catch, is that such a function has to return not true and false, but instead a collation order, values of -1 (for before), 0 (the same) or 1 (to follow). For example: | oddBlock | oddBlock := [:a :b | a odd = b odd ifTrue: [0] ifFalse: [a odd ifTrue: [-1] ifFalse: [1]]]. #(1 5 1 3 2 7 9 4 6) asSortedCollection: oddBlock descending Instance Variables + collator <SortFunction> This is the object responsible for collating objetcs, generally a SortFunction. - collator <BlockClosure> This is the collation function that must return a -1, 0, or 1. It is usually composed by an initialization method such as sendMessage: or monadicBlock:, but may be set directly. - direction <SmallInteger> 1 for ascending, -1 for descending ! Item was removed: - ----- Method: SortFunction class>>ascend (in category 'instance creation') ----- - ascend - - ^self new ascend! Item was removed: - ----- Method: SortFunction class>>descend (in category 'instance creation') ----- - descend - - ^self new descend! Item was changed: ----- Method: SortFunction>>, (in category 'converting') ----- , aSortFunction "Return a new SortFunction which is the concatenation of aSortFunction to me, I will be the primary sort, but if I compare equal, I will defer to the argument." ^(ChainedSortFunction new) + collator: self; - collator: collator; - direction: direction; next: aSortFunction asSortFunction! Item was removed: - ----- Method: SortFunction>>ascend (in category 'initailize-release') ----- - ascend - - direction := 1! Item was added: + ----- Method: SortFunction>>collate:with: (in category 'evaluating') ----- + collate: value1 with: value2 + "answer the collation order for the two values -1,0 or 1" + + ^self subclassResponsibility! Item was changed: ----- Method: SortFunction>>collator: (in category 'initailize-release') ----- + collator: aSortFunction + "Used by subclasses for composition." - collator: a2ArgBlock - "a2ArgBlock MUST return the collation order, -1, 0, or 1" + collator := aSortFunction! - collator := a2ArgBlock! Item was removed: - ----- Method: SortFunction>>descend (in category 'initailize-release') ----- - descend - - direction := -1! Item was removed: - ----- Method: SortFunction>>direction: (in category 'initailize-release') ----- - direction: anInteger - - direction := anInteger! Item was added: + ----- Method: SortFunction>>initialize (in category 'initailize-release') ----- + initialize + "set the default collator" + + collator := DefaultSortFunction new! Item was removed: - ----- Method: SortFunction>>isAscending (in category 'testing') ----- - isAscending - - ^direction = 1! Item was removed: - ----- Method: SortFunction>>isDescending (in category 'testing') ----- - isDescending - - ^direction = -1! Item was removed: - ----- Method: SortFunction>>monadicBlock: (in category 'initailize-release') ----- - monadicBlock: aSingleArgBlock - "Initialze the receiver's collation block to compare the results of evaluating aSingleArgBlock with each argument, and then collate the return values with the <=> method." - - collator := [:a :b | (aSingleArgBlock value: a) <=> (aSingleArgBlock value: b)]! Item was removed: - ----- Method: SortFunction>>sendMessage: (in category 'initailize-release') ----- - sendMessage: aUnarySymbol - "Initialze the receiver's collation block to compare the results of sending aUnarySymbol to each argument, and then collate them with the <=> method." - - collator := [:a :b | (a perform: aUnarySymbol) <=> (b perform: aUnarySymbol)]! Item was changed: ----- Method: SortFunction>>toggleDirection (in category 'converting') ----- toggleDirection + ^ReverseSortFunction new collator: self! - "Invert my current direction, if I'm currently ascending, this will cause me to be descending now, and vice-versa." - - direction := direction * -1! Item was added: + ----- Method: SortFunction>>undefinedFirst (in category 'converting') ----- + undefinedFirst + ^(UndefinedSortFunction new collator: self) undefinedFirst! Item was added: + ----- Method: SortFunction>>undefinedLast (in category 'converting') ----- + undefinedLast + ^(UndefinedSortFunction new collator: self) undefinedLast! Item was changed: ----- Method: SortFunction>>value:value: (in category 'evaluating') ----- value: anObject value: bObject "Masquerade as a two argument block, used by many of the sorting APIs, by returning whether anObject should be placed before bObject or not." | result | + result := (self collate: anObject with: bObject). - result := (collator value: anObject value: bObject) * direction. ^result <= 0! Item was changed: ----- Method: Symbol>>ascending (in category 'sorting') ----- ascending "Return a SortFunction around the receiver, where the receiver will be used as a unary message to send to both a and b during sorting, and then the result of said send will be collated in ascending order using the <=> method." "Example: #('abc' 'de' 'fghi') sorted: #size asscending" + ^PropertySortFunction property: self! - ^SortFunction ascend sendMessage: self! Item was changed: ----- Method: Symbol>>descending (in category 'sorting') ----- descending "Return a SortFunction around the receiver, where the receiver will be used as a unary message to send to both a and b during sorting, and then the result of said send will be collated in descending order using the <=> method." "Example: #('abc' 'de' 'fghi') sorted: #size descending" + ^(PropertySortFunction property: self) toggleDirection! - ^SortFunction descend sendMessage: self! Item was added: + ----- Method: Symbol>>sortedWith: (in category 'sorting') ----- + sortedWith: aSortFunction + "Return a SortFunction around the receiver, where the receiver will be used as a unary message to send to both a and b during sorting, and then the result of said send will be collated in descending order using the aSortFunction." + "Example: #('abc' 'de' 'fghi') sorted: (#size collatedBy: #<=> asSortFunction)" + + ^PropertySortFunction property: self sortedWith: aSortFunction asSortFunction! Item was added: + SortFunction subclass: #UndefinedSortFunction + instanceVariableNames: 'direction' + classVariableNames: '' + poolDictionaries: '' + category: 'Collections-Support'! + + !UndefinedSortFunction commentStamp: 'nice 11/5/2017 23:18' prior: 0! + An UndefinedSortFunction is a specialization of SortFunction for sorting UndefinedObject either first or last. + + Instance Variables + collator <SortFunction> the SortFunction to be used for non nil values + direction: <Integer> -1 if nil is sorted first, 1 if sorted last + ! Item was added: + ----- Method: UndefinedSortFunction>>collate:with: (in category 'evaluating') ----- + collate: value1 with: value2 + value1 ifNil: [^value2 ifNil: [0] ifNotNil: [direction]]. + value2 ifNil: [^direction negated]. + ^collator collate: value1 with: value2! Item was added: + ----- Method: UndefinedSortFunction>>initialize (in category 'initailize-release') ----- + initialize + super initialize. + direction := -1! Item was added: + ----- Method: UndefinedSortFunction>>undefinedFirst (in category 'initailize-release') ----- + undefinedFirst + direction := -1! Item was added: + ----- Method: UndefinedSortFunction>>undefinedLast (in category 'initailize-release') ----- + undefinedLast + direction := 1!

3 2

The Inbox: CollectionsTests-nice.283.mcz
by commits＠source.squeak.org 05 Nov '17

05 Nov '17

Nicolas Cellier uploaded a new version of CollectionsTests to project The Inbox: http://source.squeak.org/inbox/CollectionsTests-nice.283.mcz ==================== Summary ==================== Name: CollectionsTests-nice.283 Author: nice Time: 5 November 2017, 11:44:39.51802 pm UUID: cd2d2262-39d2-4a4d-aa16-7dfd759c1740 Ancestors: CollectionsTests-topa.282 Test the undefinedFirst as proposed by Denis Kudriashov in Pharo. Also test ability of sorting properties with odd collator rather than default <=> =============== Diff against CollectionsTests-topa.282 =============== Item was changed: ----- Method: SortFunctionTest>>testDirectionToggling (in category 'tests') ----- testDirectionToggling | function | function := #x ascending. self assert: (function value: 0 @ 2 value: 1 @ 1). self assert: (function value: 1 @ 2 value: 1 @ 1). self deny: (function value: 2 @ 2 value: 1 @ 1). + function := function toggleDirection. - function toggleDirection. self deny: (function value: 1 @ 2 value: 2 @ 1). self assert: (function value: 1 @ 2 value: 1 @ 1). self assert: (function value: 2 @ 2 value: 1 @ 1). + function := function toggleDirection. - function toggleDirection. self assert: (function value: 0 @ 2 value: 1 @ 1). self assert: (function value: 1 @ 2 value: 1 @ 1). self deny: (function value: 2 @ 2 value: 1 @ 1)! Item was added: + ----- Method: SortFunctionTest>>testPropertyWithOddCollator (in category 'tests') ----- + testPropertyWithOddCollator + + | function | + function := #y sortedWith: [:a :b | "sort the odd first" (b bitAnd: 1) - (a bitAnd: 1)]. + self assert: (function value: 0@1 value: 0@0). + self assert: (function value: 0@1 value: 0@2). + self deny: (function value: 0@2 value: 0@1). + self deny: (function value: 0@2 value: 0@3).! Item was added: + ----- Method: SortFunctionTest>>testUndefinedFirst (in category 'tests') ----- + testUndefinedFirst + + | function | + function := #value ascending undefinedFirst . + self assert: (function value: 1->nil value: 2->'foo'). + self assert: (function collate: 1->nil with: 2->nil) = 0. + self assert: (function value: 2->'bar' value: 1->'foo'). + self deny: (function value: 2->'foo' value: 1->'bar'). + self deny: (function value: 1->'foo' value: 2->nil).! Item was added: + ----- Method: SortFunctionTest>>testUndefinedLast (in category 'tests') ----- + testUndefinedLast + + | function | + function := #value ascending undefinedLast . + self deny: (function value: 1->nil value: 2->'foo'). + self assert: (function collate: 1->nil with: 2->nil) = 0. + self assert: (function value: 2->'bar' value: 1->'foo'). + self deny: (function value: 2->'foo' value: 1->'bar'). + self assert: (function value: 1->'foo' value: 2->nil).!

1 0

Re: [squeak-dev] [Pharo-dev] [ANNOUNCE] ParrotTalk release/design change considerations
by henry 05 Nov '17

05 Nov '17

I disabled vatId authorization in version 3, located in SessionOperations>>processIWant | SessionOperations>>processIAm:. I was asked to disseminate my news to Pharo Users, hello there. I was asked to describe ParrotTalk well, provide use cases and adopters of its use. Alright, I will give an attempt. ParrotTalk is an encrypted connection framework. Currently allowing anonymous 2048-bit key negotiation to establish user-provided encryption cipher and user-provided encoding and decoding, both through a provided SessionAgentMap to a starting SessionAgent server. Please look in the test case ThunkHelloWorldTest for building these maps and running a connection iwth data passing after encryption is established. There is a 4-way negotiation, from ProtocolOffered/Accepted to Go/GoToo. In using RSA 2048 signature validation and DH 2048 primes to establish the key used within the selected Cipher. The Cipher and Encoder are selected by name through the negotiation protocol. Currently three Ciphers are selectable, AESede, DESede, and DES. There are two encoders tested, asn1der, and Bytes. This protocol is described here, in this document. https://github.com/ZiroZimbarra/callistohouse/blob/master/docs/ParrotTalkFr… For as to use cases, this encrypted connection has no third party, man-in-the-middle situation by not using Certificates. As such, this is a tight implementation of NSA-proof encryption without explicit authorization beyond knowledge of a host:port. The use cases involve any communication desired to be encrypted with such high encryption. The support will last my lifetime, so we have a settled solution, here in the third version, provided here. It requires version 111 of Cryptography, as a prerequisite. Both run on Squeak and Pharo. http://www.squeaksource.com/Cryptography/Cryptography-zzz.111.mcz http://www.squeaksource.com/Cryptography/ParrotTalk-HenryHouse.3.mcz The current use is with my hubbub system, a promise-based distributed object implementation. I am working to bring ParrotTalk to Java and allow hubbub to operate interdependently between Squeak, Pharo, Java and any other languages which can support ParrotTalk and STON. My latest efforts with hubbub are to bring STON as the Layer 6 encoding. Hubbub depends on eLinda. http://www.squeaksource.com/Cryptography/elinda-HenryHouse.14.mcz http://www.squeaksource.com/Oceanside/hubbub-HenryHouse.38.mcz Hubbub currently fails to load correctly in Pharo. In Squeak the two ParrotRemoteTestCases: LookupTestCase and OperationalTestCase really screw everything up, do not save an image after running. I never run these tests until I get a better handle of serialization. Currently, do to a shift in progress to STON, the serialization tests fail, just the way we like it. Fix the tests then the system starts to work right. The shift away from vatId authorization should not adversely affect hubbub, we hope! When STON starts to work, and I think I need to turn off jsonMode, then traffic between vats can start to be analyzed and figure out how resolving is working with redirectors invoked remotely. - HH > -------- Original Message -------- > Subject: Re: [Pharo-dev] [ANNOUNCE] ParrotTalk release/design change considerations > Local Time: October 25, 2017 12:43 AM > UTC Time: October 25, 2017 4:43 AM > From: btc(a)openinworld.com > To: henry <henry(a)callistohouse.club>, Pharo Development List <pharo-dev(a)lists.pharo.org> > Stephane Ducasse <stepharo.self(a)gmail.com> > > If I google... parrottalk protocol > nothing seems related. So what is ParrotTalk? > > P.S... since this is not "part of" pharo, [pharo-users] would be a better place for discussion than [pharo-dev]. > Could you re-announce there, with some description of use cases and who/where the protocol is used? > > cheers -ben > > On Wed, Oct 25, 2017 at 1:42 AM, henry <henry(a)callistohouse.club> wrote: > >> Please excuse all the low-level detail, if inappropriate to the discussion. The protocol changes are here specified. >> >> - HH >> >> On Tue, Oct 24, 2017 at 13:40, henry <henry(a)callistohouse.club> wrote: >> >>> In order to bring ParrotTalk-3.6 support, alongside historical 3.5 support, the frame header stays the same and the processing of the ProtocolOffered would select "ParrotTalk-3.6" to use the compact protocol of >>> >>> - ProtocolOffered { offered, preferred } >>> - ProtocolAccepted { accepted } >>> - IWant|GiveInfo|ReplyInfo { vatId, domain, publicKey, cryptoProtocols, dataEncoders } >>> - IAm|ReplyInfo { vatId, domain, publicKey, cryptoProtocol, dataEncoder, dhParam } >>> - Go { cryptoProtocol, dataEncoder, dhParam, signature } >>> - GoToo { signature } >>> >>> Using eLinda : >>> >>> http://www.squeaksource.com/Cryptography/elinda-HenryHouse.14.mcz >>> >>> Above the FrameBuffer, below the SessionOperations for each version of the protocol, an ELindaSession could be inserted. This session think would have the stacks for each protocol version SessionOperation registered by protocol in a Tuple, for eventual callback. When the ProtocolOffered comes in we publish the tuple frame, with set selected version, to route to the correct SessionOperation to support each version of the protocol. >>> >>> With a non-specific vatId required, anonymous connections would be supported. >>> >>> - HH >>> >>> On Tue, Oct 24, 2017 at 12:52, Stephane Ducasse <stepharo.self(a)gmail.com> wrote: >>> >>>> Hi henry thanks for this announce. Can you tell where such protocols are used? Stef On Tue, Oct 24, 2017 at 6:33 PM, henry wrote: > Hi all, > > I am happy to announce the release of version 3.5 of ParrotTalk, for Squeak > and Pharo, found here: > > http://www.squeaksource.com/Cryptography/ParrotTalk-zzz.2.mcz > > It follows this specification: > https://github.com/ZiroZimbarra/callistohouse/blob/master/docs/ParrotTalkFr… > > One item of note, in version 3.5, the system connecting to a server, sending > the IWant msg, must know the vatId of the system being connected to. I am > considering changing this to version 3.6 by removing one round-trip in > messaging. Therefore, these messages would be combined: IWant/GiveInfo, > IAm/ReplyInfo. I will keep ProtocolOffered and ProtocolAccepted to allow > eLindaSession to support both versions: 3.5 and 3.6. > > Thoughts please? > > - HH

2 8

Fwd: Re: [saag] Fw: [internet-draft-draft] ParrotTalk: Anonymous P2P encryption
by henry 05 Nov '17

05 Nov '17

I am preparing an Internet Draft for submission through IETF. Listed below. Sent from ProtonMail Mobile > ---------- Forwarded message ---------- > From: Bob<robert.withers(a)protonmail.com> > Date: On Sat, Nov 4, 2017 at 13:56 > Subject: Fwd: Re: [saag] Fw: [internet-draft-draft] ParrotTalk: Anonymous P2P encryption > To: Bob <robert.withers(a)protonmail.com> > Cc: SAAG <saag(a)ietf.org> > > I updated the I-D located here: http://jmp.sh/VRejS2g > > Thank you for your consideration, > - HH > >> -------- Original Message -------- >> Subject: [saag] Fw: [internet-draft-draft] ParrotTalk: Anonymous P2P encryption >> Local Time: November 3, 2017 9:07 AM >> UTC Time: November 3, 2017 1:07 PM >> From: robert.withers(a)protonmail.com >> To: SAAG <saag(a)ietf.org> >> >> Good morning, >> >> I am forwarding this announcement of the ParrotTalk v3.6 specification and 2 reference implementations, in Squeak/Pharo and Java, to the SAAG list. I was advised that this mailing list regarding the Security Area is the correct home for this announcement. Below, I corrected the version of the Squeak/Pharo ParrotTalk code to version 11, interoperable with the Java version. I am proceeding to work on the Internet-Draft and I hope some discussion builds around this work. >> >> Thank you. >> - HH >> >>> -------- Original Message -------- >>> Subject: [internet-draft-draft] ParrotTalk: Anonymous P2P encryption >>> Local Time: November 2, 2017 9:19 PM >>> UTC Time: November 3, 2017 1:19 AM >>> From: henry(a)callistohouse.club >>> To: IETF <ietf(a)ietf.org> >>> >>> I have developed the ParrotTalk Protocol, and am starting an internet draft document[1] for submission to the process at IETF. >>> >>> ParrotTalk Protocol is documented in part here[2], while I have two implementations: 1 in Squeak/Pharo[3 a/b] and the other in Java[4 a/b]. The particulars of MAC key and ivSequence derivation, as well as constrained traffic signing, are the implementations, yet missing from the specification. They will be added to the internet-draft. >>> >>> How do I go about submitting a specification for ParrotTalk for IETF review and consideration? >>> >>> Thank you. >>> >>> - HH >>> - HH >>> - HH >>> - HH >>> - HH >>> - HH >>> - HH >>> - HH

2 2

Fwd: Re: [saag] Fw: [internet-draft-draft] ParrotTalk: Anonymous P2P encryption
by Bob 04 Nov '17

04 Nov '17

I am preparing an Internet Draft for submission through IETF. Listed below. Sent from ProtonMail Mobile > ---------- Forwarded message ---------- > From: Bob<robert.withers(a)protonmail.com> > Date: On Sat, Nov 4, 2017 at 13:56 > Subject: Fwd: Re: [saag] Fw: [internet-draft-draft] ParrotTalk: Anonymous P2P encryption > To: Bob <robert.withers(a)protonmail.com> > Cc: SAAG <saag(a)ietf.org> > > I updated the I-D located here: http://jmp.sh/VRejS2g > > Thank you for your consideration, > --- > Robert > >> -------- Original Message -------- >> Subject: [saag] Fw: [internet-draft-draft] ParrotTalk: Anonymous P2P encryption >> Local Time: November 3, 2017 9:07 AM >> UTC Time: November 3, 2017 1:07 PM >> From: robert.withers(a)protonmail.com >> To: SAAG <saag(a)ietf.org> >> >> Good morning, >> >> I am forwarding this announcement of the ParrotTalk v3.6 specification and 2 reference implementations, in Squeak/Pharo and Java, to the SAAG list. I was advised that this mailing list regarding the Security Area is the correct home for this announcement. Below, I corrected the version of the Squeak/Pharo ParrotTalk code to version 11, interoperable with the Java version. I am proceeding to work on the Internet-Draft and I hope some discussion builds around this work. >> >> Thank you. >> --- >> Robert >> >>> -------- Original Message -------- >>> Subject: [internet-draft-draft] ParrotTalk: Anonymous P2P encryption >>> Local Time: November 2, 2017 9:19 PM >>> UTC Time: November 3, 2017 1:19 AM >>> From: henry(a)callistohouse.club >>> To: IETF <ietf(a)ietf.org> >>> >>> I have developed the ParrotTalk Protocol, and am starting an internet draft document[1] for submission to the process at IETF. >>> >>> ParrotTalk Protocol is documented in part here[2], while I have two implementations: 1 in Squeak/Pharo[3 a/b] and the other in Java[4 a/b]. The particulars of MAC key and ivSequence derivation, as well as constrained traffic signing, are the implementations, yet missing from the specification. They will be added to the internet-draft. >>> >>> How do I go about submitting a specification for ParrotTalk for IETF review and consideration? >>> >>> Thank you. >>> >>> - Robert >>> >>> [1] IETF I-D draft - http://jmp.sh/VRejS2g >>> >>> [2] ParrotTalk Frame Design - http://jmp.sh/OqlYpyg >>> >>> [3 a] Squeak/Pharo Cryptography library - http://www.squeaksource.com/Cryptography/Cryptography-HenryHouse.113.mcz >>> >>> [3 b] Squeak/Pharo ParrotTalk v3.6 - [http://www.squeaksource.com/Cryptography/ParrotTalk-HenryHouse.11.mcz](http… >>> >>> [4 a] Java ASN1 framework - https://github.com/ZiroZimbarra/ASN1 >>> [4 b] Java ParrotTalk v3.6 - https://github.com/ZiroZimbarra/ParrotTalk

1 0

Swiki: File write error
by Jakob Reschke 04 Nov '17

04 Nov '17

Hello, I just wanted to let you know that I received a 500 Internal Server Error: "File write error" after editing a page in the Squeak wiki. However, the page has been updated successfully. Somebody with access to the server might want to check, though. Best regards, Jakob

2 1

Squeak on macOS 10.13?
by Craig Latta 03 Nov '17

03 Nov '17

Hi all-- Is anyone successfully building/running Squeak on macOS 10.13 (High Sierra)? Any quirks with the new filesystem, etc.? I'm deciding when to upgrade a 10.12 machine. thanks, -C -- Craig Latta Black Page Digital Amsterdam :: San Francisco craig(a)blackpagedigital.com +31 6 2757 7177 (SMS ok) + 1 415 287 3547 (no SMS)

2 1

Jump to page: