feat: add seq.Pairwise()

[aereal]

No description provided.

[github-actions]

Code Metrics Report

	#9 (01754da)	#11 (40a0df6)	+/-
Coverage	88.0%	88.4%	+0.4%
Code to Test Ratio	1:2.2	1:2.2	-0.1
Test Execution Time	9s	14s	+5s

Details

  |                     | #9 (01754da) | #11 (40a0df6) |  +/-  |
  |---------------------|--------------|---------------|-------|
+ | Coverage            |        88.0% |         88.4% | +0.4% |
  |   Files             |            2 |             2 |     0 |
  |   Lines             |          100 |           113 |   +13 |
+ |   Covered           |           88 |           100 |   +12 |
- | Code to Test Ratio  |        1:2.2 |         1:2.2 |  -0.1 |
  |   Code              |          183 |           203 |   +20 |
+ |   Test              |          420 |           463 |   +43 |
- | Test Execution Time |           9s |           14s |   +5s |

Code coverage of files in pull request scope (88.5% → 88.9%)

Files	Coverage	+/-	Status
seq/seq.go	88.9%	+0.4%	modified

---

Reported by octocov

[Copilot]

Pull Request Overview

This PR adds a Pairwise() function to the seq package that generates consecutive overlapping pairs from an iterator. For example, given [a, b, c, d], it yields [(a, b), (b, c), (c, d)].

Key changes:

• Implemented Pairwise[T any](s iter.Seq[T]) iter.Seq2[T, T] function using iter.Pull to generate consecutive pairs
• Added comprehensive test cases covering empty sequences, single elements, and multiple-element sequences

Reviewed Changes

Copilot reviewed 2 out of 2 changed files in this pull request and generated no comments.

File	Description
seq/seq.go	Implements the Pairwise() function that returns an iterator over consecutive pairs of elements using iter.Pull for efficient state management
seq/seq_test.go	Adds test cases for Pairwise() covering edge cases including empty input, single element, and sequences with 3-4 elements

---

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.