bump product version to 5.0.4.1
[LibreOffice.git] / sd / source / ui / slidesorter / cache / SlsRequestFactory.cxx
blobce4b860710d72f1734730276a53dee1ffcb83d3e
1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 /*
3 * This file is part of the LibreOffice project.
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/.
9 * This file incorporates work covered by the following license notice:
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 .
20 #include "SlsRequestFactory.hxx"
22 #include "SlsGenericPageCache.hxx"
23 #include "model/SlideSorterModel.hxx"
24 #include "model/SlsPageDescriptor.hxx"
25 #include "model/SlsPageEnumerationProvider.hxx"
26 #include "view/SlideSorterView.hxx"
27 #include <svx/svdpagv.hxx>
28 #include <svx/sdrpagewindow.hxx>
29 #include <svx/sdr/contact/viewcontact.hxx>
31 namespace sd { namespace slidesorter { namespace cache {
33 void RequestFactory::operator()(
34 RequestQueue& rRequestQueue,
35 const SharedCacheContext& rpCacheContext)
37 ::boost::shared_ptr<std::vector<CacheKey> > aKeys;
39 // Add the requests for the visible pages.
40 aKeys = rpCacheContext->GetEntryList(true);
41 if (aKeys.get() != NULL)
43 std::vector<CacheKey>::const_iterator iKey;
44 std::vector<CacheKey>::const_iterator iEnd (aKeys->end());
45 for (iKey=aKeys->begin(); iKey!=iEnd; ++iKey)
46 rRequestQueue.AddRequest(*iKey, VISIBLE_NO_PREVIEW);
49 // Add the requests for the non-visible pages.
50 aKeys = rpCacheContext->GetEntryList(false);
51 if (aKeys.get() != NULL)
53 std::vector<CacheKey>::const_iterator iKey;
54 std::vector<CacheKey>::const_iterator iEnd (aKeys->end());
55 for (iKey=aKeys->begin(); iKey!=iEnd; ++iKey)
56 rRequestQueue.AddRequest(*iKey, NOT_VISIBLE);
60 } } } // end of namespace ::sd::slidesorter::cache
62 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */