IntHash.hx 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687
  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. @:core_api class IntHash<T> {
  26. private var h : Dynamic;
  27. public function new() : Void {
  28. h = {};
  29. }
  30. public function set( key : Int, value : T ) : Void {
  31. untyped h[key] = value;
  32. }
  33. public function get( key : Int ) : Null<T> {
  34. return untyped h[key];
  35. }
  36. public function exists( key : Int ) : Bool {
  37. return untyped h.hasOwnProperty(key);
  38. }
  39. public function remove( key : Int ) : Bool {
  40. if( untyped !h.hasOwnProperty(key) ) return false;
  41. untyped __js__("delete")(h[key]);
  42. return true;
  43. }
  44. public function keys() : Iterator<Int> {
  45. var a = [];
  46. untyped {
  47. __js__("for( var key in this.h ) {");
  48. if( h.hasOwnProperty(key) )
  49. a.push(key|0);
  50. __js__("}");
  51. }
  52. return a.iterator();
  53. }
  54. public function iterator() : Iterator<T> {
  55. return untyped {
  56. ref : h,
  57. it : keys(),
  58. hasNext : function() { return __this__.it.hasNext(); },
  59. next : function() { var i = __this__.it.next(); return __this__.ref[i]; }
  60. };
  61. }
  62. public function toString() : String {
  63. var s = new StringBuf();
  64. s.add("{");
  65. var it = keys();
  66. for( i in it ) {
  67. s.add(i);
  68. s.add(" => ");
  69. s.add(Std.string(get(i)));
  70. if( it.hasNext() )
  71. s.add(", ");
  72. }
  73. s.add("}");
  74. return s.toString();
  75. }
  76. }