1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
// Copyright 2025 FastLabs Developers
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//! # Traversable
//!
//! A visitor pattern implementation for traversing data structures.
//!
//! This crate provides [`Traversable`] and [`TraversableMut`] traits for types that can be
//! traversed, as well as [`Visitor`] and [`VisitorMut`] traits for types that perform the
//! traversal.
//!
//! It is designed to be flexible and efficient, allowing for deep traversal of complex data
//! structures.
//!
//! ## Quick Start
//!
//! Add `traversable` to your `Cargo.toml` with the `derive` feature:
//!
//! ```toml
//! [dependencies]
//! traversable = { version = "0.2", features = ["derive", "std"] }
//! ```
//!
//! Define your data structures and derive [`Traversable`]:
//!
//! ```rust
//! # #[cfg(not(all(feature = "derive", feature = "std")))]
//! # fn main() {}
//! #
//! # #[cfg(all(feature = "derive", feature = "std"))]
//! # fn main() {
//! use std::any::Any;
//! use std::ops::ControlFlow;
//!
//! use traversable::Traversable;
//! use traversable::Visitor;
//!
//! #[derive(Traversable)]
//! struct Directory {
//! name: String,
//! files: Vec<File>,
//! #[traverse(skip)]
//! cache_id: u64,
//! }
//!
//! #[derive(Traversable)]
//! struct File {
//! name: String,
//! size: u64,
//! }
//!
//! struct FileCounter {
//! count: usize,
//! total_size: u64,
//! }
//!
//! impl Visitor for FileCounter {
//! type Break = ();
//!
//! fn enter(&mut self, node: &dyn Any) -> ControlFlow<Self::Break> {
//! if let Some(file) = node.downcast_ref::<File>() {
//! self.count += 1;
//! self.total_size += file.size;
//! }
//! ControlFlow::Continue(())
//! }
//! }
//!
//! let root = Directory {
//! name: "root".to_string(),
//! files: vec![
//! File {
//! name: "a.txt".to_string(),
//! size: 100,
//! },
//! File {
//! name: "b.rs".to_string(),
//! size: 200,
//! },
//! ],
//! cache_id: 12345,
//! };
//!
//! let mut counter = FileCounter {
//! count: 0,
//! total_size: 0,
//! };
//! root.traverse(&mut counter);
//!
//! assert_eq!(counter.count, 2);
//! assert_eq!(counter.total_size, 300);
//! # }
//! ```
//!
//! ## Attributes
//!
//! The derive macro supports the following attributes on structs and enums:
//!
//! * `#[traverse(skip_self)]`: Skips calling the visitor for the annotated type while still
//! traversing its children.
//! * `#[traverse(skip_children)]`: Calls the visitor for the annotated type without traversing its
//! children.
//!
//! The derive macro supports the following attributes on fields and variants:
//!
//! * `#[traverse(skip)]`: Skips traversing into the annotated field or variant.
//! * `#[traverse(with = "function_name")]`: Uses a custom function to traverse the field.
//!
//! ## Features
//!
//! * `derive`: Enables procedural macros `#[derive(Traversable)]` and `#[derive(TraversableMut)]`.
//! * `std`: Enables support for standard library types (e.g., `Vec`, `HashMap`, `Box`).
//! * `traverse-trivial`: Enables traversal for primitive types (`u8`, `i32`, `bool`, etc.). By
//! default, these are ignored.
//! * `traverse-std`: Enables traversal for "primary" std types like `String`. By default, these are
//! ignored. Note that container types like `Vec` are always traversed if the `std` feature is
//! enabled.
extern crate std;
use ControlFlow;
/// See [`Traversable`].
pub use Traversable;
/// See [`TraversableMut`].
pub use TraversableMut;
/// Implementations for third-party library types.
/// A visitor that can be used to traverse a data structure.
///
/// Implement this trait to define custom logic that executes when
/// [`Traversable`] items are visited. You can implement `enter` and `leave`
/// methods to perform actions before and after processing a node, respectively.
///
/// For an example of implementing `Visitor`, see the `FileCounter` struct
/// in the [crate-level documentation](self).
///
/// You can also use [`visitor`] to create a visitor from closures.
///
/// [`visitor`]: function::visitor
/// A visitor that can be used to traverse a mutable data structure.
///
/// Implement this trait to define custom logic that executes when
/// [`TraversableMut`] items are visited. You can implement `enter_mut` and `leave_mut`
/// methods to perform actions before and after processing a mutable node, respectively.
///
/// # Example
///
/// ```rust
/// # #[cfg(not(feature = "derive"))]
/// # fn main() {}
/// #
/// # #[cfg(feature = "derive")]
/// # fn main() {
/// use core::any::Any;
/// use core::ops::ControlFlow;
///
/// use traversable::TraversableMut;
/// use traversable::VisitorMut;
/// #[derive(TraversableMut)]
/// struct Node {
/// value: i32,
/// #[traverse(skip)]
/// id: u32,
/// }
///
/// struct Incrementer;
///
/// impl VisitorMut for Incrementer {
/// type Break = ();
///
/// fn enter_mut(&mut self, node: &mut dyn Any) -> ControlFlow<Self::Break> {
/// if let Some(n) = node.downcast_mut::<Node>() {
/// n.value += 1;
/// }
/// ControlFlow::Continue(())
/// }
/// }
///
/// let mut node = Node { value: 10, id: 1 };
/// node.traverse_mut(&mut Incrementer);
/// assert_eq!(node.value, 11);
/// # }
/// ```
///
/// You can also use [`visitor_mut`] to create a mutable visitor from closures.
///
/// [`visitor_mut`]: function::visitor_mut
/// A trait for types that can be traversed by a visitor.
///
/// This trait is the core of the traversable pattern. It allows a [`Visitor`] to
/// walk through a data structure.
///
/// # Deriving `Traversable`
///
/// The easiest way to implement `Traversable` is to use the `derive` macro.
///
/// ```rust
/// # #[cfg(not(feature = "derive"))]
/// # fn main() {}
/// #
/// # #[cfg(feature = "derive")]
/// # fn main() {
/// use traversable::Traversable;
///
/// #[derive(Traversable)]
/// struct MyStruct {
/// data: u64,
/// #[traverse(skip)]
/// hidden: String,
/// }
/// # }
/// ```
///
/// # Attributes
///
/// The derive macro supports the following attributes on structs and enums:
///
/// * `#[traverse(skip_self)]`: Skips calling the visitor for the annotated type while still
/// traversing its children.
/// * `#[traverse(skip_children)]`: Calls the visitor for the annotated type without traversing its
/// children.
///
/// The derive macro supports the following attributes on fields and variants:
///
/// * `#[traverse(skip)]`: Skips traversing into the annotated field or variant.
/// * `#[traverse(with = "function_name")]`: Uses a custom function to traverse the field.
///
/// ## Custom Traversal Function
///
/// When using `#[traverse(with = "path::to::func")]`, the function must have the signature:
///
/// ```rust,ignore
/// fn func<V: Visitor>(item: &ItemType, visitor: &mut V) -> ControlFlow<V::Break>
/// ```
///
/// Example:
///
/// ```rust
/// # #[cfg(not(feature = "derive"))]
/// # fn main() {}
/// #
/// # #[cfg(feature = "derive")]
/// # fn main() {
/// use core::ops::ControlFlow;
///
/// use traversable::Traversable;
/// use traversable::Visitor;
///
/// fn traverse_string_len<V: Visitor>(s: &String, visitor: &mut V) -> ControlFlow<V::Break> {
/// s.len().traverse(visitor)
/// }
///
/// #[derive(Traversable)]
/// struct User {
/// #[traverse(with = "traverse_string_len")]
/// name: String,
/// }
/// # }
/// ```
/// A trait for types that can be traversed mutably by a visitor.
///
/// This trait allows a [`VisitorMut`] to walk through a data structure and possibly
/// mutate it.
///
/// # Deriving `TraversableMut`
///
/// The easiest way to implement `TraversableMut` is to use the `derive` macro.
///
/// ```rust
/// # #[cfg(not(feature = "derive"))]
/// # fn main() {}
/// #
/// # #[cfg(feature = "derive")]
/// # fn main() {
/// use traversable::TraversableMut;
///
/// #[derive(TraversableMut)]
/// struct MyStruct {
/// data: u64,
/// #[traverse(skip)]
/// readonly: String,
/// }
/// # }
/// ```
///
/// # Attributes
///
/// The derive macro supports the following attributes on structs and enums:
///
/// * `#[traverse(skip_self)]`: Skips calling the visitor for the annotated type while still
/// traversing its children.
/// * `#[traverse(skip_children)]`: Calls the visitor for the annotated type without traversing its
/// children.
///
/// The derive macro supports the following attributes on fields and variants:
///
/// * `#[traverse(skip)]`: Skips traversing into the annotated field or variant.
/// * `#[traverse(with = "function_name")]`: Uses a custom function to traverse the field.
///
/// ## Custom Traversal Function
///
/// When using `#[traverse(with = "path::to::func")]`, the function must have the signature:
///
/// ```rust,ignore
/// fn func<V: VisitorMut>(item: &mut ItemType, visitor: &mut V) -> ControlFlow<V::Break>
/// ```
///
/// Example:
///
/// ```rust
/// # #[cfg(not(feature = "derive"))]
/// # fn main() {}
/// #
/// # #[cfg(feature = "derive")]
/// # fn main() {
/// use core::ops::ControlFlow;
///
/// use traversable::TraversableMut;
/// use traversable::VisitorMut;
///
/// fn traverse_string_chars<V: VisitorMut>(
/// s: &mut String,
/// visitor: &mut V,
/// ) -> ControlFlow<V::Break> {
/// // custom traversal logic
/// ControlFlow::Continue(())
/// }
///
/// #[derive(TraversableMut)]
/// struct User {
/// #[traverse(with = "traverse_string_chars")]
/// name: String,
/// }
/// # }
/// ```