OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	01/31/2023 12:38:15 PM	rwxr-xr-x
📄 algorithmfwd.h	21.23 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 alloc_traits.h	19.13 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 allocated_ptr.h	3.43 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 allocator.h	6.73 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 atomic_base.h	23.28 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 atomic_futex.h	9.35 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 atomic_lockfree_defines.h	2.2 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_ios.h	15.7 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_ios.tcc	5.94 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_string.h	235.15 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_string.tcc	52.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 boost_concept_check.h	26.41 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 c++0x_warning.h	1.44 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 char_traits.h	20.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 codecvt.h	20.8 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 concept_check.h	3.34 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 cpp_type_traits.h	9.37 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 cxxabi_forced.h	1.77 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 cxxabi_init_exception.h	2.17 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 deque.tcc	33.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 enable_special_members.h	12.1 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 exception.h	2.23 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 exception_defines.h	1.61 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 exception_ptr.h	6.31 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 forward_list.h	47.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 forward_list.tcc	14.68 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 fstream.tcc	32.14 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 functexcept.h	3.18 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 functional_hash.h	8 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 gslice.h	5.39 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 gslice_array.h	7.59 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 hash_bytes.h	2.1 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 hashtable.h	71.56 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 hashtable_policy.h	65.47 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 indirect_array.h	7.68 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 invoke.h	3.57 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 ios_base.h	30.22 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 istream.tcc	30.36 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 list.tcc	15.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_classes.h	24.31 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_classes.tcc	8.18 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_conv.h	15.7 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_facets.h	89.98 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_facets.tcc	38.64 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_facets_nonio.h	67.33 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_facets_nonio.tcc	44.46 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 localefwd.h	5.51 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 mask_array.h	7.42 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 memoryfwd.h	2.36 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 move.h	6.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 nested_exception.h	4.66 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 node_handle.h	7.97 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 ostream.tcc	12.03 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 ostream_insert.h	3.91 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 parse_numbers.h	7.84 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 postypes.h	8.02 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 predefined_ops.h	8.87 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 ptr_traits.h	4.75 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 quoted_string.h	4.47 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 random.h	171.19 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 random.tcc	103.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 range_access.h	9.75 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 refwrap.h	13.48 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex.h	95.9 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex.tcc	16.1 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_automaton.h	10.47 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_automaton.tcc	7.65 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_compiler.h	16.79 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_compiler.tcc	18.46 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_constants.h	14.36 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_error.h	4.85 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_executor.h	7.31 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_executor.tcc	16.91 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_scanner.h	6.92 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_scanner.tcc	14.66 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 shared_ptr.h	22.37 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 shared_ptr_atomic.h	9.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 shared_ptr_base.h	52.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 slice_array.h	9.13 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 specfun.h	44.03 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 sstream.tcc	9.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 std_abs.h	3.21 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 std_function.h	23.41 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 std_mutex.h	9.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_algo.h	208.85 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_algobase.h	49.22 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_bvector.h	33.03 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_construct.h	7.22 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_deque.h	75.95 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_function.h	32.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_heap.h	19.73 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_iterator.h	40.77 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_iterator_base_funcs.h	7.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_iterator_base_types.h	8.48 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_list.h	63.65 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_map.h	50.02 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_multimap.h	39 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_multiset.h	33.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_numeric.h	13.51 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_pair.h	18.21 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_queue.h	21.61 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_raw_storage_iter.h	3.74 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_relops.h	4.49 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_set.h	33.63 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_stack.h	11.18 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_tempbuf.h	8.15 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_tree.h	73.07 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_uninitialized.h	27 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_vector.h	54.33 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stream_iterator.h	6.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 streambuf.tcc	4.81 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 streambuf_iterator.h	12.33 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 string_view.tcc	6.48 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stringfwd.h	2.55 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 uniform_int_dist.h	9.91 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unique_ptr.h	24.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unordered_map.h	67.04 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unordered_set.h	52.56 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 uses_allocator.h	6.23 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 valarray_after.h	22.12 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 valarray_array.h	21.3 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 valarray_array.tcc	7.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 valarray_before.h	18.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 vector.tcc	26.95 KB	12/04/2019 02:25:41 PM	rw-r--r--

Editing: regex_automaton.h

// class template regex -*- C++ -*-

// Copyright (C) 2013-2017 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/regex_automaton.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{regex}
 */

// This macro defines the maximal state number a NFA can have.
#ifndef _GLIBCXX_REGEX_STATE_LIMIT
#define _GLIBCXX_REGEX_STATE_LIMIT 100000
#endif

