peerplays_migrated/libraries/chain/include/graphene/chain/pts_address.hpp
2019-10-02 12:57:12 +03:00

78 lines
2.8 KiB
C++

/*
* Copyright (c) 2015 Cryptonomex, Inc., and contributors.
*
* The MIT License
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
#pragma once
#include <fc/array.hpp>
#include <string>
namespace fc { namespace ecc { class public_key; } }
namespace graphene { namespace chain {
/**
* Implements address stringification and validation from PTS
*/
struct pts_address
{
pts_address(); ///< constructs empty / null address
pts_address( const std::string& base58str ); ///< converts to binary, validates checksum
pts_address( const fc::ecc::public_key& pub, bool compressed = true, uint8_t version=56 ); ///< converts to binary
uint8_t version()const { return addr.at(0); }
bool is_valid()const;
operator std::string()const; ///< converts to base58 + checksum
fc::array<char,25> addr; ///< binary representation of address
};
inline bool operator == ( const pts_address& a, const pts_address& b ) { return a.addr == b.addr; }
inline bool operator != ( const pts_address& a, const pts_address& b ) { return a.addr != b.addr; }
inline bool operator < ( const pts_address& a, const pts_address& b ) { return a.addr < b.addr; }
} } // namespace graphene::chain
namespace std
{
template<>
struct hash<graphene::chain::pts_address>
{
public:
size_t operator()(const graphene::chain::pts_address &a) const
{
size_t s;
memcpy( (char*)&s, &a.addr.data[sizeof(a)-sizeof(s)], sizeof(s) );
return s;
}
};
}
#include <fc/reflect/reflect.hpp>
FC_REFLECT( graphene::chain::pts_address, (addr) )
namespace fc
{
void to_variant( const graphene::chain::pts_address& var, fc::variant& vo, uint32_t max_depth = 1 );
void from_variant( const fc::variant& var, graphene::chain::pts_address& vo, uint32_t max_depth = 1 );
}