forked from zhongkaifu/TensorSharp
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTensorDimIterState.cs
More file actions
95 lines (79 loc) · 1.91 KB
/
TensorDimIterState.cs
File metadata and controls
95 lines (79 loc) · 1.91 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
// Copyright (c) Zhongkai Fu. All rights reserved.
// https://github.com/zhongkaifu/TensorSharp
//
// This file is part of TensorSharp.
//
// TensorSharp is licensed under the BSD-3-Clause license found in the LICENSE file in the root directory of this source tree.
//
// TensorSharp is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the BSD-3-Clause License for more details.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace TensorSharp
{
public class TensorDimIterState
{
long[] sizes;
long[] strides;
int dimensionCount;
int iterationDim;
long[] counter;
public long stride, size;
unsafe public float* data;
unsafe public TensorDimIterState(float* buffer, int dimCount, long[] sizes, long[] strides, int iterationDim)
{
this.sizes = sizes;
this.strides = strides;
this.iterationDim = iterationDim;
this.dimensionCount = dimCount;
data = buffer;
this.size = sizes[iterationDim];
this.stride = strides[iterationDim];
counter = new long[dimCount];
for (int i = 0; i < dimCount; ++i)
counter[i] = 0;
}
// Returns true if there is another block to iterate over,
// returns false if we are at end of iteration
unsafe public bool NextBlock()
{
if (dimensionCount == 1)
{
return false;
}
for (int i = 0; i < dimensionCount; ++i)
{
if (i == iterationDim)
{
if (i == dimensionCount - 1)
{
return false;
}
continue;
}
counter[i]++;
data += strides[i];
if (counter[i] == sizes[i])
{
if (i == dimensionCount - 1)
{
return false;
}
else
{
data -= counter[i] * strides[i];
counter[i] = 0;
}
}
else
{
break;
}
}
return true;
}
}
}