1 30 package org.objectweb.asm.tree.analysis; 31 32 37 class IntMap { 38 39 private int size; 40 41 private Object [] keys; 42 43 private int[] values; 44 45 public IntMap(final int size) { 46 this.size = size; 47 this.keys = new Object [size]; 48 this.values = new int[size]; 49 } 50 51 public int get(final Object key) { 52 int n = size; 53 int i = (key.hashCode() & 0x7FFFFFFF) % n; 54 while (keys[i] != key) { 55 i = (i + 1) % n; 56 } 57 return values[i]; 58 } 59 60 public void put(final Object key, final int value) { 61 int n = size; 62 int i = (key.hashCode() & 0x7FFFFFFF) % n; 63 while (keys[i] != null) { 64 i = (i + 1) % n; 65 } 66 keys[i] = key; 67 values[i] = value; 68 } 69 } | Popular Tags |