Go to most recent revision | Details | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 5496 | leency | 1 | /* Copyright (C) 2004 Garrett A. Kajmowicz |
| 2 | |||
| 3 | This file is part of the uClibc++ Library. |
||
| 4 | |||
| 5 | This library is free software; you can redistribute it and/or |
||
| 6 | modify it under the terms of the GNU Lesser General Public |
||
| 7 | License as published by the Free Software Foundation; either |
||
| 8 | version 2.1 of the License, or (at your option) any later version. |
||
| 9 | |||
| 10 | This library is distributed in the hope that it will be useful, |
||
| 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
||
| 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
||
| 13 | Lesser General Public License for more details. |
||
| 14 | |||
| 15 | You should have received a copy of the GNU Lesser General Public |
||
| 16 | License along with this library; if not, write to the Free Software |
||
| 17 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
||
| 18 | */ |
||
| 19 | |||
| 20 | #include |
||
| 21 | |||
| 22 | #ifndef __HEADER_STD_VALARRAY |
||
| 23 | #define __HEADER_STD_VALARRAY 1 |
||
| 24 | |||
| 25 | #include |
||
| 26 | #include |
||
| 27 | |||
| 28 | #pragma GCC visibility push(default) |
||
| 29 | |||
| 30 | namespace std{ |
||
| 31 | |||
| 32 | template |
||
| 33 | class slice; |
||
| 34 | template |
||
| 35 | class gslice; |
||
| 36 | template |
||
| 37 | template |
||
| 38 | template |
||
| 39 | |||
| 40 | //Actual class definitions |
||
| 41 | |||
| 42 | |||
| 43 | class _UCXXEXPORT slice { |
||
| 44 | protected: |
||
| 45 | size_t sta; |
||
| 46 | size_t siz; |
||
| 47 | size_t str; |
||
| 48 | |||
| 49 | public: |
||
| 50 | slice() : sta(0), siz(0), str(0){ } |
||
| 51 | slice(size_t a, size_t b, size_t c) : sta(a), siz(b), str(c) { } |
||
| 52 | slice(const slice& s) : sta(s.sta), siz(s.siz), str(s.str) { } |
||
| 53 | ~slice() { } |
||
| 54 | size_t start() const{ |
||
| 55 | return sta; |
||
| 56 | } |
||
| 57 | size_t size() const{ |
||
| 58 | return siz; |
||
| 59 | } |
||
| 60 | size_t stride() const{ |
||
| 61 | return str; |
||
| 62 | } |
||
| 63 | }; |
||
| 64 | |||
| 65 | |||
| 66 | |||
| 67 | template |
||
| 68 | friend class slice_array |
||
| 69 | protected: |
||
| 70 | T * data; |
||
| 71 | size_t length; |
||
| 72 | |||
| 73 | public: |
||
| 74 | typedef T value_type; |
||
| 75 | |||
| 76 | valarray() : data(0), length(0) { } |
||
| 77 | |||
| 78 | explicit valarray(size_t t) : data(0), length(t){ |
||
| 79 | data = new T[length]; |
||
| 80 | } |
||
| 81 | |||
| 82 | valarray(const T& v, size_t t) : data(0), length(t){ |
||
| 83 | data = new T[length]; |
||
| 84 | for(size_t i = 0; i < length; ++i){ |
||
| 85 | data[i] = v; |
||
| 86 | } |
||
| 87 | } |
||
| 88 | valarray(const T* p, size_t t) : data(0), length(t) { |
||
| 89 | data = new T[length]; |
||
| 90 | for(size_t i = 0; i < length; ++i){ |
||
| 91 | data[i] = p[i]; |
||
| 92 | } |
||
| 93 | } |
||
| 94 | valarray(const valarray& v) : data(0), length(v.length){ |
||
| 95 | data = new T[length]; |
||
| 96 | for(size_t i = 0; i < length; ++i){ |
||
| 97 | data[i] = v.data[i]; |
||
| 98 | } |
||
| 99 | } |
||
| 100 | valarray(const slice_array |
||
| 101 | data = new T[length]; |
||
| 102 | for(unsigned int i = 0; i < length; ++i){ |
||
| 103 | data[i] = sa.array->data[sa.s.start() + i * sa.s.stride()]; |
||
| 104 | } |
||
| 105 | } |
||
| 106 | valarray(const gslice_array |
||
| 107 | valarray(const mask_array |
||
| 108 | valarray(const indirect_array |
||
| 109 | ~valarray(){ |
||
| 110 | delete [] data; |
||
| 111 | data = 0; |
||
| 112 | length = 0; |
||
| 113 | } |
||
| 114 | |||
| 115 | valarray |
||
| 116 | if (length != v.length) { // DR 630 |
||
| 117 | delete [] data; |
||
| 118 | length = v.length; |
||
| 119 | data = new T[length]; |
||
| 120 | } |
||
| 121 | for (size_t i = 0; i < length; ++i) { |
||
| 122 | data[i] = v.data[i]; |
||
| 123 | } |
||
| 124 | return *this; |
||
| 125 | } |
||
| 126 | valarray |
||
| 127 | for(size_t i = 0; i < length; ++i){ |
||
| 128 | data[i] = t; |
||
| 129 | } |
||
| 130 | return *this; |
||
| 131 | } |
||
| 132 | valarray |
||
| 133 | for(size_t i =0; i < length; ++i){ |
||
| 134 | data[i] = sa.data[sa.s.start() + i * sa.s.stride()]; |
||
| 135 | } |
||
| 136 | return *this; |
||
| 137 | } |
||
| 138 | valarray |
||
| 139 | valarray |
||
| 140 | valarray |
||
| 141 | |||
| 142 | const T& operator[](size_t t) const{ |
||
| 143 | return data[t]; |
||
| 144 | } |
||
| 145 | T& operator[](size_t t){ |
||
| 146 | return data[t]; |
||
| 147 | } |
||
| 148 | |||
| 149 | valarray |
||
| 150 | valarray |
||
| 151 | for(unsigned int i = 0; i< s.size(); ++i){ |
||
| 152 | retval.data[i] = data[s.start() + i * s.stride()]; |
||
| 153 | } |
||
| 154 | return retval; |
||
| 155 | } |
||
| 156 | |||
| 157 | slice_array |
||
| 158 | slice_array |
||
| 159 | retval.s = sl; |
||
| 160 | retval.array = this; |
||
| 161 | return retval; |
||
| 162 | } |
||
| 163 | |||
| 164 | valarray |
||
| 165 | gslice_array |
||
| 166 | valarray |
||
| 167 | mask_array |
||
| 168 | valarray |
||
| 169 | indirect_array |
||
| 170 | |||
| 171 | valarray |
||
| 172 | valarray |
||
| 173 | for(size_t i = 0; i< length ; ++i){ |
||
| 174 | retval.data[i] = +data[i]; |
||
| 175 | } |
||
| 176 | return retval; |
||
| 177 | } |
||
| 178 | valarray |
||
| 179 | valarray |
||
| 180 | for(size_t i = 0; i< length; ++i){ |
||
| 181 | retval.data[i] = -data[i]; |
||
| 182 | } |
||
| 183 | return retval; |
||
| 184 | } |
||
| 185 | valarray |
||
| 186 | valarray |
||
| 187 | for(size_t i = 0; i< length ; ++i){ |
||
| 188 | retval.data[i] = ~data[i]; |
||
| 189 | } |
||
| 190 | return retval; |
||
| 191 | } |
||
| 192 | valarray |
||
| 193 | valarray |
||
| 194 | for (size_t i = 0; i < length ; ++i){ |
||
| 195 | retval[i] = !data[i]; |
||
| 196 | } |
||
| 197 | return retval; |
||
| 198 | } |
||
| 199 | valarray |
||
| 200 | for(size_t i=0;i |
||
| 201 | data[i] *= t; |
||
| 202 | } |
||
| 203 | return *this; |
||
| 204 | } |
||
| 205 | valarray |
||
| 206 | for(size_t i=0;i |
||
| 207 | data[i] /= t; |
||
| 208 | } |
||
| 209 | return *this; |
||
| 210 | } |
||
| 211 | valarray |
||
| 212 | for(size_t i=0;i |
||
| 213 | data[i] %= t; |
||
| 214 | } |
||
| 215 | return *this; |
||
| 216 | } |
||
| 217 | valarray |
||
| 218 | for(size_t i=0;i |
||
| 219 | data[i] += t; |
||
| 220 | } |
||
| 221 | return *this; |
||
| 222 | } |
||
| 223 | valarray |
||
| 224 | for(size_t i=0;i |
||
| 225 | data[i] -= t; |
||
| 226 | } |
||
| 227 | return *this; |
||
| 228 | } |
||
| 229 | valarray |
||
| 230 | for(size_t i=0;i |
||
| 231 | data[i] ^= t; |
||
| 232 | } |
||
| 233 | return *this; |
||
| 234 | } |
||
| 235 | valarray |
||
| 236 | for(size_t i=0;i |
||
| 237 | data[i] &= t; |
||
| 238 | } |
||
| 239 | return *this; |
||
| 240 | } |
||
| 241 | valarray |
||
| 242 | for(size_t i=0;i |
||
| 243 | data[i] |= t; |
||
| 244 | } |
||
| 245 | return *this; |
||
| 246 | } |
||
| 247 | valarray |
||
| 248 | for(size_t i=0;i |
||
| 249 | data[i] <<= t; |
||
| 250 | } |
||
| 251 | return *this; |
||
| 252 | } |
||
| 253 | valarray |
||
| 254 | for(size_t i=0;i |
||
| 255 | data[i] >>= t; |
||
| 256 | } |
||
| 257 | return *this; |
||
| 258 | } |
||
| 259 | valarray |
||
| 260 | for(size_t i=0;i |
||
| 261 | data[i] *= a.data[i]; |
||
| 262 | } |
||
| 263 | return *this; |
||
| 264 | } |
||
| 265 | valarray |
||
| 266 | for(size_t i=0;i |
||
| 267 | data[i] /= a.data[i]; |
||
| 268 | } |
||
| 269 | return *this; |
||
| 270 | } |
||
| 271 | valarray |
||
| 272 | for(size_t i=0;i |
||
| 273 | data[i] %= a.data[i]; |
||
| 274 | } |
||
| 275 | return *this; |
||
| 276 | } |
||
| 277 | valarray |
||
| 278 | for(size_t i=0;i |
||
| 279 | data[i] += a.data[i]; |
||
| 280 | } |
||
| 281 | return *this; |
||
| 282 | } |
||
| 283 | valarray |
||
| 284 | for(size_t i=0;i |
||
| 285 | data[i] -= a.data[i]; |
||
| 286 | } |
||
| 287 | return *this; |
||
| 288 | } |
||
| 289 | valarray |
||
| 290 | for(size_t i=0;i |
||
| 291 | data[i] ^= a.data[i]; |
||
| 292 | } |
||
| 293 | return *this; |
||
| 294 | } |
||
| 295 | valarray |
||
| 296 | for(size_t i=0;i |
||
| 297 | data[i] |= a.data[i]; |
||
| 298 | } |
||
| 299 | return *this; |
||
| 300 | } |
||
| 301 | valarray |
||
| 302 | for(size_t i=0;i |
||
| 303 | data[i] &= a.data[i]; |
||
| 304 | } |
||
| 305 | return *this; |
||
| 306 | } |
||
| 307 | valarray |
||
| 308 | for(size_t i=0;i |
||
| 309 | data[i] <<= a.data[i]; |
||
| 310 | } |
||
| 311 | return *this; |
||
| 312 | } |
||
| 313 | valarray |
||
| 314 | for(size_t i=0;i |
||
| 315 | data[i] >>= a.data[i]; |
||
| 316 | } |
||
| 317 | return *this; |
||
| 318 | } |
||
| 319 | #if 0 |
||
| 320 | void swap(valarray& other) noexcept { |
||
| 321 | std::swap(length, other.length); |
||
| 322 | std::swap(data, other.data); |
||
| 323 | } |
||
| 324 | #endif |
||
| 325 | size_t size() const{ |
||
| 326 | return length; |
||
| 327 | } |
||
| 328 | |||
| 329 | T sum() const{ |
||
| 330 | T retval(data[0]); |
||
| 331 | for(size_t i = 1; i< length; ++i){ |
||
| 332 | retval += data[i]; |
||
| 333 | } |
||
| 334 | return retval; |
||
| 335 | } |
||
| 336 | |||
| 337 | T min() const{ |
||
| 338 | T retval(data[0]); |
||
| 339 | for(size_t i = 1; i< length; ++i){ |
||
| 340 | if(data[i] < retval){ |
||
| 341 | retval = data[i]; |
||
| 342 | } |
||
| 343 | } |
||
| 344 | return retval; |
||
| 345 | } |
||
| 346 | |||
| 347 | T max() const{ |
||
| 348 | T retval(data[0]); |
||
| 349 | for(size_t i = 1; i< length; ++i){ |
||
| 350 | if(retval < data[i]){ |
||
| 351 | retval = data[i]; |
||
| 352 | } |
||
| 353 | } |
||
| 354 | return retval; |
||
| 355 | } |
||
| 356 | |||
| 357 | valarray |
||
| 358 | valarray |
||
| 359 | if (n < 0) { |
||
| 360 | if (-size_t(n) > length) |
||
| 361 | n = -int(length); |
||
| 362 | } else { |
||
| 363 | if (size_t(n) > length) |
||
| 364 | n = int(length); |
||
| 365 | } |
||
| 366 | for (size_t i = 0; i < length ; ++i) { |
||
| 367 | if ((n + i) < length) |
||
| 368 | retval.data[i] = data[n + i]; |
||
| 369 | } |
||
| 370 | return retval; |
||
| 371 | } |
||
| 372 | valarray |
||
| 373 | valarray |
||
| 374 | if (length == 0) |
||
| 375 | return retval; |
||
| 376 | if (n < 0) { |
||
| 377 | if (-size_t(n) > length) |
||
| 378 | n = -int(-size_t(n) % length); |
||
| 379 | n = length + n; |
||
| 380 | } else { |
||
| 381 | if (size_t(n) > length) |
||
| 382 | n = int(size_t(n) % length); |
||
| 383 | } |
||
| 384 | for (size_t i = 0; i < length ; ++i){ |
||
| 385 | retval.data[i] = data[(n + i) % length]; |
||
| 386 | } |
||
| 387 | return retval; |
||
| 388 | } |
||
| 389 | valarray |
||
| 390 | valarray |
||
| 391 | for(size_t i = 0; i< length; ++i){ |
||
| 392 | retval.data[i] = func(data[i]); |
||
| 393 | } |
||
| 394 | return retval; |
||
| 395 | } |
||
| 396 | valarray |
||
| 397 | valarray |
||
| 398 | for(size_t i = 0; i< length; ++i){ |
||
| 399 | retval.data[i] = func(data[i]); |
||
| 400 | } |
||
| 401 | return retval; |
||
| 402 | } |
||
| 403 | void resize(size_t sz, T c = T()){ |
||
| 404 | delete [] data; |
||
| 405 | data = 0; |
||
| 406 | if(sz > 0){ |
||
| 407 | data = new T[sz]; |
||
| 408 | for(size_t i = 0; i < sz; ++i){ |
||
| 409 | data[i] = c; |
||
| 410 | } |
||
| 411 | } |
||
| 412 | length = sz; |
||
| 413 | } |
||
| 414 | }; |
||
| 415 | |||
| 416 | |||
| 417 | |||
| 418 | template |
||
| 419 | friend class valarray |
||
| 420 | public: |
||
| 421 | typedef T value_type; |
||
| 422 | |||
| 423 | void operator= (const valarray |
||
| 424 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 425 | array->data[s.start() + i * s.stride()] = v[i]; |
||
| 426 | } |
||
| 427 | } |
||
| 428 | void operator= (const T & v){ |
||
| 429 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 430 | array->data[s.start() + i * s.stride()] = v; |
||
| 431 | } |
||
| 432 | } |
||
| 433 | void fill(const T & v){ |
||
| 434 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 435 | array->data[s.start() + i * s.stride()] = v; |
||
| 436 | } |
||
| 437 | } |
||
| 438 | void operator*= (const valarray |
||
| 439 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 440 | array->data[s.start() + i * s.stride()] *= v[i]; |
||
| 441 | } |
||
| 442 | } |
||
| 443 | void operator/= (const valarray |
||
| 444 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 445 | array->data[s.start() + i * s.stride()] /= v[i]; |
||
| 446 | } |
||
| 447 | } |
||
| 448 | void operator%= (const valarray |
||
| 449 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 450 | array->data[s.start() + i * s.stride()] %= v[i]; |
||
| 451 | } |
||
| 452 | } |
||
| 453 | void operator+= (const valarray |
||
| 454 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 455 | array->data[s.start() + i * s.stride()] += v[i]; |
||
| 456 | } |
||
| 457 | } |
||
| 458 | void operator-= (const valarray |
||
| 459 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 460 | array->data[s.start() + i * s.stride()] -= v[i]; |
||
| 461 | } |
||
| 462 | } |
||
| 463 | void operator^= (const valarray |
||
| 464 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 465 | array->data[s.start() + i * s.stride()] ^= v[i]; |
||
| 466 | } |
||
| 467 | } |
||
| 468 | void operator&= (const valarray |
||
| 469 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 470 | array->data[s.start() + i * s.stride()] &= v[i]; |
||
| 471 | } |
||
| 472 | } |
||
| 473 | void operator|= (const valarray |
||
| 474 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 475 | array->data[s.start() + i * s.stride()] |= v[i]; |
||
| 476 | } |
||
| 477 | } |
||
| 478 | void operator<<=(const valarray |
||
| 479 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 480 | array->data[s.start() + i * s.stride()] <<= v[i]; |
||
| 481 | } |
||
| 482 | } |
||
| 483 | void operator>>=(const valarray |
||
| 484 | for(unsigned int i = 0; i < s.size(); ++i){ |
||
| 485 | array->data[s.start() + i * s.stride()] >>= v[i]; |
||
| 486 | } |
||
| 487 | } |
||
| 488 | ~slice_array(){ |
||
| 489 | array = 0; |
||
| 490 | } |
||
| 491 | |||
| 492 | private: |
||
| 493 | slice_array() : array(0){ } |
||
| 494 | |||
| 495 | public: |
||
| 496 | slice_array(const slice_array& sa) : array(sa.array), s(sa.s){ } |
||
| 497 | slice_array& operator=(const slice_array& sa){ |
||
| 498 | array = sa.array; |
||
| 499 | s = sa.s; |
||
| 500 | return *this; |
||
| 501 | } |
||
| 502 | |||
| 503 | private: |
||
| 504 | valarray |
||
| 505 | slice s; |
||
| 506 | }; |
||
| 507 | |||
| 508 | |||
| 509 | class _UCXXEXPORT gslice { |
||
| 510 | private: |
||
| 511 | size_t sta; |
||
| 512 | valarray |
||
| 513 | valarray |
||
| 514 | |||
| 515 | public: |
||
| 516 | gslice() : sta(0), siz(), str() { } // DR 543 |
||
| 517 | gslice(size_t s, const valarray |
||
| 518 | : sta(s), siz(l), str(d) { } |
||
| 519 | |||
| 520 | size_t start() const{ |
||
| 521 | return sta; |
||
| 522 | } |
||
| 523 | valarray |
||
| 524 | return siz; |
||
| 525 | } |
||
| 526 | valarray |
||
| 527 | return str; |
||
| 528 | } |
||
| 529 | }; |
||
| 530 | |||
| 531 | template |
||
| 532 | private: |
||
| 533 | friend class valarray |
||
| 534 | |||
| 535 | public: |
||
| 536 | ~gslice_array(); |
||
| 537 | |||
| 538 | void operator=(const valarray |
||
| 539 | void operator*=(const valarray |
||
| 540 | void operator/=(const valarray |
||
| 541 | void operator%=(const valarray |
||
| 542 | void operator+=(const valarray |
||
| 543 | void operator-=(const valarray |
||
| 544 | void operator^=(const valarray |
||
| 545 | void operator&=(const valarray |
||
| 546 | void operator|=(const valarray |
||
| 547 | void operator<<=(const valarray |
||
| 548 | void operator>>=(const valarray |
||
| 549 | |||
| 550 | void operator=(const T&); |
||
| 551 | |||
| 552 | private: |
||
| 553 | gslice_array(); |
||
| 554 | gslice_array(const gslice_array |
||
| 555 | gslice_array |
||
| 556 | }; |
||
| 557 | |||
| 558 | |||
| 559 | |||
| 560 | template |
||
| 561 | valarray |
||
| 562 | retval *= rhs; |
||
| 563 | return retval; |
||
| 564 | } |
||
| 565 | |||
| 566 | template |
||
| 567 | valarray |
||
| 568 | retval *= rhs; |
||
| 569 | return retval; |
||
| 570 | } |
||
| 571 | template |
||
| 572 | valarray |
||
| 573 | retval *= lhs; |
||
| 574 | return retval; |
||
| 575 | } |
||
| 576 | template |
||
| 577 | valarray |
||
| 578 | retval /= rhs; |
||
| 579 | return retval; |
||
| 580 | } |
||
| 581 | template |
||
| 582 | valarray |
||
| 583 | retval /= rhs; |
||
| 584 | return retval; |
||
| 585 | } |
||
| 586 | template |
||
| 587 | valarray |
||
| 588 | retval /= rhs; |
||
| 589 | return retval; |
||
| 590 | } |
||
| 591 | template |
||
| 592 | valarray |
||
| 593 | retval %= rhs; |
||
| 594 | return retval; |
||
| 595 | } |
||
| 596 | template |
||
| 597 | valarray |
||
| 598 | retval %= rhs; |
||
| 599 | return retval; |
||
| 600 | } |
||
| 601 | template |
||
| 602 | valarray |
||
| 603 | retval %= rhs; |
||
| 604 | return retval; |
||
| 605 | } |
||
| 606 | template |
||
| 607 | valarray |
||
| 608 | retval += rhs; |
||
| 609 | return retval; |
||
| 610 | } |
||
| 611 | template |
||
| 612 | valarray |
||
| 613 | retval += rhs; |
||
| 614 | return retval; |
||
| 615 | } |
||
| 616 | template |
||
| 617 | valarray |
||
| 618 | retval += rhs; |
||
| 619 | return retval; |
||
| 620 | } |
||
| 621 | template |
||
| 622 | valarray |
||
| 623 | retval -= rhs; |
||
| 624 | return retval; |
||
| 625 | } |
||
| 626 | template |
||
| 627 | valarray |
||
| 628 | retval -= rhs; |
||
| 629 | return retval; |
||
| 630 | } |
||
| 631 | template |
||
| 632 | valarray |
||
| 633 | retval -= rhs; |
||
| 634 | return retval; |
||
| 635 | } |
||
| 636 | template |
||
| 637 | valarray |
||
| 638 | retval ^= rhs; |
||
| 639 | return retval; |
||
| 640 | } |
||
| 641 | template |
||
| 642 | valarray |
||
| 643 | retval ^= rhs; |
||
| 644 | return retval; |
||
| 645 | } |
||
| 646 | template |
||
| 647 | valarray |
||
| 648 | retval ^= rhs; |
||
| 649 | return retval; |
||
| 650 | } |
||
| 651 | template |
||
| 652 | valarray |
||
| 653 | retval &= rhs; |
||
| 654 | return retval; |
||
| 655 | } |
||
| 656 | template |
||
| 657 | valarray |
||
| 658 | retval &= rhs; |
||
| 659 | return retval; |
||
| 660 | } |
||
| 661 | template |
||
| 662 | valarray |
||
| 663 | retval &= rhs; |
||
| 664 | return retval; |
||
| 665 | } |
||
| 666 | template |
||
| 667 | valarray |
||
| 668 | retval |= rhs; |
||
| 669 | return retval; |
||
| 670 | } |
||
| 671 | template |
||
| 672 | valarray |
||
| 673 | retval |= rhs; |
||
| 674 | return retval; |
||
| 675 | } |
||
| 676 | template |
||
| 677 | valarray |
||
| 678 | retval |= rhs; |
||
| 679 | return retval; |
||
| 680 | } |
||
| 681 | template |
||
| 682 | valarray |
||
| 683 | retval <<= rhs; |
||
| 684 | return retval; |
||
| 685 | } |
||
| 686 | template |
||
| 687 | valarray |
||
| 688 | retval <<= rhs; |
||
| 689 | return retval; |
||
| 690 | } |
||
| 691 | template |
||
| 692 | valarray |
||
| 693 | retval <<= rhs; |
||
| 694 | return retval; |
||
| 695 | } |
||
| 696 | template |
||
| 697 | valarray |
||
| 698 | retval >>= rhs; |
||
| 699 | return retval; |
||
| 700 | } |
||
| 701 | template |
||
| 702 | valarray |
||
| 703 | retval >>= rhs; |
||
| 704 | return retval; |
||
| 705 | } |
||
| 706 | template |
||
| 707 | valarray |
||
| 708 | retval >>= rhs; |
||
| 709 | return retval; |
||
| 710 | } |
||
| 711 | |||
| 712 | template |
||
| 713 | valarray |
||
| 714 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 715 | retval[i] = lhs[i] && rhs[i]; |
||
| 716 | } |
||
| 717 | return retval; |
||
| 718 | } |
||
| 719 | template |
||
| 720 | valarray |
||
| 721 | for(size_t i = 0; i |
||
| 722 | retval[i] = lhs[i] && rhs; |
||
| 723 | } |
||
| 724 | return retval; |
||
| 725 | } |
||
| 726 | template |
||
| 727 | valarray |
||
| 728 | for(size_t i = 0; i |
||
| 729 | retval[i] = lhs && rhs[i]; |
||
| 730 | } |
||
| 731 | return retval; |
||
| 732 | } |
||
| 733 | template |
||
| 734 | valarray |
||
| 735 | for(size_t i = 0; i |
||
| 736 | retval[i] = lhs[i] || rhs[i]; |
||
| 737 | } |
||
| 738 | return retval; |
||
| 739 | } |
||
| 740 | template |
||
| 741 | valarray |
||
| 742 | for(size_t i = 0; i |
||
| 743 | retval[i] = lhs[i] || rhs; |
||
| 744 | } |
||
| 745 | return retval; |
||
| 746 | } |
||
| 747 | template |
||
| 748 | valarray |
||
| 749 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 750 | retval[i] = lhs || rhs[i]; |
||
| 751 | } |
||
| 752 | return retval; |
||
| 753 | } |
||
| 754 | |||
| 755 | template |
||
| 756 | valarray |
||
| 757 | for(size_t i = 0; i |
||
| 758 | retval[i] = lhs[i] == rhs[i]; |
||
| 759 | } |
||
| 760 | return retval; |
||
| 761 | } |
||
| 762 | template |
||
| 763 | valarray |
||
| 764 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 765 | retval[i] = lhs[i] == rhs; |
||
| 766 | } |
||
| 767 | return retval; |
||
| 768 | } |
||
| 769 | template |
||
| 770 | valarray |
||
| 771 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 772 | retval[i] = lhs == rhs[i]; |
||
| 773 | } |
||
| 774 | return retval; |
||
| 775 | } |
||
| 776 | template |
||
| 777 | valarray |
||
| 778 | for(size_t i = 0; i |
||
| 779 | retval[i] = lhs[i] != rhs[i]; |
||
| 780 | } |
||
| 781 | return retval; |
||
| 782 | } |
||
| 783 | template |
||
| 784 | valarray |
||
| 785 | for(size_t i = 0; i |
||
| 786 | retval[i] = lhs[i] != rhs; |
||
| 787 | } |
||
| 788 | return retval; |
||
| 789 | } |
||
| 790 | template |
||
| 791 | valarray |
||
| 792 | for(size_t i = 0; i |
||
| 793 | retval[i] = lhs != rhs[i]; |
||
| 794 | } |
||
| 795 | return retval; |
||
| 796 | } |
||
| 797 | template |
||
| 798 | valarray |
||
| 799 | for(size_t i = 0; i |
||
| 800 | retval[i] = lhs[i] < rhs[i]; |
||
| 801 | } |
||
| 802 | return retval; |
||
| 803 | } |
||
| 804 | template |
||
| 805 | valarray |
||
| 806 | for(size_t i = 0; i |
||
| 807 | retval[i] = lhs[i] < rhs; |
||
| 808 | } |
||
| 809 | return retval; |
||
| 810 | } |
||
| 811 | template |
||
| 812 | valarray |
||
| 813 | for(size_t i = 0; i |
||
| 814 | retval[i] = lhs < rhs[i]; |
||
| 815 | } |
||
| 816 | return retval; |
||
| 817 | } |
||
| 818 | template |
||
| 819 | valarray |
||
| 820 | for(size_t i = 0; i |
||
| 821 | retval[i] = lhs[i] > rhs[i]; |
||
| 822 | } |
||
| 823 | return retval; |
||
| 824 | } |
||
| 825 | template |
||
| 826 | valarray |
||
| 827 | for(size_t i = 0; i |
||
| 828 | retval[i] = lhs[i] > rhs; |
||
| 829 | } |
||
| 830 | return retval; |
||
| 831 | } |
||
| 832 | template |
||
| 833 | valarray |
||
| 834 | for(size_t i = 0; i |
||
| 835 | retval[i] = lhs > rhs[i]; |
||
| 836 | } |
||
| 837 | return retval; |
||
| 838 | } |
||
| 839 | template |
||
| 840 | valarray |
||
| 841 | for(size_t i = 0; i |
||
| 842 | retval[i] = lhs[i] <= rhs[i]; |
||
| 843 | } |
||
| 844 | return retval; |
||
| 845 | } |
||
| 846 | template |
||
| 847 | valarray |
||
| 848 | for(size_t i = 0; i |
||
| 849 | retval[i] = lhs[i] <= rhs; |
||
| 850 | } |
||
| 851 | return retval; |
||
| 852 | } |
||
| 853 | template |
||
| 854 | valarray |
||
| 855 | for(size_t i = 0; i |
||
| 856 | retval[i] = lhs <= rhs[i]; |
||
| 857 | } |
||
| 858 | return retval; |
||
| 859 | } |
||
| 860 | template |
||
| 861 | valarray |
||
| 862 | for(size_t i = 0; i |
||
| 863 | retval[i] = lhs[i] >= rhs[i]; |
||
| 864 | } |
||
| 865 | return retval; |
||
| 866 | } |
||
| 867 | template |
||
| 868 | valarray |
||
| 869 | for(size_t i = 0; i |
||
| 870 | retval[i] = lhs[i] >= rhs; |
||
| 871 | } |
||
| 872 | return retval; |
||
| 873 | } |
||
| 874 | template |
||
| 875 | valarray |
||
| 876 | for(size_t i = 0; i |
||
| 877 | retval[i] = lhs >= rhs[i]; |
||
| 878 | } |
||
| 879 | return retval; |
||
| 880 | } |
||
| 881 | template |
||
| 882 | T retval(x[0]); |
||
| 883 | for(size_t i = 1; i < x.size(); ++i){ |
||
| 884 | if(x[i] < retval){ |
||
| 885 | retval = x[i]; |
||
| 886 | } |
||
| 887 | } |
||
| 888 | } |
||
| 889 | template |
||
| 890 | T retval(x[0]); |
||
| 891 | for(size_t i = 1; i < x.size(); ++i){ |
||
| 892 | if(x[i] > retval){ |
||
| 893 | retval = x[i]; |
||
| 894 | } |
||
| 895 | } |
||
| 896 | } |
||
| 897 | |||
| 898 | template |
||
| 899 | valarray |
||
| 900 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 901 | retval[i] = abs(x[i]); |
||
| 902 | } |
||
| 903 | return retval; |
||
| 904 | } |
||
| 905 | template |
||
| 906 | valarray |
||
| 907 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 908 | retval[i] = acos(x[i]); |
||
| 909 | } |
||
| 910 | return retval; |
||
| 911 | } |
||
| 912 | template |
||
| 913 | valarray |
||
| 914 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 915 | retval[i] = asin(x[i]); |
||
| 916 | } |
||
| 917 | return retval; |
||
| 918 | } |
||
| 919 | template |
||
| 920 | valarray |
||
| 921 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 922 | retval[i] = atan(x[i]); |
||
| 923 | } |
||
| 924 | return retval; |
||
| 925 | } |
||
| 926 | template |
||
| 927 | valarray |
||
| 928 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 929 | retval[i] = atan2(y[i], x[i]); |
||
| 930 | } |
||
| 931 | return retval; |
||
| 932 | } |
||
| 933 | template |
||
| 934 | valarray |
||
| 935 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 936 | retval[i] = atan2(y[i], x); |
||
| 937 | } |
||
| 938 | return retval; |
||
| 939 | } |
||
| 940 | template |
||
| 941 | valarray |
||
| 942 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 943 | retval[i] = atan2(y, x[i]); |
||
| 944 | } |
||
| 945 | return retval; |
||
| 946 | } |
||
| 947 | template |
||
| 948 | valarray |
||
| 949 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 950 | retval[i] = cos(x[i]); |
||
| 951 | } |
||
| 952 | return retval; |
||
| 953 | } |
||
| 954 | template |
||
| 955 | valarray |
||
| 956 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 957 | retval[i] = cosh(x[i]); |
||
| 958 | } |
||
| 959 | return retval; |
||
| 960 | } |
||
| 961 | template |
||
| 962 | valarray |
||
| 963 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 964 | retval[i] = exp(x[i]); |
||
| 965 | } |
||
| 966 | return retval; |
||
| 967 | } |
||
| 968 | template |
||
| 969 | valarray |
||
| 970 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 971 | retval[i] = log(x[i]); |
||
| 972 | } |
||
| 973 | return retval; |
||
| 974 | } |
||
| 975 | template |
||
| 976 | valarray |
||
| 977 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 978 | retval[i] = log10(x[i]); |
||
| 979 | } |
||
| 980 | return retval; |
||
| 981 | } |
||
| 982 | template |
||
| 983 | valarray |
||
| 984 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 985 | retval[i] = pow(x[i], y[i]); |
||
| 986 | } |
||
| 987 | return retval; |
||
| 988 | } |
||
| 989 | template |
||
| 990 | valarray |
||
| 991 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 992 | retval[i] = pow(x[i], y); |
||
| 993 | } |
||
| 994 | return retval; |
||
| 995 | } |
||
| 996 | template |
||
| 997 | valarray |
||
| 998 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 999 | retval[i] = pow(x, y[i]); |
||
| 1000 | } |
||
| 1001 | return retval; |
||
| 1002 | } |
||
| 1003 | template |
||
| 1004 | valarray |
||
| 1005 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 1006 | retval[i] = sin(x[i]); |
||
| 1007 | } |
||
| 1008 | return retval; |
||
| 1009 | } |
||
| 1010 | template |
||
| 1011 | valarray |
||
| 1012 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 1013 | retval[i] = sinh(x[i]); |
||
| 1014 | } |
||
| 1015 | return retval; |
||
| 1016 | } |
||
| 1017 | template |
||
| 1018 | valarray |
||
| 1019 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 1020 | retval[i] = sqrt(x[i]); |
||
| 1021 | } |
||
| 1022 | return retval; |
||
| 1023 | } |
||
| 1024 | template |
||
| 1025 | valarray |
||
| 1026 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 1027 | retval[i] = tan(x[i]); |
||
| 1028 | } |
||
| 1029 | return retval; |
||
| 1030 | } |
||
| 1031 | template |
||
| 1032 | valarray |
||
| 1033 | for(size_t i = 0; i < retval.size(); ++i){ |
||
| 1034 | retval[i] = tanh(x[i]); |
||
| 1035 | } |
||
| 1036 | return retval; |
||
| 1037 | } |
||
| 1038 | } |
||
| 1039 | |||
| 1040 | #pragma GCC visibility pop |
||
| 1041 | |||
| 1042 | #endif |