Complete rewrite of shifting map code:
Added shifting set as separate public class Added "Empty" class for internal references Added shifting entry for static array reference to shifting set
This commit is contained in:
parent
4b0a7d6627
commit
d7d49e8ee2
124
.idea/uiDesigner.xml
generated
Normal file
124
.idea/uiDesigner.xml
generated
Normal file
@ -0,0 +1,124 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="Palette2">
|
||||
<group name="Swing">
|
||||
<item class="com.intellij.uiDesigner.HSpacer" tooltip-text="Horizontal Spacer" icon="/com/intellij/uiDesigner/icons/hspacer.png" removable="false" auto-create-binding="false" can-attach-label="false">
|
||||
<default-constraints vsize-policy="1" hsize-policy="6" anchor="0" fill="1" />
|
||||
</item>
|
||||
<item class="com.intellij.uiDesigner.VSpacer" tooltip-text="Vertical Spacer" icon="/com/intellij/uiDesigner/icons/vspacer.png" removable="false" auto-create-binding="false" can-attach-label="false">
|
||||
<default-constraints vsize-policy="6" hsize-policy="1" anchor="0" fill="2" />
|
||||
</item>
|
||||
<item class="javax.swing.JPanel" icon="/com/intellij/uiDesigner/icons/panel.png" removable="false" auto-create-binding="false" can-attach-label="false">
|
||||
<default-constraints vsize-policy="3" hsize-policy="3" anchor="0" fill="3" />
|
||||
</item>
|
||||
<item class="javax.swing.JScrollPane" icon="/com/intellij/uiDesigner/icons/scrollPane.png" removable="false" auto-create-binding="false" can-attach-label="true">
|
||||
<default-constraints vsize-policy="7" hsize-policy="7" anchor="0" fill="3" />
|
||||
</item>
|
||||
<item class="javax.swing.JButton" icon="/com/intellij/uiDesigner/icons/button.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="0" hsize-policy="3" anchor="0" fill="1" />
|
||||
<initial-values>
|
||||
<property name="text" value="Button" />
|
||||
</initial-values>
|
||||
</item>
|
||||
<item class="javax.swing.JRadioButton" icon="/com/intellij/uiDesigner/icons/radioButton.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="0" hsize-policy="3" anchor="8" fill="0" />
|
||||
<initial-values>
|
||||
<property name="text" value="RadioButton" />
|
||||
</initial-values>
|
||||
</item>
|
||||
<item class="javax.swing.JCheckBox" icon="/com/intellij/uiDesigner/icons/checkBox.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="0" hsize-policy="3" anchor="8" fill="0" />
|
||||
<initial-values>
|
||||
<property name="text" value="CheckBox" />
|
||||
</initial-values>
|
||||
</item>
|
||||
<item class="javax.swing.JLabel" icon="/com/intellij/uiDesigner/icons/label.png" removable="false" auto-create-binding="false" can-attach-label="false">
|
||||
<default-constraints vsize-policy="0" hsize-policy="0" anchor="8" fill="0" />
|
||||
<initial-values>
|
||||
<property name="text" value="Label" />
|
||||
</initial-values>
|
||||
</item>
|
||||
<item class="javax.swing.JTextField" icon="/com/intellij/uiDesigner/icons/textField.png" removable="false" auto-create-binding="true" can-attach-label="true">
|
||||
<default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1">
|
||||
<preferred-size width="150" height="-1" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JPasswordField" icon="/com/intellij/uiDesigner/icons/passwordField.png" removable="false" auto-create-binding="true" can-attach-label="true">
|
||||
<default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1">
|
||||
<preferred-size width="150" height="-1" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JFormattedTextField" icon="/com/intellij/uiDesigner/icons/formattedTextField.png" removable="false" auto-create-binding="true" can-attach-label="true">
|
||||
<default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1">
|
||||
<preferred-size width="150" height="-1" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JTextArea" icon="/com/intellij/uiDesigner/icons/textArea.png" removable="false" auto-create-binding="true" can-attach-label="true">
|
||||
<default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
|
||||
<preferred-size width="150" height="50" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JTextPane" icon="/com/intellij/uiDesigner/icons/textPane.png" removable="false" auto-create-binding="true" can-attach-label="true">
|
||||
<default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
|
||||
<preferred-size width="150" height="50" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JEditorPane" icon="/com/intellij/uiDesigner/icons/editorPane.png" removable="false" auto-create-binding="true" can-attach-label="true">
|
||||
<default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
|
||||
<preferred-size width="150" height="50" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JComboBox" icon="/com/intellij/uiDesigner/icons/comboBox.png" removable="false" auto-create-binding="true" can-attach-label="true">
|
||||
<default-constraints vsize-policy="0" hsize-policy="2" anchor="8" fill="1" />
|
||||
</item>
|
||||
<item class="javax.swing.JTable" icon="/com/intellij/uiDesigner/icons/table.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
|
||||
<preferred-size width="150" height="50" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JList" icon="/com/intellij/uiDesigner/icons/list.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="6" hsize-policy="2" anchor="0" fill="3">
|
||||
<preferred-size width="150" height="50" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JTree" icon="/com/intellij/uiDesigner/icons/tree.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
|
||||
<preferred-size width="150" height="50" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JTabbedPane" icon="/com/intellij/uiDesigner/icons/tabbedPane.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="3" hsize-policy="3" anchor="0" fill="3">
|
||||
<preferred-size width="200" height="200" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JSplitPane" icon="/com/intellij/uiDesigner/icons/splitPane.png" removable="false" auto-create-binding="false" can-attach-label="false">
|
||||
<default-constraints vsize-policy="3" hsize-policy="3" anchor="0" fill="3">
|
||||
<preferred-size width="200" height="200" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JSpinner" icon="/com/intellij/uiDesigner/icons/spinner.png" removable="false" auto-create-binding="true" can-attach-label="true">
|
||||
<default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1" />
|
||||
</item>
|
||||
<item class="javax.swing.JSlider" icon="/com/intellij/uiDesigner/icons/slider.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1" />
|
||||
</item>
|
||||
<item class="javax.swing.JSeparator" icon="/com/intellij/uiDesigner/icons/separator.png" removable="false" auto-create-binding="false" can-attach-label="false">
|
||||
<default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3" />
|
||||
</item>
|
||||
<item class="javax.swing.JProgressBar" icon="/com/intellij/uiDesigner/icons/progressbar.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="0" hsize-policy="6" anchor="0" fill="1" />
|
||||
</item>
|
||||
<item class="javax.swing.JToolBar" icon="/com/intellij/uiDesigner/icons/toolbar.png" removable="false" auto-create-binding="false" can-attach-label="false">
|
||||
<default-constraints vsize-policy="0" hsize-policy="6" anchor="0" fill="1">
|
||||
<preferred-size width="-1" height="20" />
|
||||
</default-constraints>
|
||||
</item>
|
||||
<item class="javax.swing.JToolBar$Separator" icon="/com/intellij/uiDesigner/icons/toolbarSeparator.png" removable="false" auto-create-binding="false" can-attach-label="false">
|
||||
<default-constraints vsize-policy="0" hsize-policy="0" anchor="0" fill="1" />
|
||||
</item>
|
||||
<item class="javax.swing.JScrollBar" icon="/com/intellij/uiDesigner/icons/scrollbar.png" removable="false" auto-create-binding="true" can-attach-label="false">
|
||||
<default-constraints vsize-policy="6" hsize-policy="0" anchor="0" fill="2" />
|
||||
</item>
|
||||
</group>
|
||||
</component>
|
||||
</project>
|
||||
3
src/com/tofvesson/collections/Empty.java
Normal file
3
src/com/tofvesson/collections/Empty.java
Normal file
@ -0,0 +1,3 @@
|
||||
package com.tofvesson.collections;
|
||||
|
||||
final class Empty {}
|
||||
35
src/com/tofvesson/collections/ShiftingEntry.java
Normal file
35
src/com/tofvesson/collections/ShiftingEntry.java
Normal file
@ -0,0 +1,35 @@
|
||||
package com.tofvesson.collections;
|
||||
|
||||
import java.util.Map;
|
||||
|
||||
import static com.tofvesson.collections.ShiftingSet.empty;
|
||||
|
||||
public class ShiftingEntry<K, V> implements Map.Entry<K, V>{
|
||||
|
||||
private final ShiftingSet<K> keys;
|
||||
private final ShiftingSet<V> values;
|
||||
int pos;
|
||||
|
||||
public ShiftingEntry(ShiftingSet<K> keys, ShiftingSet<V> values, int pos){
|
||||
this.keys = keys;
|
||||
this.values = values;
|
||||
this.pos = pos;
|
||||
}
|
||||
|
||||
@Override
|
||||
public K getKey() {
|
||||
return keys.entries[pos]==empty?null:(K)keys.entries[pos];
|
||||
}
|
||||
|
||||
@Override
|
||||
public V getValue() {
|
||||
return values.entries[pos]==empty?null:(V)values.entries[pos];
|
||||
}
|
||||
|
||||
@Override
|
||||
public V setValue(V value) {
|
||||
V v = getValue();
|
||||
if(keys.entries[pos]!=null) values.entries[pos] = value;
|
||||
return v;
|
||||
}
|
||||
}
|
||||
@ -1,27 +1,25 @@
|
||||
package com.tofvesson.collections;
|
||||
|
||||
|
||||
import java.util.*;
|
||||
import java.util.function.Predicate;
|
||||
|
||||
import static com.tofvesson.collections.ShiftingSet.empty;
|
||||
|
||||
public class ShiftingMap<K, V> implements Map<K, V> {
|
||||
|
||||
final ShiftingSet<K> keys;
|
||||
final ShiftingSet<V> values;
|
||||
final UnchangingSet<Entry<K, V>> entrySet;
|
||||
protected final ShiftingSet<K> keys;
|
||||
protected final ShiftingSet<V> values;
|
||||
protected final ShiftingSet<Entry<K, V>> entries;
|
||||
|
||||
public ShiftingMap(int maxSize, double load){
|
||||
keys = new ShiftingSet<>(maxSize, load);
|
||||
values = new ShiftingSet<>(maxSize, load);
|
||||
entries = new ShiftingSet<>(maxSize, load);
|
||||
}
|
||||
|
||||
public ShiftingMap(int maxSize){
|
||||
this(maxSize, 0.75f);
|
||||
this(maxSize, 0.75);
|
||||
}
|
||||
|
||||
public ShiftingMap(int maxSize, float load){
|
||||
keys = new ShiftingSet<>(maxSize, load);
|
||||
values = new ShiftingSet<>(maxSize, load);
|
||||
entrySet = new UnchangingSet<>(maxSize, load);
|
||||
}
|
||||
|
||||
|
||||
@Override
|
||||
public int size() {
|
||||
return keys.size();
|
||||
@ -45,52 +43,56 @@ public class ShiftingMap<K, V> implements Map<K, V> {
|
||||
@Override
|
||||
public V get(Object key) {
|
||||
int i = keys.indexOf(key);
|
||||
return i!=-1?(V) values.set[i]:null;
|
||||
return i!=-1?(V)values.entries[i]:null;
|
||||
}
|
||||
|
||||
@Override
|
||||
public V put(K key, V value) {
|
||||
V v=null;
|
||||
int i = keys.indexOf(key);
|
||||
if(i!=-1){
|
||||
v = values.entries[i]!= empty?(V)values.entries[i]:null;
|
||||
values.entries[i] = value!=null?value:empty;
|
||||
}else{
|
||||
for(Entry e : entries) ++((ShiftingEntry)e).pos;
|
||||
entries.add(new ShiftingEntry<>(keys, values, 0));
|
||||
keys.add(key);
|
||||
values.add(value);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
|
||||
@Override
|
||||
public V remove(Object key) {
|
||||
int i = keys.indexOf(key);
|
||||
if(i==-1) return null;
|
||||
V v;
|
||||
keys.remove(key);
|
||||
values.remove(v=(V)values.set[i]);
|
||||
V v = get(key);
|
||||
if(keys.contains(key)){
|
||||
values.entries[keys.indexOf(key)] = null;
|
||||
values.shift();
|
||||
values.adaptLoad(-1);
|
||||
keys.remove(key);
|
||||
entries.entries[entries.size()-1] = null;
|
||||
entries.adaptLoad(-1);
|
||||
}
|
||||
return v;
|
||||
}
|
||||
|
||||
@SuppressWarnings({"unchecked", "MismatchedQueryAndUpdateOfCollection"})
|
||||
@Override
|
||||
public void putAll(Map m) {
|
||||
ArrayList l = new ArrayList();
|
||||
ArrayList l1 = new ArrayList();
|
||||
m.keySet().stream().filter((k)-> this.isKey(k)&& this.isValue(m.get(k))).forEach((v)->{ l.add(v); l1.add(m.get(v)); });
|
||||
K[] k;
|
||||
V[] v;
|
||||
if(l.size()!=l1.size()){
|
||||
if(l.size()<l1.size()){
|
||||
v = (V[]) Arrays.copyOf(l1.toArray(), l.size());
|
||||
k = (K[]) l.toArray();
|
||||
}
|
||||
else{
|
||||
k = (K[]) Arrays.copyOf(l.toArray(), l1.size());
|
||||
v = (V[]) l1.toArray();
|
||||
}
|
||||
}else{
|
||||
k = (K[]) l.toArray();
|
||||
v = (V[]) l1.toArray();
|
||||
}
|
||||
keys.addAll(Arrays.asList(k));
|
||||
values.addAll(Arrays.asList(v));
|
||||
ArrayList<ShiftingEntry<K, V>> l2 = new ArrayList<>();
|
||||
for(int i = k.length-1; i>0; --i) l2.add(new ShiftingEntry<>(keys, values, i));
|
||||
entrySet.addAll(l2);
|
||||
public void putAll(Map<? extends K, ? extends V> m) {
|
||||
keys.stream().filter(m::containsKey).forEach(k -> {
|
||||
put(k, m.get(k));
|
||||
m.remove(k);
|
||||
});
|
||||
if(m.size()<entries.maxSize) for(Entry e : entries) ((ShiftingEntry)e).pos += m.size();
|
||||
for(int i = 0; i<m.size(); ++i) entries.add(new ShiftingEntry<>(keys, values, m.size()-i));
|
||||
keys.addAll(m.keySet());
|
||||
values.addAll(m.values());
|
||||
}
|
||||
|
||||
@Override
|
||||
public void clear() {
|
||||
entries.clear();
|
||||
keys.clear();
|
||||
values.clear();
|
||||
entrySet.clear();
|
||||
}
|
||||
|
||||
@Override
|
||||
@ -105,291 +107,6 @@ public class ShiftingMap<K, V> implements Map<K, V> {
|
||||
|
||||
@Override
|
||||
public Set<Entry<K, V>> entrySet() {
|
||||
return entrySet;
|
||||
}
|
||||
|
||||
@Override
|
||||
public V put(K key, V value) {
|
||||
V v = null;
|
||||
if(keys.contains(key)) v = (V) values.set[keys.indexOf(key)];
|
||||
else keys.add(key);
|
||||
values.add(value);
|
||||
return v;
|
||||
}
|
||||
|
||||
public boolean isKey(Object o){ try{ K k = (K) o; return true; }catch(Exception e){} return false; }
|
||||
public boolean isValue(Object o){ try{ V v = (V) o; return true; }catch(Exception e){} return false; }
|
||||
|
||||
|
||||
/**
|
||||
* Entries dynamically update as underlying sets change
|
||||
* @param <K>
|
||||
* @param <V>
|
||||
*/
|
||||
protected static class ShiftingEntry<K, V> implements Entry<K, V>{
|
||||
|
||||
private ShiftingSet<K> keys;
|
||||
private ShiftingSet<V> values;
|
||||
private int index = 0;
|
||||
|
||||
public ShiftingEntry(ShiftingSet<K> keys, ShiftingSet<V> values, int index){
|
||||
this.keys = keys;
|
||||
this.values = values;
|
||||
this.index = index;
|
||||
}
|
||||
|
||||
@Override
|
||||
public K getKey() {
|
||||
return (K) keys.set[index];
|
||||
}
|
||||
|
||||
@Override
|
||||
public V getValue() {
|
||||
return (V) values.set[index];
|
||||
}
|
||||
|
||||
@Override
|
||||
public V setValue(V value) {
|
||||
V v=getValue();
|
||||
values.set[index]=value;
|
||||
return v;
|
||||
}
|
||||
}
|
||||
|
||||
protected static class UnchangingSet<E> extends ShiftingSet<E>{
|
||||
|
||||
public UnchangingSet(int maxSize, float loadFactor) {
|
||||
super(maxSize, loadFactor);
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean remove(Object o1) {
|
||||
return false;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean retainAll(Collection<?> c) {
|
||||
return false;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean removeAll(Collection<?> c) {
|
||||
return false;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean removeIf(Predicate<? super E> filter) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
protected static class ShiftingSet<E> implements Set<E>{
|
||||
|
||||
Object[] set = new Object[1];
|
||||
final int maxSize;
|
||||
final float loadFactor;
|
||||
int populatedEntries = 0, load = 1; // Defines currently populated entries
|
||||
double avgLoad = 1; // Used to optimize allocation algorithm to -
|
||||
// most adequately fit the average amount of elements
|
||||
// stored during any one operation
|
||||
|
||||
public ShiftingSet(int maxSize, float loadFactor){
|
||||
this.maxSize = maxSize<=0?20:maxSize;
|
||||
this.loadFactor = loadFactor<=0.1?0.75f:loadFactor;
|
||||
}
|
||||
|
||||
@Override
|
||||
public int size() {
|
||||
return set.length;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean isEmpty() {
|
||||
return set.length==1 && set[0]==null;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean contains(Object o) {
|
||||
if(o==null) return false;
|
||||
for(Object o1 : set)
|
||||
if(o.equals(o1))
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
|
||||
@Override
|
||||
public Iterator<E> iterator() {
|
||||
return new ShiftingIterator<>(this);
|
||||
}
|
||||
|
||||
@Override
|
||||
public Object[] toArray() {
|
||||
return set;
|
||||
}
|
||||
|
||||
@Override
|
||||
public <T> T[] toArray(T[] a) {
|
||||
return (T[]) set;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean add(E e) {
|
||||
if(contains(e)) return false;
|
||||
++load;
|
||||
avgLoad = (avgLoad+1)/2;
|
||||
populatedEntries=populatedEntries<maxSize?populatedEntries+1:populatedEntries;
|
||||
Object[] o = new Object[Math.min((int)(100/(100/(populatedEntries+avgLoad)*loadFactor)), maxSize)]; // Dynamically update array size according to loadFactor and max Size
|
||||
System.arraycopy(set, 0, o, 1, o.length!=maxSize?populatedEntries:populatedEntries-1);
|
||||
o[0] = e;
|
||||
set = o;
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean remove(Object o1) {
|
||||
boolean b = false;
|
||||
for(int i = 0; i<populatedEntries; ++i) if(o1.equals(set[i])){ set[i] = null; b = true; --populatedEntries; break; }
|
||||
adaptLoad();
|
||||
shift();
|
||||
return b;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean containsAll(Collection<?> c) {
|
||||
int i = 0;
|
||||
int j = 0;
|
||||
for(Object o : c) {
|
||||
++j;
|
||||
for (Object o1 : set)
|
||||
if (o.equals(o1)) ++i;
|
||||
}
|
||||
return j==i;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean addAll(Collection<? extends E> c) {
|
||||
ArrayList<Object> l = new ArrayList<>();
|
||||
for(Object e : c)
|
||||
for (Object o : set) {
|
||||
if (e.equals(o)){
|
||||
l.remove(e);
|
||||
break;
|
||||
}
|
||||
l.add(e);
|
||||
}
|
||||
if(l.size()==0) return false;
|
||||
++load;
|
||||
avgLoad = (avgLoad+l.size()*avgLoad/load)/2; // Improve prediction using relative applied load (to a point)
|
||||
int tmp = populatedEntries, cal;
|
||||
populatedEntries=populatedEntries+l.size()<maxSize?populatedEntries+l.size():maxSize;
|
||||
cal = (int) (100 / (100 / (populatedEntries + avgLoad) * loadFactor));
|
||||
if(populatedEntries==tmp){ // Just use the pre-allocated space determined by the load factor
|
||||
System.arraycopy(set, 0, set, l.size(), set.length-l.size());
|
||||
System.arraycopy(l.toArray(), 0, set, 0, l.size()-1);
|
||||
} else {
|
||||
Object[] o = new Object[cal>=maxSize?maxSize:cal]; // Create new array
|
||||
for (int i = l.size(); i > 0; --i)
|
||||
if (i < o.length - 1)
|
||||
o[l.size() - i] = l.get(i); // Move new values to start of array relative to their position
|
||||
if (l.size() < tmp) for (int i = 0; i < tmp - l.size(); ++i)
|
||||
if (l.size() + i < o.length) o[l.size()] = set[i]; // Move old values to relative location
|
||||
set = o; // Update reference
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean retainAll(Collection<?> c) {
|
||||
ArrayList<Object> l = new ArrayList<>();
|
||||
for(Object e : c)
|
||||
for (Object o : set)
|
||||
if (e.equals(o)){
|
||||
l.add(e);
|
||||
break;
|
||||
}
|
||||
if(l.size() == 0 || set.length == l.size()) return false;
|
||||
clear();
|
||||
addAll((Collection<? extends E>) c);
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean removeAll(Collection<?> c) {
|
||||
int i = 0; // Tracker for how many entries were removed
|
||||
for(Object o : c) // Check against every element to remove
|
||||
for(int j = 0; j<populatedEntries; ++j) // Check again all populated entries
|
||||
if(o.equals(set[j])){
|
||||
++i;
|
||||
set[j] = null;
|
||||
}
|
||||
if(i==0) return false;
|
||||
shift();
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public void clear() {
|
||||
populatedEntries = 0;
|
||||
set = new Object[1];
|
||||
}
|
||||
|
||||
/**
|
||||
* Shifts the values to fill unpopulated array slots.
|
||||
*/
|
||||
void shift(){
|
||||
for(int i = 0; i<populatedEntries; ++i) if(set[i]==null) System.arraycopy(set,i+1,set,i,populatedEntries-i);// Shift populated slots towards the start of the array
|
||||
for(int i = populatedEntries; i<set.length; ++i) set[i] = null; // Remove accidental redundancies created when shifting
|
||||
}
|
||||
|
||||
/**
|
||||
* Adapt array size according to populated elements and load factor.
|
||||
*/
|
||||
void adaptLoad(){
|
||||
if(((int)(100/(100/(populatedEntries+avgLoad)*loadFactor)))>=set.length &&
|
||||
((int)(100/(100/populatedEntries+(avgLoad/2)*loadFactor)))<=set.length) return; // Array is roughly the right size
|
||||
Object[] o = new Object[Math.min((int)(100/(100/populatedEntries*loadFactor)), maxSize)];
|
||||
System.arraycopy(set, 0, o, 0, o.length);
|
||||
set = o;
|
||||
}
|
||||
|
||||
/**
|
||||
* Reset prediction algorithm judgement.
|
||||
* (Makes newly stored values more valuable when accounting for free space)
|
||||
*/
|
||||
public void resetLoadCount(){ load = 0; }
|
||||
|
||||
/**
|
||||
* Reset whole prediction algorithm.
|
||||
* May cause RAM to suffer at the expense of better processing times.
|
||||
*/
|
||||
public void resetLoadAlgo(){ load = 0; avgLoad = 2; }
|
||||
|
||||
|
||||
public int indexOf(Object o){
|
||||
for(int i = 0; i<populatedEntries; ++i)
|
||||
if(o.equals(set[i])) return i;
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
protected static class ShiftingIterator<E> implements Iterator<E>{
|
||||
|
||||
private final ShiftingSet<E> s;
|
||||
private int ctr = -1;
|
||||
|
||||
public ShiftingIterator(ShiftingSet<E> s){
|
||||
this.s=s;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean hasNext() {
|
||||
return ctr+1<=s.set.length-1;
|
||||
}
|
||||
|
||||
@Override
|
||||
public E next() {
|
||||
if(!hasNext()) return null;
|
||||
return (E) s.set[++ctr];
|
||||
}
|
||||
return entries;
|
||||
}
|
||||
}
|
||||
|
||||
217
src/com/tofvesson/collections/ShiftingSet.java
Normal file
217
src/com/tofvesson/collections/ShiftingSet.java
Normal file
@ -0,0 +1,217 @@
|
||||
package com.tofvesson.collections;
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.Collection;
|
||||
import java.util.Set;
|
||||
|
||||
public class ShiftingSet<E> implements Set<E> {
|
||||
|
||||
/**
|
||||
* Holder for entries. Dur to reasons, the array holds objects.
|
||||
*/
|
||||
Object[] entries;
|
||||
|
||||
/**
|
||||
* Populated entries.
|
||||
*/
|
||||
int pop = 0;
|
||||
|
||||
/**
|
||||
* Maximum size of set.
|
||||
*/
|
||||
final int maxSize;
|
||||
|
||||
/**
|
||||
* Load factor used when calculating how to resize array.
|
||||
*/
|
||||
double load;
|
||||
|
||||
static final Empty empty = new Empty();
|
||||
|
||||
public ShiftingSet(int maxSize, double load){
|
||||
this.maxSize = maxSize>1?20:maxSize;
|
||||
this.load = load>1||load<0.1?0.75:load;
|
||||
entries = new Object[1];
|
||||
}
|
||||
|
||||
public ShiftingSet(int maxSize){
|
||||
this(maxSize, 0.75);
|
||||
}
|
||||
|
||||
@Override
|
||||
public int size() {
|
||||
return pop;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean isEmpty() {
|
||||
return pop==0;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean contains(Object o) {
|
||||
if(o==empty) return false;
|
||||
for(Object o1 : entries) if(o.equals(o1)) return true;
|
||||
return false;
|
||||
}
|
||||
|
||||
@Override
|
||||
public Iterator<E> iterator() {
|
||||
return new Iterator<>();
|
||||
}
|
||||
|
||||
@Override
|
||||
public Object[] toArray() {
|
||||
Object[] o = new Object[pop];
|
||||
System.arraycopy(entries, 0, o, 0, pop);
|
||||
return o;
|
||||
}
|
||||
|
||||
@Override
|
||||
public <T> T[] toArray(T[] a) {
|
||||
for(int i = 0; i<Math.min(pop, a.length); ++i) a[i] = (T) entries[i];
|
||||
return a;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean add(E e) {
|
||||
preparePopulate(1);
|
||||
entries[0] = e!=null?e:empty;
|
||||
pop=pop!=maxSize?pop+1:pop;
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean remove(Object o) {
|
||||
for(int i = 0; i<pop; ++i)
|
||||
if(entries[i]==o){
|
||||
entries[i]=null;
|
||||
shift();
|
||||
adaptLoad(-1);
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean containsAll(Collection<?> c) {
|
||||
boolean b = true;
|
||||
for(Object o : c) b &= contains(o);
|
||||
return b;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean addAll(Collection<? extends E> c) {
|
||||
ArrayList<? extends E> l = new ArrayList<>(c);
|
||||
preparePopulate(c.size());
|
||||
for(int i = 0; i<Math.min(entries.length, c.size()); ++i) entries[i] = l.get(i);
|
||||
pop=Math.min(pop+c.size(), maxSize);
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean retainAll(Collection<?> c) {
|
||||
int removed = 0;
|
||||
for(int i = 0; i<pop; ++i)
|
||||
if(!c.contains(entries[i])) {
|
||||
entries[i] = null;
|
||||
++removed;
|
||||
}
|
||||
if(removed==0) return false;
|
||||
shift();
|
||||
adaptLoad(-removed);
|
||||
pop -= removed;
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean removeAll(Collection<?> c) {
|
||||
int removed = 0;
|
||||
for(int i = 0; i<pop; ++i)
|
||||
if(c.contains(entries[i])) {
|
||||
entries[i] = null;
|
||||
++removed;
|
||||
}
|
||||
if(removed==0) return false;
|
||||
shift();
|
||||
adaptLoad(-removed);
|
||||
pop -= removed;
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public void clear() {
|
||||
pop = 0;
|
||||
entries = new Object[1];
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean equals(Object o) {
|
||||
if(!(o instanceof ShiftingSet) || ((ShiftingSet) o).pop!=pop ||
|
||||
((ShiftingSet) o).load!=load || ((ShiftingSet) o).maxSize!=maxSize) return false; // Check for matching parameters
|
||||
for(int i = 0; i<pop; ++i) if(entries[i]!=((ShiftingSet) o).entries[i]) return false; // Check for matching data
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public int hashCode() {
|
||||
int hc = 0;
|
||||
for(int i = 0; i<pop; ++i) hc+=entries[i]!=null?entries[i].hashCode():0;
|
||||
return hc;
|
||||
}
|
||||
|
||||
public int indexOf(Object o){
|
||||
for(int i = 0; i<pop; ++i)
|
||||
if(entries[i].equals(o)) return i;
|
||||
return -1;
|
||||
}
|
||||
|
||||
/**
|
||||
* Changes size of array to account for new entries.
|
||||
* @param accountFor The amount new elements to be accounted for.
|
||||
*/
|
||||
protected void adaptLoad(int accountFor){
|
||||
if(accountFor==0) throw new RuntimeException("Invalid load adaptation value specified!");
|
||||
if(pop+accountFor<=0){
|
||||
entries = new Object[1];
|
||||
return;
|
||||
}
|
||||
Object[] o = new Object[(int) Math.max(1, Math.min(100/(100/(pop+accountFor)*load), maxSize))]; // Load adaptation algorithm capping at maxSize or 0
|
||||
System.arraycopy(entries, 0, o, 0, Math.min(o.length, entries.length)); // Move as many entries as possible
|
||||
}
|
||||
|
||||
/**
|
||||
* Shift all elements towards the start of the arrays.
|
||||
*/
|
||||
protected void shift(){
|
||||
for(int i = 0; i<pop; ++i)
|
||||
if(entries[i]==null && i!=pop-1)
|
||||
for(int j = i; j<pop; ++j)
|
||||
if(entries[j]!=null){
|
||||
entries[i] = entries[j];
|
||||
entries[i] = null;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
protected void preparePopulate(int accountFor){
|
||||
if(accountFor>entries.length) adaptLoad(accountFor); // If new elements exceed limit, adapt load
|
||||
if(accountFor>entries.length) return; // If the expected new load still exceeds the limit, no need to delete elements
|
||||
System.arraycopy(entries, 0, entries, accountFor, entries.length-accountFor); // Shift array elements to account for new elements
|
||||
}
|
||||
|
||||
public class Iterator<E> implements java.util.Iterator<E>{
|
||||
|
||||
int counter = 0;
|
||||
|
||||
@Override
|
||||
public boolean hasNext() {
|
||||
return counter<ShiftingSet.this.pop;
|
||||
}
|
||||
|
||||
@Override
|
||||
public E next() {
|
||||
return (E) entries[counter++];
|
||||
}
|
||||
}
|
||||
}
|
||||
Loading…
x
Reference in New Issue
Block a user