edge.h

Go to the documentation of this file.

// Common Text Transformation Library
// Copyright (C) 1997-2006 by Igor Kholodov. 
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the
// Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
//
// mailto:cttl@users.sourceforge.net
// http://sourceforge.net/projects/cttl/

// edge.h

#ifndef _CTTL_EDGE_H_INCLUDED_
#define _CTTL_EDGE_H_INCLUDED_

#include "const_edge.h"

namespace cttl {

template< typename PolicyT = policy_default, typename StringT = CTTL_STD_STRING >
class edge : public const_edge< PolicyT, StringT > {
public:
    typedef StringT string_T;

    typedef typename StringT::value_type char_T;

    typedef xtl_mutable_offset_manager< StringT > offset_manager_T;

    typedef PolicyT policy_T;

    typedef typename PolicyT::strict_policy_T strict_policy_T;

    typedef edge< strict_policy_T, StringT > strict_edge_T;

    typedef node< StringT > node_T;


    // Base class constructors not inherited, so they need to be redefined

    edge( input< StringT >& inp_, int start_, int finish_ )
        :
        const_edge< PolicyT, StringT >( inp_, start_, finish_ )
    {
    }

    edge( node< StringT >& node_first_, node< StringT >& node_second_ )
        :
        const_edge< PolicyT, StringT >( node_first_, node_second_ )
    {
    }

    template< typename Other_policyT >
    edge( const_edge< Other_policyT, StringT > const& other_ )
        :
        const_edge< PolicyT, StringT >( other_ )
    {
    }

    edge( const_edge< PolicyT, StringT > const& other_ )
        :
        const_edge< PolicyT, StringT >( other_ )
    {
    }

    template< typename Other_policyT >
    edge( const_edge< Other_policyT, StringT > const& other_, PolicyT& policy_ )
        :
        const_edge< PolicyT, StringT >( other_, policy_ )
    {
    }

    void text( StringT const& str_ )
    {
        text_replace( str_ );
    }

    void text( const_edge< PolicyT, StringT > const& other_ )
    {
        text_replace(
            other_.parent().container().text(),
            other_.first.offset(),
            other_.second.offset()
            );
    }

    StringT text() const
    {
        return const_edge< PolicyT, StringT >::text();
    }

    void text_swap( edge< PolicyT, StringT >& other_ )
    {
        const StringT str_this = text();
        text( other_.text() );
        other_.text( str_this );
    }

    // Overloaded assignment operators are not inherited, so they need to be redefined

    edge< PolicyT, StringT >& operator=( const_edge< PolicyT, StringT > const& other_ )
    {
        const_edge< PolicyT, StringT >::operator=( other_ );
        return *this;
    }

    edge< PolicyT, StringT >& operator= ( StringT const& str_ )
    {
        text( str_ );
        return *this;
    }

    // Conversion operators are inherited.
    // typedefs are inherited

private:
    void text_replace( StringT const& str_ )
    {
        size_t str_length = str_.length();
        size_t offset_from_i = this->first.offset();
        size_t offset_to_i = this->second.offset();

        assert( offset_from_i <= offset_to_i );
        assert( offset_from_i <= this->parent().container().text().length() );
        assert( ( offset_to_i - offset_from_i ) <= this->parent().container().text().length() );

        this->parent().container().text().replace(
            offset_from_i,
            offset_to_i - offset_from_i,
            str_
            );
        
        int delta_offset = 
            int( offset_from_i - offset_to_i ) // negative length of old underlying substring
            +
            str_length                  // positive length of new underlying substring
            ;

        if ( !delta_offset )
            return; // nothing else to do

        this->space_policy().region_erase(
            offset_from_i,
            offset_to_i
            );
        
        this->space_policy().region_adjust(
            offset_from_i,
            delta_offset
            );

        size_t idx = 0;
        if ( delta_offset < 0 ) {
            xtl_identity_collapse< StringT > collapse(
                offset_to_i,
                delta_offset
                );

            for ( idx = 0; idx < this->parent().container().identity_vector().size(); ++idx )
                collapse.adjust( this->parent().container().identity_vector()[ idx ] );

            for ( idx = 0; idx < this->parent().container().offset_stack().size(); ++idx )
                collapse.adjust( this->parent().container().offset_stack()[ idx ] );

        } else {
            xtl_identity_insert_go< StringT > insert_and_go(
                offset_to_i,
                delta_offset
                );

            for ( idx = 0; idx < this->parent().container().identity_vector().size(); ++idx )
                insert_and_go.adjust( this->parent().container().identity_vector()[ idx ] );

            for ( idx = 0; idx < this->parent().container().offset_stack().size(); ++idx )
                insert_and_go.adjust( this->parent().container().offset_stack()[ idx ] );

        }

        this->first.offset( offset_from_i );
    }

    void text_replace(
        StringT const& str_,
        size_t source_from_offset_,
        size_t source_to_offset_
        )
    {
        size_t str_length = str_.length();
        size_t offset_from_i = this->first.offset();
        size_t offset_to_i = this->second.offset();

        assert( offset_from_i <= offset_to_i );
        assert( offset_from_i <= this->parent().container().text().length() );
        assert( ( offset_to_i - offset_from_i ) <= this->parent().container().text().length() );

        str_length = source_to_offset_ - source_from_offset_;
        this->parent().container().text().replace(
            offset_from_i,
            offset_to_i - offset_from_i,
            str_,
            source_from_offset_,
            str_length
            );
        
        int delta_offset = 
            offset_from_i - offset_to_i // negative length of old underlying substring
            +
            str_length                  // positive length of new underlying substring
            ;

        if ( !delta_offset )
            return; // nothing else to do

        this->space_policy().region_erase(
            offset_from_i,
            offset_to_i
            );
        
        this->space_policy().region_adjust(
            offset_from_i,
            delta_offset
            );

        size_t idx = 0;
        if ( delta_offset < 0 ) {
            xtl_identity_collapse< StringT > collapse(
                offset_to_i,
                delta_offset
                );

            for ( idx = 0; idx < this->parent().container().identity_vector().size(); ++idx )
                collapse.adjust( this->parent().container().identity_vector()[ idx ] );

            for ( idx = 0; idx < this->parent().container().offset_stack().size(); ++idx )
                collapse.adjust( this->parent().container().offset_stack()[ idx ] );

        } else {
            xtl_identity_insert_go< StringT > insert_and_go(
                offset_to_i,
                delta_offset
                );

            for ( idx = 0; idx < this->parent().container().identity_vector().size(); ++idx )
                insert_and_go.adjust( this->parent().container().identity_vector()[ idx ] );

            for ( idx = 0; idx < this->parent().container().offset_stack().size(); ++idx )
                insert_and_go.adjust( this->parent().container().offset_stack()[ idx ] );

        }

        this->first.offset( offset_from_i );
    }


};  // class edge

}   // namespace cttl


#endif // _CTTL_EDGE_H_INCLUDED_

---