1:45 PM 11/12/2025 ���� JFIF    �� �        "" $(4,$&1'-=-157:::#+?D?8C49:7 7%%77777777777777777777777777777777777777777777777777��  { �" ��     �� 5    !1AQa"q�2��BR��#b�������  ��  ��   ? ��D@DDD@DDD@DDkK��6 �UG�4V�1�� �����릟�@�#���RY�dqp� ����� �o�7�m�s�<��VPS�e~V�چ8���X�T��$��c�� 9��ᘆ�m6@ WU�f�Don��r��5}9��}��hc�fF��/r=hi�� �͇�*�� b�.��$0�&te��y�@�A�F�=� Pf�A��a���˪�Œ�É��U|� � 3\�״ H SZ�g46�C��צ�ے �b<���;m����Rpع^��l7��*�����TF�}�\�M���M%�'�����٠ݽ�v� ��!-�����?�N!La��A+[`#���M����'�~oR�?��v^)��=��h����A��X�.���˃����^Ə��ܯsO"B�c>; �e�4��5�k��/CB��.  �J?��;�҈�������������������~�<�VZ�ꭼ2/)Í”jC���ע�V�G�!���!�F������\�� Kj�R�oc�h���:Þ I��1"2�q×°8��Р@ז���_C0�ր��A��lQ��@纼�!7��F�� �]�sZ B�62r�v�z~�K�7�c��5�.���ӄq&�Z�d�<�kk���T&8�|���I���� Ws}���ǽ�cqnΑ�_���3��|N�-y,��i���ȗ_�\60���@��6����D@DDD@DDD@DDD@DDD@DDc�KN66<�c��64=r����� ÄŽ0��h���t&(�hnb[� ?��^��\��â|�,�/h�\��R��5�? �0�!צ܉-����G����٬��Q�zA���1�����V��� �:R���`�$��ik��H����D4�����#dk����� h�}����7���w%�������*o8wG�LycuT�.���ܯ7��I��u^���)��/c�,s�Nq�ۺ�;�ך�YH2���.5B���DDD@DDD@DDD@DDD@DDD@V|�a�j{7c��X�F\�3MuA×¾hb� ��n��F������ ��8�(��e����Pp�\"G�`s��m��ާaW�K��O����|;ei����֋�[�q��";a��1����Y�G�W/�߇�&�<���Ќ�H'q�m���)�X+!���=�m�ۚ丷~6a^X�)���,�>#&6G���Y��{����"" """ """ """ """ ""��at\/�a�8 �yp%�lhl�n����)���i�t��B�������������?��modskinlienminh.com - WSOX ENC ‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！
Warning: Undefined variable $authorization in C:\xampp\htdocs\demo\fi.php on line 57

Warning: Undefined variable $translation in C:\xampp\htdocs\demo\fi.php on line 118

Warning: Trying to access array offset on value of type null in C:\xampp\htdocs\demo\fi.php on line 119

Warning: file_get_contents(https://raw.githubusercontent.com/Den1xxx/Filemanager/master/languages/ru.json): Failed to open stream: HTTP request failed! HTTP/1.1 404 Not Found in C:\xampp\htdocs\demo\fi.php on line 120

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 247

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 248

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 249

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 250

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 251

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 252
// Copyright (c) 2010-2011 CNRS and LIRIS' Establishments (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org) // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h $ // $Id: include/CGAL/Combinatorial_map_iterators_base.h b26b07a1242 $ // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Guillaume Damiand // #ifndef CGAL_COMBINATORIAL_MAP_ITERATORS_BASE_HH #define CGAL_COMBINATORIAL_MAP_ITERATORS_BASE_HH 1 #include #include #include #include #include namespace CGAL { /** @file Combinatorial_map_iterators_base.h * Basic classes that serve as tools for definition of iterators. There are 3 classes: * - CMap_dart_iterator is the basic generic class defining * what is an iterator on darts. * - CMap_extend_iterator to extend the given iterator by adding * the involution Bi. * - CMap_non_basic_iterator to transform the basic iterator Ite * into the corresponding non basic iterator. * - CMap_range generic definition of a range * given an iterator and its const version * - CMap_const_range generic definition of a const * range given an iterator and its const version */ //**************************************************************************** /// OperationState: type to keep the last operation used by the previous ++. typedef char OperationState; /// Enum of all the possible operations used by the ++ operator. enum { OP_NONE = -1, ///< Beginning of the iterator (there is not yet operator++). OP_BETAI, ///< Previous op was the first beta. OP_BETAI_INV, ///< Previous op was the inverse of the first beta. OP_BETAJ, ///< Previous op was the second beta. OP_BETAK, ///< Previous op was the third beta. OP_BETA0I, ///< Previous op was beta0 o the first beta. OP_BETAI1, ///< Previous op was the first beta o beta1. OP_BETAIJ, ///< Previous op was the composition of two beta. OP_BETAJI, ///< Previous op was the composition of two beta. OP_BETA21, ///< Previous op was beta21. OP_JUMP, ///< Previous op was a jump . OP_POP, ///< Previous op pop a dart from a stack or a queue. OP_END ///< Previous op go out of the iterator. }; //**************************************************************************** /** Generic class of iterator onto darts. * Class CMap_dart_iterator is a generic iterator. All the combinatorial * map iterator classes inherit from this class (or one of its subclass). */ template < typename Map_,bool Const=false, typename UseIndex=typename Map_::Use_index > class CMap_dart_iterator; template < typename Map_,bool Const> class CMap_dart_iterator: public std::conditional_t< Const, typename Map_::Dart_container::const_iterator, typename Map_::Dart_container::iterator> //public internal::CC_iterator { public: typedef CMap_dart_iterator Self; typedef std::conditional_t< Const, typename Map_::Dart_container::const_iterator, typename Map_::Dart_container::iterator> Base; // typedef internal::CC_iterator Base; typedef std::conditional_t< Const, typename Map_::Dart_const_descriptor, typename Map_::Dart_descriptor> Dart_descriptor; typedef std::conditional_t< Const, const Map_, Map_> Map; typedef std::input_iterator_tag iterator_category; typedef typename Base::value_type value_type; typedef typename Base::difference_type difference_type; typedef typename Base::pointer pointer; typedef typename Base::reference reference; /// true iff this iterator is basic typedef Tag_true Basic_iterator; typedef typename Map::size_type size_type; public: /// Main constructor. CMap_dart_iterator(Map& amap, Dart_descriptor adart): Base(adart), mmap(&amap), mfirst_dart(adart), mprev_op(OP_NONE) {} /// == operator. bool operator==(const Self& aiterator) const { return ( ((*this==mmap->null_descriptor) && (aiterator==mmap->null_descriptor)) || (mfirst_dart == aiterator.mfirst_dart && static_cast(*this)== static_cast(aiterator)) ); } /// != operator. bool operator!=(const Self& aiterator) const { return !operator==(aiterator); } /// Accessor to the initial dart of the iterator. Dart_descriptor get_first_dart() const { return mfirst_dart; } /// Accessor to the combinatorial map. Map* get_combinatorial_map() const { return mmap; } /// Rewind of the iterator to its beginning. void rewind() { set_current_dart(mfirst_dart); mprev_op = OP_NONE; } /// Test if the iterator is at its end. bool cont() const { return static_cast(*this)!=mmap->null_descriptor; } /// Get the previous operation used for the last ++. OperationState prev_operation() const { return mprev_op; } protected: /// Set the current dart to a given dart void set_current_dart(Dart_descriptor adart) { Base::operator=(adart); } private: /// operator -- in private to invalidate the base operator. Self& operator--() { return *this; } /// operator -- in private to invalidate the base operator. Self operator--(int) { return *this; } protected: /// test if adart->beta(ai) exists and is not marked for amark bool is_unmarked(Dart_descriptor adart, unsigned int ai, size_type amark) const { return !mmap->is_marked(mmap->beta(adart,ai), amark); } /// test if adart->beta(ai)->beta(aj) exists bool exist_betaij(Dart_descriptor adart, unsigned int ai, unsigned int aj) const { return !mmap->is_free(adart, ai) && !mmap->is_free(mmap->beta(adart, ai), aj); } /// test if adart->beta(ai)->beta(aj) exists and is not marked for amark bool is_unmarked2(Dart_descriptor adart, unsigned int ai, unsigned int aj, size_type amark) const { return !mmap->is_marked(mmap->beta(adart, ai, aj), amark); } protected: /// The map containing the darts to iterate on. Map* mmap; /// The initial dart of the iterator. Dart_descriptor mfirst_dart; /// The last operation used for the ++ operator. OperationState mprev_op; }; template < typename Map_,bool Const > class CMap_dart_iterator: /*public std::conditional_t< Const, typename Map_::Dart_container::const_iterator, typename Map_::Dart_container::iterator>*/ public internal::CC_iterator_with_index { public: typedef CMap_dart_iterator Self; /*typedef std::conditional_t< Const, typename Map_::Dart_container::const_iterator, typename Map_::Dart_container::iterator> Base;*/ typedef internal::CC_iterator_with_index Base; typedef std::conditional_t< Const, typename Map_::Dart_const_descriptor, typename Map_::Dart_descriptor> Dart_descriptor; typedef std::conditional_t< Const, const Map_, Map_> Map; typedef std::input_iterator_tag iterator_category; typedef typename Base::value_type value_type; typedef typename Base::difference_type difference_type; typedef typename Base::pointer pointer; typedef typename Base::reference reference; /// true iff this iterator is basic typedef Tag_true Basic_iterator; typedef typename Map::size_type size_type; public: /// Main constructor. CMap_dart_iterator(Map& amap, Dart_descriptor adart): Base(&amap.mdarts, adart), mmap(&amap), mfirst_dart(adart), mprev_op(OP_NONE) {} /// == operator. bool operator==(const Self& aiterator) const { return ((*this==mmap->null_descriptor) && (aiterator==mmap->null_descriptor)) || (mfirst_dart == aiterator.mfirst_dart && static_cast(*this)== static_cast(aiterator)); } /// != operator. bool operator!=(const Self& aiterator) const { return !operator==(aiterator); } /// Accessor to the initial dart of the iterator. Dart_descriptor get_first_dart() const { return mfirst_dart; } /// Accessor to the combinatorial map. Map* get_combinatorial_map() const { return mmap; } /// Rewind of the iterator to its beginning. void rewind() { set_current_dart(mfirst_dart); mprev_op = OP_NONE; } /// Test if the iterator is at its end. bool cont() const { return this->get_current()!=mmap->null_descriptor; } /// Get the previous operation used for the last ++. OperationState prev_operation() const { return mprev_op; } protected: /// Set the current dart to a given dart void set_current_dart(Dart_descriptor adart) { this->set_current(adart); } private: /// operator -- in private to invalidate the base operator. Self& operator--() { return *this; } /// operator -- in private to invalidate the base operator. Self operator--(int) { return *this; } protected: /// test if adart->beta(ai) exists and is not marked for amark bool is_unmarked(Dart_descriptor adart, unsigned int ai, size_type amark) const { return !mmap->is_marked(mmap->beta(adart,ai), amark); } /// test if adart->beta(ai)->beta(aj) exists bool exist_betaij(Dart_descriptor adart, unsigned int ai, unsigned int aj) const { return !mmap->is_free(adart, ai) && !mmap->is_free(mmap->beta(adart, ai), aj); } /// test if adart->beta(ai)->beta(aj) exists and is not marked for amark bool is_unmarked2(Dart_descriptor adart, unsigned int ai, unsigned int aj, size_type amark) const { return !mmap->is_marked(mmap->beta(adart, ai, aj), amark); } protected: /// The map containing the darts to iterate on. Map* mmap; /// The initial dart of the iterator. Dart_descriptor mfirst_dart; /// The last operation used for the ++ operator. OperationState mprev_op; }; //**************************************************************************** /* Class CMap_extend_iterator which extend a given iterator by * adding Bi and by using a stack and a mark. * General case when Ite does not have already a stack. */ template class CMap_extend_iterator: public Ite { public: typedef CMap_extend_iterator Self; typedef Ite Base; typedef typename Base::Dart_descriptor Dart_descriptor; typedef typename Base::Map Map; typedef Tag_true Use_mark; typedef typename Map::size_type size_type; static_assert(Bi<=Map::dimension && std::is_same::value); public: /// Main constructor. CMap_extend_iterator(Map& amap, Dart_descriptor adart, size_type amark): Base(amap, adart), mmark_number(amark), minitial_dart(adart) { if ( minitial_dart!=amap.null_descriptor ) { this->mmap->mark_null_dart(mmark_number); this->mmap->mark(minitial_dart, mmark_number); if (!this->mmap->is_free(minitial_dart, Bi) && this->mmap->beta(minitial_dart, Bi)!=minitial_dart ) { mto_treat.push(this->mmap->beta(minitial_dart, Bi)); } } } /// Rewind of the iterator to its beginning. void rewind() { CGAL_assertion(mmark_number != Map::INVALID_MARK); Base::operator= ( Base(*this->mmap,minitial_dart) ); mto_treat = std::queue(); this->mmap->mark(minitial_dart, mmark_number); this->mmap->mark_null_dart(mmark_number); if (!this->mmap->is_free(minitial_dart, Bi) && this->mmap->beta(minitial_dart, Bi)!=minitial_dart) { mto_treat.push(this->mmap->beta(minitial_dart, Bi)); } } /// Prefix ++ operator. Self& operator++() { CGAL_assertion(mmark_number != Map::INVALID_MARK); CGAL_assertion(this->cont()); do { Base::operator++(); } while ( this->cont() && this->mmap->is_marked(*this, mmark_number) ); if ( !this->cont() ) { while ( !mto_treat.empty() && this->mmap->is_marked(mto_treat.front(), mmark_number)) { mto_treat.pop(); } if ( !mto_treat.empty() ) { Base::operator= ( Base(*this->mmap,mto_treat.front()) ); mto_treat.pop(); this->mprev_op = OP_POP; CGAL_assertion( !this->mmap->is_marked((*this), mmark_number) ); this->mmap->mark((*this), mmark_number); if ( !this->mmap->is_marked(this->mmap->beta(*this, Bi), mmark_number) ) { mto_treat.push(this->mmap->beta(*this, Bi)); } } } else { this->mmap->mark((*this), mmark_number); if ( !this->mmap->is_marked(this->mmap->beta(*this, Bi), mmark_number) ) { mto_treat.push(this->mmap->beta(*this, Bi)); } } return *this; } /// Postfix ++ operator. Self operator++(int) { Self res=*this; operator ++(); return res; } protected: /// Queue of darts to process. std::queue mto_treat; /// Index of the used mark. size_type mmark_number; /// Initial dart Dart_descriptor minitial_dart; }; //**************************************************************************** /* Class CMap_extend_iterator which extend a given iterator by * adding Bi and by using a stack and a mark. * Specialization when Ite has already a stack. */ template class CMap_extend_iterator: public Ite { public: typedef CMap_extend_iterator Self; typedef Ite Base; typedef typename Base::Dart_descriptor Dart_descriptor; typedef typename Base::Map Map; typedef Tag_true Use_mark; typedef typename Map::size_type size_type; /// Main constructor. CMap_extend_iterator(Map& amap, Dart_descriptor adart, size_type amark): Base(amap, adart, amark) { if ( this->minitial_dart!=amap.null_descriptor && !this->mmap->is_free(this->minitial_dart, Bi) && this->mmap->beta(this->minitial_dart, Bi)!=this->minitial_dart ) { this->mto_treat.push(this->mmap->beta(this->minitial_dart, Bi)); } } /// Rewind of the iterator to its beginning. void rewind() { CGAL_assertion(this->mmark_number != Map::INVALID_MARK); Base::rewind(); if ( !this->mmap->is_free(this->minitial_dart, Bi) && this->mmap->beta(this->minitial_dart, Bi)!=this->minitial_dart ) { this->mto_treat.push(this->mmap->beta(this->minitial_dart, Bi)); } } /// Prefix ++ operator. Self& operator++() { Base::operator++(); if ( this->cont() ) { CGAL_assertion( this->mmap->is_marked(*this, this->mmark_number) ); if ( !this->mmap->is_marked(this->mmap->beta(*this, Bi), this->mmark_number) ) { this->mto_treat.push(this->mmap->beta(*this, Bi)); } } return *this; } /// Postfix ++ operator. Self operator++(int) { Self res=*this; operator ++(); return res; } }; //**************************************************************************** //* Class CMap_non_basic_iterator allows to transform a basic_iterator onto //* a non basic one, depending if the basic iterator uses mark or not. template class CMap_non_basic_iterator; //**************************************************************************** template class CMap_non_basic_iterator: public Base_ { public: typedef CMap_non_basic_iterator Self; typedef Base_ Base; typedef typename Base::Map Map; typedef typename Base::Dart_descriptor Dart_descriptor; /// True iff this iterator is basic typedef Tag_false Basic_iterator; typedef typename Map::size_type size_type; static_assert(std::is_same::value); /// Main constructor. CMap_non_basic_iterator(Map& amap, Dart_descriptor adart1): Base(amap, adart1, amap.get_new_mark()) {} /// Destructor. ~CMap_non_basic_iterator() noexcept(!CGAL_ASSERTIONS_ENABLED) { CGAL_destructor_assertion( this->mmark_number!=Map::INVALID_MARK ); if (this->mmap->get_number_of_times_mark_reserved (this->mmark_number)==1) unmark_treated_darts(); this->mmap->free_mark(this->mmark_number); this->mmark_number = Map::INVALID_MARK; // To avoid basic class to try to unmark darts. } /// Copy constructor. CMap_non_basic_iterator(const Self& aiterator): Base(aiterator) { this->mmap->share_a_mark(this->mmark_number); } /// Assignment operator. Self& operator=(const Self& aiterator) { if (this != &aiterator) { if (this->mmap->get_number_of_times_mark_reserved (this->mmark_number)==1) unmark_treated_darts(); this->mmap->free_mark(this->mmark_number); this->mmark_number = Map::INVALID_MARK; Base::operator=(aiterator); this->mmap->share_a_mark(this->mmark_number); } return *this; } /// Rewind of the iterator to its beginning. void rewind() { unmark_treated_darts(); Base::rewind(); } using Base::operator++; /// Postfix ++ operator. Self operator++(int) { Self res=*this; operator ++(); return res; } protected: /// Unmark all the marked darts during the iterator. void unmark_treated_darts() { if (this->mmap->is_whole_map_unmarked(this->mmark_number)) return; this->mmap->negate_mark(this->mmark_number); if (this->mmap->is_whole_map_unmarked(this->mmark_number)) return; Base::rewind(); while (this->mmap->number_of_unmarked_darts(this->mmark_number) > 0) this->operator++(); this->mmap->negate_mark(this->mmark_number); CGAL_assertion(this->mmap->is_whole_map_unmarked(this->mmark_number)); } }; //**************************************************************************** template class CMap_non_basic_iterator: public Base_ { public: typedef CMap_non_basic_iterator Self; typedef Base_ Base; typedef typename Base::Map Map; typedef typename Base::Dart_descriptor Dart_descriptor; /// True iff this iterator is basic typedef Tag_false Basic_iterator; static_assert(std::is_same::value); /// Main constructor. CMap_non_basic_iterator(Map& amap, Dart_descriptor adart): Base(amap, adart) {} }; //**************************************************************************** template struct CMap_range { typedef It iterator; typedef Const_it const_iterator; CMap_range(Map_ &amap, typename Map_::Dart_descriptor adart) : mmap(amap), mdart(adart), msize(0) {} iterator begin() { return iterator(mmap,mdart); } iterator end() { return iterator(mmap,mmap.null_descriptor); } const_iterator begin() const { return const_iterator(mmap,mdart); } const_iterator end() const { return const_iterator(mmap,mmap.null_descriptor); } typename Map_::size_type size() const { if (msize==0) for ( const_iterator it=begin(), itend=end(); it!=itend; ++it) ++msize; return msize; } bool empty() const { return mmap.is_empty(); } private: Map_ & mmap; typename Map_::Dart_descriptor mdart; mutable typename Map_::size_type msize; }; //**************************************************************************** template struct CMap_range { typedef CMap_range Base_cmap_range; typedef It iterator; typedef Const_it const_iterator; typedef typename Map_::size_type size_type; CMap_range(Map_ &amap, typename Map_::Dart_descriptor adart, size_type amark=Map_::INVALID_MARK): mmap(amap), mdart(adart), msize(0), mmark(amark) {} iterator begin() { return iterator(mmap,mdart,mmark); } iterator end() { return iterator(mmap,mmap.null_descriptor,mmark); } const_iterator begin() const { return const_iterator(mmap,mdart,mmark); } const_iterator end() const { return const_iterator(mmap,mmap.null_descriptor,mmark); } typename Map_::size_type size() const { if (msize==0) for ( CMap_non_basic_iterator it(mmap,mdart); it.cont(); ++it ) ++msize; return msize; } bool empty() const { return mmap.is_empty(); } private: Map_ & mmap; typename Map_::Dart_descriptor mdart; mutable typename Map_::size_type msize; size_type mmark; }; //**************************************************************************** template struct CMap_const_range { typedef Const_it const_iterator; CMap_const_range(const Map_ &amap, typename Map_::Dart_const_descriptor adart): mmap(amap), mdart(adart), msize(0) {} const_iterator begin() const { return const_iterator(mmap,mdart); } const_iterator end() const { return const_iterator(mmap,mmap.null_descriptor); } typename Map_::size_type size() const { if (msize==0) for ( const_iterator it=begin(), itend=end(); it!=itend; ++it) ++msize; return msize; } bool empty() const { return mmap.is_empty(); } private: const Map_ & mmap; typename Map_::Dart_const_descriptor mdart; mutable typename Map_::size_type msize; }; //**************************************************************************** template struct CMap_const_range { typedef Const_it const_iterator; typedef typename Map_::size_type size_type; CMap_const_range(const Map_ &amap, typename Map_::Dart_const_descriptor adart, size_type amark=Map_::INVALID_MARK): mmap(amap), mdart(adart), msize(0), mmark(amark) {} const_iterator begin() const { return const_iterator(mmap,mdart,mmark); } const_iterator end() const { return const_iterator(mmap,mmap.null_descriptor,mmark); } typename Map_::size_type size() const { if (msize==0) for ( CMap_non_basic_iterator it(mmap,mdart); it.cont(); ++it ) ++msize; return msize; } bool empty() const { return mmap.is_empty(); } private: const Map_ & mmap; typename Map_::Dart_const_descriptor mdart; mutable typename Map_::size_type msize; size_type mmark; }; //**************************************************************************** } // namespace CGAL #include //****************************************************************************** #endif // CGAL_COMBINATORIAL_MAP_ITERATORS_BASE_HH //******************************************************************************