     1
     2
     3
     4
     5
     6
     7
     8
     9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40
    41
    42
    43
    44
    45
    46
    47
    48
    49
    50
    51
    52
    53
    54
    55
    56
    57
    58
    59
    60
    61
    62
    63
    64

    // 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 <http://www.gnu.org/licenses/>.

    //! RPC generic methods implementation.
    use std::collections::BTreeMap;
    use jsonrpc_core::Error;
    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>, Error> {
    		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>, Error> {
    		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)
    	}
    }

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result
+
  Collapse/expand all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)