Squeak-dev December 2015

squeak-dev@lists.squeakfoundation.org

60 participants
161 discussions

OT: Convince me github is a wise choice
by Eliot Miranda 04 Jan '16

04 Jan '16

Hi Ben, Hi All, I'm quite conservative when it comes to relying on others' infrastructure so I need some help making me take the plunge. Please see below: On Thu, Dec 17, 2015 at 7:15 AM, Ben Coman <btc(a)openinworld.com> wrote: > > > On Wed, Dec 16, 2015 at 1:00 AM, Ben Coman <btc(a)openinworld.com> wrote: > >> > >> > >> On Wed, Dec 16, 2015 at 10:43 AM, Ryan Macnak <rmacnak(a)gmail.com> > wrote: > >> > > >> > What would be more helpful is if the VM build was fixed to work with > a cross compiler, so it would compile fast enough to test ARM and MIPS on > Travis CI alongside IA32 and X64. > >> > > >> > It would also help if the top-of-tree Intel VMs were always kept > working so we'd know which change broke something. Moving the Subversion > repository to a more reliable host (which likely means migrating to Git) > would also cut down on the false positives Travis reports because the > Subversion server has a habit of dropping connections. > >> > >> +1 github :) > > btw, Did you know that github supports subversion clients since 2011 [1]? > Here are supported features [2]. Are these sufficient for your > current svn workflows? > Potentially we could have ONE repository and those liking subversion > can stick with it and those liking git can use that. Of course, this > would need to be proven. > Ah, that's interesting. So my concern is whether github is a safe long-term bet. Specifically what is there to prevent some third party from buying github, or of github going public and the board taking the decision, or github on its own, deciding to charge for hosting, keeping the data hostage to extract payment? What safeguards are in place to prevent this? I'm not interested in "this will never happen" arguments. I'm interested in hard data please. [4] Provides pragmatic advice for cutting over. Esteban appears to > have done similar to step 1 and 2 [3] - but it seem sometimes his > modifications directly update this mirror so its not clear to see when > that branch is an *exact* copy of the current svn trunk. So I'd love > to see a github repository that is always an *exact* mirror of the svn > repository, with any pharo mods occurring in a branch off that. Even > better if the repository for svn users resides on github in place of > that mirror. > > I've been googling around for problems reported using github via an > svn client, and haven't found any smoking guns. > Is this something we can trial? I'm willing to put some effort into > it. A key requirement would be not interrupting Eliots work on > Spur-64. Potentially we could stay for months on step 3 [4] with the > CI infrastructure running on the git side, but code check-ins > continuing onthe svn side. > > btw2, [5] provides a use case for the advantages of a full switch. > > cheers -ben > > [1] https://github.com/blog/966-improved-subversion-client-support > [2] https://help.github.com/articles/support-for-subversion-clients/ > [3] https://github.com/pharo-project/pharo-vm/network > [4] > http://blogs.atlassian.com/2013/01/atlassian-svn-to-git-migration-technical… > [5] > http://blogs.atlassian.com/2013/01/svn-to-git-how-atlassian-made-the-switch… > -- _,,,^..^,,,_ best, Eliot

6 6

Delayed preference color updating
by karl ramberg 01 Jan '16

01 Jan '16

I have a issue with non modal color changing. The NewColorPicker is not modal and the method returns a value before the user click 'close' button in NewColorPicker. How can I change behavior to update color when the button is clicked? PBColorPreferenceView>>changeColor: aButton aButton changeColor. "returns the current color when not modal" self preference preferenceValue: aButton fillStyle. button label: self preference preferenceValue asString. self adjustLabelColor Best, Karl

2 4

The Inbox: Compression-jdr.48.mcz
by commits＠source.squeak.org 01 Jan '16

01 Jan '16

