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 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
// must be first
#include <canvas/debug.hxx>
#include <tools/diagnose_ex.h>
#include <canvas/verbosetrace.hxx>
#include <rtl/math.hxx>
#include <vcl/metaact.hxx>
#include <vcl/gdimtf.hxx>
#include <basegfx/numeric/ftools.hxx>
#include "drawshapesubsetting.hxx"
#include "drawshape.hxx"
#include <boost/bind.hpp>
#include <algorithm>
#include <functional>
#include <limits>
using namespace ::com::sun::star;
namespace slideshow
{
namespace internal
{
// Private methods
void DrawShapeSubsetting::ensureInitializedNodeTree() const
{
ENSURE_OR_THROW( mpMtf,
"DrawShapeSubsetting::ensureInitializedNodeTree(): Invalid mtf" );
if( mbNodeTreeInitialized )
return; // done, already initialized.
// init doctree vector
maActionClassVector.clear();
maActionClassVector.reserve( mpMtf->GetActionSize() );
// search metafile for text output
MetaAction* pCurrAct;
sal_Int32 nActionIndex(0);
sal_Int32 nLastTextActionIndex(0);
for( pCurrAct = mpMtf->FirstAction(); pCurrAct; pCurrAct = mpMtf->NextAction() )
{
// check for one of our special text doctree comments
switch( pCurrAct->GetType() )
{
case META_COMMENT_ACTION:
{
MetaCommentAction* pAct = static_cast<MetaCommentAction*>(pCurrAct);
// skip comment if not a special XTEXT... comment
if( pAct->GetComment().matchIgnoreAsciiCase( OString("XTEXT"), 0 ) )
{
// fill classification vector with NOOPs,
// then insert corresponding classes at
// the given index
maActionClassVector.resize( nActionIndex+1, CLASS_NOOP );
if( pAct->GetComment().equalsIgnoreAsciiCase("XTEXT_EOC") )
{
// special, because can happen
// in-between of portions - set
// character-end classificator at
// given index (relative to last text
// action).
const sal_Int32 nIndex( nLastTextActionIndex + pAct->GetValue() );
ENSURE_OR_THROW( static_cast< ::std::size_t >(nIndex) < maActionClassVector.size(),
"DrawShapeSubsetting::ensureInitializedNodeTree(): sentence index out of range" );
maActionClassVector[ nIndex ] = CLASS_CHARACTER_CELL_END;
}
else if( pAct->GetComment().equalsIgnoreAsciiCase("XTEXT_EOW") )
{
// special, because can happen
// in-between of portions - set
// word-end classificator at given
// index (relative to last text
// action).
const sal_Int32 nIndex( nLastTextActionIndex + pAct->GetValue() );
ENSURE_OR_THROW( static_cast< ::std::size_t >(nIndex) < maActionClassVector.size(),
"DrawShapeSubsetting::ensureInitializedNodeTree(): sentence index out of range" );
maActionClassVector[ nIndex ] = CLASS_WORD_END;
}
else if( pAct->GetComment().equalsIgnoreAsciiCase("XTEXT_EOS") )
{
// special, because can happen
// in-between of portions - set
// sentence-end classificator at given
// index (relative to last text
// action).
const sal_Int32 nIndex( nLastTextActionIndex + pAct->GetValue() );
ENSURE_OR_THROW( static_cast< ::std::size_t >(nIndex) < maActionClassVector.size(),
"DrawShapeSubsetting::ensureInitializedNodeTree(): sentence index out of range" );
maActionClassVector[ nIndex ] = CLASS_SENTENCE_END;
}
else if( pAct->GetComment().equalsIgnoreAsciiCase("XTEXT_EOL") )
{
maActionClassVector[ nActionIndex ] = CLASS_LINE_END;
}
else if( pAct->GetComment().equalsIgnoreAsciiCase("XTEXT_EOP") )
{
maActionClassVector[ nActionIndex ] = CLASS_PARAGRAPH_END;
}
else if( pAct->GetComment().equalsIgnoreAsciiCase("XTEXT_PAINTSHAPE_END") )
{
maActionClassVector[ nActionIndex ] = CLASS_SHAPE_END;
}
else if( pAct->GetComment().equalsIgnoreAsciiCase("XTEXT_PAINTSHAPE_BEGIN") )
{
maActionClassVector[ nActionIndex ] = CLASS_SHAPE_START;
}
}
VERBOSE_TRACE( "Shape text structure: %s at action #%d",
pAct->GetComment().getStr(), nActionIndex );
++nActionIndex;
break;
}
case META_TEXT_ACTION:
case META_TEXTARRAY_ACTION:
case META_STRETCHTEXT_ACTION:
nLastTextActionIndex = nActionIndex;
#if OSL_DEBUG_LEVEL > 1
{
MetaTextAction* pText = static_cast<MetaTextAction*>(pCurrAct);
VERBOSE_TRACE( "Shape text \"%s\" at action #%d",
OUStringToOString(pText->GetText(),
RTL_TEXTENCODING_ISO_8859_1).getStr(),
nActionIndex );
}
#endif
// fallthrough intended
default:
// comment action and all actions not
// explicitly handled here:
nActionIndex += getNextActionOffset(pCurrAct);
break;
}
}
mbNodeTreeInitialized = true;
}
void DrawShapeSubsetting::updateSubsetBounds( const SubsetEntry& rSubsetEntry )
{
// TODO(F1): This removes too much from non-contiguous subsets
mnMinSubsetActionIndex = ::std::min(
mnMinSubsetActionIndex,
rSubsetEntry.mnStartActionIndex );
mnMaxSubsetActionIndex = ::std::max(
mnMaxSubsetActionIndex,
rSubsetEntry.mnEndActionIndex );
}
void DrawShapeSubsetting::updateSubsets()
{
maCurrentSubsets.clear();
if( !maSubsetShapes.empty() )
{
if( maSubset.isEmpty() )
{
// non-subsetted node, with some child subsets
// that subtract from it
maCurrentSubsets.push_back( DocTreeNode( 0,
mnMinSubsetActionIndex,
DocTreeNode::NODETYPE_INVALID ) );
maCurrentSubsets.push_back( DocTreeNode( mnMaxSubsetActionIndex,
maActionClassVector.size(),
DocTreeNode::NODETYPE_INVALID ) );
}
else
{
// subsetted node, from which some further child
// subsets subtract content
maCurrentSubsets.push_back( DocTreeNode( maSubset.getStartIndex(),
mnMinSubsetActionIndex,
DocTreeNode::NODETYPE_INVALID ) );
maCurrentSubsets.push_back( DocTreeNode( mnMaxSubsetActionIndex,
maSubset.getEndIndex(),
DocTreeNode::NODETYPE_INVALID ) );
}
}
else
{
// no further child subsets, simply add our subset (if any)
if( !maSubset.isEmpty() )
{
// subsetted node, without any subset children
maCurrentSubsets.push_back( maSubset );
}
}
}
// Public methods
DrawShapeSubsetting::DrawShapeSubsetting() :
maActionClassVector(),
mpMtf(),
maSubset(),
maSubsetShapes(),
mnMinSubsetActionIndex( SAL_MAX_INT32 ),
mnMaxSubsetActionIndex(0),
maCurrentSubsets(),
mbNodeTreeInitialized( false )
{
}
DrawShapeSubsetting::DrawShapeSubsetting( const DocTreeNode& rShapeSubset,
const GDIMetaFileSharedPtr& rMtf ) :
maActionClassVector(),
mpMtf( rMtf ),
maSubset( rShapeSubset ),
maSubsetShapes(),
mnMinSubsetActionIndex( SAL_MAX_INT32 ),
mnMaxSubsetActionIndex(0),
maCurrentSubsets(),
mbNodeTreeInitialized( false )
{
ENSURE_OR_THROW( mpMtf,
"DrawShapeSubsetting::DrawShapeSubsetting(): Invalid metafile" );
initCurrentSubsets();
}
void DrawShapeSubsetting::reset()
{
maActionClassVector.clear();
mpMtf.reset();
maSubset.reset();
maSubsetShapes.clear();
mnMinSubsetActionIndex = SAL_MAX_INT32;
mnMaxSubsetActionIndex = 0;
maCurrentSubsets.clear();
mbNodeTreeInitialized = false;
}
void DrawShapeSubsetting::reset( const ::boost::shared_ptr< GDIMetaFile >& rMtf )
{
reset();
mpMtf = rMtf;
initCurrentSubsets();
}
void DrawShapeSubsetting::initCurrentSubsets()
{
// only add subset to vector, if it's not empty - that's
// because the vector's content is later literally used
// for e.g. painting.
if( !maSubset.isEmpty() )
maCurrentSubsets.push_back( maSubset );
}
DocTreeNode DrawShapeSubsetting::getSubsetNode() const
{
return maSubset;
}
AttributableShapeSharedPtr DrawShapeSubsetting::getSubsetShape( const DocTreeNode& rTreeNode ) const
{
SAL_INFO( "slideshow", "::presentation::internal::DrawShapeSubsetting::getSubsetShape()" );
// subset shape already created for this DocTreeNode?
SubsetEntry aEntry;
aEntry.mnStartActionIndex = rTreeNode.getStartIndex();
aEntry.mnEndActionIndex = rTreeNode.getEndIndex();
ShapeSet::const_iterator aIter;
if( (aIter=maSubsetShapes.find( aEntry )) != maSubsetShapes.end() )
{
// already created, return found entry
return aIter->mpShape;
}
return AttributableShapeSharedPtr();
}
void DrawShapeSubsetting::addSubsetShape( const AttributableShapeSharedPtr& rShape )
{
SAL_INFO( "slideshow", "::presentation::internal::DrawShapeSubsetting::addSubsetShape()" );
// subset shape already created for this DocTreeNode?
SubsetEntry aEntry;
const DocTreeNode& rEffectiveSubset( rShape->getSubsetNode() );
aEntry.mnStartActionIndex = rEffectiveSubset.getStartIndex();
aEntry.mnEndActionIndex = rEffectiveSubset.getEndIndex();
ShapeSet::const_iterator aIter;
if( (aIter=maSubsetShapes.find( aEntry )) != maSubsetShapes.end() )
{
// already created, increment use count and return
// safe cast, since set order does not depend on
// mnSubsetQueriedCount
const_cast<SubsetEntry&>(*aIter).mnSubsetQueriedCount++;
}
else
{
// not yet created, init entry
aEntry.mnSubsetQueriedCount = 1;
aEntry.mpShape = rShape;
maSubsetShapes.insert( aEntry );
// update cached subset borders
updateSubsetBounds( aEntry );
updateSubsets();
}
}
bool DrawShapeSubsetting::revokeSubsetShape( const AttributableShapeSharedPtr& rShape )
{
SAL_INFO( "slideshow", "::presentation::internal::DrawShapeSubsetting::revokeSubsetShape()" );
// lookup subset shape
SubsetEntry aEntry;
const DocTreeNode& rEffectiveSubset( rShape->getSubsetNode() );
aEntry.mnStartActionIndex = rEffectiveSubset.getStartIndex();
aEntry.mnEndActionIndex = rEffectiveSubset.getEndIndex();
ShapeSet::iterator aIter;
if( (aIter=maSubsetShapes.find( aEntry )) == maSubsetShapes.end() )
return false; // not found, subset was never queried
// last client of the subset revoking?
if( aIter->mnSubsetQueriedCount > 1 )
{
// no, still clients out there. Just decrement use count
// safe cast, since order does not depend on mnSubsetQueriedCount
const_cast<SubsetEntry&>(*aIter).mnSubsetQueriedCount--;
VERBOSE_TRACE( "Subset summary: shape 0x%X, %d open subsets, revoked subset has refcount %d",
this,
maSubsetShapes.size(),
aIter->mnSubsetQueriedCount );
return false; // not the last client
}
VERBOSE_TRACE( "Subset summary: shape 0x%X, %d open subsets, cleared subset has range [%d,%d]",
this,
maSubsetShapes.size(),
aEntry.mnStartActionIndex,
aEntry.mnEndActionIndex );
// yes, remove from set
maSubsetShapes.erase( aIter );
// update currently active subset for _our_ shape (the
// part of this shape that is visible, i.e. not displayed
// in subset shapes)
// init bounds
mnMinSubsetActionIndex = SAL_MAX_INT32;
mnMaxSubsetActionIndex = 0;
// TODO(P2): This is quite expensive, when
// after every subset effect end, we have to scan
// the whole shape set
// determine new subset range
::std::for_each( maSubsetShapes.begin(),
maSubsetShapes.end(),
::boost::bind(&DrawShapeSubsetting::updateSubsetBounds,
this,
_1 ) );
updateSubsets();
return true;
}
namespace
{
/** Iterate over all action classification entries in the
given range, pass each element range found to the
given functor.
This method extracts, for each of the different action
classifications, the count and the ranges for each of
them, and calls the provided functor with that
information.
@tpl FunctorT
This is the functor's operator() calling signature,
with eCurrElemClassification denoting the current
classification type the functor is called for,
nCurrElemCount the running total of elements visited
for the given class (starting from 0), and
rCurrElemBegin/rCurrElemEnd the range of the current
element (i.e. the iterators from the start to the end
of this element).
<pre>
bool operator()( IndexClassificator eCurrElemClassification
sal_Int32 nCurrElemCount,
const IndexClassificatorVector::const_iterator& rCurrElemBegin,
const IndexClassificatorVector::const_iterator& rCurrElemEnd );
</pre>
If the functor returns false, iteration over the
shapes is immediately stopped.
@param io_pFunctor
This functor is called for every shape found.
@param rBegin
Start of range to iterate over
@param rEnd
End of range to iterate over
@return the number of shapes found in the metafile
*/
template< typename FunctorT > void iterateActionClassifications(
FunctorT& io_rFunctor,
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rBegin,
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rEnd )
{
sal_Int32 nCurrShapeCount( 0 );
sal_Int32 nCurrParaCount( 0 );
sal_Int32 nCurrLineCount( 0 );
sal_Int32 nCurrSentenceCount( 0 );
sal_Int32 nCurrWordCount( 0 );
sal_Int32 nCurrCharCount( 0 );
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aLastShapeStart(rBegin);
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aLastParaStart(rBegin);
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aLastLineStart(rBegin);
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aLastSentenceStart(rBegin);
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aLastWordStart(rBegin);
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aLastCharStart(rBegin);
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aNext;
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aCurr( rBegin );
while( aCurr != rEnd )
{
// aNext will hold an iterator to the next element
// (or the past-the-end iterator, if aCurr
// references the last element). Used to pass a
// valid half-open range to the functors.
aNext = aCurr;
++aNext;
switch( *aCurr )
{
default:
ENSURE_OR_THROW( false,
"Unexpected type in iterateDocShapes()" );
case DrawShapeSubsetting::CLASS_NOOP:
// ignore NOOP actions
break;
case DrawShapeSubsetting::CLASS_SHAPE_START:
// regardless of ending action
// classifications before: a new shape
// always also starts contained elements
// anew
aLastShapeStart =
aLastParaStart =
aLastLineStart =
aLastSentenceStart =
aLastWordStart =
aLastCharStart = aCurr;
break;
case DrawShapeSubsetting::CLASS_SHAPE_END:
if( !io_rFunctor( DrawShapeSubsetting::CLASS_SHAPE_END,
nCurrShapeCount,
aLastShapeStart,
aNext ) )
{
return;
}
++nCurrShapeCount;
// FALLTHROUGH intended: shape end also
// ends lines
case DrawShapeSubsetting::CLASS_PARAGRAPH_END:
if( !io_rFunctor( DrawShapeSubsetting::CLASS_PARAGRAPH_END,
nCurrParaCount,
aLastParaStart,
aNext ) )
{
return;
}
++nCurrParaCount;
aLastParaStart = aNext;
// FALLTHROUGH intended: para end also
// ends line
case DrawShapeSubsetting::CLASS_LINE_END:
if( !io_rFunctor( DrawShapeSubsetting::CLASS_LINE_END,
nCurrLineCount,
aLastLineStart,
aNext ) )
{
return;
}
++nCurrLineCount;
aLastLineStart = aNext;
if( *aCurr == DrawShapeSubsetting::CLASS_LINE_END )
{
// DON'T fall through here, as a line
// does NOT end neither a sentence,
// nor a word. OTOH, all parent
// structures (paragraph and shape),
// which itself fall through to this
// code, DO end word, sentence and
// character cell.
// TODO(F1): Maybe a line should end a
// character cell, OTOH?
break;
}
// FALLTHROUGH intended
case DrawShapeSubsetting::CLASS_SENTENCE_END:
if( !io_rFunctor( DrawShapeSubsetting::CLASS_SENTENCE_END,
nCurrSentenceCount,
aLastSentenceStart,
aNext ) )
{
return;
}
++nCurrSentenceCount;
aLastSentenceStart = aNext;
// FALLTHROUGH intended
case DrawShapeSubsetting::CLASS_WORD_END:
if( !io_rFunctor( DrawShapeSubsetting::CLASS_WORD_END,
nCurrWordCount,
aLastWordStart,
aNext ) )
{
return;
}
++nCurrWordCount;
aLastWordStart = aNext;
// FALLTHROUGH intended
case DrawShapeSubsetting::CLASS_CHARACTER_CELL_END:
if( !io_rFunctor( DrawShapeSubsetting::CLASS_CHARACTER_CELL_END,
nCurrCharCount,
aLastCharStart,
aNext ) )
{
return;
}
++nCurrCharCount;
aLastCharStart = aNext;
break;
}
aCurr = aNext;
}
}
DrawShapeSubsetting::IndexClassificator mapDocTreeNode( DocTreeNode::NodeType eNodeType )
{
switch( eNodeType )
{
case DocTreeNode::NODETYPE_INVALID:
// FALLTHROUGH intended
default:
SAL_WARN( "slideshow", "DrawShapeSubsetting::mapDocTreeNode(): unexpected node type");
return DrawShapeSubsetting::CLASS_NOOP;
case DocTreeNode::NODETYPE_LOGICAL_SHAPE:
// FALLTHROUGH intended
case DocTreeNode::NODETYPE_FORMATTING_SHAPE:
return DrawShapeSubsetting::CLASS_SHAPE_END;
case DocTreeNode::NODETYPE_FORMATTING_LINE:
return DrawShapeSubsetting::CLASS_LINE_END;
case DocTreeNode::NODETYPE_LOGICAL_PARAGRAPH:
return DrawShapeSubsetting::CLASS_PARAGRAPH_END;
case DocTreeNode::NODETYPE_LOGICAL_SENTENCE:
return DrawShapeSubsetting::CLASS_SENTENCE_END;
case DocTreeNode::NODETYPE_LOGICAL_WORD:
return DrawShapeSubsetting::CLASS_WORD_END;
case DocTreeNode::NODETYPE_LOGICAL_CHARACTER_CELL:
return DrawShapeSubsetting::CLASS_CHARACTER_CELL_END;
};
}
/// Counts number of class occurrences
class CountClassFunctor
{
public:
CountClassFunctor( DrawShapeSubsetting::IndexClassificator eClass ) :
meClass( eClass ),
mnCurrCount(0)
{
}
bool operator()( DrawShapeSubsetting::IndexClassificator eCurrElemClassification,
sal_Int32 /*nCurrElemCount*/,
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& /*rCurrElemBegin*/,
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& /*rCurrElemEnd*/ )
{
if( eCurrElemClassification == meClass )
++mnCurrCount;
return true; // never stop, count all occurrences
}
sal_Int32 getCount() const
{
return mnCurrCount;
}
private:
DrawShapeSubsetting::IndexClassificator meClass;
sal_Int32 mnCurrCount;
};
}
sal_Int32 DrawShapeSubsetting::implGetNumberOfTreeNodes( const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rBegin,
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rEnd,
DocTreeNode::NodeType eNodeType ) const
{
const IndexClassificator eRequestedClass(
mapDocTreeNode( eNodeType ) );
// create a counting functor for the requested class of
// actions
CountClassFunctor aFunctor( eRequestedClass );
// count all occurrences in the given range
iterateActionClassifications( aFunctor, rBegin, rEnd );
return aFunctor.getCount();
}
sal_Int32 DrawShapeSubsetting::getNumberOfTreeNodes( DocTreeNode::NodeType eNodeType ) const
{
ensureInitializedNodeTree();
return implGetNumberOfTreeNodes( maActionClassVector.begin(),
maActionClassVector.end(),
eNodeType );
}
namespace
{
/** This functor finds the nth occurrence of a given
action class.
The operator() compares the given index value with the
requested index, as given on the functor's
constructor. Then, the operator() returns false,
denoting that the requested action is found.
*/
class FindNthElementFunctor
{
public:
FindNthElementFunctor( sal_Int32 nNodeIndex,
DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rLastBegin,
DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rLastEnd,
DrawShapeSubsetting::IndexClassificator eClass ) :
mnNodeIndex( nNodeIndex ),
mrLastBegin( rLastBegin ),
mrLastEnd( rLastEnd ),
meClass( eClass )
{
}
bool operator()( DrawShapeSubsetting::IndexClassificator eCurrElemClassification,
sal_Int32 nCurrElemCount,
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rCurrElemBegin,
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rCurrElemEnd )
{
if( eCurrElemClassification == meClass &&
nCurrElemCount == mnNodeIndex )
{
mrLastBegin = rCurrElemBegin;
mrLastEnd = rCurrElemEnd;
return false; // abort iteration, we've
// already found what we've been
// looking for
}
return true; // keep on truckin'
}
private:
sal_Int32 mnNodeIndex;
DrawShapeSubsetting::IndexClassificatorVector::const_iterator& mrLastBegin;
DrawShapeSubsetting::IndexClassificatorVector::const_iterator& mrLastEnd;
DrawShapeSubsetting::IndexClassificator meClass;
};
DocTreeNode makeTreeNode( const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rBegin,
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rStart,
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator& rEnd,
DocTreeNode::NodeType eNodeType )
{
return DocTreeNode( ::std::distance(rBegin,
rStart),
::std::distance(rBegin,
rEnd),
eNodeType );
}
}
DocTreeNode DrawShapeSubsetting::implGetTreeNode( const IndexClassificatorVector::const_iterator& rBegin,
const IndexClassificatorVector::const_iterator& rEnd,
sal_Int32 nNodeIndex,
DocTreeNode::NodeType eNodeType ) const
{
const IndexClassificator eRequestedClass(
mapDocTreeNode( eNodeType ) );
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aLastBegin(rEnd);
DrawShapeSubsetting::IndexClassificatorVector::const_iterator aLastEnd(rEnd);
// create a nth element functor for the requested class of
// actions, and nNodeIndex as the target index
FindNthElementFunctor aFunctor( nNodeIndex,
aLastBegin,
aLastEnd,
eRequestedClass );
// find given index in the given range
iterateActionClassifications( aFunctor, rBegin, rEnd );
return makeTreeNode( maActionClassVector.begin(),
aLastBegin, aLastEnd,
eNodeType );
}
DocTreeNode DrawShapeSubsetting::getTreeNode( sal_Int32 nNodeIndex,
DocTreeNode::NodeType eNodeType ) const
{
ensureInitializedNodeTree();
return implGetTreeNode( maActionClassVector.begin(),
maActionClassVector.end(),
nNodeIndex,
eNodeType );
}
sal_Int32 DrawShapeSubsetting::getNumberOfSubsetTreeNodes( const DocTreeNode& rParentNode,
DocTreeNode::NodeType eNodeType ) const
{
ensureInitializedNodeTree();
// convert from vector indices to vector iterators
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator aBegin( maActionClassVector.begin() );
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator aParentBegin( aBegin + rParentNode.getStartIndex() );
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator aParentEnd( aBegin + rParentNode.getEndIndex() );
return implGetNumberOfTreeNodes( aParentBegin,
aParentEnd,
eNodeType );
}
DocTreeNode DrawShapeSubsetting::getSubsetTreeNode( const DocTreeNode& rParentNode,
sal_Int32 nNodeIndex,
DocTreeNode::NodeType eNodeType ) const
{
ensureInitializedNodeTree();
// convert from vector indices to vector iterators
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator aBegin( maActionClassVector.begin() );
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator aParentBegin( aBegin + rParentNode.getStartIndex() );
const DrawShapeSubsetting::IndexClassificatorVector::const_iterator aParentEnd( aBegin + rParentNode.getEndIndex() );
return implGetTreeNode( aParentBegin,
aParentEnd,
nNodeIndex,
eNodeType );
}
const VectorOfDocTreeNodes& DrawShapeSubsetting::getActiveSubsets() const
{
return maCurrentSubsets;
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|