"brian m. carlson" writes:
> On Wed, Jan 29, 2014 at 09:52:45PM +0100, David Kastrup wrote:
>> Junio C Hamano writes:
>> > Hmm... if you were to implement a set of pointers in such a way that
>> > you can cheaply tell if an unknown pointer belongs to that set, you
>> > would use a hashtable, key
On Wed, Jan 29, 2014 at 09:52:45PM +0100, David Kastrup wrote:
> Junio C Hamano writes:
> > Hmm... if you were to implement a set of pointers in such a way that
> > you can cheaply tell if an unknown pointer belongs to that set, you
> > would use a hashtable, keyed with something that is derived f
From: "David Kastrup"
Junio C Hamano writes:
David Kastrup writes:
Hi, I am wondering if I may compare pointers with < that have been
created using different calls of malloc.
The C standard does not allow this (inequalities are only allowed
for
pointers into the same structure) to allow f
Junio C Hamano writes:
> David Kastrup writes:
>
>> Hi, I am wondering if I may compare pointers with < that have been
>> created using different calls of malloc.
>>
>> The C standard does not allow this (inequalities are only allowed for
>> pointers into the same structure) to allow for some ch
David Kastrup writes:
> Hi, I am wondering if I may compare pointers with < that have been
> created using different calls of malloc.
>
> The C standard does not allow this (inequalities are only allowed for
> pointers into the same structure) to allow for some cheapskate sort of
> comparison in
Hi, I am wondering if I may compare pointers with < that have been
created using different calls of malloc.
The C standard does not allow this (inequalities are only allowed for
pointers into the same structure) to allow for some cheapskate sort of
comparison in segmented architectures.
Now of c
6 matches
Mail list logo
