blob: e4c9ed024620c47e25be67a96518947c51126146 [file] [log] [blame]
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00001//===------------------------ valarray.cpp --------------------------------===//
2//
Howard Hinnantf5256e12010-05-11 21:36:01 +00003// The LLVM Compiler Infrastructure
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00004//
Howard Hinnantb64f8b02010-11-16 22:09:02 +00005// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. See LICENSE.TXT for details.
Howard Hinnantbc8d3f92010-05-11 19:42:16 +00007//
8//===----------------------------------------------------------------------===//
9
Howard Hinnant04a2c712013-08-29 20:56:53 +000010#define _LIBCPP_EXTERN_TEMPLATE(...) extern template __VA_ARGS__;
11
Howard Hinnantbc8d3f92010-05-11 19:42:16 +000012#include "valarray"
13
14_LIBCPP_BEGIN_NAMESPACE_STD
15
16template valarray<size_t>::valarray(size_t);
17template valarray<size_t>::~valarray();
18template void valarray<size_t>::resize(size_t, size_t);
19
20void
21gslice::__init(size_t __start)
22{
23 valarray<size_t> __indices(__size_.size());
24 size_t __k = __size_.size() != 0;
25 for (size_t __i = 0; __i < __size_.size(); ++__i)
26 __k *= __size_[__i];
27 __1d_.resize(__k);
28 if (__1d_.size())
29 {
30 __k = 0;
31 __1d_[__k] = __start;
32 while (true)
33 {
34 size_t __i = __indices.size() - 1;
35 while (true)
36 {
37 if (++__indices[__i] < __size_[__i])
38 {
39 ++__k;
40 __1d_[__k] = __1d_[__k-1] + __stride_[__i];
41 for (size_t __j = __i + 1; __j != __indices.size(); ++__j)
42 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1);
43 break;
44 }
45 else
46 {
47 if (__i == 0)
48 return;
49 __indices[__i--] = 0;
50 }
51 }
52 }
53 }
54}
55
56_LIBCPP_END_NAMESPACE_STD