Gecko [ nbspublicschool.com ]

Name	Size	Permission
algorithmfwd.h	20.66 KB	-rw-r--r--
alloc_traits.h	17.66 KB	-rw-r--r--
allocator.h	6.1 KB	-rw-r--r--
atomic_base.h	24.99 KB	-rw-r--r--
atomic_lockfree_defines.h	2.2 KB	-rw-r--r--
basic_ios.h	14.76 KB	-rw-r--r--
basic_ios.tcc	5.89 KB	-rw-r--r--
basic_string.h	109.49 KB	-rw-r--r--
basic_string.tcc	38.43 KB	-rw-r--r--
boost_concept_check.h	26.41 KB	-rw-r--r--
c++0x_warning.h	1.47 KB	-rw-r--r--
char_traits.h	16.95 KB	-rw-r--r--
codecvt.h	16.23 KB	-rw-r--r--
concept_check.h	3.26 KB	-rw-r--r--
cpp_type_traits.h	9.56 KB	-rw-r--r--
cxxabi_forced.h	1.77 KB	-rw-r--r--
deque.tcc	31.91 KB	-rw-r--r--
exception_defines.h	1.6 KB	-rw-r--r--
exception_ptr.h	5.29 KB	-rw-r--r--
forward_list.h	46.72 KB	-rw-r--r--
forward_list.tcc	15.17 KB	-rw-r--r--
fstream.tcc	28.3 KB	-rw-r--r--
functexcept.h	3.04 KB	-rw-r--r--
functional_hash.h	6.05 KB	-rw-r--r--
gslice.h	5.39 KB	-rw-r--r--
gslice_array.h	7.59 KB	-rw-r--r--
hash_bytes.h	2.1 KB	-rw-r--r--
hashtable.h	61.05 KB	-rw-r--r--
hashtable_policy.h	52.72 KB	-rw-r--r--
indirect_array.h	7.68 KB	-rw-r--r--
ios_base.h	27.85 KB	-rw-r--r--
istream.tcc	30.36 KB	-rw-r--r--
list.tcc	12.2 KB	-rw-r--r--
locale_classes.h	22.45 KB	-rw-r--r--
locale_classes.tcc	8.18 KB	-rw-r--r--
locale_facets.h	88.84 KB	-rw-r--r--
locale_facets.tcc	38.02 KB	-rw-r--r--
locale_facets_nonio.h	63.51 KB	-rw-r--r--
locale_facets_nonio.tcc	40.85 KB	-rw-r--r--
localefwd.h	5.1 KB	-rw-r--r--
mask_array.h	7.41 KB	-rw-r--r--
memoryfwd.h	2.36 KB	-rw-r--r--
move.h	5.67 KB	-rw-r--r--
nested_exception.h	4.58 KB	-rw-r--r--
ostream.tcc	12.03 KB	-rw-r--r--
ostream_insert.h	3.91 KB	-rw-r--r--
postypes.h	8.02 KB	-rw-r--r--
ptr_traits.h	5.17 KB	-rw-r--r--
random.h	173.19 KB	-rw-r--r--
random.tcc	106.59 KB	-rw-r--r--
range_access.h	3.06 KB	-rw-r--r--
regex.h	83.49 KB	-rw-r--r--
regex_compiler.h	27.68 KB	-rw-r--r--
regex_constants.h	10.81 KB	-rw-r--r--
regex_cursor.h	2.7 KB	-rw-r--r--
regex_error.h	4.5 KB	-rw-r--r--
regex_grep_matcher.h	4.23 KB	-rw-r--r--
regex_grep_matcher.tcc	5.41 KB	-rw-r--r--
regex_nfa.h	10.65 KB	-rw-r--r--
regex_nfa.tcc	4.85 KB	-rw-r--r--
shared_ptr.h	18.97 KB	-rw-r--r--
shared_ptr_base.h	40.65 KB	-rw-r--r--
slice_array.h	9.12 KB	-rw-r--r--
sstream.tcc	9.27 KB	-rw-r--r--
stl_algo.h	212.55 KB	-rw-r--r--
stl_algobase.h	41.41 KB	-rw-r--r--
stl_bvector.h	28.98 KB	-rw-r--r--
stl_construct.h	5.05 KB	-rw-r--r--
stl_deque.h	66.41 KB	-rw-r--r--
stl_function.h	22.06 KB	-rw-r--r--
stl_heap.h	19.99 KB	-rw-r--r--
stl_iterator.h	35.77 KB	-rw-r--r--
stl_iterator_base_funcs.h	6.8 KB	-rw-r--r--
stl_iterator_base_types.h	8.19 KB	-rw-r--r--
stl_list.h	52.83 KB	-rw-r--r--
stl_map.h	36.78 KB	-rw-r--r--
stl_multimap.h	33.94 KB	-rw-r--r--
stl_multiset.h	28.37 KB	-rw-r--r--
stl_numeric.h	13.5 KB	-rw-r--r--
stl_pair.h	9.63 KB	-rw-r--r--
stl_queue.h	18.21 KB	-rw-r--r--
stl_raw_storage_iter.h	3.37 KB	-rw-r--r--
stl_relops.h	4.49 KB	-rw-r--r--
stl_set.h	28.61 KB	-rw-r--r--
stl_stack.h	9.65 KB	-rw-r--r--
stl_tempbuf.h	8.15 KB	-rw-r--r--
stl_tree.h	53.56 KB	-rw-r--r--
stl_uninitialized.h	19.95 KB	-rw-r--r--
stl_vector.h	48.64 KB	-rw-r--r--
stream_iterator.h	6.44 KB	-rw-r--r--
streambuf.tcc	4.81 KB	-rw-r--r--
streambuf_iterator.h	12.33 KB	-rw-r--r--
stringfwd.h	2.37 KB	-rw-r--r--
unique_ptr.h	17.19 KB	-rw-r--r--
unordered_map.h	47.76 KB	-rw-r--r--
unordered_set.h	43.25 KB	-rw-r--r--
uses_allocator.h	3.49 KB	-rw-r--r--
valarray_after.h	22.12 KB	-rw-r--r--
valarray_array.h	21.23 KB	-rw-r--r--
valarray_array.tcc	7.08 KB	-rw-r--r--
valarray_before.h	18.08 KB	-rw-r--r--
vector.tcc	25.55 KB	-rw-r--r--

Code Editor : valarray_array.tcc

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

// Copyright (C) 1997-2013 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 */

${this.title}

Code Editor : valarray_array.tcc