pub struct TupleUnion<S: TupleSummary> { /* private fields */ }Expand description
A streaming union over generic Tuple sketches. Summaries for a key present
in more than one input are merged with
TupleSummary::union_combine.
Implementations§
Source§impl<S: TupleSummary> TupleUnion<S>
impl<S: TupleSummary> TupleUnion<S>
Sourcepub fn update(&mut self, input: &impl TupleInput<S>)
pub fn update(&mut self, input: &impl TupleInput<S>)
Merges the given sketch into the running result.
Infallible: unlike ArrayOfDoubles there is no num_values to agree
on — the type system already guarantees both operands carry S.
Examples found in repository?
examples/tuple_generic.rs (line 94)
63fn main() {
64 let mut january: TupleSketch<Activity> = TupleSketchBuilder::new().lg_k(12).build().unwrap();
65 for user in 0..10_000u64 {
66 january.update_u64(
67 user,
68 &Event {
69 revenue_cents: 250 + (user % 100),
70 country: if user % 2 == 0 { "GB" } else { "US" },
71 },
72 );
73 }
74
75 let mut february: TupleSketch<Activity> = TupleSketchBuilder::new().lg_k(12).build().unwrap();
76 for user in 5_000..15_000u64 {
77 february.update_u64(
78 user,
79 &Event {
80 revenue_cents: 400,
81 country: "US",
82 },
83 );
84 }
85
86 println!("January unique users: {:.0}", january.get_estimate());
87 println!("February unique users: {:.0}", february.get_estimate());
88
89 // Union: everyone who appeared in either month, with their activity merged.
90 let mut union = TupleUnionBuilder::<Activity>::new()
91 .lg_k(12)
92 .build()
93 .unwrap();
94 union.update(&january);
95 union.update(&february);
96 let combined = union.get_result(true);
97 println!("Users across both months: {:.0}", combined.get_estimate());
98
99 // Per-entry summaries are the point of a Tuple sketch. Scale the retained
100 // sample back up by 1/theta to estimate population totals.
101 let retained_revenue: u64 = combined.entries().map(|(_, a)| a.revenue_cents).sum();
102 let biggest_order = combined
103 .entries()
104 .map(|(_, a)| a.largest_order_cents)
105 .max()
106 .unwrap_or(0);
107 println!(
108 "Estimated total revenue: {:.2} (from {} retained entries, theta = {:.4})",
109 (retained_revenue as f64 / combined.get_theta()) / 100.0,
110 combined.get_num_retained(),
111 combined.get_theta()
112 );
113 println!(
114 "Largest single order seen: {:.2}",
115 biggest_order as f64 / 100.0
116 );
117
118 // Intersection: users active in both months.
119 let mut intersection = TupleIntersection::<Activity>::new();
120 intersection.update(&january);
121 intersection.update(&february);
122 match intersection.get_result(true) {
123 Ok(returning) => {
124 println!("Returning users: {:.0}", returning.get_estimate());
125 // `intersection_combine`'s `min` semantics at work: a returning
126 // user's sessions/countries reflect only what showed up in BOTH
127 // months, not the union of the two.
128 if let Some((_, activity)) = returning.entries().next() {
129 println!(
130 " e.g. one returning user: {} session(s), countries seen in both months: {:?}",
131 activity.sessions, activity.countries
132 );
133 }
134 }
135 Err(e) => println!("No intersection result: {e}"),
136 }
137
138 // A-not-b: users who churned after January.
139 let churned = TupleAnotB::<Activity>::new().compute(&january, &february, true);
140 println!("Churned after January: {:.0}", churned.get_estimate());
141
142 // Jaccard similarity of the two months' audiences.
143 let similarity = tuple_jaccard_similarity(&january, &february);
144 println!(
145 "Audience overlap (Jaccard): {:.3} (range [{:.3}, {:.3}])",
146 similarity.estimate, similarity.lower_bound, similarity.upper_bound
147 );
148}Sourcepub fn get_result(&self, ordered: bool) -> CompactTupleSketch<S>
pub fn get_result(&self, ordered: bool) -> CompactTupleSketch<S>
Returns the union’s current result. If ordered is true, entries
are sorted by hash value.
Examples found in repository?
examples/tuple_generic.rs (line 96)
63fn main() {
64 let mut january: TupleSketch<Activity> = TupleSketchBuilder::new().lg_k(12).build().unwrap();
65 for user in 0..10_000u64 {
66 january.update_u64(
67 user,
68 &Event {
69 revenue_cents: 250 + (user % 100),
70 country: if user % 2 == 0 { "GB" } else { "US" },
71 },
72 );
73 }
74
75 let mut february: TupleSketch<Activity> = TupleSketchBuilder::new().lg_k(12).build().unwrap();
76 for user in 5_000..15_000u64 {
77 february.update_u64(
78 user,
79 &Event {
80 revenue_cents: 400,
81 country: "US",
82 },
83 );
84 }
85
86 println!("January unique users: {:.0}", january.get_estimate());
87 println!("February unique users: {:.0}", february.get_estimate());
88
89 // Union: everyone who appeared in either month, with their activity merged.
90 let mut union = TupleUnionBuilder::<Activity>::new()
91 .lg_k(12)
92 .build()
93 .unwrap();
94 union.update(&january);
95 union.update(&february);
96 let combined = union.get_result(true);
97 println!("Users across both months: {:.0}", combined.get_estimate());
98
99 // Per-entry summaries are the point of a Tuple sketch. Scale the retained
100 // sample back up by 1/theta to estimate population totals.
101 let retained_revenue: u64 = combined.entries().map(|(_, a)| a.revenue_cents).sum();
102 let biggest_order = combined
103 .entries()
104 .map(|(_, a)| a.largest_order_cents)
105 .max()
106 .unwrap_or(0);
107 println!(
108 "Estimated total revenue: {:.2} (from {} retained entries, theta = {:.4})",
109 (retained_revenue as f64 / combined.get_theta()) / 100.0,
110 combined.get_num_retained(),
111 combined.get_theta()
112 );
113 println!(
114 "Largest single order seen: {:.2}",
115 biggest_order as f64 / 100.0
116 );
117
118 // Intersection: users active in both months.
119 let mut intersection = TupleIntersection::<Activity>::new();
120 intersection.update(&january);
121 intersection.update(&february);
122 match intersection.get_result(true) {
123 Ok(returning) => {
124 println!("Returning users: {:.0}", returning.get_estimate());
125 // `intersection_combine`'s `min` semantics at work: a returning
126 // user's sessions/countries reflect only what showed up in BOTH
127 // months, not the union of the two.
128 if let Some((_, activity)) = returning.entries().next() {
129 println!(
130 " e.g. one returning user: {} session(s), countries seen in both months: {:?}",
131 activity.sessions, activity.countries
132 );
133 }
134 }
135 Err(e) => println!("No intersection result: {e}"),
136 }
137
138 // A-not-b: users who churned after January.
139 let churned = TupleAnotB::<Activity>::new().compute(&january, &february, true);
140 println!("Churned after January: {:.0}", churned.get_estimate());
141
142 // Jaccard similarity of the two months' audiences.
143 let similarity = tuple_jaccard_similarity(&january, &february);
144 println!(
145 "Audience overlap (Jaccard): {:.3} (range [{:.3}, {:.3}])",
146 similarity.estimate, similarity.lower_bound, similarity.upper_bound
147 );
148}Trait Implementations§
impl<S: TupleSummary> Send for TupleUnion<S>
Auto Trait Implementations§
impl<S> !Sync for TupleUnion<S>
impl<S> Freeze for TupleUnion<S>
impl<S> RefUnwindSafe for TupleUnion<S>
impl<S> Unpin for TupleUnion<S>
impl<S> UnsafeUnpin for TupleUnion<S>
impl<S> UnwindSafe for TupleUnion<S>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more