Squeak-dev December 2016

squeak-dev@lists.squeakfoundation.org

39 participants
137 discussions

The Trunk: Graphics-bp.366.mcz
by commits＠source.squeak.org 08 Dec '16

08 Dec '16

Bernhard Pieber uploaded a new version of Graphics to project The Trunk: http://source.squeak.org/trunk/Graphics-bp.366.mcz ==================== Summary ==================== Name: Graphics-bp.366 Author: bp Time: 8 December 2016, 4:47:47.670741 pm UUID: 1145c7b4-cdd0-4b89-8049-958b2cc73754 Ancestors: Graphics-bf.365, Graphics-bp.321 merged methods for getting a rectangle's halves and quadrants =============== Diff against Graphics-bf.365 =============== Item was added: + ----- Method: Rectangle>>bottomHalf (in category 'transforming') ----- + bottomHalf + ^self withTop: self center y! Item was added: + ----- Method: Rectangle>>bottomLeftQuadrant (in category 'transforming') ----- + bottomLeftQuadrant + ^self leftCenter corner: self bottomCenter! Item was added: + ----- Method: Rectangle>>bottomRightQuadrant (in category 'transforming') ----- + bottomRightQuadrant + ^self center corner: self bottomRight! Item was added: + ----- Method: Rectangle>>leftHalf (in category 'transforming') ----- + leftHalf + ^self withRight: self center x! Item was added: + ----- Method: Rectangle>>rightHalf (in category 'truncation and round off') ----- + rightHalf + ^self withLeft: self center x! Item was added: + ----- Method: Rectangle>>topHalf (in category 'transforming') ----- + topHalf + ^self withBottom: self center y! Item was added: + ----- Method: Rectangle>>topLeftQuadrant (in category 'transforming') ----- + topLeftQuadrant + ^self topLeft corner: self center! Item was added: + ----- Method: Rectangle>>topRightQuadrant (in category 'transforming') ----- + topRightQuadrant + ^self topCenter corner: self rightCenter!

1 0

The Trunk: Monticello-cmm.659.mcz
by commits＠source.squeak.org 08 Dec '16

08 Dec '16

Chris Muller uploaded a new version of Monticello to project The Trunk: http://source.squeak.org/trunk/Monticello-cmm.659.mcz ==================== Summary ==================== Name: Monticello-cmm.659 Author: cmm Time: 7 December 2016, 10:35:58.341395 pm UUID: 0ac4585a-0c38-4f00-9d85-b0ee443b0631 Ancestors: Monticello-cmm.658 Fix menu activation on selected method or class which has no MC working copy defined. =============== Diff against Monticello-cmm.658 =============== Item was changed: ----- Method: Class>>workingCopy (in category '*monticello') ----- workingCopy + "Answer the MCWorkingCopy in which I am defined." + ^ self packageInfo ifNotNil: [ : pi | pi workingCopy ]! - ^ self packageInfo workingCopy! Item was changed: ----- Method: MCDefinition>>mcModel (in category 'private') ----- mcModel "Find my WorkingCopy, use the first mcModel-capable repository in its reposigoryGroup." + self repositoryGroup ifNotNil: + [ : group | group repositoriesDo: + [ : each | each mcModel ifNotNilDo: + [ : mcModel | ^ mcModel ] ] ]. - self repositoryGroup repositoriesDo: - [ : each | each mcModel ifNotNilDo: - [ : mcModel | ^ mcModel ] ]. ^ nil! Item was changed: ----- Method: MCDefinition>>repositoryGroup (in category 'repositories') ----- repositoryGroup "Answer the MCRepositoryGroup from which this this object was loaded." + ^ self workingCopy ifNotNil: [ : wc | wc repositoryGroup ]! - ^ self workingCopy repositoryGroup! Item was changed: ----- Method: MethodReference>>workingCopy (in category '*monticello') ----- workingCopy "Answer the MCWorkingCopy in which I am defined." + ^ self packageInfo ifNotNil: [ : pi | pi workingCopy ]! - ^ self packageInfo workingCopy!

1 0

The Trunk: Tools-cmm.733.mcz
by commits＠source.squeak.org 07 Dec '16

07 Dec '16

Chris Muller uploaded a new version of Tools to project The Trunk: http://source.squeak.org/trunk/Tools-cmm.733.mcz ==================== Summary ==================== Name: Tools-cmm.733 Author: cmm Time: 6 December 2016, 3:50:06.783172 pm UUID: 46663c9b-de5d-4b65-ae5e-def988146a88 Ancestors: Tools-nice.732 Smalltalk garbageCollect can sometimes take many minutes, and there's no need to do it when opening a ProcessBrowser. =============== Diff against Tools-nice.732 =============== Item was changed: ----- Method: ProcessBrowser class>>open (in category 'instance creation') ----- open - "ProcessBrowser open" - "Create and schedule a ProcessBrowser." - Smalltalk garbageCollect. ^ToolBuilder open: self new!

