1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209
|
/*
* Copyright (C)2005-2012 Haxe Foundation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
package haxe.ds;
@:coreApi class StringMap<T> implements haxe.Constraints.IMap<String,T> {
private var h : Dynamic;
private var rh : Dynamic;
static var reserved = { };
public function new() : Void {
h = {};
}
inline function isReserved(key:String) : Bool {
return untyped __in__(key,reserved);
}
public inline function set( key : String, value : T ) : Void {
if( isReserved(key) )
setReserved(key, value);
else
untyped h[key] = value;
}
public inline function get( key : String ) : Null<T> {
if( isReserved(key) )
return getReserved(key);
return untyped h[key];
}
public inline function exists( key : String ) : Bool {
if( isReserved(key) )
return existsReserved(key);
return untyped __in__(key,h);
}
function setReserved( key : String, value : T ) : Void {
if( rh == null ) rh = {};
untyped rh["$"+key] = value;
}
function getReserved( key : String ) : Null<T> {
return rh == null ? null : untyped rh["$"+key];
}
function existsReserved( key : String ) : Bool {
if( rh == null ) return false;
return untyped __in__("$"+key,rh);
}
public function remove( key : String ) : Bool {
if( isReserved(key) ) {
key = "$" + key;
if( rh == null || !untyped __in__(key,rh) ) return false;
untyped __delete__(rh,key);
return true;
} else {
if( !untyped __in__(key,h) )
return false;
untyped __delete__(h,key);
return true;
}
}
#if as3
// unoptimized version
public function keys() : Iterator<String> {
var out : Array<String> = untyped __keys__(h);
if( rh != null ) out = out.concat(untyped __hkeys__(rh));
return out.iterator();
}
public function iterator() : Iterator<T> {
return untyped {
it : keys(),
hasNext : function() { return __this__.it.hasNext(); },
next : function() { return get(__this__.it.next()); }
};
}
#else
public inline function keys() : Iterator<String> {
return new StringMapKeysIterator(h, rh);
}
public inline function iterator() : Iterator<T> {
return new StringMapValuesIterator<T>(h, rh);
}
#end
public function toString() : String {
var s = new StringBuf();
s.add("{");
var it = keys();
for( i in it ) {
s.add(i);
s.add(" => ");
s.add(Std.string(get(i)));
if( it.hasNext() )
s.add(", ");
}
s.add("}");
return s.toString();
}
}
#if !as3
// this version uses __has_next__/__forin__ special SWF opcodes for iteration with no allocation
@:allow(haxe.ds.StringMap)
private class StringMapKeysIterator {
var h:Dynamic;
var rh:Dynamic;
var index : Int;
var nextIndex : Int;
var isReserved : Bool;
inline function new(h:Dynamic, rh:Dynamic):Void {
this.h = h;
this.rh = rh;
this.index = 0;
isReserved = false;
hasNext();
}
public inline function hasNext():Bool {
var h = h, index = index; // tmp vars required for __has_next
var n = untyped __has_next__(h, index);
if( !n && rh != null ) {
h = this.h = rh;
index = this.index = 0;
rh = null;
isReserved = true;
n = untyped __has_next__(h, index);
}
this.nextIndex = index; // store next index
return n;
}
public inline function next():String {
var r : String = untyped __forin__(h, nextIndex);
index = nextIndex;
if( isReserved ) r = r.substr(1);
return r;
}
}
@:allow(haxe.ds.StringMap)
private class StringMapValuesIterator<T> {
var h:Dynamic;
var rh:Dynamic;
var index : Int;
var nextIndex : Int;
inline function new(h:Dynamic, rh:Dynamic):Void {
this.h = h;
this.rh = rh;
this.index = 0;
hasNext();
}
public inline function hasNext():Bool {
var h = h, index = index; // tmp vars required for __has_next
var n = untyped __has_next__(h, index);
if( !n && rh != null ) {
h = this.h = rh;
index = this.index = 0;
rh = null;
n = untyped __has_next__(h, index);
}
this.nextIndex = index; // store next index
return n;
}
public inline function next():T {
var r = untyped __foreach__(h, nextIndex);
index = nextIndex;
return r;
}
}
#end
|