Re: [RFC PATCH 0/5] oidmap: handle entries with the same key

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



Christian Couder <christian.couder@xxxxxxxxx> writes:

> This is an RFC patch series that is not intended to be merged for now,
> as it looks like we don't need oidmaps that can handle several entries
> with the same key yet.

What does it even mean for a map to allow multiple entries per key?
When you have a key and its value, you must retrieve all existing
entries for the key and see their values before deciding if you want
to add yet another entry to the already existing set?  When you have
a key, you must retrieve all existing entries to see if any of them
is what you want?

What I am wondering is if people usually do "a single list/set of
values that is associated with each key" for such an application.
Obviously you do not need a map that allows multiple entries per key
if you did so---is there an advantage of a map that allows multiple
entries per key?

> As I needed this for my work on reftable, I thought that...

I actually think that showing how it is used in the real application
(reftable?) is the best way to illustrate why this is useful and to
get opinions from others.



[Index of Archives]     [Linux Kernel Development]     [Gcc Help]     [IETF Annouce]     [DCCP]     [Netdev]     [Networking]     [Security]     [V4L]     [Bugtraq]     [Yosemite]     [MIPS Linux]     [ARM Linux]     [Linux Security]     [Linux RAID]     [Linux SCSI]     [Fedora Users]

  Powered by Linux