33 lines
1.1 KiB
Rust
33 lines
1.1 KiB
Rust
// Copyright 2015-2018 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 <http://www.gnu.org/licenses/>.
|
|
|
|
//! Bloom grouping.
|
|
//!
|
|
//! Optimization gathering together blooms that are in the same index and are likely to be retrived together.
|
|
|
|
mod bridge;
|
|
mod chain;
|
|
mod database;
|
|
mod group;
|
|
mod position;
|
|
|
|
pub use self::bridge::GroupDatabaseBridge;
|
|
pub use self::chain::BloomGroupChain;
|
|
|
|
pub use self::database::BloomGroupDatabase;
|
|
pub use self::group::BloomGroup;
|
|
pub use self::position::GroupPosition;
|