classDiagram


	class Iterable{
		<<interface>>
		default void forEach(Consumer<? super T> action)
		Interator<T> inerator()
		default Spliterator<T> spliterator()
	}

	class Collection{
		<<interface>>
		boolean add(E e)
		boolean addAll(Collection<? extends E> c)
		void clear()
		boolean contains(Object o)
		boolean containsAll(Collection<?> c)
		boolean isEmpty()
		boolean remove(Object o)
		boolean removeAll(Collection<?> c)
		default boolean removeIf(Predicate<? super E> filter)
		int size()
		Object[] toArray()
		<T> T[] toArray(T[] a)
		
	}

	class Map{
		<<interface>>
		V put(K key,V value)
		void putAll(Map<? extends K,? extends V> m)
		V get(Object key)
		default V getOrDefault(Object key, V defaultValue)
		V remove(Object key)
		default boolean remove(Object key, Object value)
		default void forEach(BiConsumer<? super K, ? super V> action)
		boolean isEmpty()
		int size()
		Collection<V> values()
	}


	class SequencedCollection{
		<<interface>>
		default void addFirst(E e)
		default void addLast(E e)
		default E getFirst()
		default E getLast()
		default E removeFirst()
		default E removeLast()
		SequencedCollection<E> reversed()	
	}

	class List{
		<<interface>>
	}

	class Set{
		<<interface>>
	}

	class ArrayList{
	
	}

	class LinkedList{
		
	}

	class HashSet{
		
	}

	class AbstractMap{
		boolean containsKey(Object key)
		boolean containsValue(Object value)
		V get(Object key)
		boolean isEmpty()
		Set<K> keySet()
		Collection<V> values()
		V put(K key,V value)
		void putAll(Map<? extends K,? extends V> m)
		V remove(Object key)
		int size()
		
		
	}

	class HashMap{
		
	}

	Iterable <|-- Collection

	Collection <|-- List
	Iterable <|-- List
	SequencedCollection <|-- List
	List <|.. ArrayList
	List <|.. LinkedList
	Collection <|-- Set
	Iterable <|-- Set
	Set <|.. HashSet

	Map <|.. AbstractMap
	AbstractMap <|.. HashMap