basctl/source/basicide/breakpoint.cxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  11  *   Licensed to the Apache Software Foundation (ASF) under one or more
  12  *   contributor license agreements. See the NOTICE file distributed
  13  *   with this work for additional information regarding copyright
  14  *   ownership. The ASF licenses this file to you under the Apache
  15  *   License, Version 2.0 (the "License"); you may not use this file
  16  *   except in compliance with the License. You may obtain a copy of
  17  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  18  */
  19
  20 #include "breakpoint.hxx"
  21
  22 #include <basic/sbmod.hxx>
  23 #include <tools/debug.hxx>
  24
  25
  26 namespace basctl
  27 {
  28
  29 BreakPointList::BreakPointList()
  30 {}
  31
  32 BreakPointList::BreakPointList(BreakPointList const & rList)
  33 {
  34     maBreakPoints.insert(maBreakPoints.end(), rList.maBreakPoints.begin(), rList.maBreakPoints.end());
  35 }
  36
  37 BreakPointList::~BreakPointList()
  38 {
  39 }
  40
  41 void BreakPointList::reset()
  42 {
  43     maBreakPoints.clear();
  44 }
  45
  46 void BreakPointList::transfer(BreakPointList & rList)
  47 {
  48     maBreakPoints = std::move(rList.maBreakPoints);
  49 }
  50
  51 void BreakPointList::InsertSorted(BreakPoint aNewBrk)
  52 {
  53     auto it = std::find_if(maBreakPoints.begin(), maBreakPoints.end(),
  54         [&aNewBrk](const BreakPoint& rBreakPoint) { return aNewBrk.nLine <= rBreakPoint.nLine; });
  55     if (it != maBreakPoints.end())
  56     {
  57         DBG_ASSERT( it->nLine != aNewBrk.nLine, "BreakPoint exists already!" );
  58         maBreakPoints.insert( it, aNewBrk );
  59         return;
  60     }
  61     // no insert position found => LIST_APPEND
  62     maBreakPoints.push_back( aNewBrk );
  63 }
  64
  65 void BreakPointList::SetBreakPointsInBasic(SbModule* pModule)
  66 {
  67     pModule->ClearAllBP();
  68
  69     for (const BreakPoint& rBrk : maBreakPoints)
  70     {
  71         if ( rBrk.bEnabled )
  72             pModule->SetBP( rBrk.nLine );
  73     }
  74 }
  75
  76 BreakPoint* BreakPointList::FindBreakPoint(sal_uInt16 nLine)
  77 {
  78     for (BreakPoint& rBrk : maBreakPoints)
  79     {
  80         if ( rBrk.nLine == nLine )
  81             return &rBrk;
  82     }
  83     return nullptr;
  84 }
  85
  86 void BreakPointList::AdjustBreakPoints(sal_uInt16 nLine, bool bInserted)
  87 {
  88     for ( size_t i = 0; i < maBreakPoints.size(); )
  89     {
  90         BreakPoint& rBrk = maBreakPoints[ i ];
  91         bool bDelBrk = false;
  92         if ( rBrk.nLine == nLine )
  93         {
  94             if ( bInserted )
  95                 rBrk.nLine++;
  96             else
  97                 bDelBrk = true;
  98         }
  99         else if ( rBrk.nLine > nLine )
 100         {
 101             if ( bInserted )
 102                 rBrk.nLine++;
 103             else
 104                 rBrk.nLine--;
 105         }
 106
 107         if ( bDelBrk )
 108         {
 109             maBreakPoints.erase(maBreakPoints.begin() + i);
 110         }
 111         else
 112         {
 113             ++i;
 114         }
 115     }
 116 }
 117
 118 void BreakPointList::ResetHitCount()
 119 {
 120     for (BreakPoint& rBrk : maBreakPoints)
 121     {
 122         rBrk.nHitCount = 0;
 123     }
 124 }
 125
 126 void BreakPointList::remove(const BreakPoint* ptr)
 127 {
 128     auto i = std::find_if(maBreakPoints.begin(), maBreakPoints.end(),
 129         [&ptr](const BreakPoint& rBreakPoint) { return ptr == &rBreakPoint; });
 130     if (i != maBreakPoints.end())
 131         maBreakPoints.erase( i );
 132     return;
 133 }
 134
 135 void BreakPointList::remove(size_t idx)
 136 {
 137     maBreakPoints.erase( maBreakPoints.begin() + idx );
 138 }
 139
 140 size_t BreakPointList::size() const
 141 {
 142     return maBreakPoints.size();
 143 }
 144
 145 BreakPoint& BreakPointList::at(size_t i)
 146 {
 147     return maBreakPoints[ i ];
 148 }
 149
 150 const BreakPoint& BreakPointList::at(size_t i) const
 151 {
 152     return maBreakPoints[ i ];
 153 }
 154
 155 } // namespace basctl
 156
 157 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */