milksad
/
rust-bitcoin-unsafe-fast
14
0
Fork 0
Code Issues Pull Requests Activity

Capitalize Huffman 

Huffman is a proper noun and should be capitalized in docs and strings.

Capitalize all occurances of Huffman in docs and strings.
This commit is contained in:
Jamil Lambert, PhD 2024-06-25 14:23:10 +01:00
parent 175f69abeb
commit 717da4bf69
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
bitcoin/src/taproot/mod.rs
View File

@ -422,14 +422,14 @@ impl TaprootBuilder {
// Insert the sum of first two in the tree as a new node // Insert the sum of first two in the tree as a new node
// N.B.: p1 + p2 can not practically saturate as you would need to have 2**32 max u32s // N.B.: p1 + p2 can not practically saturate as you would need to have 2**32 max u32s
// from the input to overflow. However, saturating is a reasonable behavior here as // from the input to overflow. However, saturating is a reasonable behavior here as
// huffman tree construction would treat all such elements as "very likely". // Huffman tree construction would treat all such elements as "very likely".
let p = Reverse(p1.0.saturating_add(p2.0)); let p = Reverse(p1.0.saturating_add(p2.0));
node_weights.push((p, NodeInfo::combine(s1, s2)?)); node_weights.push((p, NodeInfo::combine(s1, s2)?));
} }
// Every iteration of the loop reduces the node_weights.len() by exactly 1 // Every iteration of the loop reduces the node_weights.len() by exactly 1
// Therefore, the loop will eventually terminate with exactly 1 element // Therefore, the loop will eventually terminate with exactly 1 element
debug_assert_eq!(node_weights.len(), 1); debug_assert_eq!(node_weights.len(), 1);
let node = node_weights.pop().expect("huffman tree algorithm is broken").1; let node = node_weights.pop().expect("Huffman tree algorithm is broken").1;
Ok(TaprootBuilder { branch: vec![Some(node)] }) Ok(TaprootBuilder { branch: vec![Some(node)] })
} }