Branch data Line data Source code
1 : : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 : : /*
3 : : * This file is part of the LibreOffice project.
4 : : *
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/.
8 : : *
9 : : * This file incorporates work covered by the following license notice:
10 : : *
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 .
18 : : */
19 : :
20 : :
21 : : #include "SlsRequestFactory.hxx"
22 : :
23 : : #include "SlsGenericPageCache.hxx"
24 : : #include "model/SlideSorterModel.hxx"
25 : : #include "model/SlsPageDescriptor.hxx"
26 : : #include "model/SlsPageEnumerationProvider.hxx"
27 : : #include "view/SlideSorterView.hxx"
28 : : #include <svx/svdpagv.hxx>
29 : : #include <svx/sdrpagewindow.hxx>
30 : : #include <svx/sdr/contact/viewcontact.hxx>
31 : :
32 : :
33 : : namespace sd { namespace slidesorter { namespace cache {
34 : :
35 : 0 : void RequestFactory::operator()(
36 : : RequestQueue& rRequestQueue,
37 : : const SharedCacheContext& rpCacheContext)
38 : : {
39 [ # # ]: 0 : ::boost::shared_ptr<std::vector<CacheKey> > aKeys;
40 : :
41 : : // Add the requests for the visible pages.
42 [ # # ][ # # ]: 0 : aKeys = rpCacheContext->GetEntryList(true);
[ # # ]
43 [ # # ]: 0 : if (aKeys.get() != NULL)
44 : : {
45 : 0 : std::vector<CacheKey>::const_iterator iKey;
46 [ # # ]: 0 : std::vector<CacheKey>::const_iterator iEnd (aKeys->end());
47 [ # # ][ # # ]: 0 : for (iKey=aKeys->begin(); iKey!=iEnd; ++iKey)
[ # # ]
48 [ # # ]: 0 : rRequestQueue.AddRequest(*iKey, VISIBLE_NO_PREVIEW);
49 : : }
50 : :
51 : : // Add the requests for the non-visible pages.
52 [ # # ][ # # ]: 0 : aKeys = rpCacheContext->GetEntryList(false);
[ # # ]
53 [ # # ]: 0 : if (aKeys.get() != NULL)
54 : : {
55 : 0 : std::vector<CacheKey>::const_iterator iKey;
56 [ # # ]: 0 : std::vector<CacheKey>::const_iterator iEnd (aKeys->end());
57 [ # # ][ # # ]: 0 : for (iKey=aKeys->begin(); iKey!=iEnd; ++iKey)
[ # # ]
58 [ # # ]: 0 : rRequestQueue.AddRequest(*iKey, NOT_VISIBLE);
59 [ # # ]: 0 : }
60 : 0 : }
61 : :
62 : :
63 : :
64 : : } } } // end of namespace ::sd::slidesorter::cache
65 : :
66 : :
67 : :
68 : : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|