-
Notifications
You must be signed in to change notification settings - Fork 22
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'main' into tree-data-trait
Conflicts: .github/workflows/rust.yml Cargo.toml benches/bench.rs examples/example.rs src/flatten.rs src/lib.rs src/tree_state.rs
- Loading branch information
Showing
5 changed files
with
177 additions
and
97 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,87 @@ | ||
| use std::collections::HashSet; | ||
|
|
||
| use crate::{Node, TreeItem}; | ||
|
|
||
| /// Recursive implementation of [`TreeData::get_nodes`](crate::TreeData::get_nodes) for [`TreeItem`]s. | ||
| #[must_use] | ||
| pub fn flatten<Identifier>( | ||
| open_identifiers: &HashSet<Vec<Identifier>>, | ||
| items: &[TreeItem<'_, Identifier>], | ||
| current: &[Identifier], | ||
| ) -> Vec<Node<Identifier>> | ||
| where | ||
| Identifier: Clone + PartialEq + Eq + core::hash::Hash, | ||
| { | ||
| let mut result = Vec::new(); | ||
| for item in items { | ||
| let mut child_identifier = current.to_vec(); | ||
| child_identifier.push(item.identifier.clone()); | ||
|
|
||
| let child_result = open_identifiers | ||
| .contains(&child_identifier) | ||
| .then(|| flatten(open_identifiers, &item.children, &child_identifier)); | ||
|
|
||
| result.push(Node { | ||
| identifier: child_identifier, | ||
| has_children: !item.children.is_empty(), | ||
| height: item.text.height(), | ||
| }); | ||
|
|
||
| if let Some(mut child_result) = child_result { | ||
| result.append(&mut child_result); | ||
| } | ||
| } | ||
| result | ||
| } | ||
|
|
||
| #[test] | ||
| fn depth_works() { | ||
| let mut opened = HashSet::new(); | ||
| opened.insert(vec!["b"]); | ||
| opened.insert(vec!["b", "d"]); | ||
| let depths = flatten(&opened, &TreeItem::example(), &[]) | ||
| .into_iter() | ||
| .map(|flattened| flattened.depth()) | ||
| .collect::<Vec<_>>(); | ||
| assert_eq!(depths, [0, 0, 1, 1, 2, 2, 1, 0]); | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| fn flatten_works(opened: &HashSet<Vec<&'static str>>, expected: &[&str]) { | ||
| let items = TreeItem::example(); | ||
| let result = flatten(opened, &items, &[]); | ||
| let actual = result | ||
| .into_iter() | ||
| .map(|flattened| flattened.identifier.into_iter().last().unwrap()) | ||
| .collect::<Vec<_>>(); | ||
| assert_eq!(actual, expected); | ||
| } | ||
|
|
||
| #[test] | ||
| fn get_opened_nothing_opened_is_top_level() { | ||
| let opened = HashSet::new(); | ||
| flatten_works(&opened, &["a", "b", "h"]); | ||
| } | ||
|
|
||
| #[test] | ||
| fn get_opened_wrong_opened_is_only_top_level() { | ||
| let mut opened = HashSet::new(); | ||
| opened.insert(vec!["a"]); | ||
| opened.insert(vec!["b", "d"]); | ||
| flatten_works(&opened, &["a", "b", "h"]); | ||
| } | ||
|
|
||
| #[test] | ||
| fn get_opened_one_is_opened() { | ||
| let mut opened = HashSet::new(); | ||
| opened.insert(vec!["b"]); | ||
| flatten_works(&opened, &["a", "b", "c", "d", "g", "h"]); | ||
| } | ||
|
|
||
| #[test] | ||
| fn get_opened_all_opened() { | ||
| let mut opened = HashSet::new(); | ||
| opened.insert(vec!["b"]); | ||
| opened.insert(vec!["b", "d"]); | ||
| flatten_works(&opened, &["a", "b", "c", "d", "e", "f", "g", "h"]); | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters