Browse Source

added haxe.ds.HashMap

Simon Krajewski 12 years ago
parent
commit
32dd022c55
1 changed files with 32 additions and 0 deletions
  1. 32 0
      std/haxe/ds/HashMap.hx

+ 32 - 0
std/haxe/ds/HashMap.hx

@@ -0,0 +1,32 @@
+/*
+ * Copyright (C)2005-2013 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;
+
+abstract HashMap(IntMap<V>)<K:{ function hashCode():Int; }, V > {
+	public function new() this = new IntMap()
+	public inline function set(k:K, v:V) this.set(k.hashCode(), v)
+	public inline function get(k:K) return this.get(k.hashCode())
+	public inline function exists(k:K) return this.exists(k.hashCode())
+	public inline function remove(k:K) return this.remove(k.hashCode())
+	public inline function keys() return this.keys()
+	public inline function iterator() return this.iterator()
+}