blob: 0a536bfd59d09d053e4afe0061c22d4294d15553 [file] [log] [blame]
/**
* Copyright (c) 2016-present, Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://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.
*/
#pragma once
#include <vector>
#include "caffe2/core/context.h"
#include "caffe2/core/operator.h"
#include "caffe2/utils/math.h"
namespace caffe2 {
template <typename T, class Context>
class KeySplitOp : public Operator<Context> {
public:
USE_OPERATOR_CONTEXT_FUNCTIONS;
KeySplitOp(const OperatorDef& operator_def, Workspace* ws)
: Operator<Context>(operator_def, ws),
categorical_limit_(
OperatorBase::GetSingleArgument<int>("categorical_limit", 0)) {
CAFFE_ENFORCE_GT(categorical_limit_, 0);
}
bool RunOnDevice() override {
auto& keys = Input(0);
int N = keys.size();
const T* keys_data = keys.template data<T>();
std::vector<int> counts(categorical_limit_);
std::vector<int*> eids(categorical_limit_);
for (int k = 0; k < categorical_limit_; k++) {
counts[k] = 0;
}
for (int i = 0; i < N; i++) {
int k = keys_data[i];
CAFFE_ENFORCE_GT(categorical_limit_, k);
CAFFE_ENFORCE_GE(k, 0);
counts[k]++;
}
for (int k = 0; k < categorical_limit_; k++) {
auto* eid = Output(k);
eid->Resize(counts[k]);
eids[k] = eid->template mutable_data<int>();
counts[k] = 0;
}
for (int i = 0; i < N; i++) {
int k = keys_data[i];
eids[k][counts[k]++] = i;
}
return true;
}
private:
int categorical_limit_;
};
} // namespace caffe2