// Copyright 2015-2017 Parity Technologies (UK) Ltd. // This file is part of Parity. // Parity is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // Parity is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // You should have received a copy of the GNU General Public License // along with Parity. If not, see . use bloomchain as bc; use util::HeapSizeOf; use basic_types::LogBloom; /// Helper structure representing bloom of the trace. #[derive(Debug, Clone, RlpEncodableWrapper, RlpDecodableWrapper)] pub struct Bloom(LogBloom); impl From for Bloom { fn from(bloom: LogBloom) -> Self { Bloom(bloom) } } impl From for Bloom { fn from(bloom: bc::Bloom) -> Self { let bytes: [u8; 256] = bloom.into(); Bloom(LogBloom::from(bytes)) } } impl Into for Bloom { fn into(self) -> bc::Bloom { let log = self.0; bc::Bloom::from(log.0) } } impl HeapSizeOf for Bloom { fn heap_size_of_children(&self) -> usize { 0 } }