Fixed small logic error in clearAndTrim (Maps/Sets)
This commit is contained in:
		
							parent
							
								
									29f2b8e305
								
							
						
					
					
						commit
						212f532350
					
				| @ -426,7 +426,7 @@ public class LINKED_CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE extends CUSTOM_HASH_M | |||||||
| 	@Override | 	@Override | ||||||
| 	public void clearAndTrim(int size) { | 	public void clearAndTrim(int size) { | ||||||
| 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | ||||||
| 		if(size >= request) { | 		if(request >= size) { | ||||||
| 			clear(); | 			clear(); | ||||||
| 			return; | 			return; | ||||||
| 		} | 		} | ||||||
|  | |||||||
| @ -535,7 +535,7 @@ public class CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VAL | |||||||
| 	@Override | 	@Override | ||||||
| 	public void clearAndTrim(int size) { | 	public void clearAndTrim(int size) { | ||||||
| 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | ||||||
| 		if(size >= request) { | 		if(request >= size) { | ||||||
| 			clear(); | 			clear(); | ||||||
| 			return; | 			return; | ||||||
| 		} | 		} | ||||||
|  | |||||||
| @ -406,7 +406,7 @@ public class LINKED_HASH_MAP KEY_VALUE_GENERIC_TYPE extends HASH_MAP KEY_VALUE_G | |||||||
| 	@Override | 	@Override | ||||||
| 	public void clearAndTrim(int size) { | 	public void clearAndTrim(int size) { | ||||||
| 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | ||||||
| 		if(size >= request) { | 		if(request >= size) { | ||||||
| 			clear(); | 			clear(); | ||||||
| 			return; | 			return; | ||||||
| 		} | 		} | ||||||
|  | |||||||
| @ -496,7 +496,7 @@ public class HASH_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VALUE_GENE | |||||||
| 	@Override | 	@Override | ||||||
| 	public void clearAndTrim(int size) { | 	public void clearAndTrim(int size) { | ||||||
| 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | ||||||
| 		if(size >= request) { | 		if(request >= size) { | ||||||
| 			clear(); | 			clear(); | ||||||
| 			return; | 			return; | ||||||
| 		} | 		} | ||||||
|  | |||||||
| @ -506,7 +506,7 @@ public class LINKED_CUSTOM_HASH_SET KEY_GENERIC_TYPE extends CUSTOM_HASH_SET KEY | |||||||
| 	@Override | 	@Override | ||||||
| 	public void clearAndTrim(int size) { | 	public void clearAndTrim(int size) { | ||||||
| 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | ||||||
| 		if(size >= request) { | 		if(request >= size) { | ||||||
| 			clear(); | 			clear(); | ||||||
| 			return; | 			return; | ||||||
| 		} | 		} | ||||||
|  | |||||||
| @ -487,7 +487,7 @@ public class LINKED_HASH_SET KEY_GENERIC_TYPE extends HASH_SET KEY_GENERIC_TYPE | |||||||
| 	@Override | 	@Override | ||||||
| 	public void clearAndTrim(int size) { | 	public void clearAndTrim(int size) { | ||||||
| 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | ||||||
| 		if(size >= request) { | 		if(request >= size) { | ||||||
| 			clear(); | 			clear(); | ||||||
| 			return; | 			return; | ||||||
| 		} | 		} | ||||||
|  | |||||||
| @ -355,7 +355,7 @@ public class CUSTOM_HASH_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_T | |||||||
| 	@Override | 	@Override | ||||||
| 	public void clearAndTrim(int size) { | 	public void clearAndTrim(int size) { | ||||||
| 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | ||||||
| 		if(size >= request) { | 		if(request >= size) { | ||||||
| 			clear(); | 			clear(); | ||||||
| 			return; | 			return; | ||||||
| 		} | 		} | ||||||
|  | |||||||
| @ -313,7 +313,7 @@ public class HASH_SET KEY_GENERIC_TYPE extends ABSTRACT_SET KEY_GENERIC_TYPE imp | |||||||
| 	@Override | 	@Override | ||||||
| 	public void clearAndTrim(int size) { | 	public void clearAndTrim(int size) { | ||||||
| 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | 		int request = Math.max(minCapacity, HashUtil.nextPowerOfTwo((int)Math.ceil(size / loadFactor))); | ||||||
| 		if(size >= request) { | 		if(request >= size) { | ||||||
| 			clear(); | 			clear(); | ||||||
| 			return; | 			return; | ||||||
| 		} | 		} | ||||||
|  | |||||||
		Loading…
	
	
			
			x
			
			
		
	
		Reference in New Issue
	
	Block a user