123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219 |
- /*
- * Copyright (c) 2005, The haXe Project Contributors
- * All rights reserved.
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- * - Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * - Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE HAXE PROJECT CONTRIBUTORS "AS IS" AND ANY
- * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE HAXE PROJECT CONTRIBUTORS BE LIABLE FOR
- * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
- * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
- * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
- * DAMAGE.
- */
- /**
- Hashtable over a set of elements, using [Int] as keys.
- On Flash and Javascript, the underlying structure is an Object.
- **/
- class IntHash<T> {
- private var h : #if flash9 flash.utils.Dictionary #elseif php ArrayAccess<Int> #else Dynamic #end;
- /**
- Creates a new empty hashtable.
- **/
- public function new() : Void {
- #if flash9
- h = new flash.utils.Dictionary();
- #elseif flash
- h = untyped __new__(_global["Object"]);
- #elseif neko
- h = untyped __dollar__hnew(0);
- #elseif js
- h = untyped __js__("{}");
- untyped if( h.__proto__ != null ) {
- h.__proto__ = null;
- __js__("delete")(h.__proto__);
- };
- #elseif php
- h = untyped __call__('array');
- #end
- }
- /**
- Set a value for the given key.
- **/
- public function set( key : Int, value : T ) : Void {
- #if flash
- untyped h[key] = value;
- #elseif js
- untyped h[key] = value;
- #elseif neko
- untyped __dollar__hset(h,key,value,null);
- #elseif php
- untyped __php__("$this->h[$key] = $value");
- #end
- }
- /**
- Get a value for the given key.
- **/
- public function get( key : Int ) : Null<T> {
- #if flash
- return untyped h[key];
- #elseif js
- return untyped h[key];
- #elseif neko
- return untyped __dollar__hget(h,key,null);
- #elseif php
- if(!exists(key)) return null;
- return untyped h[key];
- #else
- return null;
- #end
- }
- /**
- Tells if a value exists for the given key.
- In particular, it's useful to tells if a key has
- a [null] value versus no value.
- **/
- public function exists( key : Int ) : Bool {
- #if flash9
- return untyped h.hasOwnProperty(key);
- #elseif flash
- return untyped h["hasOwnProperty"](key);
- #elseif js
- return untyped h[key] != null;
- #elseif neko
- return untyped __dollar__hmem(h,key,null);
- #elseif php
- return untyped __php__("array_key_exists")(key, h);
- #else
- return false;
- #end
- }
- /**
- Removes a hashtable entry. Returns [true] if
- there was such entry.
- **/
- public function remove( key : Int ) : Bool {
- #if flash9
- if( untyped !h.hasOwnProperty(key) ) return false;
- untyped __delete__(h,key);
- return true;
- #elseif flash
- if( untyped !h["hasOwnProperty"](key) ) return false;
- untyped __delete__(h,key);
- return true;
- #elseif js
- if( untyped h[key] == null ) return false;
- untyped __js__("delete")(h[key]);
- return true;
- #elseif neko
- return untyped __dollar__hremove(h,key,null);
- #elseif php
- return untyped __call__("_hx_array_remove_at", h, key);
- #else
- return false;
- #end
- }
- /**
- Returns an iterator of all keys in the hashtable.
- **/
- public function keys() : Iterator<Int> {
- #if flash9
- return untyped (__keys__(h)).iterator();
- #elseif flash
- var l : Array<Int> = untyped __keys__(h);
- for( x in 0...l.length )
- l[x] = Std.int(l[x]);
- return l.iterator();
- #elseif js
- var a = new Array();
- untyped __js__("
- for( x in this.h )
- a.push(x);
- ");
- return a.iterator();
- #elseif neko
- var l = new List<Int>();
- untyped __dollar__hiter(h,function(k,_) { l.push(k); });
- return l.iterator();
- #elseif php
- return untyped __call__("_hx_array_iterator", __call__("array_keys", h));
- #else
- return null;
- #end
- }
- /**
- Returns an iterator of all values in the hashtable.
- **/
- public function iterator() : Iterator<T> {
- #if flash9
- return untyped {
- ref : h,
- it : keys(),
- hasNext : function() { return this.it.hasNext(); },
- next : function() { var i = this.it.next(); return this.ref[i]; }
- };
- #elseif flash
- return untyped {
- ref : h,
- it : keys(),
- hasNext : function() { return this.it[__unprotect__("hasNext")](); },
- next : function() { var i = this.it[__unprotect__("next")](); return this.ref[i]; }
- };
- #elseif js
- return untyped {
- ref : h,
- it : keys(),
- hasNext : function() { return this.it.hasNext(); },
- next : function() { var i = this.it.next(); return this.ref[i]; }
- };
- #elseif neko
- var l = new List<T>();
- untyped __dollar__hiter(h,function(_,v) { l.push(v); });
- return l.iterator();
- #elseif php
- return untyped __call__("_hx_array_iterator", __call__("array_values", h));
- #else
- return null;
- #end
- }
- /**
- Returns an displayable representation of the hashtable content.
- **/
- public function toString() {
- 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();
- }
- }
|