Finishing touches for the 0.6.0 release.
This commit is contained in:
		
							parent
							
								
									fc5d43e14b
								
							
						
					
					
						commit
						3d6cbf5ac1
					
				| @ -9,6 +9,7 @@ | |||||||
| - Added: ArrayList.of(Class, size) that allows you to allocate a size right at the creation of the List without having to create a wrapper array. | - Added: ArrayList.of(Class, size) that allows you to allocate a size right at the creation of the List without having to create a wrapper array. | ||||||
| - Added: A ConcurrentHashMap implementation. | - Added: A ConcurrentHashMap implementation. | ||||||
| - Fixed: containsValue in the HashMap wouldn't check the nullKey | - Fixed: containsValue in the HashMap wouldn't check the nullKey | ||||||
|  | - Removed: Deprecated functions from SortedMaps/Sets | ||||||
| 
 | 
 | ||||||
| ### Version 0.5.3 | ### Version 0.5.3 | ||||||
| - Added: OrderedMap/Set | - Added: OrderedMap/Set | ||||||
|  | |||||||
| @ -7,11 +7,12 @@ It is based on Java's Collection Library and FastUtil. | |||||||
| But its focus is a different one.      | But its focus is a different one.      | ||||||
| 
 | 
 | ||||||
| ## Main Features:       | ## Main Features:       | ||||||
| - ArrayLists / LinkedLists | - ArrayLists / LinkedLists / CopyOnWriteLists | ||||||
| - HashSets/Maps (Linked & HashControl) | - HashSets/Maps (Linked & HashControl) | ||||||
| - TreeSets/Maps (RB & AVL) | - TreeSets/Maps (RB & AVL) | ||||||
| - EnumMaps | - EnumMaps | ||||||
| - Immutable Maps/Lists/Sets | - Immutable Maps/Lists/Sets | ||||||
|  | - ConcurrentHashMaps | ||||||
| - Priority Queues | - Priority Queues | ||||||
| - Streams & Functional Queries | - Streams & Functional Queries | ||||||
| - SplitIterators | - SplitIterators | ||||||
| @ -20,7 +21,7 @@ But its focus is a different one. | |||||||
| - Unary/Functions | - Unary/Functions | ||||||
| - Suppliers | - Suppliers | ||||||
| - Bi/Consumers | - Bi/Consumers | ||||||
| 
 | - AsyncBuilders | ||||||
| 
 | 
 | ||||||
| ## Current Level of Stability | ## Current Level of Stability | ||||||
| Since this is a relatively new Library, stability was not perfect and some areas are not perfect yet.      | Since this is a relatively new Library, stability was not perfect and some areas are not perfect yet.      | ||||||
| @ -95,13 +96,14 @@ repositories { | |||||||
|     } |     } | ||||||
| } | } | ||||||
| dependencies { | dependencies { | ||||||
| 	compile 'de.speiger:Primitive-Collections:0.5.3' | 	compile 'de.speiger:Primitive-Collections:0.6.0' | ||||||
| } | } | ||||||
| ``` | ``` | ||||||
| Direct: | Direct: | ||||||
| 
 | 
 | ||||||
