javap/src/main/java/org/apidesign/javap/Hashtable.java
branchbenchmarks
changeset 313 398110b3eee6
parent 150 945817561b9a
child 316 8da329789435
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/javap/src/main/java/org/apidesign/javap/Hashtable.java	Wed Dec 12 20:35:01 2012 +0100
     1.3 @@ -0,0 +1,81 @@
     1.4 +/*
     1.5 + * To change this template, choose Tools | Templates
     1.6 + * and open the template in the editor.
     1.7 + */
     1.8 +package org.apidesign.javap;
     1.9 +
    1.10 +/** A JavaScript optimized replacement for Hashtable.
    1.11 + *
    1.12 + * @author Jaroslav Tulach <jtulach@netbeans.org>
    1.13 + */
    1.14 +final class Hashtable {
    1.15 +    private Object[] keys;
    1.16 +    private Object[] values;
    1.17 +
    1.18 +    Hashtable(int i) {
    1.19 +        this();
    1.20 +    }
    1.21 +
    1.22 +    Hashtable(int i, double d) {
    1.23 +        this();
    1.24 +    }
    1.25 +
    1.26 +    Hashtable() {
    1.27 +    }
    1.28 +
    1.29 +    synchronized void put(Object key, Object val) {
    1.30 +        int[] where = { -1, -1 };
    1.31 +        Object found = get(key, where);
    1.32 +        if (where[0] != -1) {
    1.33 +            // key exists
    1.34 +            values[where[0]] = val;
    1.35 +        } else {
    1.36 +            if (where[1] != -1) {
    1.37 +                // null found
    1.38 +                keys[where[1]] = key;
    1.39 +                values[where[1]] = val;
    1.40 +            } else {
    1.41 +                if (keys == null) {
    1.42 +                    keys = new Object[11];
    1.43 +                    values = new Object[11];
    1.44 +                    keys[0] = key;
    1.45 +                    values[0] = val;
    1.46 +                } else {
    1.47 +                    Object[] newKeys = new Object[keys.length * 2];
    1.48 +                    Object[] newValues = new Object[values.length * 2];
    1.49 +                    for (int i = 0; i < keys.length; i++) {
    1.50 +                        newKeys[i] = keys[i];
    1.51 +                        newValues[i] = values[i];
    1.52 +                    }
    1.53 +                    newKeys[keys.length] = key;
    1.54 +                    newValues[keys.length] = val;
    1.55 +                    keys = newKeys;
    1.56 +                    values = newValues;
    1.57 +                }
    1.58 +            }
    1.59 +        }
    1.60 +    }
    1.61 +
    1.62 +    Object get(Object key) {
    1.63 +        return get(key, null);
    1.64 +    }
    1.65 +    private synchronized Object get(Object key, int[] foundAndNull) {
    1.66 +        if (keys == null) {
    1.67 +            return null;
    1.68 +        }
    1.69 +        for (int i = 0; i < keys.length; i++) {
    1.70 +            if (keys[i] == null) {
    1.71 +                if (foundAndNull != null) {
    1.72 +                    foundAndNull[1] = i;
    1.73 +                }
    1.74 +            } else if (keys[i].equals(key)) {
    1.75 +                if (foundAndNull != null) {
    1.76 +                    foundAndNull[0] = i;
    1.77 +                }
    1.78 +                return values[i];
    1.79 +            }
    1.80 +        }
    1.81 +        return null;
    1.82 +    }
    1.83 +    
    1.84 +}