⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 qintcache-h.html

📁 qtopiaphone英文帮助,用于初学者和开发人员,初学者可以用来学习,开发人员可以用来资料查询.
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Qt Toolkit - qintcache.h include file</title><style type="text/css"><!--h3.fn,span.fn { margin-left: 1cm; text-indent: -1cm; }a:link { color: #004faf; text-decoration: none }a:visited { color: #672967; text-decoration: none }body { background: white; color: black; }--></style></head><body bgcolor="#ffffff"><table width="100%"><tr><td><a href="index.html"><img width="100" height="100" src="qtlogo.png"alt="Home" border="0"><img width="100"height="100" src="face.png" alt="Home" border="0"></a><td valign="top"><div align="right"><img src="dochead.png" width="472" height="27"><br><a href="classes.html"><b>Classes</b></a>- <a href="annotated.html">Annotated</a>- <a href="hierarchy.html">Tree</a>- <a href="functions.html">Functions</a>- <a href="index.html">Home</a>- <a href="topicals.html"><b>Structure</b>  <font face="Arial,Helvetica,Geneva,Swiss,SunSans-Regular" align="center" size=32>Qte</font></a></div></table><h1 align=center>qintcache.h</h1><br clear="all">This is the verbatim text of the qintcache.h include file.  It isprovided only for illustration; the copyrightremains with Trolltech.<hr><pre>/****************************************************************************** &#36;Id&#58; qt/src/tools/qintcache.h   2.3.8   edited 2004-05-12 $**** Definition of QIntCache template class**** Created : 950209**** Copyright (C) 1992-2000 Trolltech AS.  All rights reserved.**** This file is part of the tools module of the Qt GUI Toolkit.**** This file may be distributed under the terms of the Q Public License** as defined by Trolltech AS of Norway and appearing in the file** LICENSE.QPL included in the packaging of this file.**** This file may be distributed and/or modified under the terms of the** GNU General Public License version 2 as published by the Free Software** Foundation and appearing in the file LICENSE.GPL included in the** packaging of this file.**** Licensees holding valid Qt Enterprise Edition or Qt Professional Edition** licenses may use this file in accordance with the Qt Commercial License** Agreement provided with the Software.**** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.**** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for**   information about Qt Commercial License Agreements.** See http://www.trolltech.com/qpl/ for QPL licensing information.** See http://www.trolltech.com/gpl/ for GPL licensing information.**** Contact info@trolltech.com if any conditions of this licensing are** not clear to you.************************************************************************/#ifndef QINTCACHE_H#define QINTCACHE_H#ifndef QT_H#include "qgcache.h"#endif // QT_Htemplate&lt;class type&gt; class Q_EXPORT QIntCache : public QGCache{public:    QIntCache( const QIntCache&lt;type&gt; &amp;c ) : QGCache(c) {}    QIntCache( int maxCost=100, int size=17 )        : QGCache( maxCost, size, IntKey, FALSE, FALSE ) {}   ~QIntCache()         { clear(); }    QIntCache&lt;type&gt; &amp;operator=( const QIntCache&lt;type&gt; &amp;c )                        { return (QIntCache&lt;type&gt;&amp;)QGCache::operator=(c); }    int   maxCost()   const     { return QGCache::maxCost(); }    int   totalCost() const     { return QGCache::totalCost(); }    void  setMaxCost( int m)    { QGCache::setMaxCost(m); }    uint  count()     const     { return QGCache::count(); }    uint  size()      const     { return QGCache::size(); }    bool  isEmpty()   const     { return QGCache::count() == 0; }    bool  insert( long k, const type *d, int c=1, int p=0 )                { return QGCache::insert_other((const char*)k,(Item)d,c,p); }    bool  remove( long k )                { return QGCache::remove_other((const char*)k); }    type *take( long k )                { return (type *)QGCache::take_other((const char*)k);}    void  clear()               { QGCache::clear(); }    type *find( long k, bool ref=TRUE ) const                { return (type *)QGCache::find_other( (const char*)k,ref);}    type *operator[]( long k ) const                { return (type *)QGCache::find_other( (const char*)k); }    void  statistics() const { QGCache::statistics(); }private:    void  deleteItem( Item d );};#if defined(Q_DELETING_VOID_UNDEFINED)template&lt;&gt; inline void QIntCache&lt;void&gt;::deleteItem( Item ){}#endiftemplate&lt;class type&gt; inline void QIntCache&lt;type&gt;::deleteItem( QCollection::Item d ){    if ( del_item ) delete (type *)d;}template&lt;class type&gt; class Q_EXPORT QIntCacheIterator : public QGCacheIterator{public:    QIntCacheIterator( const QIntCache&lt;type&gt; &amp;c )        : QGCacheIterator( (QGCache &amp;)c ) {}    QIntCacheIterator( const QIntCacheIterator&lt;type&gt; &amp;ci )                              : QGCacheIterator((QGCacheIterator &amp;)ci) {}    QIntCacheIterator&lt;type&gt; &amp;operator=( const QIntCacheIterator&lt;type&gt;&amp;ci )        { return ( QIntCacheIterator&lt;type&gt;&amp;)QGCacheIterator::operator=( ci );}    uint  count()   const     { return QGCacheIterator::count(); }    bool  isEmpty() const     { return QGCacheIterator::count() == 0; }    bool  atFirst() const     { return QGCacheIterator::atFirst(); }    bool  atLast()  const     { return QGCacheIterator::atLast(); }    type *toFirst()           { return (type *)QGCacheIterator::toFirst(); }    type *toLast()            { return (type *)QGCacheIterator::toLast(); }    operator type *()  const  { return (type *)QGCacheIterator::get(); }    type *current()    const  { return (type *)QGCacheIterator::get(); }    long  currentKey() const  { return (long)QGCacheIterator::getKeyInt();}    type *operator()()        { return (type *)QGCacheIterator::operator()();}    type *operator++()        { return (type *)QGCacheIterator::operator++(); }    type *operator+=(uint j)  { return (type *)QGCacheIterator::operator+=(j);}    type *operator--()        { return (type *)QGCacheIterator::operator--(); }    type *operator-=(uint j)  { return (type *)QGCacheIterator::operator-=(j);}};#endif // QINTCACHE_H</pre><p><address><hr><div align="center"><table width="100%" cellspacing="0" border="0"><tr><td>Copyright 

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -