Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Basic implementation of CPUHashMap #375

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 8 commits into from
Jan 7, 2025
Merged

Basic implementation of CPUHashMap #375

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
dd3c040
update
rusty1s Jan 6, 2025
40d10cf
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Jan 6, 2025
e52ffcf
update
rusty1s Jan 6, 2025
7801999
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Jan 6, 2025
150371a
update
rusty1s Jan 6, 2025
ec4402d
update
rusty1s Jan 6, 2025
6a7f744
update
rusty1s Jan 7, 2025
1e5c4e1
Merge branch 'master' into custom_class2
rusty1s Jan 7, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 29 additions & 2 deletions pyg_lib/csrc/classes/cpu/hash_map.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,12 +5,39 @@
namespace pyg {
namespace classes {

template <typename T>
struct CPUHashMap : torch::CustomClassHolder {
CPUHashMap() {};
std::unordered_map<T, int64_t> map;

CPUHashMap(const at::Tensor& key) {
// TODO Assert 1-dim
const auto key_data = key.data_ptr<T>();
for (int64_t i = 0; i < key.numel(); ++i) {
// TODO Check that key does not yet exist.
map[key_data[i]] = i;
}
};

at::Tensor get(const at::Tensor& query) {
// TODO Assert 1-dim
const auto options = at::TensorOptions().dtype(at::kLong);
auto out = at::empty({query.numel()}, options);

const auto query_data = query.data_ptr<T>();
auto out_data = out.data_ptr<int64_t>();

for (size_t i = 0; i < query.numel(); ++i) {
// TODO Insert -1 if key does not exist.
out_data[i] = map[query_data[i]];
}
return out;
}
};

TORCH_LIBRARY(pyg, m) {
m.class_<CPUHashMap>("CPUHashMap").def(torch::init());
m.class_<CPUHashMap<int64_t>>("CPULongHashMap")
.def(torch::init<at::Tensor&>())
.def("get", &CPUHashMap<int64_t>::get);
}

} // namespace classes
Expand Down
10 changes: 9 additions & 1 deletion test/csrc/classes/test_hash_map.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,15 @@
#include <ATen/ATen.h>
#include <gtest/gtest.h>

#include "pyg_lib/csrc/classes/cpu/hash_map.h"

TEST(CPUHashMapTest, BasicAssertions) {
auto map = pyg::classes::CPUHashMap();
auto options = at::TensorOptions().dtype(at::kLong);
auto key = at::tensor({0, 10, 30, 20}, options);

auto map = pyg::classes::CPUHashMap<int64_t>(key);

auto query = at::tensor({30, 10, 20}, options);
auto expected = at::tensor({2, 1, 3}, options);
EXPECT_TRUE(at::equal(map.get(query), expected));
}
Loading