From 663631f0456fcc245dd835889f86541d75161c53 Mon Sep 17 00:00:00 2001
From: Roman Shevchenko <roman.shevchenko@jetbrains.com>
Date: Thu, 28 Aug 2014 20:52:43 +0400
Subject: java-decompiler: post-import cleanup (classes moved)

---
 .../java/decompiler/util/FastFixedSetFactory.java  | 363 +++++++++++++++++++++
 1 file changed, 363 insertions(+)
 create mode 100644 src/org/jetbrains/java/decompiler/util/FastFixedSetFactory.java

(limited to 'src/org/jetbrains/java/decompiler/util/FastFixedSetFactory.java')

diff --git a/src/org/jetbrains/java/decompiler/util/FastFixedSetFactory.java b/src/org/jetbrains/java/decompiler/util/FastFixedSetFactory.java
new file mode 100644
index 0000000..524f50d
--- /dev/null
+++ b/src/org/jetbrains/java/decompiler/util/FastFixedSetFactory.java
@@ -0,0 +1,363 @@
+/*
+ *    Fernflower - The Analytical Java Decompiler
+ *    http://www.reversed-java.com
+ *
+ *    (C) 2008 - 2010, Stiver
+ *
+ *    This software is NEITHER public domain NOR free software 
+ *    as per GNU License. See license.txt for more details.
+ *
+ *    This software is distributed WITHOUT ANY WARRANTY; without 
+ *    even the implied warranty of MERCHANTABILITY or FITNESS FOR 
+ *    A PARTICULAR PURPOSE. 
+ */
+
+package org.jetbrains.java.decompiler.util;
+
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.HashSet;
+import java.util.Iterator;
+import java.util.List;
+import java.util.Set;
+
+public class FastFixedSetFactory<E> {
+
+	private VBStyleCollection<int[], E> colValuesInternal = new VBStyleCollection<int[], E>();  
+
+	private int dataLength; 
+	
+	public FastFixedSetFactory(Collection<E> set) {
+		
+		dataLength = set.size() / 32 + 1; 
+		
+		int index = 0;
+		int mask = 1;
+		
+		for(E element : set) {
+		
+			int block = index / 32;
+
+			if(index % 32 == 0) {
+				mask = 1;
+			}
+			
+			colValuesInternal.putWithKey(new int[] {block, mask}, element);
+			
+			index++;
+			mask <<= 1;
+		}
+	}
+
+	public FastFixedSet<E> spawnEmptySet() {
+		return new FastFixedSet<E>(this);
+	}
+	
+	private int getDataLength() {
+		return dataLength;
+	}
+	
+	private VBStyleCollection<int[], E> getInternalValuesCollection() {
+		return colValuesInternal;
+	}
+	
+	public static class FastFixedSet<E> implements Iterable<E> {
+		
+		private FastFixedSetFactory<E> factory;
+
+		private VBStyleCollection<int[], E> colValuesInternal;
+		
+		private int[] data;
+		
+		
+		private FastFixedSet(FastFixedSetFactory<E> factory) {
+			this.factory = factory;
+			this.colValuesInternal = factory.getInternalValuesCollection();
+			this.data = new int[factory.getDataLength()];
+		}
+		
+		public FastFixedSet<E> getCopy() {
+			
+			FastFixedSet<E> copy = new FastFixedSet<E>(factory);
+			
+			int arrlength = data.length;
+			int[] cpdata = new int[arrlength];
+			System.arraycopy(data, 0, cpdata, 0, arrlength);
+			copy.setData(cpdata);
+			
+			return copy;
+		}
+
+		public void setAllElements() {
+
+			int[] lastindex = colValuesInternal.get(colValuesInternal.size()-1);
+			
+			for(int i=lastindex[0]-1;i>=0;i--) {
+				data[i] = 0xFFFFFFFF;
+			}
+			
+			data[lastindex[0]] = lastindex[1] | (lastindex[1]-1);
+		}
+		
+		public void add(E element) {
+			int[] index = colValuesInternal.getWithKey(element);
+			data[index[0]] |= index[1];
+		}
+		
+		public void addAll(Collection<E> set) {
+			for(E element : set) {
+				add(element);
+			}
+		}
+
+		public void remove(E element) {
+			int[] index = colValuesInternal.getWithKey(element);
+			data[index[0]] &= ~index[1];
+		}
+
+		public void removeAll(Collection<E> set) {
+			for(E element : set) {
+				remove(element);
+			}
+		}
+		
+		public boolean contains(E element) {
+			int[] index = colValuesInternal.getWithKey(element);
+			return (data[index[0]] & index[1]) != 0;
+		}
+
+		public boolean contains(FastFixedSet<E> set) {
+			int[] extdata = set.getData();
+			int[] intdata = data;
+			
+			for(int i=intdata.length-1;i>=0;i--) {
+				if((extdata[i] & ~intdata[i]) != 0) {
+					return false;
+				}
+			}
+			
+			return true;
+		}
+		
+		public void union(FastFixedSet<E> set) {
+			int[] extdata = set.getData();
+			int[] intdata = data;
+			
+			for(int i=intdata.length-1;i>=0;i--) {
+				intdata[i] |= extdata[i];
+			}
+		}
+
+		public void intersection(FastFixedSet<E> set) {
+			int[] extdata = set.getData();
+			int[] intdata = data;
+			
+			for(int i=intdata.length-1;i>=0;i--) {
+				intdata[i] &= extdata[i];
+			}
+		}
+		
+		public void symdiff(FastFixedSet<E> set) {
+			int[] extdata = set.getData();
+			int[] intdata = data;
+			
+			for(int i=intdata.length-1;i>=0;i--) {
+				intdata[i] ^= extdata[i];
+			}
+		}
+		
+		public void complement(FastFixedSet<E> set) {
+			int[] extdata = set.getData();
+			int[] intdata = data;
+			
+			for(int i=intdata.length-1;i>=0;i--) {
+				intdata[i] &= ~extdata[i];
+			}
+		}
+		
+		
+		public boolean equals(Object o) {
+      if(o == this) return true;
+      if(o == null || !(o instanceof FastFixedSet)) return false;
+			
+			int[] extdata = ((FastFixedSet)o).getData();
+			int[] intdata = data;
+			
+			for(int i=intdata.length-1;i>=0;i--) {
+				if(intdata[i] != extdata[i]) {
+					return false;
+				}
+			}
+			
+			return true;
+		}
+		
+		public boolean isEmpty() {
+			int[] intdata = data;
+			
+			for(int i=intdata.length-1;i>=0;i--) {
+				if(intdata[i] != 0) {
+					return false;
+				}
+			}
+			
+			return true;
+		}
+		
+		public Iterator<E> iterator() {
+			return new FastFixedSetIterator<E>(this);
+		}
+		
+		public Set<E> toPlainSet() {
+			return toPlainCollection(new HashSet<E>());
+		}
+		
+		public List<E> toPlainList() {
+			return toPlainCollection(new ArrayList<E>());
+		}
+		
+		
+		private <T extends Collection<E>> T toPlainCollection(T cl) {
+			
+			int[] intdata = data;
+			for(int bindex=0; bindex < intdata.length; bindex++) {
+				int block = intdata[bindex];
+				if(block != 0) {
+					int index = bindex << 5; // * 32
+					for(int i = 31; i>=0; i--){
+						if((block & 1) != 0) {
+							cl.add(colValuesInternal.getKey(index));
+						}
+						index++;
+						block >>>= 1;
+					}
+				}
+			}
+			
+			return cl;
+		}
+		
+		public String toBinary() {
+			
+			StringBuilder buffer = new StringBuilder();
+			int[] intdata = data;
+			
+			for(int i=0;i<intdata.length;i++) {
+				buffer.append(" ").append(Integer.toBinaryString(intdata[i]));
+			}
+				
+			return buffer.toString();	
+		}
+		
+		public String toString() {
+
+			StringBuilder buffer = new StringBuilder("{");
+			
+			int[] intdata = data;
+			boolean first = true;
+			
+			for(int i=colValuesInternal.size()-1;i>=0;i--) {
+				int[] index = colValuesInternal.get(i);
+				
+				if((intdata[index[0]] & index[1]) != 0) {
+					if(first) {
+						first = false;
+					} else {
+						buffer.append(",");
+					}
+					buffer.append(colValuesInternal.getKey(i));
+				}
+			}
+			
+			buffer.append("}");
+			
+			return buffer.toString();
+		}
+		
+		private int[] getData() {
+			return data;
+		}
+
+		private void setData(int[] data) {
+			this.data = data;
+		}
+
+		public FastFixedSetFactory<E> getFactory() {
+			return factory;
+		}
+	}
+
+	public static class FastFixedSetIterator<E> implements Iterator<E> {
+
+		private VBStyleCollection<int[], E> colValuesInternal;
+		private int[] data;
+		private int size;
+
+		private int pointer = -1;
+		private int next_pointer = -1;
+		
+		private FastFixedSetIterator(FastFixedSet<E> set) {
+			colValuesInternal = set.getFactory().getInternalValuesCollection();
+			data = set.getData();
+			size = colValuesInternal.size();
+		}
+		
+		private int getNextIndex(int index) {
+			
+			index++;
+			int ret = index;
+			int bindex = index / 32;
+			int dindex = index % 32;
+			
+			while(bindex < data.length) {
+				int block = data[bindex];
+				
+				if(block != 0) {
+					block >>>= dindex;
+					while(dindex < 32) {
+						if((block & 1) != 0) {
+							return ret;
+						}
+						block >>>= 1;
+						dindex++;
+						ret++;
+					}
+				} else {
+					ret += (32 - dindex); 
+				}
+				
+				dindex = 0;
+				bindex++;
+			}
+			
+			return -1;
+		}
+		
+		public boolean hasNext() {
+			next_pointer = getNextIndex(pointer);
+			return (next_pointer >= 0);
+		}
+
+		public E next() {
+			if(next_pointer >= 0) {
+				pointer = next_pointer;
+			} else {
+				pointer = getNextIndex(pointer);
+				if(pointer == -1) {
+					pointer = size;
+				}
+			}
+
+			next_pointer = -1;
+			return pointer<size?colValuesInternal.getKey(pointer):null;
+		}
+
+		public void remove() {
+			int[] index = colValuesInternal.get(pointer);
+			data[index[0]] &= ~index[1];
+		}
+		
+	}
+	
+}
+
-- 
cgit v1.2.3