list_implementation_cpp/io.cpp at master · qqiwi92/list_implementation_cpp · 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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#include "io.hpp"
#include <cstdio>
#include <limits>
#include <stdexcept>
#include "list.hpp"

namespace levkin {

  IterList getIters(const Data& data)
  {
    IterList res;

    for (LCIter< Pair > it = data.cbegin(); it != data.cend(); ++it) {
      res.pushBack(it->second.cbegin());
    }
    return res;
  }

  In& readData(In& in, Data& data)
  {
    while (in) {
      String name;
      if (!(in >> name))
        break;

      Lst currentList;
      while (in.peek() == ' ' || in.peek() == '\t') {
        in.ignore();
      }
      while (in.peek() != '\n' && in.peek() != '\r' && in.peek() != EOF) {
        size_t digit = 0;
        if (in >> digit) {
          currentList.pushBack(digit);
        } else {
          in.clear();
          break;
        }
        while (in.peek() == ' ' || in.peek() == '\t') {
          in.ignore();
        }
      }
      Pair pair(name, currentList);
      data.pushBack(pair);

      if (in.peek() == '\n' || in.peek() == '\r') {
        in.ignore();
      }
    }
    return in;
  }
  Out& printNames(Out& out, const Data& data)
  {
    LCIter< Pair > pairIt = data.cbegin();
    for (; pairIt != data.cend(); ++pairIt) {
      if (pairIt != data.cbegin()) {
        out << " ";
      }
      out << pairIt->first;
    }
    out << '\n';

    return out;
  }

  Out& printTransposed(Out& out, const Data& data)
  {
    if (data.cbegin() == data.cend()) {
      return out;
    }
    IterList iters = getIters(data);
    List< size_t > sums;

    bool rollOneMoreTime = true;
    bool overflowed = false;

    while (rollOneMoreTime) {
      rollOneMoreTime = false;
      size_t rowSum = 0;
      bool firstInRow = true;

      IterIter iterIter = iters.begin();
      LCIter< Pair > dataIter = data.cbegin();

      for (; iterIter != iters.end(); ++iterIter, ++dataIter) {
        if (*iterIter != dataIter->second.cend()) {
          size_t val = **iterIter;

          if (!overflowed) {
            if (std::numeric_limits< size_t >::max() - rowSum < val) {
              overflowed = true;
            } else {
              rowSum += val;
            }
          }

          if (!firstInRow) {
            out << " ";
          }

          firstInRow = false;

          out << **iterIter;
          ++(*iterIter);

          rollOneMoreTime = true;
        }
      }
      if (rollOneMoreTime) {
        if (!overflowed) {
          sums.pushBack(rowSum);
        }
        out << "\n";
      }
    }

    if (overflowed) {
      throw std::overflow_error("can't fit sum in size_t. wierd");
    }

    if (sums.size() > 0) {
      LCIter< size_t > sumIt = sums.cbegin();
      out << *sumIt;
      ++sumIt;
      for (; sumIt != sums.cend(); ++sumIt) {
        out << " " << *sumIt;
      }
      out << "\n";
    } else {
      out << "0\n";
    }
    return out;
  }

}