source: trunk/examples/webkit/imageanalyzer/imageanalyzer.cpp@ 886

Last change on this file since 886 was 846, checked in by Dmitry A. Kuminov, 14 years ago

trunk: Merged in qt 4.7.2 sources from branches/vendor/nokia/qt.

File size: 7.5 KB
Line 
1/****************************************************************************
2**
3** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
4** All rights reserved.
5** Contact: Nokia Corporation ([email protected])
6**
7** This file is part of the examples of the Qt Toolkit.
8**
9** $QT_BEGIN_LICENSE:BSD$
10** You may use this file under the terms of the BSD license as follows:
11**
12** "Redistribution and use in source and binary forms, with or without
13** modification, are permitted provided that the following conditions are
14** met:
15** * Redistributions of source code must retain the above copyright
16** notice, this list of conditions and the following disclaimer.
17** * Redistributions in binary form must reproduce the above copyright
18** notice, this list of conditions and the following disclaimer in
19** the documentation and/or other materials provided with the
20** distribution.
21** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor
22** the names of its contributors may be used to endorse or promote
23** products derived from this software without specific prior written
24** permission.
25**
26** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
27** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
28** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
29** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
30** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
31** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
32** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
33** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
34** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
35** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
36** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
37** $QT_END_LICENSE$
38**
39****************************************************************************/
40
41
42#include <QNetworkReply>
43#include <QNetworkRequest>
44#include <QNetworkAccessManager>
45#include <QNetworkDiskCache>
46#include "imageanalyzer.h"
47
48/*!
49 * This class operates as follows:
50 * Parent calls the slot startAnalysis which shoves a list of QStrings into URLQueue and then calls fetchURLs.
51 * FetchURLs sends out HTTP GETs for each image it can't get out of the cache.
52 * As the responses come in, handleReply tries to create an image out of each and pushes those images into imageQueue.
53 * On the last (detected by no outstandingFetches and URLQueue.isEmpty()) call to queueImage (from handleReply)
54 * a thread is forked to process all the images. When it finishes, it emits a finished signal that is received
55 * by our JavaScript code.
56 */
57
58//! [ ImageAnalyzer - Constructor ]
59ImageAnalyzer::ImageAnalyzer(QNetworkDiskCache* netcache, QObject* parent)
60 : QObject(parent), m_cache(netcache), m_outstandingFetches(0)
61{
62 /* ImageAnalyzer only wants to receive http responses
63 for requests that it makes, so that's why it has its own
64 QNetworkAccessManager. */
65 m_network = new QNetworkAccessManager(this);
66 m_watcher = new QFutureWatcher<QRgb>(this);
67 /* We want to share a cache with the web browser,
68 in case it has some images we want: */
69 m_network->setCache(m_cache);
70
71 QObject::connect(m_network, SIGNAL(finished(QNetworkReply*)),
72 this, SLOT(handleReply(QNetworkReply*)));
73 QObject::connect(m_watcher, SIGNAL(finished()),
74 this, SLOT(doneProcessing()));
75 QObject::connect(m_watcher, SIGNAL(progressValueChanged(int)),
76 this, SLOT(progressStatus(int)));
77}
78//! [ ImageAnalyzer - Constructor ]
79ImageAnalyzer::~ImageAnalyzer()
80{
81 delete(m_watcher);
82}
83
84
85QRgb ImageAnalyzer::lastResults()
86{
87 int rTot = 0;
88 int bTot = 0;
89 int gTot = 0;
90 int count = m_watcher->future().results().size();
91 foreach(const QRgb & triplet, m_watcher->future().results())
92 {