mirror of
https://github.com/serai-dex/serai.git
synced 2024-11-16 17:07:35 +00:00
Update according to the latest clippy
This commit is contained in:
parent
73566e756d
commit
31b64b3082
7 changed files with 14 additions and 14 deletions
|
@ -43,8 +43,8 @@ impl ClsagInput {
|
|||
// Doesn't include global output indexes as CLSAG doesn't care and won't be affected by it
|
||||
// They're just a unreliable reference to this data which will be included in the message
|
||||
// if in use
|
||||
ring.extend(&pair[0].compress().to_bytes());
|
||||
ring.extend(&pair[1].compress().to_bytes());
|
||||
ring.extend(pair[0].compress().to_bytes());
|
||||
ring.extend(pair[1].compress().to_bytes());
|
||||
}
|
||||
transcript.append_message(b"ring", &ring);
|
||||
|
||||
|
|
|
@ -160,14 +160,14 @@ impl Rpc {
|
|||
.rpc_call(
|
||||
"get_transactions",
|
||||
Some(json!({
|
||||
"txs_hashes": hashes.iter().map(|hash| hex::encode(&hash)).collect::<Vec<_>>()
|
||||
"txs_hashes": hashes.iter().map(hex::encode).collect::<Vec<_>>()
|
||||
})),
|
||||
)
|
||||
.await?;
|
||||
|
||||
if !txs.missed_tx.is_empty() {
|
||||
Err(RpcError::TransactionsNotFound(
|
||||
txs.missed_tx.iter().map(|hash| hex::decode(&hash).unwrap().try_into().unwrap()).collect(),
|
||||
txs.missed_tx.iter().map(|hash| hex::decode(hash).unwrap().try_into().unwrap()).collect(),
|
||||
))?;
|
||||
}
|
||||
|
||||
|
|
|
@ -277,7 +277,7 @@ impl Transaction {
|
|||
serialized.clear();
|
||||
|
||||
self.rct_signatures.prunable.signature_serialize(&mut serialized).unwrap();
|
||||
sig_hash.extend(&hash(&serialized));
|
||||
sig_hash.extend(hash(&serialized));
|
||||
|
||||
hash(&sig_hash)
|
||||
}
|
||||
|
|
|
@ -22,7 +22,7 @@ pub struct AbsoluteId {
|
|||
impl AbsoluteId {
|
||||
pub fn serialize(&self) -> Vec<u8> {
|
||||
let mut res = Vec::with_capacity(32 + 1);
|
||||
res.extend(&self.tx);
|
||||
res.extend(self.tx);
|
||||
res.push(self.o);
|
||||
res
|
||||
}
|
||||
|
@ -80,10 +80,10 @@ impl Metadata {
|
|||
res.extend(self.subaddress.1.to_le_bytes());
|
||||
res.extend(self.payment_id);
|
||||
if let Some(data) = self.arbitrary_data.as_ref() {
|
||||
res.extend(&[1, u8::try_from(data.len()).unwrap()]);
|
||||
res.extend([1, u8::try_from(data.len()).unwrap()]);
|
||||
res.extend(data);
|
||||
} else {
|
||||
res.extend(&[0]);
|
||||
res.extend([0]);
|
||||
}
|
||||
res
|
||||
}
|
||||
|
@ -173,7 +173,7 @@ impl SpendableOutput {
|
|||
|
||||
pub fn serialize(&self) -> Vec<u8> {
|
||||
let mut serialized = self.output.serialize();
|
||||
serialized.extend(&self.global_index.to_le_bytes());
|
||||
serialized.extend(self.global_index.to_le_bytes());
|
||||
serialized
|
||||
}
|
||||
|
||||
|
|
|
@ -212,9 +212,9 @@ impl<C: Curve> FrostCore<C> {
|
|||
let mut serialized = Vec::with_capacity(FrostCore::<C>::serialized_len(self.params.n));
|
||||
serialized.extend(u32::try_from(C::ID.len()).unwrap().to_be_bytes());
|
||||
serialized.extend(C::ID);
|
||||
serialized.extend(&self.params.t.to_be_bytes());
|
||||
serialized.extend(&self.params.n.to_be_bytes());
|
||||
serialized.extend(&self.params.i.to_be_bytes());
|
||||
serialized.extend(self.params.t.to_be_bytes());
|
||||
serialized.extend(self.params.n.to_be_bytes());
|
||||
serialized.extend(self.params.i.to_be_bytes());
|
||||
serialized.extend(self.secret_share.to_repr().as_ref());
|
||||
for l in 1 ..= self.params.n {
|
||||
serialized.extend(self.verification_shares[&l].to_bytes().as_ref());
|
||||
|
|
|
@ -60,7 +60,7 @@ pub struct DigestTranscript<D: SecureDigest>(D);
|
|||
|
||||
impl<D: SecureDigest> DigestTranscript<D> {
|
||||
fn append(&mut self, kind: DigestTranscriptMember, value: &[u8]) {
|
||||
self.0.update(&[kind.as_u8()]);
|
||||
self.0.update([kind.as_u8()]);
|
||||
// Assumes messages don't exceed 16 exabytes
|
||||
self.0.update(u64::try_from(value.len()).unwrap().to_le_bytes());
|
||||
self.0.update(value);
|
||||
|
|
|
@ -108,7 +108,7 @@ impl CoinDb for MemCoinDb {
|
|||
fn select_inputs<C: Coin>(inputs: &mut Vec<C::Output>) -> (Vec<C::Output>, u64) {
|
||||
// Sort to ensure determinism. Inefficient, yet produces the most legible code to be optimized
|
||||
// later
|
||||
inputs.sort_by(|a, b| a.amount().cmp(&b.amount()));
|
||||
inputs.sort_by_key(|a| a.amount());
|
||||
|
||||
// Select the maximum amount of outputs possible
|
||||
let res = inputs.split_off(inputs.len() - C::MAX_INPUTS.min(inputs.len()));
|
||||
|
|
Loading…
Reference in a new issue