|
|
@@ -9,7 +9,7 @@
|
|
|
// fields. The example here imagines a cell of a binary search tree,
|
|
|
// where you would want the key to be additively shared (so that you can
|
|
|
// easily do comparisons), the pointers field to be XOR shared (so that
|
|
|
-// you do easily do bit operations to pack two pointers and maybe some
|
|
|
+// you can easily do bit operations to pack two pointers and maybe some
|
|
|
// tree balancing information into one field) and the value doesn't
|
|
|
// really matter, but XOR shared is usually slightly more efficient.
|
|
|
|
