That's a plan!
I realized from my code I was already using a mix of the new and old
world. It will be nice to get rid of the antic one to reduce the
confusion when manipulating file.
Thanks
Le 22/04/2018 à 20:12, Sven Van Caekenberghe a écrit :
It is not hard at all, just start from FileSys
I do.not know about variable sizes but I've made a treemap of database
table size grouped by some grouping.
I'll fetch the code and post it when home.
Phil
On Mon, Apr 23, 2018, 19:42 PAUL DEBRUICKER wrote:
> Hi,
>
> With Roassal is it possible to make a treemap (
> https://en.wikipedia.org/wi
Hi,
With Roassal is it possible to make a treemap
(https://en.wikipedia.org/wiki/Treemapping) of the memory use of an object and
its instVars?
I have a leak and am not sure where and its not one or two objects AFAIK
Thanks
Paul
Richard,
Can you explain me what you mean by "sortBlock is supposed to act like #<="?
Isn't it up to the developer to decide what the logic should be? I simply
used #<= because #> might not have been implemented for all relevant
classes, but would otherwise have chosen #> as a means to get the 're
I already deleted my post (within 1 minute after posting 8-) seeing that I
jumped the wagon too early. Sorry for that. Your message and proposed
solution is fine.
--
Sent from: http://forum.world.st/Pharo-Smalltalk-Users-f1310670.html
I know perfectly well what the problem is.
I explained it in my message: the inherited #reversed
method doesn't know the sortBlock exists.
(So whether it is nil or not is not relevant.)
I also know several ways to fix it, and provided
tested source code for one of them in my message.
Using (a <= b
Richard,
The 'problem' is that the result of the (original) #reverse is a
SortedCollection without a sortBlock. Meaning it defaults to comparing
values using #<=. When a new element is added to the reversed collection it
simply assumes all elements are already sorted and uses the (default)
sortBlo
