<p dir="auto">My understanding of priority queues is that they should allow duplicate keys: this is, for example, how the STL and Java priority queue implementations work as far as I can tell (cf. <a href="http://stackoverflow.com/questions/251438/stl-priority-queue-with-duplicate-keys-is-it-possible" rel="nofollow">http://stackoverflow.com/questions/251438/stl-priority-queue-with-duplicate-keys-is-it-possible</a>, <a href="http://stackoverflow.com/questions/10469701/how-to-configure-java-priority-queue-to-ignore-duplicates" rel="nofollow">http://stackoverflow.com/questions/10469701/how-to-configure-java-priority-queue-to-ignore-duplicates</a>). Right now, our implementation doesn't do this because it acts more like a Dict than a queue.</p>
<p dir="auto">Could we possibly rename our current implementation to PriorityQueueDict and then implement a more standard PriorityQueue that behaves like a queue/array?</p>
<p dir="auto">Hi everyone,</p>
<p dir="auto">I am touching base with you since I have been trying to use the 0.3.11 version of the Julia kernel on JuliaBox for almost a week without success. Every time I switch to such kernel, the kernel dies as soon as it gets restarted and the problem is persistent.<br>
I would like to know if anyone else is encountering the same issue and what I might do in order to get such issue solved.</p>
<p dir="auto">Thank you very much in advance.</p>