int valueIndex(int value) { if (isEmpty()) return -1; int index = -1; int mc = modCount(); short free = freeValue; short[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (value == vals[i]) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }
int valueIndex(int value) { if (isEmpty()) return -1; int index = -1; int mc = modCount(); short free = freeValue; short[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (value == vals[i]) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }
int valueIndex(float value) { if (isEmpty()) return -1; int val = Float.floatToIntBits(value); int index = -1; int mc = modCount(); short free = freeValue; short[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (val == vals[i]) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }
int valueIndex(float value) { if (isEmpty()) return -1; int val = Float.floatToIntBits(value); int index = -1; int mc = modCount(); short free = freeValue; short[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (val == vals[i]) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }