98b7c07171
* Update `add_license` script * run script * add `remove duplicate lines script` and run it * Revert changes `English spaces` * strip whitespaces * Revert `GPL` in files with `apache/mit license` * don't append `gpl license` in files with other lic * Don't append `gpl header` in files with other lic. * re-ran script * include c and cpp files too * remove duplicate header * rebase nit
65 lines
1.8 KiB
Rust
65 lines
1.8 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/>.
|
|
|
|
//! RPC generic methods implementation.
|
|
use std::collections::BTreeMap;
|
|
use jsonrpc_core::Result;
|
|
use v1::traits::Rpc;
|
|
|
|
/// RPC generic methods implementation.
|
|
pub struct RpcClient {
|
|
modules: BTreeMap<String, String>,
|
|
valid_apis: Vec<String>,
|
|
}
|
|
|
|
impl RpcClient {
|
|
/// Creates new `RpcClient`.
|
|
pub fn new(modules: BTreeMap<String, String>) -> Self {
|
|
// geth 1.3.6 fails upon receiving unknown api
|
|
let valid_apis = vec!["web3", "eth", "net", "personal", "rpc"];
|
|
|
|
RpcClient {
|
|
modules: modules,
|
|
valid_apis: valid_apis.into_iter().map(|x| x.to_owned()).collect(),
|
|
}
|
|
}
|
|
}
|
|
|
|
impl Rpc for RpcClient {
|
|
fn rpc_modules(&self) -> Result<BTreeMap<String, String>> {
|
|
let modules = self.modules.iter()
|
|
.fold(BTreeMap::new(), |mut map, (k, v)| {
|
|
map.insert(k.to_owned(), v.to_owned());
|
|
map
|
|
});
|
|
|
|
Ok(modules)
|
|
}
|
|
|
|
fn modules(&self) -> Result<BTreeMap<String, String>> {
|
|
let modules = self.modules.iter()
|
|
.filter(|&(k, _v)| {
|
|
self.valid_apis.contains(k)
|
|
})
|
|
.fold(BTreeMap::new(), |mut map, (k, v)| {
|
|
map.insert(k.to_owned(), v.to_owned());
|
|
map
|
|
});
|
|
|
|
Ok(modules)
|
|
}
|
|
}
|