74 lines
3.9 KiB
C#
74 lines
3.9 KiB
C#
using System;
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
using System.Reactive.Linq;
|
|
|
|
namespace bts.api.core {
|
|
static class TableUpdateFullJoin {
|
|
public static IObservable<TableUpdate<TResult, TKey>> Create<TLeft, TKey, TRight, TResult>(
|
|
IObservable<TableUpdate<TLeft, TKey>> left_source,
|
|
IObservable<TableUpdate<TRight, TKey>> right_source,
|
|
Func<TLeft, TKey> left_key,
|
|
Func<TRight, TKey> right_key,
|
|
Func<TLeft, TRight, TKey, TResult> result_selector,
|
|
Func<TLeft, TKey, TResult> absent_right_result_selector,
|
|
Func<TRight, TKey, TResult> absent_left_result_selector,
|
|
Func<TResult, TKey> result_key)
|
|
where TKey : IEquatable<TKey> {
|
|
return left_source.AggregateLatest<TableUpdate<TLeft, TKey>, TableUpdate<TRight, TKey>, (TableUpdate<TResult, TKey> result, IReadOnlyDictionary<TKey, TLeft> left_state, IReadOnlyDictionary<TKey, TRight> right_state), TableUpdate<TResult, TKey>>(right_source,
|
|
process_left,
|
|
process_right,
|
|
() => (TableUpdate<TResult, TKey>.mk_empty(result_key), new Dictionary<TKey, TLeft>(0), new Dictionary<TKey, TRight>(0)),
|
|
t => t.result,
|
|
TableUpdate<TLeft, TKey>.mk_empty(left_key), TableUpdate<TRight, TKey>.mk_empty(right_key));
|
|
// left
|
|
(TableUpdate<TResult, TKey> result, IReadOnlyDictionary<TKey, TLeft> left_state, IReadOnlyDictionary<TKey, TRight> right_state) process_left(
|
|
(TableUpdate<TResult, TKey> result, IReadOnlyDictionary<TKey, TLeft> left_state, IReadOnlyDictionary<TKey, TRight> right_state) state,
|
|
Change<TableUpdate<TLeft, TKey>> change,
|
|
TableUpdate<TRight, TKey> right) {
|
|
var builder = state.result.to_builder();
|
|
foreach (var v in change.New.removed.Concat(change.New.changes.Old())) {
|
|
var k = left_key(v);
|
|
if (state.right_state.TryGetValue(k, out var rval)) {
|
|
builder.add_or_update(absent_left_result_selector(rval, k));
|
|
} else {
|
|
builder.remove(k);
|
|
}
|
|
}
|
|
foreach (var v in change.New.added.Concat(change.New.changes.New())) {
|
|
var k = left_key(v);
|
|
if (state.right_state.TryGetValue(k, out var rval)) {
|
|
builder.add_or_update(result_selector(v, rval, k));
|
|
} else {
|
|
builder.add_or_update(absent_right_result_selector(v, k));
|
|
}
|
|
}
|
|
return (builder.to_table(), change.New.state, state.right_state);
|
|
}
|
|
// right
|
|
(TableUpdate<TResult, TKey> result, IReadOnlyDictionary<TKey, TLeft> left_state, IReadOnlyDictionary<TKey, TRight> right_state) process_right(
|
|
(TableUpdate<TResult, TKey> result, IReadOnlyDictionary<TKey, TLeft> left_state, IReadOnlyDictionary<TKey, TRight> right_state) state,
|
|
TableUpdate<TLeft, TKey> left,
|
|
Change<TableUpdate<TRight, TKey>> change) {
|
|
var builder = state.result.to_builder();
|
|
foreach (var v in change.New.removed) {
|
|
var k = right_key(v);
|
|
if (state.left_state.TryGetValue(k, out var lval)) {
|
|
builder.add_or_update(absent_right_result_selector(lval, k));
|
|
} else {
|
|
builder.remove(k);
|
|
}
|
|
}
|
|
foreach (var v in change.New.added.Concat(change.New.changed)) {
|
|
var k = right_key(v);
|
|
if (state.left_state.TryGetValue(k, out var lval)) {
|
|
builder.add_or_update(result_selector(lval, v, k));
|
|
} else {
|
|
builder.add_or_update(absent_left_result_selector(v, k));
|
|
}
|
|
}
|
|
return (builder.to_table(), state.left_state, change.New.state);
|
|
}
|
|
}
|
|
}
|
|
} |