e673. Getting Amount of Free Accelerated Image Memory

Posted borter

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了e673. Getting Amount of Free Accelerated Image Memory相关的知识,希望对你有一定的参考价值。

Images in accelerated memory are much faster to draw on the screen. However, accelerated memory is typically limited and it is usually necessary for an application to manage the images residing in this space. This example demonstrates how to determine the amount free accelerated available.

Note: There appears to be a problem with GraphicsDevice.getAvailableAcceleratedMemory() on some systems. The method returns 0 even if accelerated image memory is available. A workaround is to create a temporary volatile image on the graphics device before calling the method. Once the volatile image is created, the method appears to return the correct value on all subsequent calls.

See also e601 Enabling Full-Screen Mode and e674 创建并绘制加速图像.

    GraphicsEnvironment ge = GraphicsEnvironment.getLocalGraphicsEnvironment();
    try {
        GraphicsDevice[] gs = ge.getScreenDevices();
    
        // Get current amount of available memory in bytes for each screen
        for (int i=0; i<gs.length; i++) {
            // Workaround; see description
            VolatileImage im = gs[i].getDefaultConfiguration().createCompatibleVolatileImage(1, 1);
    
            // Retrieve available free accelerated image memory
            int bytes = gs[i].getAvailableAcceleratedMemory();
            if (bytes < 0) {
                // Amount of memory is unlimited
            }
    
            // Release the temporary volatile image
            im.flush();
        }
    } catch (HeadlessException e) {
        // Is thrown if there are no screen devices
    }

 

Related Examples

以上是关于e673. Getting Amount of Free Accelerated Image Memory的主要内容,如果未能解决你的问题,请参考以下文章

673. Number of Longest Increasing Subsequence

673. Number of Longest Increasing Subsequence

673. Number of Longest Increasing Subsequence

673. Number of Longest Increasing Subsequence

673. Number of Longest Increasing Subsequence

fatal error C1010: unexpected end of file while looking for precompiled head