1 0

The Trunk: EToys-cmm.276.mcz
by commits＠source.squeak.org 07 Dec '16

07 Dec '16

Chris Muller uploaded a new version of EToys to project The Trunk: http://source.squeak.org/trunk/EToys-cmm.276.mcz ==================== Summary ==================== Name: EToys-cmm.276 Author: cmm Time: 7 December 2016, 12:56:16.35587 pm UUID: 5057b31d-2425-48ce-b461-d9399e7cc16a Ancestors: EToys-bf.275 Fix DNU when searching for "Paint" in the Object Catalog. =============== Diff against EToys-bf.275 =============== Item was changed: ----- Method: PDA>>openAsMorphIn: (in category 'initialization') ----- openAsMorphIn: window "PDA new openAsMorph openInWorld" "Create a pluggable version of all the morphs for a Browser in Morphic" | dragNDropFlag paneColor chooser | window color: Color black. paneColor := (Color r: 0.6 g: 1.0 b: 0.0). window model: self. + dragNDropFlag := SystemBrowser browseWithDragNDrop. - dragNDropFlag := Preferences browseWithDragNDrop. window addMorph: ((PluggableListMorph on: self list: #peopleListItems selected: #peopleListIndex changeSelected: #peopleListIndex: menu: #peopleMenu: keystroke: #peopleListKey:from:) enableDragNDrop: dragNDropFlag) frame: (0@0 corner: 0.3(a)0.25). window addMorph: ((chooser := PDAChoiceMorph new color: paneColor) contentsClipped: 'all'; target: self; actionSelector: #chooseFrom:categoryItem:; arguments: {chooser}; getItemsSelector: #categoryChoices) frame: (0(a)0.25 corner: 0.3(a)0.3). window addMorph: ((MonthMorph newWithModel: self) color: paneColor; extent: 148@109) frame: (0.3@0 corner: 0.7(a)0.3). window addMorph: (PDAClockMorph new color: paneColor; faceColor: (Color r: 0.4 g: 0.8 b: 0.6)) "To match monthMorph" frame: (0.7@0 corner: 1.0(a)0.3). window addMorph: ((PluggableListMorph on: self list: #toDoListItems selected: #toDoListIndex changeSelected: #toDoListIndex: menu: #toDoMenu: keystroke: #toDoListKey:from:) enableDragNDrop: dragNDropFlag) frame: (0(a)0.3 corner: 0.3(a)0.7). window addMorph: ((PluggableListMorph on: self list: #scheduleListItems selected: #scheduleListIndex changeSelected: #scheduleListIndex: menu: #scheduleMenu: keystroke: #scheduleListKey:from:) enableDragNDrop: dragNDropFlag) frame: (0.3(a)0.3 corner: 0.7(a)0.7). window addMorph: ((PluggableListMorph on: self list: #notesListItems selected: #notesListIndex changeSelected: #notesListIndex: menu: #notesMenu: keystroke: #notesListKey:from:) enableDragNDrop: dragNDropFlag) frame: (0.7(a)0.3 corner: 1(a)0.7). window addMorph: (PluggableTextMorph on: self text: #currentItemText accept: #acceptCurrentItemText: readSelection: #currentItemSelection menu: #currentItemMenu:) frame: (0(a)0.7 corner: 1@1). window firstSubmorph color: paneColor. window updatePaneColors. window step. ^ window!

1 0

pondering Smalltalk scripting in Minecraft
by Ben Coman 07 Dec '16

07 Dec '16

Minecraft is immensely popular. For teaching programming (to kids) via Minecraft, the first option is Java, but that might be a bit heavy for a pre-teen. A few lighter options are Lua via Computercraft [1] and Javascript via Scriptcraft [2]. I've tried Computercraft and its quite interesting the way it simulates real-life computers and drones, but the drone works slowly so my kids end up doing things faster themselves. I am in the initial stages of trying Scriptcraft (with Spigot server) and making walls, buildings etc is fast, so hopefully my kids will see value in using these superpowers. But then I wondered whether it might be possible for SqueakJS and PharoJS to interface with Minecraft via the Javascript engine. I was interested to discover that the JVM comes with a Javascript engine built in [3], "Rhino" [4] for JVM7 and faster "Nashorn" for JVM8 [5]. So I thought I would just seed the idea in the community to see if anyone might be interested to pursue this. It really would be fantastic to use our environment to make mods for Minecraft. (The actual plan for world domination is to build some assets and experience with minecraft, and then migrate to a pure Smalltalk 3D client and server with GPU backends when that becomes available -gnomes) Or maybe it would be better to use JNIPort[6] or JavaConnect[7] or something else. cheers -ben [1] http://www.computercraft.info/2016/04/01/computercraft-and-computercraftedu… [2] http://scriptcraftjs.org/ [3] https://github.com/walterhiggins/ScriptCraft/blob/master/docs/Using-Java-AP… [4] https://jaxenter.com/scriptcraft-hacking-minecraft-for-kids-105467.html [5] https://www.infoq.com/articles/nashorn [6] http://smalltalkhub.com/#!/~JNIPort/JNIPort/ [7] http://www.squeaksource.com/JavaConnect

2 1

The Trunk: Collections-topa.726.mcz
by commits＠source.squeak.org 06 Dec '16

06 Dec '16

Tobias Pape uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-topa.726.mcz ==================== Summary ==================== Name: Collections-topa.726 Author: topa Time: 6 December 2016, 2:31:08.021296 pm UUID: 8409fe6a-d5ea-4d4e-ac78-243182dd1fd7 Ancestors: Collections-topa.725 Adopt improved (ie, actually working) Linked List from our relatives. =============== Diff against Collections-topa.725 =============== Item was added: + ----- Method: Link>>asLink (in category 'converting') ----- + asLink + + ^ self! Item was changed: ----- Method: Link>>nextLink (in category 'accessing') ----- nextLink - "Answer the link to which the receiver points." + ^ nextLink! - ^nextLink! Item was changed: ----- Method: Link>>nextLink: (in category 'accessing') ----- nextLink: aLink "Store the argument, aLink, as the link to which the receiver refers. Answer aLink." + ^ nextLink := aLink! - ^nextLink := aLink! Item was changed: SequenceableCollection subclass: #LinkedList instanceVariableNames: 'firstLink lastLink' classVariableNames: '' poolDictionaries: '' category: 'Collections-Sequenceable'! + !LinkedList commentStamp: 'topa 12/6/2016 14:17' prior: 0! + I represent a collection of links, which are containers for other objects. Using the message sequence addFirst:/removeLast causes the receiver to behave as a stack; using addLast:/removeFirst causes the receiver to behave as a queue. + + If you attempt to add any object into a LinkedList that is not a Link, it will automatically be wrapped by a ValueLink. A LinkedList therefore behaves very much like any collection, except that certain calls such as atIndex: are linear rather than constant time.! - !LinkedList commentStamp: '<historical>' prior: 0! - I represent a collection of links, which are containers for other objects. Using the message sequence addFirst:/removeLast causes the receiver to behave as a stack; using addLast:/removeFirst causes the receiver to behave as a queue.! Item was added: + ----- Method: LinkedList class>>new: (in category 'instance creation') ----- + new: anInt + "LinkedList don't need capacity" + ^self new! Item was added: + ----- Method: LinkedList class>>new:streamContents: (in category 'stream creation') ----- + new: size streamContents: aBlock + ^ self withAll: (super new: size streamContents: aBlock)! Item was added: + ----- Method: LinkedList class>>newFrom: (in category 'instance creation') ----- + newFrom: aCollection + "Answer an instance with same elements as aCollection." + ^self new + addAll: aCollection; + yourself! Item was changed: ----- Method: LinkedList>>add: (in category 'adding') ----- + add: aLinkOrObject - add: aLink "Add aLink to the end of the receiver's list. Answer aLink." + ^self addLast: aLinkOrObject! - ^self addLast: aLink! Item was changed: ----- Method: LinkedList>>add:after: (in category 'adding') ----- + add: link after: otherLinkOrObject - add: link after: otherLink - "Add otherLink after link in the list. Answer aLink." + | otherLink | + otherLink := self linkAt: (self indexOf: otherLinkOrObject). + ^ self add: link afterLink: otherLink! - | savedLink | - lastLink == otherLink ifTrue: [^ self addLast: link]. - savedLink := otherLink nextLink. - otherLink nextLink: link. - link nextLink: savedLink. - ^link.! Item was added: + ----- Method: LinkedList>>add:afterLink: (in category 'adding') ----- + add: aLinkOrObject afterLink: otherLink + + "Add otherLink after link in the list. Answer aLink." + + | savedLink aLink | + lastLink == otherLink ifTrue: [^ self addLast: aLinkOrObject]. + savedLink := otherLink nextLink. + aLink := aLinkOrObject asLink. + otherLink nextLink: aLink. + aLink nextLink: savedLink. + ^aLink.! Item was changed: ----- Method: LinkedList>>add:before: (in category 'adding') ----- + add: link before: otherLinkOrObject + "Add otherLink after link in the list. Answer aLink." - add: link before: otherLink + | otherLink | + otherLink := self linkAt: (self indexOf: otherLinkOrObject). + ^ self add: link beforeLink: otherLink! - | aLink | - firstLink == otherLink ifTrue: [^ self addFirst: link]. - aLink := firstLink. - [aLink == nil] whileFalse: [ - aLink nextLink == otherLink ifTrue: [ - link nextLink: aLink nextLink. - aLink nextLink: link. - ^ link - ]. - aLink := aLink nextLink. - ]. - ^ self errorNotFound: otherLink! Item was added: + ----- Method: LinkedList>>add:beforeLink: (in category 'adding') ----- + add: aLinkOrObject beforeLink: otherLink + + | currentLink| + + firstLink == otherLink ifTrue: [^ self addFirst: aLinkOrObject]. + + currentLink := firstLink. + [currentLink == nil] whileFalse: [ + currentLink nextLink == otherLink ifTrue: [ + | aLink | + aLink := aLinkOrObject asLink. + aLink nextLink: currentLink nextLink. + currentLink nextLink: aLink. + ^ aLink + ]. + currentLink := currentLink nextLink. + ]. + ^ self errorNotFound: otherLink! Item was changed: ----- Method: LinkedList>>addFirst: (in category 'adding') ----- + addFirst: aLinkOrObject - addFirst: aLink "Add aLink to the beginning of the receiver's list. Answer aLink." + |aLink| + aLink := aLinkOrObject asLink. - self isEmpty ifTrue: [lastLink := aLink]. aLink nextLink: firstLink. firstLink := aLink. ^aLink! Item was changed: ----- Method: LinkedList>>addLast: (in category 'adding') ----- + addLast: aLinkOrObject - addLast: aLink "Add aLink to the end of the receiver's list. Answer aLink." + |aLink| + aLink := aLinkOrObject asLink. - self isEmpty ifTrue: [firstLink := aLink] ifFalse: [lastLink nextLink: aLink]. lastLink := aLink. ^aLink! Item was changed: ----- Method: LinkedList>>at: (in category 'accessing') ----- at: index + ^(self linkAt: index) value! - | i | - i := 0. - self do: [:link | - (i := i + 1) = index ifTrue: [^ link]]. - ^ self errorSubscriptBounds: index! Item was added: + ----- Method: LinkedList>>at:put: (in category 'accessing') ----- + at: index put: anObject + + ^self at: index putLink: (self linkOf: anObject ifAbsent: [anObject asLink])! Item was added: + ----- Method: LinkedList>>at:putLink: (in category 'accessing') ----- + at: index putLink: aLink + | previousLink nextLink | + "Please don't put a link which is already in the list, or you will create an infinite loop" + (self validIndex: index) ifFalse: [^ self errorOutOfBounds]. + + index = 1 ifTrue: [ + aLink nextLink: self firstLink nextLink. + firstLink := aLink. + aLink nextLink ifNil: [lastLink := aLink]. + ^ aLink]. + + previousLink := self linkAt: index - 1. + nextLink := previousLink nextLink nextLink. + + nextLink + ifNil: [aLink nextLink: self lastLink] + ifNotNil: [:link |aLink nextLink: link]. + + previousLink nextLink: aLink. + + nextLink ifNil: [ + lastLink := aLink. + aLink nextLink: nil]. + + ^ aLink! Item was added: + ----- Method: LinkedList>>collect: (in category 'enumerating') ----- + collect: aBlock + "Evaluate aBlock with each of the receiver's elements as the argument. + Collect the resulting values into a collection like the receiver. Answer + the new collection." + + | aLink newCollection | + newCollection := self class new. + aLink := firstLink. + [aLink == nil] whileFalse: + [newCollection add: (aBlock value: aLink value). + aLink := aLink nextLink]. + ^ newCollection! Item was added: + ----- Method: LinkedList>>collect:thenSelect: (in category 'enumerating') ----- + collect: collectBlock thenSelect: selectBlock + "Optimized version of SequenceableCollection>>#collect:#thenSelect:" + + | newCollection newElement | + newCollection := self class new. + self + do: [ :each | + newElement := collectBlock value: each. + (selectBlock value: newElement) + ifTrue: [ newCollection add: newElement ] ]. + ^ newCollection! Item was added: + ----- Method: LinkedList>>copyWith: (in category 'copying') ----- + copyWith: newElement + ^self copy add: newElement; yourself! Item was added: + ----- Method: LinkedList>>copyWithout: (in category 'copying') ----- + copyWithout: oldElement + |newInst| + newInst := self class new. + self do: [:each | each = oldElement ifFalse: [newInst add: each]]. + ^newInst! Item was changed: ----- Method: LinkedList>>do: (in category 'enumerating') ----- do: aBlock | aLink | aLink := firstLink. [aLink == nil] whileFalse: + [aBlock value: aLink value. - [aBlock value: aLink. aLink := aLink nextLink]! Item was changed: ----- Method: LinkedList>>first (in category 'accessing') ----- first "Answer the first link. Create an error notification if the receiver is empty." + ^ self firstLink value! - self emptyCheck. - ^firstLink! Item was added: + ----- Method: LinkedList>>firstLink (in category 'accessing') ----- + firstLink + "Answer the first link. Create an error notification if the receiver is + empty." + + self emptyCheck. + ^firstLink! Item was added: + ----- Method: LinkedList>>indexOf:startingAt:ifAbsent: (in category 'private') ----- + indexOf: anElement startingAt: start ifAbsent: exceptionBlock + "Answer the index of the first occurence of anElement after start + within the receiver. If the receiver does not contain anElement, + answer the result of evaluating the argument, exceptionBlock." + + |currentLink index| + currentLink := self linkAt: start ifAbsent: [nil]. + index := start. + [currentLink isNil ] + whileFalse: [currentLink value = anElement value ifTrue: [^index]. + currentLink := currentLink nextLink. + index := index +1]. + ^exceptionBlock value! Item was changed: ----- Method: LinkedList>>isEmpty (in category 'testing') ----- isEmpty + ^ firstLink isNil! - ^firstLink == nil! Item was changed: ----- Method: LinkedList>>last (in category 'accessing') ----- last "Answer the last link. Create an error notification if the receiver is empty." + + ^self lastLink value! - self emptyCheck. - ^lastLink! Item was added: + ----- Method: LinkedList>>lastLink (in category 'accessing') ----- + lastLink + "Answer the last link. Create an error notification if the receiver is + empty." + + self emptyCheck. + ^lastLink! Item was added: + ----- Method: LinkedList>>linkAt: (in category 'private') ----- + linkAt: index + + ^self linkAt: index ifAbsent: [ self errorSubscriptBounds: index]! Item was added: + ----- Method: LinkedList>>linkAt:ifAbsent: (in category 'private') ----- + linkAt: index ifAbsent: errorBlock + + | i | + i := 0. + self linksDo: [:link | (i := i + 1) = index ifTrue: [^ link]]. + ^ errorBlock value! Item was added: + ----- Method: LinkedList>>linkOf: (in category 'private') ----- + linkOf: anObject + + ^ self + linkOf: anObject + ifAbsent: [self error: 'No such element']! Item was added: + ----- Method: LinkedList>>linkOf:ifAbsent: (in category 'private') ----- + linkOf: anObject ifAbsent: errorBlock + + self linksDo: [:link | link value = anObject value ifTrue: [^ link]]. + ^ errorBlock value! Item was added: + ----- Method: LinkedList>>linksDo: (in category 'enumerating') ----- + linksDo: aBlock + + | aLink | + aLink := firstLink. + [aLink == nil] whileFalse: + [aBlock value: aLink. + aLink := aLink nextLink]! Item was changed: ----- Method: LinkedList>>postCopy (in category 'copying') ----- postCopy | aLink | super postCopy. + firstLink ifNotNil: [ - firstLink isNil ifFalse: [ aLink := firstLink := firstLink copy. [aLink nextLink isNil] whileFalse: [aLink nextLink: (aLink := aLink nextLink copy)]. lastLink := aLink].! Item was changed: ----- Method: LinkedList>>remove:ifAbsent: (in category 'removing') ----- + remove: aLinkOrObject ifAbsent: aBlock + "Remove aLink from the receiver. If it is not there, answer the result of evaluating aBlock." + + | link | + link := self linkOf: aLinkOrObject ifAbsent: [^aBlock value]. + self removeLink: link ifAbsent: [^aBlock value]. + ^aLinkOrObject! - remove: aLink ifAbsent: aBlock - "Remove aLink from the receiver. If it is not there, answer the result of - evaluating aBlock." - - | tempLink | - aLink == firstLink - ifTrue: [firstLink := aLink nextLink. - aLink == lastLink - ifTrue: [lastLink := nil]] - ifFalse: [tempLink := firstLink. - [tempLink == nil ifTrue: [^aBlock value]. - tempLink nextLink == aLink] - whileFalse: [tempLink := tempLink nextLink]. - tempLink nextLink: aLink nextLink. - aLink == lastLink - ifTrue: [lastLink := tempLink]]. - aLink nextLink: nil. - ^aLink! Item was added: + ----- Method: LinkedList>>removeAllSuchThat: (in category 'removing') ----- + removeAllSuchThat: aBlock + "Evaluate aBlock for each element and remove all that elements from + the receiver for that aBlock evaluates to true. For LinkedLists, it's safe to use do:." + + self do: [:each | (aBlock value: each) ifTrue: [self remove: each]]! Item was changed: ----- Method: LinkedList>>removeFirst (in category 'removing') ----- removeFirst "Remove the first element and answer it. If the receiver is empty, create an error notification." | oldLink | self emptyCheck. oldLink := firstLink. firstLink == lastLink ifTrue: [firstLink := nil. lastLink := nil] ifFalse: [firstLink := oldLink nextLink]. oldLink nextLink: nil. + ^oldLink value! - ^oldLink! Item was changed: ----- Method: LinkedList>>removeLast (in category 'removing') ----- removeLast "Remove the receiver's last element and answer it. If the receiver is empty, create an error notification." | oldLink aLink | self emptyCheck. oldLink := lastLink. firstLink == lastLink ifTrue: [firstLink := nil. lastLink := nil] ifFalse: [aLink := firstLink. [aLink nextLink == oldLink] whileFalse: [aLink := aLink nextLink]. aLink nextLink: nil. lastLink := aLink]. oldLink nextLink: nil. + ^oldLink value! - ^oldLink! Item was added: + ----- Method: LinkedList>>removeLink: (in category 'removing') ----- + removeLink: aLink + ^self removeLink: aLink ifAbsent: [self error: 'no such method!!']! Item was added: + ----- Method: LinkedList>>removeLink:ifAbsent: (in category 'removing') ----- + removeLink: aLink ifAbsent: aBlock + "Remove aLink from the receiver. If it is not there, answer the result of + evaluating aBlock." + + | tempLink | + aLink == firstLink + ifTrue: [firstLink := aLink nextLink. + aLink == lastLink + ifTrue: [lastLink := nil]] + ifFalse: [tempLink := firstLink. + [tempLink == nil ifTrue: [^aBlock value]. + tempLink nextLink == aLink] + whileFalse: [tempLink := tempLink nextLink]. + tempLink nextLink: aLink nextLink. + aLink == lastLink + ifTrue: [lastLink := tempLink]]. + "Not nilling the link enables us to delete while iterating" + "aLink nextLink: nil." + ^aLink! Item was added: + ----- Method: LinkedList>>select: (in category 'enumerating') ----- + select: aBlock + "Reimplemennt #select: for speedup on linked lists. + The super implemention accesses the linkes by index, thus causing an O(n^2)" + + | newCollection | + newCollection := self class new. + self do: [:each | (aBlock value: each) ifTrue: [newCollection add: each]]. + ^newCollection! Item was added: + ----- Method: LinkedList>>select:thenCollect: (in category 'enumerating') ----- + select: selectBlock thenCollect: collectBlock + "Optimized version of SequenceableCollection>>#select:thenCollect:" + + | newCollection | + newCollection := self class new. + self do: [ :each | (selectBlock value: each) ifTrue: [newCollection add: (collectBlock value: each)]]. + ^ newCollection! Item was added: + ----- Method: LinkedList>>swap:with: (in category 'accessing') ----- + swap: ix1 with: ix2 + "Reimplemented, super would create an infinite loop" + | minIx maxIx link1Prev link2Prev link1 link2 link1Next link2Next newLink2Next | + ((self validIndex: ix1) and: [self validIndex: ix2]) ifFalse: [^ self errorOutOfBounds]. + + "Get edge case out of the way" + ix1 = ix2 ifTrue: [^ self ]. + + "Sort indexes to make boundary-checks easier" + minIx := ix1 min: ix2. + maxIx := ix2 max: ix1. + + link1Prev := (minIx = 1) ifFalse: [self linkAt: minIx -1]. + link1 := link1Prev ifNotNil: [ link1Prev nextLink] + ifNil: [self linkAt: minIx]. + link1Next := link1 nextLink. + link2Prev := self linkAt: maxIx -1. + link2 := link2Prev nextLink. + link2Next := link2 nextLink. + + "Link at start being swapped" + link1 = firstLink ifTrue: [firstLink := link2.] ifFalse: [link1Prev nextLink: link2]. + "Link at end being swapped" + link2 = lastLink ifTrue: [lastLink := link1] ifFalse: []. + "Links being swapped adjacent" + newLink2Next := (link1 nextLink = link2) ifTrue: [link1] ifFalse: [link2Prev nextLink: link1. + link1Next]. + link1 nextLink: link2Next. + link2 nextLink: newLink2Next. + ! Item was added: + ----- Method: LinkedList>>validIndex: (in category 'private') ----- + validIndex: index + + ^ index > 0 and: [index <= self size]! Item was added: + ----- Method: Object>>asLink (in category '*collections') ----- + asLink + + ^ ValueLink value: self! Item was added: + Link subclass: #ValueLink + instanceVariableNames: 'value' + classVariableNames: '' + poolDictionaries: '' + category: 'Collections-Support'! + + !ValueLink commentStamp: 'HenrikSperreJohansen 10/18/2009 15:57' prior: 0! + A ValueLink is a Link containing a Value. + Adding an object to a LinkedList which is not a Link will create a ValueLink containing that object. + + + value - The object this link points to.! Item was added: + ----- Method: ValueLink class>>value: (in category 'instance creation') ----- + value: aValue + + ^self new value: aValue! Item was added: + ----- Method: ValueLink>>= (in category 'comparing') ----- + = anotherObject + + ^self species == anotherObject species + and: [self value = anotherObject value + and: [self nextLink == anotherObject nextLink]]! Item was added: + ----- Method: ValueLink>>hash (in category 'comparing') ----- + hash + + ^self value hash bitXor: self nextLink identityHash + ! Item was added: + ----- Method: ValueLink>>printOn: (in category 'printing') ----- + printOn: aStream + + super printOn: aStream. + aStream nextPut: $(. + value printOn: aStream. + aStream nextPut: $) + ! Item was added: + ----- Method: ValueLink>>value (in category 'accessing') ----- + value + + ^ value! Item was added: + ----- Method: ValueLink>>value: (in category 'accessing') ----- + value: anObject + + value := anObject.!

