Move tutorial implementation to examples directory

doc/docs/tutorial/fir_filter.md

@@ -147,4 +147,4 @@ impl<const N: usize> Valid<Array<u32, N>> {
 It takes an `Valid<Array<u32, N>>` and returns `Valid<u32>`. It transforms the ingress payload to sum of them.
 In the application-specific logic in `map` interface combinator, we use `fold_assoc` method which aggregates the data within array of signal.
 
-You can find the implementation in [fir_filter.rs](TODO).
+You can find the implementation in [fir_filter.rs](https://github.com/kaist-cp/hazardflow/blob/main/hazardflow-designs/src/examples/fir_filter.rs).

doc/docs/tutorial/masked_merge.md

@@ -1,7 +1,5 @@
 # Masked Merge
 
-In this tutorial, `masked_merge` combinator를 이용해서 resolver 개념을 modular design에 어떻게 활용할 수 있는지 알아볼 것이다.
-
 ## Specification
 
 <p align="center">
@@ -97,4 +95,6 @@ pub fn m(ingress: [Vr<u32>; 5]) -> Vr<u32> {
 }
 ```
 
+You can find the implementation in [masked_merge.rs](https://github.com/kaist-cp/hazardflow/blob/main/hazardflow-designs/src/examples/masked_merge.rs).
+
 Congratulations! You finished the tutorial!

hazardflow-designs/src/examples/mod.rs

@@ -0,0 +1,4 @@
+//! HazardFlow examples.
+
+pub mod fir_filter;
+pub mod masked_merge;

hazardflow-designs/src/lib.rs

@@ -43,8 +43,7 @@
 #![register_tool(hazardflow)]
 
 pub mod cpu;
-pub mod fir_filter;
+pub mod examples;
 pub mod gemmini;
-pub mod masked_merge;
 pub mod prelude;
 pub mod std;