File size: 10,382 Bytes
a5ffdcd | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 | /****************************************************************************
**
** This file is part of the LibreCAD project, a 2D CAD program
**
** Copyright (C) 2010 R. van Twisk (librecad@rvt.dds.nl)
** Copyright (C) 2001-2003 RibbonSoft. All rights reserved.
**
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file gpl-2.0.txt included in the
** packaging of this file.
**
** This program 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.
**
** You should have received a copy of the GNU General Public License
** along with this program; if not, write to the Free Software
** Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
**
** This copyright notice MUST APPEAR in all copies of the script!
**
**********************************************************************/
#include "rs_blocklist.h"
#include <QRegularExpression>
#include <iostream>
#include "rs_block.h"
#include "rs_blocklistlistener.h"
#include "rs_debug.h"
/**
* Constructor.
*
* @param owner true if this is the owner of the blocks added.
* If so, the blocks will be deleted when the block
* list is deleted.
*/
RS_BlockList::RS_BlockList(bool owner) {
m_owner = owner;
//blocks.setAutoDelete(owner);
m_activeBlock = nullptr;
setModified(false);
}
/**
* Removes all blocks in the blocklist.
*/
void RS_BlockList::clear() {
m_blocks.clear();
m_activeBlock = nullptr;
setModified(true);
}
/**
* Activates the given block.
* Listeners are notified.
*/
void RS_BlockList::activate(const QString& name) {
RS_DEBUG->print("RS_BlockList::activateBlock");
activate(find(name));
}
/**
* Activates the given block.
* Listeners are notified.
*/
void RS_BlockList::activate(RS_Block* block) {
RS_DEBUG->print("RS_BlockList::activateBlock");
m_activeBlock = block;
}
/**
* Adds a block to the block list. If a block with the same name
* exists already, the given block will be deleted if the blocklist
* owns the blocks.
*
* @param notify true if you want listeners to be notified.
*
* @return false: block already existed and was deleted.
*/
bool RS_BlockList::add(RS_Block* block, bool notify) {
RS_DEBUG->print("RS_BlockList::add()");
if (!block) {
return false;
}
// check if block already exists:
RS_Block* b = find(block->getName());
if (!b) {
m_blocks.append(block);
if (notify) {
addNotification();
}
setModified(true);
return true;
} else {
if (m_owner) {
delete block;
block = nullptr;
}
return false;
}
}
/**
* Notifies the listeners about blocks that were added. This can be
* used after adding a lot of blocks without auto-update or simply
* to force an update of GUI blocklists.
*/
void RS_BlockList::addNotification() {
for(auto l: m_blockListListeners){
l->blockAdded(nullptr);
}
}
/**
* Removes a block from the list.
* Listeners are notified after the block was removed from
* the list but before it gets deleted.
*/
void RS_BlockList::remove(RS_Block* block) {
RS_DEBUG->print("RS_BlockList::removeBlock()");
// here the block is removed from the list but not deleted
m_blocks.removeOne(block);
for(auto l: m_blockListListeners){
l->blockRemoved(block);
}
setModified(true);
// / *
// activate an other block if necessary:
if (m_activeBlock==block) {
//activate(blocks.first());
m_activeBlock = nullptr;
}
// * /
// now it's save to delete the block
if (m_owner) {
delete block;
}
}
/**
* Tries to rename the given block to 'name'. Block names are unique in the
* block list.
*
* @retval true block was successfully renamed.
* @retval false block couldn't be renamed.
*/
bool RS_BlockList:: rename(RS_Block* block, const QString& name) {
if (block) {
if (!find(name)) {
QString oldName = block->getName();
block->setName(name);
setModified(true);
// when the renamed block is nested within other block, we need to rename its inserts as well
for(RS_Block* b: m_blocks) {
b->renameInserts(oldName, name);
}
return true;
}
}
return false;
}
/**
* Changes a block's attributes. The attributes of block 'block'
* are copied from block 'source'.
* Listeners are notified.
*/
/*
void RS_BlockList::editBlock(RS_Block* block, const RS_Block& source) {
*block = source;
for (unsigned i=0; i<blockListListeners.count(); ++i) {
RS_BlockListListener* l = blockListListeners.at(i);
l->blockEdited(block);
}
}
*/
/**
* @return Pointer to the block with the given name or
* \p nullptr if no such block was found.
*/
RS_Block* RS_BlockList::find(const QString& name) {
try {
RS_DEBUG->print(RS_Debug::D_DEBUGGING, "RS_BlockList::find(): %s", name.toLatin1().constData());
}
catch(...) {
RS_DEBUG->print(RS_Debug::D_DEBUGGING, "RS_BlockList::find(): wrong name to find");
return nullptr;
}
// Todo : reduce this from O(N) to O(log(N)) complexity based on sorted list or hash
//DFS
for(RS_Block* b: m_blocks) {
if (b->getName()==name) {
return b;
}
}
RS_DEBUG->print(RS_Debug::D_DEBUGGING, "RS_BlockList::find(): bad");
return nullptr;
}
RS_Block* RS_BlockList::findCaseInsensitive(const QString& name) const {
try {
RS_DEBUG->print(RS_Debug::D_DEBUGGING, "RS_BlockList::find(): %s", name.toLatin1().constData());
}
catch(...) {
RS_DEBUG->print(RS_Debug::D_DEBUGGING, "RS_BlockList::find(): wrong name to find");
return nullptr;
}
// Todo : reduce this from O(N) to O(log(N)) complexity based on sorted list or hash
//DFS
for(RS_Block* b: m_blocks) {
if (b->getName().compare(name, Qt::CaseInsensitive) == 0) {
return b;
}
}
RS_DEBUG->print(RS_Debug::D_DEBUGGING, "RS_BlockList::find(): bad");
return nullptr;
}
/**
* Finds a new unique block name.
*
* @param suggestion Suggested name the new name will be based on.
*/
QString RS_BlockList::newName(const QString& suggestion) {
// qDebug()<<"begin: suggestion: "<<suggestion;
if(!find(suggestion))
return suggestion;
QString name=suggestion;
QRegularExpression const rx(R"(-\d+$)");
int index=rx.match(name).lastCapturedIndex();
int i=-1;
if(index>0){
i=name.mid(index+1).toInt();
name=name.mid(0, index);
}
for(RS_Block* b: m_blocks){
index=b->getName().lastIndexOf(rx);
if(index<0) continue;
QString const part1= b->getName().mid(0, index);
if(part1 != name) continue;
i=std::max(b->getName().mid(index+1).toInt(),i);
}
// qDebug()<<QString("%1-%2").arg(name).arg(i+1);
return QString("%1-%2").arg(name).arg(i+1);
}
/**
* Switches on / off the given block.
* Listeners are notified.
*/
void RS_BlockList::toggle(const QString& name) {
toggle(find(name));
}
/**
* Switches on / off the given block.
* Listeners are notified.
*/
void RS_BlockList::toggle(RS_Block* block) {
if (!block) {
return;
}
block->toggle();
// TODO LordOfBikes: when block attributes are saved, activate this
//setModified(true);
// Notify listeners:
for(auto l: m_blockListListeners){
l->blockToggled(block);
}
}
/**
* Freezes or defreezes all blocks.
*
* @param freeze true: freeze, false: defreeze
*/
void RS_BlockList::freezeAll(bool freeze) {
for (int l=0; l<count(); l++) {
if (at(l)->isVisibleInBlockList()) {
at(l)->freeze(freeze);
}
}
// TODO LordOfBikes: when block attributes are saved, activate this
//setModified(true);
for(auto l: m_blockListListeners){
l->blockToggled(nullptr);
}
}
/**
* Switches on / off the given block.
* Listeners are notified.
*/
/*
void RS_BlockList::toggleBlock(const QString& name) {
RS_Block* block = findBlock(name);
block->toggle();
// Notify listeners:
for (unsigned i=0; i<blockListListeners.count(); ++i) {
RS_BlockListListener* l = blockListListeners.at(i);
l->blockToggled(block);
}
}
*/
/**
* adds a BlockListListener to the list of listeners. Listeners
* are notified when the block list changes.
*/
void RS_BlockList::addListener(RS_BlockListListener* listener) {
for (auto const l: m_blockListListeners) {
if (l == listener) {
return;
}
}
m_blockListListeners.append(listener);
}
/**
* removes a BlockListListener from the list of listeners.
*/
void RS_BlockList::removeListener(RS_BlockListListener* listener) {
m_blockListListeners.removeOne(listener);
}
int RS_BlockList::count() const{
return m_blocks.count();
}
/**
* @return Block at given position or nullptr if i is out of range.
*/
RS_Block* RS_BlockList::at(int i) {
return m_blocks.at(i);
}
RS_Block* RS_BlockList::at(int i) const{
return m_blocks.at(i);
}
QList<RS_Block*>::iterator RS_BlockList::begin()
{
return m_blocks.begin();
}
QList<RS_Block*>::iterator RS_BlockList::end()
{
return m_blocks.end();
}
QList<RS_Block*>::const_iterator RS_BlockList::begin()const
{
return m_blocks.begin();
}
QList<RS_Block*>::const_iterator RS_BlockList::end()const
{
return m_blocks.end();
}
//! @return The active block of nullptr if no block is activated.
RS_Block* RS_BlockList::getActive() const
{
return m_activeBlock;
}
/**
* Sets the block list modified status to 'm'.
*/
void RS_BlockList::setModified(bool m) {
m_modified = m;
// Update each block modified status,
// but only when the status is set to false.
if (m == false) {
for (auto b: m_blocks) {
b->setModifiedFlag(false);
}
}
// Notify listeners
for (auto l: m_blockListListeners) {
l->blockListModified(m);
}
}
/**
* @retval true The block list has been modified.
* @retval false The block list has not been modified.
*/
bool RS_BlockList::isModified() const {
return m_modified;
}
/**
* Dumps the blocks to stdout.
*/
std::ostream& operator << (std::ostream& os, RS_BlockList& b) {
os << "Blocklist: \n";
for (int i=0; i<b.count(); ++i) {
RS_Block* blk = b.at(i);
os << *blk << "\n";
}
return os;
}
|