Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!news.albasani.net!.POSTED!not-for-mail From: Sebastian Newsgroups: comp.lang.java.programmer Subject: Concurrent bidirectional one-to-many map? Date: Fri, 06 May 2011 22:07:59 +0200 Organization: albasani.net Lines: 14 Message-ID: Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-15; format=flowed Content-Transfer-Encoding: 7bit X-Trace: news.albasani.net Fxh1aRBVZr0vFUISHAj8VVnoeekuE9DgumFdM/DQX1a7desttUTJwLYL2LDh+iUtpZPUU0cYHfuq0y//QOipMA== NNTP-Posting-Date: Fri, 6 May 2011 20:08:00 +0000 (UTC) Injection-Info: news.albasani.net; logging-data="iVqihFTGPb7sC+rq5Oa9cLUsjXdOZ94/nzZdIEPRhOi+A3OJn/BydznlSRaXerw8e2ysIguK9Tk0b/4blDdad4hij/HeX95rI4JtkZlyBJB17prQbrGb6WgOpiKzVjO8"; mail-complaints-to="abuse@albasani.net" User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; de; rv:1.9.2.15) Gecko/20110303 Thunderbird/3.1.9 Cancel-Lock: sha1:B3quFdE1Vv3D8b+xCJJOfpVamd8= Xref: x330-a1.tempe.blueboxinc.net comp.lang.java.programmer:3711 Does anyone know of a concurrent bidirectional one-to-many map implementation? By bidirectional I mean that I can lookup keys by values, by one-to-many I mean that the value end of the map is a list or set, and by concurrent I mean that I do not need to synchronize externally and get performance comparable to that of java.util.concurrent.ConcurrentHashMap in both directions. If this beast doesn't exist, how would I go about inventing it? I must say that I am by no means any sort of concurrency guru... -- Sebastian