Fixed benchmark

Author: arienandalibi

raphtory-benchmark/benches/base.rs

@@ -1,5 +1,6 @@
 use criterion::{criterion_group, criterion_main, Criterion, Throughput};
 use raphtory::{graph_loader::lotr_graph::lotr_graph, prelude::*};
+use raphtory_api::core::storage::timeindex::AsTime;
 use raphtory_benchmark::common::{
     bootstrap_graph, run_graph_ops_benches, run_large_ingestion_benchmarks,
     run_proto_decode_benchmark, run_proto_encode_benchmark,
@@ -37,7 +38,7 @@ pub fn base(c: &mut Criterion) {
             for t in edge.history() {
                 layered_graph
                     .add_edge(
-                        t,
+                        t.t(),
                         edge.src().name().clone(),
                         edge.dst().name().clone(),
                         NO_PROPS,

raphtory-benchmark/src/common/mod.rs

@@ -301,7 +301,10 @@ pub fn run_analysis_benchmarks<F, G>(
 
     bench(group, "has_edge_existing", parameter, |b: &mut Bencher| {
         let mut rng = rand::thread_rng();
-        let (src, dst) = edges.iter().choose(&mut rng).expect("has_edge_existing: non-empty graph (graph().edges().iter() is empty)");
+        let (src, dst) = edges
+            .iter()
+            .choose(&mut rng)
+            .expect("has_edge_existing: non-empty graph (graph().edges().iter() is empty)");
         b.iter(|| graph.has_edge(src, dst))
     });
 
@@ -362,7 +365,10 @@ pub fn run_analysis_benchmarks<F, G>(
 
     bench(group, "has_node_existing", parameter, |b: &mut Bencher| {
         let mut rng = rand::thread_rng();
-        let v = nodes.iter().choose(&mut rng).expect("has_node_existing: non-empty graph (graph().nodes().id().iter() is empty)");
+        let v = nodes
+            .iter()
+            .choose(&mut rng)
+            .expect("has_node_existing: non-empty graph (graph().nodes().id().iter() is empty)");
         b.iter(|| graph.has_node(v))
     });
 
@@ -482,8 +488,14 @@ pub fn run_graph_ops_benches(
     // graph windowed
     let group_name = format!("{graph_name}_window_10");
     let mut graph_window_group_10 = c.benchmark_group(group_name);
-    let latest = graph.latest_time().expect("windowed graph latest time error: non-empty graph").t();
-    let earliest = graph.earliest_time().expect("windowed graph earliest time error: non-empty graph").t();
+    let latest = graph
+        .latest_time()
+        .expect("windowed graph latest time error: non-empty graph")
+        .t();
+    let earliest = graph
+        .earliest_time()
+        .expect("windowed graph earliest time error: non-empty graph")
+        .t();
     let start = latest - (latest - earliest) / 10;
     // graph_window_group_10.sample_size(10);
     let make_graph = || graph.window(start, latest + 1);
@@ -535,8 +547,14 @@ pub fn run_graph_ops_benches(
     let graph = layered_graph;
     let group_name = format!("{graph_name}_window_50_layered");
     let mut graph_window_layered_group_50 = c.benchmark_group(group_name);
-    let latest = graph.latest_time().expect("layered windowed graph latest time error: non-empty graph").t();
-    let earliest = graph.earliest_time().expect("layered windowed graph earliest time error: non-empty graph").t();
+    let latest = graph
+        .latest_time()
+        .expect("layered windowed graph latest time error: non-empty graph")
+        .t();
+    let earliest = graph
+        .earliest_time()
+        .expect("layered windowed graph earliest time error: non-empty graph")
+        .t();
     let start = latest - (latest - earliest) / 2;
     let make_graph = || {
         graph
@@ -556,8 +574,14 @@ pub fn run_graph_ops_benches(
 
     let group_name = format!("{graph_name}_persistent_window_50_layered");
     let mut graph_window_layered_group_50 = c.benchmark_group(group_name);
-    let latest = graph.latest_time().expect("layered windowed persistent graph latest time error: non-empty graph").t();
-    let earliest = graph.earliest_time().expect("layered windowed persistent graph earliest time error: non-empty graph").t();
+    let latest = graph
+        .latest_time()
+        .expect("layered windowed persistent graph latest time error: non-empty graph")
+        .t();
+    let earliest = graph
+        .earliest_time()
+        .expect("layered windowed persistent graph earliest time error: non-empty graph")
+        .t();
     let start = latest - (latest - earliest) / 2;
     let make_graph = || {
         graph