A new version of Compression was added to project The Inbox: http://source.squeak.org/inbox/Compression-jdr.48.mcz ==================== Summary ==================== Name: Compression-jdr.48 Author: jdr Time: 31 December 2015, 6:13:59.974 pm UUID: 7798d7c6-8f39-45cc-a3cc-e0887130a62d Ancestors: Compression-dtl.47 It solves a problem compressing a zipfile with many files (> 200), previously all files to be processed remained open, now only the file being processed is opened. =============== Diff against Compression-dtl.47 =============== Item was changed: ----- Method: ZipArchive>>writeTo: (in category 'writing') ----- writeTo: stream stream binary. members do: [ :member | member writeTo: stream. member endRead. + member close ]. writeCentralDirectoryOffset := stream position. self writeCentralDirectoryTo: stream. ! Item was changed: ----- Method: ZipArchive>>writeTo:prepending: (in category 'writing') ----- writeTo: stream prepending: aString stream binary. stream nextPutAll: aString. members do: [ :member | member writeTo: stream. member endRead. + member close ]. writeCentralDirectoryOffset := stream position. self writeCentralDirectoryTo: stream. ! Item was changed: ----- Method: ZipNewFileMember>>from: (in category 'initialization') ----- from: aFileName | entry | compressionMethod := CompressionStored. "Now get the size, attributes, and timestamps, and see if the file exists" stream := StandardFileStream readOnlyFileNamed: aFileName. self localFileName: (externalFileName := stream name). entry := stream directoryEntry. compressedSize := uncompressedSize := entry fileSize. desiredCompressionMethod := compressedSize > 0 ifTrue: [ CompressionDeflated ] ifFalse: [ CompressionStored ]. + self setLastModFileDateTimeFrom: entry modificationTime. + stream close - self setLastModFileDateTimeFrom: entry modificationTime ! Item was changed: ----- Method: ZipNewFileMember>>rewindData (in category 'private-writing') ----- rewindData super rewindData. + stream ensureOpen. readDataRemaining := stream size. stream position: 0.!

1 0

The Inbox: Collections-cmm.673.mcz
by commits＠source.squeak.org 31 Dec '15

31 Dec '15

Chris Muller uploaded a new version of Collections to project The Inbox: http://source.squeak.org/inbox/Collections-cmm.673.mcz ==================== Summary ==================== Name: Collections-cmm.673 Author: cmm Time: 31 December 2015, 4:05:21.536 pm UUID: f9f9498e-b548-443b-87fe-af21ba6e8f52 Ancestors: Collections-eem.672 Do not let FinalizationDependents become a strongly-referencing Array, and let it grow exponentially instead of linearly, because that is the best general growth strategy when one doesn't know how many will need to be created. =============== Diff against Collections-eem.672 =============== Item was changed: ----- Method: WeakArray class>>addWeakDependent: (in category 'accessing') ----- addWeakDependent: anObject FinalizationLock critical: [ | emptySlotIndex | emptySlotIndex := FinalizationDependents identityIndexOf: nil ifAbsent: [ | newIndex | newIndex := FinalizationDependents size + 1. + FinalizationDependents := (FinalizationDependents grownBy: FinalizationDependents size) as: WeakArray. - "Grow linearly" - FinalizationDependents := FinalizationDependents grownBy: 10. newIndex ]. FinalizationDependents at: emptySlotIndex put: anObject ] ifError: [ :msg :rcvr | rcvr error: msg ]!

1 0

Re: [Vm-dev] Memory leaks
by Chris Muller 31 Dec '15

31 Dec '15

Go to the "Help" | "About This System" and then select "Space Analysis". On Thu, Dec 31, 2015 at 2:36 AM, Phil (list) <pbpublist(a)gmail.com> wrote: > > I was curious if the VM has any facilities to assist in tracking down > memory leaks? (not in the VM itself, but rather in the image it is > running) The scenario that comes to mind are object reference loops > though there are likely others to consider as well. Any pointers are > appreciated. > > Thanks, > Phil

2 2

The Inbox: EToys-kfr.132.mcz
by commits＠source.squeak.org 30 Dec '15

30 Dec '15

A new version of EToys was added to project The Inbox: http://source.squeak.org/inbox/EToys-kfr.132.mcz ==================== Summary ==================== Name: EToys-kfr.132 Author: kfr Time: 30 December 2015, 5:27:24.767 pm UUID: 1f9e02c3-cc2a-48c5-9853-66ab3260436f Ancestors: EToys-cmm.131 Added some methods so UnscriptedPlayer and UnscriptedCardPlayer work with the ObjectTool =============== Diff against EToys-cmm.131 =============== Item was added: + ----- Method: UnscriptedCardPlayer class>>newVariableDocks: (in category 'as yet unclassified') ----- + newVariableDocks: dockList! Item was added: + ----- Method: UnscriptedCardPlayer class>>setNewInstVarNames: (in category 'as yet unclassified') ----- + setNewInstVarNames: listOfStrings! Item was changed: Player subclass: #UnscriptedPlayer + instanceVariableNames: 'patch' - instanceVariableNames: '' classVariableNames: '' poolDictionaries: '' category: 'Etoys-Scripting'! UnscriptedPlayer class instanceVariableNames: 'ephemeralPlayerRef'! !UnscriptedPlayer commentStamp: '<historical>' prior: 0! My instances are Player objects that have not been scripted, and which hence do not require a unique scripts dictionary, etc. As soon as the needed, I am transformed automatically into a unique subclass of Player.! UnscriptedPlayer class instanceVariableNames: 'ephemeralPlayerRef'! Item was added: + ----- Method: UnscriptedPlayer>>getPatch (in category 'access') ----- + getPatch + ^ patch! Item was added: + ----- Method: UnscriptedPlayer>>setPatch: (in category 'access') ----- + setPatch: t1 + patch := t1!

