weaselbot/conflict-set
1
Fork 0
forked from weaselab/conflict-set
Code Pull Requests Activity

Tidying

Browse Source
This commit is contained in:
andrew
2024-03-07 12:33:34 -08:00
parent 53bc36f628
commit be43143891
2 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
ConflictSet.cpp
-1
View File
@@ -534,7 +534,6 @@ Node *getChildNodeGeq(Node *self, int child) {
int c = self256->bitSet.firstSetGeq(child); int c = self256->bitSet.firstSetGeq(child);
return c >= 0 ? self256->children[c].child : nullptr; return c >= 0 ? self256->children[c].child : nullptr;
} }
return nullptr;
} }
void setChildrenParents(Node4 *n) { void setChildrenParents(Node4 *n) {
paper/paper.tex
+1 -1
View File
@@ -72,7 +72,7 @@ Each node shows its partial prefix annotated with $(max,point,range)$.
\subsection{Checking point reads} \subsection{Checking point reads}
The algorithm for checking point reads follows directly from the definitions of the \emph{point} and \emph{range}. The algorithm for checking point reads follows directly from the definitions of the \emph{point} and \emph{range} fields.
Our input is a key $k$ and a read version $r$, and we must report whether or not the write version $v_{k}$ of $k$ is less than or equal to $r$. Our input is a key $k$ and a read version $r$, and we must report whether or not the write version $v_{k}$ of $k$ is less than or equal to $r$.
In order to find $v_{k}$, we search for the node whose prefix matches $k$. In order to find $v_{k}$, we search for the node whose prefix matches $k$.
If such a node exists and has \emph{point} set, then $v_{k}$ is its \emph{point} field. If such a node exists and has \emph{point} set, then $v_{k}$ is its \emph{point} field.