From 9e907eca4eae64ddf546431b34b73a4e2cd9be23 Mon Sep 17 00:00:00 2001
From: JSDurand <mmemmew@gmail.com>
Date: Wed, 19 Jul 2023 13:49:14 +0800
Subject: graph: Add a future plan.

* graph/src/lib.rs: Add a plan to reduce the number of
  bounds-checking.  Hopefully this makes the package more efficient.
---
 graph/src/lib.rs | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/graph/src/lib.rs b/graph/src/lib.rs
index 87f39c0..9e5b1cc 100644
--- a/graph/src/lib.rs
+++ b/graph/src/lib.rs
@@ -289,6 +289,10 @@ pub trait LabelGraph<T: GraphLabel>: Graph {
     where
         Self: 'a;
 
+    // TODO: Add a type that iterates through children and labels of
+    // children simultaneously.  This can reduce the number of bounds
+    // checking.
+
     /// A type that iterates through labels.
     type LabelIter<'a>: Iterator<Item = (&'a T, <Self as LabelGraph<T>>::Iter<'a>)> + 'a
     where
-- 
cgit v1.2.3-18-g5258