13 releases (7 breaking)
0.8.1 | Nov 22, 2022 |
---|---|
0.8.0 | Sep 26, 2020 |
0.7.0 | May 18, 2020 |
0.6.4 | Nov 20, 2019 |
0.5.0 | Feb 17, 2017 |
#24 in Parser implementations
1,127,210 downloads per month
Used in 474 crates
(57 directly)
85KB
953 lines
quick-protobuf
A pure Rust library to serialize/deserialize protobuf files.
Description
This crate intends to provide a simple yet fast (minimal allocations) protobuf parser implementation. In general, you should probably NOT need to use this crate directly, else, you should use the modules automatically generated by pb-rs tool.
Example
-
- Install pb-rs binary to convert your proto file into a quick-protobuf compatible source code
cargo install pb-rs
pb-rs /path/to/your/protobuf/file.proto
# will generate a
# /path/to/your/protobuf/file.rs
-
- Add a dependency to quick-protobuf
# Cargo.toml
[dependencies]
quick-protobuf = "0.6.2"
-
- Have fun
extern crate quick_protobuf;
mod foo_bar; // (see 1.)
use quick_protobuf::Reader;
// We will suppose here that Foo and Bar are two messages defined in the .proto file
// and converted into rust structs
//
// FooBar is the root message defined like this:
// message FooBar {
// repeated Foo foos = 1;
// repeated Bar bars = 2;
// }
// FooBar is a message generated from a proto file
// in parcicular it contains a `from_reader` function
use foo_bar::FooBar;
use quick_protobuf::{MessageRead, BytesReader};
fn main() {
// bytes is a buffer on the data we want to deserialize
// typically bytes is read from a `Read`:
// r.read_to_end(&mut bytes).expect("cannot read bytes");
let bytes: Vec<u8> = ...;
// In the most simple form, we want to deserialize from a `&[u8]`
let foobar = deserialize_from_slice(&bytes).expect("Cannot convert into a `FooBar`");
// ...
// ...
// Alternatively, we can go lower level and work with a `BytesReader`
// It gives more control of the bytes we are reading
let mut reader = BytesReader::from_bytes(&bytes);
// now using the generated module decoding is as easy as:
let foobar = FooBar::from_reader(&mut reader, &bytes).expect("Cannot read FooBar");
// if instead the buffer contains a length delimited stream of message we could use:
// while !r.is_eof() {
// let foobar: FooBar = r.read_message(&bytes).expect(...);
// ...
// }
println!("Found {} foos and {} bars", foobar.foos.len(), foobar.bars.len());
// Similarly, if we want to serialize the message you can use a `Writer` or use
// `serialize_into_vec`
let vec = serialize_into_vec(&foobar).expect("Cannot serialize `foobar`");
// ... or for more control (more than one message)
let mut buf = Vec::new();
let mut writer = Writer::new(&mut buf);
writer.write_message(&foobar).expect("Cannot write `foobar`);
}
Message <-> struct
The best way to check for all kind of generated code is to look for the codegen_example data:
- definition: data_types.proto
- generated code: data_types.rs
Proto definition
enum FooEnum {
FIRST_VALUE = 1;
SECOND_VALUE = 2;
}
message BarMessage {
required int32 b_required_int32 = 1;
}
message FooMessage {
optional int32 f_int32 = 1;
optional int64 f_int64 = 2;
optional uint32 f_uint32 = 3;
optional uint64 f_uint64 = 4;
optional sint32 f_sint32 = 5;
optional sint64 f_sint64 = 6;
optional bool f_bool = 7;
optional FooEnum f_FooEnum = 8;
optional fixed64 f_fixed64 = 9;
optional sfixed64 f_sfixed64 = 10;
optional fixed32 f_fixed32 = 11;
optional sfixed32 f_sfixed32 = 12;
optional double f_double = 13;
optional float f_float = 14;
optional bytes f_bytes = 15;
optional string f_string = 16;
optional FooMessage f_self_message = 17;
optional BarMessage f_bar_message = 18;
repeated int32 f_repeated_int32 = 19;
repeated int32 f_repeated_packed_int32 = 20 [ packed = true ];
}
Generated structs
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
pub enum FooEnum {
FIRST_VALUE = 1,
SECOND_VALUE = 2,
}
#[derive(Debug, Default, PartialEq, Clone)]
pub struct BarMessage { // all fields are owned: no lifetime parameter
pub b_required_int32: i32,
}
#[derive(Debug, Default, PartialEq, Clone)]
pub struct FooMessage<'a> { // has borrowed fields: lifetime parameter
pub f_int32: Option<i32>,
pub f_int64: Option<i64>,
pub f_uint32: Option<u32>,
pub f_uint64: Option<u64>,
pub f_sint32: Option<i32>,
pub f_sint64: Option<i64>,
pub f_bool: Option<bool>,
pub f_FooEnum: Option<FooEnum>,
pub f_fixed64: Option<u64>,
pub f_sfixed64: Option<i64>,
pub f_fixed32: Option<u32>,
pub f_sfixed32: Option<i32>,
pub f_double: Option<f64>,
pub f_float: Option<f32>,
pub f_bytes: Option<Cow<'a, [u8]>>, // bytes -> Cow<[u8]>
pub f_string: Option<Cow<'a, str>> // string -> Cow<str>
pub f_self_message: Option<Box<FooMessage<'a>>>, // reference cycle -> Boxed message
pub f_bar_message: Option<BarMessage>,
pub f_repeated_int32: Vec<i32>, // repeated: Vec
pub f_repeated_packed_int32: Vec<i32>, // repeated packed: Vec
}
Leverage rust module system
Nested Messages
message A {
message B {
// ...
}
}
As rust does not allow a struct and a module to share the same name, we use mod_Name
for the nested messages.
pub struct A {
//...
}
pub mod mod_A {
pub struct B {
// ...
}
}
Package
package a.b;
Here we could have used the same name, but for consistency with nested messages, modules are prefixed with mod_
as well.
pub mod mod_a {
pub mod mod_b {
// ...
}
}
Why not rust-protobuf
This library is an alternative to the widely used rust-protobuf.
Pros / Cons
-
Pros
- Much faster, in particular when working with string, bytes and repeated packed fixed size fields (no extra allocation)
- No need to install
protoc
on your machine - No trait objects: faster/simpler parser
- Very simple generated modules (~10x smaller) so you can easily understand what is happening
-
Cons
- Less popular
- most rust-protobuf tests have been migrated here (see v2 and v3)
- quick-protobuf is being used by many people now and is very reliable
- some missing functionalities
- Not a drop-in replacement of rust-protobuf
- everything being explicit you have to handle more things yourself (e.g.
Option
unwrapping,Cow
management)
- everything being explicit you have to handle more things yourself (e.g.
- Less popular
Contribution
Any help is welcomed! (Pull requests of course, bug report, missing functionality etc...)
Licence
MIT