Skip to content

std::collections provides a complexity for BTreeMap::predecessor but the function is not available #81548

Closed

Description

@jbreitbart

I was just through https://doc.rust-lang.org/std/collections/#maps and noticed that it gives a complexity for the predecessor operation for BTreeMap, but that operation seems not to be available. I checked the map itself and its iterator. Is this a documentation bug or am I missing something?

Activity

  1. sugar700 commented on Jan 30, 2021

    @sugar700
    Contributor

    This looks a lot like a cursor method, but cursor API for BTreeMap is long gone if it even existed at any point. I think we could write range instead of predecessor here.

  2. added a commit that references this issue on Jan 30, 2021
    56c2736
  3. added a commit that references this issue on Jan 30, 2021
    0330456
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    C-bugCategory: This is a bug.

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions