diff options
| author | JSDurand <mmemmew@gmail.com> | 2023-07-08 12:30:21 +0800 |
|---|---|---|
| committer | JSDurand <mmemmew@gmail.com> | 2023-07-08 12:31:13 +0800 |
| commit | 9a317e56f8a6126583f7d0c431bf878d9b1fe7b1 (patch) | |
| tree | 7bb6004196b38446a5ab0cb3a0ab642d35f113e9 /graph/src/labelled | |
| parent | 691f969eb104fa3d4c2a1667693fd0382eb9d6b5 (diff) | |
Finished the Emacs binding.
Now the binding part is finished.
What remains is a bug encountered when planting a fragment to the
forest which intersects a packed node, which would lead to invalid
forests. This will also cause problem when planting a packed
fragment, but until now my testing grammars do not produce packed
fragments, so this problem is not encountered yet.
I am still figuring out efficient ways to solve this problem.
Diffstat (limited to 'graph/src/labelled')
| -rw-r--r-- | graph/src/labelled/binary.rs | 4 |
1 files changed, 3 insertions, 1 deletions
diff --git a/graph/src/labelled/binary.rs b/graph/src/labelled/binary.rs index 9f3afa8..ccbd5cb 100644 --- a/graph/src/labelled/binary.rs +++ b/graph/src/labelled/binary.rs @@ -214,9 +214,11 @@ impl<T: GraphLabel> Graph for PLGraph<T> { let mut post = String::new(); - // FIXME: Find a way to print only used nodes. Maybe remove + // SOLVED: Find a way to print only used nodes. Maybe remove // unwanted edges from unwanted nodes, so that we can print // out only those used nodes. + // + // This is solved as we can extract the forest out. for node in self.nodes() { post.push_str(&format!( |