Implement a standard iterator interface for lists, trees, and graphs.
npx skills add https://github.com/microwind/ai-skills --skill iterator
Please help me install this Agent Skill. Skill: Iterator Source: https://github.com/microwind/ai-skills/tree/main/design-patterns/iterator-pattern Command: npx skills add https://github.com/microwind/ai-skills --skill iterator
Iterator Pattern provides a standardized way to access elements of a collection in sequence without exposing its internal representation.
Create an iterator for your collection and loop through all elements to process them in order.
High-intent search queries and answers about installing and using this skill.
Use the iterator pattern to traverse a collection without exposing its internal representation. It provides a standardized interface with hasNext and next methods, allowing sequential access to elements across lists, trees, and graphs safely.
Yes, you can implement both BFS and DFS traversal orders for trees and graphs. The iterator abstraction supports multiple traversal strategies, including forward, reverse, breadth-first search, and depth-first search, across various complex container structures.
Create multiple independent iterators by instantiating separate iterator objects from the same collection. This enables concurrent traversals across different orders like forward or DFS, utilizing lazy evaluation to process elements without interference between states.
Yes, the iterator interface requires clear error handling for end-of-collection scenarios. The standard hasNext and next methods must safely manage traversal termination, preventing out-of-bounds access when no more elements remain in the sequence.
Use an external iterator when you need explicit control over the traversal loop, pausing, or applying multiple strategies like BFS and DFS. Internal iteration is better for simple processing pipelines where the collection manages the traversal flow internally.
The best way to build reusable collection processing pipelines is applying an iterator design pattern. It decouples traversal logic from data structures through lazy evaluation, allowing multiple independent iterators to process list, tree, or graph elements sequentially.
johnnystefanImplement iterator and collection classes with hasNext/next interfaces for sequential traversal.
snowdamizProvide List, Map, Set, Range, and Queue APIs with lazy Iter pipelines in Mesh.
mechemsiIdentify and apply creational design patterns to solve object construction problems.
johnnystefanAdd operations to object structures via visitor and element interfaces.
