move to data structures

Cargo.toml

@@ -206,11 +206,11 @@ path = "examples/helpers/lis_handmade.rs"
 
 [[example]]
 name = "range_container_aizu"
-path = "examples/helpers/range_container_aizu.rs"
+path = "examples/data_structures/range_container_aizu.rs"
 
 [[example]]
 name = "range_container_handmade"
-path = "examples/helpers/range_container_handmade.rs"
+path = "examples/data_structures/range_container_handmade.rs"
 
 [[example]]
 name = "mono_st"

examples/helpers/range_container_aizu.rs → examples/data_structures/range_container_aizu.rs

@@ -1,7 +1,7 @@
 // verification-helper: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_D
 
 use proconio::input;
-use programming_team_code_rust::helpers::range_container::RangeContainer;
+use programming_team_code_rust::data_structures::range_container::RangeContainer;
 
 fn main() {
     input! {

examples/helpers/range_container_handmade.rs → examples/data_structures/range_container_handmade.rs

@@ -1,6 +1,6 @@
 // verification-helper: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/lesson/2/ITP1/all/ITP1_1_A
 
-use programming_team_code_rust::helpers::range_container::RangeContainer;
+use programming_team_code_rust::data_structures::range_container::RangeContainer;
 use rand::{thread_rng, Rng};
 use std::collections::BTreeMap;
 

src/data_structures/mod.rs

@@ -3,6 +3,7 @@ pub mod binary_trie;
 pub mod disjoint_rmq;
 pub mod fenwick;
 pub mod lazy_seg_tree;
+pub mod range_container;
 pub mod rmq;
 pub mod seg_tree;
 pub mod trie;

src/helpers/mod.rs

@@ -1,5 +1,4 @@
 //! # Helpers
 pub mod compress;
 pub mod lis;
-pub mod range_container;
 pub mod unsafe_recursive_closure;