Date: prev next · Thread: first prev next last
2012 Archives by date, by thread · List index


you are correct, I will spin a new patch.

On 2012-03-02 17:42, Ivan Timofeev wrote:
Hi,

> -DECLARE_TABLE( SwBookmarkNodeTable, SvPtrarr* )
> +typedef std::multimap<sal_uLong, const ::sw::mark::IMark*> SwBookmarkNodeTable;
...

> +    SwBookmarkNodeTable aBkmkNodePos;
...

> -    SvPtrarr* pArr = (m_pImpl->pBkmkNodePos) ?
> -        m_pImpl->pBkmkNodePos->Get( nNd ) : 0;
> -    if( pArr )
> + SwBookmarkNodeTable::const_iterator it = m_pImpl->aBkmkNodePos.find( nNd );
> +    if( it != m_pImpl->aBkmkNodePos.end() )
>      {
> // there exist some bookmarks, search now all which is in the range
>          if( !nStt && nEnd == rNd.Len() )
>              // all
> -            rArr.Insert( pArr, 0 );
> +            for( ; it != m_pImpl->aBkmkNodePos.end(); ++it )
> +                rArr.push_back( it->second );

If SwBookmarkNodeTable is a multimap, then to get all values with the same key you have to use multimap::equal_range, not multimap::find, right?

Sorry, I am completely tired now and can easily produce false conclusions. %-)

Regards,
Ivan


Disclaimer: http://www.peralex.com/disclaimer.html



Context


Privacy Policy | Impressum (Legal Info) | Copyright information: Unless otherwise specified, all text and images on this website are licensed under the Creative Commons Attribution-Share Alike 3.0 License. This does not include the source code of LibreOffice, which is licensed under the Mozilla Public License (MPLv2). "LibreOffice" and "The Document Foundation" are registered trademarks of their corresponding registered owners or are in actual use as trademarks in one or more countries. Their respective logos and icons are also subject to international copyright laws. Use thereof is explained in our trademark policy.