April 2017 - Pharo-users - lists.pharo.org

Re: [Pharo-users] little "challenge"

by Richard Sargent

Sorry, Stephane. Feel free to implement missing methods (or their equivalent). :-) On Apr 25, 2017, 23:39, at 23:39, Stephane Ducasse <stepharo.self(a)gmail.com> wrote: >we do not have nextOrLess: in Pharo. > >On Wed, Apr 26, 2017 at 6:19 AM, Richard Sargent <rsargent(a)5x5.on.ca> >wrote: > >> In 2003, I implemented the following method. It is something that >comes up >> from time to time. >> >> !SequenceableCollection publicMethods ! >> splitEvery: chunkSize >> "Answer a collection of sub-collections each of the specified chunk >size. >> If the receiver size is not a multiple of chunkSize, the last >> sub-collection will be shorter." >> >> | chunks stream | >> chunkSize < 1 ifTrue: [ ^self splitEvery: 1 ]. >> >> stream := ReadStream on: self. >> chunks := OrderedCollection new. >> [stream atEnd] whileFalse: [ >> chunks add: (stream nextOrLess: chunkSize). >> ]. >> >> ^chunks. >> ! ! >> >> ------------------------------ >> *From:* Pharo-users [mailto:pharo-users-bounces@lists.pharo.org] *On >> Behalf Of *Stephane Ducasse >> *Sent:* April 25, 2017 13:08 >> *To:* Any question about pharo is welcome >> *Subject:* [Pharo-users] little "challenge" >> >> #(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 >19 >> 20) >> >> -> >> >> { #(17 17 16 18 17 18 19) . #(19 19 18 19 19 20 19) . #(20 19 20 20 >20 19 >> 20)} >> >> any code? >>

April 26, 2017

Re: [Pharo-users] little "challenge"

by Stephane Ducasse

we do not have nextOrLess: in Pharo. On Wed, Apr 26, 2017 at 6:19 AM, Richard Sargent <rsargent(a)5x5.on.ca> wrote: > In 2003, I implemented the following method. It is something that comes up > from time to time. > > !SequenceableCollection publicMethods ! > splitEvery: chunkSize > "Answer a collection of sub-collections each of the specified chunk size. > If the receiver size is not a multiple of chunkSize, the last > sub-collection will be shorter." > > | chunks stream | > chunkSize < 1 ifTrue: [ ^self splitEvery: 1 ]. > > stream := ReadStream on: self. > chunks := OrderedCollection new. > [stream atEnd] whileFalse: [ > chunks add: (stream nextOrLess: chunkSize). > ]. > > ^chunks. > ! ! > > ------------------------------ > *From:* Pharo-users [mailto:pharo-users-bounces@lists.pharo.org] *On > Behalf Of *Stephane Ducasse > *Sent:* April 25, 2017 13:08 > *To:* Any question about pharo is welcome > *Subject:* [Pharo-users] little "challenge" > > #(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 19 > 20) > > -> > > { #(17 17 16 18 17 18 19) . #(19 19 18 19 19 20 19) . #(20 19 20 20 20 19 > 20)} > > any code? >

April 26, 2017

Re: [Pharo-users] little "challenge"

by Stephane Ducasse

This is fun because my method was called splitEvery: too :) On Wed, Apr 26, 2017 at 6:19 AM, Richard Sargent <rsargent(a)5x5.on.ca> wrote: > In 2003, I implemented the following method. It is something that comes up > from time to time. > > !SequenceableCollection publicMethods ! > splitEvery: chunkSize > "Answer a collection of sub-collections each of the specified chunk size. > If the receiver size is not a multiple of chunkSize, the last > sub-collection will be shorter." > > | chunks stream | > chunkSize < 1 ifTrue: [ ^self splitEvery: 1 ]. > > stream := ReadStream on: self. > chunks := OrderedCollection new. > [stream atEnd] whileFalse: [ > chunks add: (stream nextOrLess: chunkSize). > ]. > > ^chunks. > ! ! > > ------------------------------ > *From:* Pharo-users [mailto:pharo-users-bounces@lists.pharo.org] *On > Behalf Of *Stephane Ducasse > *Sent:* April 25, 2017 13:08 > *To:* Any question about pharo is welcome > *Subject:* [Pharo-users] little "challenge" > > #(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 19 > 20) > > -> > > { #(17 17 16 18 17 18 19) . #(19 19 18 19 19 20 19) . #(20 19 20 20 20 19 > 20)} > > any code? >

April 26, 2017

Re: [Pharo-users] little "challenge"

by Stephane Ducasse

Tx same comments! On Tue, Apr 25, 2017 at 10:48 PM, nacho <0800nacho(a)gmail.com> wrote: > #(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 19 > 20) > allButFirst groupsOf: 7 atATimeCollect: [ :element | element ]. > > > > ----- > Nacho > Smalltalker apprentice. > Buenos Aires, Argentina. > -- > View this message in context: http://forum.world.st/little- > challenge-tp4944073p4944079.html > Sent from the Pharo Smalltalk Users mailing list archive at Nabble.com. > >

April 26, 2017

Re: [Pharo-users] little "challenge"

by Stephane Ducasse

I did not know this one :) tx sven On Tue, Apr 25, 2017 at 10:26 PM, Sven Van Caekenberghe <sven(a)stfx.eu> wrote: > The first thing I found: > > #(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 19 20) > groupsOf: 7 atATimeCollect: [ :x | x ] > > "#(#(16 17 17 16 18 17 18) #(19 19 19 18 19 19 20) #(19 20 19 20 20 20 > 19))" > > > On 25 Apr 2017, at 22:08, Stephane Ducasse <stepharo.self(a)gmail.com> > wrote: > > > > #(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 19 > 20) > > > > -> > > > > { #(17 17 16 18 17 18 19) . #(19 19 18 19 19 20 19) . #(20 19 20 20 20 > 19 20)} > > > > any code? > > >

April 26, 2017

Re: [Pharo-users] little "challenge"

by Richard Sargent

In 2003, I implemented the following method. It is something that comes up from time to time. !SequenceableCollection publicMethods ! splitEvery: chunkSize "Answer a collection of sub-collections each of the specified chunk size. If the receiver size is not a multiple of chunkSize, the last sub-collection will be shorter." | chunks stream | chunkSize < 1 ifTrue: [ ^self splitEvery: 1 ]. stream := ReadStream on: self. chunks := OrderedCollection new. [stream atEnd] whileFalse: [ chunks add: (stream nextOrLess: chunkSize). ]. ^chunks. ! ! _____ From: Pharo-users [mailto:pharo-users-bounces@lists.pharo.org] On Behalf Of Stephane Ducasse Sent: April 25, 2017 13:08 To: Any question about pharo is welcome Subject: [Pharo-users] little "challenge" #(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 19 20) -> { #(17 17 16 18 17 18 19) . #(19 19 18 19 19 20 19) . #(20 19 20 20 20 19 20)} any code?

April 26, 2017

Re: [Pharo-users] ss3 and gemsource planned downtime today at 1:30 pm PDT (-0700 UTC)

by Dale Henrichs

server is back online... On 04/25/2017 05:28 AM, Dale Henrichs wrote: > The server hosting http://ss3.gemtalksystems.com/ and > http://seaside.gemtalksystems.com/ss will be down for a couple of > hours today starting at 1:30 pm PDT for maintenance. > > Dale >

April 26, 2017

Re: [Pharo-users] Hot to retrieve values from Nested Dictionaries

by PBKResearch

Browsing in Pharo, I found that Dictionary has a subclass KeyedTree, which is in effect a set of nested dictionaries. Retrieval is by quoting a path, which is simply an array of keys. So in your case it would read: dict1 atPath: #(âkey1â âkey2â âkey3â). This might be more efficient than repeated use of the DNU mechanism. It is not clear (to me, at least) how to construct the nested dictionaries as a KeyedTree in the first place, but this might be an alternative approach. Hope this helps Peter Kenny From: Pharo-users [mailto:pharo-users-bounces@lists.pharo.org] On Behalf Of Markus BÃ¶hm Sent: 24 April 2017 18:42 To: pharo-users(a)lists.pharo.org Subject: [Pharo-users] Hot to retrieve values from Nested Dictionaries May I ask: What's the idiomatic way to retrieve values from nested dictionaries? (((dict1 at: 'key1') at: 'key2') at: 'key3') Are all the brackets really necessary? BR Mike

April 25, 2017

Re: [Pharo-users] little "challenge"

by nacho

#(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 19 20) allButFirst groupsOf: 7 atATimeCollect: [ :element | element ]. ----- Nacho Smalltalker apprentice. Buenos Aires, Argentina. -- View this message in context: http://forum.world.st/little-challenge-tp4944073p4944079.html Sent from the Pharo Smalltalk Users mailing list archive at Nabble.com.

April 25, 2017

Re: [Pharo-users] little "challenge"

by Sven Van Caekenberghe

The first thing I found: #(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 19 20) groupsOf: 7 atATimeCollect: [ :x | x ] "#(#(16 17 17 16 18 17 18) #(19 19 19 18 19 19 20) #(19 20 19 20 20 20 19))" > On 25 Apr 2017, at 22:08, Stephane Ducasse <stepharo.self(a)gmail.com> wrote: > > #(16 17 17 16 18 17 18 19 19 19 18 19 19 20 19 20 19 20 20 20 19 20) > > -> > > { #(17 17 16 18 17 18 19) . #(19 19 18 19 19 20 19) . #(20 19 20 20 20 19 20)} > > any code?

April 25, 2017