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

Re: [Pharo-users] [ANN] Pharo Launcher 1.9.1 released

by Christophe Demarey

Better with the right url: https://files.pharo.org/pharo-launcher/1.9.1 <https://files.pharo.org/pharo-launcher/1.9.1> > Le 8 juil. 2019 Ã 10:32, Christophe Demarey <christophe.demarey(a)inria.fr> a Ã©crit : > > Hi all, > > We are pleased to announce Pharo Launcher 1.9.1 release! > The goal of this release is to have a better Windows support. Indeed Pharo Launcher now uses a new library OSWinSubprocess (https://github.com/pharo-contributions/OSWinSubprocess <https://github.com/pharo-contributions/OSWinSubprocess>) created for Pharo Launcher needs. This library allows to create Windows processes through ffi calls to the Windows API. It uses the unicode api, allowing paths with non-ascii characters. > In the same time, we switched from OSProcess to OSSubprocess (Linux and OS X) that is now the preferred library to use to fork processes on Linux-based systems. > > This release is not yet the default download of Pharo Launcher on Pharo web site because we want more feedback before promoting it. > Please use this link to install it: https://files.pharo.org/pharo-launcher/1.9 <https://files.pharo.org/pharo-launcher/1.9> and let us know if this version works fine/better for you. > > ps: For now, the binary is not signed but it will come soon. > ps2: Thanks to Keldon Alleyne for his PR on Pharo Launcher offering the first FFI binding to Windows process API > > Regards, > The Pharo team. >

July 8, 2019

Re: [Pharo-users] Testing "Weekly Digest" for GitHub

by Marcus Denker

> On 8 Jul 2019, at 11:34, Marcus Denker <marcus.denker(a)inria.fr> wrote: > > if you want to be listed in the contributors section of the weekly report, > you can just do a pull request for one of the easy issues: > > https://github.com/pharo-project/pharo/issues?q=is%3Aissue+is%3Aopen+label%… <https://github.com/pharo-project/pharo/issues?q=is%3Aissue+is%3Aopen+label%…> > This can be nice small personal goal âI want to be listed in every weekly GitHub report as a Contributor until Pharo8 is releasedâ remember, you do not have to do muchâ¦ one tiny PR that improves or fixes *something*, it can be extremely trivial. Marcus

July 8, 2019

Re: [Pharo-users] Testing "Weekly Digest" for GitHub

by Marcus Denker

if you want to be listed in the contributors section of the weekly report, you can just do a pull request for one of the easy issues: https://github.com/pharo-project/pharo/issues?q=is%3Aissue+is%3Aopen+label%… > On 8 Jul 2019, at 10:51, Marcus Denker <marcus.denker(a)inria.fr> wrote: > > > >> On 8 Jul 2019, at 10:49, Marcus Denker <marcus.denker(a)inria.fr <mailto:marcus.denker@inria.fr>> wrote: >> >> Hi, >> >> There is a ProBot that creates an issue with a weekly summary. >> >> By installing it for testing, we got the first report: >> >> Weekly Digest (1 July, 2019 - 8 July, 2019) >> https://github.com/pharo-project/pharo/issues/381 <https://github.com/pharo-project/pharo/issues/381> >> > > Link is: > > https://github.com/pharo-project/pharo/issues/3814 <https://github.com/pharo-project/pharo/issues/3814> > >

July 8, 2019

Re: [Pharo-users] Testing "Weekly Digest" for GitHub

by Marcus Denker

> On 8 Jul 2019, at 10:49, Marcus Denker <marcus.denker(a)inria.fr> wrote: > > Hi, > > There is a ProBot that creates an issue with a weekly summary. > > By installing it for testing, we got the first report: > > Weekly Digest (1 July, 2019 - 8 July, 2019) > https://github.com/pharo-project/pharo/issues/381 > Link is: https://github.com/pharo-project/pharo/issues/3814 <https://github.com/pharo-project/pharo/issues/3814>

July 8, 2019

Testing "Weekly Digest" for GitHub

by Marcus Denker

Hi, There is a ProBot that creates an issue with a weekly summary. By installing it for testing, we got the first report: Weekly Digest (1 July, 2019 - 8 July, 2019) https://github.com/pharo-project/pharo/issues/381 I will do some fine-tuning (e.g. disable commits and star-gazers) later. We then can let it run for some weeks and see if it is useful or not. Marcus

July 8, 2019

[ANN] Pharo Launcher 1.9.1 released

by Christophe Demarey

Hi all, We are pleased to announce Pharo Launcher 1.9.1 release! The goal of this release is to have a better Windows support. Indeed Pharo Launcher now uses a new library OSWinSubprocess (https://github.com/pharo-contributions/OSWinSubprocess <https://github.com/pharo-contributions/OSWinSubprocess>) created for Pharo Launcher needs. This library allows to create Windows processes through ffi calls to the Windows API. It uses the unicode api, allowing paths with non-ascii characters. In the same time, we switched from OSProcess to OSSubprocess (Linux and OS X) that is now the preferred library to use to fork processes on Linux-based systems. This release is not yet the default download of Pharo Launcher on Pharo web site because we want more feedback before promoting it. Please use this link to install it: https://files.pharo.org/pharo-launcher/1.9 <https://files.pharo.org/pharo-launcher/1.9> and let us know if this version works fine/better for you. ps: For now, the binary is not signed but it will come soon. ps2: Thanks to Keldon Alleyne for his PR on Pharo Launcher offering the first FFI binding to Windows process API Regards, The Pharo team.

July 8, 2019

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

by ducasse

bfs: aValue => findBreadthFirst: aValue dfs: info node: aNode => findDeepFirst: aValue startingFrom: aNode

July 8, 2019

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

by ducasse

> On 8 Jul 2019, at 05:57, ducasse <stepharo(a)netcourrier.com> wrote: > > More feedback :) > > Do not return nil > Check the last lecture of the mooc > > Did you read Pharo with Style? > > I do not know if LinkedList is the one of the system used by Process but in that case use the alternate implementation. Sorry Iâ still jet lagged and sleepy But - bfs: is a bad name. - Also why not having a block to specify what we are looking for? > > > bfs: info > "Breadth fisrt search for an information. If there is no key containing given infomration returns nil. If the info is found returns a node containing it" > | queue | > self isEmpty > ifTrue: [ ^nil ]. > queue := LinkedList new. > queue addLast: self root. > > [ queue isNotEmpty ] whileTrue: [ > | node | > node := queue removeFirst. > node key == info > ifTrue: [ ^node ]. > node leftChild isNotNil > ifTrue: [ queue addLast: node leftChild ]. > node rightChild isNotNil > ifTrue: [ queue addLast: node rightChild ]. > ]. > ^nil. > > => > > bfs: info > "Breadth fisrt search for an information. If there is no key containing given infomration returns nil. If the info is found returns a node containing it" > | queue | > self isEmpty ifTrue: [ ^ self ]. > queue := LinkedList new. > queue addLast: self root. > > [ queue isNotEmpty ] whileTrue: [ > | node | > node := queue removeFirst. > node key == info > ifTrue: [ ^node ]. > node leftChild isNotNil > ifTrue: [ queue addLast: node leftChild ]. > node rightChild isNotNil > ifTrue: [ queue addLast: node rightChild ]. > ]

July 8, 2019

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

by ducasse

More feedback :) Do not return nil Check the last lecture of the mooc Did you read Pharo with Style? I do not know if LinkedList is the one of the system used by Process but in that case use the alternate implementation. bfs: info "Breadth fisrt search for an information. If there is no key containing given infomration returns nil. If the info is found returns a node containing it" | queue | self isEmpty ifTrue: [ ^nil ]. queue := LinkedList new. queue addLast: self root. [ queue isNotEmpty ] whileTrue: [ | node | node := queue removeFirst. node key == info ifTrue: [ ^node ]. node leftChild isNotNil ifTrue: [ queue addLast: node leftChild ]. node rightChild isNotNil ifTrue: [ queue addLast: node rightChild ]. ]. ^nil. => bfs: info "Breadth fisrt search for an information. If there is no key containing given infomration returns nil. If the info is found returns a node containing it" | queue | self isEmpty ifTrue: [ ^ self ]. queue := LinkedList new. queue addLast: self root. [ queue isNotEmpty ] whileTrue: [ | node | node := queue removeFirst. node key == info ifTrue: [ ^node ]. node leftChild isNotNil ifTrue: [ queue addLast: node leftChild ]. node rightChild isNotNil ifTrue: [ queue addLast: node rightChild ]. ]

July 8, 2019

Re: [Pharo-users] [GSoC blog post] Binary Search Trees

by ducasse

> On 8 Jul 2019, at 05:51, ducasse <stepharo(a)netcourrier.com> wrote: > > > >> On 7 Jul 2019, at 23:12, Smiljana Knezev <smilja.knezev(a)gmail.com <mailto:smilja.knezev@gmail.com>> wrote: >> >> Dear all, >> >> I've written about implementing binary search trees: https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinP… <https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinP…> >> >> Feedback and opinions is always welcome :) > > pay attention to the formatting of your code. > It makes is difficult to read (I do not know if this is wordpress effect or not). > > Once you have your tree implementation and tests I would really like to see if you can get another implementation and measure > the impact of introducing a NullNode to remove all the isNil checks. Also no need of extra parentheses between binary and keywords depth:aNode "Returns depth of a tree starting from the given node" | leftDepth rightDepth | leftDepth := -1. aNode leftChild isNotNil ifTrue: [ leftDepth := self depth: aNode leftChild ]. rightDepth := -1. aNode rightChild isNotNil ifTrue: [ rightDepth := self depth: aNode rightChild ]. ( leftDepth > rightDepth ) ifTrue: [ ^ (1 + leftDepth) ] ifFalse: [^ (1 + rightDepth ) ]. => leftDepth > rightDepth ifTrue: [ ^ 1 + leftDepth ] ifFalse: [^ 1 + rightDepth ]. And even better move out of block returns when possible ^ leftDepth > rightDepth ifTrue: [ 1 + leftDepth ] ifFalse: [ 1 + rightDepth ]. With a nullNode the code should look like depth:aNode "Returns depth of a tree starting from the given nodeâ | leftDepth rightDepth | leftDepth := self depth: aNode leftChild. rightDepth := self depth: aNode rightChild. ^ leftDepth > rightDepth ifTrue: [ 1 + leftDepth ] ifFalse: [1 + rightDepth ] > > >> >> Best regards, >> Smiljana Knezev >

July 8, 2019