- Pharo-dev - lists.pharo.org

Re: [Pharo-project] #at:ifAbsent: for Array(s) could be faster

by Eliot Miranda

On Wed, Nov 2, 2011 at 11:33 AM, Levente Uzonyi <leves(a)elte.hu> wrote: > On Wed, 2 Nov 2011, Igor Stasenko wrote: > > Here the original implementation, which Array inherits from >> SequenceableCollection: >> >> at: index ifAbsent: exceptionBlock >> "Answer the element at my position index. If I do not contain an >> element >> at index, answer the result of evaluating the argument, >> exceptionBlock." >> >> (index between: 1 and: self size) ifTrue: [^ self at: index]. >> ^ exceptionBlock value >> >> >> the thing is, that #at: primivite also doing a range checking and >> fails if index is invalid, so if index is valid, as result we >> performing a range checking twice instead of just once. >> >> Here the simple implementation how to make things faster: >> fat: index >> "Primitive. Assumes receiver is indexable. Answer the value of an >> indexable element in the receiver. Fail if the argument index is >> not an >> Integer or is out of bounds. Essential. See Object documentation >> whatIsAPrimitive. Read the class comment for a discussion about >> that the fact >> that the index can be a float." >> >> <primitive: 60> >> ^ #plopp >> >> fat: index ifAbsent: aBlock >> | x | >> x := (self fat: index). >> x == #plopp ifTrue: [ ^ aBlock value ]. >> ^ x >> >> And speedup is almost 2 times: >> >> [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) at: 1 ifAbsent: nil ] ] >> timeToRun >> >> 39 >> >> [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) at: 1 ifAbsent: nil ] ] >> timeToRun >> >> 20 >> >> Even when index is out of range, it is still much faster: >> >> [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) at: 100 ifAbsent: nil ] ] >> timeToRun >> >> 35 >> >> [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) fat: 100 ifAbsent: nil ] >> ] timeToRun >> >> 24 >> >> The problem, of course, that trick with #plopp is a dirty hack. >> Because if array include an #plopp object as element, it will report >> as it absent, >> instead of answering it. >> There is no way to ensure that any arbitrary object are never included >> as element in array, so this is no-go for generic replacement. >> But in controlled environment, when you know that none of arrays which >> you using with #fat:ifAbsent: will ever include #plopp (or pick your >> own unique object) >> it may be a good alternative. >> > > I've been thinking about this earlier and there's a much nicer and simpler > solution, though it requires vm changes :). The idea is to change primitive > 60 to work for 2 parameters too, so #at:ifAbsent: could also use the > primitive directly. There were a few changes about #at: recently (mirror > prims, cog), so I'm not sure it's still easy to change the primitive. > his is neat, but it wouldn't be an extension to primitive 60 but a new primitive that would ignore its top of stack. primitive 60 can operate with 2 args,when used as a mirror primitive, but then it ignores the receiver. Your usage would ignore the last argument. So choose a primitive number and I'll make it so... > > Levente > > > >> -- >> Best regards, >> Igor Stasenko. >> >> >> > -- best, Eliot

Nov. 2, 2011

Re: [Pharo-project] #at:ifAbsent: for Array(s) could be faster

by Herby VojÄÃk

what if fat would do different nasty trick, like <primitive:60> ^(thisContext callingContext argAt: 2) value ? (make up #callingContext and #argAt:, I just presume there is something like that...) The question is if it would be faster. -- View this message in context: http://forum.world.st/at-ifAbsent-for-Array-s-could-be-faster-tp3980183p398… Sent from the Pharo Smalltalk mailing list archive at Nabble.com.

Nov. 2, 2011

Re: [Pharo-project] [Pharo-users] Brainstorming on the roadmap for first Pharo Consortium Engineer :)

by Max Leske

:D Interesting! On 02.11.2011, at 18:59, Igor Stasenko wrote: > On 2 November 2011 15:42, Max Leske <maxleske(a)gmail.com> wrote: >> Static git repository of the source code of Squeak and Pharo until Squeak version 4 and Pharo 1: >> http://scg.unibe.ch/research/Pharogenesis >> https://github.com/pharogenesis >> >> The source code layout (tree of directories and files) could probably be better. But I guess one could use it as proof of concept. >> > Ah, so you will be second one :) > I meant another project in mind. There was a ?thesis? of some student > to store all source code in sql database. instead of .changes and > .source files > integrated into an image. > >> Max >> >> >> >> On 02.11.2011, at 15:27, Igor Stasenko wrote: >> >>> How about new source code management? >>> >>> In terms of: >>> - better abstraction of source code access in image >>> - create a shared repository (database) , which can be used to browse >>> the history of all source code of Pharo and its predecessor up to >>> Squeak 1.0. >>> >>> We are discussed this idea couple times, and we already having some >>> pieces of puzzle , like Ring. >>> Also, there is already a project made by someone (forgot the name) , >>> who already storing all source code in database and managing it there. >>> >>> -- >>> Best regards, >>> Igor Stasenko. >>> >> >> >> > > > > -- > Best regards, > Igor Stasenko. >

Nov. 2, 2011

Re: [Pharo-project] #at:ifAbsent: for Array(s) could be faster

by Dave Mason

On Nov 2, 2011, at 14:21, Igor Stasenko wrote: > The problem, of course, that trick with #plopp is a dirty hack. > Because if array include an #plopp object as element, it will report > as it absent, instead of answering it. > There is no way to ensure that any arbitrary object are never included > as element in array, so this is no-go for generic replacement. > But in controlled environment, when you know that none of arrays which > you using with #fat:ifAbsent: will ever include #plopp (or pick your > own unique object) it may be a good alternative. If Array class initialize said: NonUserValue := Object new then #plopp can be replaced with NonUserValue and nobody can get at it unless they really intend to (e.g. by making Array be in their classPool). ../Dave

Nov. 2, 2011

Re: [Pharo-project] #at:ifAbsent: for Array(s) could be faster

by Levente Uzonyi

On Wed, 2 Nov 2011, Igor Stasenko wrote: > Here the original implementation, which Array inherits from > SequenceableCollection: > > at: index ifAbsent: exceptionBlock > "Answer the element at my position index. If I do not contain an element > at index, answer the result of evaluating the argument, exceptionBlock." > > (index between: 1 and: self size) ifTrue: [^ self at: index]. > ^ exceptionBlock value > > > the thing is, that #at: primivite also doing a range checking and > fails if index is invalid, so if index is valid, as result we > performing a range checking twice instead of just once. > > Here the simple implementation how to make things faster: > fat: index > "Primitive. Assumes receiver is indexable. Answer the value of an > indexable element in the receiver. Fail if the argument index is not an > Integer or is out of bounds. Essential. See Object documentation > whatIsAPrimitive. Read the class comment for a discussion about that the fact > that the index can be a float." > > <primitive: 60> > ^ #plopp > > fat: index ifAbsent: aBlock > | x | > x := (self fat: index). > x == #plopp ifTrue: [ ^ aBlock value ]. > ^ x > > And speedup is almost 2 times: > > [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) at: 1 ifAbsent: nil ] ] timeToRun > > 39 > > [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) at: 1 ifAbsent: nil ] ] timeToRun > > 20 > > Even when index is out of range, it is still much faster: > > [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) at: 100 ifAbsent: nil ] ] timeToRun > > 35 > > [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) fat: 100 ifAbsent: nil ] > ] timeToRun > > 24 > > The problem, of course, that trick with #plopp is a dirty hack. > Because if array include an #plopp object as element, it will report > as it absent, > instead of answering it. > There is no way to ensure that any arbitrary object are never included > as element in array, so this is no-go for generic replacement. > But in controlled environment, when you know that none of arrays which > you using with #fat:ifAbsent: will ever include #plopp (or pick your > own unique object) > it may be a good alternative. I've been thinking about this earlier and there's a much nicer and simpler solution, though it requires vm changes :). The idea is to change primitive 60 to work for 2 parameters too, so #at:ifAbsent: could also use the primitive directly. There were a few changes about #at: recently (mirror prims, cog), so I'm not sure it's still easy to change the primitive. Levente > > -- > Best regards, > Igor Stasenko. > >

Nov. 2, 2011

[Pharo-project] #at:ifAbsent: for Array(s) could be faster

by Igor Stasenko

Here the original implementation, which Array inherits from SequenceableCollection: at: index ifAbsent: exceptionBlock "Answer the element at my position index. If I do not contain an element at index, answer the result of evaluating the argument, exceptionBlock." (index between: 1 and: self size) ifTrue: [^ self at: index]. ^ exceptionBlock value the thing is, that #at: primivite also doing a range checking and fails if index is invalid, so if index is valid, as result we performing a range checking twice instead of just once. Here the simple implementation how to make things faster: fat: index "Primitive. Assumes receiver is indexable. Answer the value of an indexable element in the receiver. Fail if the argument index is not an Integer or is out of bounds. Essential. See Object documentation whatIsAPrimitive. Read the class comment for a discussion about that the fact that the index can be a float." <primitive: 60> ^ #plopp fat: index ifAbsent: aBlock | x | x := (self fat: index). x == #plopp ifTrue: [ ^ aBlock value ]. ^ x And speedup is almost 2 times: [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) at: 1 ifAbsent: nil ] ] timeToRun 39 [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) at: 1 ifAbsent: nil ] ] timeToRun 20 Even when index is out of range, it is still much faster: [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) at: 100 ifAbsent: nil ] ] timeToRun 35 [ 1000000 timesRepeat: [ #(1 2 4 5 56 67 67) fat: 100 ifAbsent: nil ] ] timeToRun 24 The problem, of course, that trick with #plopp is a dirty hack. Because if array include an #plopp object as element, it will report as it absent, instead of answering it. There is no way to ensure that any arbitrary object are never included as element in array, so this is no-go for generic replacement. But in controlled environment, when you know that none of arrays which you using with #fat:ifAbsent: will ever include #plopp (or pick your own unique object) it may be a good alternative. -- Best regards, Igor Stasenko.

Nov. 2, 2011

Re: [Pharo-project] Small tool to edit bloc code

by Igor Stasenko

On 2 November 2011 08:46, Hilaire Fernandes <hilaire.fernandes(a)edu.ge.ch> wrote: > From DrGeo I would like the user to edit Smalltalk code in the form of > block of code. > The user interface I need is maninly to let the user write and compile > code. When compiled, DrGeo should get a notification to fetch the code > for internal use. > > What is the best candidate to do that ? hmm.. i am a bit confused by question. In morphic you need to create an editor morph and then hook on 'accept' or 'ok' button to send the text to compiler. You can use compiler's #compileNoPattern: textOrStream in: aClass context: aContext notifying: aRequestor ifFail: failBlock to compile a code without method header (doits) and then install the result at class you choose. > > Hilaire > > > -- > Education 0.2 -- http://blog.ofset.org/hilaire > > > -- Best regards, Igor Stasenko.

Nov. 2, 2011

Re: [Pharo-project] [Pharo-users] Brainstorming on the roadmap for first Pharo Consortium Engineer :)

by Igor Stasenko

On 2 November 2011 15:42, Max Leske <maxleske(a)gmail.com> wrote: > Static git repository of the source code of Squeak and Pharo until Squeak version 4 and Pharo 1: > http://scg.unibe.ch/research/Pharogenesis > https://github.com/pharogenesis > > The source code layout (tree of directories and files) could probably be better. But I guess one could use it as proof of concept. > Ah, so you will be second one :) I meant another project in mind. There was a ?thesis? of some student to store all source code in sql database. instead of .changes and .source files integrated into an image. > Max > > > > On 02.11.2011, at 15:27, Igor Stasenko wrote: > >> How about new source code management? >> >> In terms of: >> - better abstraction of source code access in image >> - create a shared repository (database) , which can be used to browse >> the history of all source code of Pharo and its predecessor up to >> Squeak 1.0. >> >> We are discussed this idea couple times, and we already having some >> pieces of puzzle , like Ring. >> Also, there is already a project made by someone (forgot the name) , >> who already storing all source code in database and managing it there. >> >> -- >> Best regards, >> Igor Stasenko. >> > > > -- Best regards, Igor Stasenko.

Nov. 2, 2011

Re: [Pharo-project] curl?

by Sven Van Caekenberghe

Sebastian, On 01 Nov 2011, at 20:50, Sebastian Sastre wrote: > how can I use curl from the image? > where is the code I should install? Why do you need curl ? (Not that curl isn't a great tool, mind you). Unless you need some feature that is not supported by any of the HTTP clients I would always use a pure Smalltalk solution: it is less hassle and you can read/manipulate the implementation. Note that there are already some people who successfully used the Zinc+Zodiac combination to do HTTPS. Regards, Sven

Nov. 2, 2011

Re: [Pharo-project] [Pharo-users] Brainstorming on the roadmap for first Pharo Consortium Engineer :)

by Max Leske

Static git repository of the source code of Squeak and Pharo until Squeak version 4 and Pharo 1: http://scg.unibe.ch/research/Pharogenesis https://github.com/pharogenesis The source code layout (tree of directories and files) could probably be better. But I guess one could use it as proof of concept. Max On 02.11.2011, at 15:27, Igor Stasenko wrote: > How about new source code management? > > In terms of: > - better abstraction of source code access in image > - create a shared repository (database) , which can be used to browse > the history of all source code of Pharo and its predecessor up to > Squeak 1.0. > > We are discussed this idea couple times, and we already having some > pieces of puzzle , like Ring. > Also, there is already a project made by someone (forgot the name) , > who already storing all source code in database and managing it there. > > -- > Best regards, > Igor Stasenko. >

Nov. 2, 2011