Gecko [ paroquia-rio-de-mouro.pt ]

Name	Size	Permission	Date
algorithmfwd.h	21.14 KB	-rw-r--r--	2019-10-04 20:36
alloc_traits.h	20.05 KB	-rw-r--r--	2019-10-04 20:36
allocated_ptr.h	3.38 KB	-rw-r--r--	2019-10-04 20:36
allocator.h	6.32 KB	-rw-r--r--	2019-10-04 20:36
atomic_base.h	23.41 KB	-rw-r--r--	2019-10-04 20:36
atomic_futex.h	9.35 KB	-rw-r--r--	2019-10-04 20:36
atomic_lockfree_defines.h	2.2 KB	-rw-r--r--	2019-10-04 20:36
basic_ios.h	15.7 KB	-rw-r--r--	2019-10-04 20:36
basic_ios.tcc	5.89 KB	-rw-r--r--	2019-10-04 20:36
basic_string.h	198.81 KB	-rw-r--r--	2019-10-04 20:36
basic_string.tcc	50.73 KB	-rw-r--r--	2019-10-04 20:36
boost_concept_check.h	26.41 KB	-rw-r--r--	2019-10-04 20:36
c++0x_warning.h	1.44 KB	-rw-r--r--	2019-10-04 20:36
c++14_warning.h	1.48 KB	-rw-r--r--	2019-10-04 20:36
char_traits.h	17.56 KB	-rw-r--r--	2019-10-04 20:36
codecvt.h	20.8 KB	-rw-r--r--	2019-10-04 20:36
concept_check.h	3.26 KB	-rw-r--r--	2019-10-04 20:36
cpp_type_traits.h	10.04 KB	-rw-r--r--	2019-10-04 20:36
cxxabi_forced.h	1.77 KB	-rw-r--r--	2019-10-04 20:36
deque.tcc	32.89 KB	-rw-r--r--	2019-10-04 20:36
enable_special_members.h	10.87 KB	-rw-r--r--	2019-10-04 20:36
exception_defines.h	1.61 KB	-rw-r--r--	2019-10-04 20:36
exception_ptr.h	5.5 KB	-rw-r--r--	2019-10-04 20:36
forward_list.h	47.01 KB	-rw-r--r--	2019-10-04 20:36
forward_list.tcc	15.17 KB	-rw-r--r--	2019-10-04 20:36
fstream.tcc	32.1 KB	-rw-r--r--	2019-10-04 20:36
functexcept.h	3.18 KB	-rw-r--r--	2019-10-04 20:36
functional_hash.h	6.05 KB	-rw-r--r--	2019-10-04 20:36
gslice.h	5.39 KB	-rw-r--r--	2019-10-04 20:36
gslice_array.h	7.59 KB	-rw-r--r--	2019-10-04 20:36
hash_bytes.h	2.1 KB	-rw-r--r--	2019-10-04 20:36
hashtable.h	67.95 KB	-rw-r--r--	2019-10-04 20:36
hashtable_policy.h	62.61 KB	-rw-r--r--	2019-10-04 20:36
indirect_array.h	7.68 KB	-rw-r--r--	2019-10-04 20:36
ios_base.h	30.21 KB	-rw-r--r--	2019-10-04 20:36
istream.tcc	30.21 KB	-rw-r--r--	2019-10-04 20:36
list.tcc	13.5 KB	-rw-r--r--	2019-10-04 20:36
locale_classes.h	24.14 KB	-rw-r--r--	2019-10-04 20:36
locale_classes.tcc	8.18 KB	-rw-r--r--	2019-10-04 20:36
locale_conv.h	15.64 KB	-rw-r--r--	2019-10-04 20:36
locale_facets.h	89.93 KB	-rw-r--r--	2019-10-04 20:36
locale_facets.tcc	38.63 KB	-rw-r--r--	2019-10-04 20:36
locale_facets_nonio.h	67.33 KB	-rw-r--r--	2019-10-04 20:36
locale_facets_nonio.tcc	44.04 KB	-rw-r--r--	2019-10-04 20:36
localefwd.h	5.51 KB	-rw-r--r--	2019-10-04 20:36
mask_array.h	7.41 KB	-rw-r--r--	2019-10-04 20:36
memoryfwd.h	2.36 KB	-rw-r--r--	2019-10-04 20:36
move.h	5.93 KB	-rw-r--r--	2019-10-04 20:36
nested_exception.h	4.5 KB	-rw-r--r--	2019-10-04 20:36
ostream.tcc	12.03 KB	-rw-r--r--	2019-10-04 20:36
ostream_insert.h	3.91 KB	-rw-r--r--	2019-10-04 20:36
parse_numbers.h	7.58 KB	-rw-r--r--	2019-10-04 20:36
postypes.h	8.02 KB	-rw-r--r--	2019-10-04 20:36
predefined_ops.h	7.75 KB	-rw-r--r--	2019-10-04 20:36
ptr_traits.h	5.02 KB	-rw-r--r--	2019-10-04 20:36
quoted_string.h	4.47 KB	-rw-r--r--	2019-10-04 20:36
random.h	169.22 KB	-rw-r--r--	2019-10-04 20:36
random.tcc	102.74 KB	-rw-r--r--	2019-10-04 20:36
range_access.h	7.11 KB	-rw-r--r--	2019-10-04 20:36
regex.h	94.4 KB	-rw-r--r--	2019-10-04 20:36
regex.tcc	16.72 KB	-rw-r--r--	2019-10-04 20:36
regex_automaton.h	8.52 KB	-rw-r--r--	2019-10-04 20:36
regex_automaton.tcc	7.71 KB	-rw-r--r--	2019-10-04 20:36
regex_compiler.h	14.35 KB	-rw-r--r--	2019-10-04 20:36
regex_compiler.tcc	17.4 KB	-rw-r--r--	2019-10-04 20:36
regex_constants.h	13.57 KB	-rw-r--r--	2019-10-04 20:36
regex_error.h	4.48 KB	-rw-r--r--	2019-10-04 20:36
regex_executor.h	6.62 KB	-rw-r--r--	2019-10-04 20:36
regex_executor.tcc	13.99 KB	-rw-r--r--	2019-10-04 20:36
regex_scanner.h	6.88 KB	-rw-r--r--	2019-10-04 20:36
regex_scanner.tcc	13.8 KB	-rw-r--r--	2019-10-04 20:36
shared_ptr.h	19.8 KB	-rw-r--r--	2019-10-04 20:36
shared_ptr_atomic.h	9.54 KB	-rw-r--r--	2019-10-04 20:36
shared_ptr_base.h	44.48 KB	-rw-r--r--	2019-10-04 20:36
slice_array.h	9.12 KB	-rw-r--r--	2019-10-04 20:36
sstream.tcc	9.27 KB	-rw-r--r--	2019-10-04 20:36
stl_algo.h	198.04 KB	-rw-r--r--	2019-10-04 20:36
stl_algobase.h	49.72 KB	-rw-r--r--	2019-10-04 20:36
stl_bvector.h	32.76 KB	-rw-r--r--	2019-10-04 20:36
stl_construct.h	5.05 KB	-rw-r--r--	2019-10-04 20:36
stl_deque.h	75.97 KB	-rw-r--r--	2019-10-04 20:36
stl_function.h	32.55 KB	-rw-r--r--	2019-10-04 20:36
stl_heap.h	18.19 KB	-rw-r--r--	2019-10-04 20:36
stl_iterator.h	36.98 KB	-rw-r--r--	2019-10-04 20:36
stl_iterator_base_funcs.h	6.8 KB	-rw-r--r--	2019-10-04 20:36
stl_iterator_base_types.h	8.42 KB	-rw-r--r--	2019-10-04 20:36
stl_list.h	60.65 KB	-rw-r--r--	2019-10-04 20:36
stl_map.h	39.54 KB	-rw-r--r--	2019-10-04 20:36
stl_multimap.h	36.77 KB	-rw-r--r--	2019-10-04 20:36
stl_multiset.h	30.93 KB	-rw-r--r--	2019-10-04 20:36
stl_numeric.h	13.5 KB	-rw-r--r--	2019-10-04 20:36
stl_pair.h	9.63 KB	-rw-r--r--	2019-10-04 20:36
stl_queue.h	18.28 KB	-rw-r--r--	2019-10-04 20:36
stl_raw_storage_iter.h	3.37 KB	-rw-r--r--	2019-10-04 20:36
stl_relops.h	4.49 KB	-rw-r--r--	2019-10-04 20:36
stl_set.h	31.18 KB	-rw-r--r--	2019-10-04 20:36
stl_stack.h	9.71 KB	-rw-r--r--	2019-10-04 20:36
stl_tempbuf.h	8.15 KB	-rw-r--r--	2019-10-04 20:36
stl_tree.h	67.54 KB	-rw-r--r--	2019-10-04 20:36
stl_uninitialized.h	21.37 KB	-rw-r--r--	2019-10-04 20:36
stl_vector.h	52.41 KB	-rw-r--r--	2019-10-04 20:36
stream_iterator.h	6.44 KB	-rw-r--r--	2019-10-04 20:36
streambuf.tcc	4.81 KB	-rw-r--r--	2019-10-04 20:36
streambuf_iterator.h	12.33 KB	-rw-r--r--	2019-10-04 20:36
stringfwd.h	2.55 KB	-rw-r--r--	2019-10-04 20:36
uniform_int_dist.h	9.72 KB	-rw-r--r--	2019-10-04 20:36
unique_ptr.h	23.29 KB	-rw-r--r--	2019-10-04 20:36
unordered_map.h	52.15 KB	-rw-r--r--	2019-10-04 20:36
unordered_set.h	47.51 KB	-rw-r--r--	2019-10-04 20:36
uses_allocator.h	3.19 KB	-rw-r--r--	2019-10-04 20:36
valarray_after.h	22.12 KB	-rw-r--r--	2019-10-04 20:36
valarray_array.h	21.23 KB	-rw-r--r--	2019-10-04 20:36
valarray_array.tcc	7.08 KB	-rw-r--r--	2019-10-04 20:36
valarray_before.h	18.08 KB	-rw-r--r--	2019-10-04 20:36
vector.tcc	26.42 KB	-rw-r--r--	2019-10-04 20:36

Rename

// The template and inlines for the -*- C++ -*- internal _Array helper class.

// Copyright (C) 1997-2015 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 3, 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.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file bits/valarray_array.tcc
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{valarray}
 */

// Written by Gabriel Dos Reis <Gabriel.Dos-Reis@DPTMaths.ENS-Cachan.Fr>

#ifndef _VALARRAY_ARRAY_TCC
#define _VALARRAY_ARRAY_TCC 1

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

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);
	}
    }

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

#endif /* _VALARRAY_ARRAY_TCC */