These are chat archives for RBMHTechnology/eventuate

4th
Jan 2018
Martin Krasser
@krasserm
Jan 04 2018 06:34
@Horusiath TreeMap keys are already sorted. Why do you additionally implement a custom sequential data structure using a Vertex[A].next pointer? You can navigate to next elements with TreeMap.iteratorFrom or TreeMap.keysIteratorFrom, for example.
Bartosz Sypytkowski
@Horusiath
Jan 04 2018 06:43
@krasserm it's because position of vertex must be absolute, but inserting elements in the middle is also possible. I.e. given replica A, and initial RGArrya of 3 items:
[A,1]: a
[A,2]: b
[A,3]: c
if we want to put next element d from replica A after [A,2], its own position will be [A,4], in result:
[A,1]: a
[A,2]: b
[A,4]: d
[A,3]: c
so the actual order of elements and order of positions don't have to be correlated
Bartosz Sypytkowski
@Horusiath
Jan 04 2018 06:48
I could use the position of previous element as tree map key, but then its own position is not indexed, making searches O(N)
or I could use two trees, one to mainitain the correct orders of elements in the sequence, and one for the actual position of given element...
Martin Krasser
@krasserm
Jan 04 2018 06:51
What about using a separate index for its own position?
That was concurrent :-)
same idea, right?
Bartosz Sypytkowski
@Horusiath
Jan 04 2018 06:51
I think, I can try
gabrielgiussi
@gabrielgiussi
Jan 04 2018 23:16

Hi everyone, I have a pure scala related question. Anyone could explain me how each CRDT Service is resolving the implicit param ops? (e.g. CounterService)

I almost got done the pure op implementation. BTW, I would like to add some quotes to the papers in the scaladoc but I guess it may be a legal issue. Should I ask permission to the authors?