/usr/include/xtensor/xassign.hpp is in xtensor-dev 0.10.11-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 | /***************************************************************************
* Copyright (c) 2016, Johan Mabille, Sylvain Corlay and Wolf Vollprecht *
* *
* Distributed under the terms of the BSD 3-Clause License. *
* *
* The full license is in the file LICENSE, distributed with this software. *
****************************************************************************/
#ifndef XASSIGN_HPP
#define XASSIGN_HPP
#include "xiterator.hpp"
#include "xtensor_forward.hpp"
#include <algorithm>
namespace xt
{
template <class E>
class xexpression;
/********************
* Assign functions *
********************/
template <class E1, class E2>
void assign_data(xexpression<E1>& e1, const xexpression<E2>& e2, bool trivial);
template <class E1, class E2>
bool reshape(xexpression<E1>& e1, const xexpression<E2>& e2);
template <class E1, class E2>
void assign_xexpression(xexpression<E1>& e1, const xexpression<E2>& e2);
template <class E1, class E2>
void computed_assign(xexpression<E1>& e1, const xexpression<E2>& e2);
template <class E1, class E2, class F>
void scalar_computed_assign(xexpression<E1>& e1, const E2& e2, F&& f);
template <class E1, class E2>
void assert_compatible_shape(const xexpression<E1>& e1, const xexpression<E2>& e2);
/*****************
* data_assigner *
*****************/
template <class E1, class E2, layout_type L>
class data_assigner
{
public:
using lhs_iterator = typename E1::stepper;
using rhs_iterator = typename E2::const_stepper;
using shape_type = typename E1::shape_type;
using index_type = xindex_type_t<shape_type>;
using size_type = typename lhs_iterator::size_type;
data_assigner(E1& e1, const E2& e2);
void run();
void step(size_type i);
void reset(size_type i);
void to_end(layout_type);
private:
E1& m_e1;
lhs_iterator m_lhs;
rhs_iterator m_rhs;
rhs_iterator m_rhs_end;
index_type m_index;
};
/********************
* trivial_assigner *
********************/
template <bool index_assign>
struct trivial_assigner
{
template <class E1, class E2>
static void run(E1& e1, const E2& e2);
};
/***********************************
* Assign functions implementation *
***********************************/
namespace detail
{
template <class E1, class E2>
inline bool is_trivial_broadcast(const E1& e1, const E2& e2)
{
return e2.is_trivial_broadcast(e1.strides());
}
template <class D, class E2, class... SL>
inline bool is_trivial_broadcast(const xview<D, SL...>&, const E2&)
{
return false;
}
}
template <class E1, class E2>
inline void assign_data(xexpression<E1>& e1, const xexpression<E2>& e2, bool trivial)
{
E1& de1 = e1.derived_cast();
const E2& de2 = e2.derived_cast();
bool trivial_broadcast = trivial && detail::is_trivial_broadcast(de1, de2);
if (trivial_broadcast)
{
constexpr bool contiguous_layout = E1::contiguous_layout && E2::contiguous_layout;
trivial_assigner<contiguous_layout>::run(de1, de2);
}
else
{
data_assigner<E1, E2, default_assignable_layout(E1::static_layout)> assigner(de1, de2);
assigner.run();
}
}
template <class E1, class E2>
inline bool reshape(xexpression<E1>& e1, const xexpression<E2>& e2)
{
using shape_type = typename E1::shape_type;
using size_type = typename E1::size_type;
const E2& de2 = e2.derived_cast();
size_type size = de2.dimension();
shape_type shape = make_sequence<shape_type>(size, size_type(1));
bool trivial_broadcast = de2.broadcast_shape(shape);
e1.derived_cast().reshape(shape);
return trivial_broadcast;
}
template <class E1, class E2>
inline void assign_xexpression(xexpression<E1>& e1, const xexpression<E2>& e2)
{
bool trivial_broadcast = reshape(e1, e2);
assign_data(e1, e2, trivial_broadcast);
}
template <class E1, class E2>
inline void computed_assign(xexpression<E1>& e1, const xexpression<E2>& e2)
{
using shape_type = typename E1::shape_type;
using size_type = typename E1::size_type;
E1& de1 = e1.derived_cast();
const E2& de2 = e2.derived_cast();
size_type dim = de2.dimension();
shape_type shape = make_sequence<shape_type>(dim, size_type(1));
bool trivial_broadcast = de2.broadcast_shape(shape);
if (dim > de1.dimension() || shape > de1.shape())
{
typename E1::temporary_type tmp(shape);
assign_data(tmp, e2, trivial_broadcast);
de1.assign_temporary(std::move(tmp));
}
else
{
assign_data(e1, e2, trivial_broadcast);
}
}
template <class E1, class E2, class F>
inline void scalar_computed_assign(xexpression<E1>& e1, const E2& e2, F&& f)
{
E1& d = e1.derived_cast();
std::transform(d.cbegin(), d.cend(), d.begin(),
[e2, &f](const auto& v) { return f(v, e2); });
}
template <class E1, class E2>
inline void assert_compatible_shape(const xexpression<E1>& e1, const xexpression<E2>& e2)
{
using shape_type = typename E1::shape_type;
using size_type = typename E1::size_type;
const E1& de1 = e1.derived_cast();
const E2& de2 = e2.derived_cast();
size_type size = de2.dimension();
shape_type shape = make_sequence<shape_type>(size, size_type(1));
de2.broadcast_shape(shape);
if (shape.size() > de1.shape().size() || shape > de1.shape())
{
throw broadcast_error(shape, de1.shape());
}
}
/********************************
* data_assigner implementation *
********************************/
template <class E1, class E2, layout_type L>
inline data_assigner<E1, E2, L>::data_assigner(E1& e1, const E2& e2)
: m_e1(e1), m_lhs(e1.stepper_begin(e1.shape())),
m_rhs(e2.stepper_begin(e1.shape())), m_rhs_end(e2.stepper_end(e1.shape(), L)),
m_index(make_sequence<index_type>(e1.shape().size(), size_type(0)))
{
}
template <class E1, class E2, layout_type L>
inline void data_assigner<E1, E2, L>::run()
{
while (m_rhs != m_rhs_end)
{
*m_lhs = *m_rhs;
stepper_tools<L>::increment_stepper(*this, m_index, m_e1.shape());
}
}
template <class E1, class E2, layout_type L>
inline void data_assigner<E1, E2, L>::step(size_type i)
{
m_lhs.step(i);
m_rhs.step(i);
}
template <class E1, class E2, layout_type L>
inline void data_assigner<E1, E2, L>::reset(size_type i)
{
m_lhs.reset(i);
m_rhs.reset(i);
}
template <class E1, class E2, layout_type L>
inline void data_assigner<E1, E2, L>::to_end(layout_type l)
{
m_lhs.to_end(l);
m_rhs.to_end(l);
}
/***********************************
* trivial_assigner implementation *
***********************************/
template <bool index_assign>
template <class E1, class E2>
inline void trivial_assigner<index_assign>::run(E1& e1, const E2& e2)
{
using size_type = typename E1::size_type;
size_type size = e1.size();
for (size_type i = 0; i < size; ++i)
{
e1.data_element(i) = e2.data_element(i);
}
}
template <>
template <class E1, class E2>
inline void trivial_assigner<false>::run(E1& e1, const E2& e2)
{
std::copy(e2.cbegin(), e2.cend(), e1.begin());
}
}
#endif
|