From 9650494311ccfb89d18beaddeae3fa191be52622 Mon Sep 17 00:00:00 2001
From: debris <marek.kotewicz@gmail.com>
Date: Wed, 2 Dec 2015 15:03:47 +0100
Subject: [PATCH] remove redundant prints

---
 src/triehash.rs | 6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/src/triehash.rs b/src/triehash.rs
index 8c8e9fd85..778dc7f17 100644
--- a/src/triehash.rs
+++ b/src/triehash.rs
@@ -145,7 +145,6 @@ fn as_nibbles(bytes: &[u8]) -> Vec<u8> {
 fn hash256rlp(input: &[(Vec<u8>, Vec<u8>)], pre_len: usize, stream: &mut RlpStream) {
 	let inlen = input.len();
 
-	//println!("input: {:?}", input); 
 	// in case of empty slice, just append empty data
 	if inlen == 0 {
 		stream.append_empty_data();
@@ -174,7 +173,6 @@ fn hash256rlp(input: &[(Vec<u8>, Vec<u8>)], pre_len: usize, stream: &mut RlpStre
 			cmp::min(key.shared_prefix_len(&k), acc)
 		});
 
-	println!("shared_prefix: {}, prefix_len: {}", shared_prefix, pre_len);
 	// if shared prefix is higher than current prefix append its
 	// new part of the key to the stream
 	// then recursively append suffixes of all items who had this key
@@ -200,8 +198,8 @@ fn hash256rlp(input: &[(Vec<u8>, Vec<u8>)], pre_len: usize, stream: &mut RlpStre
 		// cout how many successive elements have same next nibble
 		let len = match begin < input.len() {
 			true => input[begin..].iter()
-				.take_while(| pair | { println!("{:?}", pair.0); pair.0[pre_len] == i }).count(), 
-				//.take_while(|&q| q == i).count(),
+				.take_while(| pair | pair.0[pre_len] == i )
+				.count(), 
 			false => 0
 		};