Skip to content

Big rollup #8385

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 29 commits into from
Closed

Big rollup #8385

wants to merge 29 commits into from

Conversation

emberian
Copy link
Member

@emberian emberian commented Aug 8, 2013

This is a fairly large rollup, but I've tested everything locally, and none of
it should be platform-specific.

r=alexcrichton (bdfdbdd)
r=brson (d803c18)
r=alexcrichton (a5041d0)
r=bstrie (317412a)
r=alexcrichton (135c85e)
r=thestinger (8805baa)
r=pcwalton (0661178)
r=cmr (9397fe0)
r=cmr (caa4135)
r=cmr (6a21d93)
r=cmr (4dc3379)
r=cmr (0aa5154)
r=cmr (18be261)
r=thestinger (f10be03)

@emberian
Copy link
Member Author

emberian commented Aug 8, 2013

Sorry; git screwup

@emberian emberian closed this Aug 8, 2013
@emberian emberian reopened this Aug 8, 2013
blake2-ppc and others added 27 commits August 7, 2013 22:39
Fix inappropriate for-range loops to use for-iterator constructs (or
other appropriate solution) instead.
Edge iterator used the length of the nodes vector, must be a mistake.
Transform range loops that can be regular iterator loops.
Range is now invertable as long as its element type conforms to Integer.

Remove int::range_rev() et al in favor of range().invert().
This is everywhere except struct fields and enum variants.
This way opt_present("apple") will match no matter if the user passed -a or --apple
Write the Eq and Ord impls for TreeMap in a more straightforward way
using iterator::Zip
Write external iterators for Difference, Sym. Difference, Intersection
and Union set operations.

These iterators are generic insofar that they could work on any ordered
sequence iterators, even though they are type specialized to the
TreeSetIterator in this case.

Looking at the `check` function in the treeset tests, rustc seems
unwilling to compile a function resembling::

    fn check<'a, T: Iterator<&'a int>>(... )

so the tests for these iterators are still running the legacy loop
protocol.
Implement reverse iterators for TreeMap and TreeSet, that produce the
keys in backward order.
.each_key(), .each_value() and the other methods are replaced by .iter()
and .rev_iter(), and restrictions of those iterators.
bors added a commit that referenced this pull request Aug 8, 2013
This is a fairly large rollup, but I've tested everything locally, and none of
it should be platform-specific.

r=alexcrichton (bdfdbdd)
r=brson (d803c18)
r=alexcrichton (a5041d0)
r=bstrie (317412a)
r=alexcrichton (135c85e)
r=thestinger (8805baa)
r=pcwalton (0661178)
r=cmr (9397fe0)
r=cmr (caa4135)
r=cmr (6a21d93)
r=cmr (4dc3379)
r=cmr (0aa5154)
r=cmr (18be261)
r=thestinger (f10be03)
@bors bors closed this Aug 8, 2013
@Centril Centril added the rollup A PR which is a rollup label Oct 2, 2019
flip1995 pushed a commit to flip1995/rust that referenced this pull request Jun 4, 2022
…ogiq

add doc_link_with_quotes lint

I'm not sure about wording, it seems OK to me but happy to change if other people have better ideas

closes rust-lang#8383

---
changelog: add [`doc_link_with_quotes`] lint
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
rollup A PR which is a rollup
Projects
None yet
Development

Successfully merging this pull request may close these issues.