summaryrefslogtreecommitdiffstats
path: root/chromium/third_party/cygwin/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/valarray_array.tcc
diff options
context:
space:
mode:
Diffstat (limited to 'chromium/third_party/cygwin/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/valarray_array.tcc')
-rw-r--r--chromium/third_party/cygwin/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/valarray_array.tcc240
1 files changed, 0 insertions, 240 deletions
diff --git a/chromium/third_party/cygwin/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/valarray_array.tcc b/chromium/third_party/cygwin/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/valarray_array.tcc
deleted file mode 100644
index fac5de6399b..00000000000
--- a/chromium/third_party/cygwin/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/valarray_array.tcc
+++ /dev/null
@@ -1,240 +0,0 @@
-// The template and inlines for the -*- C++ -*- internal _Array helper class.
-
-// Copyright (C) 1997, 1998, 1999, 2003 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library. This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING. If not, write to the Free
-// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction. Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License. This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Written by Gabriel Dos Reis <Gabriel.Dos-Reis@DPTMaths.ENS-Cachan.Fr>
-
-#ifndef _VALARRAY_ARRAY_TCC
-#define _VALARRAY_ARRAY_TCC 1
-
-namespace std
-{
- template<typename _Tp>
- void
- __valarray_fill(_Array<_Tp> __a, size_t __n, _Array<bool> __m,
- const _Tp& __t)
- {
- _Tp* __p = __a._M_data;
- bool* __ok (__m._M_data);
- for (size_t __i=0; __i < __n; ++__i, ++__ok, ++__p)
- {
- while (!*__ok)
- {
- ++__ok;
- ++__p;
- }
- *__p = __t;
- }
- }
-
- // Copy n elements of a into consecutive elements of b. When m is
- // false, the corresponding element of a is skipped. m must contain
- // at least n true elements. a must contain at least n elements and
- // enough elements to match up with m through the nth true element
- // of m. I.e. if n is 10, m has 15 elements with 5 false followed
- // by 10 true, a must have 15 elements.
- template<typename _Tp>
- void
- __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, _Array<_Tp> __b,
- size_t __n)
- {
- _Tp* __p (__a._M_data);
- bool* __ok (__m._M_data);
- for (_Tp* __q = __b._M_data; __q < __b._M_data + __n;
- ++__q, ++__ok, ++__p)
- {
- while (! *__ok)
- {
- ++__ok;
- ++__p;
- }
- *__q = *__p;
- }
- }
-
- // Copy n consecutive elements from a into elements of b. Elements
- // of b are skipped if the corresponding element of m is false. m
- // must contain at least n true elements. b must have at least as
- // many elements as the index of the nth true element of m. I.e. if
- // m has 15 elements with 5 false followed by 10 true, b must have
- // at least 15 elements.
- template<typename _Tp>
- void
- __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b,
- _Array<bool> __m)
- {
- _Tp* __q (__b._M_data);
- bool* __ok (__m._M_data);
- for (_Tp* __p = __a._M_data; __p < __a._M_data+__n;
- ++__p, ++__ok, ++__q)
- {
- while (! *__ok)
- {
- ++__ok;
- ++__q;
- }
- *__q = *__p;
- }
- }
-
- // Copy n elements from a into elements of b. Elements of a are
- // skipped if the corresponding element of m is false. Elements of
- // b are skipped if the corresponding element of k is false. m and
- // k must contain at least n true elements. a and b must have at
- // least as many elements as the index of the nth true element of m.
- template<typename _Tp>
- void
- __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, size_t __n,
- _Array<_Tp> __b, _Array<bool> __k)
- {
- _Tp* __p (__a._M_data);
- _Tp* __q (__b._M_data);
- bool* __srcok (__m._M_data);
- bool* __dstok (__k._M_data);
- for (size_t __i = 0; __i < __n;
- ++__srcok, ++__p, ++__dstok, ++__q, ++__i)
- {
- while (! *__srcok)
- {
- ++__srcok;
- ++__p;
- }
- while (! *__dstok)
- {
- ++__dstok;
- ++__q;
- }
- *__q = *__p;
- }
- }
-
- // Copy n consecutive elements of e into consecutive elements of a.
- // I.e. a[i] = e[i].
- template<typename _Tp, class _Dom>
- void
- __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a)
- {
- _Tp* __p (__a._M_data);
- for (size_t __i = 0; __i < __n; ++__i, ++__p)
- *__p = __e[__i];
- }
-
- // Copy n consecutive elements of e into elements of a using stride
- // s. I.e., a[0] = e[0], a[s] = e[1], a[2*s] = e[2].
- template<typename _Tp, class _Dom>
- void
- __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,
- _Array<_Tp> __a, size_t __s)
- {
- _Tp* __p (__a._M_data);
- for (size_t __i = 0; __i < __n; ++__i, __p += __s)
- *__p = __e[__i];
- }
-
- // Copy n consecutive elements of e into elements of a indexed by
- // contents of i. I.e., a[i[0]] = e[0].
- template<typename _Tp, class _Dom>
- void
- __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,
- _Array<_Tp> __a, _Array<size_t> __i)
- {
- size_t* __j (__i._M_data);
- for (size_t __k = 0; __k < __n; ++__k, ++__j)
- __a._M_data[*__j] = __e[__k];
- }
-
- // Copy n elements of e indexed by contents of f into elements of a
- // indexed by contents of i. I.e., a[i[0]] = e[f[0]].
- template<typename _Tp>
- void
- __valarray_copy(_Array<_Tp> __e, _Array<size_t> __f,
- size_t __n,
- _Array<_Tp> __a, _Array<size_t> __i)
- {
- size_t* __g (__f._M_data);
- size_t* __j (__i._M_data);
- for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g)
- __a._M_data[*__j] = __e._M_data[*__g];
- }
-
- // Copy n consecutive elements of e into elements of a. Elements of
- // a are skipped if the corresponding element of m is false. m must
- // have at least n true elements and a must have at least as many
- // elements as the index of the nth true element of m. I.e. if m
- // has 5 false followed by 10 true elements and n == 10, a must have
- // at least 15 elements.
- template<typename _Tp, class _Dom>
- void
- __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,
- _Array<_Tp> __a, _Array<bool> __m)
- {
- bool* __ok (__m._M_data);
- _Tp* __p (__a._M_data);
- for (size_t __i = 0; __i < __n; ++__i, ++__ok, ++__p)
- {
- while (! *__ok)
- {
- ++__ok;
- ++__p;
- }
- *__p = __e[__i];
- }
- }
-
-
- template<typename _Tp, class _Dom>
- void
- __valarray_copy_construct(const _Expr<_Dom, _Tp>& __e, size_t __n,
- _Array<_Tp> __a)
- {
- _Tp* __p (__a._M_data);
- for (size_t __i = 0; __i < __n; ++__i, ++__p)
- new (__p) _Tp(__e[__i]);
- }
-
-
- template<typename _Tp>
- void
- __valarray_copy_construct(_Array<_Tp> __a, _Array<bool> __m,
- _Array<_Tp> __b, size_t __n)
- {
- _Tp* __p (__a._M_data);
- bool* __ok (__m._M_data);
- for (_Tp* __q = __b._M_data; __q < __b._M_data+__n; ++__q, ++__ok, ++__p)
- {
- while (! *__ok)
- {
- ++__ok;
- ++__p;
- }
- new (__q) _Tp(*__p);
- }
- }
-} // namespace std
-
-#endif /* _VALARRAY_ARRAY_TCC */
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-07 12:52:33 +0000