347 lines
9.3 KiB
C++
347 lines
9.3 KiB
C++
/* -*- 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 .
|
|
*/
|
|
|
|
#include <vector>
|
|
|
|
#include <ucbhelper/contentidentifier.hxx>
|
|
#include <ucbhelper/providerhelper.hxx>
|
|
|
|
#include "myucp_datasupplier.hxx"
|
|
#include "ContentHelper.hxx"
|
|
#include <com/sun/star/container/XHierarchicalNameAccess.hpp>
|
|
#include <tools/debug.hxx>
|
|
|
|
using namespace ::com::sun::star::uno;
|
|
using namespace ::com::sun::star::ucb;
|
|
using namespace ::com::sun::star::beans;
|
|
using namespace ::com::sun::star::lang;
|
|
using namespace ::com::sun::star::sdbc;
|
|
using namespace ::com::sun::star::io;
|
|
using namespace ::com::sun::star::container;
|
|
|
|
// @@@ Adjust namespace name.
|
|
using namespace dbaccess;
|
|
|
|
// @@@ Adjust namespace name.
|
|
namespace dbaccess
|
|
{
|
|
|
|
// struct ResultListEntry.
|
|
struct ResultListEntry
|
|
{
|
|
OUString aId;
|
|
Reference< XContentIdentifier > xId;
|
|
::rtl::Reference< OContentHelper > xContent;
|
|
Reference< XRow > xRow;
|
|
const ContentProperties& rData;
|
|
|
|
explicit ResultListEntry(const ContentProperties& rEntry) : rData( rEntry ) {}
|
|
};
|
|
|
|
// ResultList.
|
|
typedef std::vector< ResultListEntry* > ResultList;
|
|
|
|
// struct DataSupplier_Impl.
|
|
struct DataSupplier_Impl
|
|
{
|
|
osl::Mutex m_aMutex;
|
|
ResultList m_aResults;
|
|
rtl::Reference< ODocumentContainer > m_xContent;
|
|
bool m_bCountFinal;
|
|
|
|
explicit DataSupplier_Impl(const rtl::Reference< ODocumentContainer >& rContent)
|
|
: m_xContent(rContent)
|
|
, m_bCountFinal(false)
|
|
{
|
|
}
|
|
~DataSupplier_Impl();
|
|
};
|
|
|
|
DataSupplier_Impl::~DataSupplier_Impl()
|
|
{
|
|
ResultList::const_iterator it = m_aResults.begin();
|
|
ResultList::const_iterator end = m_aResults.end();
|
|
|
|
while ( it != end )
|
|
{
|
|
delete (*it);
|
|
++it;
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
// DataSupplier Implementation.
|
|
|
|
DataSupplier::DataSupplier( const rtl::Reference< ODocumentContainer >& rContent )
|
|
: m_pImpl( new DataSupplier_Impl( rContent ) )
|
|
{
|
|
|
|
}
|
|
|
|
DataSupplier::~DataSupplier()
|
|
{
|
|
|
|
}
|
|
|
|
OUString DataSupplier::queryContentIdentifierString( sal_uInt32 nIndex )
|
|
{
|
|
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
|
|
|
|
if ( (size_t)nIndex < m_pImpl->m_aResults.size() )
|
|
{
|
|
OUString aId = m_pImpl->m_aResults[ nIndex ]->aId;
|
|
if ( !aId.isEmpty() )
|
|
{
|
|
// Already cached.
|
|
return aId;
|
|
}
|
|
}
|
|
|
|
if ( getResult( nIndex ) )
|
|
{
|
|
OUString aId = m_pImpl->m_xContent->getIdentifier()->getContentIdentifier();
|
|
|
|
if ( !aId.isEmpty() )
|
|
aId += "/";
|
|
|
|
aId += m_pImpl->m_aResults[ nIndex ]->rData.aTitle;
|
|
|
|
m_pImpl->m_aResults[ nIndex ]->aId = aId;
|
|
return aId;
|
|
}
|
|
return OUString();
|
|
}
|
|
|
|
Reference< XContentIdentifier >
|
|
DataSupplier::queryContentIdentifier( sal_uInt32 nIndex )
|
|
{
|
|
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
|
|
|
|
if ( (size_t)nIndex < m_pImpl->m_aResults.size() )
|
|
{
|
|
Reference< XContentIdentifier > xId = m_pImpl->m_aResults[ nIndex ]->xId;
|
|
if ( xId.is() )
|
|
{
|
|
// Already cached.
|
|
return xId;
|
|
}
|
|
}
|
|
|
|
OUString aId = queryContentIdentifierString( nIndex );
|
|
if ( !aId.isEmpty() )
|
|
{
|
|
Reference< XContentIdentifier > xId = new ::ucbhelper::ContentIdentifier( aId );
|
|
m_pImpl->m_aResults[ nIndex ]->xId = xId;
|
|
return xId;
|
|
}
|
|
return Reference< XContentIdentifier >();
|
|
}
|
|
|
|
Reference< XContent >
|
|
DataSupplier::queryContent( sal_uInt32 _nIndex )
|
|
{
|
|
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
|
|
|
|
if ( (size_t)_nIndex < m_pImpl->m_aResults.size() )
|
|
{
|
|
Reference< XContent > xContent = m_pImpl->m_aResults[ _nIndex ]->xContent.get();
|
|
if ( xContent.is() )
|
|
{
|
|
// Already cached.
|
|
return xContent;
|
|
}
|
|
}
|
|
|
|
Reference< XContentIdentifier > xId = queryContentIdentifier( _nIndex );
|
|
if ( xId.is() )
|
|
{
|
|
try
|
|
{
|
|
Reference< XContent > xContent;
|
|
OUString sName = xId->getContentIdentifier();
|
|
sal_Int32 nIndex = sName.lastIndexOf('/') + 1;
|
|
sName = sName.getToken(0,'/',nIndex);
|
|
|
|
m_pImpl->m_aResults[ _nIndex ]->xContent = m_pImpl->m_xContent->getContent(sName);
|
|
|
|
xContent = m_pImpl->m_aResults[ _nIndex ]->xContent.get();
|
|
return xContent;
|
|
|
|
}
|
|
catch ( IllegalIdentifierException& )
|
|
{
|
|
}
|
|
}
|
|
return Reference< XContent >();
|
|
}
|
|
|
|
bool DataSupplier::getResult( sal_uInt32 nIndex )
|
|
{
|
|
osl::ClearableGuard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
|
|
|
|
if ( (size_t)nIndex < m_pImpl->m_aResults.size() )
|
|
{
|
|
// Result already present.
|
|
return true;
|
|
}
|
|
|
|
// Result not (yet) present.
|
|
|
|
if ( m_pImpl->m_bCountFinal )
|
|
return false;
|
|
|
|
// Try to obtain result...
|
|
|
|
sal_uInt32 nOldCount = m_pImpl->m_aResults.size();
|
|
bool bFound = false;
|
|
sal_uInt32 nPos = nOldCount;
|
|
|
|
// @@@ Obtain data and put it into result list...
|
|
Sequence< OUString> aSeq = m_pImpl->m_xContent->getElementNames();
|
|
if ( nIndex < sal::static_int_cast< sal_uInt32 >( aSeq.getLength() ) )
|
|
{
|
|
const OUString* pIter = aSeq.getConstArray();
|
|
const OUString* pEnd = pIter + aSeq.getLength();
|
|
for(pIter = pIter + nPos;pIter != pEnd;++pIter,++nPos)
|
|
{
|
|
m_pImpl->m_aResults.push_back(
|
|
new ResultListEntry( m_pImpl->m_xContent->getContent(*pIter)->getContentProperties() ) );
|
|
|
|
if ( nPos == nIndex )
|
|
{
|
|
// Result obtained.
|
|
bFound = true;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
if ( !bFound )
|
|
m_pImpl->m_bCountFinal = true;
|
|
|
|
rtl::Reference< ::ucbhelper::ResultSet > xResultSet = getResultSet().get();
|
|
if ( xResultSet.is() )
|
|
{
|
|
// Callbacks follow!
|
|
aGuard.clear();
|
|
|
|
if ( (size_t)nOldCount < m_pImpl->m_aResults.size() )
|
|
xResultSet->rowCountChanged(
|
|
nOldCount, m_pImpl->m_aResults.size() );
|
|
|
|
if ( m_pImpl->m_bCountFinal )
|
|
xResultSet->rowCountFinal();
|
|
}
|
|
|
|
return bFound;
|
|
}
|
|
|
|
sal_uInt32 DataSupplier::totalCount()
|
|
{
|
|
osl::ClearableGuard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
|
|
|
|
if ( m_pImpl->m_bCountFinal )
|
|
return m_pImpl->m_aResults.size();
|
|
|
|
sal_uInt32 nOldCount = m_pImpl->m_aResults.size();
|
|
|
|
// @@@ Obtain data and put it into result list...
|
|
Sequence< OUString> aSeq = m_pImpl->m_xContent->getElementNames();
|
|
const OUString* pIter = aSeq.getConstArray();
|
|
const OUString* pEnd = pIter + aSeq.getLength();
|
|
for(;pIter != pEnd;++pIter)
|
|
m_pImpl->m_aResults.push_back(
|
|
new ResultListEntry( m_pImpl->m_xContent->getContent(*pIter)->getContentProperties() ) );
|
|
|
|
m_pImpl->m_bCountFinal = true;
|
|
|
|
rtl::Reference< ::ucbhelper::ResultSet > xResultSet = getResultSet().get();
|
|
if ( xResultSet.is() )
|
|
{
|
|
// Callbacks follow!
|
|
aGuard.clear();
|
|
|
|
if ( (size_t)nOldCount < m_pImpl->m_aResults.size() )
|
|
xResultSet->rowCountChanged(
|
|
nOldCount, m_pImpl->m_aResults.size() );
|
|
|
|
xResultSet->rowCountFinal();
|
|
}
|
|
|
|
return m_pImpl->m_aResults.size();
|
|
}
|
|
|
|
sal_uInt32 DataSupplier::currentCount()
|
|
{
|
|
return m_pImpl->m_aResults.size();
|
|
}
|
|
|
|
bool DataSupplier::isCountFinal()
|
|
{
|
|
return m_pImpl->m_bCountFinal;
|
|
}
|
|
|
|
Reference< XRow >
|
|
DataSupplier::queryPropertyValues( sal_uInt32 nIndex )
|
|
{
|
|
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
|
|
|
|
if ( (size_t)nIndex < m_pImpl->m_aResults.size() )
|
|
{
|
|
Reference< XRow > xRow = m_pImpl->m_aResults[ nIndex ]->xRow;
|
|
if ( xRow.is() )
|
|
{
|
|
// Already cached.
|
|
return xRow;
|
|
}
|
|
}
|
|
|
|
if ( getResult( nIndex ) )
|
|
{
|
|
if ( !m_pImpl->m_aResults[ nIndex ]->xContent.is() )
|
|
queryContent(nIndex);
|
|
|
|
Reference< XRow > xRow = m_pImpl->m_aResults[ nIndex ]->xContent->getPropertyValues(getResultSet()->getProperties());
|
|
m_pImpl->m_aResults[ nIndex ]->xRow = xRow;
|
|
return xRow;
|
|
}
|
|
|
|
return Reference< XRow >();
|
|
}
|
|
|
|
void DataSupplier::releasePropertyValues( sal_uInt32 nIndex )
|
|
{
|
|
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
|
|
|
|
if ( (size_t)nIndex < m_pImpl->m_aResults.size() )
|
|
m_pImpl->m_aResults[ nIndex ]->xRow.clear();
|
|
}
|
|
|
|
void DataSupplier::close()
|
|
{
|
|
}
|
|
|
|
void DataSupplier::validate()
|
|
throw( ResultSetException )
|
|
{
|
|
}
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|