Packages
cubdb
1.0.0-rc.8
2.0.2
2.0.1
2.0.0
2.0.0-rc.1
1.1.0
1.0.0
1.0.0-rc.10
1.0.0-rc.9
1.0.0-rc.8
1.0.0-rc.7
1.0.0-rc.6
1.0.0-rc.5
1.0.0-rc.4
1.0.0-rc.3
1.0.0-rc.2
1.0.0-rc.1
0.17.0
0.16.4
0.16.3
0.16.2
0.16.1
0.16.0
0.15.0
0.14.0
0.13.1
0.13.0
0.12.0
0.11.0
0.10.0
0.9.0
0.8.0
0.7.0
0.6.0
0.5.0
0.4.0
0.3.0
0.2.0
0.1.4
0.1.3
0.1.2
0.1.1
0.1.0
A pure-Elixir embedded key-value database
Current section
Files
Jump to
Current section
Files
lib/cubdb/catch_up.ex
defmodule CubDB.CatchUp do
@moduledoc false
# The `CubDB.CatchUp` module takes care of catching up a compacted Btree with
# updates performed on the live Btree during a compaction process. The
# catch-up process is ran in the background, does not block read/write
# operations, and can be started multiple times until the compacted Btree is
# in sync with the live one.
#
# The catch-up is performed by iterating through all updates happened after
# the compaction (or the last catch-up) started, using the `Btree.Diff`
# enumerable to enumerate updates between two Btrees representing two
# snapshots of the same (live) store.
use Task
alias CubDB.Btree
@value Btree.__value__()
@deleted Btree.__deleted__()
@spec run(pid, Btree.t(), Btree.t(), Btree.t()) :: :ok
def run(caller, compacted_btree, original_btree, latest_btree) do
compacted_btree = catch_up(compacted_btree, original_btree, latest_btree)
send(caller, {:catch_up, compacted_btree, latest_btree})
end
defp catch_up(compacted_btree, original_btree, latest_btree) do
diff = Btree.Diff.new(original_btree, latest_btree)
Enum.reduce(diff, compacted_btree, fn
{key, {@value, value}}, compacted_btree ->
Btree.insert(compacted_btree, key, value)
{key, @deleted}, compacted_btree ->
Btree.delete(compacted_btree, key)
end)
|> Btree.commit()
end
end