缩短readme中的长行

Author: Natural-selection1

README.md

@@ -1,14 +1,18 @@
 # better_comprehension
 
-在rust中的集合推导式和迭代器推导式。提供更好的Rust使用体验。
+在rust中的集合推导式和迭代器推导式。提供更好的Rust使用体验
+
 Collection comprehension and Iterator comprehension in Rust. And it provides a better experience in Rust.
 
 # Usage
 语法源自[python推导式](https://docs.python.org/3/tutorial/datastructures.html#list-comprehensions)。
-本库为Rust标准库中的所有集合类型提供宏，以及基于引用的迭代器。
+本库为Rust标准库中的所有集合类型提供宏，以及基于引用的迭代器
+
 The syntax is derived from [Python's comprehension](https://docs.python.org/3/tutorial/datastructures.html#list-comprehensions).
+
 This library provides macros for all collection types in the Rust standard library and an Iterator based on references.
 
+---
 简单示例
 simple example
 ```rust
@@ -17,7 +21,9 @@ let vec: Vec<String> = vector![x.clone() for x in vec_1];
 assert_eq!(vec, vec!["AB".to_string(), "CD".to_string()]);
 ```
 
+---
 你也可以在推导式中使用模式
+
 You can also use patterns in it
 ```rust
 struct Person {
@@ -29,15 +35,17 @@ let people = [Person { name: "Joe".to_string(), age: 20 },
 let vec_deque = vec_deque![name.clone() for Person { name, .. } in people];
 assert_eq!(vec_deque, VecDeque::from(["Joe".to_string(), "Bob".to_string()]));
 ```
-
+---
 过滤值
+
 filtering values
 ```rust
 let linked_list = linked_list![ i*2 for i in 1..=3 if i != 2 ];
 assert_eq!(linked_list, LinkedList::from([2, 6]));
 ```
-
+---
 根据条件返回不同的值
+
 return different values based on conditions
 ```rust
 let b_tree_set = b_tree_set!{
@@ -46,8 +54,9 @@ let b_tree_set = b_tree_set!{
     };
 assert_eq!(b_tree_set, BTreeSet::from([1, 13]));
 ```
-
+---
 嵌套推导式
+
 nested comprehension
 ```rust
 let binary_heap = binary_heap![
@@ -56,8 +65,9 @@ let binary_heap = binary_heap![
     for j in 1..=3 if j+i != 4];
 assert_eq!(binary_heap.into_sorted_vec(), vec![1, 1, 3, 13]);
 ```
-
+---
 和python的推导式一样, 本库的for循环是从上到下读取的.
+
 the reading order of the for loop in this library is from top to bottom, just like Python's comprehension.
 ```rust
 let vec = vector![
@@ -68,7 +78,9 @@ assert_eq!(vec, vec![(1, 4), (1, 5), (1, 6), (3, 4), (3, 5), (3, 6)]);
 ```
 
 需要注意的是, 由于在rust中, for loop 是消耗所有权的.
+
 所以通常来说, 对于多层循环, 如果你希望原容器被消耗, 你应该写成如下这样:
+
 Note that in Rust, for loops consume ownership.
 So typically, for nested loops, if you want the original container to be consumed, you should write it like this:
 
@@ -114,8 +126,11 @@ println!("{:?}", vec_2); // work well
 ```
 
 但在本库中, 你不需要这么做, 提供的宏会自动帮你处理这些问题.
-你唯一需要做的就是在你想要保留所有权的变量后面加上.iter() 或 使用 & , 其余会在宏内自动处理.
+
 But in this library, you don't need to do this, the provided macros will automatically handle these problems for you.
+
+你唯一需要做的就是在你想要保留所有权的变量后面加上.iter() 或 使用 & , 其余会在宏内自动处理.
+
 You only need to add .iter() or use & before the variable you want to keep ownership, the rest will be automatically handled in the macro.
 ```rust
 let vec_1 = vec!["ABC".to_string(), "DEF".to_string()];
@@ -155,9 +170,15 @@ let vec_key = vec!["key_1".to_string(), "key_2".to_string(), "key_3".to_string()
     );
 ```
 
-该库也支持迭代器推导式, 但不同于上面的集合推导式, 该迭代器推导式是基于引用的, 所以不会消耗所有权.
-除此之外的写法与集合推导式完全相同.
-Iterator comprehension is also supported, but unlike the collection comprehension above, this iterator comprehension is based on references, so it will not consume ownership.
+该库也支持迭代器推导式, 但不同于上面的集合推导式
+
+该迭代器推导式是基于引用的, 所以不会消耗所有权
+
+除此之外的写法与集合推导式完全相同
+
+Iterator comprehension is also supported,but unlike the collection comprehension above,
+
+this iterator comprehension is based on references,so it will not consume ownership.
 ```rust
 let vec_1 = ["123".to_string(), "456".to_string(), "789".to_string()];
 let vec_2 = ["ABC".to_string(), "DEF".to_string(), "GHI".to_string()];
@@ -186,6 +207,7 @@ None
 ```
 
 以上写法与下面的写法是完全的等价形式
+
 The above writing is equivalent to the following writing
 ```rust
 let vec_1 = ["123".to_string(), "456".to_string(), "789".to_string()];
@@ -231,33 +253,49 @@ let mut result3 = {
 # some details
 
 vector! :
-    使用push添加元素
-    use push to add elements
+
+使用push添加元素
+
+use push to add elements
 
 vec_deque! :
-    使用push_back添加元素
-    use push_back to add elements
+
+使用push_back添加元素
+
+use push_back to add elements
 
 linked_list! :
-    使用push_back添加元素
-    use push_back to add elements
+
+使用push_back添加元素
+
+use push_back to add elements
 
 hash_set! :
-    使用insert添加元素
-    use insert to add elements
+
+使用insert添加元素
+
+use insert to add elements
 
 hash_map! :
-    使用insert添加键值对
-    use insert to add key-value pairs
+
+使用insert添加键值对
+
+use insert to add key-value pairs
 
 b_tree_map! :
-    使用insert添加键值对
-    use insert to add key-value pairs
+
+使用insert添加键值对
+
+use insert to add key-value pairs
 
 b_tree_set! :
-    使用insert添加元素
-    use insert to add elements
+
+使用insert添加元素
+
+use insert to add elements
 
 binary_heap! :
-    使用push添加元素
-    use push to add elements
+
+使用push添加元素
+
+use push to add elements