cavis/libnd4j/include/graph/Stash.h

69 lines
2.0 KiB
C++

/*******************************************************************************
* 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
//
#ifndef LIBND4J_STASH_H
#define LIBND4J_STASH_H
//#include <graph/Block.h>
#include <NDArray.h>
#include <unordered_map>
#include <string>
#include <atomic>
#include <pointercast.h>
namespace nd4j {
namespace graph {
class ND4J_EXPORT KeyPair {
int _node;
std::string _name;
public:
KeyPair(int node = 0, const char * name = nullptr);
bool operator<(const KeyPair& other) const;
};
class ND4J_EXPORT Stash {
protected:
std::map<nd4j::graph::KeyPair, nd4j::NDArray*> _stash;
std::vector<nd4j::NDArray*> _handles;
public:
Stash();
~Stash();
//void storeArray(nd4j::graph::Block<T>& block, const char *name, nd4j::NDArray<T> *array);
void storeArray(int nodeId, const char *name, nd4j::NDArray *array);
//bool checkStash(nd4j::graph::Block<T>& block, const char *name);
bool checkStash(int nodeId, const char *name);
//nd4j::NDArray<T>* extractArray(nd4j::graph::Block<T>& block, const char *name);
nd4j::NDArray* extractArray(int nodeId, const char *name);
void clear();
};
}
}
#endif //LIBND4J_STASH_H