Suppose i have a Node type that may have a reference to itself on one of its fields. What is the most efficient way to implement Base.iterate for this Node type, such that at every iteration we get the next child Node? julia> const Maybe{T} = Union{T, Nothing} Union{Nothing, T} where T julia> stru…

Not my best work, but supports sparsity, circularity (given one or more starting elements), and iteration. May implement removal and insertion after. module FastLinkedLists struct SingleLL{T, N} data :: Vector{T} next :: Vector{N} end """ function SingleLL(data, ::Type{N} = Int; kwargs...) …

Efficient recursive iteration over self referencing struct

General Usage Performance

dylanxyz June 25, 2022, 3:57pm 7

Interesting, i’m know about Data Structures, but i’m still noob when it comes to choose which one is better for the job.

Yes, i’m familiar.

Topic		Replies	Views
Using iterator in Julia 0.7 General Usage	2	657	June 8, 2018
Iterating over a Tree recursively with Base.iterate General Usage question , iterators , tree	8	2104	June 9, 2021
Error iterating MutableLinkedList New to Julia	1	332	October 3, 2019
Linked list General Usage question	8	4530	October 24, 2017
How to remove an item from a linked list in Julia? General Usage	8	1836	January 5, 2018

Efficient recursive iteration over self referencing struct

Related topics