pub fn new_ordered<S: Serialize>(data: S, schema: Option<&Hash>) -> Result<Self> {
        Self::new_from(schema, |buf| {
            // Encode the data
            let mut ser = FogSerializer::from_vec(buf, true);
            data.serialize(&mut ser)?;
            Ok(ser.finish())
        })
    }
/// Create a new Entry from any serializable data whose keys are all ordered. For structs, this
/// means all fields are declared in lexicographic order. For maps, this means a `BTreeMap`
/// type must be used, whose keys are ordered such that they serialize to lexicographically
/// ordered strings. All sub-structs and sub-maps must be similarly ordered.
Create a new Entry from any serializable data whose keys are all ordered. For structs, this
means all fields are declared in lexicographic order. For maps, this means a `BTreeMap`
type must be used, whose keys are ordered such that they serialize to lexicographically
ordered strings. All sub-structs and sub-maps must be similarly ordered.
Create a new Entry from any serializable data whose keys are all ordered . For structs this means all fields are declared in lexicographic order . For maps this means a ` BTreeMap ` type must be used whose keys are ordered such that they serialize to lexicographically ordered strings . All sub - structs and sub - maps must be similarly ordered .
pub fn new_ordered<S: Serialize>(data: S, schema: Option<&Hash>) -> Result<Self> {
        Self::new_from(schema, |buf| {
            // Encode the data
            let mut ser = FogSerializer::from_vec(buf, true);
            data.serialize(&mut ser)?;
            Ok(ser.finish())
        })
    }
pub fn new_ordered < S : Serialize > ( data : S , schema : Option < & Hash > ) -> Result < Self > { Self :: new_from ( schema , | buf | { // Encode the data let mut ser = FogSerializer :: from_vec ( buf , true ) ; data . serialize ( & mut ser ) ? ; Ok ( ser . finish ( ) ) } ) }
Create a new Entry from any serializable data whose keys are all ordered.
Create a new Entry from any serializable data whose keys are all ordered .
data
S
schema
Option<&Hash>
data
S
schema
Option<&Hash>