1 0

[OT] What is this called?
by Colin Putney 30 Dec '15

30 Dec '15

Hi folks, Sorry for the off-topic post. I'm posting it here because I know there are lots of high-powered comp-sci folks lurking, and I hope to benefit from their wisdom. I have in mind a simple problem. Imagine we have a data structure in the memory of some program. The exact structure it has doesn't matter, but does have structure; it's not just a buffer full of bytes. For argument's sake, we'll assume it's a tree. Our task it to copy this tree. We want to make another tree in memory that is logically equivalent to the first. This is pretty straightforward. We need to walk the tree, allocating new nodes and copying over any internal values they contain, then recursing into the children. So far so good. But what if we generalize the problem? One way to do that would be to make the copy more distant from the original. We could copy into a different address space, in another process or on another machine. We could make the copy more distant in time. Perhaps we need to reclaim the memory that our tree uses, and the reconstruct it later. This means we'll have to do IO of some kind. The simplest adaptation of our tree-walking algorithm might be to allocate space for the nodes on disk, rather than in memory. This is really simple if we have access to raw disk storage, but gets a little more complicated (and slooow) if we're using files in a file system. We can gain back some simplicity by putting all the nodes in one file, and having some kind of internal structure to the file that lets us recover the nodes and links between them. We could also allocate storage space via communicating with another process. That might be over a network, or using some kind or IPC mechanism supplied by the operating system. Once again we'll need to transmit the data within the nodes, along with some metadata describing the connections between them. We can also loosen our definition of "logically equivalent". We might want to construct an equivalent tree in a process running a different version of our program. Or another program entirely, potentially written in another programming language. This forces us to raise the level of abstraction. We can't just copy each node as a blob of raw memory, and assume that the "receiving" program will know how to interpret it. We need some semantic definitions agreed upon by the two programs, and some means of representing those semantics as byte sequences that can be copied between them. Now, this is not an intractable problem. We do it all the time. In fact, I'd say a large fraction of the code I've written in my career has been a solution to some version of this problem. I'm sure many of you can relate. :-) So what is this problem called? What theory describes the possible solutions? Are there classes of solutions that have similar trade-offs? Where can I learn more? Colin

5 11

SPARCStation 20 vs RaspberryPi
by tim Rowledge 29 Dec '15

29 Dec '15

Here’s an interesting performance comparison of a Pi vs the old SPARCStation 20 that was an object of lust back in the old days. http://eschatologist.net/blog/?p=266 tim -- tim Rowledge; tim(a)rowledge.org; http://www.rowledge.org/tim "Bother" said Pooh as he said f**k in the wrong conf.

1 0

Re: [squeak-dev] Re: #flash UI output
by Jakob Reschke 28 Dec '15

28 Dec '15

I would like to add here that neither Notepad, nor Visual Studio nor Eclipse nor Vim change the selection when the search text could not be found. Instead, they pop up modal dialogs, play an exclamation sound and/or display "pattern not found" at the bottom. So at least, it is not consistent with "the outside world" at the moment. The flash would be an unintrusive indication of that state, although its meaning only becomes clear on second thought for first time users (Well, what was that? Ah, probably there are no more occurrences.), unlike in the other editors. Since not everyone likes modal dialogs and there is no general status line in Squeak's text morphs, another alternative could be to insert "no more occurrences found" (or likewise) at the cursor position and make that selected (like the "Nothing more expected ->" which appears before unbalanced brackets when you Do or Print something in a workspace) and have it removed with the next interaction (probably complicated to implement). But I am quite sure someone will find this disrupting as well (not even sure about myself), so maybe just take it as a brainstorming idea... Is there a default means for non-disrupting UI notifications in Squeak? Marcel's Vivide has short text messages appear briefly in the lower right corner of a widget when list filtering yields no more results or is cancelled. I could imagine something like this for search string not found as well. Best regards, Jakob 2015-12-28 17:29 GMT+01:00 Taeumel, Marcel <Marcel.Taeumel(a)hpi.de>: > I think we should keep the interaction model consistent and simple. "Find > again" selects the next match or nothing if nothing matches. Modifying that > might break the (in-place) search/replace behavior. > > What about doing both: clear the selection *and* flash? > > Best, > Marcel > > > > > > -- > View this message in context: http://forum.world.st/flash-UI-output-tp4868595p4868679.html > Sent from the Squeak - Dev mailing list archive at Nabble.com. >

1 0

unblock me?
by Tobias Pape 28 Dec '15

28 Dec '15

Hi all, I'm not receiving mails from the list since Dec 23. Can someone please unblock me? Best regards -Tobias PS: Merry Christmas

2 2

Jump to page: