CURATOR-151: SharedValue/SharedCount API update

Let me elaborate a little on the race condition this solves.

Imagine the current value is (1, A) you have one thread calling trySetValue(B) another calling trySetValue(C) at the same time.  Imagine thread 1 succeeds in making the server call first and updating the server value to (2, B) and immediately afterwards thread 2 succeeds in calling the server and updating the server value to (3, C).   But to due to thread scheduling or what have you, both threads actually enter updateValue() at the same time.  How do we ensure that the correct value ends up in currentValue when both threads exit updateValue so that the client has the correct server state?

That's what the compare-and-set loop solves.  Imagine both threads enter the loop and initially read current as (1, A).  Then they both try to compare and set (1, A) to either (2, B) or (3, C).  Only one of them can win the race.  If (2, B) gets set, then the first thread will return and the second thread will try again, and this time succeed in updating (2, B) -> (3, C).  If (3, C) gets set then the second thread will return, and the first thread will try again.  But this time it will exit out because it will see that someone else already set a higher-versioned value.

This actually solves several potential races, between threads calling setValue/trySetValue at the same time and also any threads that could be calling readValue() at the same time (watcher, failed trySetValue(), or even the start() call).