<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en_US" xml:lang="en_US">
<head>
<title>kjs: property_map.cpp Source File (kjs)</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta http-equiv="Content-Style-Type" content="text/css" />
<meta http-equiv="pics-label" content='(pics-1.1 "http://www.icra.org/ratingsv02.html" comment "ICRAonline DE v2.0" l gen true for "http://www.kde.org" r (nz 1 vz 1 lz 1 oz 1 cb 1) "http://www.rsac.org/ratingsv01.html" l gen true for "http://www.kde.org" r (n 0 s 0 v 0 l 0))' />
<meta name="trademark" content="KDE e.V." />
<meta name="description" content="K Desktop Environment Homepage, KDE.org" />
<meta name="MSSmartTagsPreventParsing" content="true" />
<meta name="robots" content="all" />
<link rel="shortcut icon" href="../../favicon.ico" />
<link rel="stylesheet" media="screen" type="text/css" title="APIDOX" href="doxygen.css" />
</head>
<body>
<div id="nav_header_top" align="right">
<a href="#content" class="doNotDisplay" accesskey="2">Skip to main content ::</a>
<a href="../.."><img id="nav_header_logo" alt="Home" align="left" src="../../kde_gear_64.png" border="0" /></a>
<span class="doNotDisplay">::</span>
<div id="nav_header_title" align="left">KDE API Reference</div>
</div>
<div id="nav_header_bottom" align="right">
<span class="doNotDisplay">:: <a href="#navigation" accesskey="5">Skip to Link Menu</a><br/></span>
<div id="nav_header_bottom_right" style="text-align: left;">
/ <a href="../..">API Reference</a>
/ <a href=".">kjs</a>
</div>
</div>
<table id="main" border="0" cellpadding="0" cellspacing="0" width="100%">
<tr>
<td valign="top" class="menuheader" height="0"></td>
<td id="contentcolumn" valign="top" rowspan="2" >
<div id="content" style="padding-top: 0px;"><div style="width:100%; margin: 0px; padding: 0px;">
<a name="content"></a>
<!-- Generated by Doxygen 1.7.4 -->
<div class="header">
<div class="headertitle">
<div class="title">property_map.cpp</div> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * This file is part of the KDE libraries</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (C) 2003 Apple Computer, Inc.</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * This library is free software; you can redistribute it and/or</span>
<a name="l00006"></a>00006 <span class="comment"> * modify it under the terms of the GNU Library General Public</span>
<a name="l00007"></a>00007 <span class="comment"> * License as published by the Free Software Foundation; either</span>
<a name="l00008"></a>00008 <span class="comment"> * version 2 of the License, or (at your option) any later version.</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * This library is distributed in the hope that it will be useful,</span>
<a name="l00011"></a>00011 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00012"></a>00012 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00013"></a>00013 <span class="comment"> * Library General Public License for more details.</span>
<a name="l00014"></a>00014 <span class="comment"> *</span>
<a name="l00015"></a>00015 <span class="comment"> * You should have received a copy of the GNU Library General Public License</span>
<a name="l00016"></a>00016 <span class="comment"> * along with this library; see the file COPYING.LIB. If not, write to</span>
<a name="l00017"></a>00017 <span class="comment"> * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,</span>
<a name="l00018"></a>00018 <span class="comment"> * Boston, MA 02110-1301, USA.</span>
<a name="l00019"></a>00019 <span class="comment"> *</span>
<a name="l00020"></a>00020 <span class="comment"> */</span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="preprocessor">#include "property_map.h"</span>
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="preprocessor">#include "object.h"</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include "reference_list.h"</span>
<a name="l00026"></a>00026
<a name="l00027"></a>00027 <span class="preprocessor">#include <assert.h></span>
<a name="l00028"></a>00028
<a name="l00029"></a>00029 <span class="preprocessor">#define DEBUG_PROPERTIES 0</span>
<a name="l00030"></a>00030 <span class="preprocessor"></span><span class="preprocessor">#define DO_CONSISTENCY_CHECK 0</span>
<a name="l00031"></a>00031 <span class="preprocessor"></span><span class="preprocessor">#define DUMP_STATISTICS 0</span>
<a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor">#define USE_SINGLE_ENTRY 1</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span>
<a name="l00034"></a>00034 <span class="comment">// At the time I added USE_SINGLE_ENTRY, the optimization still gave a 1.5%</span>
<a name="l00035"></a>00035 <span class="comment">// performance boost to the iBench JavaScript benchmark so I didn't remove it.</span>
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="preprocessor">#if !DO_CONSISTENCY_CHECK</span>
<a name="l00038"></a>00038 <span class="preprocessor"></span><span class="preprocessor">#define checkConsistency() ((void)0)</span>
<a name="l00039"></a>00039 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00040"></a>00040 <span class="preprocessor"></span>
<a name="l00041"></a>00041 <span class="keyword">namespace </span>KJS {
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="preprocessor">#if DUMP_STATISTICS</span>
<a name="l00044"></a>00044 <span class="preprocessor"></span>
<a name="l00045"></a>00045 <span class="keyword">static</span> <span class="keywordtype">int</span> numProbes;
<a name="l00046"></a>00046 <span class="keyword">static</span> <span class="keywordtype">int</span> numCollisions;
<a name="l00047"></a>00047
<a name="l00048"></a>00048 <span class="keyword">struct </span>PropertyMapStatisticsExitLogger { ~PropertyMapStatisticsExitLogger(); };
<a name="l00049"></a>00049
<a name="l00050"></a>00050 <span class="keyword">static</span> PropertyMapStatisticsExitLogger logger;
<a name="l00051"></a>00051
<a name="l00052"></a>00052 PropertyMapStatisticsExitLogger::~PropertyMapStatisticsExitLogger()
<a name="l00053"></a>00053 {
<a name="l00054"></a>00054 printf(<span class="stringliteral">"\nKJS::PropertyMap statistics\n\n"</span>);
<a name="l00055"></a>00055 printf(<span class="stringliteral">"%d probes\n"</span>, numProbes);
<a name="l00056"></a>00056 printf(<span class="stringliteral">"%d collisions (%.1f%%)\n"</span>, numCollisions, 100.0 * numCollisions / numProbes);
<a name="l00057"></a>00057 }
<a name="l00058"></a>00058
<a name="l00059"></a>00059 <span class="preprocessor">#endif</span>
<a name="l00060"></a>00060 <span class="preprocessor"></span>
<a name="l00061"></a>00061 <span class="keyword">struct </span>PropertyMapHashTable
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063 <span class="keywordtype">int</span> sizeMask;
<a name="l00064"></a>00064 <span class="keywordtype">int</span> size;
<a name="l00065"></a>00065 <span class="keywordtype">int</span> keyCount;
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="comment">// gets initialized in expand, an array that stores insert order of a particular hash</span>
<a name="l00068"></a>00068 <span class="keywordtype">int</span> *hashToIndex; <span class="comment">// NOTE: is one based 1,2,3 etc..</span>
<a name="l00069"></a>00069
<a name="l00070"></a>00070 <span class="comment">// keeps trac on how many insertions we have made, cant use keyCount because delete a key in the middle messes things</span>
<a name="l00071"></a>00071 <span class="keywordtype">int</span> indexCount;
<a name="l00072"></a>00072
<a name="l00073"></a>00073 PropertyMapHashTableEntry entries[1];
<a name="l00074"></a>00074 };
<a name="l00075"></a>00075
<a name="l00076"></a>00076 <span class="keyword">class </span>SavedProperty {
<a name="l00077"></a>00077 <span class="keyword">public</span>:
<a name="l00078"></a>00078 Identifier <a class="codeRef" doxygen="kdecore.tag:../../kdecore/html/" href="../../kdecore/html/namespaceKStdAccel.html#acc12b2741ae01cac579a473d3e6bafce">key</a>;
<a name="l00079"></a>00079 Value value;
<a name="l00080"></a>00080 <span class="keywordtype">int</span> attributes;
<a name="l00081"></a>00081 };
<a name="l00082"></a>00082
<a name="l00083"></a>00083 SavedProperties::SavedProperties() : _count(0), _properties(0) { }
<a name="l00084"></a>00084
<a name="l00085"></a>00085 SavedProperties::~SavedProperties()
<a name="l00086"></a>00086 {
<a name="l00087"></a>00087 <span class="keyword">delete</span> [] _properties;
<a name="l00088"></a>00088 }
<a name="l00089"></a>00089
<a name="l00090"></a>00090 <span class="comment">// Algorithm concepts from Algorithms in C++, Sedgewick.</span>
<a name="l00091"></a>00091
<a name="l00092"></a>00092 PropertyMap::PropertyMap() : _table(0)
<a name="l00093"></a>00093 {
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095
<a name="l00096"></a>00096 PropertyMap::~PropertyMap()
<a name="l00097"></a>00097 {
<a name="l00098"></a>00098 <span class="keywordflow">if</span> (!_table) {
<a name="l00099"></a>00099 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00100"></a>00100 <span class="preprocessor"></span> UString::Rep *<a class="codeRef" doxygen="kdecore.tag:../../kdecore/html/" href="../../kdecore/html/namespaceKStdAccel.html#acc12b2741ae01cac579a473d3e6bafce">key</a> = _singleEntry.key;
<a name="l00101"></a>00101 <span class="keywordflow">if</span> (key)
<a name="l00102"></a>00102 key->deref();
<a name="l00103"></a>00103 <span class="preprocessor">#endif</span>
<a name="l00104"></a>00104 <span class="preprocessor"></span> <span class="keywordflow">return</span>;
<a name="l00105"></a>00105 }
<a name="l00106"></a>00106
<a name="l00107"></a>00107 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < _table->size; i++) {
<a name="l00108"></a>00108 UString::Rep *key = _table->entries[i].key;
<a name="l00109"></a>00109 <span class="keywordflow">if</span> (key)
<a name="l00110"></a>00110 key->deref();
<a name="l00111"></a>00111 }
<a name="l00112"></a>00112 <span class="comment">// fredrik added to cleanup sortorder</span>
<a name="l00113"></a>00113 <span class="keywordflow">if</span> (_table)
<a name="l00114"></a>00114 <span class="keyword">delete</span> [] _table->hashToIndex;
<a name="l00115"></a>00115
<a name="l00116"></a>00116 free(_table);
<a name="l00117"></a>00117 }
<a name="l00118"></a>00118
<a name="l00119"></a>00119 <span class="keywordtype">void</span> PropertyMap::clear()
<a name="l00120"></a>00120 {
<a name="l00121"></a>00121 <span class="keywordflow">if</span> (!_table) {
<a name="l00122"></a>00122 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00123"></a>00123 <span class="preprocessor"></span> UString::Rep *key = _singleEntry.key;
<a name="l00124"></a>00124 <span class="keywordflow">if</span> (key) {
<a name="l00125"></a>00125 key->deref();
<a name="l00126"></a>00126 _singleEntry.key = 0;
<a name="l00127"></a>00127 }
<a name="l00128"></a>00128 <span class="preprocessor">#endif</span>
<a name="l00129"></a>00129 <span class="preprocessor"></span> <span class="keywordflow">return</span>;
<a name="l00130"></a>00130 }
<a name="l00131"></a>00131
<a name="l00132"></a>00132 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < _table->size; i++) {
<a name="l00133"></a>00133 UString::Rep *key = _table->entries[i].key;
<a name="l00134"></a>00134 <span class="keywordflow">if</span> (key) {
<a name="l00135"></a>00135 key->deref();
<a name="l00136"></a>00136 _table->entries[i].key = 0;
<a name="l00137"></a>00137 }
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139 _table->keyCount = 0;
<a name="l00140"></a>00140 }
<a name="l00141"></a>00141
<a name="l00142"></a>00142 <span class="keyword">inline</span> <span class="keywordtype">int</span> PropertyMap::hash(<span class="keyword">const</span> UString::Rep *s)<span class="keyword"> const</span>
<a name="l00143"></a>00143 <span class="keyword"></span>{
<a name="l00144"></a>00144 <span class="keywordflow">return</span> s->hash() & _table->sizeMask;
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146
<a name="l00147"></a>00147 ValueImp *PropertyMap::get(<span class="keyword">const</span> Identifier &name, <span class="keywordtype">int</span> &attributes)<span class="keyword"> const</span>
<a name="l00148"></a>00148 <span class="keyword"></span>{
<a name="l00149"></a>00149 assert(!name.isNull());
<a name="l00150"></a>00150
<a name="l00151"></a>00151 UString::Rep *rep = name._ustring.rep;
<a name="l00152"></a>00152
<a name="l00153"></a>00153 <span class="keywordflow">if</span> (!_table) {
<a name="l00154"></a>00154 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00155"></a>00155 <span class="preprocessor"></span> UString::Rep *key = _singleEntry.key;
<a name="l00156"></a>00156 <span class="keywordflow">if</span> (rep == key) {
<a name="l00157"></a>00157 attributes = _singleEntry.attributes;
<a name="l00158"></a>00158 <span class="keywordflow">return</span> _singleEntry.value;
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160 <span class="preprocessor">#endif</span>
<a name="l00161"></a>00161 <span class="preprocessor"></span> <span class="keywordflow">return</span> 0;
<a name="l00162"></a>00162 }
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="keywordtype">int</span> i = hash(rep);
<a name="l00165"></a>00165 <span class="preprocessor">#if DUMP_STATISTICS</span>
<a name="l00166"></a>00166 <span class="preprocessor"></span> ++numProbes;
<a name="l00167"></a>00167 numCollisions += _table->entries[i].key && _table->entries[i].key != rep;
<a name="l00168"></a>00168 <span class="preprocessor">#endif</span>
<a name="l00169"></a>00169 <span class="preprocessor"></span> <span class="keywordflow">while</span> (UString::Rep *key = _table->entries[i].key) {
<a name="l00170"></a>00170 <span class="keywordflow">if</span> (rep == key) {
<a name="l00171"></a>00171 attributes = _table->entries[i].attributes;
<a name="l00172"></a>00172 <span class="keywordflow">return</span> _table->entries[i].value;
<a name="l00173"></a>00173 }
<a name="l00174"></a>00174 i = (i + 1) & _table->sizeMask;
<a name="l00175"></a>00175 }
<a name="l00176"></a>00176 <span class="keywordflow">return</span> 0;
<a name="l00177"></a>00177 }
<a name="l00178"></a>00178
<a name="l00179"></a>00179 ValueImp *PropertyMap::get(<span class="keyword">const</span> Identifier &name)<span class="keyword"> const</span>
<a name="l00180"></a>00180 <span class="keyword"></span>{
<a name="l00181"></a>00181 assert(!name.isNull());
<a name="l00182"></a>00182
<a name="l00183"></a>00183 UString::Rep *rep = name._ustring.rep;
<a name="l00184"></a>00184
<a name="l00185"></a>00185 <span class="keywordflow">if</span> (!_table) {
<a name="l00186"></a>00186 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00187"></a>00187 <span class="preprocessor"></span> UString::Rep *key = _singleEntry.key;
<a name="l00188"></a>00188 <span class="keywordflow">if</span> (rep == key)
<a name="l00189"></a>00189 <span class="keywordflow">return</span> _singleEntry.value;
<a name="l00190"></a>00190 <span class="preprocessor">#endif</span>
<a name="l00191"></a>00191 <span class="preprocessor"></span> <span class="keywordflow">return</span> 0;
<a name="l00192"></a>00192 }
<a name="l00193"></a>00193
<a name="l00194"></a>00194 <span class="keywordtype">int</span> i = hash(rep);
<a name="l00195"></a>00195 <span class="preprocessor">#if DUMP_STATISTICS</span>
<a name="l00196"></a>00196 <span class="preprocessor"></span> ++numProbes;
<a name="l00197"></a>00197 numCollisions += _table->entries[i].key && _table->entries[i].key != rep;
<a name="l00198"></a>00198 <span class="preprocessor">#endif</span>
<a name="l00199"></a>00199 <span class="preprocessor"></span> <span class="keywordflow">while</span> (UString::Rep *key = _table->entries[i].key) {
<a name="l00200"></a>00200 <span class="keywordflow">if</span> (rep == key)
<a name="l00201"></a>00201 <span class="keywordflow">return</span> _table->entries[i].value;
<a name="l00202"></a>00202 i = (i + 1) & _table->sizeMask;
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204 <span class="keywordflow">return</span> 0;
<a name="l00205"></a>00205 }
<a name="l00206"></a>00206
<a name="l00207"></a>00207 <span class="preprocessor">#if DEBUG_PROPERTIES</span>
<a name="l00208"></a>00208 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">void</span> printAttributes(<span class="keywordtype">int</span> attributes)
<a name="l00209"></a>00209 {
<a name="l00210"></a>00210 <span class="keywordflow">if</span> (attributes == 0)
<a name="l00211"></a>00211 printf (<span class="stringliteral">"None "</span>);
<a name="l00212"></a>00212 <span class="keywordflow">if</span> (attributes & ReadOnly)
<a name="l00213"></a>00213 printf (<span class="stringliteral">"ReadOnly "</span>);
<a name="l00214"></a>00214 <span class="keywordflow">if</span> (attributes & DontEnum)
<a name="l00215"></a>00215 printf (<span class="stringliteral">"DontEnum "</span>);
<a name="l00216"></a>00216 <span class="keywordflow">if</span> (attributes & DontDelete)
<a name="l00217"></a>00217 printf (<span class="stringliteral">"DontDelete "</span>);
<a name="l00218"></a>00218 <span class="keywordflow">if</span> (attributes & Internal)
<a name="l00219"></a>00219 printf (<span class="stringliteral">"Internal "</span>);
<a name="l00220"></a>00220 <span class="keywordflow">if</span> (attributes & Function)
<a name="l00221"></a>00221 printf (<span class="stringliteral">"Function "</span>);
<a name="l00222"></a>00222 }
<a name="l00223"></a>00223 <span class="preprocessor">#endif</span>
<a name="l00224"></a>00224 <span class="preprocessor"></span>
<a name="l00225"></a>00225 <span class="keywordtype">void</span> PropertyMap::put(<span class="keyword">const</span> Identifier &name, ValueImp *value, <span class="keywordtype">int</span> attributes)
<a name="l00226"></a>00226 {
<a name="l00227"></a>00227 assert(!name.isNull());
<a name="l00228"></a>00228 assert(value != 0);
<a name="l00229"></a>00229
<a name="l00230"></a>00230 <span class="preprocessor">#if DO_CONSISTENCY_CHECK // speed, why call a stub if we dont need to??</span>
<a name="l00231"></a>00231 <span class="preprocessor"></span> checkConsistency();
<a name="l00232"></a>00232 <span class="preprocessor">#endif</span>
<a name="l00233"></a>00233 <span class="preprocessor"></span>
<a name="l00234"></a>00234 UString::Rep *rep = name._ustring.rep;
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <span class="preprocessor">#if DEBUG_PROPERTIES</span>
<a name="l00237"></a>00237 <span class="preprocessor"></span> printf(<span class="stringliteral">"adding property %s, attributes = 0x%08x ("</span>, name.ascii(), attributes);
<a name="l00238"></a>00238 printAttributes(attributes);
<a name="l00239"></a>00239 printf(<span class="stringliteral">")\n"</span>);
<a name="l00240"></a>00240 <span class="preprocessor">#endif</span>
<a name="l00241"></a>00241 <span class="preprocessor"></span>
<a name="l00242"></a>00242 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00243"></a>00243 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!_table) {
<a name="l00244"></a>00244 UString::Rep *key = _singleEntry.key;
<a name="l00245"></a>00245 <span class="keywordflow">if</span> (key) {
<a name="l00246"></a>00246 <span class="keywordflow">if</span> (rep == key) {
<a name="l00247"></a>00247 _singleEntry.value = value;
<a name="l00248"></a>00248 <span class="keywordflow">return</span>;
<a name="l00249"></a>00249 }
<a name="l00250"></a>00250 } <span class="keywordflow">else</span> {
<a name="l00251"></a>00251 rep->ref();
<a name="l00252"></a>00252 _singleEntry.key = rep;
<a name="l00253"></a>00253 _singleEntry.value = value;
<a name="l00254"></a>00254 _singleEntry.attributes = attributes;
<a name="l00255"></a>00255 checkConsistency();
<a name="l00256"></a>00256 <span class="keywordflow">return</span>;
<a name="l00257"></a>00257 }
<a name="l00258"></a>00258 }
<a name="l00259"></a>00259 <span class="preprocessor">#endif</span>
<a name="l00260"></a>00260 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!_table || _table->keyCount * 2 >= _table->size)
<a name="l00261"></a>00261 expand();
<a name="l00262"></a>00262 <span class="keywordtype">int</span> i = hash(rep);
<a name="l00263"></a>00263 <span class="preprocessor">#if DUMP_STATISTICS</span>
<a name="l00264"></a>00264 <span class="preprocessor"></span> ++numProbes;
<a name="l00265"></a>00265 numCollisions += _table->entries[i].key && _table->entries[i].key != rep;
<a name="l00266"></a>00266 <span class="preprocessor">#endif</span>
<a name="l00267"></a>00267 <span class="preprocessor"></span> <span class="keywordflow">while</span> (UString::Rep *key = _table->entries[i].key) {
<a name="l00268"></a>00268 <span class="keywordflow">if</span> (rep == key) {
<a name="l00269"></a>00269 <span class="comment">// Put a new value in an existing hash table entry.</span>
<a name="l00270"></a>00270 _table->entries[i].value = value;
<a name="l00271"></a>00271 <span class="comment">// Attributes are intentionally not updated.</span>
<a name="l00272"></a>00272 <span class="keywordflow">return</span>;
<a name="l00273"></a>00273 }
<a name="l00274"></a>00274 i = (i + 1) & _table->sizeMask;
<a name="l00275"></a>00275 }
<a name="l00276"></a>00276
<a name="l00277"></a>00277 <span class="comment">// Create a new hash table entry.</span>
<a name="l00278"></a>00278 rep->ref();
<a name="l00279"></a>00279 _table->entries[i].key = rep;
<a name="l00280"></a>00280 _table->entries[i].value = value;
<a name="l00281"></a>00281 _table->entries[i].attributes = attributes;
<a name="l00282"></a>00282 ++_table->keyCount;
<a name="l00283"></a>00283
<a name="l00284"></a>00284 <span class="comment">// store insert order</span>
<a name="l00285"></a>00285 _table->indexCount++;
<a name="l00286"></a>00286 _table->hashToIndex[i] = _table->indexCount;
<a name="l00287"></a>00287
<a name="l00288"></a>00288 <span class="preprocessor">#if DO_CONSISTENCY_CHECK// speed, why call a stub if we dont need to??</span>
<a name="l00289"></a>00289 <span class="preprocessor"></span> checkConsistency();
<a name="l00290"></a>00290 <span class="preprocessor">#endif</span>
<a name="l00291"></a>00291 <span class="preprocessor"></span>}
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <span class="keyword">inline</span> <span class="keywordtype">void</span> PropertyMap::insert(UString::Rep *key, ValueImp *value, <span class="keywordtype">int</span> attributes)
<a name="l00294"></a>00294 {
<a name="l00295"></a>00295 assert(_table);
<a name="l00296"></a>00296
<a name="l00297"></a>00297 <span class="keywordtype">int</span> i = hash(key);
<a name="l00298"></a>00298 <span class="preprocessor">#if DUMP_STATISTICS</span>
<a name="l00299"></a>00299 <span class="preprocessor"></span> ++numProbes;
<a name="l00300"></a>00300 numCollisions += _table->entries[i].key && _table->entries[i].key != key;
<a name="l00301"></a>00301 <span class="preprocessor">#endif</span>
<a name="l00302"></a>00302 <span class="preprocessor"></span> <span class="keywordflow">while</span> (_table->entries[i].key)
<a name="l00303"></a>00303 i = (i + 1) & _table->sizeMask;
<a name="l00304"></a>00304
<a name="l00305"></a>00305 _table->entries[i].key = key;
<a name="l00306"></a>00306 _table->entries[i].value = value;
<a name="l00307"></a>00307 _table->entries[i].attributes = attributes;
<a name="l00308"></a>00308 }
<a name="l00309"></a>00309
<a name="l00310"></a>00310 <span class="keywordtype">void</span> PropertyMap::expand()
<a name="l00311"></a>00311 {
<a name="l00312"></a>00312 <span class="preprocessor">#if DO_CONSISTENCY_CHECK// speed, why call a stub if we dont need to??</span>
<a name="l00313"></a>00313 <span class="preprocessor"></span> checkConsistency();
<a name="l00314"></a>00314 <span class="preprocessor">#endif</span>
<a name="l00315"></a>00315 <span class="preprocessor"></span> Table *oldTable = _table;
<a name="l00316"></a>00316
<a name="l00317"></a>00317 <span class="keywordtype">int</span> oldTableSize = oldTable ? oldTable->size : 0;
<a name="l00318"></a>00318
<a name="l00319"></a>00319 <span class="keywordtype">int</span> newTableSize = oldTableSize ? oldTableSize * 2 : 16;
<a name="l00320"></a>00320
<a name="l00321"></a>00321 <span class="comment">// Is this realy the best way? wouldnt it be easier to use new/delete on an array instead</span>
<a name="l00322"></a>00322 <span class="comment">// and do a pointer in Table to that array, that way we wouldnt need to delete the whole _table</span>
<a name="l00323"></a>00323 <span class="comment">// every time we need to expand</span>
<a name="l00324"></a>00324 _table = (Table *)calloc(1, <span class="keyword">sizeof</span>(Table) + ((newTableSize - 1) * <span class="keyword">sizeof</span>(Entry)) );
<a name="l00325"></a>00325
<a name="l00326"></a>00326 <span class="keywordtype">int</span> *p = <span class="keyword">new</span> <span class="keywordtype">int</span>[newTableSize];
<a name="l00327"></a>00327 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < newTableSize; i++)
<a name="l00328"></a>00328 p[i] = 0;
<a name="l00329"></a>00329
<a name="l00330"></a>00330 _table->hashToIndex = p;
<a name="l00331"></a>00331
<a name="l00332"></a>00332 _table->size = newTableSize;
<a name="l00333"></a>00333
<a name="l00334"></a>00334 _table->sizeMask = newTableSize - 1;
<a name="l00335"></a>00335
<a name="l00336"></a>00336 _table->keyCount = oldTable ? oldTable->keyCount : 0;
<a name="l00337"></a>00337
<a name="l00338"></a>00338 _table->indexCount = oldTable ? oldTable->indexCount : 0;
<a name="l00339"></a>00339
<a name="l00340"></a>00340 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00341"></a>00341 <span class="preprocessor"></span> UString::Rep *key = _singleEntry.key;
<a name="l00342"></a>00342 <span class="keywordflow">if</span> (key) {
<a name="l00343"></a>00343 insert(key, _singleEntry.value, _singleEntry.attributes);
<a name="l00344"></a>00344 _table->keyCount++;
<a name="l00345"></a>00345 _singleEntry.key = 0;
<a name="l00346"></a>00346
<a name="l00347"></a>00347 <span class="comment">// store sort order</span>
<a name="l00348"></a>00348 <span class="comment">// first get the id of newly inserted key, check for trashed hash, then store it</span>
<a name="l00349"></a>00349 <span class="keywordtype">int</span> k = hash(key);
<a name="l00350"></a>00350 <span class="preprocessor">#if DUMP_STATISTICS</span>
<a name="l00351"></a>00351 <span class="preprocessor"></span> ++numProbes;
<a name="l00352"></a>00352 numCollisions += _table->entries[k].key && _table->entries[k].key != key;
<a name="l00353"></a>00353 <span class="preprocessor">#endif</span>
<a name="l00354"></a>00354 <span class="preprocessor"></span> <span class="keywordflow">while</span> (UString::Rep *newKey = _table->entries[k].key) {
<a name="l00355"></a>00355 <span class="keywordflow">if</span> (key == newKey)
<a name="l00356"></a>00356 <span class="keywordflow">break</span>;
<a name="l00357"></a>00357 k = (k + 1) & _table->sizeMask;
<a name="l00358"></a>00358 }
<a name="l00359"></a>00359 _table->indexCount++;
<a name="l00360"></a>00360 _table->hashToIndex[k] = _table->indexCount;
<a name="l00361"></a>00361 }
<a name="l00362"></a>00362 <span class="preprocessor">#endif</span>
<a name="l00363"></a>00363 <span class="preprocessor"></span>
<a name="l00364"></a>00364 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i != oldTableSize; ++i) {
<a name="l00365"></a>00365 UString::Rep *key = oldTable->entries[i].key;
<a name="l00366"></a>00366 <span class="keywordflow">if</span> (key) {
<a name="l00367"></a>00367 insert(key, oldTable->entries[i].value, oldTable->entries[i].attributes);
<a name="l00368"></a>00368
<a name="l00369"></a>00369 <span class="comment">// store sort order</span>
<a name="l00370"></a>00370 <span class="comment">// first get the id of newly inserted key, check for trashed hash, then store it</span>
<a name="l00371"></a>00371 <span class="keywordtype">int</span> k = hash(key);
<a name="l00372"></a>00372 <span class="preprocessor">#if DUMP_STATISTICS</span>
<a name="l00373"></a>00373 <span class="preprocessor"></span> ++numProbes;
<a name="l00374"></a>00374 numCollisions += _table->entries[k].key && _table->entries[k].key != key;
<a name="l00375"></a>00375 <span class="preprocessor">#endif</span>
<a name="l00376"></a>00376 <span class="preprocessor"></span> <span class="keywordflow">while</span> (UString::Rep *newKey = _table->entries[k].key) {
<a name="l00377"></a>00377 <span class="keywordflow">if</span> (key == newKey)
<a name="l00378"></a>00378 <span class="keywordflow">break</span>;
<a name="l00379"></a>00379 k = (k + 1) & _table->sizeMask;
<a name="l00380"></a>00380 }
<a name="l00381"></a>00381 <span class="comment">// store hashindex on the newly inserted entry</span>
<a name="l00382"></a>00382 _table->hashToIndex[k] = oldTable->hashToIndex[i];
<a name="l00383"></a>00383 }
<a name="l00384"></a>00384 }
<a name="l00385"></a>00385
<a name="l00386"></a>00386 <span class="keywordflow">if</span> (oldTable){
<a name="l00387"></a>00387 <span class="keyword">delete</span> [] oldTable->hashToIndex;
<a name="l00388"></a>00388 }
<a name="l00389"></a>00389 free(oldTable);
<a name="l00390"></a>00390
<a name="l00391"></a>00391 <span class="preprocessor">#if DO_CONSISTENCY_CHECK// speed, why call a stub if we dont need to??</span>
<a name="l00392"></a>00392 <span class="preprocessor"></span> checkConsistency();
<a name="l00393"></a>00393 <span class="preprocessor">#endif</span>
<a name="l00394"></a>00394 <span class="preprocessor"></span>}
<a name="l00395"></a>00395
<a name="l00396"></a>00396 <span class="keywordtype">void</span> PropertyMap::remove(<span class="keyword">const</span> Identifier &name)
<a name="l00397"></a>00397 {
<a name="l00398"></a>00398 assert(!name.isNull());
<a name="l00399"></a>00399
<a name="l00400"></a>00400 <span class="preprocessor">#if DO_CONSISTENCY_CHECK// speed, why call a stub if we dont need to??</span>
<a name="l00401"></a>00401 <span class="preprocessor"></span> checkConsistency();
<a name="l00402"></a>00402 <span class="preprocessor">#endif</span>
<a name="l00403"></a>00403 <span class="preprocessor"></span>
<a name="l00404"></a>00404 UString::Rep *rep = name._ustring.rep;
<a name="l00405"></a>00405
<a name="l00406"></a>00406 UString::Rep *key;
<a name="l00407"></a>00407
<a name="l00408"></a>00408 <span class="keywordflow">if</span> (!_table) {
<a name="l00409"></a>00409 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00410"></a>00410 <span class="preprocessor"></span> key = _singleEntry.key;
<a name="l00411"></a>00411 <span class="keywordflow">if</span> (rep == key) {
<a name="l00412"></a>00412 key->deref();
<a name="l00413"></a>00413 _singleEntry.key = 0;
<a name="l00414"></a>00414 checkConsistency();
<a name="l00415"></a>00415 }
<a name="l00416"></a>00416 <span class="preprocessor">#endif</span>
<a name="l00417"></a>00417 <span class="preprocessor"></span> <span class="keywordflow">return</span>;
<a name="l00418"></a>00418 }
<a name="l00419"></a>00419
<a name="l00420"></a>00420 <span class="comment">// Find the thing to remove.</span>
<a name="l00421"></a>00421 <span class="keywordtype">int</span> i = hash(rep);
<a name="l00422"></a>00422 <span class="preprocessor">#if DUMP_STATISTICS</span>
<a name="l00423"></a>00423 <span class="preprocessor"></span> ++numProbes;
<a name="l00424"></a>00424 numCollisions += _table->entries[i].key && _table->entries[i].key != rep;
<a name="l00425"></a>00425 <span class="preprocessor">#endif</span>
<a name="l00426"></a>00426 <span class="preprocessor"></span> <span class="keywordflow">while</span> ((key = _table->entries[i].key)) {
<a name="l00427"></a>00427 <span class="keywordflow">if</span> (rep == key)
<a name="l00428"></a>00428 <span class="keywordflow">break</span>;
<a name="l00429"></a>00429 i = (i + 1) & _table->sizeMask;
<a name="l00430"></a>00430 }
<a name="l00431"></a>00431
<a name="l00432"></a>00432 <span class="keywordflow">if</span> (!key)
<a name="l00433"></a>00433 <span class="keywordflow">return</span>;
<a name="l00434"></a>00434
<a name="l00435"></a>00435 <span class="comment">// Remove the one key.</span>
<a name="l00436"></a>00436 key->deref();
<a name="l00437"></a>00437 _table->entries[i].key = 0;
<a name="l00438"></a>00438 assert(_table->keyCount >= 1);
<a name="l00439"></a>00439 --_table->keyCount;
<a name="l00440"></a>00440
<a name="l00441"></a>00441 <span class="comment">// Reinsert all the items to the right in the same cluster.</span>
<a name="l00442"></a>00442 <span class="keywordflow">while</span> (1) {
<a name="l00443"></a>00443 i = (i + 1) & _table->sizeMask;
<a name="l00444"></a>00444 key = _table->entries[i].key;
<a name="l00445"></a>00445 if (!key)
<a name="l00446"></a>00446 <span class="keywordflow">break</span>;
<a name="l00447"></a>00447
<a name="l00448"></a>00448 _table->entries[i].key = 0;
<a name="l00449"></a>00449
<a name="l00450"></a>00450 insert(key, _table->entries[i].value, _table->entries[i].attributes);
<a name="l00451"></a>00451
<a name="l00452"></a>00452 <span class="comment">// store the index of the new hash</span>
<a name="l00453"></a>00453 <span class="keywordtype">int</span> k = hash(key);
<a name="l00454"></a>00454 <span class="preprocessor">#if DUMP_STATISTICS</span>
<a name="l00455"></a>00455 <span class="preprocessor"></span> ++numProbes;
<a name="l00456"></a>00456 numCollisions += _table->entries[k].key && _table->entries[k].key != key;
<a name="l00457"></a>00457 <span class="preprocessor">#endif</span>
<a name="l00458"></a>00458 <span class="preprocessor"></span> <span class="keywordflow">while</span> (UString::Rep *newKey = _table->entries[k].key) {
<a name="l00459"></a>00459 <span class="keywordflow">if</span> (key == newKey)
<a name="l00460"></a>00460 <span class="keywordflow">break</span>;
<a name="l00461"></a>00461 k = (k + 1) & _table->sizeMask;
<a name="l00462"></a>00462 }
<a name="l00463"></a>00463
<a name="l00464"></a>00464 <span class="comment">// store hashindex on the newly moved entry</span>
<a name="l00465"></a>00465 _table->hashToIndex[k] = _table->hashToIndex[i];
<a name="l00466"></a>00466 }
<a name="l00467"></a>00467
<a name="l00468"></a>00468 <span class="preprocessor">#if DO_CONSISTENCY_CHECK// speed, why call a stub if we dont need to??</span>
<a name="l00469"></a>00469 <span class="preprocessor"></span> checkConsistency();
<a name="l00470"></a>00470 <span class="preprocessor">#endif</span>
<a name="l00471"></a>00471 <span class="preprocessor"></span>}
<a name="l00472"></a>00472
<a name="l00473"></a>00473 <span class="keywordtype">void</span> PropertyMap::mark()<span class="keyword"> const</span>
<a name="l00474"></a>00474 <span class="keyword"></span>{
<a name="l00475"></a>00475 <span class="keywordflow">if</span> (!_table) {
<a name="l00476"></a>00476 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00477"></a>00477 <span class="preprocessor"></span> <span class="keywordflow">if</span> (_singleEntry.key) {
<a name="l00478"></a>00478 ValueImp *v = _singleEntry.value;
<a name="l00479"></a>00479 <span class="keywordflow">if</span> (!v->marked())
<a name="l00480"></a>00480 v->mark();
<a name="l00481"></a>00481 }
<a name="l00482"></a>00482 <span class="preprocessor">#endif</span>
<a name="l00483"></a>00483 <span class="preprocessor"></span> <span class="keywordflow">return</span>;
<a name="l00484"></a>00484 }
<a name="l00485"></a>00485
<a name="l00486"></a>00486 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i != _table->size; ++i) {
<a name="l00487"></a>00487 <span class="keywordflow">if</span> (_table->entries[i].key) {
<a name="l00488"></a>00488 ValueImp *v = _table->entries[i].value;
<a name="l00489"></a>00489 <span class="keywordflow">if</span> (!v->marked())
<a name="l00490"></a>00490 v->mark();
<a name="l00491"></a>00491 }
<a name="l00492"></a>00492 }
<a name="l00493"></a>00493 }
<a name="l00494"></a>00494
<a name="l00495"></a>00495 <span class="keywordtype">void</span> PropertyMap::addEnumerablesToReferenceList(ReferenceList &list, <span class="keyword">const</span> Object &base)<span class="keyword"> const</span>
<a name="l00496"></a>00496 <span class="keyword"></span>{
<a name="l00497"></a>00497 <span class="keywordflow">if</span> (!_table) {
<a name="l00498"></a>00498 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00499"></a>00499 <span class="preprocessor"></span> UString::Rep *key = _singleEntry.key;
<a name="l00500"></a>00500 <span class="keywordflow">if</span> (key && !(_singleEntry.attributes & DontEnum))
<a name="l00501"></a>00501 list.append(Reference(base, Identifier(key)));
<a name="l00502"></a>00502 <span class="preprocessor">#endif</span>
<a name="l00503"></a>00503 <span class="preprocessor"></span> <span class="keywordflow">return</span>;
<a name="l00504"></a>00504 }
<a name="l00505"></a>00505
<a name="l00506"></a>00506 <span class="comment">// Allocate a buffer to use to sort the keys.</span>
<a name="l00507"></a>00507 <span class="keywordtype">int</span> indexSize = _table->indexCount + 1; <span class="comment">// indexes is one based</span>
<a name="l00508"></a>00508 UString::Rep **allKeys = <span class="keyword">new</span> UString::Rep*[indexSize];
<a name="l00509"></a>00509
<a name="l00510"></a>00510 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < indexSize; i++)
<a name="l00511"></a>00511 allKeys[i] = NULL;
<a name="l00512"></a>00512
<a name="l00513"></a>00513 <span class="comment">// push valid hashes to the array allKeys, using insert order as index.</span>
<a name="l00514"></a>00514 <span class="comment">// we need to pass array hashes instead of pointers to keys, because we got</span>
<a name="l00515"></a>00515 <span class="comment">// memory corruption sometimes, seems that Identifier in below call deletes the key</span>
<a name="l00516"></a>00516 <span class="keywordtype">int</span> size = _table->size;
<a name="l00517"></a>00517 Entry *entries = _table->entries;
<a name="l00518"></a>00518 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i != size; ++i) {
<a name="l00519"></a>00519 <span class="keywordflow">if</span> (entries[i].key && !(entries[i].attributes & DontEnum)) {
<a name="l00520"></a>00520 <span class="keywordtype">int</span> idx = _table->hashToIndex[i];
<a name="l00521"></a>00521 <span class="keywordflow">if</span> (idx) {
<a name="l00522"></a>00522 allKeys[idx] = entries[i].key;
<a name="l00523"></a>00523 } <span class="keywordflow">else</span> { <span class="comment">// nonsorted key, failure</span>
<a name="l00524"></a>00524 <span class="comment">//cout<<"Error with in KJS property_map.addEnumerablesToReferenceList \nUnsorted key"<<endl;</span>
<a name="l00525"></a>00525 assert(0==1); <span class="comment">// allways throw error if get here</span>
<a name="l00526"></a>00526 }
<a name="l00527"></a>00527 }
<a name="l00528"></a>00528 }
<a name="l00529"></a>00529 <span class="comment">// Put the keys of the sorted entries into the reference list.</span>
<a name="l00530"></a>00530 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < indexSize; ++i) {
<a name="l00531"></a>00531 <span class="keywordflow">if</span> (allKeys[i] != NULL){
<a name="l00532"></a>00532 list.append(Reference(base, Identifier(allKeys[i])));
<a name="l00533"></a>00533 }
<a name="l00534"></a>00534 allKeys[i] = NULL; <span class="comment">// dont deallocate key by accident, when we delete allKeys</span>
<a name="l00535"></a>00535 }
<a name="l00536"></a>00536
<a name="l00537"></a>00537 <span class="comment">// Deallocate the buffer.</span>
<a name="l00538"></a>00538 <span class="keyword">delete</span> [] allKeys;
<a name="l00539"></a>00539 }
<a name="l00540"></a>00540
<a name="l00541"></a>00541 <span class="keywordtype">void</span> PropertyMap::addSparseArrayPropertiesToReferenceList(ReferenceList &list, <span class="keyword">const</span> Object &base)<span class="keyword"> const</span>
<a name="l00542"></a>00542 <span class="keyword"></span>{
<a name="l00543"></a>00543 <span class="comment">// NOTE: I did'nt add sort in this method because It seems to be referenced in ArrayInstanceImp</span>
<a name="l00544"></a>00544 <span class="comment">// only and arrays are sorted by definition, dont need the extra overhead</span>
<a name="l00545"></a>00545 <span class="keywordflow">if</span> (!_table) {
<a name="l00546"></a>00546 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00547"></a>00547 <span class="preprocessor"></span> UString::Rep *key = _singleEntry.key;
<a name="l00548"></a>00548 <span class="keywordflow">if</span> (key) {
<a name="l00549"></a>00549 UString k(key);
<a name="l00550"></a>00550 <span class="keywordtype">bool</span> fitsInULong;
<a name="l00551"></a>00551 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = k.toULong(&fitsInULong);
<a name="l00552"></a>00552 <span class="keywordflow">if</span> (fitsInULong && i <= 0xFFFFFFFFU)
<a name="l00553"></a>00553 list.append(Reference(base, Identifier(key)));
<a name="l00554"></a>00554 }
<a name="l00555"></a>00555 <span class="preprocessor">#endif</span>
<a name="l00556"></a>00556 <span class="preprocessor"></span> <span class="keywordflow">return</span>;
<a name="l00557"></a>00557 }
<a name="l00558"></a>00558
<a name="l00559"></a>00559 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i != _table->size; ++i) {
<a name="l00560"></a>00560 UString::Rep *key = _table->entries[i].key;
<a name="l00561"></a>00561 <span class="keywordflow">if</span> (key) {
<a name="l00562"></a>00562 UString k(key);
<a name="l00563"></a>00563 <span class="keywordtype">bool</span> fitsInULong;
<a name="l00564"></a>00564 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = k.toULong(&fitsInULong);
<a name="l00565"></a>00565 <span class="keywordflow">if</span> (fitsInULong && i <= 0xFFFFFFFFU)
<a name="l00566"></a>00566 list.append(Reference(base, Identifier(key)));
<a name="l00567"></a>00567 }
<a name="l00568"></a>00568 }
<a name="l00569"></a>00569 }
<a name="l00570"></a>00570
<a name="l00571"></a>00571 <span class="keywordtype">void</span> PropertyMap::save(SavedProperties &p)<span class="keyword"> const</span>
<a name="l00572"></a>00572 <span class="keyword"></span>{
<a name="l00573"></a>00573 <span class="keywordtype">int</span> count = 0;
<a name="l00574"></a>00574
<a name="l00575"></a>00575 <span class="keywordflow">if</span> (!_table) {
<a name="l00576"></a>00576 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00577"></a>00577 <span class="preprocessor"></span> <span class="keywordflow">if</span> (_singleEntry.key && !(_singleEntry.attributes & (ReadOnly | DontEnum | Function)))
<a name="l00578"></a>00578 ++count;
<a name="l00579"></a>00579 <span class="preprocessor">#endif</span>
<a name="l00580"></a>00580 <span class="preprocessor"></span> } <span class="keywordflow">else</span> {
<a name="l00581"></a>00581 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i != _table->size; ++i)
<a name="l00582"></a>00582 <span class="keywordflow">if</span> (_table->entries[i].key && !(_table->entries[i].attributes & (ReadOnly | DontEnum | Function)))
<a name="l00583"></a>00583 ++count;
<a name="l00584"></a>00584 }
<a name="l00585"></a>00585
<a name="l00586"></a>00586 <span class="keyword">delete</span> [] p._properties;
<a name="l00587"></a>00587
<a name="l00588"></a>00588 p._count = count;
<a name="l00589"></a>00589
<a name="l00590"></a>00590 <span class="keywordflow">if</span> (count == 0) {
<a name="l00591"></a>00591 p._properties = 0;
<a name="l00592"></a>00592 <span class="keywordflow">return</span>;
<a name="l00593"></a>00593 }
<a name="l00594"></a>00594
<a name="l00595"></a>00595 p._properties = <span class="keyword">new</span> SavedProperty [count];
<a name="l00596"></a>00596
<a name="l00597"></a>00597 SavedProperty *prop = p._properties;
<a name="l00598"></a>00598
<a name="l00599"></a>00599 <span class="keywordflow">if</span> (!_table) {
<a name="l00600"></a>00600 <span class="preprocessor">#if USE_SINGLE_ENTRY</span>
<a name="l00601"></a>00601 <span class="preprocessor"></span> <span class="keywordflow">if</span> (_singleEntry.key && !(_singleEntry.attributes & (ReadOnly | DontEnum | Function))) {
<a name="l00602"></a>00602 prop->key = Identifier(_singleEntry.key);
<a name="l00603"></a>00603 prop->value = Value(_singleEntry.value);
<a name="l00604"></a>00604 prop->attributes = _singleEntry.attributes;
<a name="l00605"></a>00605 ++prop;
<a name="l00606"></a>00606 }
<a name="l00607"></a>00607 <span class="preprocessor">#endif</span>
<a name="l00608"></a>00608 <span class="preprocessor"></span> } <span class="keywordflow">else</span> {
<a name="l00609"></a>00609 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i != _table->size; ++i) {
<a name="l00610"></a>00610 <span class="keywordflow">if</span> (_table->entries[i].key && !(_table->entries[i].attributes & (ReadOnly | DontEnum | Function))) {
<a name="l00611"></a>00611 prop->key = Identifier(_table->entries[i].key);
<a name="l00612"></a>00612 prop->value = Value(_table->entries[i].value);
<a name="l00613"></a>00613 prop->attributes = _table->entries[i].attributes;
<a name="l00614"></a>00614 ++prop;
<a name="l00615"></a>00615 }
<a name="l00616"></a>00616 }
<a name="l00617"></a>00617 }
<a name="l00618"></a>00618 }
<a name="l00619"></a>00619
<a name="l00620"></a>00620 <span class="keywordtype">void</span> PropertyMap::restore(<span class="keyword">const</span> SavedProperties &p)
<a name="l00621"></a>00621 {
<a name="l00622"></a>00622 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i != p._count; ++i)
<a name="l00623"></a>00623 put(p._properties[i].key, p._properties[i].value.imp(), p._properties[i].attributes);
<a name="l00624"></a>00624 }
<a name="l00625"></a>00625
<a name="l00626"></a>00626 <span class="preprocessor">#if DO_CONSISTENCY_CHECK</span>
<a name="l00627"></a>00627 <span class="preprocessor"></span>
<a name="l00628"></a>00628 <span class="keywordtype">void</span> PropertyMap::checkConsistency()
<a name="l00629"></a>00629 {
<a name="l00630"></a>00630 <span class="keywordflow">if</span> (!_table)
<a name="l00631"></a>00631 <span class="keywordflow">return</span>;
<a name="l00632"></a>00632
<a name="l00633"></a>00633 <span class="keywordtype">int</span> count = 0;
<a name="l00634"></a>00634 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j != _table->size; ++j) {
<a name="l00635"></a>00635 UString::Rep *rep = _table->entries[j].key;
<a name="l00636"></a>00636 <span class="keywordflow">if</span> (!rep)
<a name="l00637"></a>00637 <span class="keywordflow">continue</span>;
<a name="l00638"></a>00638 <span class="keywordtype">int</span> i = hash(rep);
<a name="l00639"></a>00639 <span class="keywordflow">while</span> (UString::Rep *key = _table->entries[i].key) {
<a name="l00640"></a>00640 <span class="keywordflow">if</span> (rep == key)
<a name="l00641"></a>00641 <span class="keywordflow">break</span>;
<a name="l00642"></a>00642 i = (i + 1) & _table->sizeMask;
<a name="l00643"></a>00643 }
<a name="l00644"></a>00644 assert(i == j);
<a name="l00645"></a>00645 assert(_table->hashToIndex[i] > 0);
<a name="l00646"></a>00646 count++;
<a name="l00647"></a>00647 }
<a name="l00648"></a>00648 assert(count == _table->keyCount);
<a name="l00649"></a>00649 assert(_table->size >= 16);
<a name="l00650"></a>00650 assert(_table->sizeMask);
<a name="l00651"></a>00651 assert(_table->size == _table->sizeMask + 1);
<a name="l00652"></a>00652 }
<a name="l00653"></a>00653
<a name="l00654"></a>00654 <span class="preprocessor">#endif // DO_CONSISTENCY_CHECK</span>
<a name="l00655"></a>00655 <span class="preprocessor"></span>
<a name="l00656"></a>00656 } <span class="comment">// namespace KJS</span>
</pre></div></div>
</div>
</div></div>
</td>
</tr>
<tr>
<td valign="top" id="leftmenu" width="25%">
<a name="navigation"></a>
<div class="menu_box"><h2>kjs</h2>
<div class="nav_list">
<ul><li><a href="index.html">Main Page</a></li><li><a href="hierarchy.html">Class Hierarchy</a></li><li><a href="classes.html">Alphabetical List</a></li><li><a href="annotated.html">Class List</a></li><li><a href="files.html">File List</a></li><li><a href="functions.html">Class Members</a></li><li><a href="pages.html">Related Pages</a></li></ul>
<!--
<h2>Class Picker</h2>
<div style="text-align: center;">
<form name="guideform">
<select name="guidelinks" style="width:100%;" onChange="window.location=document.guideform.guidelinks.options[document.guideform.guidelinks.selectedIndex].value">
<option value="annotated.html">-- Choose --</option>
<option value="classKJS_1_1BinaryLogicalNode.html">kjs::binarylogicalnode</option>, <option value="classKJS_1_1Boolean.html">kjs::boolean</option>, <option value="classKJS_1_1Collector.html">kjs::collector</option>, <option value="classKJS_1_1Completion.html">kjs::completion</option>, <option value="classKJS_1_1ConditionalNode.html">kjs::conditionalnode</option>, <option value="classKJS_1_1Context.html">kjs::context</option>, <option value="classKJS_1_1ContextImp.html">kjs::contextimp</option>, <option value="classKJS_1_1CString.html">kjs::cstring</option>, <option value="classKJS_1_1Error.html">kjs::error</option>, <option value="classKJS_1_1ExecState.html">kjs::execstate</option>, <option value="classKJS_1_1FunctionImp.html">kjs::functionimp</option>, <option value="classKJS_1_1FunctionPrototypeImp.html">kjs::functionprototypeimp</option>, <option value="classKJS_1_1Identifier.html">kjs::identifier</option>, <option value="classKJS_1_1InternalFunctionImp.html">kjs::internalfunctionimp</option>, <option value="classKJS_1_1Interpreter.html">kjs::interpreter</option>, <option value="classKJS_1_1LabelStack.html">kjs::labelstack</option>, <option value="classKJS_1_1List.html">kjs::list</option>, <option value="classKJS_1_1ListIterator.html">kjs::listiterator</option>, <option value="classKJS_1_1Lookup.html">kjs::lookup</option>, <option value="classKJS_1_1Null.html">kjs::null</option>, <option value="classKJS_1_1Number.html">kjs::number</option>, <option value="classKJS_1_1Object.html">kjs::object</option>, <option value="classKJS_1_1PropertyMap.html">kjs::propertymap</option>, <option value="classKJS_1_1Reference.html">kjs::reference</option>, <option value="classKJS_1_1ReferenceList.html">kjs::referencelist</option>, <option value="classKJS_1_1ReferenceListIterator.html">kjs::referencelistiterator</option>, <option value="classKJS_1_1SavedProperties.html">kjs::savedproperties</option>, <option value="classKJS_1_1ScopeChain.html">kjs::scopechain</option>, <option value="classKJS_1_1ScopeChainNode.html">kjs::scopechainnode</option>, <option value="classKJS_1_1String.html">kjs::string</option>, <option value="classKJS_1_1UCharReference.html">kjs::ucharreference</option>, <option value="classKJS_1_1Undefined.html">kjs::undefined</option>, <option value="classKJS_1_1UString.html">kjs::ustring</option>, <option value="classKJS_1_1Value.html">kjs::value</option>, <option value="classKJS_1_1ValueImp.html">kjs::valueimp</option>,
</select>
</form>
</div>
-->
</div></div>
<div class="menu_box"><h2>API Dox</h2>
<div class="nav_list">
<ul>
<li><a href="../../arts/html/index.html">arts</a></li><li><a href="../../dcop/html/index.html">dcop</a></li><li><a href="../../dnssd/html/index.html">dnssd</a></li><li><a href="../../interfaces/html/index.html">interfaces</a></li><li> <a href="../../interfaces/kimproxy/interface/html/index.html">interface</a></li><li> <a href="../../interfaces/kimproxy/library/html/index.html">library</a></li><li> <a href="../../interfaces/kspeech/html/index.html">kspeech</a></li><li> <a href="../../interfaces/ktexteditor/html/index.html">ktexteditor</a></li><li><a href="../../kabc/html/index.html">kabc</a></li><li><a href="../../kate/html/index.html">kate</a></li><li><a href="../../kcmshell/html/index.html">kcmshell</a></li><li><a href="../../kdecore/html/index.html">kdecore</a></li><li><a href="../../kded/html/index.html">kded</a></li><li><a href="../../kdefx/html/index.html">kdefx</a></li><li><a href="../../kdeprint/html/index.html">kdeprint</a></li><li><a href="../../kdesu/html/index.html">kdesu</a></li><li><a href="../../kdeui/html/index.html">kdeui</a></li><li><a href="../../kdoctools/html/index.html">kdoctools</a></li><li><a href="../../khtml/html/index.html">khtml</a></li><li><a href="../../kimgio/html/index.html">kimgio</a></li><li><a href="../../kinit/html/index.html">kinit</a></li><li><a href="../../kio/html/index.html">kio</a></li><li> <a href="../../kio/bookmarks/html/index.html">bookmarks</a></li><li> <a href="../../kio/httpfilter/html/index.html">httpfilter</a></li><li> <a href="../../kio/kfile/html/index.html">kfile</a></li><li> <a href="../../kio/kio/html/index.html">kio</a></li><li> <a href="../../kio/kioexec/html/index.html">kioexec</a></li><li> <a href="../../kio/kpasswdserver/html/index.html">kpasswdserver</a></li><li> <a href="../../kio/kssl/html/index.html">kssl</a></li><li><a href="../../kioslave/html/index.html">kioslave</a></li><li> <a href="../../kioslave/http/html/index.html">http</a></li><li><a href="../../kjs/html/index.html">kjs</a></li><li><a href="../../kmdi/html/index.html">kmdi</a></li><li> <a href="../../kmdi/kmdi/html/index.html">kmdi</a></li><li><a href="../../knewstuff/html/index.html">knewstuff</a></li><li><a href="../../kparts/html/index.html">kparts</a></li><li><a href="../../kresources/html/index.html">kresources</a></li><li><a href="../../kspell2/html/index.html">kspell2</a></li><li><a href="../../kunittest/html/index.html">kunittest</a></li><li><a href="../../kutils/html/index.html">kutils</a></li><li><a href="../../kwallet/html/index.html">kwallet</a></li><li><a href="../../libkmid/html/index.html">libkmid</a></li><li><a href="../../libkscreensaver/html/index.html">libkscreensaver</a></li>
</ul></div></div>
</td>
</tr>
</table>
<span class="doNotDisplay">
<a href="http://www.kde.org/" accesskey="8">KDE Home</a> |
<a href="http://accessibility.kde.org/" accesskey="9">KDE Accessibility Home</a> |
<a href="http://www.kde.org/media/accesskeys.php" accesskey="0">Description of Access Keys</a>
</span>
<div style="height: 8px"></div>
<div id="footer">
<div id="footer_left">
Maintained by <a href="mailto:groot@kde.org">Adriaan de Groot</a>
and
<a href="mailto:winter@kde.org">Allen Winter</a>.
<br/>
KDE and K Desktop Environment are trademarks of <a href="http://www.kde.org/areas/kde-ev/" title="Homepage of the KDE non-profit Organization">KDE e.V.</a> |
<a href="http://www.kde.org/contact/impressum.php">Legal</a>
</div>
<div id="footer_right"><img src="/media/images/footer_right.png" style="margin: 0px" alt="" /></div>
</div>
<!--
WARNING: DO NOT SEND MAIL TO THE FOLLOWING EMAIL ADDRESS! YOU WILL
BE BLOCKED INSTANTLY AND PERMANENTLY!
<a href="mailto:aaaatrap-425acc3b5374943f@kde.org">Block me</a>
WARNING END
-->
</body>
</html>
