On 24 Sep 2007, at 14:12, mm wrote:
Jonas Maebe a écrit :
Counting on implementation details of opaque entities (such as set
formats, anything regarding reference counted types such as when
references are added or removed and when how many references will
exist, rtti format, code generat
mm schrieb:
> Jonas Maebe a écrit :
>
>> Counting on implementation details of opaque entities (such as set
>> formats, anything regarding reference counted types such as when
>> references are added or removed and when how many references will
>> exist, rtti format, code generation details such a
Jonas Maebe a écrit :
Counting on implementation details of opaque entities (such as set
formats, anything regarding reference counted types such as when
references are added or removed and when how many references will exist,
rtti format, code generation details such as evaluation order of
p
On 23 Sep 2007, at 05:18, Marc Santhoff wrote:
My question:
In which cases will it happen that the memory of a dynamic array is
fragmented into multiple non-contiguous blocks?
Even if the current implementation allocates dynamic arrays always in
one block (I think it does, but I'm not certa
On Sun, 23 Sep 2007, Marc Santhoff wrote:
> Hi,
>
> a while ago I asked if I can assume the memory held by dynamic arrays is
> allocated in one contiguous block.
>
> The answer was sth. like "No, never!".
>
> I wrote a small testing programm using SetLenght() on an array multiple
> times usin
Hi,
a while ago I asked if I can assume the memory held by dynamic arrays is
allocated in one contiguous block.
The answer was sth. like "No, never!".
I wrote a small testing programm using SetLenght() on an array multiple
times using a bigger size every time and comparing the addresses of the
a
