eva.v2.datastructures.vector — com.workiva/eva 2.0.3

Implementation of an append-only immutable vector in secondary storage. This implementation should behave correctly and safely under concurrent attempts to read and write. Writing to the end of the vector and reading from any position in the vector should be O(1). This data structure is intended to support the immutable write-ahead transaction log backing an Eva database.

chunked-map clj

(chunked-map f batch-size coll)

Maps f over coll lazily in chunks of size batch-size

create-persisted-vector clj

(create-persisted-vector value-store)

flip clj

(flip f x y)

init-head clj

(init-head)

lazy-read-range clj

(lazy-read-range v x y)

(lazy-read-range v x y batch-size read-ahead)

Realizes elements [x..y], exclusive on y, from the persisted vector lazily. Will realize in chunks of size batch-size' and asynchronously will attempt to stayread-ahead' chunks ahead of the last-read chunk

next-head clj

(next-head cur-head)

nth-key clj

(nth-key head-key n)

open-persisted-vector clj

(open-persisted-vector value-store head-key)

read-range clj

(read-range v x y)

Realizes elements [x..y], exclusive on y,from the persisted vector in batch

realize-chunk clj

(realize-chunk store vs)

repair-vector-head clj

(repair-vector-head pv store)

Given the current vector cons, it's possible for a new key / entry to be created but the cas process on the head fails afterwards, leaving the vector in an unusable state, where the head is one value behind the true length of the vector. This function will attempt to repair that state.

We do the following:

1. Refresh the persisted vector to head state.

2. Confirm that the key beyond the end of the head state does exist. --> someone has repaired in the meantime, warn that this happened, return the refreshed vector.

3. Attempt to cas the head state manually. --> cas fails : throw an exception, concurrent attempts to repair.

4. Return the rebuilt vector.

set-cur-head-value clj

(set-cur-head-value pv head-value)