1*38fd1498Szrj // Explicit instantiation file. 2*38fd1498Szrj 3*38fd1498Szrj // Copyright (C) 2001-2018 Free Software Foundation, Inc. 4*38fd1498Szrj // 5*38fd1498Szrj // This file is part of the GNU ISO C++ Library. This library is free 6*38fd1498Szrj // software; you can redistribute it and/or modify it under the 7*38fd1498Szrj // terms of the GNU General Public License as published by the 8*38fd1498Szrj // Free Software Foundation; either version 3, or (at your option) 9*38fd1498Szrj // any later version. 10*38fd1498Szrj 11*38fd1498Szrj // This library is distributed in the hope that it will be useful, 12*38fd1498Szrj // but WITHOUT ANY WARRANTY; without even the implied warranty of 13*38fd1498Szrj // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14*38fd1498Szrj // GNU General Public License for more details. 15*38fd1498Szrj 16*38fd1498Szrj // Under Section 7 of GPL version 3, you are granted additional 17*38fd1498Szrj // permissions described in the GCC Runtime Library Exception, version 18*38fd1498Szrj // 3.1, as published by the Free Software Foundation. 19*38fd1498Szrj 20*38fd1498Szrj // You should have received a copy of the GNU General Public License and 21*38fd1498Szrj // a copy of the GCC Runtime Library Exception along with this program; 22*38fd1498Szrj // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 23*38fd1498Szrj // <http://www.gnu.org/licenses/>. 24*38fd1498Szrj 25*38fd1498Szrj // 26*38fd1498Szrj // ISO C++ 14882: 27*38fd1498Szrj // 28*38fd1498Szrj 29*38fd1498Szrj #include <valarray> 30*38fd1498Szrj 31*38fd1498Szrj namespace std _GLIBCXX_VISIBILITY(default) 32*38fd1498Szrj { 33*38fd1498Szrj _GLIBCXX_BEGIN_NAMESPACE_VERSION 34*38fd1498Szrj 35*38fd1498Szrj // Some explicit instantiations. 36*38fd1498Szrj template void 37*38fd1498Szrj __valarray_fill(size_t* __restrict__, size_t, const size_t&); 38*38fd1498Szrj 39*38fd1498Szrj template void 40*38fd1498Szrj __valarray_copy(const size_t* __restrict__, size_t, size_t* __restrict__); 41*38fd1498Szrj 42*38fd1498Szrj template valarray<size_t>::valarray(size_t); 43*38fd1498Szrj template valarray<size_t>::valarray(const valarray<size_t>&); 44*38fd1498Szrj template valarray<size_t>::~valarray(); 45*38fd1498Szrj template size_t valarray<size_t>::size() const; 46*38fd1498Szrj template size_t& valarray<size_t>::operator[](size_t); 47*38fd1498Szrj 48*38fd1498Szrj inline size_t __valarray_product(const valarray<size_t> & __a)49*38fd1498Szrj __valarray_product(const valarray<size_t>& __a) 50*38fd1498Szrj { 51*38fd1498Szrj const size_t __n = __a.size(); 52*38fd1498Szrj // XXX: This ugly cast is necessary because 53*38fd1498Szrj // valarray::operator[]() const return a VALUE! 54*38fd1498Szrj // Try to get the committee to correct that gross error. 55*38fd1498Szrj valarray<size_t>& __t = const_cast<valarray<size_t>&>(__a); 56*38fd1498Szrj return __valarray_product(&__t[0], &__t[0] + __n); 57*38fd1498Szrj } 58*38fd1498Szrj 59*38fd1498Szrj // Map a gslice, described by its multidimensional LENGTHS 60*38fd1498Szrj // and corresponding STRIDES, to a linear array of INDEXES 61*38fd1498Szrj // for the purpose of indexing a flat, one-dimensional array 62*38fd1498Szrj // representation of a gslice_array. 63*38fd1498Szrj void __gslice_to_index(size_t __o,const valarray<size_t> & __l,const valarray<size_t> & __s,valarray<size_t> & __i)64*38fd1498Szrj __gslice_to_index(size_t __o, const valarray<size_t>& __l, 65*38fd1498Szrj const valarray<size_t>& __s, valarray<size_t>& __i) 66*38fd1498Szrj { 67*38fd1498Szrj // There are as many dimensions as there are strides. 68*38fd1498Szrj const size_t __n = __l.size(); 69*38fd1498Szrj 70*38fd1498Szrj // Holds current multi-index as we go through the gslice for the 71*38fd1498Szrj // purpose of computing its linear-image. 72*38fd1498Szrj valarray<size_t> __t(__l); 73*38fd1498Szrj 74*38fd1498Szrj // Note that this should match the product of all numbers appearing 75*38fd1498Szrj // in __l which describes the multidimensional sizes of the 76*38fd1498Szrj // generalized slice. 77*38fd1498Szrj const size_t __z = __i.size(); 78*38fd1498Szrj 79*38fd1498Szrj for (size_t __j = 0; __j < __z; ++__j) 80*38fd1498Szrj { 81*38fd1498Szrj // Compute the linear-index image of (t_0, ... t_{n-1}). 82*38fd1498Szrj __i[__j] = __o; 83*38fd1498Szrj 84*38fd1498Szrj --__t[__n - 1]; 85*38fd1498Szrj __o += __s[__n - 1]; 86*38fd1498Szrj 87*38fd1498Szrj // Process the next multi-index. The loop ought to be 88*38fd1498Szrj // backward since we're making a lexicographical visit. 89*38fd1498Szrj for (size_t __k2 = __n - 1; __k2 && !__t[__k2]; --__k2) 90*38fd1498Szrj { 91*38fd1498Szrj __o -= __s[__k2] * __l[__k2]; 92*38fd1498Szrj __t[__k2] = __l[__k2]; 93*38fd1498Szrj 94*38fd1498Szrj --__t[__k2 - 1]; 95*38fd1498Szrj __o += __s[__k2 - 1]; 96*38fd1498Szrj } 97*38fd1498Szrj } 98*38fd1498Szrj } 99*38fd1498Szrj _Indexer(size_t __o,const valarray<size_t> & __l,const valarray<size_t> & __s)100*38fd1498Szrj gslice::_Indexer::_Indexer(size_t __o, const valarray<size_t>& __l, 101*38fd1498Szrj const valarray<size_t>& __s) 102*38fd1498Szrj : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s), 103*38fd1498Szrj _M_index(__l.size() == 0 ? 0 : __valarray_product(__l)) 104*38fd1498Szrj { __gslice_to_index(__o, __l, __s, _M_index); } 105*38fd1498Szrj 106*38fd1498Szrj _GLIBCXX_END_NAMESPACE_VERSION 107*38fd1498Szrj } // namespace 108