namespace std _GLIBCXX_VISIBILITY(default)
{
namespace __detail
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
   *  @defgroup regex-detail Base and Implementation Classes
   *  @ingroup regex
   *  @{
   */

typedef long _StateIdT;
  static const _StateIdT _S_invalid_state_id  = -1;

template<typename _CharT>
    using _Matcher = std::function<bool (_CharT)>;

/// Operation codes that define the type of transitions within the base NFA
  /// that represents the regular expression.
  enum _Opcode : int
  {
      _S_opcode_unknown,
      _S_opcode_alternative,
      _S_opcode_repeat,
      _S_opcode_backref,
      _S_opcode_line_begin_assertion,
      _S_opcode_line_end_assertion,
      _S_opcode_word_boundary,
      _S_opcode_subexpr_lookahead,
      _S_opcode_subexpr_begin,
      _S_opcode_subexpr_end,
      _S_opcode_dummy,
      _S_opcode_match,
      _S_opcode_accept,
  };

struct _State_base
  {
  protected:
    _Opcode      _M_opcode;           // type of outgoing transition

public:
    _StateIdT    _M_next;             // outgoing transition
    union // Since they are mutually exclusive.
    {
      size_t _M_subexpr;        // for _S_opcode_subexpr_*
      size_t _M_backref_index;  // for _S_opcode_backref
      struct
      {
	// for _S_opcode_alternative, _S_opcode_repeat and
	// _S_opcode_subexpr_lookahead
	_StateIdT  _M_alt;
	// for _S_opcode_word_boundary or _S_opcode_subexpr_lookahead or
	// quantifiers (ungreedy if set true)
	bool       _M_neg;
      };
      // For _S_opcode_match
      __gnu_cxx::__aligned_membuf<_Matcher<char>> _M_matcher_storage;
    };

protected:
    explicit _State_base(_Opcode __opcode)
    : _M_opcode(__opcode), _M_next(_S_invalid_state_id)
    { }

public:
    bool
    _M_has_alt()
    {
      return _M_opcode == _S_opcode_alternative
	|| _M_opcode == _S_opcode_repeat
	|| _M_opcode == _S_opcode_subexpr_lookahead;
    }

#ifdef _GLIBCXX_DEBUG
    std::ostream&
    _M_print(std::ostream& ostr) const;

// Prints graphviz dot commands for state.
    std::ostream&
    _M_dot(std::ostream& __ostr, _StateIdT __id) const;
#endif
  };

template<typename _Char_type>
    struct _State : _State_base
    {
      typedef _Matcher<_Char_type> _MatcherT;
      static_assert(sizeof(_MatcherT) == sizeof(_Matcher<char>),
		    "std::function<bool(T)> has the same size as "
		    "std::function<bool(char)>");
      static_assert(alignof(_MatcherT) == alignof(_Matcher<char>),
		    "std::function<bool(T)> has the same alignment as "
		    "std::function<bool(char)>");

explicit
      _State(_Opcode __opcode) : _State_base(__opcode)
      {
	if (_M_opcode() == _S_opcode_match)
	  new (this->_M_matcher_storage._M_addr()) _MatcherT();
      }

_State(const _State& __rhs) : _State_base(__rhs)
      {
	if (__rhs._M_opcode() == _S_opcode_match)
	  new (this->_M_matcher_storage._M_addr())
	    _MatcherT(__rhs._M_get_matcher());
      }

_State(_State&& __rhs) : _State_base(__rhs)
      {
	if (__rhs._M_opcode() == _S_opcode_match)
	  new (this->_M_matcher_storage._M_addr())
	    _MatcherT(std::move(__rhs._M_get_matcher()));
      }

_State&
      operator=(const _State&) = delete;

~_State()
      {
	if (_M_opcode() == _S_opcode_match)
	  _M_get_matcher().~_MatcherT();
      }

// Since correct ctor and dtor rely on _M_opcode, it's better not to
      // change it over time.
      _Opcode
      _M_opcode() const
      { return _State_base::_M_opcode; }

bool
      _M_matches(_Char_type __char) const
      { return _M_get_matcher()(__char); }

_MatcherT&
      _M_get_matcher()
      { return *static_cast<_MatcherT*>(this->_M_matcher_storage._M_addr()); }

const _MatcherT&
      _M_get_matcher() const
      {
	return *static_cast<const _MatcherT*>(
	    this->_M_matcher_storage._M_addr());
      }
    };

struct _NFA_base
  {
    typedef size_t                              _SizeT;
    typedef regex_constants::syntax_option_type _FlagT;

explicit
    _NFA_base(_FlagT __f)
    : _M_flags(__f), _M_start_state(0), _M_subexpr_count(0),
    _M_has_backref(false)
    { }

_NFA_base(_NFA_base&&) = default;

protected:
    ~_NFA_base() = default;

public:
    _FlagT
    _M_options() const
    { return _M_flags; }

_StateIdT
    _M_start() const
    { return _M_start_state; }

_SizeT
    _M_sub_count() const
    { return _M_subexpr_count; }

std::vector<size_t>       _M_paren_stack;
    _FlagT                    _M_flags;
    _StateIdT                 _M_start_state;
    _SizeT                    _M_subexpr_count;
    bool                      _M_has_backref;
  };

template<typename _TraitsT>
    struct _NFA
    : _NFA_base, std::vector<_State<typename _TraitsT::char_type>>
    {
      typedef typename _TraitsT::char_type	_Char_type;
      typedef _State<_Char_type>		_StateT;
      typedef _Matcher<_Char_type>		_MatcherT;

_NFA(const typename _TraitsT::locale_type& __loc, _FlagT __flags)
      : _NFA_base(__flags)
      { _M_traits.imbue(__loc); }

// for performance reasons _NFA objects should only be moved not copied
      _NFA(const _NFA&) = delete;
      _NFA(_NFA&&) = default;

_StateIdT
      _M_insert_accept()
      {
	auto __ret = _M_insert_state(_StateT(_S_opcode_accept));
	return __ret;
      }

_StateIdT
      _M_insert_alt(_StateIdT __next, _StateIdT __alt,
		    bool __neg __attribute__((__unused__)))
      {
	_StateT __tmp(_S_opcode_alternative);
	// It labels every quantifier to make greedy comparison easier in BFS
	// approach.
	__tmp._M_next = __next;
	__tmp._M_alt = __alt;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_repeat(_StateIdT __next, _StateIdT __alt, bool __neg)
      {
	_StateT __tmp(_S_opcode_repeat);
	// It labels every quantifier to make greedy comparison easier in BFS
	// approach.
	__tmp._M_next = __next;
	__tmp._M_alt = __alt;
	__tmp._M_neg = __neg;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_matcher(_MatcherT __m)
      {
	_StateT __tmp(_S_opcode_match);
	__tmp._M_get_matcher() = std::move(__m);
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_subexpr_begin()
      {
	auto __id = this->_M_subexpr_count++;
	this->_M_paren_stack.push_back(__id);
	_StateT __tmp(_S_opcode_subexpr_begin);
	__tmp._M_subexpr = __id;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_subexpr_end()
      {
	_StateT __tmp(_S_opcode_subexpr_end);
	__tmp._M_subexpr = this->_M_paren_stack.back();
	this->_M_paren_stack.pop_back();
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_backref(size_t __index);

_StateIdT
      _M_insert_line_begin()
      { return _M_insert_state(_StateT(_S_opcode_line_begin_assertion)); }

_StateIdT
      _M_insert_line_end()
      { return _M_insert_state(_StateT(_S_opcode_line_end_assertion)); }

_StateIdT
      _M_insert_word_bound(bool __neg)
      {
	_StateT __tmp(_S_opcode_word_boundary);
	__tmp._M_neg = __neg;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_lookahead(_StateIdT __alt, bool __neg)
      {
	_StateT __tmp(_S_opcode_subexpr_lookahead);
	__tmp._M_alt = __alt;
	__tmp._M_neg = __neg;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_dummy()
      { return _M_insert_state(_StateT(_S_opcode_dummy)); }

_StateIdT
      _M_insert_state(_StateT __s)
      {
	this->push_back(std::move(__s));
	if (this->size() > _GLIBCXX_REGEX_STATE_LIMIT)
	  __throw_regex_error(
	    regex_constants::error_space,
	    "Number of NFA states exceeds limit. Please use shorter regex "
	    "string, or use smaller brace expression, or make "
	    "_GLIBCXX_REGEX_STATE_LIMIT larger.");
	return this->size() - 1;
      }

// Eliminate dummy node in this NFA to make it compact.
      void
      _M_eliminate_dummy();

#ifdef _GLIBCXX_DEBUG
      std::ostream&
      _M_dot(std::ostream& __ostr) const;
#endif
    public:
      _TraitsT                  _M_traits;
    };

/// Describes a sequence of one or more %_State, its current start
  /// and end(s).  This structure contains fragments of an NFA during
  /// construction.
  template<typename _TraitsT>
    class _StateSeq
    {
    public:
      typedef _NFA<_TraitsT> _RegexT;

public:
      _StateSeq(_RegexT& __nfa, _StateIdT __s)
      : _M_nfa(__nfa), _M_start(__s), _M_end(__s)
      { }

_StateSeq(_RegexT& __nfa, _StateIdT __s, _StateIdT __end)
      : _M_nfa(__nfa), _M_start(__s), _M_end(__end)
      { }

// Append a state on *this and change *this to the new sequence.
      void
      _M_append(_StateIdT __id)
      {
	_M_nfa[_M_end]._M_next = __id;
	_M_end = __id;
      }

// Append a sequence on *this and change *this to the new sequence.
      void
      _M_append(const _StateSeq& __s)
      {
	_M_nfa[_M_end]._M_next = __s._M_start;
	_M_end = __s._M_end;
      }

// Clones an entire sequence.
      _StateSeq
      _M_clone();

public:
      _RegexT&  _M_nfa;
      _StateIdT _M_start;
      _StateIdT _M_end;
    };

//@} regex-detail
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace __detail
} // namespace std

#include <bits/regex_automaton.tcc>