August 2019 - Pharo-users - lists.pharo.org

Re: [Pharo-users] Putting checkboxes in ListPresenter

by Renaud de Villemeur

Hi Steve. This is not at all a naive question. This is partly showned in the advance part of spec, and as it said: "ListModel can show more than just text, it can also visualize any kind of widget." Here is how you could do a static list of checkBox: In your initializeWidget method, create your checkbox: item1 := self newCheckBox label: 'label1'; help: 'help1'; yourself. item2 := self newCheckBox label: 'label2; help: 'help2'; yourself. item3 := self newCheckBox label: 'label3'; help: 'help3'; yourself. You can then create and display your list: projectList := (self instantiate: ListPresenter) displayBlock: [ :x | x buildWithSpec ]; items: {item1 . item2 . item3}; yourself. And your defaultSpec can be as simple as: defaultSpec [ ^ SpecLayout composed add: #projectList; yourself ] Hope this helps. Renaud Le sam. 24 aoÃ»t 2019 Ã 14:53, Steve Quezadas <steveeq1(a)gmail.com> a Ã©crit : > Guys, > > I am learning this new "spec" thing. I created a simple Spec "list" object > with the following code: > arbitraryList := ListPresenter new. > arbitraryList > items: #('one' 'two' 'three' 'four. . .'); > title: 'Arbitrary list'. > arbitraryList openWithSpec. > > Which creates a simple list like follows: > https://steverstuff.s3.amazonaws.com/arbitrary_list.png > > Is there any way to make a SpecPresenter object with an arbitrary list of > checkboxes? Kind of like a check-off list? > > What is the best way of doing this? Should I put checkbox objects in the > "items:" selector? Or is there another way to do it? > > Please forgive the naive question. >

Aug. 25, 2019

Putting checkboxes in ListPresenter

by Steve Quezadas

Guys, I am learning this new "spec" thing. I created a simple Spec "list" object with the following code: arbitraryList := ListPresenter new. arbitraryList items: #('one' 'two' 'three' 'four. . .'); title: 'Arbitrary list'. arbitraryList openWithSpec. Which creates a simple list like follows: https://steverstuff.s3.amazonaws.com/arbitrary_list.png Is there any way to make a SpecPresenter object with an arbitrary list of checkboxes? Kind of like a check-off list? What is the best way of doing this? Should I put checkbox objects in the "items:" selector? Or is there another way to do it? Please forgive the naive question.

Aug. 24, 2019

Re: [Pharo-users] [ANN] Iterators

by Steffen MÃ¤rcker

