title: Python equivalent of concurrentHashMap from Java?
body: <p>I know that dictionaries are atomic in python but (correct me if I'm wrong) that means only a single addition to the dictionary can be completed at a time. According to the Java page for the concurrentHashMap : "The table is internally partitioned to try to permit the indicated number of concurrent updates without contention." Wouldn't solely atomic insertion in python not compare in speed to the Java implementation</p>
  
  <p>EDIT: When I wrote "that means only a single addition to the dictionary can be completed at a time," I meant to say that the state of the dictionary is going to be discretized based on the individual dictionary addition </p>