6 13

The Trunk: Kernel-eem.1052.mcz
by commits＠source.squeak.org 06 Dec '16

06 Dec '16

Eliot Miranda uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-eem.1052.mcz ==================== Summary ==================== Name: Kernel-eem.1052 Author: eem Time: 6 December 2016, 11:30:33.659177 am UUID: 925c6bf0-e0ad-483a-b0fd-a20c5efa4470 Ancestors: Kernel-ul.1051 Provide CompiledMethod>>tempNames again. Requires Tools-eem.735 =============== Diff against Kernel-ul.1051 =============== Item was added: + ----- Method: CompiledMethod>>tempNames (in category 'source code management') ----- + tempNames + ^self debuggerMap tempNamesForMethod: self!

1 0

The Trunk: Tools-eem.735.mcz
by commits＠source.squeak.org 06 Dec '16

06 Dec '16

Eliot Miranda uploaded a new version of Tools to project The Trunk: http://source.squeak.org/trunk/Tools-eem.735.mcz ==================== Summary ==================== Name: Tools-eem.735 Author: eem Time: 6 December 2016, 11:29:27.381109 am UUID: 947917cc-cfaf-4c57-a031-bc7da795846e Ancestors: Tools-topa.734 Provide a path for methods to compute their temp names. =============== Diff against Tools-topa.734 =============== Item was added: + ----- Method: DebuggerMethodMapForClosureCompiledMethods>>privateTempRefsForMethod:startpcsToBlockExtents: (in category 'private') ----- + privateTempRefsForMethod: method startpcsToBlockExtents: startpcsToBlockExtents + "Answer the sequence of temps in scope in method in the natural order, + outermost arguments and temporaries first, innermost last. Each temp is + a pair of the temp's name followed by a reference. The reference can be + integer - index of temp in aContext + #( indirectionVectorIndex tempIndex ) - remote temp in indirectionVector at index in aContext + #( outer. temp reference ) - a temp reference in an outer context." + blockExtentsToTempRefs ifNil: + [blockExtentsToTempRefs := (method holdsTempNames + ifTrue: [method] + ifFalse: [methodNode]) blockExtentsToTempsMap. + blockExtentsToTempRefs ifNil: + ["an empty method. shouldn't be able to step into here but it + can happen in weird circumstances (i.e. with MethodWrapper)." + blockExtentsToTempRefs := Dictionary new. + blockExtentsToTempRefs + at: (startpcsToBlockExtents at: method initialPC) + put: {}]. + startpcsToTempRefs := Dictionary new]. + ^startpcsToTempRefs + at: method initialPC + ifAbsentPut: + [blockExtentsToTempRefs at: (startpcsToBlockExtents at: method initialPC)]! Item was added: + ----- Method: DebuggerMethodMapForClosureCompiledMethods>>tempNamesForMethod: (in category 'accessing') ----- + tempNamesForMethod: aMethod + "Answer an Array of all the temp names in scope in aMethod starting with + the home's first local (the first argument or first temporary if no arguments)." + ^(self + privateTempRefsForMethod: aMethod + startpcsToBlockExtents: aMethod startpcsToBlockExtents) collect: + [:pair| pair first]!

