(
elements: Element | Element[]
)
| 240 | elements: Element[] |
| 241 | ): DescendentPaths[]; |
| 242 | export function getPathList( |
| 243 | elements: Element | Element[] |
| 244 | ): DescendentPaths | DescendentPaths[] { |
| 245 | if (!elements) { |
| 246 | return []; |
| 247 | } |
| 248 | |
| 249 | if (isArray(elements)) { |
| 250 | const pathList = []; |
| 251 | for (let i = 0; i < elements.length; i++) { |
| 252 | pathList.push(getPathList(elements[i])); |
| 253 | } |
| 254 | return pathList as DescendentPaths[]; |
| 255 | } |
| 256 | |
| 257 | const pathList: DescendentPaths = []; |
| 258 | |
| 259 | elements.traverse(el => { |
| 260 | if ((el instanceof Path) && !(el as ECElement).disableMorphing && !el.invisible && !el.ignore) { |
| 261 | pathList.push(el); |
| 262 | } |
| 263 | }); |
| 264 | return pathList; |
| 265 | } |
no test coverage detected
searching dependent graphs…