- Pharo-users - lists.pharo.org

[ANN] P3 version 1.3

by Sven Van Caekenberghe

Hi, There is a new release of P3, the modern, lean and mean PostgreSQL client for Pharo. https://github.com/svenvc/P3 Version 1.3 contains the following changes: - Add object logging, see the P3LogEvent hierarchy - Added P3ConnectionPool with tests - Better management of prepared statements - Add support for Chronology objects Time, Date and DateAndTime to be used directly as binding arguments for formatted/prepared statements, with tests - Added basic support for array based parameter binding, see P3ValuesArray and #printValuesArrayOn: - Better documentation and fallback for session/connection timezone and character encoder/decoder - Reimplementation of P3Error adding unique codes and #isLocal as opposed to PostreSQL server generated messages; signalling now happens with instances created by class side accessors - Bring back P3Client>>#queryEncoding as an alias for P3Client>>#serverEncoding as compatibility support for PharoDatabaseAccessor - Add P3DatabaseDriver>>#connectSSL: - Various cleanups and internal improvements https://github.com/svenvc/P3/releases/tag/v1.3 The quality of open source software is determined by it being alive, supported and maintained. The first way to help is to simply use P3 in your projects and report back about your successes and the issues that you encounter. You can ask questions on the Pharo mailing lists. I want to thank all contributors and users for their help and feedback: you make a real difference. Since the end of last year, I have been using P3 in a real commercial production context, processing 10.000s of inserts a day and successfully supporting a web application for consulting the data. Enjoy, Sven -- Sven Van Caekenberghe Proudly supporting Pharo http://pharo.org http://association.pharo.org http://consortium.pharo.org

Sept. 21, 2020

Re: where are the nills come from and how do I get rid of them

by jtuchel＠objektfabrik.de

Roelof, I guess your are taking about what you see in the inspector... There is nothing to worry about. Try inspecting wordBag asOrderedCollection and see if there are still nils. Or ask the Bad for occurencesOf: nil. It is completely normal to see nils in an Inspector on a Set or Bag. Has to do with internals of Set's and Bag's. These nils are there, but not for you ;-) Joachim Am 21.09.20 um 08:16 schrieb Roelof Wobben via Pharo-users: > Hello, > > I have to make a word count from a sentence so I did this : > > countWordsSentence: aString > Â Â Â | splitted result | > Â Â Â splitted := aString splitOn: [ :each | ', ' includes: each ]. > Â Â Â result := splitted > Â Â Â Â Â Â inject: Bag new > Â Â Â Â Â Â into: [ :wordBag :word | > Â Â Â Â Â Â Â Â Â wordBag > Â Â Â Â Â Â Â Â Â Â Â Â add: word; > Â Â Â Â Â Â Â Â Â Â Â Â yourself ]. > Â Â Â ^ result valuesAndCounts > > but now I see that the Bag is containing nills. > I tried to delete them by doing this :Â Â cleaned := result reject: > [:each | each isNil] > > but to my surprise the nills are still there, > Why is that happening and what is the best way to delete them ? > > Roelof > -- ----------------------------------------------------------------------- Objektfabrik Joachim Tuchel mailto:jtuchel@objektfabrik.de Fliederweg 1 http://www.objektfabrik.de D-71640 Ludwigsburg http://joachimtuchel.wordpress.com Telefon: +49 7141 56 10 86 0 Fax: +49 7141 56 10 86 1

Sept. 21, 2020

where are the nills come from and how do I get rid of them

by Roelof Wobben

Hello, I have to make a word count from a sentence so I did this : countWordsSentence: aString Â Â Â | splitted result | Â Â Â splitted := aString splitOn: [ :each | ', ' includes: each ]. Â Â Â result := splitted Â Â Â Â Â Â inject: Bag new Â Â Â Â Â Â into: [ :wordBag :word | Â Â Â Â Â Â Â Â Â wordBag Â Â Â Â Â Â Â Â Â Â Â Â add: word; Â Â Â Â Â Â Â Â Â Â Â Â yourself ]. Â Â Â ^ result valuesAndCounts but now I see that the Bag is containing nills. I tried to delete them by doing this :Â Â cleaned := result reject: [:each | each isNil] but to my surprise the nills are still there, Why is that happening and what is the best way to delete them ? Roelof

Sept. 21, 2020

Re: roman numbers

by Richard O'Keefe

