chore: Fix issues with playground build.

hydro-project · Dec 20, 2024 · f4da6ed · f4da6ed
1 parent d6bcb53
commit f4da6ed
Show file tree

Hide file tree

Showing 4 changed files with 10 additions and 10 deletions.
diff --git a/docs/docusaurus.config.js b/docs/docusaurus.config.js
@@ -169,8 +169,8 @@ const config = {
             title: 'Docs',
             items: [
               {
-                label: 'Hydroflow',
-                to: '/docs/hydroflow/',
+                label: 'DFIR',
+                to: '/docs/dfir/',
               },
               {
                 label: 'Hydro',

diff --git a/docs/src/pages/playground.js b/docs/src/pages/playground.js
@@ -14,7 +14,7 @@ let compile_DFIR = null;
 let compile_datalog = null;
 
 if (siteConfig.customFields.LOAD_PLAYGROUND === '1') {
-  compile_DFIR = playgroundJS.compile_DFIR;
+  compile_DFIR = playgroundJS.compile_dfir;
   compile_datalog = playgroundJS.compile_datalog;
 
   if (ExecutionEnvironment.canUseDOM) {
@@ -53,11 +53,11 @@ function MermaidGraph({ id, source }) {
 
 const DFIRExamples = {
   "Simplest": `\
-// https://hydro.run/docs/hydroflow/quickstart/example_1_simplest
+// https://hydro.run/docs/dfir/quickstart/example_1_simplest
 source_iter(0..10) -> for_each(|n| println!("Hello {}", n));`,
 
   "Simple": `\
-// https://hydro.run/docs/hydroflow/quickstart/example_2_simple
+// https://hydro.run/docs/dfir/quickstart/example_2_simple
 source_iter(0..10)
   -> map(|n| n * n)
   -> filter(|n| *n > 10)
@@ -115,7 +115,7 @@ inbound_chan[acks] -> [1]msg_send;
 inbound_chan[msgs] -> for_each(pretty_print_msg);`,
 
   "Graph Neighbors": `\
-// https://hydro.run/docs/hydroflow/quickstart/example_4_neighbors
+// https://hydro.run/docs/dfir/quickstart/example_4_neighbors
 // inputs: the origin vertex (vertex 0) and stream of input edges
 origin = source_iter(vec![0]);
 stream_of_edges = source_stream(edges_recv);
@@ -127,7 +127,7 @@ stream_of_edges -> [1]my_join;
 my_join -> unique() -> for_each(|n| println!("Reached: {}", n));`,
 
   "Graph Reachability": `\
-// https://hydro.run/docs/hydroflow/quickstart/example_5_reachability
+// https://hydro.run/docs/dfir/quickstart/example_5_reachability
 // inputs: the origin vertex (vertex 0) and stream of input edges
 origin = source_iter(vec![0]);
 stream_of_edges = source_stream(edges_recv);
@@ -142,7 +142,7 @@ my_join_tee[0] -> [1]reached_vertices;
 my_join_tee[1] -> unique() -> for_each(|x| println!("Reached: {}", x));`,
 
   "Graph Un-Reachability": `\
-// https://hydro.run/docs/hydroflow/quickstart/example_6_unreachability
+// https://hydro.run/docs/dfir/quickstart/example_6_unreachability
 origin = source_iter(vec![0]);
 stream_of_edges = source_stream(pairs_recv) -> tee();
 reached_vertices = union()->tee();

diff --git a/lattices/README.md b/lattices/README.md
@@ -18,7 +18,7 @@ freely distributed with no coordination overhead. The goal of the [Hydro Project
 is to allow users to write programs that automatically scale and distribute effortlessly.
 
 For more information on the underlying mathematics of lattices and monotonicity, take a look at
-[Lattice Math section of the Hydroflow Book](https://hydro.run/docs/hydroflow/lattices_crate/lattice_math)
+[Lattice Math section of the Hydroflow Book](https://hydro.run/docs/dfir/lattices_crate/lattice_math)
 and Section 2 of the [Hydroflow Thesis (2021)](https://hydro.run/papers/hydroflow-thesis.pdf).
 
 Take a look at the [`lattice` rustdocs](https://hydro-project.github.io/hydroflow/doc/lattices/index.html).

diff --git a/website_playground/src/lib.rs b/website_playground/src/lib.rs
@@ -98,7 +98,7 @@ pub struct HydroflowOutput {
 }
 
 #[wasm_bindgen]
-pub fn compile_hydroflow(
+pub fn compile_dfir(
     program: String,
     no_subgraphs: bool,
     no_varnames: bool,