@@ -6,9 +6,9 @@ using GeometryBasics
6
6
using LinearAlgebra: norm
7
7
8
8
"""
9
- abstract type AbstractLayout{Dim,Ptype} end
9
+ AbstractLayout{Dim,Ptype}
10
10
11
- Supertype for all layouts. Each layout `Algorithm <: AbstractLayout` needs to
11
+ Abstract supertype for all layouts. Each layout `Algorithm <: AbstractLayout` needs to
12
12
implement
13
13
14
14
layout(algo::Algorithm, adj_matrix)::Vector{Point{Dim,Ptype}}
@@ -28,9 +28,9 @@ ptype(::AbstractLayout{Dim,Ptype}) where {Dim,Ptype} = Ptype
28
28
(lay:: AbstractLayout )(adj_matrix) = layout (lay, adj_matrix)
29
29
30
30
"""
31
- abstract type IterativeLayout{Dim,Ptype} <: AbstractLayout{Dim,Ptype} end
31
+ IterativeLayout{Dim,Ptype} <: AbstractLayout{Dim,Ptype}
32
32
33
- Supertype for iterative layouts. Instead of implementing `layout` directly,
33
+ Abstract supertype for iterative layouts. Instead of implementing `layout` directly,
34
34
subtypes `Algorithm<:IterativeLayout` need to implement the [iterator
35
35
interface](https://docs.julialang.org/en/v1/manual/interfaces/#man-interface-iteration)
36
36
@@ -49,7 +49,7 @@ function-like call
49
49
abstract type IterativeLayout{Dim,Ptype} <: AbstractLayout{Dim,Ptype} end
50
50
51
51
"""
52
- LayoutIterator(algorithm:: IterativeLayout, adj_matrix)
52
+ LayoutIterator{T<: IterativeLayout,M<:AbstractMatrix}(algorithm , adj_matrix)
53
53
54
54
This type bundles an [`IterativeLayout`](@ref) with an adjacency matrix to form an
55
55
iterable object whose items are the node positions.
0 commit comments