Squeak-dev October 2020

squeak-dev@lists.squeakfoundation.org

51 participants
394 discussions

The Trunk: Tools-eem.994.mcz
by commits＠source.squeak.org 05 Oct '20

05 Oct '20

Eliot Miranda uploaded a new version of Tools to project The Trunk: http://source.squeak.org/trunk/Tools-eem.994.mcz ==================== Summary ==================== Name: Tools-eem.994 Author: eem Time: 2 October 2020, 1:44:29.015648 pm UUID: 23145257-280d-4a4a-a4ba-3b5cc367f9a9 Ancestors: Tools-eem.993 Oops! Compiledmethod>>blockExtentsToTempsMap needs to observe that startKeysToBlockExtents has moved to DebuggerMethodMap. =============== Diff against Tools-eem.993 =============== Item was changed: ----- Method: CompiledMethod>>blockExtentsToTempsMap (in category '*Tools-Debugger-support') ----- blockExtentsToTempsMap "If the receiver has been copied with temp names answer a map from blockExtent to temps map in the same format as BytecodeEncoder>>blockExtentsToTempNamesMap. if the receiver has not been copied with temps answer nil." ^self holdsTempNames ifTrue: + [self mapFromBlockKeys: (self debuggerMap startKeysToBlockExtents values sort: [:assocA :assocB| assocA first <= assocB first]) - [self mapFromBlockKeys: (self startKeysToBlockExtents values sort: [:assocA :assocB| assocA first <= assocB first]) toSchematicTemps: self tempNamesString]!

5 5

you folks did a great job on the preferences wizard experience on the launch of a new squeak.
by gettimothy 05 Oct '20

05 Oct '20

Very polished, nice work, pleasure to use. thanks for your hard work.

3 2

A Sad Day – concluded
by Trygve Reenskaug 05 Oct '20

05 Oct '20

Dear all, I need to use many words to explore why I can't understand current Squeak code. I believe the reason is a profound one, and I hope some of you have the patience to read about it. Thank you for your responses to my 'A Sad Day'-message. One response said "/But please don't give up as an inventor of MVC, which has simplified writing software for all of us.// //We need new ideas to stabilize Smalltalk." /As to MVC, it was received with acclamation when I first presented it at PARC in 1978, and people suggested I should make it the theme of my article in the special Smalltalk issue of Byte. I couldn't understand it; MVC was so simple and obvious that is was not worth writing about it. Nevertheless, people seem to have problems understanding MVC. It took me a long time before I gleaned what was going on. The explanation is a deep one, rooted in our different mental paradigms. From around 1970, I was working on Prokon, a distributed system for managers in the shipbuilding industry: Every manager has their own computer that they use for augmenting their mind. The manager understands their software and ideally writes it themselves. Managers delegate conversations with other managers to their computer's M-to-M network. (Marked with a heavy black line in the figure). I chose "distributed planning with central control" as my example project. Each manager creates a plan for their department, using apps suited to their particular needs. A */distributed algorithm/* ensures consistency across departments. I came to PARC in 1978 and could immediately relate to the Smalltalk image with its universe of collaborating objects. Alan's definition of object-orientation fitted my Prokon model: "Thus its semantics are a bit like having thousands and thousands of computers all hooked together by a very fast network." MVC prescribes a network of communicating objects. Any object can fill one or more positions in the network as long as it has the required behavior; their classes are irrelevant. It's so simple that it's not worth writing about it. ==================== The work on this post was interrupted at this point by an unexpected week in hospital. It gave me quiet days of pondering the futility of what I am doing and I will be terminating my memberships in the Pharo and Squeak mailing lists. I have also deleted most of the old draft of this message and will quickly conclude with two observations: 1. The Smalltalk image is a universe of communicating objects. I call it an object computer. It can be seen as the model of an entirely new kind of computer, a model on a level closer to the human mind than the von Neumann model of 1948. The new model is communication-centric and should supersede the ubiquitous CPU-centric model as soon as possible. Working out the details of this idea could make an exciting and disruptive Ph.D. thesis. 2. Smalltalk is called a programming language. It is a curious one, very different from well-known languages like Java with their syntax and semantics. Smalltalk, as a programming language, does not have the concept of a program. Smalltalk, as a class-oriented language, does not have syntax for the declaration of a class. Smalltalk, as an object-oriented language, can't describe how objects collaborate to achieve a goal. You appear to be happy with this state of affairs, at least, I see no sign of anybody wanting to move on from the unfinished Smalltalk language to a mature development environment. I do not find it satisfactory and it is not acceptable to the intended managers populating the distributed system shown in the first picture. Consequently, I have done something about it as described in my SoSym article "/Personal Programming and the Object Computer./" I am tired of being alone in my endeavors and this ends my work with Squeak and other Smalltalks. I wish you health and happiness wherever you happen to be. Trygve Personal programming and the object computer https://doi.org/10.1007/s10270-019-00768-3 -- /The essence of object orientation is that objects collaborateto achieve a goal. / Trygve Reenskaug mailto: trygver(a)ifi.uio.no <mailto:%20trygver@ifi.uio.no> Morgedalsvn. 5A http://folk.uio.no/trygver/ N-0378 Oslo http://fullOO.info Norway Tel: (+47) 468 58 625