This is a problem where the only data structures you need, other than the integer you are encoding and the string you are building, is a small number of array literals. Here is pseudo-code. If self is negative, emit a negative sign. If self is zero, emit N and finish. Let n be the absolute value of self. Emit M (n//1000) times -- use #next:put: Encode n // 100 \\ 10 using M D C. Encode n // 10 \\ 10 using C L X. Encode n \\10 using X V I To encode a digit using x v i, write the characters of #('' 'i' 'ii' 'iii' 'iv' 'v' 'vi' 'vii' 'viii' 'ix' 'x') at the digit + 1 (use #nextPutAll:). I have checked this pseudocode by writing #asRomanPrintString (2 lines including header) calling #asRomanPrintOn: (9 lines including header) and verified that each number from -4000 to +4000 gets the same result from #printStringRoman and #asRomanPrintString (except 0, which Pharo gets wrong). Now we *could* do the "encode a digit" using smaller or no tables, but it would take more code. In this case we can check that the right output for a digit is produced just by LOOKING at the table, rather than by checking complicated code. On Sat, 19 Sep 2020 at 02:13, Pablo Navarro <pablo1n7(a)gmail.com> wrote: > Hi! Maybe you can use this algorithm: > > Define a dictionary with these elements: > > 1000:'M', > 900:'CM', > 500: 'D', > 400: 'CD', > 100:"C", > 90:'XC', > 50:'L', > 40:'XL', > 10:'X', > 9:'IX', > 5:'V', > 4:'IV', > 1:'I' > > Using this dictionary (romansDic), you define a recursive function: > > toRomans(number){ > i = return the greatest key less than or equal to given key from > âromansDic' . > if (number == i ){ > return romansDic.get(number) > } > return string_concat(romansDic.get(i), toRomans(number-i)) > } > > Sorry for the pseudocode. > > Saludos Pablo. > > > El 18 de sep. de 2020 10:46 -0300, Roelof Wobben via Pharo-users < > pharo-users(a)lists.pharo.org>, escribiÃ³: > > Op 18-9-2020 om 06:45 schreef Richard O'Keefe: > > Roman numerals are much more complicated and much less consistent > than most people realise. The regular M DC LX VI system is both > more modern and less capable than anything the Romans would have > recognised. In particular, > - in the 8th century, N (short for "nulla") was adopted for zero > - the Roman system always had fractions like S for 1/2, . for 1/12 > - there were numerals for much larger numbers. > Unicode code block [2150] has characters for the Roman numerals > including > 216C L ROMAN NUMERAL FIFTY > 216D C ROMAN NUMERAL ONE HUNDRED > 216E D ROMAN NUMERAL FIVE HUNDRED > 216F M ROMAN NUMERAL ONE THOUSAND > 2181 â ROMAN NUMERAL FIVE THOUSAND > 2182 â ROMAN NUMERAL TEN THOUSAND > 2187 â ROMAN NUMERAL FIFTY THOUSAND > 2188 â ROMAN NUMERAL ONE HUNDRED THOUSAND > (In fact these are ligated versions of forms using "apostrophic" brackets; > the pattern goes as high as you want, e.g., (((|))) for a million. > D and M were originally |) and (|). There is > > So the first thing is to make sure that you understand the > requirements for the problem. > - Are you required to produce ASCII characters, required to > produce Unicode ones, or allowed to produce either? > > > as far as I can see from the tests only ASCI characters. > > - Are you required to support zero? > > > No > > - Are you required to support n/12 fractions (1<=n<=11)? > > > NO > > - Are you allowed, required, or forbidden to use the "overline" > convention, where an overline means "multiply by 1000"? > =------- > > > In the test that one is not used. > > ICCXXXIVDLXVII = 1,234,567 > - Are you allowed, required, or forbidden to use "additive" > form "IIII" as well as/instead of "subtractive" form "IV"? > - Are you to use upper case or lower case letters? > - And so on. > > > > > the number 4 needs to be "IV" > > Roelof > >

Sept. 19, 2020

Re: CV/OCR Library

by Sean P. DeNigris

Esteban A. Maringolo wrote > Thanks for the reference. I'll look into it! >> I know that Sean D has wrapped the Tesseract OCR library: >> https://github.com/seandenigris/Tesseract-St Esteban, I did a little work getting it working in Pharo 8 and adding an example. Check out `Tesseract class>>#exampleHOCR` and LMK if it fits your needs. If not, PRs are welcome ;-) FYI I'm developing in Gtoolkit at the moment, so I'm not sure if the Morphic part (e.g. inspector extensions) still works, but I think it should. What's been implemented so far in the Bloc equivalent works in latest GT, but is WIP. ----- Cheers, Sean -- Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html

Sept. 18, 2020

Telegram Bots with Pharo

by Pablo Navarro

Hi everyone, I share a tool for creatingÂ telegramÂ Bots with Pharo. This library provides an interface for theÂ Telegram Bot API. To create our telegram bot in Pharo, the first thing we need to do is to create a new object that inherits from Bottlegram. This object must define at least these three methods: â¢ slashStart: to be executed when the bot receives /start. â¢ slashHelp: to be executed when the bot receives /help. â¢ defaultText: to be executed when the bot receives an unknown command. The tool allows creating bots using two methods: â¢ Using polling: the bot check updates for an amount of time. â¢ Using webhook: Use this method to create a Teapot server to receive incoming updates via an outgoing webhook. Whenever there is an update for the bot, we received an HTTPS POST request to the specified URL Github link:Â https://github.com/pablo1n7/bottlegram If you use Telegram, do you test an echo bot inÂ https://t.me/echo_pharo_bot Saludos, Pablo.

Sept. 18, 2020

AthensCairoSDLSurface P8 Error

by Alvaro Piorno

Hello, This code that worked for P6 and P7 is now failing in P8. *AthensCairoSDLSurface fromSDLSurface: self window handle handle getWindowSurface.* the window is created like this: *window := OSWindow createWithAttributes: (OSWindowAttributes new resizable: false; yourself).* The exception is Error: Could not coerce arguments from cairo lib. Cheers

Sept. 18, 2020

Re: roman numbers

by Roelof Wobben

Sept. 18, 2020

Re: order of execution

by Steffen MÃ¤rcker

Hi, don't forget to read the expression from left to right: > currTotal := prevTotal + (prevTotal := currTotal). 5 1 4 3 2 1. the current value (X) of prevTotal is fetched. 2. the current value (Y) of currTotal is fetched 3. prevTotal is assigned currTotal which is also the value of the parenthesis 4. X is sent the message + with the argument Y 5. currTotal is assigned the result from 4. Kind regards, Steffen Am .09.2020, 15:05 Uhr, schrieb Russ Whaley <whaley.russ(a)gmail.com>: > Can someone please explain this? I'm guessing I don't understand order of > execution. > > When perusing >>fibonacciSequence, I get a proper result, but I don't > understand why when looking at the code. > > Consider this fragment... > > prevTotal := 0. > currTotal := 1. > currTotal := prevTotal + (prevTotal := currTotal). > > My understanding *was* that parentheses are executed first. > > (prevTotal := currTotal) - assigns and returns 1 > > > currTotal := prevTotal + (1) > > > and since prevTotal = 1 > > currTotal := 1 + (1) > > > prevTotal = 1. > > currTotal = 2. > > > Yet what appears to be happening is... > > prevTotal = 0 > > currTotal := 0 + (prevTotal := currTotal) > > > then the parentheses... > > currTotal := 0 + (1) > > > prevTotal = 1. > > currTotal = 1. > > > Care to school me? > > Thanks! > Russ

Sept. 18, 2020

Re: roman numbers

by Pablo Navarro

Hi! Maybe you can use this algorithm: Define a dictionary with these elements: 1000:'M', 900:'CM', 500: 'D', 400: 'CD', 100:"C", 90:'XC', 50:'L', 40:'XL', 10:'X', 9:'IX', 5:'V', 4:'IV', 1:'I' Using this dictionary (romansDic), you define a recursive function: toRomans(number){ Â i = return the greatest key less than or equal to given key from âromansDic'Â Â . Â if (number == i ){ return romansDic.get(number) } Â return string_concat(romansDic.get(i), toRomans(number-i)) } Sorry for the pseudocode. Saludos Pablo. El 18 de sep. de 2020 10:46 -0300, Roelof Wobben via Pharo-users <pharo-users(a)lists.pharo.org>, escribiÃ³: > Op 18-9-2020 om 06:45 schreef Richard O'Keefe: > > Roman numerals are much more complicated and much less consistent > > than most people realise.Â The regular M DC LX VI system is both > > more modern and less capable than anything the Romans would have > > recognised.Â In particular, > > Â - in the 8th century, N (short for "nulla") was adopted for zero > > Â - the Roman system always had fractions like S for 1/2, . for 1/12 > > Â - there were numerals for much larger numbers. > > Unicode code block [2150] has characters for the Roman numerals > > including > > 216C L ROMAN NUMERAL FIFTY > > 216D C ROMAN NUMERAL ONE HUNDRED > > 216E D ROMAN NUMERAL FIVE HUNDRED > > 216F M ROMAN NUMERAL ONE THOUSAND > > 2181 â ROMAN NUMERAL FIVE THOUSAND > > 2182 â ROMAN NUMERAL TEN THOUSAND > > 2187 â ROMAN NUMERAL FIFTY THOUSAND > > 2188 â ROMAN NUMERAL ONE HUNDRED THOUSAND > > (In fact these are ligated versions of forms using "apostrophic" brackets; > > the pattern goes as high as you want, e.g., (((|))) for a million. > > D and M were originally |) and (|).Â Â There is > > > > So the first thing is to make sure that you understand the > > requirements for the problem. > > - Are you required to produce ASCII characters, required to > > Â produce Unicode ones, or allowed to produce either? > > as far as I can see from the tests only ASCI characters. > > > - Are you required to support zero? > > No > > > - Are you required to support n/12 fractions (1<=n<=11)? > > NO > > > - Are you allowed, required, or forbidden to use the "overline" > > Â convention, where an overline means "multiply by 1000"? > > Â =------- > > In the test that one is not used. > > Â ICCXXXIVDLXVII = 1,234,567 > > - Are you allowed, required, or forbidden to use "additive" > > Â form "IIII" as well as/instead of "subtractive" form "IV"? > > - Are you to use upper case or lower case letters? > > - And so on. > > > > > > > the number 4 needs to beÂ "IV" > > Roelof >

Sept. 18, 2020