/* Copyright 2016, Ableton AG, Berlin. All rights reserved. * * This program 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 2 of the License, or * (at your option) any later version. * * This program 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 this program. If not, see . * * If you would like to incorporate Link into a proprietary software application, * please contact . */ #pragma once #include #include #include #include #include namespace ableton { namespace link { using NodeIdArray = std::array; struct NodeId : NodeIdArray { NodeId() = default; NodeId(NodeIdArray rhs) : NodeIdArray(std::move(rhs)) { } template static NodeId random() { using namespace std; NodeId nodeId; Random random; generate(nodeId.begin(), nodeId.end(), [&] { return random(); }); return nodeId; } friend std::ostream& operator<<(std::ostream& stream, const NodeId& id) { return stream << std::string{id.cbegin(), id.cend()}; } template friend It toNetworkByteStream(const NodeId& nodeId, It out) { return discovery::toNetworkByteStream(nodeId, std::move(out)); } template static std::pair fromNetworkByteStream(It begin, It end) { using namespace std; auto result = discovery::Deserialize::fromNetworkByteStream( std::move(begin), std::move(end)); return make_pair(NodeId(std::move(result.first)), std::move(result.second)); } }; } // namespace link } // namespace ableton