Pharo-dev
By thread
pharo-dev@lists.pharo.org
By month
Messages by month
- ----- 2026 -----
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2025 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2024 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2023 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2022 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2021 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2020 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2019 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2018 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2017 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2016 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2015 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2014 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2013 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2012 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2011 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2010 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2009 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2008 -----
- December
- November
- October
- September
- August
- July
- June
- May
- 3 participants
- 144636 messages
Re: [Pharo-dev] Hosting the Pharo VM on MirageOS
by Alain Rastoul
Le 15/01/2015 20:58, Joerg Beekmann, DeepCove Labs a écrit :
>
>
>>>
>>>> -----Original Message-----
>>>> From: Pharo-dev [mailto:pharo-dev-bounces@lists.pharo.org] On Behalf
>>>> Of Alain Rastoul
>>>> Sent: Wednesday, January 14, 2015 10:39 PM
>>>> To: pharo-dev(a)lists.pharo.org
>>>> Subject: Re: [Pharo-dev] Hosting the Pharo VM on MirageOS
>>>>
>>>> Le 15/01/2015 03:08, Joerg Beekmann, DeepCove Labs a écrit :
>>>>>
>>>>> I was not planning specializing the VM for the image. But rather
>>>>> link in a VM with everything needed to run a range of images. The
>>>>> dependencies are handled by creating an OCAML module that expresses
>>>> these and the VM code then lives in the module. The OCAML dependence
>>>> analyser (a sat solver) then ensures those are satisfied.
>>>>>
>>>> But if you don't have a specialized smalltalk vm and image, you will
>>>> have to embed full system dependencies, in order to build a full
>>>> working smalltalk system (having most part not working could be a
>>>> very bad thing), and then you loose the unikernel approach benefits
>>>> (very lean dedicated system, small attack surface etc.).
>>> My implicit assumption was that these VM would be designed for running
>> headless web-services on smaller EC2 instances. And perhaps naively was
>> thinking that the number of system dependencies would be quite low:
>>>
>>> - memory
>>> - CPU
>>> - networking stack
>>> - http/https
>>>
>>> - no file system but access to block storage (or perhaps even link
>>> image in so no storage at all)
>>> - mirage is single threaded with green threads so no
>>> multithreading/processing
>>
>> Honestly, the VM is not that large. There are not many variation points on that
>> level.
>> Where you want specialization is the *image*.
>
> Thanks Marcus - good to know
>
>>
>> Marcus
>
>
>
Yes, the vm is not so big, and specialization has to be done in the image.
But there is a key point to mention about openmirage : if it started as
unix (or linux, don't know), it is not linux at all as I understand it
See chapter 3
http://queue.acm.org/detail.cfm?id=2566628
" ... The last compilation strategy drops the dependency on Unix
entirely and recompiles the MirNet module to link directly to a Xen
network driver, which in turn pulls in all the dependencies it needs to
boot on Xen. This progressive recompilation is key to the usability of
MirageOS, ... etc"
The compilation process produce a single compiled unit that includes
your application linked with the needed libraries, ie: the
kernel+application, there is no linux kernel and no processes at all.
Even driver's code is linked to you application.
It can be booted in a Xen guest vm like PharoNOS, Linux tiny core
or others linux but ...
I see a completely different animal is here :)
if I'm wrong, please correct me
NB: Is this thread about pharo devel ?
or should it be moved to pharo-users ?
--
Regards,
Alain
Jan. 15, 2015
Re: [Pharo-dev] Implementing lazy loading for expandable collections (part 2)
by Alexandre Bergel
Hi Jimmie,
You are having a micro-benchmark here. It is dangerous to judge the performance of a language with a simple benchmark :-)
With AstroCloud [*] we handle very large images with consume a sizable memory portion. We indeed had to carefully think about some crucial parts to make AstroCloud fast. However, it was not complex at all to do.
So, Pharo is not as fast as other languages. However, I believe it does not matter that much in many situations. And when performance really matters, then you can always write portion of the code (actually a couple of short methods) in C.
Cheers,
Alexandre
[*] http://astrocloudy.wordpress.com
> On Jan 15, 2015, at 3:46 PM, Jimmie Houchin <jlhouchin(a)gmail.com> wrote:
>
> I do not understand what is happening here.
>
> oc := OrderedCollection new: 10000.
> oc size. "0"
>
> a := Array new: 10000.
> a size. "10000"
>
> So it seems that the #new: isn't creating an OrderedCollection of the size we pass in.
>
> I discovered this when I attempted to do the identical test but with an Array instead of an OrderedCollection. Since the Array doesn't #add: I had to change the code to #at:put:.
>
> When I noticed all of the OC code did #add: even if supposedly setting its size to 10000(0). I tried to use #at:put: in the OrderedCollection but it failed because their was no index 1, because the size was still 0.
>
> I naively would have thought that OrderedCollection new: 10000 would return an OrderedCollection of 10000 empty/nil elements and that I could #at:put: into any of those 10000 slots and #add if I needed to go beyond those 10000.
>
> Tests done on a laptop with Windows 7, Pharo 4 latest image, latest stable vm, 3rd gen i7 processor, 12gb ram.
>
> I did all of the tests in Pharo 4 and added my Array test.
> 0:00:00:04.37
> 0:00:00:03.183
> 0:00:00:03.674
> 0:00:00:03.753
> 0:00:00:01.647 and with an Array instead of OrderedCollection
>
> So we can see if we know the max size and create the collection with that size it should improve performance.
>
> I also do not understand why Pharo is so slow on this?
>
> With the preallocated Array above it took 1.647 seconds.
>
> Python 3.4.2, 0.003 seconds with 10,000 ints, and 0.17 with 1,000,000 ints.
> Julia 3.5, 0.005 seconds with 1,000,000 Int64.
>
> Now I don't expect Pharo to keep up with Julia. But we aren't even in the neighborhood with Python.
>
> I really would like to use Pharo. It really is my favorite language and environment. But these performance numbers give me pause.
>
> Jimmie
>
>
> On 1/14/2015 3:53 AM, Max Leske wrote:
>> Hi Alex
>>
>> I thought the following little experiment might interest you.
>>
>> I was trying to find out (as per your suggestion) how big the difference would be between:
>> - setting the array in OrderedCollection to nil and initializing it to size 10 on first access
>> - initializing the array in OrderedCollection to size 0.
>>
>> Expectation: #grow will take time, ergo, using an empty array should be slower than using
>> a preallocated array.
>>
>> Experiment (Pharo 1.3 on SqueakVM):
>>
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 100000.
>> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 17566
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 10000.
>> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 19717
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 0.
>> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 17598
>>
>>
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 1000.
>> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 18084
>>
>>
>>
>> Result: growing a collection is always faster (or at least nearly equally fast)!
>>
>> Explanation: What makes preinitialized collections so slow is the fact the the firstIndex variable will be set to
>> the first third of the array (3333 in this case). When the last position in the array is reached, all elements
>> are copied to the beginning of the array (2n operations). This copy operation is really slow (which can be seen
>> from the first example with an oversized collection that does not require copying because the last position
>> of the array is never reached).
>>
>>
>> Experiment (Pharo 4 on PharoVM):
>> (Iâm using bigger numbers here to compensate for the faster VM :) )
>>
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 1000000.
>> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:01:09.225"
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 100000.
>> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:00:37.653"
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 0.
>> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:00:40.152"
>>
>>
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 10000.
>> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:00:42.121â
>>
>>
>>
>> Result: growing a collection is easily fast enough, although minute performance gains are possible with preinitialized collections.
>>
>> Explanation: #makeRoomAtLast has been improved. Also: firstIndex is now set to the beginning of the array, preventing the copy
>> operation that made the former measurements so slow.
>> The run with the oversized collection is only so slow because it apparently takes a lot of time to assign the large array (?).
>>
>>
>> Consequence of my little experiment: My initial implementation of the idea in you paper set the array in OrderedCollection to nil
>> under the assumption that grow operations are very costly. That choice leads to many changes in methods of OrderedCollection
>> where it is necessary to check if the array has been initialized yet. This introduces overhead and makes the code more error prone.
>> I see now that it makes much more sense to use an empty array, the performance lost by growing ist neglectable.
>>
>> It is also interesting to note that there almost never seems to be a good reason to initialize an OrderedCollection with a large array.
>>
>>
>> Cheers,
>> Max
>
>
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
Jan. 15, 2015
Re: [Pharo-dev] Hosting the Pharo VM on MirageOS
by Joerg Beekmann, DeepCove Labs
> >
> >> -----Original Message-----
> >> From: Pharo-dev [mailto:pharo-dev-bounces@lists.pharo.org] On Behalf
> >> Of Alain Rastoul
> >> Sent: Wednesday, January 14, 2015 10:39 PM
> >> To: pharo-dev(a)lists.pharo.org
> >> Subject: Re: [Pharo-dev] Hosting the Pharo VM on MirageOS
> >>
> >> Le 15/01/2015 03:08, Joerg Beekmann, DeepCove Labs a écrit :
> >>>
> >>> I was not planning specializing the VM for the image. But rather
> >>> link in a VM with everything needed to run a range of images. The
> >>> dependencies are handled by creating an OCAML module that expresses
> >> these and the VM code then lives in the module. The OCAML dependence
> >> analyser (a sat solver) then ensures those are satisfied.
> >>>
> >> But if you don't have a specialized smalltalk vm and image, you will
> >> have to embed full system dependencies, in order to build a full
> >> working smalltalk system (having most part not working could be a
> >> very bad thing), and then you loose the unikernel approach benefits
> >> (very lean dedicated system, small attack surface etc.).
> > My implicit assumption was that these VM would be designed for running
> headless web-services on smaller EC2 instances. And perhaps naively was
> thinking that the number of system dependencies would be quite low:
> >
> > - memory
> > - CPU
> > - networking stack
> > - http/https
> >
> > - no file system but access to block storage (or perhaps even link
> > image in so no storage at all)
> > - mirage is single threaded with green threads so no
> > multithreading/processing
>
> Honestly, the VM is not that large. There are not many variation points on that
> level.
> Where you want specialization is the *image*.
Thanks Marcus - good to know
>
> Marcus
Jan. 15, 2015
Re: [Pharo-dev] Implementing lazy loading for expandable collections (part 2)
by Sven Van Caekenberghe
Jimmy,
> On 15 Jan 2015, at 19:46, Jimmie Houchin <jlhouchin(a)gmail.com> wrote:
>
> I do not understand what is happening here.
>
> oc := OrderedCollection new: 10000.
> oc size. "0"
>
> a := Array new: 10000.
> a size. "10000"
>
> So it seems that the #new: isn't creating an OrderedCollection of the size we pass in.
>
> I discovered this when I attempted to do the identical test but with an Array instead of an OrderedCollection. Since the Array doesn't #add: I had to change the code to #at:put:.
This is all normal and by design.
OrderedCollection is a growable collection, designed so you can add elements at either end. The thread's discussion is about growing strategies.
Consider,
(OrderedCollection new: 100) capacity = 100
it means it has preallocated room for a 100 elements, but the way it is managed is tricky, as people discovered.
> When I noticed all of the OC code did #add: even if supposedly setting its size to 10000(0). I tried to use #at:put: in the OrderedCollection but it failed because their was no index 1, because the size was still 0.
>
> I naively would have thought that OrderedCollection new: 10000 would return an OrderedCollection of 10000 empty/nil elements and that I could #at:put: into any of those 10000 slots and #add if I needed to go beyond those 10000.
>
> Tests done on a laptop with Windows 7, Pharo 4 latest image, latest stable vm, 3rd gen i7 processor, 12gb ram.
>
> I did all of the tests in Pharo 4 and added my Array test.
> 0:00:00:04.37
> 0:00:00:03.183
> 0:00:00:03.674
> 0:00:00:03.753
> 0:00:00:01.647 and with an Array instead of OrderedCollection
>
> So we can see if we know the max size and create the collection with that size it should improve performance.
>
> I also do not understand why Pharo is so slow on this?
>
> With the preallocated Array above it took 1.647 seconds.
>
> Python 3.4.2, 0.003 seconds with 10,000 ints, and 0.17 with 1,000,000 ints.
> Julia 3.5, 0.005 seconds with 1,000,000 Int64.
>
> Now I don't expect Pharo to keep up with Julia. But we aren't even in the neighborhood with Python.
>
> I really would like to use Pharo. It really is my favorite language and environment. But these performance numbers give me pause.
There are differently sized loops in this thread, what exactly did you try ?
What is the Python code that you ran ?
Benchmarking is always dangerous, you must make absolutely clear what you are running and comparing.
Sven
> Jimmie
>
>
> On 1/14/2015 3:53 AM, Max Leske wrote:
>> Hi Alex
>>
>> I thought the following little experiment might interest you.
>>
>> I was trying to find out (as per your suggestion) how big the difference would be between:
>> - setting the array in OrderedCollection to nil and initializing it to size 10 on first access
>> - initializing the array in OrderedCollection to size 0.
>>
>> Expectation: #grow will take time, ergo, using an empty array should be slower than using
>> a preallocated array.
>>
>> Experiment (Pharo 1.3 on SqueakVM):
>>
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 100000.
>> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 17566
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 10000.
>> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 19717
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 0.
>> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 17598
>>
>>
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 1000.
>> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 18084
>>
>>
>>
>> Result: growing a collection is always faster (or at least nearly equally fast)!
>>
>> Explanation: What makes preinitialized collections so slow is the fact the the firstIndex variable will be set to
>> the first third of the array (3333 in this case). When the last position in the array is reached, all elements
>> are copied to the beginning of the array (2n operations). This copy operation is really slow (which can be seen
>> from the first example with an oversized collection that does not require copying because the last position
>> of the array is never reached).
>>
>>
>> Experiment (Pharo 4 on PharoVM):
>> (Iâm using bigger numbers here to compensate for the faster VM :) )
>>
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 1000000.
>> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:01:09.225"
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 100000.
>> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:00:37.653"
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 0.
>> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:00:40.152"
>>
>>
>>
>> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 10000.
>> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:00:42.121â
>>
>>
>>
>> Result: growing a collection is easily fast enough, although minute performance gains are possible with preinitialized collections.
>>
>> Explanation: #makeRoomAtLast has been improved. Also: firstIndex is now set to the beginning of the array, preventing the copy
>> operation that made the former measurements so slow.
>> The run with the oversized collection is only so slow because it apparently takes a lot of time to assign the large array (?).
>>
>>
>> Consequence of my little experiment: My initial implementation of the idea in you paper set the array in OrderedCollection to nil
>> under the assumption that grow operations are very costly. That choice leads to many changes in methods of OrderedCollection
>> where it is necessary to check if the array has been initialized yet. This introduces overhead and makes the code more error prone.
>> I see now that it makes much more sense to use an empty array, the performance lost by growing ist neglectable.
>>
>> It is also interesting to note that there almost never seems to be a good reason to initialize an OrderedCollection with a large array.
>>
>>
>> Cheers,
>> Max
>
>
Jan. 15, 2015
Re: [Pharo-dev] Implementing lazy loading for expandable collections (part 2)
by Jimmie Houchin
I do not understand what is happening here.
oc := OrderedCollection new: 10000.
oc size. "0"
a := Array new: 10000.
a size. "10000"
So it seems that the #new: isn't creating an OrderedCollection of the
size we pass in.
I discovered this when I attempted to do the identical test but with an
Array instead of an OrderedCollection. Since the Array doesn't #add: I
had to change the code to #at:put:.
When I noticed all of the OC code did #add: even if supposedly setting
its size to 10000(0). I tried to use #at:put: in the OrderedCollection
but it failed because their was no index 1, because the size was still 0.
I naively would have thought that OrderedCollection new: 10000 would
return an OrderedCollection of 10000 empty/nil elements and that I could
#at:put: into any of those 10000 slots and #add if I needed to go beyond
those 10000.
Tests done on a laptop with Windows 7, Pharo 4 latest image, latest
stable vm, 3rd gen i7 processor, 12gb ram.
I did all of the tests in Pharo 4 and added my Array test.
0:00:00:04.37
0:00:00:03.183
0:00:00:03.674
0:00:00:03.753
0:00:00:01.647 and with an Array instead of OrderedCollection
So we can see if we know the max size and create the collection with
that size it should improve performance.
I also do not understand why Pharo is so slow on this?
With the preallocated Array above it took 1.647 seconds.
Python 3.4.2, 0.003 seconds with 10,000 ints, and 0.17 with 1,000,000
ints.
Julia 3.5, 0.005 seconds with 1,000,000 Int64.
Now I don't expect Pharo to keep up with Julia. But we aren't even in
the neighborhood with Python.
I really would like to use Pharo. It really is my favorite language and
environment. But these performance numbers give me pause.
Jimmie
On 1/14/2015 3:53 AM, Max Leske wrote:
> Hi Alex
>
> I thought the following little experiment might interest you.
>
> I was trying to find out (as per your suggestion) how big the difference would be between:
> - setting the array in OrderedCollection to nil and initializing it to size 10 on first access
> - initializing the array in OrderedCollection to size 0.
>
> Expectation: #grow will take time, ergo, using an empty array should be slower than using
> a preallocated array.
>
> Experiment (Pharo 1.3 on SqueakVM):
>
>
> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 100000.
> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 17566
>
> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 10000.
> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 19717
>
> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 0.
> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 17598
>
>
>
> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 1000.
> 1 to: 10000 do: [ :i | c add: i ] ] ] timeToRun 18084
>
>
>
> Result: growing a collection is always faster (or at least nearly equally fast)!
>
> Explanation: What makes preinitialized collections so slow is the fact the the firstIndex variable will be set to
> the first third of the array (3333 in this case). When the last position in the array is reached, all elements
> are copied to the beginning of the array (2n operations). This copy operation is really slow (which can be seen
> from the first example with an oversized collection that does not require copying because the last position
> of the array is never reached).
>
>
> Experiment (Pharo 4 on PharoVM):
> (Iâm using bigger numbers here to compensate for the faster VM :) )
>
>
> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 1000000.
> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:01:09.225"
>
> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 100000.
> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:00:37.653"
>
> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 0.
> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:00:40.152"
>
>
>
> [ 10000 timesRepeat: [ | c | c := OrderedCollection new: 10000.
> 1 to: 100000 do: [ :i | c add: i ] ] ] timeToRun "0:00:00:42.121â
>
>
>
> Result: growing a collection is easily fast enough, although minute performance gains are possible with preinitialized collections.
>
> Explanation: #makeRoomAtLast has been improved. Also: firstIndex is now set to the beginning of the array, preventing the copy
> operation that made the former measurements so slow.
> The run with the oversized collection is only so slow because it apparently takes a lot of time to assign the large array (?).
>
>
> Consequence of my little experiment: My initial implementation of the idea in you paper set the array in OrderedCollection to nil
> under the assumption that grow operations are very costly. That choice leads to many changes in methods of OrderedCollection
> where it is necessary to check if the array has been initialized yet. This introduces overhead and makes the code more error prone.
> I see now that it makes much more sense to use an empty array, the performance lost by growing ist neglectable.
>
> It is also interesting to note that there almost never seems to be a good reason to initialize an OrderedCollection with a large array.
>
>
> Cheers,
> Max
Jan. 15, 2015
Re: [Pharo-dev] Fixing DNU binding in GT and Nautilus
by kilon alios
what DNU means ? is it the same as MNU ?
On Thu, Jan 15, 2015 at 6:07 PM, Andrei Chis <chisvasileandrei(a)gmail.com>
wrote:
> Should be Alain's repo:
> http://smalltalkhub.com/mc/AlainPlantec/Rubric/main/
> If you do not have access I can commit the change for you.
>
> On Thu, Jan 15, 2015 at 5:03 PM, Nicolai Hess <nicolaihess(a)web.de> wrote:
>
>> The fix is in 4.0 446 but only for SmalltalkEditor. Where should we put
>> the fix for RubSmalltalkEditor?
>>
>> 2015-01-14 22:49 GMT+01:00 stepharo <stepharo(a)free.fr>:
>>
>>> Thanks marcus
>>>
>>> I just open another one :( because I houtgh that my mail did go through.
>>> I will close it.
>>>
>>> Le 14/1/15 13:02, Marcus Denker a écrit :
>>>
>>> I have opened an issue for this:
>>>
>>>
>>> https://pharo.fogbugz.com/f/cases/14731/Fixing-DNU-binding-in-GT-and-Nautil…
>>>
>>>
>>> On 13 Jan 2015, at 20:11, stepharo <stepharo(a)free.fr> wrote:
>>>
>>> Hi
>>>
>>> in nautilus method pane and GT, when I select a global variable such as
>>>
>>> SystemOrganization and press command B + N
>>>
>>> I get DNU binding.
>>> Apparently this DNU only happen when the name does not match any class
>>> substring
>>> Transcript or Undeclared will not raise an error because we have classes
>>> having name matching the expression.
>>>
>>> Fixed included.
>>>
>>> PS: I'm dead after 1h30 train delay (after giving 6 hours lecture)
>>> today. So this mail will be sent whenever I get connected.
>>>
>>> Stef
>>> <FixDNUBinding.cs>
>>>
>>>
>>>
>>>
>>
>
Jan. 15, 2015
Re: [Pharo-dev] R: Finish one thing today
by kilon alios
personally I dont see the point and it looks silly. Sometimes things take
more time, sometimes releasing frequently is not a good idea because it
comes with its own costs and delays. Coding like anything else in life is
about critical thinking. Its about sitting down and deciding whats the best
course for your project and if the course fails you change it. So I will
have to be the only one here to thumb down this.
On Wed, Jan 14, 2015 at 6:10 PM, Pablo R. Digonzelli <pdigonzelli(a)gmail.com>
wrote:
> +1
>
> Ing. Pablo Digonzelli
> Software Solutions
> IP-Solutiones SRL
> Metrotec SRL
> 25 de Mayo 521
> San Miguel de Tucumán
> Email: pdigonzelli(a)softsargentina.com
> pdigonzelli(a)gmail.com
> Cel: 5493815982714
>
> ----- Mensaje original -----
> De: "Lorenzo Schiavina" <lorenzo(a)edor.it>
> Para: "Pharo Development List" <pharo-dev(a)lists.pharo.org>
> Enviados: Miércoles, 14 de Enero 2015 13:09:53
> Asunto: [Pharo-dev] R: Finish one thing today
>
> +1
>
> Lorenzo
>
> -----Messaggio originale-----
> Da: Pharo-dev [mailto:pharo-dev-bounces@lists.pharo.org] Per conto di Sven
> Van Caekenberghe
> Inviato: mercoledì 14 gennaio 2015 16:16
> A: Pharo Development List
> Oggetto: Re: [Pharo-dev] Finish one thing today
>
>
> > On 14 Jan 2015, at 15:12, Pablo Estefo <pestefo(a)gmail.com> wrote:
> >
> > Wow... powerful message
>
> +1
>
> > On 14 January 2015 at 10:32, Marcus Denker <marcus.denker(a)inria.fr>
> wrote:
> > This is nice:
> >
> > http://finishonethingtoday.com
> >
> >
> > Marcus
> >
> >
> >
>
>
Jan. 15, 2015
Re: [Pharo-dev] [Pharo4] Slots can now be saved with MC
by Marcus Denker
> On 15 Jan 2015, at 13:04, Tim Mackinnon <tim(a)testit.works> wrote:
>
> Marcus, can you remind us where that Blog post you wrote about using slots is? A google search of âPharo Smalltalk slotsâ doesnât seem to find it, and I remember it being a great intro to what is possible.
>
> (Itâs worth considering tagging that post better - it should come up much higher in google search results).
>
There is no blog post yet⦠I want to actually have it finished, else I would write a post about something not working⦠which would be
hard.
Marcus
> Tim
>
> On 12 Jan 2015, at 14:59, Marcus Denker <marcus.denker(a)inria.fr> wrote:
>
>>
>>> On 11 Jan 2015, at 18:50, Chris Muller <asqueaker(a)gmail.com> wrote:
>>>
>>> It has been a while since I read the paper, but my memory is that
>>> Slots lets you define features and/or constraints on inst-var's. For
>>> example, assigning default values or restricting the set of valid
>>> values.
>>>
>>> This would probably be appealing for folks coming from languages like
>>> Java or C++, because they're used to all of their "slots" being
>>> statically typed. It does seem ironic that where those static
>>> languages have been trying to move toward being more dynamic, Pharo
>>> newbies would find themselves arrived at a language which is trying to
>>> make something that was purely dynamic into something more static.
>>>
>>
>> It is *possible* to implement a kind of TypedSlot, but I do not think that
>> this is what people will use Slots for. And for sure there will be no TypeSlot
>> by default in Pharo.
>>
>> For Slots there are two levels
>>
>> 1) having objects that describe variables instead of strings. This is very powerful
>> already and will allow us to e.g. do watchpoints/breakpoitns in variables very easily
>>
>> This is already in Pharo3, but Pharo4 enhances the API and provides with the LinkWrapper
>> slot a way to transparently hook into variable access. This will be very powerful.
>>
>> 2) provide a way to declare that a slot is described by a special subclass of Slot. This is what this
>> change is about
>>
>> This is what we use Slots for are three directions:
>>
>> 1) active slots that announce when the are set. Replacing the whole ValueHolder stuf to some extend.
>> (This is where Slots + their Meta Object Protocol allow one to implement the special variables in Tweak
>> very easily. It is interesting that there, one had to copy the whole compiler and do many, many hacks.
>>
>> 2) Allow optimizing memory representation. E.g. look at Morph. Many flags are needed, but each takes a
>> whole pinter to true of false. So we have MorphExtension. And then on top of that a property dictionary.
>> With Slots, flags (sots that can only store true or false) can be realised very efficiently (31 boolean slots
>> of the hierarchy map to one ivar). With a PropertySlot, one can have values that are used seldomely
>> encoded in a way that they take no space.
>>
>> 3) Slots + Magritte. Magritte now relies of conventions and methods added to the class side. But what it
>> is: meta descriptions for ivars. I think there will be something very powerful in combining Magritte and Slots.
>>
>> 4) Experiments. One way to see Pharo is that it is suppose to be flexible enough to allow experiments
>> to be done fast and easy so we can explore many ideas easily.
>> These experiments will often be just that: experiments. But some of them will be so good that they will
>> turn out to be useful.
>>
>>> My understanding is that specifying a certain Slot-type can save the
>>> need to write, i.e., initializing or validating methods. In exchange,
>>> the number of concepts inherent in the language that must be learned
>>> and remembered is increased. Standard Smalltalk is only about 2 or 3
>>> concepts -- sending messages and assigning pointers. Period. There's
>>> something exciting about that because even Grandma can grok 2 or 3
>>> concepts. No other language is so simple.
>>>
>> Slots do not really increase the concepts: they just are meta objects that have the
>> definition of the behaviour of assignment, turning assignment into message sends.
>>
>>> By introducing the implicit behaviors of slots, the number of
>>> different conceptual interactions between code and the slots it
>>> references increases exponentially with the number of slot-types. I
>>> fear trying to explain them to Grandma will have her eyes starting to
>>> glazeâ¦
>>>
>> I do not see now an active slot is harder to understand than e.g. a ValueHolder.
>> or a BooleanSlot should be easier to understand than doing all that explicitely?
>>
>>
>> Marcus
>>
>>
>
>
Jan. 15, 2015
Re: [Pharo-dev] InfoWorld on Redline Smalltalk
by horrido
Wesolows' opinion may or may not be valid, I don't know. But more
importantly, I don't care. The *only* thing that matters to me is whether Go
compiles quickly, executes quickly, and makes it easy to write my
applications. The plumbing is irrelevant to me.
As long as the Go team continues to improve the performance of the language
(including the runtime), I shall support Go. As a life-long C programmer, I
recognize that Go delivers a far superior experience. It's even better than
Python, though admittedly I have much less experience with Python.
Andreas Wacknitz wrote
> Am 15.01.15 16:08, schrieb horrido:
>> As I've written elsewhere, I believe the TIOBE index is plain rubbish.
>> Much
>> of their rankings make no sense to me whatsoever.
>>
>> Langpop.corger.nl <http://langpop.corger.nl/> is my "go to"
>> website for
>> language rankings. It's not perfect, but it makes a whole lot more sense
>> to
>> me.
>>
>> Scala, Groovy, and Clojure are not "ultimate failures." Heck, they're
>> doing
>> at least as well as Go, my second favourite language of all time. (Go is
>> red-hot in China. Go has an enviable set of "standard" libraries.)
> http://dtrace.org/blogs/wesolows/2014/12/29/golang-is-trash/
>
>>
>> I agree that Java is our greatest foe. We are "300" against its Xerxes.
>> That's why I am sanguine about Redline â we need it!
>>
>>
>> kilon.alios wrote
>>> Lets see the big picture here, if you take a look at TIOBE INDEX or
>>> LANGPOP
>>> or the internet at large you get a clear picture about java based
>>> languages
>>> . Popularity wise they have been a ultimate failure. Right now the only
>>> language that is barely noticable is Scala and even Scala is nowhere
>>> near
>>> as popular as the less popular languages like Pascal, Delphi and Visual
>>> Basic. Of course each website gives diffirent numbers but those numbers
>>> are
>>> just different in only few percentage units.
>>>
>>> http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html
>>>
>>> http://langpop.com/
>>>
>>> Hype also does not help those languages either. Take a look at Clojure ,
>>> one of the most overhyped languages out there not just on JVM but
>>> anywhere,
>>> in both websites I mentioned Clojure like Pharo does not make it even in
>>> top 50. Tons of blogs post about Clojure only, tons of praise, and
>>> praise
>>> and praise.
>>>
>>> I can say about jython itself , a python implementation for the JVM and
>>> ironpython which is python for .NET are barely noticable in the python
>>> world with cpython gathering at least 99.9% of the attention.
>>>
>>> So its a really hard situation . Coding has become extremely complex and
>>> demanding , coders want languages are deeply documented and come with
>>> tons
>>> of libraries so its very hard for new languages to kick in. Also the
>>> assumption that because you love a language you will be willing to start
>>> using java libraries seems to have failed miserably. These languages
>>> seem
>>> more appealing to java developers and java developers dont seem willing
>>> to
>>> abandon Java any time soon.
>>>
>>> So as always Java death has been greatly exaggerated.
>>>
>>> The situation for Javascript based languages is even worse.
>>>
>>> So frankly what has happened with Redline is pretty normal.
>>>
>>> On Thu, Jan 15, 2015 at 2:36 AM, Craig Latta <
>>> craig@
>>> > wrote:
>>>
>>>>> Shaking the hive can certainly have a positive outcome, but you can
>>>>> also get you bitten. :)
>>>> Sure, and shaking the hive too rarely will get you starved.
>>>>
>>>>
>>>> -C
>>>>
>>>> --
>>>> Craig Latta
>>>> netjam.org
>>>> +31 6 2757 7177 (SMS ok)
>>>> + 1 415 287 3547 (no SMS)
>>>>
>>>>
>>>>
>>
>>
>>
>>
>> --
>> View this message in context:
>> http://forum.world.st/InfoWorld-on-Redline-Smalltalk-tp4799612p4799716.html
>> Sent from the Pharo Smalltalk Developers mailing list archive at
>> Nabble.com.
>>
--
View this message in context: http://forum.world.st/InfoWorld-on-Redline-Smalltalk-tp4799612p4799756.html
Sent from the Pharo Smalltalk Developers mailing list archive at Nabble.com.
Jan. 15, 2015
Re: [Pharo-dev] InfoWorld on Redline Smalltalk
by Sven Van Caekenberghe
It is not sarcasm or a race. I was just pointing out the (obvious) fact that there is a huge difference in scale. (And even then, Pharo, being the most successful Smalltalk, is pretty small).
And I was saying so in the context of the questions 'What should we promote ?' or 'Was it actually good or a success to have that mentioned in InfoWorld ?'.
Now I am going back to work on Pharo.
> On 15 Jan 2015, at 16:59, Sebastian Sastre <sebastian(a)flowingconcept.com> wrote:
>
> Well.. Iâve cared to talk with James before making this kind of assumptions or listening that sarcasm.
>
> Those 20 commits are in the stable repo, not dev so the commit race doesnât say much.
>
> Itâs not ready to big time promotion but turns out Redline Smalltalk development is doing fine in moving towards 1.0 and its plans of having one release per year.
>
>
>
>> On Jan 15, 2015, at 1:06 PM, Sven Van Caekenberghe <sven(a)stfx.eu> wrote:
>>
>> Yes, it is very alive: 20 commits in year or so.
>>
>> Pharo 4 has about 1700 in about the same time (https://github.com/pharo-project/pharo-core) And that is just one silly, inaccurate metric.
>>
>> My point is, there are a couple of great Smalltalk implementations that contain an incredible number of man-years of effort in their images (the best being Pharo of course, but I am biased ;-), we can only achieve a high quality platform by working together. The number of different competences needed to successfully build a *COMPLETE* software platform can *NEVER* be achieved by 'a couple of guys' let alone one individual.
>>
>> Now, it is not that they can not do so, of course they can, we need wild and crazy ideas and research, but it is just wrong to see such experiments as what should be promoted now.
>>
>> IMHO, of course.
>>
>>> On 15 Jan 2015, at 15:19, horrido <horrido.hobbies(a)gmail.com> wrote:
>>>
>>> Actually, Redline is quite alive. There's a brand new repo:
>>> https://github.com/jamesladd/stc <https://github.com/jamesladd/stc>
>>>
>>> James just hasn't gotten around to normalizing all the links at his website.
>>>
>>>
>>> Sven Van Caekenberghe-2 wrote
>>>> A blank.
>>>>
>>>> Nothing happened to this project in more than a year
>>>>
>>>> https://github.com/redline-smalltalk/redline-smalltalk/commits/master
>>>>
>>>> It is mostly vapourware and has no users.
>>>>
>>>> People following the links on the article will soon find out.
>>>>
>>>> Just sad.
>>>>
>>>>> On 14 Jan 2015, at 23:40, horrido <
>>>
>>>> horrido.hobbies@
>>>
>>>> > wrote:
>>>>>
>>>>> http://www.infoworld.com/article/2867543/java/redline-smalltalk-bridging-sm…
>>>>> <http://www.infoworld.com/article/2867543/java/redline-smalltalk-bridging-smalltalk-jvm-worlds.html>
>>>>>
>>>>> Note the last paragraph. Our campaign will be noticed!
>>>>>
>>>>> This is exactly what I was after when I started the SRP. Spread the word
>>>>> about the campaign as far and wide as I could.
>>>>>
>>>>>
>>>>>
>>>>> --
>>>>> View this message in context:
>>>>> http://forum.world.st/InfoWorld-on-Redline-Smalltalk-tp4799612.html
>>>>> Sent from the Pharo Smalltalk Developers mailing list archive at
>>>>> Nabble.com.
>>>>>
>>>
>>>
>>>
>>>
>>>
>>> --
>>> View this message in context: http://forum.world.st/InfoWorld-on-Redline-Smalltalk-tp4799612p4799699.html
>>> Sent from the Pharo Smalltalk Developers mailing list archive at Nabble.com.
>>
>>
>
>
Jan. 15, 2015