[Repo Assist] feat: add map, filter, iter, exists, forall, toList, toArray to Queue and Deque

[github-actions]

🤖 This PR was created by Repo Assist, an automated AI assistant.

Adds seven commonly used collection functions to the Queue and Deque modules. Partially addresses #152 (Align Collection Module functions with FSharp.Collections).

Changes

New functions (Queue and Deque)

Function	Complexity	Description
map f q	O(n)	Transform each element, returning a Queue/Deque
filter pred q	O(n)	Keep only elements satisfying the predicate
iter f q	O(n)	Apply a side-effecting function to each element (FIFO order)
exists pred q	O(n)	Test whether any element satisfies a predicate
forall pred q	O(n)	Test whether all elements satisfy a predicate
toList q	O(n)	Convert to list in FIFO order
toArray q	O(n)	Convert to array in FIFO order

All functions preserve FIFO element order. Signatures added to .fsi files. 21 new tests added.

Implementation notes

Queue.map directly maps over the internal front and rBack lists, preserving the queue structure without any rebuilding — very efficient.

Queue.filter handles the invariant that front should not be empty for a non-empty queue: if filtering removes all front elements, List.rev rBack becomes the new front.

Deque.map similarly maps directly over both internal lists. Deque.filter is simpler since Deque tolerates an empty front (it falls back to rBack).

exists and forall can check rBack in any order (order only matters for iter, toList, toArray).

Test Status

All 731 tests pass (6 pre-existing ptest skips unrelated to this PR):

Passed! - Failed: 0, Passed: 731, Skipped: 6, Total: 737

Generated by Repo Assist · ◷

To install this agentic workflow, run

gh aw add githubnext/agentics/workflows/repo-assist.md@346204513ecfa08b81566450d7d599556807389f