Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 0 additions & 1 deletion quest/m3/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -28,7 +28,6 @@ generic std gap is planned here even when moq never calls it.
- [Debug of std's iterator adaptors](/quest/m3/ts-iter-adaptor-debug.md) - `Debug` of `Map`, `Zip`, `Peekable`, `DecodeUtf16`, and the other adaptors writes what std's does
- [Waiting: a slice object for a mutable part of other values](/quest/m3/ts-slice-object.md) - waits on a moq profile showing the `Proxy` view's traps matter, then decides on an `rt.ByteSlice`-like form
- [Port the workflow guard to kixelated/quest](/quest/m3/quest-workflow-guard.md) - quest's environment guard parses YAML as this repository's does
- [A crate's own collect, eq, partial_cmp, and by_ref](/quest/m3/ts-iter-own-calls.md) - a crate's iterator that overrides `collect`, `eq`, `partial_cmp`, or `by_ref` translates, each called where std calls it
- [A vector's exact capacity as it shrinks](/quest/m3/ts-vec-exact-capacity.md) - a deque made from a `Vec` splits its slices where std's does
- [A B-tree's searches call Ord as std's do](/quest/m3/ts-btree-search-order.md) - a B-tree's lookups and inserts call a key's own `Ord` in std's order and number
- [A slice's chunks as mutable arrays](/quest/m3/ts-slice-conversions.md) - `as_chunks_mut` and `as_rchunks_mut` translate, writes landing in the slice
Expand Down
26 changes: 0 additions & 26 deletions quest/m3/ts-iter-own-calls.md

This file was deleted.

20 changes: 12 additions & 8 deletions ts/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -298,11 +298,15 @@ moves read steps in place, as two variables: the array and an index into it, or
range's bounds, with no `rt.Iter` made. The crate's own `impl Iterator` returns `rt.DONE` from its `next` too, and joins
std's adaptors through `rt.iterFrom`, which calls its own `size_hint`, `next_back`, `len`, `nth`, and `nth_back`,
and of one it owns, not borrows by `&mut` or boxes, its own `fold`, `rfold`, `count`, `last`,
`find`, `rfind`, `find_map`, `for_each`, `reduce`, and `all`, where std's adaptors and consumers
call them: a filter's `next` calls `find`, an `extend` into a hash or B-tree collection, a
`String`, or a tuple calls `for_each`, `max` calls `reduce`, and `is_sorted` calls `all`. Its
own `position`, `max`, and the others std never calls in place of another run only where the
crate calls them, and `fuse` reads on past the end of one that is a `FusedIterator`, as std's does. A caller calls `next()` for one item, or iterates
`find`, `rfind`, `find_map`, `for_each`, `reduce`, `all`, and `is_sorted_by`, where std's
adaptors and consumers call them: a filter's `next` calls `find`, an `extend` into a hash or
B-tree collection, a `String`, or a tuple calls `for_each`, `max` calls `reduce`, and
`is_sorted` calls `is_sorted_by`, which calls `all`. Its
own `collect` into a `Vec` runs where std's `FromIterator` of a `Box<[T]>`, `Rc<[T]>`,
`Arc<[T]>`, `BTreeMap`, `BTreeSet`, or `BinaryHeap` calls it first, its own `eq` and
`partial_cmp` where `ne` and the tests on `partial_cmp` call them, and its own `by_ref`,
which std calls only from `Vec::splice`, which is not supported, `position`, `max`, and the
others std never calls in place of another only where the crate calls them, and `fuse` reads on past the end of one that is a `FusedIterator`, as std's does. A caller calls `next()` for one item, or iterates
an `rt.Iter` with `for ... of`. Each `rt.Iter`'s `sizeHint` is std's `size_hint`, its upper
bound `undefined` for `None`, and a `collect` or `extend` into a `Vec`, `VecDeque`,
`BinaryHeap`, B-tree, or hash collection reserves by it where std's does, panicking with
Expand Down Expand Up @@ -947,12 +951,12 @@ copies that std makes, other than a map's, or hands a closure, as `iter_mut` and
`and_modify` do, one into a `Result`'s payload passed on or kept, the adaptors
without a mapping in `src/lower/iter.rs` (such as nightly's `intersperse`), an
own `impl Iterator` or `DoubleEndedIterator` that overrides a provided method std calls in place
of another other than those, such as `collect`, `eq`, `partial_cmp`, or `by_ref`, or whose own
of another other than those, such as `map`, which `flat_map` calls, or whose own
method taking a closure tells it, or its accumulator or what it finds, apart from another, by an
`Option` or a `Poll` of the accumulator, a call or constant generic over them other than calling
or dropping the closure or passing them to std's iterators outside the crate's own types, or a
drop of the accumulator or what it finds, or whose own `find` or `rfind` gives its predicate a
reference to a `[u8; N]`,
drop of the accumulator or what it finds, or whose own `find`, `rfind`, or `is_sorted_by` gives
its closure a reference to a `[u8; N]`,
a pointer's address (`{:p}`), `write!` with a placeholder into
the crate's own `fmt::Write`, a `str` pattern other than a
`char`, a `&str`, a predicate behind any references and boxes, or chars, a mutable `str` slice, a copy of a closure that changes
Expand Down
Loading