mirror of
https://github.com/saymrwulf/pytorch.git
synced 2026-05-15 21:00:47 +00:00
27c7158166
Summary: There is a module called `2to3` which you can target for future specifically to remove these, the directory of `caffe2` has the most redundant imports: ```2to3 -f future -w caffe2``` Pull Request resolved: https://github.com/pytorch/pytorch/pull/45033 Reviewed By: seemethere Differential Revision: D23808648 Pulled By: bugra fbshipit-source-id: 38971900f0fe43ab44a9168e57f2307580d36a38
51 lines
1.7 KiB
Python
51 lines
1.7 KiB
Python
|
|
|
|
|
|
|
|
|
|
from caffe2.python import core, workspace
|
|
from caffe2.python.test_util import TestCase
|
|
import numpy as np
|
|
|
|
|
|
class TestCounterOps(TestCase):
|
|
|
|
def test_stats_ops(self):
|
|
# The global StatRegistry isn't reset when the workspace is reset,
|
|
# so there may be existing stats from a previous test
|
|
workspace.RunOperatorOnce(core.CreateOperator(
|
|
'StatRegistryExport', [], ['prev_k', 'prev_v', 'prev_ts']))
|
|
previous_keys = workspace.FetchBlob('prev_k')
|
|
existing = len(previous_keys)
|
|
|
|
prefix = '/'.join([__name__, 'TestCounterOps', 'test_stats_ops'])
|
|
keys = [
|
|
(prefix + '/key1').encode('ascii'),
|
|
(prefix + '/key2').encode('ascii')
|
|
]
|
|
values = [34, 45]
|
|
workspace.FeedBlob('k', np.array(keys, dtype=str))
|
|
workspace.FeedBlob('v', np.array(values, dtype=np.int64))
|
|
for _ in range(2):
|
|
workspace.RunOperatorOnce(core.CreateOperator(
|
|
'StatRegistryUpdate', ['k', 'v'], []))
|
|
workspace.RunOperatorOnce(core.CreateOperator(
|
|
'StatRegistryExport', [], ['k2', 'v2', 't2']))
|
|
|
|
workspace.RunOperatorOnce(core.CreateOperator(
|
|
'StatRegistryCreate', [], ['reg']))
|
|
workspace.RunOperatorOnce(core.CreateOperator(
|
|
'StatRegistryUpdate', ['k2', 'v2', 'reg'], []))
|
|
|
|
workspace.RunOperatorOnce(core.CreateOperator(
|
|
'StatRegistryExport', ['reg'], ['k3', 'v3', 't3']))
|
|
|
|
k3 = workspace.FetchBlob('k3')
|
|
v3 = workspace.FetchBlob('v3')
|
|
t3 = workspace.FetchBlob('t3')
|
|
|
|
self.assertEqual(len(k3) - existing, 2)
|
|
self.assertEqual(len(v3), len(k3))
|
|
self.assertEqual(len(t3), len(k3))
|
|
for key in keys:
|
|
self.assertIn(key, k3)
|