2 ms·
This resembles sql a lot. Btw I'm surprised that few languages seem to have in their standard library a many-to-many container which supports efficient lookups
by im3w1l 6y ago
This resembles sql a lot. Btw I'm surprised that few languages seem to have in their standard library a many-to-many container which supports efficient lookups in either direction.
- iso8859-1 6y agoWhich languages support this at all? Are you talking about ORM?
- im3w1l 6y agoI'm talking about something like this std::relation<Foo, Bar> foobars; ... auto& bars = foobars.forward(foo); ... auto& foos = foobars.backward(bar); Edit: Boost apparently has it, see e.g. https://stackoverflow.com/questions/1128144/c-maps-for-many-to-many https://stackoverflow.com/questions/1128144/c-maps-for-many-...
- gpderetta 6y agoBoost.Bimap is a special case (and built on top) of Boost.Multiindex that allows indexing a logical table with an arbitrary subset of fields.
- resonantjacket5 6y agoActually yeah that is kinda interesting. The couple times I've had to do it, always ended up hand-rolling a 'class' with hashmaps in both directions. I wonder why few standard libraries have a both way look up structure.