1 0

Morph corner radius set to 8 does surprising things
by tim Rowledge 06 Dec '16

06 Dec '16

In a plain Squeak 5.1 image, create a RectangleMorph and use its menu to set ‘round corners’. Open the PreferenceBrowser and find the ‘Preferred Corner Radius’ - in the copy of the release 5.1-16548 I have that is ‘8’. Now drag the rectangle morph - note how the corners get replaced by funny little filled triangles instead of being rounded! Now change the preferred radius to 7. Note how the dragging works perfectly well. Try 9. Hell, try any other number. So far as I can tell only 8 causes a problem. Clearly one answer is “don’t do that” and change the default. But I’m completely baffled as to what is going on here. Why only 8? Why only when being dragged? Right now I’m not able to spot where the drag rendering might diverge. tim -- tim Rowledge; tim(a)rowledge.org; http://www.rowledge.org/tim "Bother" said Pooh as "Formating Drive C" appeared on the screen...

2 4

The Trunk: Kernel-ul.1051.mcz
by commits＠source.squeak.org 06 Dec '16

06 Dec '16

Levente Uzonyi uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-ul.1051.mcz ==================== Summary ==================== Name: Kernel-ul.1051 Author: ul Time: 6 December 2016, 6:50:56.960382 pm UUID: 15f0443e-a6cc-4c91-ba44-190ef66534c7 Ancestors: Kernel-eem.1050 - simplified Semaphore >> critical:ifLocked: - Float >> #arcTan: always return a Float + some micro-optimizations - micro-optimizations in Float >> #sign =============== Diff against Kernel-eem.1050 =============== Item was changed: ----- Method: Float>>arcTan: (in category 'mathematical functions') ----- arcTan: denominator "Answer the angle in radians. Optional. See Object documentation whatIsAPrimitive. Implementation note: use sign in order to catch cases of negativeZero" + self = 0.0 ifTrue: [ + denominator sign >= 0 ifTrue: [ ^0.0 ]. + self sign >= 0 ifTrue: [ ^Pi ]. + ^0.0 - Pi ]. + denominator = 0.0 ifTrue: [ + self > 0.0 ifTrue: [ ^Halfpi ]. + ^0.0 - Halfpi ]. + denominator > 0.0 ifTrue: [ ^(self / denominator) arcTan ]. + self > 0.0 ifTrue: [ ^(self / denominator) arcTan + Pi ]. + ^(self / denominator) arcTan - Pi! - ^self = 0.0 - ifTrue: [denominator sign >= 0 - ifTrue: [ 0 ] - ifFalse: [ self sign >= 0 - ifTrue: [ Pi ] - ifFalse: [ Pi negated ]]] - ifFalse: [denominator = 0.0 - ifTrue: [self > 0.0 - ifTrue: [ Halfpi ] - ifFalse: [ Halfpi negated ]] - ifFalse: [denominator > 0 - ifTrue: [ (self / denominator) arcTan ] - ifFalse: [self > 0 - ifTrue: [ ((self / denominator) arcTan) + Pi ] - ifFalse: [ ((self / denominator) arcTan) - Pi ]]]]! Item was changed: ----- Method: Float>>sign (in category 'mathematical functions') ----- sign "Answer 1 if the receiver is greater than 0, -1 if less than 0, else 0. Handle IEEE-754 negative-zero by reporting a sign of -1" + self > 0.0 ifTrue: [ ^1 ]. + self < 0.0 ifTrue: [ ^-1 ]. + ^0 - ((self at: 1) bitShift: -31) "-1 for negative zero, 0 otherwise"! - self > 0.0 ifTrue: [^ 1]. - (self < 0.0 or: [((self at: 1) bitShift: -31) = 1]) ifTrue: [^ -1]. - ^ 0! Item was changed: ----- Method: Semaphore>>critical:ifLocked: (in category 'mutual exclusion') ----- critical: mutuallyExcludedBlock ifLocked: alternativeBlock "Evaluate mutuallyExcludedBlock only if the receiver is not currently in the process of running the critical: message. If the receiver is, then evaluate alternativeBlock and return." "See the comment of #critical: for the explanation how this pattern works before changing the code." + 0 == excessSignals ifTrue: [ ^alternativeBlock value ]. + excessSignals := excessSignals - 1. + ^mutuallyExcludedBlock ensure: [ self signal ]! - | caught | - caught := false. - ^[ - "We're using #== here instead of #=, because it won't introduce a - suspension point, while #= may do that." - excessSignals == 0 - ifTrue: [ alternativeBlock value ] - ifFalse: [ - excessSignals := excessSignals - 1. - caught := true. - mutuallyExcludedBlock value ] ] - ensure: [ caught ifTrue: [ self signal ] ]!

1 0

Jump to page: