bytearraytableranges.cpp

Go to the documentation of this file.

/*
    This file is part of the Okteta Gui library, made within the KDE community.

    Copyright 2003,2008-2009 Friedrich W. H. Kossebau <kossebau@kde.org>

    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) version 3, or any
    later version accepted by the membership of KDE e.V. (or its
    successor approved by the membership of KDE e.V.), which shall
    act as a proxy defined in Section 6 of version 3 of the license.

    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, see <http://www.gnu.org/licenses/>.
*/

#include "bytearraytableranges.h"

// lib
#include "bytearraytablelayout.h"
// Okteta core
#include <arraychangemetricslist.h>


namespace Okteta
{

ByteArrayTableRanges::ByteArrayTableRanges( ByteArrayTableLayout* layout )
 : mModified( false ),
   mLayout( layout )
{
}


void ByteArrayTableRanges::reset()
{
  mSelection.cancel();
  FirstWordSelection.unset();
  mMarking.unset();
  ChangedRanges.clear();
}


void ByteArrayTableRanges::setMarking( const AddressRange& marking )
{
    if( mMarking == marking )
        return;

    const bool hadMarking = mMarking.isValid();
    if( hadMarking )
        addChangedRange( mMarking );

    mMarking = marking;

    const bool hasNewMarking = mMarking.isValid();
    if( hasNewMarking )
        addChangedRange( mMarking );
}


void ByteArrayTableRanges::removeFurtherSelections()
{
  for( int i = 1; i < noOfSelections(); ++i )
    removeSelection( i );
}


void ByteArrayTableRanges::setSelection( const AddressRange& selection )
{
  bool Changed = mSelection.isValid();
  if( Changed )
    addChangedRange( mSelection.range() );
  mSelection = selection;
  addChangedRange( mSelection.range() );
}

void ByteArrayTableRanges::setSelectionStart( Address startIndex )
{
  bool Changed = mSelection.isValid();
  if( Changed )
    addChangedRange( mSelection.range() );

  mSelection.setStart( startIndex );
}


void ByteArrayTableRanges::setSelectionEnd( Address EndIndex )
{
  AddressRange OldSelection = mSelection.range();
  mSelection.setEnd( EndIndex );

  // TODO: think about rather building a diff of the sections
  if( !OldSelection.isValid() )
  {
    addChangedRange( mSelection.range() );
    return;
  }
  if( !mSelection.isValid() )
  {
    addChangedRange( OldSelection );
    return;
  }

  if( OldSelection == mSelection.range() )
    return;
  Address CS;
  Address CE;
  // changes at the end?
  if( mSelection.start() == OldSelection.start() )
  {
    CS = OldSelection.nextBehindEnd();
    CE = mSelection.end();
    if( CE < CS )
    {
      CS = mSelection.nextBehindEnd();
      CE = OldSelection.end();
    }
  }
  // changes at the start?
  else if( mSelection.end() == OldSelection.end() )
  {
    CS = OldSelection.start();
    CE = mSelection.nextBeforeStart();
    if( CE < CS )
    {
      CS = mSelection.start();
      CE = OldSelection.nextBeforeStart();
    }
  }
  // change over the anchor
  else
  {
    CS = OldSelection.start();
    CE = mSelection.end();
    if( CE < CS )
    {
      CS = mSelection.start();
      CE = OldSelection.end();
    }
  }
  AddressRange C( CS, CE );

  bool Changed = C.isValid();
  if( Changed )
    addChangedRange( C );
  return;
}


AddressRange ByteArrayTableRanges::removeSelection( int id )
{
  if( id > 0 )
    return AddressRange();

  AddressRange range = mSelection.range();
  bool Changed = range.isValid();
  if( Changed )
    addChangedRange( range );

  mSelection.cancel();
  FirstWordSelection.unset();

  return range;
}


bool ByteArrayTableRanges::overlapsSelection( Address FirstIndex, Address LastIndex, Address* startIndex, Address* endIndex ) const
{
  if( mSelection.range().overlaps(AddressRange(FirstIndex,LastIndex)) )
  {
    *startIndex = mSelection.start();
    *endIndex = mSelection.end();
    return true;
  }
  return false;
}


bool ByteArrayTableRanges::overlapsMarking( Address FirstIndex, Address LastIndex, Address* startIndex, Address* endIndex ) const
{
  if( mMarking.overlaps(AddressRange(FirstIndex,LastIndex)) )
  {
    *startIndex = mMarking.start();
    *endIndex = mMarking.end();
    return true;
  }
  return false;
}


const AddressRange *ByteArrayTableRanges::firstOverlappingSelection( const AddressRange &Range ) const
{
  return mSelection.range().overlaps(Range) ? &mSelection.range() : 0;
}


const AddressRange *ByteArrayTableRanges::overlappingMarking( const AddressRange &Range ) const
{
  return mMarking.overlaps(Range) ? &mMarking : 0;
}

/*
bool ByteArrayTableRanges::overlapsChanges( Address FirstIndex, Address LastIndex, Address* startIndex, Address* endIndex ) const
{
  for( CoordRangeList::const_iterator S=ChangedRanges.begin(); S!=ChangedRanges.end(); ++S )
  {
    if( (*S).overlaps(KBuff(FirstIndex,LastIndex)) )
    {
      *startIndex = (*S).start();
      *endIndex = (*S).end();
      return true;
    }
  }

  return false;
}

bool ByteArrayTableRanges::overlapsChanges( AddressRange Indizes, AddressRange *ChangedRange ) const
{
  for( AddressRangeList::const_iterator S=ChangedRanges.begin(); S!=ChangedRanges.end(); ++S )
  {
    if( (*S).overlaps(Indizes) )
    {
      *ChangedRange = *S;
      return true;
    }
  }

  return false;
}
*/
bool ByteArrayTableRanges::overlapsChanges( const CoordRange &Range, CoordRange *ChangedRange ) const
{
  // TODO: add a lastusedrange pointer for quicker access
  for( CoordRangeList::ConstIterator R=ChangedRanges.begin(); R!=ChangedRanges.end(); ++R )
  {
    if( (*R).overlaps(Range) )
    {
      *ChangedRange = *R;
      return true;
    }
  }

  return false;
}

void ByteArrayTableRanges::addChangedOffsetLines( const LineRange& changedLines )
{
    if( mChangedOffsetLines.isEmpty() )
    {
        mChangedOffsetLines = changedLines;
        mModified = true;
    }
    else
        mChangedOffsetLines.extendTo( changedLines );
}

void ByteArrayTableRanges::addChangedRange( Address startIndex, Address endIndex )
{
  addChangedRange( AddressRange(startIndex,endIndex) );
}


void ByteArrayTableRanges::addChangedRange( const AddressRange& range )
{
// kDebug() << "adding change range "<<S.start()<<","<<S.end();
  addChangedRange( mLayout->coordRangeOfIndizes(range) );
}


void ByteArrayTableRanges::addChangedRange( const CoordRange& range )
{
  ChangedRanges.addCoordRange( range );
// kDebug() << "as range "<<NewRange.start().pos()<<","<<NewRange.start().line()<<"-"
// <<NewRange.end().pos()<<","<<NewRange.end().line()<<endl;

  mModified = true;
}

void ByteArrayTableRanges::resetChangedRanges()
{
    mChangedOffsetLines.unset();
  ChangedRanges.clear();
  mModified = false;
}


void ByteArrayTableRanges::setFirstWordSelection( const AddressRange& range )
{
  FirstWordSelection = range;
  setSelection( FirstWordSelection );
}

 void ByteArrayTableRanges::ensureWordSelectionForward( bool Forward )
 {
   // in the anchor not on the right side?
   if( mSelection.isForward() != Forward )
   {
     setSelectionEnd( Forward ? FirstWordSelection.start() : FirstWordSelection.nextBehindEnd() );

     mSelection.setForward( Forward );
   }
 }


void ByteArrayTableRanges::adaptToChanges( const ArrayChangeMetricsList& changeList, Size oldLength )
{
    foreach( const ArrayChangeMetrics& change, changeList )
    {
        //TODO: change parameters to ArrayChangeMetrics
        switch( change.type() )
        {
        case ArrayChangeMetrics::Replacement:
        {
            oldLength += change.lengthChange();
            const Address offset = change.offset();
            const Size diff = change.lengthChange();
            const Address behindLast = (diff == 0) ? offset + change.insertLength() :
                                       (diff < 0) ?  oldLength - diff :
                                                     oldLength;
            addChangedRange( offset, behindLast-1 );

            if( mSelection.isValid() )
                mSelection.adaptToReplacement( offset, change.removeLength(), change.insertLength() );
            if( mMarking.isValid() )
                mMarking.adaptToReplacement( offset, change.removeLength(), change.insertLength() );
            break;
        }
        case ArrayChangeMetrics::Swapping:
            addChangedRange( change.offset(), change.secondEnd() );

            if( mSelection.isValid() )
                mSelection.adaptToSwap( change.offset(), change.secondStart(), change.secondLength() );
            // TODO:
//             if( mMarking.isValid() )
//                 mMarking.adaptToSwap( change.offset(), change.secondStart(), change.secondLength() );
        default:
            ;
        }
    }
}

ByteArrayTableRanges::~ByteArrayTableRanges()
{
}

}