2
0

IntHash.hx 2.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879
  1. /*
  2. * Copyright (c) 2005, The haXe Project Contributors
  3. * All rights reserved.
  4. * Redistribution and use in source and binary forms, with or without
  5. * modification, are permitted provided that the following conditions are met:
  6. *
  7. * - Redistributions of source code must retain the above copyright
  8. * notice, this list of conditions and the following disclaimer.
  9. * - Redistributions in binary form must reproduce the above copyright
  10. * notice, this list of conditions and the following disclaimer in the
  11. * documentation and/or other materials provided with the distribution.
  12. *
  13. * THIS SOFTWARE IS PROVIDED BY THE HAXE PROJECT CONTRIBUTORS "AS IS" AND ANY
  14. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  15. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  16. * DISCLAIMED. IN NO EVENT SHALL THE HAXE PROJECT CONTRIBUTORS BE LIABLE FOR
  17. * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  18. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  19. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  20. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  21. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  22. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
  23. * DAMAGE.
  24. */
  25. /**
  26. Hashtable over a set of elements, using [Int] as keys.
  27. On Flash and Javascript, the underlying structure is an Object.
  28. **/
  29. @:core_api class IntHash<T> {
  30. private var h : Dynamic;
  31. public function new() : Void {
  32. h = untyped __global__.__int_hash_create();
  33. }
  34. public function set( key : Int, value : T ) : Void {
  35. untyped __global__.__int_hash_set(h,key,value);
  36. }
  37. public function get( key : Int ) : Null<T> {
  38. return untyped __global__.__int_hash_get(h,key);
  39. }
  40. public function exists( key : Int ) : Bool {
  41. return untyped __global__.__int_hash_exists(h,key);
  42. }
  43. public function remove( key : Int ) : Bool {
  44. return untyped __global__.__int_hash_remove(h,key);
  45. }
  46. public function keys() : Iterator<Int> {
  47. var a:Array<Int> = untyped __global__.__int_hash_keys(h);
  48. return a.iterator();
  49. }
  50. public function iterator() : Iterator<T> {
  51. var a:Array<Dynamic> = untyped __global__.__int_hash_values(h);
  52. return a.iterator();
  53. }
  54. public function toString() : String {
  55. var s = new StringBuf();
  56. s.add("{");
  57. var it = keys();
  58. for( i in it ) {
  59. s.add(i);
  60. s.add(" => ");
  61. s.add(Std.string(get(i)));
  62. if( it.hasNext() )
  63. s.add(", ");
  64. }
  65. s.add("}");
  66. return s.toString();
  67. }
  68. }