| | Version 	| Jar                                                                                                                          	| Sources                                                                                                                              	| Java Doc                                                                                                                             	| | | Version 	| Jar                                                                                                                          	| Sources                                                                                                                              	| Java Doc                                                                                                                             	| | ||||||
| |---------	|------------------------------------------------------------------------------------------------------------------------------	|--------------------------------------------------------------------------------------------------------------------------------------	|--------------------------------------------------------------------------------------------------------------------------------------	| | |---------	|------------------------------------------------------------------------------------------------------------------------------	|--------------------------------------------------------------------------------------------------------------------------------------	|--------------------------------------------------------------------------------------------------------------------------------------	| | ||||||
|  | | 0.6.0   	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.6.0/Primitive-Collections-0.6.0.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.6.0/Primitive-Collections-0.6.0-sources.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.6.0/Primitive-Collections-0.6.0-javadoc.jar) 	| | ||||||
| | 0.5.3   	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.3/Primitive-Collections-0.5.3.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.3/Primitive-Collections-0.5.3-sources.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.3/Primitive-Collections-0.5.3-javadoc.jar) 	| | | 0.5.3   	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.3/Primitive-Collections-0.5.3.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.3/Primitive-Collections-0.5.3-sources.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.3/Primitive-Collections-0.5.3-javadoc.jar) 	| | ||||||
| | 0.5.2   	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.2/Primitive-Collections-0.5.2.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.2/Primitive-Collections-0.5.2-sources.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.2/Primitive-Collections-0.5.2-javadoc.jar) 	| | | 0.5.2   	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.2/Primitive-Collections-0.5.2.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.2/Primitive-Collections-0.5.2-sources.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.2/Primitive-Collections-0.5.2-javadoc.jar) 	| | ||||||
| | 0.5.1   	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.1/Primitive-Collections-0.5.1.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.1/Primitive-Collections-0.5.1-sources.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.1/Primitive-Collections-0.5.1-javadoc.jar) 	| | | 0.5.1   	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.1/Primitive-Collections-0.5.1.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.1/Primitive-Collections-0.5.1-sources.jar) 	| [Download](https://maven.speiger.com/repository/main/de/speiger/Primitive-Collections/0.5.1/Primitive-Collections-0.5.1-javadoc.jar) 	| | ||||||
|  | |||||||
| @ -1,7 +1,6 @@ | |||||||
| package speiger.src.collections.PACKAGE.maps.impl.customHash; | package speiger.src.collections.PACKAGE.maps.impl.customHash; | ||||||
| 
 | 
 | ||||||
| import java.util.Arrays; | import java.util.Arrays; | ||||||
| import java.util.Comparator; |  | ||||||
| import java.util.Map; | import java.util.Map; | ||||||
| import java.util.NoSuchElementException; | import java.util.NoSuchElementException; | ||||||
| import java.util.function.Consumer; | import java.util.function.Consumer; | ||||||
| @ -10,7 +9,6 @@ import java.util.Objects; | |||||||
| 
 | 
 | ||||||
| import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | ||||||
| #if !TYPE_OBJECT | #if !TYPE_OBJECT | ||||||
| import speiger.src.collections.PACKAGE.functions.COMPARATOR; |  | ||||||
| import speiger.src.collections.PACKAGE.functions.CONSUMER; | import speiger.src.collections.PACKAGE.functions.CONSUMER; | ||||||
| import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | ||||||
| #endif | #endif | ||||||
| @ -22,9 +20,8 @@ import speiger.src.collections.PACKAGE.functions.function.SINGLE_UNARY_OPERATOR; | |||||||
| import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.MAP; | import speiger.src.collections.PACKAGE.maps.interfaces.MAP; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.ORDERED_MAP; | import speiger.src.collections.PACKAGE.maps.interfaces.ORDERED_MAP; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.SORTED_MAP; |  | ||||||
| import speiger.src.collections.PACKAGE.sets.ABSTRACT_SET; | import speiger.src.collections.PACKAGE.sets.ABSTRACT_SET; | ||||||
| import speiger.src.collections.PACKAGE.sets.SORTED_SET; | import speiger.src.collections.PACKAGE.sets.ORDERED_SET; | ||||||
| import speiger.src.collections.PACKAGE.sets.SET; | import speiger.src.collections.PACKAGE.sets.SET; | ||||||
| import speiger.src.collections.PACKAGE.utils.STRATEGY; | import speiger.src.collections.PACKAGE.utils.STRATEGY; | ||||||
| import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_ABSTRACT_COLLECTION; | import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_ABSTRACT_COLLECTION; | ||||||
| @ -60,7 +57,6 @@ import speiger.src.collections.objects.functions.function.ObjectObjectUnaryOpera | |||||||
| import speiger.src.collections.objects.collections.ObjectBidirectionalIterator; | import speiger.src.collections.objects.collections.ObjectBidirectionalIterator; | ||||||
| import speiger.src.collections.objects.lists.ObjectListIterator; | import speiger.src.collections.objects.lists.ObjectListIterator; | ||||||
| import speiger.src.collections.objects.sets.AbstractObjectSet; | import speiger.src.collections.objects.sets.AbstractObjectSet; | ||||||
| import speiger.src.collections.objects.sets.ObjectSortedSet; |  | ||||||
| import speiger.src.collections.objects.sets.ObjectSet; | import speiger.src.collections.objects.sets.ObjectSet; | ||||||
| #endif | #endif | ||||||
| import speiger.src.collections.utils.HashUtil; | import speiger.src.collections.utils.HashUtil; | ||||||
| @ -72,7 +68,7 @@ import speiger.src.collections.utils.HashUtil; | |||||||
|  * @Type(T) |  * @Type(T) | ||||||
|  * @ValueType(V)  |  * @ValueType(V)  | ||||||
|  */ |  */ | ||||||
| public class LINKED_CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE extends CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE implements SORTED_MAP KEY_VALUE_GENERIC_TYPE, ORDERED_MAP KEY_VALUE_GENERIC_TYPE | public class LINKED_CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE extends CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE implements ORDERED_MAP KEY_VALUE_GENERIC_TYPE | ||||||
| { | { | ||||||
| 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | ||||||
| 	protected transient long[] links; | 	protected transient long[] links; | ||||||
| @ -364,20 +360,6 @@ public class LINKED_CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE extends CUSTOM_HASH_M | |||||||
| 		return map; | 		return map; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	@Override |  | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { |  | ||||||
| 		return null; |  | ||||||
| 	} |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE subMap(KEY_TYPE fromKey, KEY_TYPE toKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE headMap(KEY_TYPE toKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE tailMap(KEY_TYPE fromKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public KEY_TYPE FIRST_ENTRY_KEY() { | 	public KEY_TYPE FIRST_ENTRY_KEY() { | ||||||
| 		if(size == 0) throw new NoSuchElementException(); | 		if(size == 0) throw new NoSuchElementException(); | ||||||
| @ -621,7 +603,7 @@ public class LINKED_CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE extends CUSTOM_HASH_M | |||||||
| 		values = newValues; | 		values = newValues; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private class MapEntrySet extends AbstractObjectSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> implements SORTED_MAP.FastSortedSet KEY_VALUE_GENERIC_TYPE { | 	private class MapEntrySet extends AbstractObjectSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> implements ORDERED_MAP.FastOrderedSet KEY_VALUE_GENERIC_TYPE { | ||||||
| 		@Override | 		@Override | ||||||
| 		public boolean addAndMoveToFirst(MAP.Entry KEY_VALUE_GENERIC_TYPE o) { throw new UnsupportedOperationException(); } | 		public boolean addAndMoveToFirst(MAP.Entry KEY_VALUE_GENERIC_TYPE o) { throw new UnsupportedOperationException(); } | ||||||
| 		@Override | 		@Override | ||||||
| @ -861,20 +843,9 @@ public class LINKED_CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE extends CUSTOM_HASH_M | |||||||
| 		public void clear() { | 		public void clear() { | ||||||
| 			LINKED_CUSTOM_HASH_MAP.this.clear(); | 			LINKED_CUSTOM_HASH_MAP.this.clear(); | ||||||
| 		} | 		} | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public Comparator<MAP.Entry KEY_VALUE_GENERIC_TYPE> comparator() { |  | ||||||
| 			return null; |  | ||||||
| 		} |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> subSet(MAP.Entry KEY_VALUE_GENERIC_TYPE fromElement, MAP.Entry KEY_VALUE_GENERIC_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> headSet(MAP.Entry KEY_VALUE_GENERIC_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> tailSet(MAP.Entry KEY_VALUE_GENERIC_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private final class KeySet extends ABSTRACT_SET KEY_GENERIC_TYPE implements SORTED_SET KEY_GENERIC_TYPE { | 	private final class KeySet extends ABSTRACT_SET KEY_GENERIC_TYPE implements ORDERED_SET KEY_GENERIC_TYPE { | ||||||
| #if TYPE_OBJECT | #if TYPE_OBJECT | ||||||
| 		@Override | 		@Override | ||||||
| 		@Deprecated | 		@Deprecated | ||||||
| @ -1093,18 +1064,6 @@ public class LINKED_CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE extends CUSTOM_HASH_M | |||||||
| 			} | 			} | ||||||
| 			return result; | 			return result; | ||||||
| 		} | 		} | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return null; } |  | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE subSet(KEY_TYPE fromElement, KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE headSet(KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE tailSet(KEY_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private class Values extends VALUE_ABSTRACT_COLLECTION VALUE_GENERIC_TYPE { | 	private class Values extends VALUE_ABSTRACT_COLLECTION VALUE_GENERIC_TYPE { | ||||||
|  | |||||||
| @ -1,7 +1,6 @@ | |||||||
| package speiger.src.collections.PACKAGE.maps.impl.hash; | package speiger.src.collections.PACKAGE.maps.impl.hash; | ||||||
| 
 | 
 | ||||||
| import java.util.Arrays; | import java.util.Arrays; | ||||||
| import java.util.Comparator; |  | ||||||
| import java.util.Map; | import java.util.Map; | ||||||
| import java.util.NoSuchElementException; | import java.util.NoSuchElementException; | ||||||
| import java.util.function.Consumer; | import java.util.function.Consumer; | ||||||
| @ -10,7 +9,6 @@ import java.util.Objects; | |||||||
| 
 | 
 | ||||||
| import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | ||||||
| #if !TYPE_OBJECT | #if !TYPE_OBJECT | ||||||
| import speiger.src.collections.PACKAGE.functions.COMPARATOR; |  | ||||||
| import speiger.src.collections.PACKAGE.functions.CONSUMER; | import speiger.src.collections.PACKAGE.functions.CONSUMER; | ||||||
| import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | ||||||
| #endif | #endif | ||||||
| @ -21,10 +19,9 @@ import speiger.src.collections.PACKAGE.functions.consumer.BI_CONSUMER; | |||||||
| import speiger.src.collections.PACKAGE.functions.function.SINGLE_UNARY_OPERATOR; | import speiger.src.collections.PACKAGE.functions.function.SINGLE_UNARY_OPERATOR; | ||||||
| import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.MAP; | import speiger.src.collections.PACKAGE.maps.interfaces.MAP; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.SORTED_MAP; |  | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.ORDERED_MAP; | import speiger.src.collections.PACKAGE.maps.interfaces.ORDERED_MAP; | ||||||
| import speiger.src.collections.PACKAGE.sets.ABSTRACT_SET; | import speiger.src.collections.PACKAGE.sets.ABSTRACT_SET; | ||||||
| import speiger.src.collections.PACKAGE.sets.SORTED_SET; | import speiger.src.collections.PACKAGE.sets.ORDERED_SET; | ||||||
| import speiger.src.collections.PACKAGE.sets.SET; | import speiger.src.collections.PACKAGE.sets.SET; | ||||||
| import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_ABSTRACT_COLLECTION; | import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_ABSTRACT_COLLECTION; | ||||||
| import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_COLLECTION; | import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_COLLECTION; | ||||||
| @ -59,7 +56,6 @@ import speiger.src.collections.objects.functions.function.ObjectObjectUnaryOpera | |||||||
| import speiger.src.collections.objects.collections.ObjectBidirectionalIterator; | import speiger.src.collections.objects.collections.ObjectBidirectionalIterator; | ||||||
| import speiger.src.collections.objects.lists.ObjectListIterator; | import speiger.src.collections.objects.lists.ObjectListIterator; | ||||||
| import speiger.src.collections.objects.sets.AbstractObjectSet; | import speiger.src.collections.objects.sets.AbstractObjectSet; | ||||||
| import speiger.src.collections.objects.sets.ObjectSortedSet; |  | ||||||
| import speiger.src.collections.objects.sets.ObjectSet; | import speiger.src.collections.objects.sets.ObjectSet; | ||||||
| #endif | #endif | ||||||
| import speiger.src.collections.utils.HashUtil; | import speiger.src.collections.utils.HashUtil; | ||||||
| @ -71,7 +67,7 @@ import speiger.src.collections.utils.HashUtil; | |||||||
|  * @Type(T) |  * @Type(T) | ||||||
|  * @ValueType(V) |  * @ValueType(V) | ||||||
|  */ |  */ | ||||||
| public class LINKED_HASH_MAP KEY_VALUE_GENERIC_TYPE extends HASH_MAP KEY_VALUE_GENERIC_TYPE implements SORTED_MAP KEY_VALUE_GENERIC_TYPE, ORDERED_MAP KEY_VALUE_GENERIC_TYPE | public class LINKED_HASH_MAP KEY_VALUE_GENERIC_TYPE extends HASH_MAP KEY_VALUE_GENERIC_TYPE implements ORDERED_MAP KEY_VALUE_GENERIC_TYPE | ||||||
| { | { | ||||||
| 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | ||||||
| 	protected transient long[] links; | 	protected transient long[] links; | ||||||
| @ -368,20 +364,6 @@ public class LINKED_HASH_MAP KEY_VALUE_GENERIC_TYPE extends HASH_MAP KEY_VALUE_G | |||||||
| 		return map; | 		return map; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	@Override |  | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { |  | ||||||
| 		return null; |  | ||||||
| 	} |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE subMap(KEY_TYPE fromKey, KEY_TYPE toKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE headMap(KEY_TYPE toKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE tailMap(KEY_TYPE fromKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public KEY_TYPE FIRST_ENTRY_KEY() { | 	public KEY_TYPE FIRST_ENTRY_KEY() { | ||||||
| 		if(size == 0) throw new NoSuchElementException(); | 		if(size == 0) throw new NoSuchElementException(); | ||||||
| @ -625,7 +607,7 @@ public class LINKED_HASH_MAP KEY_VALUE_GENERIC_TYPE extends HASH_MAP KEY_VALUE_G | |||||||
| 		values = newValues; | 		values = newValues; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private class MapEntrySet extends AbstractObjectSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> implements SORTED_MAP.FastSortedSet KEY_VALUE_GENERIC_TYPE { | 	private class MapEntrySet extends AbstractObjectSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> implements ORDERED_MAP.FastOrderedSet KEY_VALUE_GENERIC_TYPE { | ||||||
| 		@Override | 		@Override | ||||||
| 		public boolean addAndMoveToFirst(MAP.Entry KEY_VALUE_GENERIC_TYPE o) { throw new UnsupportedOperationException(); } | 		public boolean addAndMoveToFirst(MAP.Entry KEY_VALUE_GENERIC_TYPE o) { throw new UnsupportedOperationException(); } | ||||||
| 		@Override | 		@Override | ||||||
| @ -862,20 +844,9 @@ public class LINKED_HASH_MAP KEY_VALUE_GENERIC_TYPE extends HASH_MAP KEY_VALUE_G | |||||||
| 		public void clear() { | 		public void clear() { | ||||||
| 			LINKED_HASH_MAP.this.clear(); | 			LINKED_HASH_MAP.this.clear(); | ||||||
| 		} | 		} | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public Comparator<MAP.Entry KEY_VALUE_GENERIC_TYPE> comparator() { |  | ||||||
| 			return null; |  | ||||||
| 		} |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> subSet(MAP.Entry KEY_VALUE_GENERIC_TYPE fromElement, MAP.Entry KEY_VALUE_GENERIC_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> headSet(MAP.Entry KEY_VALUE_GENERIC_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> tailSet(MAP.Entry KEY_VALUE_GENERIC_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private final class KeySet extends ABSTRACT_SET KEY_GENERIC_TYPE implements SORTED_SET KEY_GENERIC_TYPE { | 	private final class KeySet extends ABSTRACT_SET KEY_GENERIC_TYPE implements ORDERED_SET KEY_GENERIC_TYPE { | ||||||
| #if TYPE_OBJECT | #if TYPE_OBJECT | ||||||
| 		@Override | 		@Override | ||||||
| 		@Deprecated | 		@Deprecated | ||||||
| @ -1092,18 +1063,6 @@ public class LINKED_HASH_MAP KEY_VALUE_GENERIC_TYPE extends HASH_MAP KEY_VALUE_G | |||||||
| 			} | 			} | ||||||
| 			return result; | 			return result; | ||||||
| 		} | 		} | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return null; } |  | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE subSet(KEY_TYPE fromElement, KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE headSet(KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE tailSet(KEY_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private class Values extends VALUE_ABSTRACT_COLLECTION VALUE_GENERIC_TYPE { | 	private class Values extends VALUE_ABSTRACT_COLLECTION VALUE_GENERIC_TYPE { | ||||||
|  | |||||||
| @ -1,7 +1,6 @@ | |||||||
| package speiger.src.collections.PACKAGE.maps.impl.immutable; | package speiger.src.collections.PACKAGE.maps.impl.immutable; | ||||||
| 
 | 
 | ||||||
| import java.util.Arrays; | import java.util.Arrays; | ||||||
| import java.util.Comparator; |  | ||||||
| import java.util.Map; | import java.util.Map; | ||||||
| import java.util.NoSuchElementException; | import java.util.NoSuchElementException; | ||||||
| import java.util.Objects; | import java.util.Objects; | ||||||
| @ -11,7 +10,6 @@ import java.util.function.BiFunction; | |||||||
| #if !TYPE_OBJECT | #if !TYPE_OBJECT | ||||||
| import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | ||||||
| import speiger.src.collections.PACKAGE.functions.CONSUMER; | import speiger.src.collections.PACKAGE.functions.CONSUMER; | ||||||
| import speiger.src.collections.PACKAGE.functions.COMPARATOR; |  | ||||||
| import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | ||||||
| #endif | #endif | ||||||
| #if !TYPE_OBJECT && !VALUE_BOOLEAN | #if !TYPE_OBJECT && !VALUE_BOOLEAN | ||||||
| @ -24,11 +22,10 @@ import speiger.src.collections.PACKAGE.functions.function.UNARY_OPERATOR; | |||||||
| import speiger.src.collections.PACKAGE.functions.function.SINGLE_UNARY_OPERATOR; | import speiger.src.collections.PACKAGE.functions.function.SINGLE_UNARY_OPERATOR; | ||||||
| #endif | #endif | ||||||
| import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.SORTED_MAP; |  | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.ORDERED_MAP; | import speiger.src.collections.PACKAGE.maps.interfaces.ORDERED_MAP; | ||||||
| import speiger.src.collections.PACKAGE.maps.abstracts.ABSTRACT_MAP; | import speiger.src.collections.PACKAGE.maps.abstracts.ABSTRACT_MAP; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.MAP; | import speiger.src.collections.PACKAGE.maps.interfaces.MAP; | ||||||
| import speiger.src.collections.PACKAGE.sets.SORTED_SET; | import speiger.src.collections.PACKAGE.sets.ORDERED_SET; | ||||||
| import speiger.src.collections.PACKAGE.utils.maps.MAPS; | import speiger.src.collections.PACKAGE.utils.maps.MAPS; | ||||||
| #if !TYPE_OBJECT | #if !TYPE_OBJECT | ||||||
| import speiger.src.collections.PACKAGE.utils.ARRAYS; | import speiger.src.collections.PACKAGE.utils.ARRAYS; | ||||||
| @ -71,7 +68,6 @@ import speiger.src.collections.objects.functions.function.ObjectObjectUnaryOpera | |||||||
| 
 | 
 | ||||||
| #endif | #endif | ||||||
| import speiger.src.collections.objects.lists.ObjectListIterator; | import speiger.src.collections.objects.lists.ObjectListIterator; | ||||||
| import speiger.src.collections.objects.sets.ObjectSortedSet; |  | ||||||
| #endif | #endif | ||||||
| import speiger.src.collections.objects.sets.AbstractObjectSet; | import speiger.src.collections.objects.sets.AbstractObjectSet; | ||||||
| import speiger.src.collections.objects.sets.ObjectSet; | import speiger.src.collections.objects.sets.ObjectSet; | ||||||
| @ -85,7 +81,7 @@ import speiger.src.collections.utils.SanityChecks; | |||||||
|  * @Type(T) |  * @Type(T) | ||||||
|  * @ValueType(V) |  * @ValueType(V) | ||||||
|  */ |  */ | ||||||
| public class IMMUTABLE_HASH_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VALUE_GENERIC_TYPE implements SORTED_MAP KEY_VALUE_GENERIC_TYPE, ORDERED_MAP KEY_VALUE_GENERIC_TYPE | public class IMMUTABLE_HASH_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VALUE_GENERIC_TYPE implements ORDERED_MAP KEY_VALUE_GENERIC_TYPE | ||||||
| { | { | ||||||
| 	/** The Backing keys array */ | 	/** The Backing keys array */ | ||||||
| 	protected transient KEY_TYPE[] keys; | 	protected transient KEY_TYPE[] keys; | ||||||
| @ -465,15 +461,6 @@ public class IMMUTABLE_HASH_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_ | |||||||
| 		return map; | 		return map; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	@Override |  | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { return null; } |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE subMap(KEY_TYPE fromKey, KEY_TYPE toKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE headMap(KEY_TYPE toKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE tailMap(KEY_TYPE fromKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public void forEach(BI_CONSUMER KEY_VALUE_GENERIC_TYPE action) { | 	public void forEach(BI_CONSUMER KEY_VALUE_GENERIC_TYPE action) { | ||||||
| 		int index = firstIndex; | 		int index = firstIndex; | ||||||
| @ -597,7 +584,7 @@ public class IMMUTABLE_HASH_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_ | |||||||
| 		} | 		} | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private class MapEntrySet extends AbstractObjectSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> implements SORTED_MAP.FastSortedSet KEY_VALUE_GENERIC_TYPE { | 	private class MapEntrySet extends AbstractObjectSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> implements ORDERED_MAP.FastOrderedSet KEY_VALUE_GENERIC_TYPE { | ||||||
| 		@Override | 		@Override | ||||||
| 		public boolean addAndMoveToFirst(MAP.Entry KEY_VALUE_GENERIC_TYPE o) { throw new UnsupportedOperationException(); } | 		public boolean addAndMoveToFirst(MAP.Entry KEY_VALUE_GENERIC_TYPE o) { throw new UnsupportedOperationException(); } | ||||||
| 		@Override | 		@Override | ||||||
| @ -810,20 +797,9 @@ public class IMMUTABLE_HASH_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_ | |||||||
| 		 | 		 | ||||||
| 		@Override | 		@Override | ||||||
| 		public void clear() { throw new UnsupportedOperationException(); } | 		public void clear() { throw new UnsupportedOperationException(); } | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public Comparator<MAP.Entry KEY_VALUE_GENERIC_TYPE> comparator() { |  | ||||||
| 			return null; |  | ||||||
| 		} |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> subSet(MAP.Entry KEY_VALUE_GENERIC_TYPE fromElement, MAP.Entry KEY_VALUE_GENERIC_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> headSet(MAP.Entry KEY_VALUE_GENERIC_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> tailSet(MAP.Entry KEY_VALUE_GENERIC_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private final class KeySet extends ABSTRACT_SET KEY_GENERIC_TYPE implements SORTED_SET KEY_GENERIC_TYPE { | 	private final class KeySet extends ABSTRACT_SET KEY_GENERIC_TYPE implements ORDERED_SET KEY_GENERIC_TYPE { | ||||||
| #if TYPE_OBJECT | #if TYPE_OBJECT | ||||||
| 		@Override | 		@Override | ||||||
| 		@Deprecated | 		@Deprecated | ||||||
| @ -1024,18 +1000,6 @@ public class IMMUTABLE_HASH_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_ | |||||||
| 			} | 			} | ||||||
| 			return result; | 			return result; | ||||||
| 		} | 		} | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return null; } |  | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE subSet(KEY_TYPE fromElement, KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE headSet(KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE tailSet(KEY_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private class Values extends VALUE_ABSTRACT_COLLECTION VALUE_GENERIC_TYPE { | 	private class Values extends VALUE_ABSTRACT_COLLECTION VALUE_GENERIC_TYPE { | ||||||
|  | |||||||
										
											
												File diff suppressed because it is too large
												Load Diff
											
										
									
								
							| @ -1,6 +1,5 @@ | |||||||
| package speiger.src.collections.PACKAGE.maps.impl.misc; | package speiger.src.collections.PACKAGE.maps.impl.misc; | ||||||
| 
 | 
 | ||||||
| import java.util.Comparator; |  | ||||||
| import java.util.Map; | import java.util.Map; | ||||||
| import java.util.NoSuchElementException; | import java.util.NoSuchElementException; | ||||||
| import java.util.function.Consumer; | import java.util.function.Consumer; | ||||||
| @ -10,16 +9,14 @@ import java.util.Objects; | |||||||
| 
 | 
 | ||||||
| import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | ||||||
| #if !TYPE_OBJECT | #if !TYPE_OBJECT | ||||||
| import speiger.src.collections.PACKAGE.functions.COMPARATOR; |  | ||||||
| import speiger.src.collections.PACKAGE.functions.CONSUMER; | import speiger.src.collections.PACKAGE.functions.CONSUMER; | ||||||
| #endif | #endif | ||||||
| import speiger.src.collections.PACKAGE.functions.consumer.BI_CONSUMER; | import speiger.src.collections.PACKAGE.functions.consumer.BI_CONSUMER; | ||||||
| import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.MAP; | import speiger.src.collections.PACKAGE.maps.interfaces.MAP; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.ORDERED_MAP; | import speiger.src.collections.PACKAGE.maps.interfaces.ORDERED_MAP; | ||||||
| import speiger.src.collections.PACKAGE.maps.interfaces.SORTED_MAP; |  | ||||||
| import speiger.src.collections.PACKAGE.sets.ABSTRACT_SET; | import speiger.src.collections.PACKAGE.sets.ABSTRACT_SET; | ||||||
| import speiger.src.collections.PACKAGE.sets.SORTED_SET; | import speiger.src.collections.PACKAGE.sets.ORDERED_SET; | ||||||
| import speiger.src.collections.PACKAGE.sets.SET; | import speiger.src.collections.PACKAGE.sets.SET; | ||||||
| import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_ABSTRACT_COLLECTION; | import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_ABSTRACT_COLLECTION; | ||||||
| import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_COLLECTION; | import speiger.src.collections.VALUE_PACKAGE.collections.VALUE_COLLECTION; | ||||||
| @ -32,7 +29,6 @@ import speiger.src.collections.VALUE_PACKAGE.lists.VALUE_LIST_ITERATOR; | |||||||
| import speiger.src.collections.objects.collections.ObjectBidirectionalIterator; | import speiger.src.collections.objects.collections.ObjectBidirectionalIterator; | ||||||
| import speiger.src.collections.objects.lists.ObjectListIterator; | import speiger.src.collections.objects.lists.ObjectListIterator; | ||||||
| import speiger.src.collections.objects.sets.AbstractObjectSet; | import speiger.src.collections.objects.sets.AbstractObjectSet; | ||||||
| import speiger.src.collections.objects.sets.ObjectSortedSet; |  | ||||||
| import speiger.src.collections.objects.sets.ObjectSet; | import speiger.src.collections.objects.sets.ObjectSet; | ||||||
| #endif | #endif | ||||||
| 
 | 
 | ||||||
| @ -43,7 +39,7 @@ import speiger.src.collections.objects.sets.ObjectSet; | |||||||
|  * @Type(T) |  * @Type(T) | ||||||
|  * @ValueType(V) |  * @ValueType(V) | ||||||
|  */ |  */ | ||||||
| public class LINKED_ENUM_MAP KEY_ENUM_VALUE_GENERIC_TYPE extends ENUM_MAP KEY_VALUE_GENERIC_TYPE implements SORTED_MAP KEY_VALUE_GENERIC_TYPE, ORDERED_MAP KEY_VALUE_GENERIC_TYPE | public class LINKED_ENUM_MAP KEY_ENUM_VALUE_GENERIC_TYPE extends ENUM_MAP KEY_VALUE_GENERIC_TYPE implements ORDERED_MAP KEY_VALUE_GENERIC_TYPE | ||||||
| { | { | ||||||
| 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | ||||||
| 	protected long[] links; | 	protected long[] links; | ||||||
| @ -270,20 +266,6 @@ public class LINKED_ENUM_MAP KEY_ENUM_VALUE_GENERIC_TYPE extends ENUM_MAP KEY_VA | |||||||
| 		return map; | 		return map; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	@Override |  | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { |  | ||||||
| 		return null; |  | ||||||
| 	} |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE subMap(T fromKey, T toKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE headMap(T toKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_MAP KEY_VALUE_GENERIC_TYPE tailMap(T fromKey) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public T FIRST_ENTRY_KEY() { | 	public T FIRST_ENTRY_KEY() { | ||||||
| 		if(size == 0) throw new NoSuchElementException(); | 		if(size == 0) throw new NoSuchElementException(); | ||||||
| @ -434,7 +416,7 @@ public class LINKED_ENUM_MAP KEY_ENUM_VALUE_GENERIC_TYPE extends ENUM_MAP KEY_VA | |||||||
| 		} | 		} | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private class MapEntrySet extends AbstractObjectSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> implements SORTED_MAP.FastSortedSet KEY_VALUE_GENERIC_TYPE { | 	private class MapEntrySet extends AbstractObjectSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> implements ORDERED_MAP.FastOrderedSet KEY_VALUE_GENERIC_TYPE { | ||||||
| 		@Override | 		@Override | ||||||
| 		public boolean addAndMoveToFirst(MAP.Entry KEY_VALUE_GENERIC_TYPE o) { throw new UnsupportedOperationException(); } | 		public boolean addAndMoveToFirst(MAP.Entry KEY_VALUE_GENERIC_TYPE o) { throw new UnsupportedOperationException(); } | ||||||
| 		@Override | 		@Override | ||||||
| @ -559,20 +541,9 @@ public class LINKED_ENUM_MAP KEY_ENUM_VALUE_GENERIC_TYPE extends ENUM_MAP KEY_VA | |||||||
| 		public void clear() { | 		public void clear() { | ||||||
| 			LINKED_ENUM_MAP.this.clear(); | 			LINKED_ENUM_MAP.this.clear(); | ||||||
| 		} | 		} | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public Comparator<MAP.Entry KEY_VALUE_GENERIC_TYPE> comparator() { |  | ||||||
| 			return null; |  | ||||||
| 		} |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> subSet(MAP.Entry KEY_VALUE_GENERIC_TYPE fromElement, MAP.Entry KEY_VALUE_GENERIC_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> headSet(MAP.Entry KEY_VALUE_GENERIC_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public ObjectSortedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> tailSet(MAP.Entry KEY_VALUE_GENERIC_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private final class KeySet extends ABSTRACT_SET KEY_GENERIC_TYPE implements SORTED_SET KEY_GENERIC_TYPE { | 	private final class KeySet extends ABSTRACT_SET KEY_GENERIC_TYPE implements ORDERED_SET KEY_GENERIC_TYPE { | ||||||
| #if TYPE_OBJECT | #if TYPE_OBJECT | ||||||
| 		@Override | 		@Override | ||||||
| 		@Deprecated | 		@Deprecated | ||||||
| @ -685,17 +656,6 @@ public class LINKED_ENUM_MAP KEY_ENUM_VALUE_GENERIC_TYPE extends ENUM_MAP KEY_VA | |||||||
| 		} | 		} | ||||||
| 		 | 		 | ||||||
| #endif | #endif | ||||||
| 		@Override |  | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return null; } |  | ||||||
| 		 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE subSet(T fromElement, T toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE headSet(T toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 		@Override |  | ||||||
| 		public SORTED_SET KEY_GENERIC_TYPE tailSet(T fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	private class Values extends VALUE_ABSTRACT_COLLECTION VALUE_GENERIC_TYPE { | 	private class Values extends VALUE_ABSTRACT_COLLECTION VALUE_GENERIC_TYPE { | ||||||
|  | |||||||
| @ -363,19 +363,6 @@ public class AVL_TREE_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VALUE_ | |||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| #endif | #endif | ||||||
| 	@Override |  | ||||||
| 	public VALUE_TYPE putAndMoveToFirst(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public VALUE_TYPE putAndMoveToLast(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public boolean moveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public boolean moveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public VALUE_TYPE getAndMoveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public VALUE_TYPE getAndMoveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { return comparator; } | 	public COMPARATOR KEY_GENERIC_TYPE comparator() { return comparator; } | ||||||
| 
 | 
 | ||||||
| @ -1067,14 +1054,6 @@ public class AVL_TREE_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VALUE_ | |||||||
| #endif		 | #endif		 | ||||||
| 		@Override | 		@Override | ||||||
| 		public boolean add(KEY_TYPE e) { throw new UnsupportedOperationException(); } | 		public boolean add(KEY_TYPE e) { throw new UnsupportedOperationException(); } | ||||||
| 		@Override |  | ||||||
| 		public boolean addAndMoveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean addAndMoveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		 | 		 | ||||||
| 		@Override | 		@Override | ||||||
| 		public BI_ITERATOR KEY_GENERIC_TYPE iterator(KEY_TYPE fromElement) { | 		public BI_ITERATOR KEY_GENERIC_TYPE iterator(KEY_TYPE fromElement) { | ||||||
| @ -1543,18 +1522,6 @@ public class AVL_TREE_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VALUE_ | |||||||
| 		protected Node KEY_VALUE_GENERIC_TYPE absHighFence() { return (toEnd ? null : (hiInclusive ? map.findHigherNode(hi) : map.findCeilingNode(hi))); } | 		protected Node KEY_VALUE_GENERIC_TYPE absHighFence() { return (toEnd ? null : (hiInclusive ? map.findHigherNode(hi) : map.findCeilingNode(hi))); } | ||||||
| 		protected Node KEY_VALUE_GENERIC_TYPE absLowFence() { return (fromStart ? null : (loInclusive ?  map.findLowerNode(lo) : map.findFloorNode(lo))); } | 		protected Node KEY_VALUE_GENERIC_TYPE absLowFence() { return (fromStart ? null : (loInclusive ?  map.findLowerNode(lo) : map.findFloorNode(lo))); } | ||||||
| 		 | 		 | ||||||
| 		@Override |  | ||||||
| 		public VALUE_TYPE putAndMoveToFirst(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public VALUE_TYPE putAndMoveToLast(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public VALUE_TYPE getAndMoveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public VALUE_TYPE getAndMoveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override | 		@Override | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return map.comparator(); } | 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return map.comparator(); } | ||||||
| 		 | 		 | ||||||
|  | |||||||
| @ -366,19 +366,6 @@ public class RB_TREE_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VALUE_G | |||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| #endif | #endif | ||||||
| 	@Override |  | ||||||
| 	public VALUE_TYPE putAndMoveToFirst(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public VALUE_TYPE putAndMoveToLast(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public boolean moveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public boolean moveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public VALUE_TYPE getAndMoveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 	@Override |  | ||||||
| 	public VALUE_TYPE getAndMoveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { return comparator; } | 	public COMPARATOR KEY_GENERIC_TYPE comparator() { return comparator; } | ||||||
| 
 | 
 | ||||||
| @ -1122,18 +1109,9 @@ public class RB_TREE_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VALUE_G | |||||||
| 			return oldSize != map.size(); | 			return oldSize != map.size(); | ||||||
| 		} | 		} | ||||||
| 		 | 		 | ||||||
| #endif		 | #endif | ||||||
| 		@Override | 		@Override | ||||||
| 		public boolean add(KEY_TYPE e) { throw new UnsupportedOperationException(); } | 		public boolean add(KEY_TYPE e) { throw new UnsupportedOperationException(); } | ||||||
| 		@Override |  | ||||||
| 		public boolean addAndMoveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean addAndMoveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		 |  | ||||||
| 		@Override | 		@Override | ||||||
| 		public BI_ITERATOR KEY_GENERIC_TYPE iterator(KEY_TYPE fromElement) { | 		public BI_ITERATOR KEY_GENERIC_TYPE iterator(KEY_TYPE fromElement) { | ||||||
| 			if(map instanceof RB_TREE_MAP) return ((RB_TREE_MAP KEY_VALUE_GENERIC_TYPE)map).keyIterator(fromElement); | 			if(map instanceof RB_TREE_MAP) return ((RB_TREE_MAP KEY_VALUE_GENERIC_TYPE)map).keyIterator(fromElement); | ||||||
| @ -1601,18 +1579,6 @@ public class RB_TREE_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VALUE_G | |||||||
| 		protected Node KEY_VALUE_GENERIC_TYPE absHighFence() { return (toEnd ? null : (hiInclusive ? map.findHigherNode(hi) : map.findCeilingNode(hi))); } | 		protected Node KEY_VALUE_GENERIC_TYPE absHighFence() { return (toEnd ? null : (hiInclusive ? map.findHigherNode(hi) : map.findCeilingNode(hi))); } | ||||||
| 		protected Node KEY_VALUE_GENERIC_TYPE absLowFence() { return (fromStart ? null : (loInclusive ?  map.findLowerNode(lo) : map.findFloorNode(lo))); } | 		protected Node KEY_VALUE_GENERIC_TYPE absLowFence() { return (fromStart ? null : (loInclusive ?  map.findLowerNode(lo) : map.findFloorNode(lo))); } | ||||||
| 		 | 		 | ||||||
| 		@Override |  | ||||||
| 		public VALUE_TYPE putAndMoveToFirst(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public VALUE_TYPE putAndMoveToLast(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public VALUE_TYPE getAndMoveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public VALUE_TYPE getAndMoveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override | 		@Override | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return map.comparator(); } | 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return map.comparator(); } | ||||||
| 		 | 		 | ||||||
|  | |||||||
| @ -1,6 +1,8 @@ | |||||||
| package speiger.src.collections.PACKAGE.maps.interfaces; | package speiger.src.collections.PACKAGE.maps.interfaces; | ||||||
| 
 | 
 | ||||||
| import speiger.src.collections.PACKAGE.utils.maps.MAPS; | import speiger.src.collections.PACKAGE.utils.maps.MAPS; | ||||||
|  | import speiger.src.collections.objects.collections.ObjectBidirectionalIterator; | ||||||
|  | import speiger.src.collections.objects.sets.ObjectOrderedSet; | ||||||
| /** | /** | ||||||
|  * A Special Map Interface giving Access to some really usefull functions |  * A Special Map Interface giving Access to some really usefull functions | ||||||
|  * The Idea behind this interface is to allow access to functions that give control to the Order of elements. |  * The Idea behind this interface is to allow access to functions that give control to the Order of elements. | ||||||
| @ -98,6 +100,7 @@ public interface ORDERED_MAP KEY_VALUE_GENERIC_TYPE extends MAP KEY_VALUE_GENERI | |||||||
| 	 * @return a new SortedMap that is synchronized | 	 * @return a new SortedMap that is synchronized | ||||||
| 	 * @see MAPS#synchronize | 	 * @see MAPS#synchronize | ||||||
| 	 */ | 	 */ | ||||||
|  | 	@Override | ||||||
| 	public default ORDERED_MAP KEY_VALUE_GENERIC_TYPE synchronize() { return MAPS.synchronize(this); } | 	public default ORDERED_MAP KEY_VALUE_GENERIC_TYPE synchronize() { return MAPS.synchronize(this); } | ||||||
| 	 | 	 | ||||||
| 	/** | 	/** | ||||||
| @ -106,6 +109,7 @@ public interface ORDERED_MAP KEY_VALUE_GENERIC_TYPE extends MAP KEY_VALUE_GENERI | |||||||
| 	 * @return a new SortedMap Wrapper that is synchronized | 	 * @return a new SortedMap Wrapper that is synchronized | ||||||
| 	 * @see MAPS#synchronize | 	 * @see MAPS#synchronize | ||||||
| 	 */ | 	 */ | ||||||
|  | 	@Override | ||||||
| 	public default ORDERED_MAP KEY_VALUE_GENERIC_TYPE synchronize(Object mutex) { return MAPS.synchronize(this, mutex); } | 	public default ORDERED_MAP KEY_VALUE_GENERIC_TYPE synchronize(Object mutex) { return MAPS.synchronize(this, mutex); } | ||||||
| 	 | 	 | ||||||
| 	/** | 	/** | ||||||
| @ -113,5 +117,22 @@ public interface ORDERED_MAP KEY_VALUE_GENERIC_TYPE extends MAP KEY_VALUE_GENERI | |||||||
| 	 * @return a new SortedMap Wrapper that is unmodifiable | 	 * @return a new SortedMap Wrapper that is unmodifiable | ||||||
| 	 * @see MAPS#unmodifiable | 	 * @see MAPS#unmodifiable | ||||||
| 	 */ | 	 */ | ||||||
|  | 	@Override | ||||||
| 	public default ORDERED_MAP KEY_VALUE_GENERIC_TYPE unmodifiable() { return MAPS.unmodifiable(this); } | 	public default ORDERED_MAP KEY_VALUE_GENERIC_TYPE unmodifiable() { return MAPS.unmodifiable(this); } | ||||||
|  | 	 | ||||||
|  | 	/** | ||||||
|  | 	 * Fast Ordered Entry Set that allows for a faster Entry Iterator by recycling the Entry Object and just exchanging 1 internal value | ||||||
|  | 	 * @Type(T) | ||||||
|  | 	 * @ValueType(V) | ||||||
|  | 	 */ | ||||||
|  | 	interface FastOrderedSet KEY_VALUE_GENERIC_TYPE extends MAP.FastEntrySet KEY_VALUE_GENERIC_TYPE, ObjectOrderedSet<MAP.Entry KEY_VALUE_GENERIC_TYPE> { | ||||||
|  | 		@Override | ||||||
|  | 		public ObjectBidirectionalIterator<MAP.Entry KEY_VALUE_GENERIC_TYPE> fastIterator(); | ||||||
|  | 		/** | ||||||
|  | 		 * Fast iterator that recycles the given Entry object to improve speed and reduce object allocation | ||||||
|  | 		 * @param fromElement that is going to be started from. | ||||||
|  | 		 * @return a improved iterator that starts from the desired element | ||||||
|  | 		 */ | ||||||
|  | 		public ObjectBidirectionalIterator<MAP.Entry KEY_VALUE_GENERIC_TYPE> fastIterator(KEY_TYPE fromElement); | ||||||
|  | 	} | ||||||
| } | } | ||||||
| @ -22,71 +22,8 @@ import speiger.src.collections.objects.collections.ObjectBidirectionalIterator; | |||||||
|  * @note ORDERED_MAP is only extended until 0.6.0 for Compat reasons. |  * @note ORDERED_MAP is only extended until 0.6.0 for Compat reasons. | ||||||
|  * The supported classes already implement ORDERED_MAP directly and will remove SORTED_MAP implementations in favor of ORDERED_MAP instead |  * The supported classes already implement ORDERED_MAP directly and will remove SORTED_MAP implementations in favor of ORDERED_MAP instead | ||||||
|  */ |  */ | ||||||
| public interface SORTED_MAP KEY_VALUE_GENERIC_TYPE extends SortedMap<CLASS_TYPE, CLASS_VALUE_TYPE>, ORDERED_MAP KEY_VALUE_GENERIC_TYPE | public interface SORTED_MAP KEY_VALUE_GENERIC_TYPE extends SortedMap<CLASS_TYPE, CLASS_VALUE_TYPE>, MAP KEY_VALUE_GENERIC_TYPE | ||||||
| { | { | ||||||
| 	/** |  | ||||||
| 	 * A customized put method that allows you to insert into the first index. |  | ||||||
| 	 * @param key the key that should be inserted |  | ||||||
| 	 * @param value the value that should be inserted |  | ||||||
| 	 * @return the previous present or default return value |  | ||||||
| 	 * @see java.util.Map#put(Object, Object) |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_MAP#putAndMoveToFirst instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public VALUE_TYPE putAndMoveToFirst(KEY_TYPE key, VALUE_TYPE value); |  | ||||||
| 	/** |  | ||||||
| 	 * A customized put method that allows you to insert into the last index. (This may be nessesary depending on the implementation) |  | ||||||
| 	 * @param key the key that should be inserted |  | ||||||
| 	 * @param value the value that should be inserted |  | ||||||
| 	 * @return the previous present or default return value |  | ||||||
| 	 * @see java.util.Map#put(Object, Object) |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_MAP#putAndMoveToLast instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public VALUE_TYPE putAndMoveToLast(KEY_TYPE key, VALUE_TYPE value); |  | ||||||
| 	 |  | ||||||
| 	/** |  | ||||||
| 	 * A specific move method to move a given key/value to the first index. |  | ||||||
| 	 * @param key that should be moved to the first index |  | ||||||
| 	 * @return true if the value was moved. |  | ||||||
| 	 * @note returns false if the value was not present in the first place |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_MAP#moveToFirst instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public boolean moveToFirst(KEY_TYPE key); |  | ||||||
| 	/** |  | ||||||
| 	 * A specific move method to move a given key/value to the last index. |  | ||||||
| 	 * @param key that should be moved to the first last |  | ||||||
| 	 * @return true if the value was moved. |  | ||||||
| 	 * @note returns false if the value was not present in the first place |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_MAP#moveToLast instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public boolean moveToLast(KEY_TYPE key); |  | ||||||
| 	 |  | ||||||
| 	/** |  | ||||||
| 	 * A Specific get method that allows to move teh given key/value int the first index. |  | ||||||
| 	 * @param key that is searched for |  | ||||||
| 	 * @return the given value for the requested key or default return value |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_MAP#getAndMoveToFirst instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public VALUE_TYPE getAndMoveToFirst(KEY_TYPE key); |  | ||||||
| 	/** |  | ||||||
| 	 * A Specific get method that allows to move teh given key/value int the last index. |  | ||||||
| 	 * @param key that is searched for |  | ||||||
| 	 * @return the given value for the requested key or default return value |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_MAP#getAndMoveToLast instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public VALUE_TYPE getAndMoveToLast(KEY_TYPE key); |  | ||||||
| 	 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator(); | 	public COMPARATOR KEY_GENERIC_TYPE comparator(); | ||||||
| 	 | 	 | ||||||
|  | |||||||
| @ -295,18 +295,6 @@ public class AVL_TREE_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE | |||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| #endif | #endif | ||||||
| 	@Override |  | ||||||
| 	public boolean addAndMoveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public boolean addAndMoveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public boolean moveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public boolean moveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public KEY_TYPE lower(KEY_TYPE e) { | 	public KEY_TYPE lower(KEY_TYPE e) { | ||||||
| 		Entry KEY_GENERIC_TYPE node = findLowerNode(e); | 		Entry KEY_GENERIC_TYPE node = findLowerNode(e); | ||||||
| @ -1203,15 +1191,6 @@ public class AVL_TREE_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE | |||||||
| 			return entry.key; | 			return entry.key; | ||||||
| 		} | 		} | ||||||
| 		 | 		 | ||||||
| 		@Override |  | ||||||
| 		public boolean addAndMoveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean addAndMoveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		 |  | ||||||
| 		@Override | 		@Override | ||||||
| 		public SubSet KEY_GENERIC_TYPE copy() { throw new UnsupportedOperationException(); } | 		public SubSet KEY_GENERIC_TYPE copy() { throw new UnsupportedOperationException(); } | ||||||
| 		 | 		 | ||||||
|  | |||||||
| @ -3,7 +3,6 @@ package speiger.src.collections.PACKAGE.sets; | |||||||
| import java.util.Arrays; | import java.util.Arrays; | ||||||
| import java.util.Collection; | import java.util.Collection; | ||||||
| #if TYPE_OBJECT | #if TYPE_OBJECT | ||||||
| import java.util.Comparator; |  | ||||||
| import java.util.function.Consumer; | import java.util.function.Consumer; | ||||||
| import java.util.function.BiFunction; | import java.util.function.BiFunction; | ||||||
| #endif | #endif | ||||||
| @ -21,7 +20,6 @@ import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUME | |||||||
| import speiger.src.collections.PACKAGE.functions.function.PREDICATE; | import speiger.src.collections.PACKAGE.functions.function.PREDICATE; | ||||||
| import speiger.src.collections.PACKAGE.functions.function.UNARY_OPERATOR; | import speiger.src.collections.PACKAGE.functions.function.UNARY_OPERATOR; | ||||||
| #if !TYPE_OBJECT | #if !TYPE_OBJECT | ||||||
| import speiger.src.collections.PACKAGE.functions.COMPARATOR; |  | ||||||
| import speiger.src.collections.PACKAGE.functions.CONSUMER; | import speiger.src.collections.PACKAGE.functions.CONSUMER; | ||||||
| import speiger.src.collections.objects.utils.ObjectArrays; | import speiger.src.collections.objects.utils.ObjectArrays; | ||||||
| #endif | #endif | ||||||
| @ -36,7 +34,7 @@ import speiger.src.collections.PACKAGE.utils.ARRAYS; | |||||||
|  * This implementation does not shrink the backing array |  * This implementation does not shrink the backing array | ||||||
|  * @Type(T) |  * @Type(T) | ||||||
|  */ |  */ | ||||||
| public class ARRAY_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE implements SORTED_SET KEY_GENERIC_TYPE, ORDERED_SET KEY_GENERIC_TYPE | public class ARRAY_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE implements ORDERED_SET KEY_GENERIC_TYPE | ||||||
| { | { | ||||||
| 	/** The Backing Array */ | 	/** The Backing Array */ | ||||||
| 	protected transient KEY_TYPE[] data; | 	protected transient KEY_TYPE[] data; | ||||||
| @ -510,31 +508,6 @@ public class ARRAY_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE im | |||||||
| 		throw new NoSuchElementException(); | 		throw new NoSuchElementException(); | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	/** |  | ||||||
| 	 * Unsupported for now. Implementation is buggy and does not support the Java Standard with these functions. |  | ||||||
| 	 * It is a Unsorted Sorted Set. Thats why the SubSet implementation will be disabled until a better solution is found. |  | ||||||
| 	 * To give a simple reason: LinkedHashSets are also not SortedSets even so they could be. |  | ||||||
| 	 * @throws UnsupportedOperationException because it is not supported |  | ||||||
| 	 */ |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE subSet(KEY_TYPE fromElement, KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	/** |  | ||||||
| 	 * Unsupported for now. Implementation is buggy and does not support the Java Standard with these functions. |  | ||||||
| 	 * It is a Unsorted Sorted Set. Thats why the SubSet implementation will be disabled until a better solution is found. |  | ||||||
| 	 * To give a simple reason: LinkedHashSets are also not SortedSets even so they could be. |  | ||||||
| 	 * @throws UnsupportedOperationException because it is not supported |  | ||||||
| 	 */ |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE headSet(KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	/** |  | ||||||
| 	 * Unsupported for now. Implementation is buggy and does not support the Java Standard with these functions. |  | ||||||
| 	 * It is a Unsorted Sorted Set. Thats why the SubSet implementation will be disabled until a better solution is found. |  | ||||||
| 	 * To give a simple reason: LinkedHashSets are also not SortedSets even so they could be. |  | ||||||
| 	 * @throws UnsupportedOperationException because it is not supported |  | ||||||
| 	 */ |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE tailSet(KEY_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	public ARRAY_SET KEY_GENERIC_TYPE copy() { | 	public ARRAY_SET KEY_GENERIC_TYPE copy() { | ||||||
| 		ARRAY_SET KEY_GENERIC_TYPE set = new ARRAY_SETBRACES(); | 		ARRAY_SET KEY_GENERIC_TYPE set = new ARRAY_SETBRACES(); | ||||||
| 		set.data = Arrays.copyOf(data, data.length); | 		set.data = Arrays.copyOf(data, data.length); | ||||||
| @ -542,11 +515,6 @@ public class ARRAY_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE im | |||||||
| 		return set; | 		return set; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	@Override |  | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { |  | ||||||
| 		return null; |  | ||||||
| 	} |  | ||||||
| 	 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public void clear() { | 	public void clear() { | ||||||
| 		size = 0; | 		size = 0; | ||||||
|  | |||||||
| @ -1,7 +1,6 @@ | |||||||
| package speiger.src.collections.PACKAGE.sets; | package speiger.src.collections.PACKAGE.sets; | ||||||
| 
 | 
 | ||||||
| #if TYPE_OBJECT | #if TYPE_OBJECT | ||||||
| import java.util.Comparator; |  | ||||||
| import java.util.function.Consumer; | import java.util.function.Consumer; | ||||||
| import java.util.function.BiFunction; | import java.util.function.BiFunction; | ||||||
| #endif | #endif | ||||||
| @ -15,7 +14,6 @@ import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | |||||||
| import speiger.src.collections.PACKAGE.collections.COLLECTION; | import speiger.src.collections.PACKAGE.collections.COLLECTION; | ||||||
| import speiger.src.collections.PACKAGE.collections.ITERATOR; | import speiger.src.collections.PACKAGE.collections.ITERATOR; | ||||||
| #if !TYPE_OBJECT | #if !TYPE_OBJECT | ||||||
| import speiger.src.collections.PACKAGE.functions.COMPARATOR; |  | ||||||
| import speiger.src.collections.PACKAGE.functions.CONSUMER; | import speiger.src.collections.PACKAGE.functions.CONSUMER; | ||||||
| #endif | #endif | ||||||
| import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | ||||||
| @ -34,7 +32,7 @@ import speiger.src.collections.utils.SanityChecks; | |||||||
|  * Extra to that there is a couple quality of life functions provided |  * Extra to that there is a couple quality of life functions provided | ||||||
|  * @Type(T) |  * @Type(T) | ||||||
|  */ |  */ | ||||||
| public class IMMUTABLE_HASH_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE implements SORTED_SET KEY_GENERIC_TYPE | public class IMMUTABLE_HASH_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE implements ORDERED_SET KEY_GENERIC_TYPE | ||||||
| { | { | ||||||
| 	/** The Backing keys array */ | 	/** The Backing keys array */ | ||||||
| 	protected transient KEY_TYPE[] keys; | 	protected transient KEY_TYPE[] keys; | ||||||
| @ -459,18 +457,6 @@ public class IMMUTABLE_HASH_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERI | |||||||
| 		return set; | 		return set; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	@Override |  | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { return null; } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE subSet(KEY_TYPE fromElement, KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE headSet(KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE tailSet(KEY_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public void clear() { throw new UnsupportedOperationException(); } | 	public void clear() { throw new UnsupportedOperationException(); } | ||||||
| 	 | 	 | ||||||
|  | |||||||
| @ -1,7 +1,6 @@ | |||||||
| package speiger.src.collections.PACKAGE.sets; | package speiger.src.collections.PACKAGE.sets; | ||||||
| 
 | 
 | ||||||
| #if TYPE_OBJECT | #if TYPE_OBJECT | ||||||
| import java.util.Comparator; |  | ||||||
| import java.util.function.Consumer; | import java.util.function.Consumer; | ||||||
| import java.util.function.BiFunction; | import java.util.function.BiFunction; | ||||||
| #endif | #endif | ||||||
| @ -16,9 +15,6 @@ import speiger.src.collections.PACKAGE.collections.COLLECTION; | |||||||
| import speiger.src.collections.PACKAGE.collections.ITERATOR; | import speiger.src.collections.PACKAGE.collections.ITERATOR; | ||||||
| #endif | #endif | ||||||
| import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | ||||||
| #if !TYPE_OBJECT |  | ||||||
| import speiger.src.collections.PACKAGE.functions.COMPARATOR; |  | ||||||
| #endif |  | ||||||
| import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | import speiger.src.collections.PACKAGE.lists.LIST_ITERATOR; | ||||||
| #if !TYPE_OBJECT | #if !TYPE_OBJECT | ||||||
| import speiger.src.collections.PACKAGE.utils.ITERATORS; | import speiger.src.collections.PACKAGE.utils.ITERATORS; | ||||||
| @ -37,7 +33,7 @@ import speiger.src.collections.utils.SanityChecks; | |||||||
|  * This implementation of SortedSet does not support SubSet of any kind. It implements the interface due to sortability and first/last access |  * This implementation of SortedSet does not support SubSet of any kind. It implements the interface due to sortability and first/last access | ||||||
|  * @Type(T) |  * @Type(T) | ||||||
|  */ |  */ | ||||||
| public class LINKED_CUSTOM_HASH_SET KEY_GENERIC_TYPE extends CUSTOM_HASH_SET KEY_GENERIC_TYPE implements SORTED_SET KEY_GENERIC_TYPE, ORDERED_SET KEY_GENERIC_TYPE | public class LINKED_CUSTOM_HASH_SET KEY_GENERIC_TYPE extends CUSTOM_HASH_SET KEY_GENERIC_TYPE implements ORDERED_SET KEY_GENERIC_TYPE | ||||||
| { | { | ||||||
| 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | ||||||
| 	protected transient long[] links; | 	protected transient long[] links; | ||||||
| @ -672,18 +668,6 @@ public class LINKED_CUSTOM_HASH_SET KEY_GENERIC_TYPE extends CUSTOM_HASH_SET KEY | |||||||
| 		return set; | 		return set; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	@Override |  | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { return null; } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE subSet(KEY_TYPE fromElement, KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE headSet(KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE tailSet(KEY_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	private class SetIterator implements LIST_ITERATOR KEY_GENERIC_TYPE { | 	private class SetIterator implements LIST_ITERATOR KEY_GENERIC_TYPE { | ||||||
| 		int previous = -1; | 		int previous = -1; | ||||||
| 		int next = -1; | 		int next = -1; | ||||||
|  | |||||||
| @ -1,8 +1,5 @@ | |||||||
| package speiger.src.collections.PACKAGE.sets; | package speiger.src.collections.PACKAGE.sets; | ||||||
| 
 | 
 | ||||||
| #if TYPE_OBJECT |  | ||||||
| import java.util.Comparator; |  | ||||||
| #endif |  | ||||||
| import java.util.Arrays; | import java.util.Arrays; | ||||||
| import java.util.Collection; | import java.util.Collection; | ||||||
| import java.util.Iterator; | import java.util.Iterator; | ||||||
| @ -19,7 +16,6 @@ import speiger.src.collections.PACKAGE.collections.ITERATOR; | |||||||
| #endif | #endif | ||||||
| import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | import speiger.src.collections.PACKAGE.collections.BI_ITERATOR; | ||||||
| #if !TYPE_OBJECT | #if !TYPE_OBJECT | ||||||
| import speiger.src.collections.PACKAGE.functions.COMPARATOR; |  | ||||||
| import speiger.src.collections.PACKAGE.functions.CONSUMER; | import speiger.src.collections.PACKAGE.functions.CONSUMER; | ||||||
| #endif | #endif | ||||||
| import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | import speiger.src.collections.objects.functions.consumer.BI_FROM_OBJECT_CONSUMER; | ||||||
| @ -38,7 +34,7 @@ import speiger.src.collections.utils.SanityChecks; | |||||||
|  * This implementation of SortedSet does not support SubSet of any kind. It implements the interface due to sortability and first/last access |  * This implementation of SortedSet does not support SubSet of any kind. It implements the interface due to sortability and first/last access | ||||||
|  * @Type(T) |  * @Type(T) | ||||||
|  */ |  */ | ||||||
| public class LINKED_HASH_SET KEY_GENERIC_TYPE extends HASH_SET KEY_GENERIC_TYPE implements SORTED_SET KEY_GENERIC_TYPE, ORDERED_SET KEY_GENERIC_TYPE | public class LINKED_HASH_SET KEY_GENERIC_TYPE extends HASH_SET KEY_GENERIC_TYPE implements ORDERED_SET KEY_GENERIC_TYPE | ||||||
| { | { | ||||||
| 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | 	/** The Backing array for links between nodes. Left 32 Bits => Previous Entry, Right 32 Bits => Next Entry */ | ||||||
| 	protected transient long[] links; | 	protected transient long[] links; | ||||||
| @ -643,18 +639,6 @@ public class LINKED_HASH_SET KEY_GENERIC_TYPE extends HASH_SET KEY_GENERIC_TYPE | |||||||
| 		return set; | 		return set; | ||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| 	@Override |  | ||||||
| 	public COMPARATOR KEY_GENERIC_TYPE comparator() { return null; } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE subSet(KEY_TYPE fromElement, KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE headSet(KEY_TYPE toElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public SORTED_SET KEY_GENERIC_TYPE tailSet(KEY_TYPE fromElement) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	private class SetIterator implements LIST_ITERATOR KEY_GENERIC_TYPE { | 	private class SetIterator implements LIST_ITERATOR KEY_GENERIC_TYPE { | ||||||
| 		int previous = -1; | 		int previous = -1; | ||||||
| 		int next = -1; | 		int next = -1; | ||||||
|  | |||||||
| @ -295,18 +295,6 @@ public class RB_TREE_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE | |||||||
| 	} | 	} | ||||||
| 	 | 	 | ||||||
| #endif | #endif | ||||||
| 	@Override |  | ||||||
| 	public boolean addAndMoveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public boolean addAndMoveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public boolean moveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 	 |  | ||||||
| 	@Override |  | ||||||
| 	public boolean moveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 
 |  | ||||||
| 	@Override | 	@Override | ||||||
| 	public KEY_TYPE lower(KEY_TYPE e) { | 	public KEY_TYPE lower(KEY_TYPE e) { | ||||||
| 		Entry KEY_GENERIC_TYPE node = findLowerNode(e); | 		Entry KEY_GENERIC_TYPE node = findLowerNode(e); | ||||||
| @ -1264,15 +1252,6 @@ public class RB_TREE_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE | |||||||
| 			return entry.key; | 			return entry.key; | ||||||
| 		} | 		} | ||||||
| 		 | 		 | ||||||
| 		@Override |  | ||||||
| 		public boolean addAndMoveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean addAndMoveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		public boolean moveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		 |  | ||||||
| 		@Override | 		@Override | ||||||
| 		public SubSet KEY_GENERIC_TYPE copy() { throw new UnsupportedOperationException(); } | 		public SubSet KEY_GENERIC_TYPE copy() { throw new UnsupportedOperationException(); } | ||||||
| 		 | 		 | ||||||
|  | |||||||
| @ -19,51 +19,8 @@ import speiger.src.collections.PACKAGE.utils.SPLIT_ITERATORS; | |||||||
|  * @note ORDERED_SET is only extended until 0.6.0 for Compat reasons. |  * @note ORDERED_SET is only extended until 0.6.0 for Compat reasons. | ||||||
|  * The supported classes already implement ORDERED_SET directly and will remove SORTED_SET implementations in favor of ORDERED_SET instead |  * The supported classes already implement ORDERED_SET directly and will remove SORTED_SET implementations in favor of ORDERED_SET instead | ||||||
|  */ |  */ | ||||||
| public interface SORTED_SET KEY_GENERIC_TYPE extends ORDERED_SET KEY_GENERIC_TYPE, SortedSet<CLASS_TYPE> | public interface SORTED_SET KEY_GENERIC_TYPE extends SET KEY_GENERIC_TYPE, SortedSet<CLASS_TYPE> | ||||||
| { | { | ||||||
| 	 |  | ||||||
| 	/** |  | ||||||
| 	 * A customized add method that allows you to insert into the first index. |  | ||||||
| 	 * @param o the element that should be inserted |  | ||||||
| 	 * @return true if it was added |  | ||||||
| 	 * @see java.util.Set#add(Object) |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_SET#addAndMoveToFirst instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public boolean addAndMoveToFirst(KEY_TYPE o); |  | ||||||
| 	/** |  | ||||||
| 	 * A customized add method that allows you to insert into the last index. |  | ||||||
| 	 * @param o the element that should be inserted |  | ||||||
| 	 * @return true if it was added |  | ||||||
| 	 * @see java.util.Set#add(Object) |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_SET#addAndMoveToLast instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public boolean addAndMoveToLast(KEY_TYPE o); |  | ||||||
| 	 |  | ||||||
| 	/** |  | ||||||
| 	 * A specific move method to move a given key to the first index. |  | ||||||
| 	 * @param o that should be moved to the first index |  | ||||||
| 	 * @return true if the value was moved. |  | ||||||
| 	 * @note returns false if the value was not present in the first place |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_SET#moveToFirst instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public boolean moveToFirst(KEY_TYPE o); |  | ||||||
| 	/** |  | ||||||
| 	 * A specific move method to move a given key to the last index. |  | ||||||
| 	 * @param o that should be moved to the first last |  | ||||||
| 	 * @return true if the value was moved. |  | ||||||
| 	 * @note returns false if the value was not present in the first place |  | ||||||
| 	 * @note some implementations do not support this method |  | ||||||
| 	 * @deprecated use ORDERED_SET#moveToLast instead (removed in 0.6.0) |  | ||||||
| 	 */ |  | ||||||
| 	@Deprecated |  | ||||||
| 	public boolean moveToLast(KEY_TYPE o); |  | ||||||
| 	 |  | ||||||
| 	/** | 	/** | ||||||
| 	 * A Type Specific Comparator method | 	 * A Type Specific Comparator method | ||||||
| 	 * @return the type specific comparator | 	 * @return the type specific comparator | ||||||
|  | |||||||
| @ -360,18 +360,6 @@ public class SETS | |||||||
| 			s = c; | 			s = c; | ||||||
| 		} | 		} | ||||||
| 		 | 		 | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean addAndMoveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean addAndMoveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean moveToLast(KEY_TYPE o) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override | 		@Override | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return s.comparator(); } | 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return s.comparator(); } | ||||||
| 		@Override | 		@Override | ||||||
| @ -556,19 +544,7 @@ public class SETS | |||||||
| 			super(c, mutex); | 			super(c, mutex); | ||||||
| 			s = c; | 			s = c; | ||||||
| 		} | 		} | ||||||
| 
 | 		 | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean addAndMoveToFirst(KEY_TYPE o) { synchronized(mutex) { return s.addAndMoveToFirst(o); } } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean addAndMoveToLast(KEY_TYPE o) { synchronized(mutex) { return s.addAndMoveToLast(o); } } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE o) { synchronized(mutex) { return s.moveToFirst(o); } } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean moveToLast(KEY_TYPE o) { synchronized(mutex) { return s.moveToLast(o); } } |  | ||||||
| 		@Override | 		@Override | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator(){ synchronized(mutex) { return s.comparator(); } } | 		public COMPARATOR KEY_GENERIC_TYPE comparator(){ synchronized(mutex) { return s.comparator(); } } | ||||||
| 		@Override | 		@Override | ||||||
|  | |||||||
| @ -517,24 +517,6 @@ public class MAPS | |||||||
| 			this.map = map; | 			this.map = map; | ||||||
| 		} | 		} | ||||||
| 		 | 		 | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public VALUE_TYPE putAndMoveToFirst(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public VALUE_TYPE putAndMoveToLast(KEY_TYPE key, VALUE_TYPE value) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean moveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public VALUE_TYPE getAndMoveToFirst(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public VALUE_TYPE getAndMoveToLast(KEY_TYPE key) { throw new UnsupportedOperationException(); } |  | ||||||
| 		@Override | 		@Override | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return map.comparator(); } | 		public COMPARATOR KEY_GENERIC_TYPE comparator() { return map.comparator(); } | ||||||
| 		@Override | 		@Override | ||||||
| @ -833,24 +815,6 @@ public class MAPS | |||||||
| 			this.map = map; | 			this.map = map; | ||||||
| 		} | 		} | ||||||
| 		 | 		 | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public VALUE_TYPE putAndMoveToFirst(KEY_TYPE key, VALUE_TYPE value) { synchronized(mutex) { return map.putAndMoveToFirst(key, value); } } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public VALUE_TYPE putAndMoveToLast(KEY_TYPE key, VALUE_TYPE value) { synchronized(mutex) { return map.putAndMoveToLast(key, value); } } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean moveToFirst(KEY_TYPE key) { synchronized(mutex) { return map.moveToFirst(key); } } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public boolean moveToLast(KEY_TYPE key) { synchronized(mutex) { return map.moveToLast(key); } } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public VALUE_TYPE getAndMoveToFirst(KEY_TYPE key) { synchronized(mutex) { return map.getAndMoveToFirst(key); } } |  | ||||||
| 		@Override |  | ||||||
| 		@Deprecated |  | ||||||
| 		public VALUE_TYPE getAndMoveToLast(KEY_TYPE key) { synchronized(mutex) { return map.getAndMoveToLast(key); } } |  | ||||||
| 		@Override | 		@Override | ||||||
| 		public COMPARATOR KEY_GENERIC_TYPE comparator() { synchronized(mutex) { return map.comparator(); } } | 		public COMPARATOR KEY_GENERIC_TYPE comparator() { synchronized(mutex) { return map.comparator(); } } | ||||||
| 		@Override | 		@Override | ||||||
|  | |||||||
		Loading…
	
	
			
			x
			
			
		
	
		Reference in New Issue
	
	Block a user