mirror of
https://github.com/Xahau/xahaud.git
synced 2025-12-06 17:27:52 +00:00
a2acffdfa3
This introduces functions get and set, and a family of specialized structs called STExchange. These interfaces allow efficient and seamless interchange between serialized object fields and user defined types, especially variable length objects. A new base class template TypedField is mixed into existing SField declarations to encode information on the field, allowing template metaprograms to both customize interchange based on the type and detect misuse at compile-time. New types AnyPublicKey and AnySecretKey are introduced. These are intended to replace the corresponding functionality in the deprecated class RippleAddress. Specializations of STExchange for these types are provided to allow interchange. New free functions verify and sign allow signature verification and signature generation for serialized objects. * Add Buffer and Slice primitives * Add TypedField and modify some SField * Add STExchange and specializations for STBlob and STInteger * Improve STBlob and STInteger to support STExchange * Expose raw data in RippleAddress and Serializer
111 lines
2.9 KiB
C++
111 lines
2.9 KiB
C++
//------------------------------------------------------------------------------
|
|
/*
|
|
This file is part of rippled: https://github.com/ripple/rippled
|
|
Copyright (c) 2012, 2013 Ripple Labs Inc.
|
|
|
|
Permission to use, copy, modify, and/or distribute this software for any
|
|
purpose with or without fee is hereby granted, provided that the above
|
|
copyright notice and this permission notice appear in all copies.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|
|
//==============================================================================
|
|
|
|
#ifndef RIPPLE_BASICS_SLICE_H_INCLUDED
|
|
#define RIPPLE_BASICS_SLICE_H_INCLUDED
|
|
|
|
#include <beast/utility/noexcept.h>
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
#include <cstdint>
|
|
|
|
namespace ripple {
|
|
|
|
/** An immutable linear range of bytes.
|
|
|
|
A fully constructed Slice is guaranteed to be in a valid state.
|
|
Default construction, construction from nullptr, and zero-byte
|
|
ranges are disallowed. A Slice is lightweight and copyable, it
|
|
retains no ownership of the underlying memory.
|
|
*/
|
|
class Slice
|
|
{
|
|
private:
|
|
std::uint8_t const* data_;
|
|
std::size_t size_;
|
|
|
|
public:
|
|
// Disallowed
|
|
Slice() = delete;
|
|
|
|
Slice (Slice const&) = default;
|
|
|
|
Slice& operator= (Slice const&) = default;
|
|
|
|
/** Create a slice pointing to existing memory. */
|
|
Slice (void const* data, std::size_t size)
|
|
: data_ (reinterpret_cast<
|
|
std::uint8_t const*>(data))
|
|
, size_ (size)
|
|
{
|
|
assert(data_ != nullptr);
|
|
assert(size_ > 0);
|
|
}
|
|
|
|
/** Returns the number of bytes in the storage.
|
|
|
|
This will never be zero.
|
|
*/
|
|
std::size_t
|
|
size() const noexcept
|
|
{
|
|
return size_;
|
|
}
|
|
|
|
/** Return a pointer to beginning of the storage.
|
|
@note The return type is guaranteed to be a pointer
|
|
to a single byte, to facilitate pointer arithmetic.
|
|
*/
|
|
std::uint8_t const*
|
|
data() const noexcept
|
|
{
|
|
return data_;
|
|
}
|
|
};
|
|
|
|
template <class Hasher>
|
|
inline
|
|
void
|
|
hash_append (Hasher& h, Slice const& v)
|
|
{
|
|
h.append(v.data(), v.size());
|
|
}
|
|
|
|
inline
|
|
bool
|
|
operator== (Slice const& lhs, Slice const& rhs) noexcept
|
|
{
|
|
return lhs.size() == rhs.size() &&
|
|
std::memcmp(
|
|
lhs.data(), rhs.data(), lhs.size()) == 0;
|
|
}
|
|
|
|
inline
|
|
bool
|
|
operator< (Slice const& lhs, Slice const& rhs) noexcept
|
|
{
|
|
return std::lexicographical_compare(
|
|
lhs.data(), lhs.data() + lhs.size(),
|
|
rhs.data(), rhs.data() + rhs.size());
|
|
}
|
|
|
|
} // ripple
|
|
|
|
#endif
|