Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit de2d0a7

Browse files
Added assertion tests
1 parent d708448 commit de2d0a7

File tree

1 file changed

+9
-5
lines changed

1 file changed

+9
-5
lines changed

‎src/macros/mod.rs

Lines changed: 9 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@
2020
///
2121
/// ```rust
2222
/// use std::boxed::Box;
23-
/// use leetcode_trees_rs::utils::ListNode;
23+
/// use leetcode_trees_rs::utils::{list_node, ListNode};
2424
///
2525
/// let node = ListNode {
2626
/// val: 1,
@@ -32,6 +32,7 @@
3232
/// }))
3333
/// }))
3434
/// };
35+
/// assert_eq!(node, list_node!(1, 2, 3, 4));
3536
/// ```
3637
#[macro_export]
3738
macro_rules! list_node {
@@ -108,9 +109,9 @@ macro_rules! tree {
108109
/// ```rust
109110
/// use std::{rc::Rc, cell::RefCell, boxed::Box};
110111
///
111-
/// use leetcode_trees_rs::utils::TreeNode;
112+
/// use leetcode_trees_rs::utils::{symmetric_tree, TreeNode};
112113
///
113-
/// TreeNode {
114+
/// let node = TreeNode {
114115
/// val: 1,
115116
/// left: Some(Rc::new(RefCell::new(TreeNode{
116117
/// val: 2,
@@ -171,6 +172,7 @@ macro_rules! tree {
171172
/// }))),
172173
/// }))),
173174
/// };
175+
/// assert_eq!(node, symmetric_tree!(1, 2, 3, 4));
174176
/// ```
175177
/// Now you have a tree that branches all the way through the right side without having anything on
176178
/// the left.
@@ -221,7 +223,7 @@ macro_rules! symmetric_tree {
221223
///
222224
/// ```rust
223225
/// use std::{rc::Rc, cell::RefCell};
224-
/// use leetcode_trees_rs::utils::TreeNode;
226+
/// use leetcode_trees_rs::utils::{left_tree, TreeNode};
225227
///
226228
/// let left_only_tree = TreeNode {
227229
/// val: 1,
@@ -236,6 +238,7 @@ macro_rules! symmetric_tree {
236238
/// }))),
237239
/// right: None,
238240
/// };
241+
/// assert_eq!(left_only_tree, left_tree!(1, 2, 3));
239242
/// ```
240243
#[macro_export]
241244
macro_rules! left_tree {
@@ -277,7 +280,7 @@ macro_rules! left_tree {
277280
///
278281
/// ```rust
279282
/// use std::{rc::Rc, cell::RefCell};
280-
/// use leetcode_trees_rs::utils::TreeNode;
283+
/// use leetcode_trees_rs::utils::{right_tree, TreeNode};
281284
///
282285
/// let right_only_tree = TreeNode {
283286
/// val: 1,
@@ -292,6 +295,7 @@ macro_rules! left_tree {
292295
/// })))
293296
/// })))
294297
/// };
298+
/// assert_eq!(right_only_tree, right_tree!(1, 2, 3));
295299
/// ```
296300
#[macro_export]
297301
macro_rules! right_tree {

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /