Peter Maydell writes:
> On Mon, 11 Jul 2022 at 12:09, Daniel P. Berrangé wrote:
>>
>> On Mon, Jul 11, 2022 at 11:32:35AM +0100, Peter Maydell wrote:
>> > I'm pretty sure that nothing needs sparse array elements like
>> > that. The major reason for the len-PROP field is an implementation
>> > one
On Mon, 11 Jul 2022 at 12:09, Daniel P. Berrangé wrote:
>
> On Mon, Jul 11, 2022 at 11:32:35AM +0100, Peter Maydell wrote:
> > I'm pretty sure that nothing needs sparse array elements like
> > that. The major reason for the len-PROP field is an implementation
> > one: because there is currently no
On Mon, Jul 11, 2022 at 11:32:35AM +0100, Peter Maydell wrote:
> On Fri, 8 Jul 2022 at 12:01, Daniel P. Berrangé wrote:
> > What alternative options do we have for addressing this scenario.
> >
> > I can think of
> >
> > - Auto-create array elements, if seeing an element set before length.
> >
>
On Fri, 8 Jul 2022 at 12:01, Daniel P. Berrangé wrote:
> What alternative options do we have for addressing this scenario.
>
> I can think of
>
> - Auto-create array elements, if seeing an element set before length.
>
> This is based on the theory that 'len-PROP' field is largely
> redun
On Wed, Jul 06, 2022 at 01:35:22PM +0200, Markus Armbruster wrote:
> Markus Armbruster writes:
>
> > QDict is implemented as a simple hash table of fixed size. Observe:
> >
> > * Slow for large n. Not sure this matters.
> >
> > * A QDict with n entries takes 4120 + n * 32 bytes on my box. Wast
Alex Bennée writes:
> Markus Armbruster writes:
>
>> QDict is implemented as a simple hash table of fixed size. Observe:
>>
>> * Slow for large n. Not sure this matters.
>>
>> * A QDict with n entries takes 4120 + n * 32 bytes on my box. Wastes
>> space for small n, which is a common case.
Markus Armbruster writes:
> QDict is implemented as a simple hash table of fixed size. Observe:
>
> * Slow for large n. Not sure this matters.
>
> * A QDict with n entries takes 4120 + n * 32 bytes on my box. Wastes
> space for small n, which is a common case.
>
> * Order of traversal depe
On Tue, Jul 05, 2022 at 11:54:21AM +0200, Markus Armbruster wrote:
> QDict is implemented as a simple hash table of fixed size. Observe:
>
> * Slow for large n. Not sure this matters.
I presume you're referring qdict_find() here, which would
ideally be O(1).
Our bucket size is 512, so for hash
On Thu, Jul 07, 2022 at 04:27:35PM +0200, Markus Armbruster wrote:
> Peter Maydell writes:
>
> > On Tue, 5 Jul 2022 at 10:54, Markus Armbruster wrote:
> >>
> >> QDict is implemented as a simple hash table of fixed size. Observe:
> >>
> >> * Slow for large n. Not sure this matters.
> >>
> >> *
On Tue, Jul 05, 2022 at 11:54:21AM +0200, Markus Armbruster wrote:
> QDict is implemented as a simple hash table of fixed size. Observe:
>
> * Slow for large n. Not sure this matters.
>
> * A QDict with n entries takes 4120 + n * 32 bytes on my box. Wastes
> space for small n, which is a com
Peter Maydell writes:
> On Tue, 5 Jul 2022 at 10:54, Markus Armbruster wrote:
>>
>> QDict is implemented as a simple hash table of fixed size. Observe:
>>
>> * Slow for large n. Not sure this matters.
>>
>> * A QDict with n entries takes 4120 + n * 32 bytes on my box. Wastes
>> space for sm
On Tue, 5 Jul 2022 at 10:54, Markus Armbruster wrote:
>
> QDict is implemented as a simple hash table of fixed size. Observe:
>
> * Slow for large n. Not sure this matters.
>
> * A QDict with n entries takes 4120 + n * 32 bytes on my box. Wastes
> space for small n, which is a common case.
>
On 06/07/2022 12:35, Markus Armbruster wrote:
Markus Armbruster writes:
QDict is implemented as a simple hash table of fixed size. Observe:
* Slow for large n. Not sure this matters.
* A QDict with n entries takes 4120 + n * 32 bytes on my box. Wastes
space for small n, which is a com
Markus Armbruster writes:
> QDict is implemented as a simple hash table of fixed size. Observe:
>
> * Slow for large n. Not sure this matters.
>
> * A QDict with n entries takes 4120 + n * 32 bytes on my box. Wastes
> space for small n, which is a common case.
>
> * Order of traversal depend
QDict is implemented as a simple hash table of fixed size. Observe:
* Slow for large n. Not sure this matters.
* A QDict with n entries takes 4120 + n * 32 bytes on my box. Wastes
space for small n, which is a common case.
* Order of traversal depends on the hash function and on insertion
15 matches
Mail list logo
