All Downloads are FREE. Search and download functionalities are using the official Maven repository.

scouter.util.StringIntMap Maven / Gradle / Ivy

There is a newer version: 2.20.0
Show newest version
/*
 *  Copyright 2015 the original author or authors. 
 *  @https://github.com/scouter-project/scouter
 *
 *  Licensed under the Apache License, Version 2.0 (the "License"); 
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License. 
 * 
 *  The initial idea for this class is from "org.apache.commons.lang.IntHashMap"; 
 *  http://commons.apache.org/commons-lang-2.6-src.zip
 *
 */
package scouter.util;
import java.util.Enumeration;
import java.util.NoSuchElementException;
/**
 * @author Paul Kim ([email protected])
 */
public class StringIntMap  {
	private static final int DEFAULT_CAPACITY = 101;
	private static final float DEFAULT_LOAD_FACTOR = 0.75f;
	private StringIntEntry table[];
	private int count;
	private int threshold;
	private float loadFactor;
	public StringIntMap(int initCapacity, float loadFactor) {
		if (initCapacity < 0)
			throw new RuntimeException("Capacity Error: " + initCapacity);
		if (loadFactor <= 0)
			throw new RuntimeException("Load Count Error: " + loadFactor);
		if (initCapacity == 0)
			initCapacity = 1;
		this.loadFactor = loadFactor;
		table = new StringIntEntry[initCapacity];
		threshold = (int) (initCapacity * loadFactor);
	}
	private int NONE=0;
	public StringIntMap setNullValue(int none){
		this.NONE=none;
		return this;
	}
	public StringIntMap() {
		this(DEFAULT_CAPACITY, DEFAULT_LOAD_FACTOR);
	}
	public int size() {
		return count;
	}
	public synchronized StringEnumer keys() {
		return new Enumer(TYPE.KEYS);
	}
	public synchronized IntEnumer values() {
		return new Enumer(TYPE.VALUES);
	}
	public synchronized Enumeration entries() {
		return new Enumer(TYPE.ENTRIES);
	}
	public synchronized boolean containsValue(int value) {
		StringIntEntry tab[] = table;
		int i = tab.length; while(i-->0){
			for (StringIntEntry e = tab[i]; e != null; e = e.next) {
				if (e.value == value) {
					return true;
				}
			}
		}
		return false;
	}
	public synchronized boolean containsKey(String key) {
		if (key == null)
			return false;
		StringIntEntry tab[] = table;
		int index = (key.hashCode() & Integer.MAX_VALUE) % tab.length;
		for (StringIntEntry e = tab[index]; e != null; e = e.next) {
			if (CompareUtil.equals(e.key, key)) {
				return true;
			}
		}
		return false;
	}
	public synchronized int get(String key) {
		if (key == null)
			return NONE;
		StringIntEntry tab[] = table;
		int index = (key.hashCode() & Integer.MAX_VALUE) % tab.length;
		for (StringIntEntry e = tab[index]; e != null; e = e.next) {
			if (CompareUtil.equals(e.key, key)) {
				return e.value;
			}
		}
		return NONE;
	}
	protected void rehash() {
		int oldCapacity = table.length;
		StringIntEntry oldMap[] = table;
		int newCapacity = oldCapacity * 2 + 1;
		StringIntEntry newMap[] = new StringIntEntry[newCapacity];
		threshold = (int) (newCapacity * loadFactor);
		table = newMap;
		for (int i = oldCapacity; i-- > 0;) {
			StringIntEntry old = oldMap[i];
			while (old != null) {
				StringIntEntry e = old;
				old = old.next;
				int index = (e.key.hashCode() & Integer.MAX_VALUE) % newCapacity;
				e.next = newMap[index];
				newMap[index] = e;
			}
		}
	}
	public synchronized int put(String key, int value) {
		if (key == null)
			return NONE;
		StringIntEntry tab[] = table;
		int index = (key.hashCode() & Integer.MAX_VALUE) % tab.length;
		for (StringIntEntry e = tab[index]; e != null; e = e.next) {
			if (CompareUtil.equals(e.key, key)) {
				int old = e.value;
				e.value = value;
				return old;
			}
		}
		if (count >= threshold) {
			rehash();
			tab = table;
			index = (key.hashCode() & Integer.MAX_VALUE) % tab.length;
		}
		StringIntEntry e = new StringIntEntry(key, value, tab[index]);
		tab[index] = e;
		count++;
		return NONE;
	}
	public synchronized int add(String key, int value) {
		if (key == null)
			return NONE;
		StringIntEntry tab[] = table;
		int index = (key.hashCode() & Integer.MAX_VALUE) % tab.length;
		for (StringIntEntry e = tab[index]; e != null; e = e.next) {
			if (CompareUtil.equals(e.key, key)) {
				int old = e.value;
				e.value += value;
				return old;
			}
		}
		if (count >= threshold) {
			rehash();
			tab = table;
			index = (key.hashCode() & Integer.MAX_VALUE) % tab.length;
		}
		StringIntEntry e = new StringIntEntry(key, value, tab[index]);
		tab[index] = e;
		count++;
		return NONE;
	}
	public synchronized int remove(String key) {
		if (key == null)
			return NONE;
		StringIntEntry tab[] = table;
		int index = (key.hashCode() & Integer.MAX_VALUE) % tab.length;
		for (StringIntEntry e = tab[index], prev = null; e != null; prev = e, e = e.next) {
			if (CompareUtil.equals(e.key, key)) {
				if (prev != null) {
					prev.next = e.next;
				} else {
					tab[index] = e.next;
				}
				count--;
				int oldValue = e.value;
				e.value = NONE;
				return oldValue;
			}
		}
		return NONE;
	}
	public synchronized void clear() {
		StringIntEntry tab[] = table;
		for (int index = tab.length; --index >= 0;)
			tab[index] = null;
		count = 0;
	}
	public String toString() {
		StringBuffer buf = new StringBuffer();
		Enumeration it = entries();
		buf.append("{");
		for (int i = 0; it.hasMoreElements(); i++) {
			StringIntEntry e = (StringIntEntry) (it.nextElement());
			if (i > 0)
				buf.append(", ");
			buf.append(e.getKey() + "=" + e.getValue());
		}
		buf.append("}");
		return buf.toString();
	}
	public String toFormatString() {
		StringBuffer buf = new StringBuffer();
		Enumeration it = entries();
		buf.append("{\n");
		while (it.hasMoreElements()) {
			StringIntEntry e = (StringIntEntry) it.nextElement();
			buf.append("\t").append(e.getKey() + "=" + e.getValue()).append("\n");
		}
		buf.append("}");
		return buf.toString();
	}
	public static class StringIntEntry {
		String key;
		int value;
		StringIntEntry next;
		protected StringIntEntry(String key, int value, StringIntEntry next) {
			this.key = key;
			this.value = value;
			this.next = next;
		}
		protected Object clone() {
			return new StringIntEntry(key, value, (next == null ? null : (StringIntEntry) next.clone()));
		}
		public String getKey() {
			return key;
		}
		public int getValue() {
			return value;
		}
		public int setValue(int value) {
			int oldValue = this.value;
			this.value = value;
			return oldValue;
		}
		public boolean equals(Object o) {
			if (!(o instanceof StringIntEntry))
				return false;
			StringIntEntry e = (StringIntEntry) o;
			return CompareUtil.equals(e.key, key) && CompareUtil.equals(e.value, value);
		}
		public int hashCode() {
			return key.hashCode() ^ (int) value;
		}
		public String toString() {
			return key + "=" + value;
		}
	}
	private enum TYPE {
		KEYS, VALUES, ENTRIES
	}
	private class Enumer implements Enumeration, StringEnumer, IntEnumer {
		StringIntEntry[] table = StringIntMap.this.table;
		int index = table.length;
		StringIntEntry entry = null;
		StringIntEntry lastReturned = null;
		TYPE type;
		Enumer(TYPE type) {
			this.type = type;
		}
		public boolean hasMoreElements() {
			while (entry == null && index > 0)
				entry = table[--index];
			return entry != null;
		}
		public Object nextElement() {
			while (entry == null && index > 0)
				entry = table[--index];
			if (entry != null) {
				StringIntEntry e = lastReturned = entry;
				entry = e.next;
				switch (type) {
				case KEYS:
					return e.key;
				case VALUES:
					return e.value;
				default:
					return e;
				}
			}
			throw new NoSuchElementException("no more next");
		}
		public int nextInt() {
			while (entry == null && index > 0)
				entry = table[--index];
			if (entry != null) {
				StringIntEntry e = lastReturned = entry;
				entry = e.next;
				switch (type) {
				case VALUES:
					return e.value;
				default:
					return NONE;
				}
			}
			throw new NoSuchElementException("no more next");
		}
		public String nextString() {
			while (entry == null && index > 0)
				entry = table[--index];
			if (entry != null) {
				StringIntEntry e = lastReturned = entry;
				entry = e.next;
				switch (type) {
				case KEYS:
					return e.key;
				default:
					return null;
				}
			}
			throw new NoSuchElementException("no more next");
		}
	}
	public static void main(String[] args) {
	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy