mirror of
https://github.com/pezkuwichain/serde.git
synced 2026-06-13 07:51:03 +00:00
Work on the README, add a json example
This commit is contained in:
@@ -6,20 +6,175 @@ Serde Rust Serialization Framework
|
|||||||
Serde is a powerful framework that enables serialization libraries to
|
Serde is a powerful framework that enables serialization libraries to
|
||||||
generically serialize Rust data structures without the overhead of runtime type
|
generically serialize Rust data structures without the overhead of runtime type
|
||||||
information. In many situations, the handshake protocol between serializers and
|
information. In many situations, the handshake protocol between serializers and
|
||||||
serializees can be completely optimized away, leaving serde to perform roughly
|
serializees can be completely optimized away, leaving Serde to perform roughly
|
||||||
the same speed as a hand written serializer for a specific type.
|
the same speed as a hand written serializer for a specific type.
|
||||||
|
|
||||||
Documentation is available at http://erickt.github.io/rust-serde/serde
|
Documentation is available at http://erickt.github.io/rust-serde/serde
|
||||||
|
|
||||||
Example
|
Making a Type Serializable
|
||||||
=======
|
==========================
|
||||||
|
|
||||||
Serde works by threading visitors between the serializer and the serializee.
|
The simplest way to make a type serializable is to use the `serde_macros`
|
||||||
This allows data to be generically shared between the two without needing to
|
syntax extension, which comes with a `#[derive(Serialize, Deserialize)]`
|
||||||
wrap the values in a separate structure. Here's an example struct serializer.
|
annotation, which automatically generates implementations of
|
||||||
It works by reinterpreting the the structure as a named map, with the keys
|
[Serialize](http://erickt.github.io/rust-serde/serde/ser/trait.Serialize.html)
|
||||||
being the stringified field name, and a simple state machine to step
|
and
|
||||||
through each field:
|
[Deserialize](http://erickt.github.io/rust-serde/serde/de/trait.Deserialize.html)
|
||||||
|
for the annotated type:
|
||||||
|
|
||||||
|
```rust
|
||||||
|
#[feature(custom_derive, plugin)]
|
||||||
|
#[plugin(serde_macros)]
|
||||||
|
|
||||||
|
extern crate serde;
|
||||||
|
|
||||||
|
...
|
||||||
|
|
||||||
|
#[derive(Serialize, Deserialize)]
|
||||||
|
struct Point {
|
||||||
|
x: i32,
|
||||||
|
y: i32,
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
Serde bundles a high performance JSON serializer and deserializer,
|
||||||
|
[serde::json](http://erickt.github.io/rust-serde/serde/json/index.html),
|
||||||
|
which comes with the helper functions
|
||||||
|
[to_string](http://erickt.github.io/rust-serde/serde/json/ser/fn.to_string.html)
|
||||||
|
and
|
||||||
|
[from_str](http://erickt.github.io/rust-serde/serde/json/de/fn.from_str.html)
|
||||||
|
that make it easy to go to and from JSON:
|
||||||
|
|
||||||
|
```rust
|
||||||
|
use serde::json;
|
||||||
|
|
||||||
|
...
|
||||||
|
|
||||||
|
let point = Point { x: 1, y: 2 };
|
||||||
|
let serialized_point = json::to_string(&point).unwrap();
|
||||||
|
|
||||||
|
println!("{}", serialized_point); // prints: {"x":1,"y":2}
|
||||||
|
|
||||||
|
let deserialize_point: Point = json::from_str(&serialized_point).unwrap();
|
||||||
|
```
|
||||||
|
|
||||||
|
[serde::json](http://erickt.github.io/rust-serde/serde/json/index.html) also
|
||||||
|
supports a generic
|
||||||
|
[Value](http://erickt.github.io/rust-serde/serde/json/value/enum.Value.html)
|
||||||
|
type, which can represent any JSON value. Also, any
|
||||||
|
[Serialize](http://erickt.github.io/rust-serde/serde/ser/trait.Serialize.html)
|
||||||
|
and
|
||||||
|
[Deserialize](http://erickt.github.io/rust-serde/serde/de/trait.Deserialize.html)
|
||||||
|
can be converted into a
|
||||||
|
[Value](http://erickt.github.io/rust-serde/serde/json/value/enum.Value.html)
|
||||||
|
with the methods
|
||||||
|
[to_value](http://erickt.github.io/rust-serde/serde/json/value/fn.to_value.html)
|
||||||
|
and
|
||||||
|
[from_value](http://erickt.github.io/rust-serde/serde/json/value/fn.from_value.html):
|
||||||
|
|
||||||
|
```rust
|
||||||
|
let point = Point { x: 1, y: 2 };
|
||||||
|
let point_value = json::to_value(&point).unwrap();
|
||||||
|
|
||||||
|
println!("{}", point_value.find("x")); // prints: Some(1)
|
||||||
|
|
||||||
|
let deserialize_point: Point = json::from_value(point_value).unwrap();
|
||||||
|
```
|
||||||
|
|
||||||
|
Serialization without Macros
|
||||||
|
============================
|
||||||
|
|
||||||
|
Under the covers, Serde extensively uses the Visitor pattern to thread state
|
||||||
|
between the
|
||||||
|
[Serializer](http://erickt.github.io/rust-serde/serde/ser/trait.Serializer.html)
|
||||||
|
and
|
||||||
|
[Serialize](http://erickt.github.io/rust-serde/serde/ser/trait.Serialize.html)
|
||||||
|
without the two having specific information about each other's concrete type.
|
||||||
|
This has many of the same benefits as frameworks that use runtime type
|
||||||
|
information without the overhead. In fact, when compiling with optimizations,
|
||||||
|
Rust is able to remove most or all the visitor state, and generate code that's
|
||||||
|
nearly as fast as a hand written serializer format for a specific type.
|
||||||
|
|
||||||
|
To see it in action, lets look at how a simple type like `i32` is serialized.
|
||||||
|
The
|
||||||
|
[Serializer](http://erickt.github.io/rust-serde/serde/ser/trait.Serializer.html)
|
||||||
|
is threaded through the type:
|
||||||
|
|
||||||
|
```rust
|
||||||
|
impl serde::Serialize for i32 {
|
||||||
|
fn serialize<S>(&self, serializer: &mut S) -> Result<(), S::Error>
|
||||||
|
where S: serde::Serializer,
|
||||||
|
{
|
||||||
|
serializer.visit_i32(*self)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
As you can see it's pretty simple. More complex types like `BTreeMap` need to
|
||||||
|
pass a
|
||||||
|
[MapVisitor](http://erickt.github.io/rust-serde/serde/ser/trait.MapVisitor.html)
|
||||||
|
to the
|
||||||
|
[Serializer](http://erickt.github.io/rust-serde/serde/ser/trait.Serializer.html)
|
||||||
|
in order to walk through the type:
|
||||||
|
|
||||||
|
```rust
|
||||||
|
impl<K, V> Serialize for BTreeMap<K, V>
|
||||||
|
where K: Serialize + Ord,
|
||||||
|
V: Serialize,
|
||||||
|
{
|
||||||
|
#[inline]
|
||||||
|
fn serialize<S>(&self, serializer: &mut S) -> Result<(), S::Error>
|
||||||
|
where S: Serializer,
|
||||||
|
{
|
||||||
|
serializer.visit_map(MapIteratorVisitor::new(self.iter(), Some(self.len())))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pub struct MapIteratorVisitor<Iter> {
|
||||||
|
iter: Iter,
|
||||||
|
len: Option<usize>,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl<K, V, Iter> MapIteratorVisitor<Iter>
|
||||||
|
where Iter: Iterator<Item=(K, V)>
|
||||||
|
{
|
||||||
|
#[inline]
|
||||||
|
pub fn new(iter: Iter, len: Option<usize>) -> MapIteratorVisitor<Iter> {
|
||||||
|
MapIteratorVisitor {
|
||||||
|
iter: iter,
|
||||||
|
len: len,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
impl<K, V, I> MapVisitor for MapIteratorVisitor<I>
|
||||||
|
where K: Serialize,
|
||||||
|
V: Serialize,
|
||||||
|
I: Iterator<Item=(K, V)>,
|
||||||
|
{
|
||||||
|
#[inline]
|
||||||
|
fn visit<S>(&mut self, serializer: &mut S) -> Result<Option<()>, S::Error>
|
||||||
|
where S: Serializer,
|
||||||
|
{
|
||||||
|
match self.iter.next() {
|
||||||
|
Some((key, value)) => {
|
||||||
|
let value = try!(serializer.visit_map_elt(key, value));
|
||||||
|
Ok(Some(value))
|
||||||
|
}
|
||||||
|
None => Ok(None)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
#[inline]
|
||||||
|
fn len(&self) -> Option<usize> {
|
||||||
|
self.len
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
Serializing structs follow this same pattern. In fact, structs are represented
|
||||||
|
as a named map. It's visitor uses a simple state machine to iterate through all
|
||||||
|
the fields:
|
||||||
|
|
||||||
```rust
|
```rust
|
||||||
struct Point {
|
struct Point {
|
||||||
@@ -29,42 +184,165 @@ struct Point {
|
|||||||
|
|
||||||
impl serde::Serialize for Point {
|
impl serde::Serialize for Point {
|
||||||
fn serialize<S>(&self, serializer: &mut S) -> Result<(), S::Error>
|
fn serialize<S>(&self, serializer: &mut S) -> Result<(), S::Error>
|
||||||
where S: serialize::Serializer
|
where S: serde::Serializer
|
||||||
{
|
{
|
||||||
struct MapVisitor<'a> {
|
serializer.visit_named_map("Point", PointMapVisitor {
|
||||||
value: &'a Point,
|
|
||||||
state: u8,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl<'a> serde::ser::MapVisitor for MapVisitor {
|
|
||||||
fn visit<S>(&mut self, serializer: &mut S) -> Result<Option(), S::Error> {
|
|
||||||
match self.state {
|
|
||||||
0 => {
|
|
||||||
self.state += 1;
|
|
||||||
Ok(Some(try!(serializer.visit_map_elt("x", &self.x)))
|
|
||||||
}
|
|
||||||
1 => {
|
|
||||||
self.state += 1;
|
|
||||||
Ok(Some(try!(serializer.visit_map_elt("y", &self.y))))
|
|
||||||
}
|
|
||||||
_ => {
|
|
||||||
Ok(None)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
serializer.visit_named_map("Point", MapVisitor {
|
|
||||||
value: self,
|
value: self,
|
||||||
state: 0,
|
state: 0,
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
struct PointMapVisitor<'a> {
|
||||||
|
value: &'a Point,
|
||||||
|
state: u8,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl<'a> serde::ser::MapVisitor for PointMapVisitor {
|
||||||
|
fn visit<S>(&mut self, serializer: &mut S) -> Result<Option(), S::Error>
|
||||||
|
where S: serde::Serializer
|
||||||
|
{
|
||||||
|
match self.state {
|
||||||
|
0 => {
|
||||||
|
self.state += 1;
|
||||||
|
Ok(Some(try!(serializer.visit_map_elt("x", &self.x)))
|
||||||
|
}
|
||||||
|
1 => {
|
||||||
|
self.state += 1;
|
||||||
|
Ok(Some(try!(serializer.visit_map_elt("y", &self.y))))
|
||||||
|
}
|
||||||
|
_ => {
|
||||||
|
Ok(None)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
Deserialization is a bit more tricky. We need to deserialize a field from a string, but in order to
|
Deserialization without Macros
|
||||||
avoid some borrow checker issues and in desire to avoid allocations, we deserialize field names
|
==============================
|
||||||
into an enum:
|
|
||||||
|
Deserialization is a little more complicated since there's a bit more error
|
||||||
|
handling that needs to occur. Let's start with the simple `i32`
|
||||||
|
[Deserialize](http://erickt.github.io/rust-serde/serde/de/trait.Deserialize.html)
|
||||||
|
implementation. It passes a
|
||||||
|
[Visitor](http://erickt.github.io/rust-serde/serde/de/trait.Visitor.html) to the
|
||||||
|
[Deserializer](http://erickt.github.io/rust-serde/serde/de/trait.Deserializer.html).
|
||||||
|
The [Visitor](http://erickt.github.io/rust-serde/serde/de/trait.Visitor.html)
|
||||||
|
can create the `i32` from a variety of different types:
|
||||||
|
|
||||||
|
```rust
|
||||||
|
impl Deserialize for i32 {
|
||||||
|
fn deserialize<D>(deserializer: &mut D) -> Result<$ty, D::Error>
|
||||||
|
where D: serde::Deserializer,
|
||||||
|
{
|
||||||
|
deserializer.visit(I32Visitor)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
struct I32Visitor;
|
||||||
|
|
||||||
|
impl serde::de::Visitor for I32Visitor {
|
||||||
|
type Value = i32;
|
||||||
|
|
||||||
|
fn visit_i16<E>(&mut self, value: i16) -> Result<i16, E>
|
||||||
|
where E: Error,
|
||||||
|
{
|
||||||
|
self.visit_i32(value as i32)
|
||||||
|
}
|
||||||
|
|
||||||
|
fn visit_i32<E>(&mut self, value: i32) -> Result<i32, E>
|
||||||
|
where E: Error,
|
||||||
|
{
|
||||||
|
Ok(value)
|
||||||
|
}
|
||||||
|
|
||||||
|
...
|
||||||
|
|
||||||
|
```
|
||||||
|
|
||||||
|
Since it's possible for this type to get passed an unexpected type, we need a
|
||||||
|
way to error out. This is done by way of the
|
||||||
|
[Error](http://erickt.github.io/rust-serde/serde/de/trait.Error.html) trait,
|
||||||
|
which allows a
|
||||||
|
[Deserialize](http://erickt.github.io/rust-serde/serde/de/trait.Deserialize.html)
|
||||||
|
to generate an error for a few common error conditions. Here's how it could be used:
|
||||||
|
|
||||||
|
```rust
|
||||||
|
...
|
||||||
|
|
||||||
|
fn visit_string<E>(&mut self, _: String) -> Result<i32, E>
|
||||||
|
where E: Error,
|
||||||
|
{
|
||||||
|
Err(serde::de::Error::syntax_error())
|
||||||
|
}
|
||||||
|
|
||||||
|
...
|
||||||
|
|
||||||
|
```
|
||||||
|
|
||||||
|
Maps follow a similar pattern as before, and use a
|
||||||
|
[MapVisitor](http://erickt.github.io/rust-serde/serde/de/trait.MapVisitor.html)
|
||||||
|
to walk through the values generated by the
|
||||||
|
[Deserializer](http://erickt.github.io/rust-serde/serde/de/trait.Deserializer.html).
|
||||||
|
|
||||||
|
```rust
|
||||||
|
impl<K, V> serde::Deserialize for BTreeMap<K, V>
|
||||||
|
where K: serde::Deserialize + Eq + Ord,
|
||||||
|
V: serde::Deserialize,
|
||||||
|
{
|
||||||
|
fn deserialize<D>(deserializer: &mut D) -> Result<BTreeMap<K, V>, D::Error>
|
||||||
|
where D: serde::Deserializer,
|
||||||
|
{
|
||||||
|
deserializer.visit(BTreeMapVisitor::new())
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pub struct BTreeMapVisitor<K, V> {
|
||||||
|
marker: PhantomData<BTreeMap<K, V>>,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl<K, V> BTreeMapVisitor<K, V> {
|
||||||
|
pub fn new() -> Self {
|
||||||
|
BTreeMapVisitor {
|
||||||
|
marker: PhantomData,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
impl<K, V> serde::de::Visitor for BTreeMapVisitor<K, V>
|
||||||
|
where K: serde::de::Deserialize + Ord,
|
||||||
|
V: serde::de::Deserialize
|
||||||
|
{
|
||||||
|
type Value = BTreeMap<K, V>;
|
||||||
|
|
||||||
|
fn visit_unit<E>(&mut self) -> Result<BTreeMap<K, V>, E>
|
||||||
|
where E: Error,
|
||||||
|
{
|
||||||
|
Ok(BTreeMap::new())
|
||||||
|
}
|
||||||
|
|
||||||
|
fn visit_map<V_>(&mut self, mut visitor: V_) -> Result<BTreeMap<K, V>, V_::Error>
|
||||||
|
where V_: MapVisitor,
|
||||||
|
{
|
||||||
|
let mut values = BTreeMap::new();
|
||||||
|
|
||||||
|
while let Some((key, value)) = try!(visitor.visit()) {
|
||||||
|
values.insert(key, value);
|
||||||
|
}
|
||||||
|
|
||||||
|
try!(visitor.end());
|
||||||
|
|
||||||
|
Ok(values)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
```
|
||||||
|
|
||||||
|
Deserializing structs goes a step further in order to support not allocating a
|
||||||
|
`String` to hold the field names. This is done by custom field enum that
|
||||||
|
deserializes an enum variant from a string. So for our `Point` example from
|
||||||
|
before, we need to generate:
|
||||||
|
|
||||||
```rust
|
```rust
|
||||||
enum PointField {
|
enum PointField {
|
||||||
@@ -104,61 +382,42 @@ impl serde::Deserialize for Point {
|
|||||||
fn deserialize<D>(deserializer: &mut D) -> Result<Point, D::Error>
|
fn deserialize<D>(deserializer: &mut D) -> Result<Point, D::Error>
|
||||||
where D: serde::de::Deserializer
|
where D: serde::de::Deserializer
|
||||||
{
|
{
|
||||||
struct PointVisitor;
|
|
||||||
|
|
||||||
impl serde::de::Visitor for PointVisitor {
|
|
||||||
type Value = Point;
|
|
||||||
|
|
||||||
fn visit_map<V>(&mut self, mut visitor: V) -> Result<Point, V::Error>
|
|
||||||
where V: serde::de::MapVisitor
|
|
||||||
{
|
|
||||||
let mut x = None;
|
|
||||||
let mut y = None;
|
|
||||||
|
|
||||||
loop {
|
|
||||||
match try!(visitor.visit_key()) {
|
|
||||||
Some(Field::X) => { x = Some(try!(visitor.visit_value())); }
|
|
||||||
Some(Field::Y) => { y = Some(try!(visitor.visit_value())); }
|
|
||||||
None => { break; }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
let x = match x {
|
|
||||||
Some(x) => x,
|
|
||||||
None => try!(visitor.missing_field("x")),
|
|
||||||
};
|
|
||||||
|
|
||||||
let y = match y {
|
|
||||||
Some(y) => y,
|
|
||||||
None => try!(visitor.missing_field("y")),
|
|
||||||
};
|
|
||||||
|
|
||||||
try!(visitor.end());
|
|
||||||
|
|
||||||
Ok(Point{ x: x, y: y })
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
deserializer.visit_named_map("Point", PointVisitor)
|
deserializer.visit_named_map("Point", PointVisitor)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
```
|
struct PointVisitor;
|
||||||
|
|
||||||
There's a bit of machinery required to write implementations of `Serialize` and
|
impl serde::de::Visitor for PointVisitor {
|
||||||
`Deserialize`. Fortunately it is not necessary in most circumstances. Instead,
|
type Value = Point;
|
||||||
it's much easier to use the `serde_macros` plugin. The prior code can be
|
|
||||||
rewritten as:
|
|
||||||
|
|
||||||
```rust
|
fn visit_map<V>(&mut self, mut visitor: V) -> Result<Point, V::Error>
|
||||||
#![feature(custom_derive)]
|
where V: serde::de::MapVisitor
|
||||||
#![plugin(serde_macros)]
|
{
|
||||||
|
let mut x = None;
|
||||||
|
let mut y = None;
|
||||||
|
|
||||||
extern crate serde;
|
loop {
|
||||||
|
match try!(visitor.visit_key()) {
|
||||||
|
Some(Field::X) => { x = Some(try!(visitor.visit_value())); }
|
||||||
|
Some(Field::Y) => { y = Some(try!(visitor.visit_value())); }
|
||||||
|
None => { break; }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
#[derive(Serialize, Deserialize)]
|
let x = match x {
|
||||||
struct Point {
|
Some(x) => x,
|
||||||
x: i32,
|
None => try!(visitor.missing_field("x")),
|
||||||
y: i32,
|
};
|
||||||
|
|
||||||
|
let y = match y {
|
||||||
|
Some(y) => y,
|
||||||
|
None => try!(visitor.missing_field("y")),
|
||||||
|
};
|
||||||
|
|
||||||
|
try!(visitor.end());
|
||||||
|
|
||||||
|
Ok(Point{ x: x, y: y })
|
||||||
|
}
|
||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|||||||
@@ -0,0 +1,64 @@
|
|||||||
|
#![feature(custom_derive, plugin)]
|
||||||
|
#![plugin(serde_macros)]
|
||||||
|
|
||||||
|
extern crate serde;
|
||||||
|
|
||||||
|
use std::collections::BTreeMap;
|
||||||
|
use serde::json;
|
||||||
|
|
||||||
|
// Creating serializable types with serde is quite simple with `serde_macros`. It implements a
|
||||||
|
// syntax extension that automatically generates the necessary serde trait implementations.
|
||||||
|
#[derive(Debug, Serialize, Deserialize)]
|
||||||
|
struct Point {
|
||||||
|
x: i32,
|
||||||
|
y: i32,
|
||||||
|
}
|
||||||
|
|
||||||
|
fn main() {
|
||||||
|
let point = Point { x: 5, y: 6 };
|
||||||
|
|
||||||
|
// Serializing to JSON is pretty simple by using the `to_string` method:
|
||||||
|
let serialized_point = json::to_string(&point).unwrap();
|
||||||
|
|
||||||
|
println!("{}", serialized_point);
|
||||||
|
// prints:
|
||||||
|
//
|
||||||
|
// {"x":5,"y":6}
|
||||||
|
|
||||||
|
// There is also support for pretty printing using `to_string_pretty`:
|
||||||
|
let serialized_point = json::to_string_pretty(&point).unwrap();
|
||||||
|
|
||||||
|
println!("{}", serialized_point);
|
||||||
|
// prints:
|
||||||
|
//
|
||||||
|
// {
|
||||||
|
// "x":5,
|
||||||
|
// "y":6
|
||||||
|
// }
|
||||||
|
|
||||||
|
// Values can also be deserialized with the same style using `from_str`:
|
||||||
|
let deserialized_point: Point = json::from_str(&serialized_point).unwrap();
|
||||||
|
|
||||||
|
println!("{:?}", deserialized_point);
|
||||||
|
// prints:
|
||||||
|
//
|
||||||
|
// Point { x: 5, y: 6 }
|
||||||
|
|
||||||
|
// `Point`s aren't the only type that can be serialized to. Because `Point` members have the
|
||||||
|
// same type, they can be also serialized into a map. Also,
|
||||||
|
let deserialized_map: BTreeMap<String, i64> = json::from_str(&serialized_point).unwrap();
|
||||||
|
|
||||||
|
println!("{:?}", deserialized_map);
|
||||||
|
// prints:
|
||||||
|
//
|
||||||
|
// {"x": 5, "y": 6}
|
||||||
|
|
||||||
|
// If you need to accept arbitrary data, you can also deserialize into `json::Value`, which
|
||||||
|
// can represent all JSON values.
|
||||||
|
let deserialized_value: json::Value = json::from_str(&serialized_point).unwrap();
|
||||||
|
|
||||||
|
println!("{:?}", deserialized_value);
|
||||||
|
// prints:
|
||||||
|
//
|
||||||
|
// {"x":5,"y":6}
|
||||||
|
}
|
||||||
Reference in New Issue
Block a user