| LOW | deny.toml | 1 | # This template contains all of the possible sections and their default values | COMMENT |
| LOW | deny.toml | 21 | yanked = "warn" | COMMENT |
| LOW | deny.toml | 41 | # List of explictly allowed licenses | COMMENT |
| LOW | deny.toml | 61 | { allow = ["Unicode-3.0"], name = "unicode-ident", version = "*" }, # Used only by comfy-table in the benchmarks | COMMENT |
| LOW | deny.toml | 81 | # Each entry is a crate relative path, and the (opaque) hash of its contents | COMMENT |
| LOW | deny.toml | 101 | multiple-versions = "warn" | COMMENT |
| LOW | deny.toml | 121 | ] | COMMENT |
| LOW | crates/redb-derive/tests/crate_attr_tests.rs | 1 | //! Tests for `#[redb(crate = "...")]`, which names the crate the implementations are generated | COMMENT |
| LOW | crates/redb-derive/src/lib.rs | 41 | } | COMMENT |
| LOW | crates/redb-derive-rename-test/src/lib.rs | 1 | // Intentionally empty: this package exists for the integration test in tests/, which must live | COMMENT |
| LOW | tests/borrow_markers.rs | 1 | // Every lifetime marker in the crate's types is a `ScopedBorrow`. | COMMENT |
| LOW | tests/integration_tests.rs | 4441 | | COMMENT |
| LOW | src/types.rs | 161 | Self: 'a; | COMMENT |
| LOW | src/types.rs | 241 | /// to `left`, and less than `right`, under [`compare()`](Self::compare). | COMMENT |
| LOW | src/transactions.rs | 861 | // Persistent savepoints whose on-disk entry was deleted: release their | COMMENT |
| LOW | src/transactions.rs | 1141 | } | COMMENT |
| LOW | src/transactions.rs | 1301 | /// This savepoint will be freed as soon as the returned [`Savepoint`] is dropped. | COMMENT |
| LOW | src/transactions.rs | 1521 | Durability::None => InternalDurability::None, | COMMENT |
| LOW | src/transactions.rs | 1541 | /// attacker with an extremely high degree of control over the database's workload, including | COMMENT |
| LOW | src/transactions.rs | 1561 | /// Security considerations: Many hard disk drives and SSDs do not actually guarantee that data | COMMENT |
| LOW | src/transactions.rs | 1581 | /// Alternatively, you can enable quick-repair. In this mode, redb saves the allocator state | COMMENT |
| LOW | src/transactions.rs | 1681 | .rename_multimap_table(self, &name, new_name.name()) | COMMENT |
| LOW | src/transactions.rs | 1741 | /// durable as consistent with the [`Durability`] level set by [`Self::set_durability`] | COMMENT |
| LOW | src/transactions.rs | 1921 | } | COMMENT |
| LOW | src/io.rs | 1 | //! The error type that [`StorageBackend`](crate::StorageBackend) reports failures with. | COMMENT |
| LOW | src/error.rs | 681 | /// generation of the multi-process locking protocol | COMMENT |
| LOW | src/lib.rs | 21 | //! | COMMENT |
| LOW | src/lib.rs | 41 | //! fn main() -> Result<(), Error> { | COMMENT |
| LOW | src/lib.rs | 61 | //! | COMMENT |
| LOW | src/sync.rs | 21 | use core::fmt::{Debug, Formatter}; | COMMENT |
| LOW | src/db.rs | 41 | | COMMENT |
| LOW | src/db.rs | 61 | /// | COMMENT |
| LOW | src/db.rs | 181 | pub(crate) const WRITER_BYTE: u64 = LOCK_BASE; | COMMENT |
| LOW | src/db.rs | 581 | /// | COMMENT |
| LOW | src/db.rs | 601 | /// Multiple processes may open a [`ReadOnlyDatabase`], but it may not be opened concurrently | COMMENT |
| LOW | src/db.rs | 621 | /// # let tmpfile = NamedTempFile::new_in("/tmp").unwrap(); | COMMENT |
| LOW | src/db.rs | 721 | /// Opened redb database file | COMMENT |
| LOW | src/db.rs | 741 | /// | COMMENT |
| LOW | src/db.rs | 841 | | COMMENT |
| LOW | src/db.rs | 1741 | mem.check_active_transaction_id(transaction_id)?; | COMMENT |
| LOW | src/db.rs | 2001 | /// writes is chosen by `open()` or `open_read_only()`, not by the mode. | COMMENT |
| LOW | src/db.rs | 2021 | /// excluded by a writer in either mode: it must not be opened on a database such a writer has | COMMENT |
| LOW | src/db.rs | 2081 | /// Set a callback which will be invoked periodically in the event that the database file needs | COMMENT |
| LOW | src/legacy_types.rs | 1 | //! Types that open the tables written before redb 5.0, when the built-in types had no niche | COMMENT |
| LOW | src/legacy_types.rs | 21 | /// const OLD: TableDefinition<u64, Option<Legacy<&str>>> = TableDefinition::new("names"); | COMMENT |
| LOW | src/table.rs | 161 | /// | COMMENT |
| LOW | src/table.rs | 181 | /// | COMMENT |
| LOW | src/table.rs | 201 | /// `predicate` evaluates to `true` are returned in an iterator, and those which are read from the iterator are remo | COMMENT |
| LOW | src/table.rs | 261 | /// `predicate` evaluates to `false` are removed. | COMMENT |
| LOW | src/table.rs | 341 | /// Returns the old value, if the key was present in the table | COMMENT |
| LOW | src/table.rs | 381 | /// Passing `Bound::Unbounded` will return a cursor pointing to the gap | COMMENT |
| LOW | src/table.rs | 401 | /// # let tmpfile = NamedTempFile::new_in("/tmp").unwrap(); | COMMENT |
| LOW | src/table.rs | 621 | | COMMENT |
| LOW | src/table.rs | 641 | /// let mut table = write_txn.open_table(TABLE)?; | COMMENT |
| LOW | src/table.rs | 661 | /// | COMMENT |
| LOW | src/table.rs | 681 | /// table.insert("b", &1)?; | COMMENT |
| LOW | src/table.rs | 701 | fn first(&self) -> Result<Option<(AccessGuard<'_, K>, AccessGuard<'_, V>)>>; | COMMENT |
| LOW | src/table.rs | 721 | &self, | COMMENT |
| LOW | src/table.rs | 741 | &self, | COMMENT |
| LOW | src/table.rs | 761 | fn upper_bound<'a>( | COMMENT |
| 29 more matches not shown… |
Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).