Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Work around apparent timely glitch #305

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Work around apparent timely glitch #305

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 6 additions & 3 deletions dogsdogsdogs/src/operators/lookup_map.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -78,13 +78,16 @@ where
// to observe the frontier and to drive scheduling.
input2.for_each(|_, _| { });

if let Some(ref mut trace) = propose_trace {
// Frontier for receiving the upper bound of `arrangement`.
let mut input2_trace_frontier = Antichain::new();

if let Some(ref mut trace) = propose_trace {
trace.read_upper(&mut input2_trace_frontier);
for (capability, prefixes) in stash.iter_mut() {

// defer requests at incomplete times.
// NOTE: not all updates may be at complete times, but if this test fails then none of them are.
if !input2.frontier.less_equal(capability.time()) {
if !input2_trace_frontier.less_equal(capability.time()) {

let mut session = output.session(capability);

Expand All @@ -98,7 +101,7 @@ where
let (mut cursor, storage) = trace.cursor();

for &mut (ref prefix, ref time, ref mut diff) in prefixes.iter_mut() {
if !input2.frontier.less_equal(time) {
if !input2_trace_frontier.less_equal(time) {
logic2(prefix, &mut key1);
cursor.seek_key(&storage, &key1);
if cursor.get_key(&storage) == Some(&key1) {
Expand Down