-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #46 from faassen/trait-docs
Improve traits and document them
- Loading branch information
Showing
6 changed files
with
198 additions
and
37 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
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,103 @@ | ||
| // tests that exercise the public API, especially the traits | ||
|
|
||
| use fm_index::{FMIndexBackend, HeapSize}; | ||
|
|
||
| fn len<T: FMIndexBackend>(index: &T) -> u64 { | ||
| index.len() | ||
| } | ||
|
|
||
| fn size<T: HeapSize>(t: &T) -> usize { | ||
| t.size() | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_fm_index_backend_trait_fm_index_suffix_array() { | ||
| let builder = fm_index::SearchIndexBuilder::new(); | ||
| let text = "text"; | ||
|
|
||
| let index = builder.build(text.as_bytes().to_vec()); | ||
|
|
||
| // any result will do for this test | ||
| assert_eq!(len(&index), 5); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_heap_size_trait_fm_index_suffix_array() { | ||
| let builder = fm_index::SearchIndexBuilder::new(); | ||
| let text = "text"; | ||
|
|
||
| let index = builder.build(text.as_bytes().to_vec()); | ||
|
|
||
| // any result will do for this test | ||
| assert!(size(&index) > 0); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_fm_index_backend_trait_fm_index_count_only() { | ||
| let builder = fm_index::SearchIndexBuilder::new().count_only(); | ||
| let text = "text"; | ||
|
|
||
| let index = builder.build(text.as_bytes().to_vec()); | ||
|
|
||
| // any result will do for this test | ||
| assert_eq!(len(&index), 5); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_heap_size_trait_fm_index_count_only() { | ||
| let builder = fm_index::SearchIndexBuilder::new().count_only(); | ||
| let text = "text"; | ||
|
|
||
| let index = builder.build(text.as_bytes().to_vec()); | ||
|
|
||
| // any result will do for this test | ||
| assert!(size(&index) > 0); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_fm_index_backend_trait_rlfm_index_suffix_array() { | ||
| let builder = fm_index::SearchIndexBuilder::new().run_length_encoding(); | ||
| let text = "text"; | ||
|
|
||
| let index = builder.build(text.as_bytes().to_vec()); | ||
|
|
||
| // any result will do for this test | ||
| assert_eq!(len(&index), 5); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_heap_size_trait_rlfm_index_suffix_array() { | ||
| let builder = fm_index::SearchIndexBuilder::new().run_length_encoding(); | ||
| let text = "text"; | ||
|
|
||
| let index = builder.build(text.as_bytes().to_vec()); | ||
|
|
||
| // any result will do for this test | ||
| assert!(size(&index) > 0); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_fm_index_backend_trait_rlfm_index_count_only() { | ||
| let builder = fm_index::SearchIndexBuilder::new() | ||
| .count_only() | ||
| .run_length_encoding(); | ||
| let text = "text"; | ||
|
|
||
| let index = builder.build(text.as_bytes().to_vec()); | ||
|
|
||
| // any result will do for this test | ||
| assert_eq!(len(&index), 5); | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_heap_size_trait_rlfm_index_count_only() { | ||
| let builder = fm_index::SearchIndexBuilder::new() | ||
| .count_only() | ||
| .run_length_encoding(); | ||
| let text = "text"; | ||
|
|
||
| let index = builder.build(text.as_bytes().to_vec()); | ||
|
|
||
| // any result will do for this test | ||
| assert!(size(&index) > 0); | ||
| } |