cavis/libnd4j/include/graph/impl/Stash.cpp

100 lines
2.9 KiB
C++
Raw Normal View History

2019-06-06 14:21:15 +02:00
/*******************************************************************************
* Copyright (c) 2015-2018 Skymind, Inc.
*
* This program and the accompanying materials are made available under the
* terms of the Apache License, Version 2.0 which is available at
* https://www.apache.org/licenses/LICENSE-2.0.
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations
* under the License.
*
* SPDX-License-Identifier: Apache-2.0
******************************************************************************/
//
// @author raver119@gmail.com
//
#include <graph/Stash.h>
namespace std {
size_t hash<sd::graph::KeyPair>::operator()(const sd::graph::KeyPair& k) const {
using std::hash;
auto res = std::hash<std::string>()(k.name());
res ^= std::hash<int>()(k.key()) + 0x9e3779b9 + (res << 6) + (res >> 2);
return res;
}
}
namespace sd {
2019-06-06 14:21:15 +02:00
namespace graph {
sd::graph::KeyPair::KeyPair(int node, const char * name) {
2019-06-06 14:21:15 +02:00
_node = node;
_name = std::string(name);
}
bool sd::graph::KeyPair::operator<(const KeyPair& other) const {
2019-06-06 14:21:15 +02:00
if (_node < other._node)
return true;
else if (_node > other._node)
return false;
else
return _name < other._name;
}
sd::graph::Stash::Stash() {
2019-06-06 14:21:15 +02:00
//
}
sd::graph::Stash::~Stash() {
2019-06-06 14:21:15 +02:00
if (_handles.size() > 0)
this->clear();
}
/*
bool sd::graph::Stash::checkStash(sd::graph::Block& block, const char *name) {
2019-06-06 14:21:15 +02:00
return checkStash(block.getNodeId(), name);
}
*/
bool sd::graph::Stash::checkStash(int nodeId, const char *name) {
2019-06-06 14:21:15 +02:00
KeyPair kp(nodeId, name);
return _stash.count(kp) > 0;
}
/*
sd::NDArray* sd::graph::Stash::extractArray(sd::graph::Block& block, const char *name) {
2019-06-06 14:21:15 +02:00
return extractArray(block.getNodeId(), name);
}
*/
sd::NDArray* sd::graph::Stash::extractArray(int nodeId, const char *name) {
2019-06-06 14:21:15 +02:00
KeyPair kp(nodeId, name);
return _stash[kp];
}
/*
void sd::graph::Stash::storeArray(sd::graph::Block& block, const char *name, sd::NDArray *array) {
2019-06-06 14:21:15 +02:00
storeArray(block.getNodeId(), name, array);
}
*/
void sd::graph::Stash::storeArray(int nodeId, const char *name, sd::NDArray *array) {
2019-06-06 14:21:15 +02:00
KeyPair kp(nodeId, name);
_stash[kp] = array;
// storing reference to delete it once it's not needed anymore
_handles.push_back(array);
}
void sd::graph::Stash::clear() {
2019-06-06 14:21:15 +02:00
for (auto v: _handles)
delete v;
_handles.clear();
_stash.clear();
}
}
}