pub type DBRawIterator<'a> = DBRawIteratorWithThreadMode<'a, DB>;
Expand description
A type alias to keep compatibility. See DBRawIteratorWithThreadMode
for details
Aliased Type§
struct DBRawIterator<'a> { /* private fields */ }
Implementations
Source§impl<'a, D: DBAccess> DBRawIteratorWithThreadMode<'a, D>
impl<'a, D: DBAccess> DBRawIteratorWithThreadMode<'a, D>
Sourcepub fn valid(&self) -> bool
pub fn valid(&self) -> bool
Returns true
if the iterator is valid. An iterator is invalidated when
it reaches the end of its defined range, or when it encounters an error.
To check whether the iterator encountered an error after valid
has
returned false
, use the status
method. status
will never
return an error when valid
is true
.
Sourcepub fn status(&self) -> Result<(), Error>
pub fn status(&self) -> Result<(), Error>
Returns an error Result
if the iterator has encountered an error
during operation. When an error is encountered, the iterator is
invalidated and valid
will return false
when called.
Performing a seek will discard the current status.
Sourcepub fn seek_to_first(&mut self)
pub fn seek_to_first(&mut self)
Seeks to the first key in the database.
§Examples
use rocksdb::{DB, Options};
let path = "_path_for_rocksdb_storage5";
{
let db = DB::open_default(path).unwrap();
let mut iter = db.raw_iterator();
// Iterate all keys from the start in lexicographic order
iter.seek_to_first();
while iter.valid() {
println!("{:?} {:?}", iter.key(), iter.value());
iter.next();
}
// Read just the first key
iter.seek_to_first();
if iter.valid() {
println!("{:?} {:?}", iter.key(), iter.value());
} else {
// There are no keys in the database
}
}
let _ = DB::destroy(&Options::default(), path);
Sourcepub fn seek_to_last(&mut self)
pub fn seek_to_last(&mut self)
Seeks to the last key in the database.
§Examples
use rocksdb::{DB, Options};
let path = "_path_for_rocksdb_storage6";
{
let db = DB::open_default(path).unwrap();
let mut iter = db.raw_iterator();
// Iterate all keys from the end in reverse lexicographic order
iter.seek_to_last();
while iter.valid() {
println!("{:?} {:?}", iter.key(), iter.value());
iter.prev();
}
// Read just the last key
iter.seek_to_last();
if iter.valid() {
println!("{:?} {:?}", iter.key(), iter.value());
} else {
// There are no keys in the database
}
}
let _ = DB::destroy(&Options::default(), path);
Sourcepub fn seek<K: AsRef<[u8]>>(&mut self, key: K)
pub fn seek<K: AsRef<[u8]>>(&mut self, key: K)
Seeks to the specified key or the first key that lexicographically follows it.
This method will attempt to seek to the specified key. If that key does not exist, it will find and seek to the key that lexicographically follows it instead.
§Examples
use rocksdb::{DB, Options};
let path = "_path_for_rocksdb_storage7";
{
let db = DB::open_default(path).unwrap();
let mut iter = db.raw_iterator();
// Read the first key that starts with 'a'
iter.seek(b"a");
if iter.valid() {
println!("{:?} {:?}", iter.key(), iter.value());
} else {
// There are no keys in the database
}
}
let _ = DB::destroy(&Options::default(), path);
Sourcepub fn seek_for_prev<K: AsRef<[u8]>>(&mut self, key: K)
pub fn seek_for_prev<K: AsRef<[u8]>>(&mut self, key: K)
Seeks to the specified key, or the first key that lexicographically precedes it.
Like .seek()
this method will attempt to seek to the specified key.
The difference with .seek()
is that if the specified key do not exist, this method will
seek to key that lexicographically precedes it instead.
§Examples
use rocksdb::{DB, Options};
let path = "_path_for_rocksdb_storage8";
{
let db = DB::open_default(path).unwrap();
let mut iter = db.raw_iterator();
// Read the last key that starts with 'a'
iter.seek_for_prev(b"b");
if iter.valid() {
println!("{:?} {:?}", iter.key(), iter.value());
} else {
// There are no keys in the database
}
}
let _ = DB::destroy(&Options::default(), path);