J/Dimensions.cpp at master · troels/J · GitHub

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
96
97
98
99
100
101
102
103
104
105
106
#include "Dimensions.hpp"

namespace J {
Dimensions::Dimensions(int rank, ...): dims(new vector<int>(rank)),
				       begin_iter(dims->begin()), end_iter(dims->end()),
				       rank(rank) {
  va_list va;
  va_start(va, rank);

  for (iter i = begin(); i != end(); ++i) {
    *i = va_arg(va, int);
  }

  va_end(va);
}

Dimensions::Dimensions(): dims(), begin_iter(0),
			  end_iter(0), rank(0) {}

Dimensions::Dimensions(shared_ptr<vector<int> > dims): dims(dims), begin_iter(dims->begin()),
						       end_iter(dims->end()), rank(dims->size()) {}

Dimensions::Dimensions(shared_ptr<vector<int> > dims, iter begin, iter end): dims(dims), begin_iter(begin),
									     end_iter(end),
									     rank(distance(begin_iter, end_iter)) {}

bool Dimensions::operator==(const Dimensions& d) const {
  return d.get_rank() == get_rank() && equal(begin(), end(), d.begin());
}


int Dimensions::operator[](int n) const {
  if (n >= 0) {
    assert(n < get_rank());
    return *(begin() + n);
  } else {
    assert(-n <= get_rank());
    return *(begin() + (get_rank() + n));
  }
}

Dimensions Dimensions::suffix(int n) const {
  if (n >= get_rank()) return *this;
  if (-n >= get_rank()) return Dimensions();

  const iter start = begin() + (n >= 0 ? (get_rank() - n) : -n);
  return Dimensions(dims, start, end());
}

Dimensions Dimensions::prefix(int n) const {
  if (n >= get_rank()) return *this;
  if (-n >= get_rank()) return Dimensions();

  const iter stop = end() - (n >= 0 ? (get_rank() - n) : -n);
  return Dimensions(dims, begin(), stop);
}

bool Dimensions::prefix_match(const Dimensions &d) const {
  return d.get_rank() <= get_rank() && equal(d.begin(), d.end(), begin());
}

bool Dimensions::suffix_match(const Dimensions &d) const {
  return d.get_rank() <= get_rank() && equal(d.begin(), d.end(), begin() + (get_rank() - d.get_rank()));
}

int Dimensions::number_of_elems() const {
  return std::accumulate(begin(), end(), 1, std::multiplies<int>());
}


string Dimensions::to_string() const {
  std::stringstream ss;
  ss << "J::Dimensions[ ";
  for (iter p = begin(); p != end(); ++p) {
    ss << (*p) << " ";
  }
  ss << "]";
  return ss.str();
}


Dimensions Dimensions::operator+(const Dimensions &d) const {
  shared_ptr<vector<int> > v(new vector<int>(d.get_rank() + get_rank()));

  vector<int>::iterator output = v->begin();
  iter ptr = begin();

  while (ptr != end()) {
    *output = *ptr;
    ++output;
    ++ptr;
  }
  ptr = d.begin();
  while (ptr != d.end()) {
    *output = *ptr;
    ++output;
    ++ptr;
  }

  return Dimensions(v);
}

std::ostream& operator<<(std::ostream& os, const Dimensions& d) {
  return (os << d.to_string());
}
}