Paul Reichert 55b89aaf38 feat: introduce drop iterator combinator (#8420) ... This PR provides the iterator combinator `drop` that transforms any iterator into one that drops the first `n` elements. Additionally, the PR removes the specialized `IteratorLoop` instance on `Take`. It currently does not have a `LawfulIteratorLoop` instance, which needs to exist for the loop consumer lemmas to work. Having the specialized instance is low priority.		2025-06-03 06:37:09 +00:00
..
Classes	feat: improve Ord proof api (#8378)	2025-05-23 14:00:20 +00:00
Data	feat: introduce drop iterator combinator (#8420)	2025-06-03 06:37:09 +00:00
Internal	feat: implement a Selector for async UDP (#8139)	2025-04-29 21:01:14 +00:00
Net	feat: add network interfaces (#7578)	2025-03-24 17:57:05 +00:00
Sat	feat: do not export theorem bodies (#8090)	2025-04-25 20:22:32 +00:00
Sync	chore: fix spelling mistakes (#8324)	2025-05-14 06:52:16 +00:00
Tactic	chore: remove prime from Fin.ofNat' (#8515)	2025-05-28 11:51:00 +00:00
Time	chore: remove prime from Fin.ofNat' (#8515)	2025-05-28 11:51:00 +00:00
Classes.lean	feat: tree map data structures and operations (#6914)	2025-02-11 14:47:47 +00:00
Data.lean	feat: minimal iterator library (#8358)	2025-05-20 14:53:57 +00:00
Internal.lean	feat: implement basic async IO with timers (#6505)	2025-01-13 18:11:04 +00:00
Net.lean	feat: Std.Net.Addr (#6563)	2025-01-09 09:33:03 +00:00
Sat.lean	feat: Std.Sat.AIG (#4953)	2024-08-12 14:58:38 +00:00
Sync.lean	feat: add Std.SharedMutex (#7770)	2025-04-03 08:30:54 +00:00
Tactic.lean	chore: fix spelling mistakes in src/Std/ (#5431)	2024-09-23 20:39:34 +00:00
Time.lean	chore: fix spelling mistakes (#7328)	2025-04-07 01:15:48 +00:00