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
3 changes: 3 additions & 0 deletions .github/workflows/ci.yml
Original file line number Diff line number Diff line change
Expand Up @@ -40,6 +40,9 @@ jobs:
- name: Clippy
run: cargo clippy --tests --benches -- -D clippy::all

- name: Docs
run: cargo doc --target wasm32-unknown-unknown

- name: Test
run: cargo test -- --color always
env:
Expand Down
8 changes: 8 additions & 0 deletions Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -11,6 +11,10 @@ readme = "README.md"
repository = "https://github.com/dfinity/stable-structures"
version = "0.6.9"

[package.metadata.docs.rs]
# Build docs for wasm32-unknown-unknown target
targets = ["wasm32-unknown-unknown"]

[dependencies]
canbench-rs = { workspace = true, optional = true } # Optional to benchmark parts of the code.
ic_principal.workspace = true
Expand All @@ -28,6 +32,10 @@ test-strategy.workspace = true
[features]
bench_scope = ["dep:canbench-rs"] # May add significant overhead.

[lints.rustdoc]
# Make rustdoc warnings into errors
all = "deny"

[workspace]
members = ["benchmarks"]

Expand Down
4 changes: 2 additions & 2 deletions src/btreemap.rs
Original file line number Diff line number Diff line change
Expand Up @@ -1202,13 +1202,13 @@ where
}
}

/// **Deprecated**: use [`iter_from_prev_key`] instead.
/// **Deprecated**: use `iter_from_prev_key` instead.
///
/// The name `iter_upper_bound` was misleading — it suggested an inclusive
/// upper bound. In reality, it starts from the largest key strictly less
/// than the given bound.
///
/// The new name, [`iter_from_prev_key`], better reflects this behavior and
/// The new name, `iter_from_prev_key`, better reflects this behavior and
/// improves code clarity.
#[deprecated(note = "use `iter_from_prev_key` instead")]
pub fn iter_upper_bound(&self, bound: &K) -> Iter<'_, K, V, M> {
Expand Down