I did something similar at one point with a trading system. The map
was something like
{ticker {resting-orders [] pending-orders []}. The pending and resting
orders were changing often, but we weren't changing what tickers we
were trading very often. The entire map was a ref, and the resting and
pe
I have a system that consists of a map, of the rough form {1 [1 2 3] 2
[2 3 4]}. An update to the system chooses a couple random keys, looks
them up in the map, does some math with them, and writes two new
values. If one or both of the keys don't exist, they need to be
created and their values in
On Tue, Jan 24, 2012 at 8:49 AM, Ersin Er wrote:
> Hi,
>
> What does "conflicting transactions" actually mean in terms of Clojure STM?
> Are they write-write transactions on a data structure or are they more
> granularly considered conflicting for example if they ar
Hi,
What does "conflicting transactions" actually mean in terms of Clojure STM?
Are they write-write transactions on a data structure or are they more
granularly considered conflicting for example if they are manipulating the
same element of a target data structure (e.g. HashMap
