mirror of
https://github.com/open-mmlab/mmdeploy.git
synced 2025-01-14 08:09:43 +08:00
82 lines
2.0 KiB
C++
82 lines
2.0 KiB
C++
|
// Copyright (c) OpenMMLab. All rights reserved.
|
||
|
|
||
|
#include "operator.h"
|
||
|
|
||
|
namespace mmdeploy::graph {
|
||
|
|
||
|
Result<Value> DistribOA(const Value& oa) {
|
||
|
if (!oa.is_object()) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
Value ao = ValueType::kArray;
|
||
|
for (auto inner = oa.begin(); inner != oa.end(); ++inner) {
|
||
|
if (!inner->is_array()) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
if (ao.empty()) {
|
||
|
for (int i = 0; i < inner->size(); ++i) ao.push_back(ValueType::kObject);
|
||
|
}
|
||
|
if (inner->size() != oa.size()) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
for (int i = 0; i < inner->size(); ++i) {
|
||
|
ao[i][inner.key()] = (*inner)[i];
|
||
|
}
|
||
|
}
|
||
|
return ao;
|
||
|
}
|
||
|
|
||
|
Result<Value> DistribAO(const Value& ao) {
|
||
|
if (!ao.is_array()) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
Value oa = ValueType::kObject;
|
||
|
for (const auto& inner : ao) {
|
||
|
if (inner.is_object()) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
if (oa.empty()) {
|
||
|
for (auto item = inner.begin(); item != inner.end(); ++item) {
|
||
|
oa[item.key()] = ValueType::kObject;
|
||
|
}
|
||
|
}
|
||
|
if (inner.size() != oa.size()) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
for (auto item = inner.begin(); item != inner.end(); ++item) {
|
||
|
if (!oa.contains(item.key())) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
oa[item.key()].push_back(*item);
|
||
|
}
|
||
|
}
|
||
|
return oa;
|
||
|
}
|
||
|
|
||
|
Result<Value> DistribAA(const Value& a) {
|
||
|
if (!a.is_array()) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
auto ta = Value::Array{};
|
||
|
for (const auto& inner : a.get_ref<const Value::Array&>()) {
|
||
|
if (!inner.is_array()) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
if (ta.empty()) {
|
||
|
ta.reserve(inner.size());
|
||
|
for (int i = 0; i < inner.size(); ++i) {
|
||
|
ta.emplace_back(Value::kArray);
|
||
|
}
|
||
|
}
|
||
|
if (inner.size() != ta.size()) {
|
||
|
return Status(eInvalidArgument);
|
||
|
}
|
||
|
for (int i = 0; i < inner.size(); ++i) {
|
||
|
ta[i].push_back(inner[i]);
|
||
|
}
|
||
|
}
|
||
|
return ta;
|
||
|
}
|
||
|
|
||
|
} // namespace mmdeploy::graph
|