CK
Size: a a a
CK
CK
template <typename T>
void row<T>::backward(int iOffset)
{
for (int i = 0; i < iOffset; ++i)
{
T temp = this -> arr[0];
for (int j = 1; j < this -> iLen; ++j)
this -> arr[j - 1] = this -> arr[j];
this -> arr[this -> iLen - 1] = temp;
}
}
template <typename T>
void row<T>::backward()
{
this -> backward(1);
}
CK
ip
CK
ip
CK
Q
IZ
template <typename T>
void row<T>::backward(int iOffset)
{
for (int i = 0; i < iOffset; ++i)
{
T temp = this -> arr[0];
for (int j = 1; j < this -> iLen; ++j)
this -> arr[j - 1] = this -> arr[j];
this -> arr[this -> iLen - 1] = temp;
}
}
template <typename T>
void row<T>::backward()
{
this -> backward(1);
}
Q
Q
CK
ip
std::rotate
чем не угодил ?IZ
template <typename T>
void row<T>::backward(int iOffset)
{
for (int i = 0; i < iOffset; ++i)
{
T temp = this -> arr[0];
for (int j = 1; j < this -> iLen; ++j)
this -> arr[j - 1] = this -> arr[j];
this -> arr[this -> iLen - 1] = temp;
}
}
template <typename T>
void row<T>::backward()
{
this -> backward(1);
}
CK
std::rotate
чем не угодил ?CK
Q
IZ
IZ
template <typename T>
void row<T>::backward(int iOffset)
{
for (int i = 0; i < iOffset; ++i)
{
T temp = this -> arr[0];
for (int j = 1; j < this -> iLen; ++j)
this -> arr[j - 1] = this -> arr[j];
this -> arr[this -> iLen - 1] = temp;
}
}
template <typename T>
void row<T>::backward()
{
this -> backward(1);
}
IZ