zoukankan      html  css  js  c++  java
  • Splash Screens

    Splash Screens

    如何为QT创建一个闪屏

    Many applications present a splash screen at startup, such as the one shown in Figure 3.18. Some developers use a splash screen to disguise a slow startup, while others do it to satisfy their marketing departments. Adding a splash screen to Qt applications is very easy using the QSplashScreen class.

    The QSplashScreen class shows an image before the main window appears. It can also write messages on the image to inform the user about the progress of the application's initialization process. Typically, the splash screen code is located in main(), before the call to QApplication::exec().

    Next is an example main() function that uses QSplashScreen to present a splash screen in an application that loads modules and establishes network connections at startup.

    int main(int argc, char *argv[])
    {
        QApplication app(argc, argv);
    
        QSplashScreen *splash = new QSplashScreen;
        splash->setPixmap(QPixmap(":/images/splash.png"));
        splash->show();
    
        Qt::Alignment topRight = Qt::AlignRight | Qt::AlignTop;
        splash->showMessage(QObject::tr("Setting up the main window..."),
                               topRight, Qt::white);
        MainWindow mainWin;
    
        splash->showMessage(QObject::tr("Loading modules..."),
                               topRight, Qt::white);
        loadModules();
    
        splash->showMessage(QObject::tr("Establishing connections..."),
                               topRight, Qt::white);
        establishConnections();
    
        mainWin.show();
        splash->finish(&mainWin);
        delete splash;
    
        return app.exec();
    }

    We have now completed the Spreadsheet application's user interface. In the next chapter, we will complete the application by implementing the core spreadsheet functionality.

    THE END!

    2012年12月30日

  • 相关阅读:
    题解 UVA10213 【How Many Pieces of Land ?】
    NOIP 2018 游记
    POJ 1821 Fence(单调队列优化DP)
    HDU 2196 Computer(经典树形DP)
    POJ 2228 Naptime(DP+环形处理)
    POJ 1742 Coins(多重背包?)
    POJ 2311 Cutting Game(SG函数)
    BZOJ 2560(子集DP+容斥原理)
    HDU2841 Visible Trees(容斥原理)
    HDU 1796 How many integers can you find(容斥原理)
  • 原文地址:https://www.cnblogs.com/xingchen/p/2839564.html
Copyright © 2011-2022 走看看