6 11

would someone add me to Core Developers, please
by rabbit 05 Oct '20

05 Oct '20

To the source.squeak.org server? Please add me to Core Developers, I am rww. Thanks! rabbit

1 0

The Trunk: CollectionsTests-ul.344.mcz
by commits＠source.squeak.org 05 Oct '20

05 Oct '20

Levente Uzonyi uploaded a new version of CollectionsTests to project The Trunk: http://source.squeak.org/trunk/CollectionsTests-ul.344.mcz ==================== Summary ==================== Name: CollectionsTests-ul.344 Author: ul Time: 28 September 2020, 11:52:49.129468 pm UUID: 82e7d021-2a4e-4e58-8758-c4e8838805cf Ancestors: CollectionsTests-eem.342 Hashed collections: - updated tests to send #array and #size instead of #capacity - added a few tests for #capacity =============== Diff against CollectionsTests-eem.342 =============== Item was added: + ----- Method: DictionaryTest>>testArraySizeOfNew (in category 'tests - basic') ----- + testArraySizeOfNew + "Test the special cases implemented in HashedCollection class >> #new and #new: using Dictionary as an example because HashedCollection is abstract." + + | goodPrimes | + goodPrimes := HashedCollection goodPrimes. + self assert: (goodPrimes includes: Dictionary new array size). + 0 to: 100 do: [ :size | + | dictionary | + dictionary := Dictionary new: size. + self assert: (goodPrimes includes: dictionary array size). + self assert: dictionary capacity >= size ]! Item was removed: - ----- Method: DictionaryTest>>testCapcityOfNew (in category 'tests - basic') ----- - testCapcityOfNew - "Test the special cases implemented in HashedCollection class >> #new and #new: using Dictionary as an example because HashedCollection is abstract." - - | goodPrimes | - goodPrimes := HashedCollection goodPrimes. - self assert: (goodPrimes includes: Dictionary new capacity). - 0 to: 100 do: [ :size | - | dictionary | - dictionary := Dictionary new: size. - self assert: (goodPrimes includes: dictionary capacity) ]! Item was added: + ----- Method: HashedCollectionTest>>testArraySize (in category 'tests - integrity') ----- + testArraySize + + | inconsistentCollections | + inconsistentCollections := HashedCollection allSubInstances reject: [ :each | + each class == MethodDictionary "MethodDictionary is the only HashedCollection which doesn't have prime array size" + ifTrue: [ each array size isPowerOfTwo ] + ifFalse: [ each array size isPrime ] ]. + self assert: inconsistentCollections isEmpty! Item was changed: ----- Method: HashedCollectionTest>>testCapacity (in category 'tests - integrity') ----- testCapacity + self assert: (HashedCollection allSubInstances allSatisfy: [ :each | + each array size * 3 // 4 = each capacity ])! - | inconsistentCollections | - inconsistentCollections := HashedCollection allSubInstances reject: [ :each | - each class == MethodDictionary "MethodDictionary is the only HashedCollection which doesn't have prime array size" - ifTrue: [ each capacity isPowerOfTwo ] - ifFalse: [ each capacity isPrime ] ]. - self assert: inconsistentCollections isEmpty! Item was changed: ----- Method: OrderedDictionaryTest>>testGrow (in category 'tests') ----- testGrow self + assert: 11 equals: sut array size; "next prime number to 7; see #setUp" + assert: sut capacity = (sut instVarNamed: #order) size; + assert: sut array size >(sut instVarNamed: #order) size. "save memory" - assert: 11 equals: sut capacity; "next prime number to 7; see #setUp" - assert: sut capacity > (sut instVarNamed: #order) size. "save memory" + 1 to: sut array size do: [:ea | - 1 to: sut capacity do: [:ea | sut at: ea put: nil]. self + assert: sut array size > 11; + assert: sut capacity = (sut instVarNamed: #order) size; + assert: sut array size > (sut instVarNamed: #order) size. "save memory"! - assert: sut capacity > 11; - assert: sut capacity > (sut instVarNamed: #order) size. "save memory"! Item was added: + ----- Method: SetTest>>testCapacity (in category 'tests') ----- + testCapacity + + | set capacity | + set := Set new. + self assert: set size = 0. + 10 timesRepeat: [ + capacity := set capacity. + self assert: set size < capacity. + set size + 1 to: capacity do: [ :i | + set add: i. + self assert: set capacity = capacity ]. + self assert: set size equals: capacity. + set add: set capacity + 1. + self assert: set capacity > capacity ]! Item was changed: ----- Method: WeakIdentityKeyDictionaryTest>>testFinalizeValuesWhenLastChainContinuesAtFront (in category 'tests') ----- testFinalizeValuesWhenLastChainContinuesAtFront + | objectWithHashModulo dictionary arraySize a b c | - | objectWithHashModulo dictionary capacity a b c | objectWithHashModulo := [ :requestedHash :modulo | | object | [ object := Object new. object hash \\ modulo = requestedHash ] whileFalse. object ]. dictionary := self classToBeTested new. + arraySize := dictionary array size. + a := objectWithHashModulo value: arraySize - 2 value: arraySize. - capacity := dictionary capacity. - a := objectWithHashModulo value: capacity - 2 value: capacity. dictionary at: a put: 1. + b := objectWithHashModulo value: arraySize - 1 value: arraySize. - b := objectWithHashModulo value: capacity - 1 value: capacity. dictionary at: b put: 2. + c := objectWithHashModulo value: arraySize - 2 value: arraySize. - c := objectWithHashModulo value: capacity - 2 value: capacity. dictionary at: c put: 3. + self assert: dictionary array size = arraySize. + self assert: (dictionary array at: arraySize - 1) key == a. + self assert: (dictionary array at: arraySize) key == b. - self assert: dictionary capacity = capacity. - self assert: (dictionary array at: capacity - 1) key == a. - self assert: (dictionary array at: capacity) key == b. self assert: (dictionary array at: 1) key == c. a := nil. Smalltalk garbageCollect. dictionary finalizeValues. self assert: (dictionary includesKey: b). self assert: (dictionary includesKey: c). + self assert: dictionary slowSize = 2! - self assert: dictionary slowSize = 2. - ! Item was changed: ----- Method: WeakSetTest>>testIncludes (in category 'tests') ----- testIncludes | weakSet transientFakeNilObject | weakSet := WeakSet new. #(true nil 1) do: [ :each | self deny: (weakSet includes: each) ]. weakSet add: true. self assert: (weakSet includes: true). weakSet remove: true. self deny: (weakSet includes: true). + transientFakeNilObject := ((1 to: 1000) detect: [ :each | each asString hash - nil hash \\ weakSet array size = 0 ]) asString. "this string will occupy the same slot as nil would" - transientFakeNilObject := ((1 to: 1000) detect: [ :each | each asString hash - nil hash \\ weakSet capacity = 0 ]) asString. "this string will occupy the same slot as nil would" weakSet add: transientFakeNilObject. transientFakeNilObject := transientFakeNilObject copy. Smalltalk garbageCollect. "get rid of transientFakeNilObject" self deny: (weakSet includes: transientFakeNilObject). self deny: (weakSet includes: nil) !

1 0

The Trunk: Monticello-ul.729.mcz
by commits＠source.squeak.org 05 Oct '20

05 Oct '20

Levente Uzonyi uploaded a new version of Monticello to project The Trunk: http://source.squeak.org/trunk/Monticello-ul.729.mcz ==================== Summary ==================== Name: Monticello-ul.729 Author: ul Time: 4 October 2020, 7:52:30.808712 pm UUID: 2c45d8d2-9d9c-414c-8200-19e139a5e661 Ancestors: Monticello-ul.728 Do what Monticello-tobe.729 did, but apply the change to MCReader instead of MCVersionReader and remove the unnecessary override from MCVersionReader: Include a dot when matching against extensions Packages of extension-less formats (e.g. tonel) will otherwise match for e.g. the MCStReader in MCReader>>#canReadFileNamed: if their name happens to end on an "st", e.g. "Roassal3-Sunburst" =============== Diff against Monticello-ul.728 =============== Item was changed: ----- Method: MCReader class>>canReadFileNamed: (in category 'testing') ----- canReadFileNamed: fileName + ^ (fileName endsWith: '.', self extension)! - ^ (fileName endsWith: self extension)! Item was removed: - ----- Method: MCVersionReader class>>canReadFileNamed: (in category 'testing') ----- - canReadFileNamed: fileName - ^ (fileName endsWith: self extension)!

1 0

The Inbox: Monticello-tobe.729.mcz
by commits＠source.squeak.org 04 Oct '20

04 Oct '20

A new version of Monticello was added to project The Inbox: http://source.squeak.org/inbox/Monticello-tobe.729.mcz ==================== Summary ==================== Name: Monticello-tobe.729 Author: tobe Time: 3 October 2020, 12:57:12.690975 pm UUID: cbe1a05f-97e6-4780-9762-824be701f76a Ancestors: Monticello-ul.728 Include a dot when matching against extensions Packages of extension-less formats (e.g. tonel) will otherwise match for e.g. the MCStReader in MCReader>>#canReadFileNamed: if their name happens to end on an "st", e.g. "Roassal3-Sunburst" =============== Diff against Monticello-ul.728 =============== Item was changed: ----- Method: MCVersionReader class>>canReadFileNamed: (in category 'testing') ----- canReadFileNamed: fileName + ^ (fileName endsWith: '.', self extension)! - ^ (fileName endsWith: self extension)!

3 5

The Inbox: PromisesLocal-rww.27.mcz
by commits＠source.squeak.org 04 Oct '20

04 Oct '20

A new version of PromisesLocal was added to project The Inbox: http://source.squeak.org/inbox/PromisesLocal-rww.27.mcz ==================== Summary ==================== Name: PromisesLocal-rww.27 Author: rww Time: 4 October 2020, 1:47:26.100611 pm UUID: 030d5bc0-a354-4b22-b576-9b47e589c410 Ancestors: PromisesLocal-rww.26 explicitly take protocol from trunk Promise =============== Diff against PromisesLocal-rww.23 =============== Item was added: + ----- Method: BrokenPromise>>promise (in category 'as yet unclassified') ----- + promise + + self shouldNotImplement.! Item was added: + ----- Method: BrokenPromise>>promise: (in category 'as yet unclassified') ----- + promise: aPromise + + self shouldNotImplement.! Item was changed: ----- Method: Promise>>>> (in category 'monad') ----- >> resolvedBlock "Like >>=, but discards the result of the promise." + ^ self then: [:v | resolvedBlock value] ! - ^ self then: [:v | resolvedBlock value]! Item was changed: ----- Method: Promise>>>>= (in category 'monad') ----- >>= resolvedBlock "Alias for `then:` allowing convenient chaining." + ^ self then: resolvedBlock ! - ^ self then: resolvedBlock! Item was added: + ----- Method: Promise>>evaluateRejecter: (in category 'private') ----- + evaluateRejecter: rejecterBlock + + ! Item was added: + ----- Method: Promise>>evaluateResolver: (in category 'private') ----- + evaluateResolver: resolverBlock + + ! Item was added: + ----- Method: Promise>>initialize (in category 'initialize') ----- + initialize + + ! Item was added: + ----- Method: Promise>>initializeWithIfRejected: (in category 'initialize') ----- + initializeWithIfRejected: aBlock + + ! Item was added: + ----- Method: Promise>>initializeWithResolvedValue: (in category 'initialize') ----- + initializeWithResolvedValue: anObject + + ! Item was added: + ----- Method: Promise>>whenRejected: (in category 'resolving') ----- + whenRejected: aBlock + + ^ super whenRejected: aBlock! Item was added: + ----- Method: Promise>>whenResolved: (in category 'resolving') ----- + whenResolved: aBlock + + ^ super whenResolved: aBlock!

1 0

The Inbox: PromisesLocal-rww.23.mcz
by commits＠source.squeak.org 04 Oct '20

04 Oct '20

A new version of PromisesLocal was added to project The Inbox: http://source.squeak.org/inbox/PromisesLocal-rww.23.mcz ==================== Summary ==================== Name: PromisesLocal-rww.23 Author: rww Time: 4 October 2020, 1:20:20.780612 pm UUID: c8dc6ade-af3b-4dc2-96cf-328fbe79fed6 Ancestors: PromisesLocal-rww.22 finish cycling out unused protocol =============== Diff against PromisesLocal-rww.21 =============== Item was removed: - ----- Method: BrokenPromise>>promise (in category 'as yet unclassified') ----- - promise - ^ self exception! Item was added: + ----- Method: Promise>>>> (in category 'monad') ----- + >> resolvedBlock + "Like >>=, but discards the result of the promise." + ^ self then: [:v | resolvedBlock value]! Item was added: + ----- Method: Promise>>>>= (in category 'monad') ----- + >>= resolvedBlock + "Alias for `then:` allowing convenient chaining." + ^ self then: resolvedBlock! Item was added: + ----- Method: Promise>>waitTimeoutSeconds: (in category 'waiting') ----- + waitTimeoutSeconds: seconds + "Wait for at most the given number of seconds for this promise to resolve. Answer true if it is resolved, false otherwise." + ^self waitTimeoutMSecs: seconds*1000!

1 0

The Inbox: ProtocolState-rww.1.mcz
by commits＠source.squeak.org 04 Oct '20

04 Oct '20