Hi Julien, nice work! Could you please tell how your approach is related to transducers from the user perspective and technically? (https://github.com/Pharophile/Transducers) Your example suggests that the API is quite similar to the data flow API of transducers. Let me show your example using transducers. > result := (#+ init: 0) <~ [:x | x * 2] map <~ #(1 2 3). > OrderedCollection with: result. Or the more classical way: > result := #(1, 2, 3) > transduce: [:x | x * 2] map > reduce: #+ > init: 0. > OrderedCollection with: result. Best regards, Steffen

Aug. 24, 2019

Re: [Pharo-users] Finding replacements for deprecated functions

by Steve Quezadas

Ok, so with, for example, "SpecColumnLayout", how would I find the new method selector to use? On Mon, Aug 19, 2019 at 11:34 AM Cyril Ferlicot <cyril.ferlicot(a)gmail.com> wrote: > > > On Mon 19 Aug 2019 at 20:30, Steve Quezadas <steveeq1(a)gmail.com> wrote: > >> I am experimenting with smalltalk. Sometimes a function gets >> deprecated and is crossed out. Is there a "smalltalk way" of finding >> the equivalent replacement function? >> > Hello, > > Most of the time the deprecation explains what is the new way directly. > If itâs a change in the API with an equivalent method, it will be the one > called in the deprecated method that should now be called. > > For more complex cases, if you donât know the equivalent I guess the > easiest way is to ask the community on this ML. > -- > Cyril Ferlicot > https://ferlicot.fr >

Aug. 24, 2019

Re: [Pharo-users] [ANN] Iterators

by Herby VojÄÃk

On 23. 8. 2019 19:23, Herby VojÄÃk wrote:> On 23. 8. 2019 16:14, Julien wrote: >> Hello, >> >> I wanted to have an iterator framework for Pharo for a long time. >> >> So I started building it step by step and today I think that, while it >> still requires more documentation, it is ready to be announced and >> used by others. >> >> I present you Iterators : https://github.com/juliendelplanque/Iterators >> >> The idea is that, as described by the iterator design pattern, any >> object that needs to be walked provides one or many iterators. >> >> In the library, #iterator method is the convention to get the default >> iterator of any object (if it has one). >> >> Iterators provides a DSL to deal with iterators combination. >> >> It is inspired from shellâs streams manipulation syntax: >> >> - The pipe "|" allows one to chain iterators >> - The ">" allows one to create a new collection with data transformed >> through chained iterators >> - The ">>" allows one to fill an existing collection with data >> transformed through chained iterators >> For example, one can write: >> >> iterator := #(1 2 3) iterator. >> iterator >> | [ :x | x * 2 ] collectIt >> | [ :x :y | x + y ] reduceIt >> > Array "#(12)" > > Isn't this something readStream should provide? > > str := #(1 2 3) readStream. > str > | [ :x | x * 2 ] collectIt > | [ :x :y | x + y ] reduceIt > > Array "#(12)" > > It is an object from which you take the front element, one at a time. > > Why have something very similar with different name? > > Herby Now that I think about it, the problem may be a nomenclature. This is my understanding, fix me if I am mistaken: There are pull-based and push-based sequences out there. In Smalltalk it can be said a sequence is pull-based if it has #next and #atEnd; it is push-based if it has #do:. AFAICT the tools to read pull-based sequence is called an iterator, and it can have transformations like filter, map etc., sometimes called "ix". The approach to transform push-based sequence (called observable) is called reactive programming ("rx"). It seems you create rx-like library, but called the object iterator. Maybe the set of operations you provide should be define for both push-based and pull-based sequences, and called names that conform to common canon. Herby

Aug. 23, 2019

Re: [Pharo-users] [ANN] Iterators

by Herby VojÄÃk

On 23. 8. 2019 16:14, Julien wrote: > Hello, > > I wanted to have an iterator framework for Pharo for a long time. > > So I started building it step by step and today I think that, while it > still requires more documentation, it is ready to be announced and used > by others. > > I present you Iterators : https://github.com/juliendelplanque/Iterators > > The idea is that, as described by the iterator design pattern, any > object that needs to be walked provides one or many iterators. > > In the library, #iterator method is the convention to get the default > iterator of any object (if it has one). > > Iterators provides a DSL to deal with iterators combination. > > It is inspired from shellâs streams manipulation syntax: > > - The pipe "|" allows one to chain iterators > - The ">" allows one to create a new collection with data transformed > through chained iterators > - The ">>" allows one to fill an existing collection with data > transformed through chained iterators > For example, one can write: > > iterator := #(1 2 3) iterator. > iterator > | [ :x | x * 2 ] collectIt > | [ :x :y | x + y ] reduceIt > > Array "#(12)" Isn't this something readStream should provide? str := #(1 2 3) readStream. str | [ :x | x * 2 ] collectIt | [ :x :y | x + y ] reduceIt > Array "#(12)" It is an object from which you take the front element, one at a time. Why have something very similar with different name? Herby > Or > > iterator := #(1 2 3) iterator. > collectionToFill := OrderedCollection new. > iterator > | [ :x | x * 2 ] collectIt > | [ :x :y | x + y ] reduceIt > > collectionToFill. > collectionToFill "anOrderedCollection(12)" > > The equivalent of "/dev/null" in Linux also exists: > > iterator := #(1 2 3) iterator. > iterator > | [ :x | x * 2 ] collectIt > | [ :object | object logCr ] doIt "Just print incoming objects in > transcript." > > NullAddableObject "Special object that ignore incoming objects." > > There are documentation and examples on the GitHub repository. > > â > > Initially, the goal was to avoid to duplicate all collectionâs iterator > methods (e.g. #collect:, #select:, etc) in composite objects. > > Thus, it provides an IteratorWithCollectionAPI which wrap an iterator > and provides all the methods we want (#collect:, #select:, â¦). > > Via IteratorWithCollectionAPI, your objects automatically gets the > Collection API, you just need to access it via #iterator message: > > myObject iterator select: [ :x | x isFoo ] > > This is another way to use the framework, just to avoid code duplication. > > â > > Future work is to provide the possibility to have iterator with multiple > inputs. > > I already have an undocumented prototype on the repository that works > like this: > > it1 := (1 to: 10) iterator. > it2 := (1 to: 10) iterator. > it1 & it2 > | [ :x :y | x@y ] mergeIt > > Array. "{(1@1). (2@2). (3@3). (4@4). (5@5). (6@6). (7@7). (8@8). > (9@9). (10@10)}" > > > Yes, "&" operator will again kind of mimic the one from the shell. > > â > > Hope it helps other people. > > Feedback is welcome. > > Cheers, > > Julien > > --- > Julien Delplanque > Doctorant Ã lâUniversitÃ© de Lille > http://juliendelplanque.be/phd.html > Equipe Rmod, Inria > BÃ¢timent B 40, Avenue Halley 59650Â VilleneuveÂ d'Ascq > NumÃ©ro de tÃ©lÃ©phone: +333 59 35 86 40 >

Aug. 23, 2019

Re: [Pharo-users] [ANN] Iterators

by Kasper Ãsterbye

Hi This is supercool! I had been wondering myself of the lack of such a library. The Xtreams seem to be a bit related, but they focus on IO more that map/reduce programming. I am intrigued by your choice of argument-less methods (reduceIt, collectIt,â¦). I would most likely have opted for a syntax in the style of ((iterator collect: [â¦]) select: [â¦]) groupBy: [..] etc Your syntax do away with the parenthesis hell. I like that aspect. Do you see a connection to the database query (linq like) thing, working towards the same api for the iterators and queries ? Going that direction might also enable some more advanced ideas for the & operator (more akin to join). Cool stuff Julien! Best, Kasper On 23 August 2019 at 16.15.31, Julien (julien.delplanque(a)inria.fr) wrote: Hello, I wanted to have an iterator framework for Pharo for a long time. So I started building it step by step and today I think that, while it still requires more documentation, it is ready to be announced and used by others. I present you Iterators : https://github.com/juliendelplanque/Iterators The idea is that, as described by the iterator design pattern, any object that needs to be walked provides one or many iterators. In the library, #iterator method is the convention to get the default iterator of any object (if it has one). Iterators provides a DSL to deal with iterators combination. It is inspired from shellâs streams manipulation syntax: - The pipe "|" allows one to chain iterators - The ">" allows one to create a new collection with data transformed through chained iterators - The ">>" allows one to fill an existing collection with data transformed through chained iterators For example, one can write: iterator := #(1 2 3) iterator. iterator | [ :x | x * 2 ] collectIt | [ :x :y | x + y ] reduceIt > Array "#(12)" Or iterator := #(1 2 3) iterator. collectionToFill := OrderedCollection new. iterator | [ :x | x * 2 ] collectIt | [ :x :y | x + y ] reduceIt > collectionToFill. collectionToFill "anOrderedCollection(12)" The equivalent of "/dev/null" in Linux also exists: iterator := #(1 2 3) iterator. iterator | [ :x | x * 2 ] collectIt | [ :object | object logCr ] doIt "Just print incoming objects in transcript." > NullAddableObject "Special object that ignore incoming objects." There are documentation and examples on the GitHub repository. â Initially, the goal was to avoid to duplicate all collectionâs iterator methods (e.g. #collect:, #select:, etc) in composite objects. Thus, it provides an IteratorWithCollectionAPI which wrap an iterator and provides all the methods we want (#collect:, #select:, â¦). Via IteratorWithCollectionAPI, your objects automatically gets the Collection API, you just need to access it via #iterator message: myObject iterator select: [ :x | x isFoo ] This is another way to use the framework, just to avoid code duplication. â Future work is to provide the possibility to have iterator with multiple inputs. I already have an undocumented prototype on the repository that works like this: it1 := (1 to: 10) iterator. it2 := (1 to: 10) iterator. it1 & it2 | [ :x :y | x@y ] mergeIt > Array. "{(1@1). (2@2). (3@3). (4@4). (5@5). (6@6). (7@7). (8@8). (9@9). (10@10)}" Yes, "&" operator will again kind of mimic the one from the shell. â Hope it helps other people. Feedback is welcome. Cheers, Julien --- Julien Delplanque Doctorant Ã lâUniversitÃ© de Lille http://juliendelplanque.be/phd.html Equipe Rmod, Inria BÃ¢timent B 40, Avenue Halley 59650 Villeneuve d'Ascq NumÃ©ro de tÃ©lÃ©phone: +333 59 35 86 40

Aug. 23, 2019

Re: [Pharo-users] [ANN] Iterators

by Julien

I made a mistake in the following snippet: > Le 23 aoÃ»t 2019 Ã 16:14, Julien <julien.delplanque(a)inria.fr> a Ã©crit : > > iterator := #(1 2 3) iterator. > collectionToFill := OrderedCollection new. > iterator > | [ :x | x * 2 ] collectIt > | [ :x :y | x + y ] reduceIt > > collectionToFill. > collectionToFill "anOrderedCollection(12)" ">>" operator needs to be used here, so the correct code is: iterator := #(1 2 3) iterator. collectionToFill := OrderedCollection new. iterator | [ :x | x * 2 ] collectIt | [ :x :y | x + y ] reduceIt >> collectionToFill. collectionToFill "anOrderedCollection(12)" Julien

Aug. 23, 2019

[ANN] Iterators

by Julien

Hello, I wanted to have an iterator framework for Pharo for a long time. So I started building it step by step and today I think that, while it still requires more documentation, it is ready to be announced and used by others. I present you Iterators : https://github.com/juliendelplanque/Iterators <https://github.com/juliendelplanque/Iterators> The idea is that, as described by the iterator design pattern, any object that needs to be walked provides one or many iterators. In the library, #iterator method is the convention to get the default iterator of any object (if it has one). Iterators provides a DSL to deal with iterators combination. It is inspired from shellâs streams manipulation syntax: - The pipe "|" allows one to chain iterators - The ">" allows one to create a new collection with data transformed through chained iterators - The ">>" allows one to fill an existing collection with data transformed through chained iterators For example, one can write: iterator := #(1 2 3) iterator. iterator | [ :x | x * 2 ] collectIt | [ :x :y | x + y ] reduceIt > Array "#(12)" Or iterator := #(1 2 3) iterator. collectionToFill := OrderedCollection new. iterator | [ :x | x * 2 ] collectIt | [ :x :y | x + y ] reduceIt > collectionToFill. collectionToFill "anOrderedCollection(12)" The equivalent of "/dev/null" in Linux also exists: iterator := #(1 2 3) iterator. iterator | [ :x | x * 2 ] collectIt | [ :object | object logCr ] doIt "Just print incoming objects in transcript." > NullAddableObject "Special object that ignore incoming objects." There are documentation and examples on the GitHub repository. â Initially, the goal was to avoid to duplicate all collectionâs iterator methods (e.g. #collect:, #select:, etc) in composite objects. Thus, it provides an IteratorWithCollectionAPI which wrap an iterator and provides all the methods we want (#collect:, #select:, â¦). Via IteratorWithCollectionAPI, your objects automatically gets the Collection API, you just need to access it via #iterator message: myObject iterator select: [ :x | x isFoo ] This is another way to use the framework, just to avoid code duplication. â Future work is to provide the possibility to have iterator with multiple inputs. I already have an undocumented prototype on the repository that works like this: it1 := (1 to: 10) iterator. it2 := (1 to: 10) iterator. it1 & it2 | [ :x :y | x@y ] mergeIt > Array. "{(1@1). (2@2). (3@3). (4@4). (5@5). (6@6). (7@7). (8@8). (9@9). (10@10)}" Yes, "&" operator will again kind of mimic the one from the shell. â Hope it helps other people. Feedback is welcome. Cheers, Julien --- Julien Delplanque Doctorant Ã lâUniversitÃ© de Lille http://juliendelplanque.be/phd.html Equipe Rmod, Inria BÃ¢timent B 40, Avenue Halley 59650 Villeneuve d'Ascq NumÃ©ro de tÃ©lÃ©phone: +333 59 35 86 40

Aug. 23, 2019

[ANN] pre-release voyage 1.6

by Norbert Hartl

I made a pre-release for voyage 1.6 at https://github.com/pharo-nosql/voyage/releases/tag/1.6 <https://github.com/pharo-nosql/voyage/releases/tag/1.6> It enables to usage in pharo8. Also included is a first preview of using ArangoDB [1] with voyage [1] https://www.arangodb.com <https://www.arangodb.com/> Norbert

Aug. 23, 2019