A new version of ProtocolState was added to project The Inbox: http://source.squeak.org/inbox/ProtocolState-rww.1.mcz ==================== Summary ==================== Name: ProtocolState-rww.1 Author: rww Time: 3 October 2020, 11:35:56.550112 am UUID: f7bda3e4-a8e9-4bfc-a2a1-c48130f1d006 Ancestors: split out ProtocolState ==================== Snapshot ==================== SystemOrganization addCategory: #ProtocolState! IdentityDictionary subclass: #ProtocolState instanceVariableNames: 'stateName default' classVariableNames: '' poolDictionaries: '' category: 'ProtocolState'! !ProtocolState commentStamp: 'rww 6/8/2019 21:59' prior: 0! I am a single state within a cyclic graph of states. My values are edges leading to another state in the graph. If the edge has an action associated with it then I perform the method of that name in my client object, passing the object which stepped me as argument, before following the edge. Structure: name Symbol -- my state's name keys Object -- the input tokens that cause me to step values #(Symbol1 Symbol2) -- an edge: the next state and a client action selector default #(Symbol1 Symbol2) -- the edge I follow if no key matches the stepping object I am intended to be inserted somewhere in the middle of a LayeredProtocol stack. Originally from Ian Piumarta's [1] Telnet changeset [2] and PseudoTTY changeset [3]. [1] Ian Piumarta - http://piumarta.com/cv/bio.html [2] telnet.103.cs - http://squeakvm.org/unix/goodies/telnet.301.cs [3] PseudoTTY-3.2-4.st - http://squeakvm.org/unix/goodies/PseudoTTY-3.2-4.st! ----- Method: ProtocolState class>>basicNew (in category 'instance creation') ----- basicNew ^ super basicNew initialize; yourself! ----- Method: ProtocolState class>>created (in category 'accessing') ----- created ^ self new stateName: #created; yourself! ----- Method: ProtocolState class>>example (in category 'examples') ----- example "ProtocolState example" ^(self name: #initial default: #echo: -> #initial) at: 42 put: #echo42: -> #initial; yourself! ----- Method: ProtocolState class>>name:default: (in category 'instance creation') ----- name: myName default: aTransition ^self new stateName: myName; default: aTransition! ----- Method: ProtocolState class>>submitted (in category 'accessing') ----- submitted ^ self new stateName: #submitted; yourself! ----- Method: ProtocolState>>= (in category 'comparing') ----- = anotherState ^ self == anotherState or: [ self class == anotherState class and: [ stateName = anotherState stateName ] ]! ----- Method: ProtocolState>>add: (in category 'accessing') ----- add: anAssociation ^self transitionAt: anAssociation key put: (self transitionFor: anAssociation value)! ----- Method: ProtocolState>>addAll: (in category 'accessing') ----- addAll: anAssociation ^self atAll: anAssociation key put: anAssociation value! ----- Method: ProtocolState>>addAllInteger: (in category 'accessing') ----- addAllInteger: anAssociation ^self atAllInteger: anAssociation key put: anAssociation value! ----- Method: ProtocolState>>addInteger: (in category 'accessing') ----- addInteger: anAssociation ^self transitionAt: anAssociation key asInteger put: (self transitionFor: anAssociation value)! ----- Method: ProtocolState>>at:put: (in category 'accessing') ----- at: key put: transition ^self transitionAt: key put: (self transitionFor: transition)! ----- Method: ProtocolState>>at:to:put: (in category 'accessing') ----- at: anObject to: limit put: transition | edge | edge := self transitionFor: transition. anObject to: limit do: [:target | self transitionAt: target put: edge]! ----- Method: ProtocolState>>atAll:put: (in category 'accessing') ----- atAll: collection put: transition | edge | edge := self transitionFor: transition. collection do: [:elt | self transitionAt: elt put: edge]! ----- Method: ProtocolState>>atAllInteger:put: (in category 'accessing') ----- atAllInteger: collection put: transition | edge | edge := self transitionFor: transition. collection do: [:elt | self transitionAt: elt asInteger put: edge]! ----- Method: ProtocolState>>default (in category 'accessing') ----- default ^default! ----- Method: ProtocolState>>default: (in category 'accessing') ----- default: transition self defaultTransition: (self transitionFor: transition)! ----- Method: ProtocolState>>defaultTransition: (in category 'accessing') ----- defaultTransition: aTransition default := aTransition! ----- Method: ProtocolState>>hash (in category 'comparing') ----- hash ^ stateName hash + (self collect: [:e | e key]) hash! ----- Method: ProtocolState>>isStateNamed: (in category 'actions') ----- isStateNamed: aSymbol ^ stateName == aSymbol! ----- Method: ProtocolState>>name (in category 'accessing') ----- name ^ self stateName! ----- Method: ProtocolState>>name: (in category 'accessing') ----- name: aSymbol stateName := aSymbol! ----- Method: ProtocolState>>printElementsOn: (in category 'printing') ----- printElementsOn: aStream aStream nextPutAll: '(name: ' , stateName printString. aStream nextPutAll: ' default: ' , default printString. aStream nextPutAll: ' transitions:'. self associationsDo: [:transition | aStream space. transition printOn: aStream.]. aStream nextPut: $).! ----- Method: ProtocolState>>printOn: (in category 'printing') ----- printOn: aStream aStream nextPutAll: 'State: '; nextPutAll: stateName asString! ----- Method: ProtocolState>>stateName (in category 'accessing') ----- stateName ^ stateName! ----- Method: ProtocolState>>stateName: (in category 'accessing') ----- stateName: aSymbol stateName := aSymbol! ----- Method: ProtocolState>>transitionAt: (in category 'accessing') ----- transitionAt: key ^super at: key ifAbsent: [default]! ----- Method: ProtocolState>>transitionAt:put: (in category 'accessing') ----- transitionAt: key put: edge ^super at: key put: edge! ----- Method: ProtocolState>>transitionEvent:value:client: (in category 'actions') ----- transitionEvent: event value: value client: client | transition action toState | self validateEvent: event. transition := self transitionAt: event. action := transition key. toState := transition value. action isNil ifFalse: [(action numArgs == 0) ifTrue: [client cull: value]]. toState ifNil: [(KeyNotFound key: toState) signal] ifNotNil: [^toState] ! ----- Method: ProtocolState>>transitionExistsForEvent: (in category 'private') ----- transitionExistsForEvent: event self keysDo: [:key | (key = event) ifTrue: [^ true] ]. ^ false! ----- Method: ProtocolState>>transitionFor: (in category 'private') ----- transitionFor: transition ^transition key -> transition value! ----- Method: ProtocolState>>validateEvent: (in category 'private') ----- validateEvent: event ^ (self transitionExistsForEvent: event) ifTrue: [ true ] ifFalse: [ (KeyNotFound new key: event) signal ]! IdentityDictionary subclass: #ProtocolStateCompiler instanceVariableNames: 'initialState' classVariableNames: '' poolDictionaries: '' category: 'ProtocolState'! !ProtocolStateCompiler commentStamp: '<historical>' prior: 0! I am a collection of ProtocolStates constituting a transition graph for a StatefulProtocol. See my class side for some examples of how I construct state machine descriptions for you. Note that before I can be used to drive a StatefulProtocol you *must* send me #compile. I will answer the initial ProtocolState in the compiled transition graph. (I will also complain if your protocol is broken. ;-) You subsequently pass this ProtocolState as the argument to StatefulProtocol class>>initialState: in order to instantiate a new StatefulProtocol. Structure: initialState Symbol -- the name of the initial (root) node in my transition graph! ----- Method: ProtocolStateCompiler class>>example (in category 'examples') ----- example "A state machine that recognises occurrences of 'x' 'xy' and 'xy[digits...]z' in a stream of characters. Note: this is used by StateMachineTester, so don't modify it. See StateMachineTester class>>test for an example of use." "ProtocolStateCompiler example" | desc | desc := self new. (desc newState: #initial -> (#echo: -> #initial)) add: $x -> (nil -> #statex). (desc newState: #statex -> (#echox: -> #initial)) add: $y -> (#initPrefix: -> #statexy). (desc newState: #statexy -> (#echoxy: -> #initial)) add: $z -> (#echoxyz: -> #initial); addAll: '0123456789' -> (#addPrefix: -> nil). desc initialState: #initial. ^desc! ----- Method: ProtocolStateCompiler class>>example2 (in category 'examples') ----- example2 "ProtocolStateCompiler example2 explore" ^self example compile! ----- Method: ProtocolStateCompiler class>>example3 (in category 'examples') ----- example3 "Note: this example should pop up an error notifier during compilation" "ProtocolStateCompiler example3 compile" | desc | desc := self new. (desc newState: #initial -> (#echo: -> #initial)) add: $x -> (nil -> #statex). (desc newState: #statex -> (#echox: -> #initial)) add: $y -> (nil -> #statexy). (desc newState: #statexy -> (#echoxy: -> #initial)) add: $z -> (#echoxy: -> #statexyz). (desc newState: #statexyz -> (#echoxy: -> #initial)) add: $z -> (#echoxyz: -> #statexyz). desc initialState: #initial. ^desc! ----- Method: ProtocolStateCompiler class>>example4 (in category 'examples') ----- example4 "Note: this example should pop up an error notifier during compilation" "ProtocolStateCompiler example4 compile" | desc | desc := self new. (desc newState: 0 -> (#echo: -> 0)) add: $x -> (nil -> 1). (desc newState: 1 -> (#echox: -> 0)) add: $y -> (nil -> 2). (desc newState: 2 -> (#echoxy: -> 0)) add: $z -> (#echoxy: -> 3). (desc newState: 3 -> (#echoxy: -> 0)) add: $z -> (#echoxyz: ->3). desc initialState: 0. ^desc! ----- Method: ProtocolStateCompiler class>>initialState: (in category 'instance creation') ----- initialState: stateName ^self new initialState: stateName! ----- Method: ProtocolStateCompiler>>compile (in category 'compiling') ----- compile "Compile my symbolic representation into a cyclic DAG and answer the root node" | edge | self valuesDo: [:state | state defaultTransition: (self resolve: state default). state keysDo: [:key | edge := state at: key. state transitionAt: key put: (self resolve: edge)]]. ^self at: initialState! ----- Method: ProtocolStateCompiler>>initialState: (in category 'initialize-release') ----- initialState: stateName initialState := stateName! ----- Method: ProtocolStateCompiler>>newState: (in category 'initialize-release') ----- newState: rule ^self newState: rule key default: rule value! ----- Method: ProtocolStateCompiler>>newState:default: (in category 'initialize-release') ----- newState: stateName default: transition ^self at: stateName put: (ProtocolState name: stateName default: transition)! ----- Method: ProtocolStateCompiler>>printElementsOn: (in category 'printing') ----- printElementsOn: aStream aStream nextPutAll: '(initial: ' , initialState printString , ' states:'. self keysDo: [:key | aStream space. key printOn: aStream]. aStream nextPut: $)! ----- Method: ProtocolStateCompiler>>resolve: (in category 'compiling') ----- resolve: edge | action target | action := edge key. target := edge value. target := (self includesKey: target) ifTrue: [self at: target] ifFalse: [target isNil ifTrue: [nil] ifFalse: [self error: 'unknown target state ' , edge printString]]. ^ action -> target!

1 0

← Newer
1
...
32
33
34
35
36
37
38
39
40
Older →

Jump to page: